Browse > Article
http://dx.doi.org/10.6109/jkiice.2008.12.9.1584

A Filtering Method of Trajectory Query for Efficient Process of Combined Query  

Ban, Chae-Hoon (고신대학교 인터넷비즈니스학과)
Kim, Jong-Min (고신대학교 인터넷비즈니스학과)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.12, no.9, 2008 , pp. 1584-1590 More about this Journal
Abstract
The combined query which consists of the region and trajectory query finds trajectories of moving objects which locate in a certain region. The trajectory query is very informant factor to determine query performance because it processes a point query continuously to find predecessors. This results in bad performance due to revisiting nodes in an index. This paper suggests an efficient method for the combined query based on the 3-dimensional R-tree which has good performance of the region query. The basic idea is that we define the least common search line which enables to search single path and a filtering method based on prediction without revisiting nodes.
Keywords
moving objects; 3D R-tree; combined query; trajectory;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Pfoser, C.S. Jensen, and Y. Theodoridis, "Novel Approaches in Query Processing for Moving Objects", In Proc. of the VLDB Conference, p395-406, 2000
2 M.J. Egenhofer, and J.Herring, "Categorizing Binary Topological Relationship Between Regions, Lines and Points in Geographic Databases", Technical Report, Department of Surveying Engineering, University of Maine, 1991
3 조형주, 정진완, "시공간 질의를 위한 인덱싱 기법", 한국정보과학회 한국데이터베이스 학술대회 논문집, 제18권 2호, p93-100, 2002
4 Y. Theoderidis, M. Vazirgiannis, T. Sellis, "Spatio- temporal indexing for large multimedia applications", In Proc. Multimedia Computing and Systems, p441-448, 1996
5 D. Pfoser, Y. Theodoridis, and C.S. Jensen, "Indexing Trajectories in Query Processing fir Moving Objects", Chorochronos Technical Report, CH-99-3, 1999
6 E. Clementini, and P. Di Felice, "A Comparison of Methods for Representing Topological Relationships", Information Sciences 80, p1-34, 1994   DOI   ScienceOn