System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

UTR-Tree: An Index Structure for the Full Uncertain Trajectories of Network-Constrained Moving Objects

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Zhiming Ding ; Inst. of Software, Chinese Acad. of Sci., Beijing

The uncertainty management problem for moving objects databases has been well studied recently, with many models and algorithms proposed. However, very limited work has dealt with the index of uncertain trajectories for a running moving objects database. In this paper, we propose an index framework, the UTR- Tree, for indexing the full uncertain trajectories of network constrained moving objects. Through a dynamic index maintenance technique which is associated with location updates, the UTR-Tree can deal with the full uncertain trajectories, which include not only the historical locations of moving objects, but also their current and near future location information with uncertainty considered, so that the queries on the whole life span of the moving objects can be efficiently supported. The experimental results show that the UTR-Tree outperforms previously proposed network- based moving object index methods in dealing with full uncertain trajectories.

Published in:

Mobile Data Management, 2008. MDM '08. 9th International Conference on

Date of Conference:

27-30 April 2008