VLDB
1994
ACM
13 years 11 months ago
1994
ACM
VLDB
1994
ACM
13 years 11 months ago
1994
ACM
This paper introduces a new data structure, called V-trees, designed to store long sequences of points in 2D space and yet allow efficient access to their fragments. They also opt...
VLDB
1994
ACM
13 years 11 months ago
1994
ACM
Many relational and object-oriented database systems provide referential integrity and compound operations on related objects using relationship mechanisms. Distributed object sys...
VLDB
1994
ACM
13 years 11 months ago
1994
ACM
This paper presents an innovative partitionbased time join strategy for temporal databases where time is represented by time intervals. The proposed method maps time intervals to ...
VLDB
1994
ACM
13 years 11 months ago
1994
ACM
VLDB
1994
ACM
13 years 11 months ago
1994
ACM
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
VLDB
1994
ACM
13 years 11 months ago
1994
ACM
Should digital libraries be based on image or text display? Which will serve users better? Experience and experiments show that users can employ either, and that there are technic...
VLDB
1994
ACM
13 years 11 months ago
1994
ACM
Index structures for multiple sets can be classified into those that group entries according to their key values and those that group entries according to their set membership. Th...
VLDB
1994
ACM
13 years 11 months ago
1994
ACM
VLDB
1994
ACM
13 years 11 months ago
1994
ACM
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...