Earticle

초록

영어

This paper addresses an indexing scheme capable of e±- ciently processing range queries in a large-scale trajectory database. Af-ter discussing the drawbacks of previous indexing schemes, we propose a new scheme that divides the temporal dimension into multiple time in-tervals and then, by this interval, builds an index for the line segments.
Additionally, a supplementary index is built for the line segments within each time interval. This scheme can make a dramatic improvement in the performance of insert and search operations using a main memory index, particularly for the time interval consisting of the segments taken by those objects which are currently moving or have just completed their movements, as contrast to the legacy schemes that store the index totally on the disk.

목차

Abstract
 1 Introduction
 2 Related Work
  2.1 SETI
  2.2 Shortcomings of SETI
 3 Proposed indexing scheme
  3.1 Sketch of the proposed indexing method
  3.2 Index architecture
 4 Performance evaluation
  4.1 Experiment setup
  4.2 Results and analyses
 5 Conclusions
 References

저자

• Chang-Il Cha [ College of Information and Communications Hanyang University ]
• Sang-Wook Kim [ College of Information and Communications Hanyang University ]
• Jung-Im Won [ College of Information and Communications Hanyang University ]
• Junghoon Lee [ Department of Computer Science and Statistics Jeju National University ]
• Duck-Ho Bae [ College of Information and Communications Hanyang University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Database Theory and Application

• 간기

  격월간

• pISSN

  2005-4270

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605