Moving-objects databases need a spatio-temporal indexing scheme for moving objects to efficiently process queries over continuously changing locations of the objects. A simple extension of the R-tree that employs time as the third dimension of the data universe shows low space utilization and poor search performance because of overlapping index regions. In this paper, we propose a variant of the 3-dimensional R-tree called the Adaptive 3DR-tree. The dynamic splitting policies of the Adaptive 3DR-tree significantly reduce the overlap rate, and this, in turn, results in improved query performance. The results of our extensive experiments show that the Adaptive 3DR-tree outperforms the original 3D R-tree and the TB-tree typically by a big margin. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Jun, B., Hong, B., & Yu, B. (2003). Dynamic splitting policies of the adaptive 3DR-tree for indexing continuously moving objects. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2736, 308–317. https://doi.org/10.1007/978-3-540-45227-0_31
Mendeley helps you to discover research relevant for your work.