Indexing frequently updated trajectories of network-constrained moving objects

Authors:
Zhiming Ding
Affiliations:
Institute of Software, Chinese Academy of Sciences, Beijing, P.R. China
Venue:
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Year:
2011

Citing 7
Cited 0

Indexing the positions of continuously moving objects

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Novel Approaches in Query Processing for Moving Object Trajectories

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Managing Moving Objects on Dynamic Transportation Networks

SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Indexing the Trajectories of Moving Objects in Networks*

Geoinformatica
A trajectory splitting model for efficient spatio-temporal indexing

VLDB '05 Proceedings of the 31st international conference on Very large data bases
PIST: An Efficient and Practical Indexing Technique for Historical Spatio-Temporal Point Data

Geoinformatica
Location update strategies for network-constrained moving objects

DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Index is a key technique in improving the query processing performance of moving objects databases. However, current index methods for moving object trajectories take trajectory units as the basic index records and frequent index updates are needed when location updates occur, which greatly affects the overall performance of moving objects databases. To solve this problem, we propose a new index method, network-constrained Moving Object Sketched-Trajectory R-Tree (MOSTR-Tree) in this paper, which outperforms previously proposed methods under frequent location updates.