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
Multidimensional access methods
ACM Computing Surveys (CSUR)
Indexing support for spatial joins
Data & Knowledge Engineering
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th 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
The S-Tree: An Efficient Index for Multidimensional Objects
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
| Hi-index | 0.00 |
We take another look at the 2DR-tree. In particular, we revisit its node structure, validity rules and the insertion strategy. The 2DR-tree uses 2D nodes so that the relationships between all objects can be maintained. The existing structure has many advantages. However, two limitations include a high tree height and a low space utilization of its nodes. We propose changes to the 2DR-tree structure, validity rules and insertion strategy. Preliminary results show significant improvements in height and space utilization over the existing 2DR-tree.