Abstract
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 overlap** 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of ACM SIGMOD Conference, pp. 47–54 (1984)
Theodoridis, Y., Vazirgiannis, M., Sellis, T.K.: Spatio-Temporal Indexing for Large Multimedia Applications. In: IEEE International Conference on Multimedia Computing and Systems, pp. 441–448 (1996)
Nascimento, M.A., Silva, J.R.O.: Towards historical R-trees. In: ACM symposium on Applied Computing, pp. 235–240 (1998)
Tao, Y., Papadias, D.: MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries. In: Proceedings of the VLDB Conference, pp. 431–440 (2001)
Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches in Query Processing for Moving Objects. In: Proceedings of the VLDB Conference, pp. 395–406 (2000)
Beckmann, N., Kriegel, H.P.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proceedings of ACM SIGMOD Conference, pp. 332–331 (1990)
Pfoser, D., Theodoridis, Y., Jensen, C.S.: Indexing Trajectories in Query Processing for Moving Objects, Chorochronos Technical Report, CH-99-3 (1999)
Theodoridis, Y., Silva, J.R.O., Nascimento, M.A.: On the Generation of Spatiotemporal Datasets. In: Güting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol. 1651, pp. 147–164. Springer, Heidelberg (1999)
Sellis, T.K., Roussopoulos, N., Faloutsos, C.: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. In: Proceedings of the VLDB Conference, pp. 507–518 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jun, B., Hong, B., Yu, B. (2003). Dynamic Splitting Policies of the Adaptive 3DR-Tree for Indexing Continuously Moving Objects. In: MaÅ™Ãk, V., Retschitzegger, W., Å tÄ›pánková, O. (eds) Database and Expert Systems Applications. DEXA 2003. Lecture Notes in Computer Science, vol 2736. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45227-0_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-45227-0_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40806-2
Online ISBN: 978-3-540-45227-0
eBook Packages: Springer Book Archive