An Improved Split Algorithm for Indexing of Moving Object Trajectories

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.

[1]  Timos K. Sellis,et al.  Spatio-temporal indexing for large multimedia applications , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[2]  Jianliang Xu,et al.  Data Management in Location-Dependent Information Services , 2002, IEEE Pervasive Comput..

[3]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[4]  Christian S. Jensen,et al.  Indexing the positions of continuously moving objects , 2000, SIGMOD '00.

[5]  Walid G. Aref,et al.  Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects , 2002, IEEE Trans. Computers.

[6]  Amit P. Sheth,et al.  Semantic (Web) Technology In Action: Ontology Driven Information Systems for Search, Integration and Analysis , 2003, IEEE Data Eng. Bull..

[7]  Christian S. Jensen,et al.  Nearest neighbor and reverse nearest neighbor queries for moving objects , 2002, Proceedings International Database Engineering and Applications Symposium.

[8]  Jörg Sander,et al.  A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing , 2005, VLDB.

[9]  Ouri Wolfson,et al.  Location Management in Moving Objects Databases , 1997 .

[10]  Nick Roussopoulos,et al.  SEB-tree: An Approach to Index Continuously Moving Objects , 2003, Mobile Data Management.

[11]  Yannis Manolopoulos,et al.  Spatiotemporal Access Methods , 2000 .

[12]  Yannis Manolopoulos,et al.  Overlapping linear quadtrees: a spatio-temporal access method , 1998, GIS '98.

[13]  Thomas Brinkhoff,et al.  Generating network-based moving objects , 2000, Proceedings. 12th International Conference on Scientific and Statistica Database Management.

[14]  Yannis Theodoridis,et al.  On the Generation of Spatiotemporal Datasets , 1999 .

[15]  Dieter Pfoser,et al.  Novel Approaches to the Indexing of Moving Object Trajectories , 2000, VLDB.

[16]  Marios Hadjieleftheriou,et al.  R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.

[17]  Jignesh M. Patel,et al.  Indexing Large Trajectory Data Sets With SETI , 2003, CIDR.

[18]  H. Buchner.  The Grid File : An Adaptable , Symmetric Multikey File Structure , 2001 .

[19]  Jimeng Sun,et al.  The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries , 2003, VLDB.

[20]  Walid G. Aref,et al.  Spatio-Temporal Access Methods , 2003, IEEE Data Eng. Bull..

[21]  Oscar H. Ibarra,et al.  Trajectory queries and octagons in moving object databases , 2002, CIKM '02.

[22]  Dimitrios Gunopulos,et al.  Efficient Indexing of Spatiotemporal Objects , 2002, EDBT.

[23]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .