A forced transplant algorithm for dynamic r-tree implementation

Authors:
Mingbo Zhang;Feng Lu;Changxiu Cheng
Affiliations:
State Key Laboratory of Resources and Environmental Information System, Institute of Geographic Sciences and Natural Resources Research, Chinese Academy of Sciences, Beijing, P.R. China;State Key Laboratory of Resources and Environmental Information System, Institute of Geographic Sciences and Natural Resources Research, Chinese Academy of Sciences, Beijing, P.R. China;State Key Laboratory of Resources and Environmental Information System, Institute of Geographic Sciences and Natural Resources Research, Chinese Academy of Sciences, Beijing, P.R. China
Venue:
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Year:
2006

Citing 14
Cited 0

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
On packing R-trees

CIKM '93 Proceedings of the second international conference on Information and knowledge management
Multidimensional access methods

ACM Computing Surveys (CSUR)
A greedy algorithm for bulk loading R-trees

Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Post-optimization and incremental refinement of R-trees

Proceedings of the 7th ACM international symposium on Advances in geographic information systems
Branch grafting method for R-tree implementation

Journal of Systems and Software - Special issue on empirical studies of software development and evolution
Optimizing storage utilization in R-tree dynamic index structure for spatial databases

Journal of Systems and Software
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
STR: A Simple and Efficient Algorithm for R-Tree Packing

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Optimization Issues in R-tree Construction (Extended Abstract)

IGIS '94 Proceedings of the International Workshop on Advanced Information Systems: Geographic Information Systems
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
Hilbert R-tree: An Improved R-tree using Fractals

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
New Linear Node Splitting Algorithm for R-trees

SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Spatial access methods play a crucial role in spatial database management and manipulation. The R-tree and its variations have been widely accepted as some of the most efficient spatial indexing structures in recent years. However, neither considers storage utilization and the global optimization of a R-tree structure. Presented in this paper is a new optimization technique named forced transplant algorithm, which can improve the node storage utilization and optimize the R-tree overall structures at the same time. Our experiments show that the R-tree with our new optimization technique achieves almost 100% storage utilization and excellent query performance for all types of data.