Abstract
By continuous growing on wireless communication technology and mobile equipments, the need for storing and processing data of moving objects arises in a wide range of location-based applications. In this paper, we propose a new spatio-temporal index structure for moving objects, namely the TPKDB-tree, which supports efficient retrieval of future positions and reduces the update cost. The proposed index structure combines an assistant index structure that directly accesses to the current positions of moving objects with a spatio-temporal index structure that manages the future positions of moving objects. The internal node in our index structure keeps time parameters in order to support the future position retrieval and reduce the update cost. We also propose new update and split methods to improve search performance and space utilization. We, by various experimental evaluations, show that our index structure outperforms the existing index structure.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Guttman, A.: A dynamic index structure for spatial searching. In: Proc. ACM SIGMOD Conference, pp. 47–57 (1984)
Prabhakar, S., Xia, Y., Kalashnikov, D.V., Aref, W.G., Hambrusch, S.E.: Query indexing and velocity constrained indexing: scalable techniques for continuous queries on moving objects. IEEE Transactions on Computers 51(10), 1124–1140 (2002)
Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the Positions of Continuously Moving Objects. In: Proc. ACM SIGMOD Conference, pp. 331–342 (2000)
Robinson, J.T.: The K-D-B Tree: A Search Structure for Large Multidimensional Dynamic Indexes. In: Proc. ACM SIGMOD Conference, pp. 10–18 (1981)
Kwon, D.S., Lee, S.J., Lee, S.H.: Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree. In: Proc. International Conference on Mobile Data Management, pp. 113–120 (2002)
Yuni, X., Prabhakar, S.: Q+Rtree: Efficient Indexing for Moving Object Database. In: Proc. Eighth International Conference on Database Systems for Advanced Applications, pp. 175–182 (2003)
Henrich, A., Six, H.S., Widmayer, P.: The LSD-tree: Spatial Access to Multidimensional Point and Non-point Objects. In: Proc. International Conference on Very Large Data Bases, pp. 45–53 (1989)
Ratko, O., Byunggu, Y.: Implementing KDB-Trees to support High-Dimensional Data. In: Proc. International Database Engineering and Applications Symposium, pp. 58–67 (2001)
Hellerstein, J.M., Naughton, J.F., Pfeffer, A.: Generalized Search Trees for Database Systems. In: Proc. International Conference on Very Large Data Bases, pp. 562–573 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bok, K.S., Seo, D.M., Shin, S.S., Yoo, J.S. (2004). TPKDB-Tree: An Index Structure for Efficient Retrieval of Future Positions of Moving Objects. In: Wang, S., et al. Conceptual Modeling for Advanced Application Domains. ER 2004. Lecture Notes in Computer Science, vol 3289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30466-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-30466-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23722-8
Online ISBN: 978-3-540-30466-1
eBook Packages: Springer Book Archive