Abstract
A number of spatiotemporal access methods such as 3DR-Tree and MV3R-tree have been proposed for timestamp and interval query. These access methods consist of a single index structure covering the entire time span, and thus the performances quickly degrade since the indexed time region gets large as time progresses. To overcome the problem, we propose to employ time-based partitioning on the R-tree called Time-Based Partitioning R-tree (TPR-Tree). Since the structure of the TPR-Tree efficiently fits various queries on two dimensional data, it significantly outperforms other access methods for queries of various timestamps and time intervals. Extensive simulation validates the performance of the proposed scheme.
This research was supported by the Ubiquitous Autonomic Computing and Network Project, 21st Century Frontier R&D Program in Korea and the Brain Korea 21 Project in 2004. Corresponding author: Hee Yong Youn.
Chapter PDF
Similar content being viewed by others
Keywords
References
Nascimento, M.A., Silva, J.R.O.: Towards historical R-Tree. In: Proceesings of the 13th ACM Symposium on Applied Computing (ACM-SAC 1998), pp. 235–240 (1998)
Nascimento, M.A., Silva, J.R.O., Theodoridis, Y.: Evaluation for access Structures for discretely moving points. In: Böhlen, M.H., Jensen, C.S., Scholl, M.O. (eds.) STDBM 1999. LNCS, vol. 1678, pp. 171–188. Springer, Heidelberg (1999)
Tao, Y., Papadias, D.: Mv3R-tree: a spatiotemporal access method for timestamp and intervalqueries. In: Proceedings of the 27th International Conference on Very Large Databases, pp. 431–440 (2001)
Theodoridis, Y., Vazirgiannis, M., Sellis, T.: Spatio-temporal Indexing for Large Multimedia Applications. In: Proceedings of the 3rd IEEE Conference on Multimedia Computing and Systems, Hiroshima, Japan, pp. 441–448 (1996)
Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches to the Indexing of Moving Object Trajectories. In: Proceedings of the 26th International Conference on Very Large Databases, Cairo, Egypt, pp. 395–406 (2000)
frentzos, E.: Indexing object moving on fixed networks. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds.) SSTD 2003. LNCS, vol. 2750, pp. 289–305. Springer, Heidelberg (2003)
Brinkhoff, T.: Generation Network-Based Moving Objects. In: Proceedings of the 12th Int’l Conference on Scientific and Statistical Database Management, SSDBM 2000, Berlin, Germany, pp. 253–255 (2000)
Theodoridis, Y., Silva, J.R.O., Nascimento, M.A.: On the Generation of Spatiotemporal Datasets. In: SSD, pp. 147–164 (1999)
Guttman, A.: R-Tree: A Dynamic Index Structure for Spatial Searching. ACM SIGMOD, 47–57 (1984)
Beckmann, N., Kriegel, H., Schmeider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Point and Rectangles. ACM SIGMOD, 322–331 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jung, Y.C., Youn, H.Y., Kim, U. (2005). Efficient Indexing of Moving Objects Using Time-Based Partitioning with R-Tree. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds) Computational Science – ICCS 2005. ICCS 2005. Lecture Notes in Computer Science, vol 3515. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11428848_74
Download citation
DOI: https://doi.org/10.1007/11428848_74
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26043-1
Online ISBN: 978-3-540-32114-9
eBook Packages: Computer ScienceComputer Science (R0)