Self-adjusting binary search trees
Journal of the ACM (JACM)
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
An evaluation of self-adjusting binary search tree techniques
Software—Practice & Experience
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Randomized splay trees: theoretical and experimental results
Information Processing Letters
A Unified Approach for Indexed and Non-Indexed Spatial Joins
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
An Implementation and Performance Analysis of Spatial Data Access Methods
Proceedings of the Fifth International Conference on Data Engineering
Optimal Dynamic Range Searching in Non-replicating Index Structures
ICDT '99 Proceedings of the 7th International Conference on Database Theory
On Optimal Node Splitting for R-trees
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
An Evaluation of Generic Bulk Loading Techniques
Proceedings of the 27th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
GBI: A Generalized R-Tree Bulk-Insertion Strategy
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Self-Organizing Data Structures
Developments from a June 1996 seminar on Online algorithms: the state of the art
Grow and Post Index Trees: Roles, Techniques and Future Potential
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
SSDBM '01 Proceedings of the 13th International Conference on Scientific and Statistical Database Management
The Priority R-tree: a practically efficient and worst-case optimal R-tree
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)
R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
| Hi-index | 0.00 |
In this paper, we generalize the notion of self-adapting one-dimensional index structures to a wide class of spatial index structures. The resulting query responsive index structurescan adapt their structure to the users' query pattern and thus have the potential to improve the response time in practice. We outline two general approaches to providing query responsiveness and present the results in terms of the well-known R驴-tree. Our experiments show that depending on the query pattern significant improvements can be obtained in practice.