Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

Efficient Range Query on Moving Object Trajectories

이동객체궤적에 대한 효율적인 범위질의

  • Park, Young-Hee (Department of Computer Engineering, Pukyoung National University) ;
  • Kim, Gyu-Jae (Department of Computer Engineering, Pukyoung National University) ;
  • Cho, Woo-Hyun (Department of Computer Engineering, Pukyoung National University)
  • Received : 2013.11.21
  • Accepted : 2014.01.20
  • Published : 2014.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

The management and analysis of spatio-temporal and multimedia data is a hot issue in database research because such data types are handled in manny applications. Querying databases of such a content is very important for these applications. This paper addresses algorithms that make index structure by using Douglas-Peucker Algorithm and process range query efficiently on moving objects trajectories. We compare and analyze our algorithms and MBR by experiments. Our algorithms make smaller size of index structure and process more efficiently.

최근 많은 응용프로그램에서 시공간 데이터와 멀티미디어 데이터 등이 사용되고 있다. 그래서 이러한 유형의 데이터들을 효율적으로 관리하고 분석할 수 있는 연구들이 많이 진행 중이다. 본 논문에서는 이동객체궤적에 대하여 단순화 기법을 사용하여 단순화한 후에 색인구조를 생성하고 이 색인구조를 이용하여 범위질의를 효율적으로 처리할 수 있는 알고리즘을 제안한다. 이동객체궤적의 단순화 기법으로는 Douglas-Peucker 알고리즘을 수정하여 이용한다. 제안된 방법과 기존의 최소 경계 사각형(MBR)을 이용한 색인 방법을 실험을 통하여 비교 및 분석한다. 실험 결과로 제안된 방법에서는 색인 데이터 량이 상대적으로 작아지고 색인 및 질의 처리방법이 간단하며 기존의 방법보다 시공간적으로 효율적임을 확인하였다.

Keywords

References

  1. Marios Hadjieleftheriou, George Kollios, Dimitrios Gunopulos, and Vassilis J. Tsotras. "Efficient Indexing of Spatio temporal Objects," in Proceeding of the 8th International Conference on Extending Database Technology, London, pp. 251-268, 2002.
  2. Christian S. Jensen, Dan Lin, and Beng Chin Ooi. "Query and Update Efficient B+-Tree Based Indexing of Moving Objects," in Proceeding of the 30th VLDB Conference, Toronto. Canada, 2004.
  3. Dong Li, Yu-hui Peng, and Jiang-long Yin. "Quadtree and Hash Table Based Index Structure for Indexing the Past, Present and Future Positions of Moving Objects," Computer Science and its Applications. CSA '08. International Symposium on, Hobard, pp. 17-21, 2008.
  4. Elena Braynova. "Indexing Spatio-Temporal Trajectories with Orthogonal Polynomials," in Conference on Data Mining : DMIN, pp. 343-348, 2006.
  5. Jinfeng Ni and Chynya V. Ravishankar, Senior Member, IEEE. "Indexing Spatio-Temporal Trajectories with Efficient Polynomial Approximations," IEEE Transactions on Knowledge and Data Engineering, Vol. 19, No. 5, pp. 663-678, May. 2007. https://doi.org/10.1109/TKDE.2007.1006
  6. D. Douglas and T. Peucker. "Algorithms for the reduction of the number of points required to represent a digitized line or its caricature," Cartographica: The International Journal for Geographic Information and Geovisualization, vol. 10, no. 2, pp. 112-122, December. 1973. https://doi.org/10.3138/FM57-6770-U75U-7727
  7. Hans-Peter Kriegel, Peer Kroger, and Matthias Renz. "Techniques for Efficiently Searching in Spatial, Temporal, Spatio-temporal, and Multimedia Database," in Proceeding of the 14th ICDE, DASFAA'09, Brisbane. Australia, pp. 780-783, 2009.