Supporting Pattern-Matching Queries over Trajectories on Road Networks
SCIE
SCOPUS
- Title
- Supporting Pattern-Matching Queries over Trajectories on Road Networks
- Authors
- Roh, GP; Roh, JW; Hwang, SW; Yi, BK
- Date Issued
- 2011-11
- Publisher
- IEEE COMPUTER SOC
- Abstract
- With the advent of ubiquitous computing, we can easily collect large-scale trajectory data, say, from moving vehicles. This paper studies pattern-matching problems for trajectory data over road networks, which complements existing efforts focusing on 1) a spatiotemporal window query for location-based service or 2) euclidean space with no restriction. In contrast, we first identify some desirable properties for pattern-matching queries to the road network trajectories. As the existing work does not fully satisfy these properties, we develop 1) trajectory representation and 2) distance metric that satisfy all the desirable properties we identified. Based on this representation and metric, we develop efficient algorithms for three types of pattern-matching queries-whole, subpattern, and reverse subpattern matching. We analytically validate the correctness of our algorithms and also empirically validate their scalability over large-scale, real-life, and synthetic trajectory data sets.
- Keywords
- Trajectory; road network; pattern-matching query; ALGORITHMS
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/15924
- DOI
- 10.1109/TKDE.2010.189
- ISSN
- 1041-4347
- Article Type
- Article
- Citation
- IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, vol. 23, no. 11, page. 1753 - 1758, 2011-11
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.