A Network-based Indexing Method for Trajectories of Moving Objects on Roads


The KIPS Transactions:PartD, Vol. 13, No. 7, pp. 879-888, Dec. 2006
10.3745/KIPSTD.2006.13.7.879,   PDF Download:

Abstract

Recently many researchers have focused on management of historical trajectories of moving objects in Euclidean spaces due to numerous sizes of accumulated data over time. However, the movement of moving objects in real applications generally has some constraints, for example vehicles on roads can only travel along connected road networks. In this paper, we propose an indexing method for trajectories of moving objects on road networks in order to process the network-based spatiotemporal range query. Our method contains the connect information of road networks to use the network distance for query processing, deals with trajectories which are represented by road segments in road networks, and manages them using multiple R-trees assigned per each road segment. Furthermore, it has a structure to be able to share R-tree among several road segments in large road networks. Consequently, we show that our method takes about 30% less in node accesses for the network-based spatiotemporal range query processing than other methods based on the Euclidean distance by experiments.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. S. Kim and K. J. Li, "A Network-based Indexing Method for Trajectories of Moving Objects on Roads," The KIPS Transactions:PartD, vol. 13, no. 7, pp. 879-888, 2006. DOI: 10.3745/KIPSTD.2006.13.7.879.

[ACM Style]
Kyoung Sook Kim and Ki Joune Li. 2006. A Network-based Indexing Method for Trajectories of Moving Objects on Roads. The KIPS Transactions:PartD, 13, 7, (2006), 879-888. DOI: 10.3745/KIPSTD.2006.13.7.879.