한국정보과학회논문지:데이타베이스 (Journal of KIISE:Databases)

한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지

TPKDB 트리 : 이동 객체의 효과적인 미래 위치 검색을 위한 색인구조

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

  • 서동민 (충북대학교 정보통신공학과) ;
  • 복경수 (충북대학교 정보통신공학과) ;
  • 유재수 (충북대학교 전기전자컴퓨터공학부) ;
  • 이병엽 (배재대학교 전자상거래학부)
  • 발행 : 2004.12.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

최근 위치 기반 기술에 대한 활용이 증가하면서 이동 객체를 효율적으로 관리하기 위한 색인구조의 필요성이 증가하고 있다. 본 논문에서는 미래 위치 검색 및 갱신 비용을 최소화하기 위한 새로운 시공간 색인 구조를 제안한다. 제안하는 색인 구조는 갱신 비용을 최소화하기 위해 이동 객체의 현재 위치를 직접 접근하기 위한 보조 색인 구조와 공간 분할 기반의 KDB-트리를 결합한 색인 구조이다. 제안하는 색인 구조에서는 이동 객체의 미래 위치 검색 및 갱신 비용을 줄이기 위해 KDB-트리의 중간 노드에 시간에 대한 파라미터를 유지한다. 또한 제안하는 색인 구조에서는 공간활용도 및 검색 효율을 극대화하기 위한 새로운 갱신 및 분할 기법을 제안한다. 제안하는 색인 구조의 우수성을 입증하기 위해 다양한 실험을 통해 성능 평가를 수행한다.

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.

키워드

참고문헌

  1. 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 https://doi.org/10.1109/DASFAA.2003.1192382
  2. A. Guttman, 'R-trees : A dynamic index structure for spatial searching,' Proc. ACM SIGMOD Conference, pp. 47-57, 1984 https://doi.org/10.1145/602259.602266
  3. 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 https://doi.org/10.1109/MDM.2002.994387
  4. 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 https://doi.org/10.1109/TC.2002.1039840
  5. 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 https://doi.org/10.1145/342009.335427
  6. 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 https://doi.org/10.1145/602259.602266
  7. 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 https://doi.org/10.1109/DASFAA.2003.1192381
  8. O. Ratko and Y. Byunggu, 'Implementing KDB-Trees to support High-Dimensional Data,' Proc. International Database Engineering and Applications Symposium, pp. 58-67, 2001 https://doi.org/10.1109/IDEAS.2001.938071
  9. 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
  10. 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
  11. 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
  12. 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
  13. 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 https://doi.org/10.1145/376868.376899
  14. 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
  15. 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 https://doi.org/10.1109/WISEW.2002.1177841
  16. 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