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

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

A Space Partitioning Based Indexing Scheme Considering, the Mobility of Moving Objects

이동 객체의 이동성을 고려한 공간 분할 색인 기법

  • 복경수 (한국과학기술원 전산학과) ;
  • 유재수 (충북대학교 정보통신공학과)
  • Published : 2006.10.15
Download PDF
⟨ Previous Next ⟩

Abstract

Recently, researches on a future position prediction of moving objects have been progressed as the importance of the future position retrieval increases. New index structures are required to efficiently retrieve the consecutive positions of moving objects. Existing index structures significantly degrade the search performance of the moving objects because the search operation makes the unnecessary extension of the node in the index structure. To solve this problem, we propose a space partition based index structure considering the mobility of moving objects. To deal with the overflow of a node, our index structure first merges it and the sibling node. If it is impossible to merge them, our method splits the overflow node in which moving properties of objects are considered. Our index structure is always partitioned into overlap free subregions when a node is split. Our split strategy chooses the split position by considering the parameters such as velocities, the escape time of the objects, and the update time of a node. In the internal node, the split position Is determined from preventing the cascading split of the child node. We perform various experiments to show that our index structure outperforms the existing index structures in terms of retrieval performance. Our experimental results show that our proposed index structure achieves about $17%{\sim}264%$ performance gains on current position retrieval and about $107%{\sim}19l%$ on future position retrieval over the existing methods.

최근 다양한 응용 분야에서 이동 객체의 현재 위치를 기반으로 미래 위치를 검색하기 위한 필요성이 증가되고 있다. 이와 함께, 대용량의 이동 객체를 빠르게 검색하기 위한 색인 구조의 필요성이 증가되고 있다. 기존에 제안된 색인 구조들은 이동 객체의 위치를 검색하는 과정에서 불필요한 노드의 확장을 유발시켜 검색 성능이 저하되는 문제점이 있다. 이러한 문제점을 해결하기 위해 본 논문에서는 객체의 이동성을 고려한 공간 분할 방식의 색인 구조를 제안한다. 제안하는 색인 구조는 노드의 오버플로우를 처리하기 위해 형제 노드와 병합 분할을 수행하고 형제 노드와 병합을 수행하여 오버플로우를 처리할 수 없을 경우에는 이동성을 고려하여 분할을 수행한다. 제안하는 색인 구조는 분할된 영역들 사이에 겹침 영역이 발생하지 않으며 속도, 이동 객체가 노드의 영역을 벗어나는 시간, 노드의 갱신 시간과 같은 파라미터를 고려하여 분할 위치를 판별한다. 중간 노드에서는 공간 분할 방식의 색인 구조에서 발생하는 연속 분할을 방지하기 위한 분할 위치를 판별한다. 제안하는 색인 구조의 우수성을 입증하기 위해 이동 객체에 대한 검색 성능을 비교 분석한다. 성능 평가 결과 제안하는 색인 구조는 현재 위치 검색에 대해서는 $17%{\sim}264%$ 그리고 미래 위치 검색에 대해서는 $107%{\sim}19l%$ 성능 향상을 나타낸다.

Keywords

References

  1. D. L. Lee, J. Xu, B. Zheng and W. C. Lee, 'Data Management in Location-Dependent Information Services,' IEEE Pervasive Computing, Vol. 1, No. 3, pp.65-72, 2002 https://doi.org/10.1109/MPRV.2002.1037724
  2. M. F. Mokbel, T. M. Ghanem and W. G. Aref, 'Spatio-Temporal Access Methods,' Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, Vol.26, No.2, pp.40-49, 2003
  3. D. Pfoser, C. Jensen and Y. Tehodoridis, 'Novel Approaches to the Indexing of Moving Object Trajectories,' Proc. the 26th International Conference on Very Large Data Bases. pp.395-406, 2000
  4. Z. Song and N. Roussopoulos, 'SEB-tree : An Approach to Index Continuously Moving Objects,' Proc. the 4th International Conference on Mobile Data Management, pp.340-344, 2003
  5. S. Saltenis, C. S. Jensen, S. T. Leutenegger and M. A. Lopez, 'Indexing the Positions of Continuously Moving Objects,' Proc. the 2000 ACM SIGMOD International Conference on Management of Data, pp.331-342, 2000 https://doi.org/10.1145/342009.335427
  6. P. K. Agarwal, L. Arge and J. Erickson, 'Indexing Moving Points,' Journal of Computer and System Sciences, Vol.66, No.1, pp.207-243, 2003 https://doi.org/10.1016/S0022-0000(02)00035-1
  7. D. Papadopoulos, G. Kollios, D. Gunopulos and V. J. Tsotras, 'Indexing Mobile Objects on the Plane,' Proc. the 13th International Workshop on Database and Expert Systems Applications, pp.693-697, 2002
  8. S. Prabhakar, Y. Xia, D. V. Kalashnikov, W. G. Aref and S. E. Harnbrusch, 'Query Indexing and Velocity Constrained Indexing : Scalable Techniques for Continuous Queries on Moving Objects,' IEEE Transactions on Computers, Vol.51 , No. 10, pp.l124-1140, 2002 https://doi.org/10.1109/TC.2002.1039840
  9. Y. Tao, D. Papadias and J. Sun, 'The TPR-Tree : An Optimized Spatio-Temporal Access Method for Predictive Queries,' Proc. the 29th International Conference on Very Large Data Bases, pp.790-801, 2003
  10. C. M. Procopiuc, P. K. Agarwal and S. H. Peled, 'STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects,' Proc. the 4th International Workshop on Algorithm Engineering and Experiments, pp.178-193, 2002
  11. B. C. Ooi, K. L. Tan and C. Yu, 'Frequent Update and Efficient Retrieval: an Oxymoron on Moving Object Indexes',' Proc, the 3rd International Conference on Web Information Systems Engineering Workshops, pp.3-12, 2002 https://doi.org/10.1109/WISEW.2002.1177841
  12. Y. Theodoridis, R. Silva and T. Sellis, 'SpatioTemporal Indexing for Large Multimedia Applications,' Proc. the 3rd IEEE International Conference on Multimedia Computing and Systems, pp.441-448. 1996 https://doi.org/10.1109/MMCS.1996.535011
  13. M. A. Nascimento and J. R. O. Silva, 'Towards Historical R-trees,' Proc. ACM symposium on Applied Computing, pp.235-240, 1998 https://doi.org/10.1145/330560.330692
  14. Y. Tao ana D. Papadias, 'Efficient Historical R-trees,' Proc. IEEE International Conference on Scientific and Statistical Database Management, pp.223-232, 2001 https://doi.org/10.1109/SSDM.2001.938554
  15. Y. Tao and D. Papadias, 'MV3R-Tree : A Spatio-Temporal Access Method for Timestamp and Interval Queries,' Proc. 27th International Conference on Very Large Data Bases, pp.431-440, 2001
  16. V. Prasad Chakka, A. Everspaugh, J. M. Patel, 'Indexing Large Trajectory Data Sets With SETI,' Proc. the First Biennial Conference on Innovative Data Systems Research, 2003
  17. D. Kwon, S. Lee, W. Choi, S. Lee, 'Adaptive Multi-level Hashing for Moving Objects,' Proc, International Conference on Database Systems for Advanced Applications, pp.920-925, 2005 https://doi.org/10.1007/11408079_85
  18. X. Wang, Q. Zhang, W. Sun, 'GTree: An Efficient Grid-Based Index for Moving Objects,' Proc, International Conference on Database Systems for Advanced Applications, pp.914-919, 2005 https://doi.org/10.1007/11408079_84
  19. A. Henrich, 'A Hybrid Split Strategy for k-d-Tree Based Access Structures,' Proc. the fourth ACM workshop on Advances on Advances in Geographic Information Systems, pp.1-8, 1996 https://doi.org/10.1145/258319.258323
  20. A. Henrich, 'The LSDh-Tree : An Access Structure for Feature Vectors,' Proc, the Fourteenth International Conference on Data Engineering, pp.362-369, 1995
  21. R. Orlanclic and B. Yu, 'Implementing KDB-Trees to Support High-Dimensional Data,' Proc. the International Database Engineering and Applications Symposium, pp.58-67, 2001 https://doi.org/10.1109/IDEAS.2001.938071
  22. Y. Theodoridis, R. Silva and M. Nascimento, 'On the Generation of Spatiotemporal Datasets,' Proc. the 6th International Symposium on Spatial Databases, pp.147-164. 1999