Browse > Article

Design and Implementation of Unified Index for Moving Objects Databases  

Park Jae-Kwan (부산대학교 컴퓨터공학과)
An Kyung-Hwan (한국전자통신연구원 텔레매틱스 USN연구단)
Jung Ji-Won (삼성전자 정보통신총괄 무선사업부)
Hong Bong-Hee (부산대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Databases / v.33, no.3, 2006 , pp. 271-281 More about this Journal
Abstract
Recently the need for Location-Based Service (LBS) has increased due to the development and widespread use of the mobile devices (e.g., PDAs, cellular phones, labtop 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.
Keywords
GIS; Moving Objects; Spatial Index;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Guting, R., Bohlen, M., Erwig, M., Jensen, C. S., Lorentzos, N., Schneider, M., and Vazirgiannis, M. 'A Foundation for Representing and Querying Moving Objects,' ACM Transactions on Database Systems, Vol. 25, No.1, pp. 1-42. 2000   DOI   ScienceOn
2 Y. Theodoridis, J. R. O Silva and M.A. Nascimento, 'On the Generation of Spatiotemporal Datasets,' Proc. of Symposium on Advances in Spatial Databases, pp. 147-164, 1999
3 H. Garcia-Molina and K. Salem, 'Main memory database systems: An overview,' IEEE Trans. Knowledge Data Eng., Vol. 4, No.6, pp. 509-516, 1992   DOI   ScienceOn
4 D. Gawlick and D. Kinkade, 'Varieties of concurrency control in IMS/VS Fast Path,' IEEE Database Eng., Vol. 8. No.2, pp. 3-10, June 1985
5 D. Pfoser, C. S. Jensen, and Y. Theodoridis, 'Novel Approaches in Query Processing for Moving Objects,' In Proc. of the VLDB Conference, pp. 395-406, 2000
6 N. Beckmann and H. P. Kriegel, 'The R*-tree: An efficient and robust access method for points and rectangles,' Proc. of ACM SIGMOD, pp. 332-331, 1990   DOI
7 B. Seeger, P.A. Larson, and R. McFayden. 'Reading a set of disk pages,' Proc. of VLDB Conference, pp. 592-603, 1993
8 D. Lomet and B. Salzberg, 'Access Methods for Multiversion Data,' Proc. of ACM SIGMOD, pp. 315-324. 1989   DOI
9 M. Stonebraker, 'Managing persistent objects in a multi-level store,' Proc. of ACM SIGMOD, pp. 2-11, 1991   DOI
10 T. J. Lehman and M. J. Carey, 'A Study of Index Structures for Main Memory Management Database Systems,' Proc. of VLDB Conference, pp. 294-303, 1986
11 A. Guttman, 'R-trees: A dynamic index structure for spatial searching,' Proc. of the ACM SIGMOD, pp. 47-54, 1984   DOI