VTPR-tree: an efficient indexing method for moving objects with frequent updates

Authors:
Wei Liao;Guifen Tang;Ning Jing;Zhinong Zhong
Affiliations:
School of Electronic Science and Engineering, National University of Defense Technology, China;School of Electronic Science and Engineering, National University of Defense Technology, China;School of Electronic Science and Engineering, National University of Defense Technology, China;School of Electronic Science and Engineering, National University of Defense Technology, China
Venue:
CoMoGIS'06 Proceedings of the 2006 international conference on Advances in Conceptual Modeling: theory and practice
Year:
2006

Citing 5
Cited 1

Indexing the positions of continuously moving objects

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A Framework for Generating Network-Based Moving Objects

Geoinformatica
Supporting frequent updates in R-trees: a bottom-up approach

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
Query and update efficient B+-tree based indexing of moving objects

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Indexing moving objects for directions and velocities queries

Information Systems Frontiers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Moving object databases are required to support queries on a large number of continuous moving objects. Indexes for moving objects must support both query and update operations efficiently. In previous work TPR-tree is the most popular indexing method for the future predicted position, but its frequent updates performance is very poor. In this paper we propose a novel indexing method, called VTPR-tree, for predicted trajectory of moving objects. VTPR-tree takes into account both the velocity and space distribution of moving objects. First the velocity domain is split, and moving objects are classified into different velocity buckets by their velocities, thus objects in one bucket have similar velocities. Then we use an improved TPR-tree structure to index objects in each bucket. VTPR-tree is supplemented by a hash index on IDs of moving objects to support frequent updates. Also an extended bottom-up update algorithm is developed for VTPR-tree, thus having a good dynamic update performance and concurrency. Experimental results show that the update and query performance of VTPR-tree outperforms the TPR*-tree.