NCO-tree: a spatio-temporal access method for segment-based tracking of moving objects

Authors:
Yuelong Zhu;Xiang Ren;Jun Feng
Affiliations:
College of Computer & Information Engineering, Hohai University, Nanjing, Jiangsu, China;College of Computer & Information Engineering, Hohai University, Nanjing, Jiangsu, China;College of Computer & Information Engineering, Hohai University, Nanjing, Jiangsu, China
Venue:
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Year:
2006

Citing 6
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
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Temporal Pattern Mining of Moving Objects for Location-Based Service

DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Techniques for Efficient Road-Network-Based Tracking of Moving Objects

IEEE Transactions on Knowledge and 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the continued advances in wireless communications and geo-positioning, an infrastructure is emerging that enables location-based services which rely on the tracking of the continuously changing positions of entire populations of service users, termed moving objects. The main interest of these services is to efficiently store and query the positions of moving objects. To achieve this goal, index structures are required. In this paper we propose a new index structure for moving objects in networks: NCO-Tree. It efficiently supports the Segment-Based tracking approaches and its optimization. We give the structure description, insertion and search algorithms, then evaluate it with experiment.