Abstract
Recently, the need for Location-Based Services (LBS) has increased due to the development and widespread use of mobile devices (e.g., PDAs, cellular phones, laptop computers, GPS, and RFID etc). The core technology of LBS is a moving-objects database that stores and manages the positions of moving objects. To search for information quickly, the database needs to contain an index that supports both real-time position tracking and management of large numbers of updates. As a result, the index requires a structure operating in the main memory for real-time processing and requires a technique to migrate part of the index from the main memory to disk storage (or from disk storage to the main memory) to manage large volumes of data. To satisfy these requirements, this paper suggests a unified index scheme unifying the main memory and the disk as well as migration policies for migrating part of the index from the memory to the disk during a restriction in memory space. Migration policy determines a group of nodes, called the migration subtree, and migrates the group as a unit to reduce disk I/O. This method takes advantage of bulk operations and dynamic clustering. The unified index is created by applying various migration policies. This paper measures and compares the performance of the migration policies using experimental evaluation.
This work was supported by the Regional Research Centers Program (Research Center for Logistics Information Technology), granted by the Korean Ministry of Education & Human Resources Development.
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
Beckmann, N., Kriegel, H.P.: The R*-tree: An efficient and robust access method for points and rectangles, In: Proc. of ACM SIGMOD, pp. 331–332 (1990)
Garcia-Molina, H., Salem, K.: Main memory database systems: An overview. IEEE Trans. Knowledge Data Eng. 4(6), 509–516 (1992)
Gawlick, D., Kinkade, D.: Varieties of concurrency control in IMS/VS fast path. IEEE Database Eng. 8(2), 3–10 (1985)
Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. of ACM SIGMOD, pp. 47–54 (1984)
Güting, R., Böhlen, M., Erwig, M., Jensen, C.S., Lorentzos, N., Schneider, M., Vazirgiannis, M.: A foundation for representing and querying moving objects. ACM TODS 25(1), 1–42 (2000)
Lehman, T.J., Carey, M.J.: A study of index structures for main memory management database systems. In: Proc. of VLDB Conference, pp. 294–303 (1986)
Lomet, D., Salzberg, B.: Access methods for multiversion data. In: Proc. of ACM SIGMOD, pp. 315–324 (1989)
Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel approaches in query processing for moving objects. In: Proc. of VLDB Conference, pp. 395–406 (2000)
Seeger, B., Larson, P.A., McFayden, R.: Reading a set of disk pages. In: Proc. of VLDB Conference, pp. 592–603 (1993)
Stonebraker, M.: Managing persistent objects in a multi-level store. In: Proc. of ACM SIGMOD, pp. 2–11 (1991)
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)
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
Park, J., Hong, B., An, K., Jung, J. (2006). A Unified Index for Moving-Objects Databases. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751588_17
Download citation
DOI: https://doi.org/10.1007/11751588_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34072-0
Online ISBN: 978-3-540-34074-4
eBook Packages: Computer ScienceComputer Science (R0)