Abstract
In moving object databases, existing disk-based indexes are unable to keep up with the high update rate while providing speedy retrieval at the same time. However, efficient management of moving-object database can be achieved through aggressive use of main memory. In this paper, we propose an Integrated Memory Partitioning and Activity Conscious Twin-index (IMPACT) framework where the moving object database is indexed by a pair of indexes based on the properties of the objects’ movement – a main-memory structure manages active objects while a disk-based index handles inactive objects. As objects become active (or inactive), they dynamically migrate from one structure to the other. Moreover, the main memory is also organized into two partitions – one for the main memory index, and the other as buffers for the frequently accessed nodes of the disk-based index. Our experimental study shows that the IMPACT framework provides superior performance.
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.
References
Chon, H.D., Agrawal, D., El Abbadi, A.: Query processing for moving objects with space-time grid storage model. In: Proc. MDM, pp. 121–128 (2002)
Cui, B., Lin, D., Tan, K.L.: Towards optimal utilization of memory for moving object indexing. Technical Report, National University of Singapore (2004)
Goh, C.H., Ooi, B.C., Sim, D., Tan, K.L.: GHOST: Fine granularity buffering of index. In: Proc. VLDB, pp. 339–350 (1999)
Jensen, C.S., Lin, D., Ooi, B.C.: Query and update efficient B+-Tree based indexing of moving objects. In: Proc. VLDB (2004)
Kaufman, J., Myllymaki, J., Jackson, J.: City Simulator spatial data generator (2001), http://alphaworks.ibm.com/tech/citysimulator
Kwon, D., Lee, S.J., Lee, S.H.: Index the current positions of moving objects using the lazy update R-tree. In: MDM, pp. 113–120 (2002)
Lee, M.L., Hsu, W., Jensen, C.S., Cui, B., Teo, K.L.: Supporting frequent updates in R-Trees: A bottom-up approach. In: Proc. VLDB, pp. 608–619 (2003)
Patel, J.M., Chen, Y., Chakka, V.P.: Stripes: An efficient index for predicted trajectories. In: Proc. ACM SIGMOD, pp. 637–646 (2004)
Sacco, G.M.: Index access with a finite buffer. In: Proc. VLDB, pp. 301–309 (1987)
Saltenis, S., Jensen, C.S., Leutenegger, S.T., Iopez, M.A.: lopez. Indexing the positions of continuouslu moving objects. In: Proc. ACM SIGMOD, pp. 331–342 (2000)
Song, Z., Roussopoulos, N.: Hashing moving objects. In: Tan, K.-L., Franklin, M.J., Lui, J.C.-S. (eds.) MDM 2001. LNCS, vol. 1987, pp. 161–172. Springer, Heidelberg (2000)
Tao, Y., Papadias, D., Sun, J.: The TPR*-Tree: An optimized spatio-temporal access method for predictive queries. In: Proc. VLDB, pp. 790–801 (2003)
Xia, Y., Prabhakar, S.: Q+Rtree: Efficient indexing for moving object databases. In: Proc. DASFAA, pp. 175–182 (2003)
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
Cui, B., Lin, D., Tan, KL. (2005). Towards Optimal Utilization of Main Memory for Moving Object Indexing. In: Zhou, L., Ooi, B.C., Meng, X. (eds) Database Systems for Advanced Applications. DASFAA 2005. Lecture Notes in Computer Science, vol 3453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11408079_56
Download citation
DOI: https://doi.org/10.1007/11408079_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25334-1
Online ISBN: 978-3-540-32005-0
eBook Packages: Computer ScienceComputer Science (R0)