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

Authors:
Min-Hee Jang;Sang-Wook Kim;Miyoung Shin
Affiliations:
Division of Information and Communications, Hanyang University, 17 Haengdang-dong, Sungdong-goo, Seoul 133-791, Korea;Division of Information and Communications, Hanyang University, 17 Haengdang-dong, Sungdong-goo, Seoul 133-791, Korea;School of Electrical Engineering and Computer Science, Kyungpook National University, 1370 Sankyuk-dong, Buk-goo, Daegu 702-701, Korea
Venue:
KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Year:
2007

Citing 12
Cited 1

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Indexing the positions of continuously moving objects

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Data Management in Location-Dependent Information Services

IEEE Pervasive Computing
Dynamic maintenance of data distribution for selectivity estimation

The VLDB Journal — The International Journal on Very Large Data Bases
Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects

IEEE Transactions on Computers
Modeling and Querying Moving Objects

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Novel Approaches in Query Processing for Moving Object Trajectories

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Moving Objects Databases: Issues and Solutions

SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
On the Generation of Spatiotemporal Datasets

SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
An Index-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases

Proceedings of the 17th International Conference on Data Engineering
The TPR*-tree: an optimized spatio-temporal access method for predictive queries

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Spatio-Temporal Indexing for Large Multimedia Applications

ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems

Efficient Monitoring of Moving Mobile Device Range Queries using Dynamic Safe Regions

Proceedings of International Conference on Advances in Mobile Computing & Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.