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
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Window query-optimal clustering of spatial objects
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A cost model for nearest neighbor search in high-dimensional data space
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Advanced database indexing
Modeling high-dimensional index structures using sampling
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Design of Dynamic Data Structures
Design of Dynamic Data Structures
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Performance of Nearest Neighbor Queries in R-Trees
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Generic Approach to Bulk Loading Multidimensional Index Structures
VLDB '97 Proceedings of the 23rd 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
SSDBM '04 Proceedings of the 16th 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
R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)
R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)
Approximate high-dimensional nearest neighbor queries using R-forests
Proceedings of the 17th International Database Engineering & Applications Symposium
Hi-index | 0.00 |
R-tree has been proven to be one of the most practical and well-behaved data structures for accommodating dynamic massive sets of low dimensionality geometric objects and conducting a very diverse set of queries on such data sets in real-world applications. In this paper, we present weighted R-trees-WeR-trees-a new practical and efficient scheme for dynamic manipulation of multi-dimensional data sets, which applies for the first time the technique of partial rebuildings to the case of the R-tree family. Partial rebuildings refer to the method of progressive reconstruction of whole subtrees across update paths in order to keep them in perfect balance from the performance perspective. An analytical investigation is performed, showing amortized bounds for the update operations while detailed experimental results concerning both synthetic and real data sets confirm the applicability of the proposed method and demonstrate its superiority over R^*-trees, the most well-behaved and widely accepted variant of R-trees: node space utilization reaches up to 98.1%, query savings vary between 25% and 50% and even more for skewed data, while the scheme scales up linearly with respect to the number of inserted items.