Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2009.16-D.2.161

An Improved Split Algorithm for Indexing of Moving Object Trajectories  

Jeon, Hyun-Jun (부경대학교 컴퓨터공학과)
Park, Ju-Hyun (부경대학교 전자컴퓨터정보통신공학부)
Park, Hee-Suk (부경대학교 전자컴퓨터정보통신공학부)
Cho, Woo-Hyun (부경대학교 전자컴퓨터정보통신공학부)
Publication Information
The KIPS Transactions:PartD / v.16D, no.2, 2009 , pp. 161-168 More about this Journal
Abstract
Recently, use of various position base servicesthat collect position information for moving object and utilize in real life is increasing by the development of wireless network technology. Accordingly, new index structures are required to efficiently retrieve the consecutive positions of moving objects. This paper addresses an improved trajectory split algorithm for the purpose of efficiently supporting spatio-temporal range queries using index structures that use Minimum Bounding Rectangles(MBR) as trajectory approximations. We consider volume of Extended Minimum Bounding Rectangles (EMBR) to be determined by average size of range queries. Also, Use a priority queue to speed up our process. This algorithm gives in general sub-optimal solutions with respect to search space. Our improved trajectory split algorithm is going to derive minimizing volume of EMBRs better than previously proposed split algorithm.
Keywords
Trajectory Splitting; Moving Object; Spatiotemporal Indexing; Range Query;
Citations & Related Records
연도 인용수 순위
  • Reference
1 O. Wolfson, S. Chamberlain, S. Dao and L. Jiang, 'Location Management in Moving Objects Databases,' Proc of the International Workshop on Satellite-Based Information Services, pp.7-14, 1997
2 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
3 T. Tzouramanis, M. Vassilakopoulos and Y. Manolopoulos, 'Overlapping linear quadtrees: a spatio-temporal access method,' Proc of the 6th International Symposium on Advances in Geographic Information Systems, pp.1-7, 1998   DOI
4 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   DOI   ScienceOn
5 S. Prabhakar, Y. Xia, D. V. Kalashnikov, W. G. Aref and S. E. Hambrusch, 'Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects,' IEEE Transactions on Computers, pp.1124-1140, 2002   DOI   ScienceOn
6 H. Zhu, J. Su, O. Ibarra, 'Trajectory Queries and Octagons in Moving Object Databases,' Proc of the ACM International Conference on Information and Knowledge Management, pp.413-421, 2002   DOI
7 D. L. Lee, J. Xu, B. Zheng and W. C. Lee, 'Data Management in Location-Dependent Information Services,' IEEE Pervasive Computing, pp.65-72, 2002   DOI   ScienceOn
8 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, pp.40-49, 2003
9 T. Brinkhoff, 'Generating Network-Based Moving Objects,' Proc of the International Conference on Scientific and Statistical Database Management, pp.253-255, 2000   DOI
10 R. Benetis, C. S. Jensen, G. Karciauskas and S. Saltenis, 'Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects,' Proc of the International Symposium on Database Engineering and Applications, pp.44-53, 2002
11 M. Hadjieleftheriou, G. Kollios, D. Gunopulos and V. J. Tsotras, 'Efficient indexing of Spatiotemporal Objects,' Proc of The 8th International Conference on Extending Database Technology, pp.251-268, 2002   DOI   ScienceOn
12 D. E. KNUTH, 'The Art of Computer Programming, Volume 3, Sorting and Searching Second Edition,' Addison Wesley Longman, 1998
13 J. Nievergelt, H. Hinterberger and K. C. Sevcik, 'The Grid File: An Adaptable, Symmetric Multikey File Structure,' ACM Transactions on Database Systems, pp.38-71, 1984   DOI   ScienceOn
14 A. Guttman, 'R-trees: A Dynamic Index Structure for Spatial Searching,' Proc of the ACM International Conference on Management of Data, pp.47-57, 1984   DOI
15 Y. Tao, D. Papadias and J. Sun, 'The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries,' Proc of the 29th International Conference on Very Large Data Bases, pp.790-801, 2003
16 S. Rasetic, J. Sander, J. Elding and M. A. Nascimento, 'A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing,' Proc of The 31st International Conference on Very Large Data Bases. pp.934-945, 2005
17 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
18 Y. Theodoridis, M. Vazirgiannis and T. Sellis, 'Spatio-Temporal Indexing for Large Multimedia Applications,' Proc of the 3rd IEEE International Conference on Multimedia Computing and Systems, pp.441-448, 1996   DOI
19 Y. Theodoridis, R. Silva and M. Nascimento, 'On the Generation of Spatiotemporal Datasets,' Proc of the 6th International Symposium on Spatial Databases, pp.147-164. 1999
20 V. P. Chakka, A. C. Everspaugh and J. M. Patel, 'Indexing Large Trajectory Data Sets With SETI,' Proc ofthe 1st Biennial Conference on Innovative Data Systems Research, 2003
21 S. Saltenis, C. S. Jensen, S. T. Leutenegger and M. A. Lopez, 'Indexing the Positions of Continuously Moving Objects,' Proc of the ACM International Conference on Management of Data, pp.331-342, 2000   DOI   ScienceOn