An improved spatio-temporal index structure for predictive queries

Authors:
Meng Gao;Yingyuan Xiao
Affiliations:
Tianjin Key Laboratory of Intelligence Computing and Novel Software Techn., Tianjin Univ. of Techn., Tianjin, P.R. China and Key Laboratory of Computer Vision and System, Tianjin Univ. of Technolo ...;Tianjin Key Laboratory of Intelligence Computing and Novel Software Techn., Tianjin Univ. of Technology, Tianjin, P.R. China and Key Laboratory of Computer Vision and System, Tianjin Univ. of Tech ...
Venue:
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 5
Year:
2009

Citing 8
Cited 0

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
Time-parameterized queries in spatio-temporal databases

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Modeling and Querying Moving Objects

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Moving Objects Databases: Issues and Solutions

SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
Q+Rtree: Efficient Indexing for Moving Object Databases

DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
Querying about the Near Future Positions of Moving Objects

IMSCCS '06 Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences - Volume 2 (IMSCCS'06) - Volume 02
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The TPR-tree is a popular index structure utilized to query the present or future positions of moving objects. Compared with the traditional spatial index structures, the TPR-tree is more appropriate to satisfy the requirements of storage and queries of moving objects. However, when a TPR-tree is constructed, the velocity difference of moving objects in the same direction hasn't been considered. This will cause numerous invalid regions with lower efficiency for query execution. To solve this problem, we present an enhanced spatio-temporal index structure: VCTPR-tree, and it can avoid invalid regions by introducing velocity to change the timestamps thus improve the query performance.