294 search results - page 30 / 59 » Efficiently Processing Queries on Interval-and-Value Tuples ... |
269
click to vote
ICDE
2005
IEEE
16 years 7 months ago
2005
IEEE
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
194
click to vote
CACM
1998
15 years 5 months ago
1998
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
223
click to vote
DASFAA
2004
IEEE
15 years 9 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
142
click to vote
SIGMOD
1996
ACM
15 years 10 months ago
1996
ACM
The constructionof high-performance databasesystems that combine the best aspects of the relational and object-oriented approaches requires the design of client-server architectur...
188
click to vote
JIIS
2006
15 years 6 months ago
2006
A join of two relations in real databases is usually much smaller than their cartesian product. This means that most of the combinations of tuples in the crossproduct of the respe...