Browse > Article

TPKDB-tree : An Index Structure for Efficient Retrieval of Future Positions of Moving Objects  

Seo Dong Min (충북대학교 정보통신공학과)
Bok Kyoung Soo (충북대학교 정보통신공학과)
Yoo Jae Soo (충북대학교 전기전자컴퓨터공학부)
Lee Byoung Yup (배재대학교 전자상거래학부)
Publication Information
Journal of KIISE:Databases / v.31, no.6, 2004 , pp. 624-640 More about this Journal
Abstract
Recently, with the rapid development of location-based techniques, index structures to efficiently manage moving objects have been required. In this paper, we propose a new spatio-temporal index structure that supports a future position retrieval and minimizes a update cost. The proposed index structure combines an assistant index structure that directly accesses current positions of moving objects with KDB-tree that is a space partitioning access method. The internal node in our proposed index structure keeps time parameters in order to support the future position retrieval and to minimize a update cost. Moreover, we propose new update and split methods to maximize the space utilization and the search performance. We perform various experiments to show that our proposed index structure outperforms the existing index structure.
Keywords
KDB-tree; Moving Object Indexing; Future Position;
Citations & Related Records
연도 인용수 순위
  • Reference
1 X. Yuni and S. Prabhakar, 'Q+Rtree : Efficient Indexing for Moving Object Database,' Proc. Eighth International Conference on Database Systems for Advanced Applications, pp. 175-182, 2003   DOI
2 R. Ding, X. Meng, and Y. Bai, 'Efficient index update for moving objects with future trajectories,' Proc. Eighth International Conference on Database Systems for Advanced Applications, pp.183-194, 2003   DOI
3 C. Procopiuc, P. Agarwal, and S. Har-Peled, 'STAR-Tree : An Efficient Self-Adjusting Index for Moving Objects,' 4th International Workshop of Algorithm Engineering and Experimentation, pp. 178-194, 2002
4 B. C. Ooi, K. L. Tan, and C. Yu, 'Frequent Update and Efficient Retrieval : an Oxymoron on Moving Object Indexes?,' Proc. 3rd International Conference on Web Information Systems Engineering Workshops, pp. 3-12, 2002   DOI
5 J. Basch, L. J. Guibas, and J. Hershberger, 'Data Structures for Mobile Data,' Proc. Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 747-756, 1997
6 M. L. Lee, W. Hsu, C. S. Jensen, B. Cui, and K. L. Kenglik, 'Supporting Frequent Updates in R-Trees : A Bottom-Up Approach,' Proc. 29th International Conference on Very Large Data Bases, pp. 608-619, 2003
7 J. M. Hellerstein, J. F. Naughton, and A. Pfeffer, 'Generalized Search Trees for Database Systems,' Proc. International Conference on Very Large Data Bases, pp. 562-573, 1995
8 N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger, 'The R*-tree : An Efficient and Robust Access Method for Points and Rectangles,' Proc. ACM SIGMOD Conference, pp. 322-331, 1990
9 H. Chon, D. Agrawal, and A. Abbadi, 'Using Space-Time Grid for Efficient Management of Moving Objects,' Proc. International ACM Workshop on Data Engineering for Wireless and Mobile Access, pp. 59-65, 2001   DOI
10 A. Guttman, 'R-Trees: A Dynamic Index Structure for Spatial Searching,' In Proceedings of ACM SIGMOD International Conference on Management of Data, pp.47-57, Jun., 1984   DOI
11 O. Ratko and Y. Byunggu, 'Implementing KDB-Trees to support High-Dimensional Data,' Proc. International Database Engineering and Applications Symposium, pp. 58-67, 2001   DOI
12 S. Prabhakar, Y. Xia, D. V. Kalashnikov, W. G. Aref, and S. E. Hambrusch, 'Query indexing and velocity constrained indexing : scalable techniques for continuous queries on moving objects,' IEEE Transactions on Computers, Vol.51, No.10, pp.1124-1140, 2002   DOI   ScienceOn
13 A. Henrich, H. S. Six, and P. Widmayer, 'The LSD-tree : Spatial Access to Multidimensional Point and Non-point Objects,' Proc. International Conference on Very Large Data Bases, pp. 45-53, 1989
14 A. Guttman, 'R-trees : A dynamic index structure for spatial searching,' Proc. ACM SIGMOD Conference, pp. 47-57, 1984   DOI
15 D. S. Kwon, S. J. Lee, and S. H. Lee, 'Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree,' Proc. International Conference on Mobile Data Management, pp.113-120, 2002   DOI
16 S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez, 'Indexing the Positions of Continuously Moving Objects,' Proc. ACM SIGMOD Conference, pp.331-342, 2000   DOI