A network-based indexing method for trajectories of moving objects

  • Authors:

  • Kyoung-Sook Kim;Mario A. Lopez;Scott Leutenegger;Ki-Joune Li

  • Affiliations:

  • Department of Computer Science and Engineering, Pusan National University, Pusan, South Korea;Department of Computer Science, University of Denver, Denver, CO;Department of Computer Science, University of Denver, Denver, CO;Department of Computer Science and Engineering, Pusan National University, Pusan, South Korea

  • Venue:
  • ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently many researchers have focused on management of historical trajectories of moving objects due to numerous size of accumulated data over time. However, most of them are concentrated in Euclidean spaces with (x, y, t). In real world, moving objects like vehicles on transportation networks have constraints on their movements, and some of applications need to manage and query them. Previous work based on Euclidean is inefficient to process trajectories on road networks. In this paper, we propose a indexing method for trajectories of moving objects on road networks. While some work has been done for indexing the trajectory in spatial networks, little indexing method support the network-based spatiotemporal range query processing. Our method consists of multiple R-trees and graph structures to process the network-based spatiotemporal range query defined by the network distance instead of Euclidean distance. Consequently, we show that our method takes about 30% less in node accesses for the network-based range query processing than other methods based on the Euclidean distance by experiments.