Abstract
Indexing methods that manage current states of moving objects in a database are confronted with keeping their indexes up to date. Numerous objects that move continuously can invoke many their updates at a time constantly. R-tree based indexing methods promise to be efficient and easy to be implemented and deployed to real applications. Nevertheless, recent updating improvements for R-tree have been not either designed or appropriate to a moving object environment. Therefore, in this paper, we propose a ONCE-Updating approach applied for indexing methods developed from the R-tree. The idea is that instead of incurring the high cost of updating an indexed data on many new states at a timestamp one by one, an indexing method can easily update the data on all the states just once. In our experiments, in addition to much improving update performance, the approach even increases quality of queries extracted from indexed data. This approach can be used to support methods managing data from traffic surveillance systems.
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
Lee, E.J., Ryu, K.H., Nam, K.W.: Indexing for Efficient Managing Current and Past Trajectory of Moving Object, Apweb, Hangzhou, pp. 781–787 (2004)
Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proc. ACM SIGMOD, June 2005, pp. 47–57 (1984)
Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the Positions of Continuously Moving Objects. In: Proceedings of SIGMOD (2000)
Choubey, R., Chen, L., Rundensteiner, E.A.: GBI: A Generalized R-Tree Bulk-Insertion Strategy. In: Güting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol. 1651, pp. 91–108. Springer, Heidelberg (1999)
Lee, T., Moon, B., Lee, S.: Bulk Insertion for R-tree by Seeded Clustering. In: Mařík, V., Štěpánková, O., Retschitzegger, W. (eds.) DEXA 2003. LNCS, vol. 2736, pp. 129–138. Springer, Heidelberg (2003)
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method For Points and Rectangles. In: Proc. ACM-SIGMOD International Conference on Management of Data, Atlantic City, May 1990, pp. 322–331 (1990)
Tung, H.D.T., Jung, Y.J., Lee, E.J., Ryu, K.H.: Moving Point Indexing for Future Location Query. In: Wang, S., Tanaka, K., Zhou, S., Ling, T.-W., Guan, J., Yang, D.-q., Grandi, F., Mangina, E.E., Song, I.-Y., Mayr, H.C. (eds.) ER Workshops 2004. LNCS, vol. 3289, pp. 79–90. Springer, Heidelberg (2004)
Jung, Y.J., Lee, E.J., Ryu, K.H.: MP-tree: An Index Approach for Moving Objects in Mobile Environment. In: ASGIS, pp. 104–111 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Do Thanh Tung, H., Ryu, K.H. (2006). A ONCE-Updating Approach on Moving Objects. In: Roddick, J.F., et al. Advances in Conceptual Modeling - Theory and Practice. ER 2006. Lecture Notes in Computer Science, vol 4231. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11908883_17
Download citation
DOI: https://doi.org/10.1007/11908883_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47703-7
Online ISBN: 978-3-540-47704-4
eBook Packages: Computer ScienceComputer Science (R0)