Performance of TPR*-Trees for Predicting Future Positions of Moving Objects in U-Cities

The TPR*-tree is the most widely-used index structure for effectively predicting the future positions of moving objects. The TPR*-tree, however, has the problem that both of the dead spacein a bounding region and the overlap among bounding regions become larger as the prediction time point in the future gets farther. This makes more nodes within the TPR*-tree accessed in query processing time, which incurs serious performance degradation. In this paper, we examine the performance problem quantitatively via a series of experiments. First, we show how much the performance deteriorates as a prediction time point gets farther from the present, and also show how the frequent updates of positions of moving objects alleviate this problem. Our contribution would help provide important clues to devise strategies improving the performance of TPR*-trees further.

[1]  Christian S. Jensen,et al.  Indexing the Positions of Continuously Moving Objects , 2000, SIGMOD Conference.

[2]  Dieter Pfoser,et al.  Novel Approaches in Query Processing for Moving Object Trajectories , 2000, VLDB 2000.

[3]  Bo Xu,et al.  Moving objects databases: issues and solutions , 1998, Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243).

[4]  Wesley W. Chu,et al.  An index-based approach for similarity search supporting time warping in large sequence databases , 2001, Proceedings 17th International Conference on Data Engineering.

[5]  Gio Wiederhold,et al.  Dynamic maintenance of data distribution for selectivity estimation , 2005, The VLDB Journal.

[6]  Jianwen Su,et al.  On bulk loading TPR-Tree , 2004, IEEE International Conference on Mobile Data Management, 2004. Proceedings. 2004.

[7]  A. Prasad Sistla,et al.  Modeling and querying moving objects , 1997, Proceedings 13th International Conference on Data Engineering.

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

[9]  Max J. Egenhofer,et al.  Advances in Spatial Databases , 1997, Lecture Notes in Computer Science.

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

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

[12]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

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

[14]  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.

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