Sciweavers

63 search results - page 8 / 13
» Exploiting Common Subexpressions for Cloud Query Processing
Sort
View
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 23 days ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
GIS
2010
ACM
13 years 6 months ago
Querying the future of spatio-temporal objects
Since navigation systems and tracking devices are becoming ubiquitous in our daily life, the development of efficient methods for processing massive sets of mobile objects are of ...
Philip Schmiegelt, Bernhard Seeger
MTSR
2007
Springer
14 years 2 months ago
Creating and Querying an Integrated Ontology for Molecular and Phenotypic Cereals Data
In this paper we describe the development of an ontology of molecular and phenotypic cereals data, realized by integrating existing public web databases with the database developed...
Sonia Bergamaschi, Antonio Sala 0002
CIKM
2006
Springer
13 years 11 months ago
Improving query I/O performance by permuting and refining block request sequences
The I/O performance of query processing can be improved using two complementary approaches. One can try to improve on the buffer and the file system management policies of the DB ...
Xiaoyu Wang, Mitch Cherniack
OTM
2010
Springer
13 years 5 months ago
On the Expressiveness and Trade-Offs of Large Scale Tuple Stores
Massive-scale distributed computing is a challenge at our doorstep. The current exponential growth of data calls for massive-scale capabilities of storage and processing. This is b...
Ricardo Vilaça, Francisco Cruz, Rui Carlos ...