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

A Study on Improved Split Algorithms for Moving Object Trajectories in Limited Storage Space  

Park, Ju-Hyun (부경대학교 컴퓨터공학과)
Cho, Woo-Hyun (부경대학교 컴퓨터공학과)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.14, no.9, 2010 , pp. 2057-2064 More about this Journal
Abstract
With the development of wireless network technology, the location information of a spatiotemporal object which changes their location is used in various application. Each spatiotemporal object has many location information, hence it is inefficient to search all trajectory information of spatiotemporal objects for a range query. In this paper, we propose an efficient method which divides a trajectory and stores its division data on restricted storage space. Using suboptimal split algorithm, an extended split algorithm that minimizes the volume of EMBRs(Extended Minimum Bounding Box) is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy
Keywords
Trajectory Splitting; Moving Object; Spatiotemporal Indexing; Rang Query;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 M. Hadjieleftheriou, G. Kollios, V. J. Tsotras, D. Gunopulos, Efficient Indexing of Spatiotemporal Objects, Lecture Notes in Computer Science, pp. 251-268
2 H. Zhu, J. Su, O. Ibarra, "Trajectory Queries and Octagouse in Moving Object Databases", Proc of The ACM International Conference on Information and Knowlege Management, pp. 413-421, 2002
3 Hyun-Jun Jeon, Ju-Hyun Park, Hee-Suk Park, Woo-Hyun Cho, "An Improved Split Algorithm for Indexing of Moving Object Trajectories" KIPSTD, 16-D, pp. 161-168, 2009   과학기술학회마을   DOI   ScienceOn
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
5 V. P. Chakka, A. C. Everspaugh and J. M. Patel, "Indexing Large Trajectory Data Sets With SETI", Proc of The 1st Biennial Conference on Innovative Data Systems Research, 2003
6 S. Prabhakar, Y.Xia, D. V. Kalashnikov, W. G. Aref and S. E. Hanbrusch, "Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous on Computers", IEEE Tracsactions on Computers, pp. 1124-1140, 2002
7 Y. Tao, D Papadias and J. Sun, "The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predicative Queries", Proc of the 29th International Conferenece on Very Large Databases, pp. 790-801, 2003
8 T. Brinkhoff, "Generating Network-Based Moving Objects", Proc of The International Conference on Scientific ans Statistical Database Management, pp. 253-255, 2000
9 D. E. KNUTH, "The Art of Computer Programming , Volum3, Sorting and Searching Second Edition", Addison Wesley Longman
10 R. Benetis, C. S. Jensen, G. Karciauskas and S. Saltenis, "Nearest Neighbor ans Reverse Nearest Neighbor Queries of Moving Objects", Proc of The International Symposium on Database Technology, pp. 44-53, 2002
11 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
12 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
13 Y. Theodoridis, M. Vazirgiannis and T. Sellis, "Spatio-Temporal Indexing for Large Multimedia Application", Proc of The 3rd IEEE International Conference on Multimedia Computing ans Systems, pp. 441-448, 1996
14 O. Wolfson, S. Chamberlain, S. Dao and L. Jiang, "Location Management in Moving Objects Databases", Proc of The International Workshop in Satellite-Based Information Services, pp. 7-14, 1997