DOI QR코드

DOI QR Code

A Study on Improved Split Algorithms for Moving Object Trajectories in Limited Storage Space

한정된 저장 공간상에서 이동 객체 궤적들에 대한 개선된 분할 알고리즘에 관한 연구

  • 박주현 (부경대학교 컴퓨터공학과) ;
  • 조우현 (부경대학교 컴퓨터공학과)
  • Received : 2010.07.27
  • Accepted : 2010.08.05
  • Published : 2010.09.30

Abstract

With the development of wireless network technology, the location information of a spatiotemporal object which changes their location is used in various application. Each spatiotemporal object has many location information, hence it is inefficient to search all trajectory information of spatiotemporal objects for a range query. In this paper, we propose an efficient method which divides a trajectory and stores its division data on restricted storage space. Using suboptimal split algorithm, an extended split algorithm that minimizes the volume of EMBRs(Extended Minimum Bounding Box) is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy

무선 네트워크 기술의 발달로, 지속적으로 위치가 변화하는 시공간 오브젝트의 위치 정보는 다양한 어플리케이션에서 사용되고 있다. 이런 시공간 오브젝트는 많은 위치 정보를 가지고 있지만 이 오브젝트의 모든 궤적 정보를 저장한다는 것은 비효율적이다. 이것은 저장 매체의 저장 공간은 한정되어 있기 때문이다. 따라서 본 논문에서는 제한된 저장 공간에서 효율적으로 궤적을 분할하는 방법을 제시한다. 개선된 분할 알고리즘을 바탕으로, MBR들의 면적을 최소로 하는 궤적들을 분할하는 k split 알고리즘을 제시한다. 실험의 결과로 제시하는 분할 방법이 다른 알고리즘보다 더 효율적인 것을 알 수 있다.

Keywords

References

  1. D. Pfoser, C. S. Jensen and Y. Tehodoridis, "Novel Approaches to the Indexing of Moving Object Trajectories", Proc of The 26thInternational Conference on Very Large Data Bases, pp. 395-406, 2000
  2. X. Xu. J. Han and W. Lu, "RT-Tree: An Improved R-Tree Indexing Structure for Temporal Spatial Databases", Proc of The International Symposium on Spatial Data Handling, pp. 1040-1049, 1990
  3. Y. Theodoridis, M. Vazirgiannis and T. Sellis, "Spatio-Temporal Indexing for Large Multimedia Application", Proc of The 3rd IEEE International Conference on Multimedia Computing ans Systems, pp. 441-448, 1996
  4. O. Wolfson, S. Chamberlain, S. Dao and L. Jiang, "Location Management in Moving Objects Databases", Proc of The International Workshop in Satellite-Based Information Services, pp. 7-14, 1997
  5. T. Brinkhoff, "Generating Network-Based Moving Objects", Proc of The International Conference on Scientific ans Statistical Database Management, pp. 253-255, 2000
  6. R. Benetis, C. S. Jensen, G. Karciauskas and S. Saltenis, "Nearest Neighbor ans Reverse Nearest Neighbor Queries of Moving Objects", Proc of The International Symposium on Database Technology, pp. 44-53, 2002
  7. D. E. KNUTH, "The Art of Computer Programming , Volum3, Sorting and Searching Second Edition", Addison Wesley Longman
  8. Z. Song and N. Roussopoulos, "SEB-tree: An Approach to Index Continuously Moving Objects", Proc of The 4th International Conference on Mobile Data Management, pp. 340-344, 2003
  9. V. P. Chakka, A. C. Everspaugh and J. M. Patel, "Indexing Large Trajectory Data Sets With SETI", Proc of The 1st Biennial Conference on Innovative Data Systems Research, 2003
  10. S. Prabhakar, Y.Xia, D. V. Kalashnikov, W. G. Aref and S. E. Hanbrusch, "Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous on Computers", IEEE Tracsactions on Computers, pp. 1124-1140, 2002
  11. Y. Tao, D Papadias and J. Sun, "The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predicative Queries", Proc of the 29th International Conferenece on Very Large Databases, pp. 790-801, 2003
  12. M. Hadjieleftheriou, G. Kollios, V. J. Tsotras, D. Gunopulos, Efficient Indexing of Spatiotemporal Objects, Lecture Notes in Computer Science, pp. 251-268
  13. H. Zhu, J. Su, O. Ibarra, "Trajectory Queries and Octagouse in Moving Object Databases", Proc of The ACM International Conference on Information and Knowlege Management, pp. 413-421, 2002
  14. Hyun-Jun Jeon, Ju-Hyun Park, Hee-Suk Park, Woo-Hyun Cho, "An Improved Split Algorithm for Indexing of Moving Object Trajectories" KIPSTD, 16-D, pp. 161-168, 2009 https://doi.org/10.3745/KIPSTD.2009.16-D.2.161