Supporting pattern-matching queries over trajectories on road networks

Gook Pil Roh, Jong Won Roh, Seungwon Hwang, Byoung Kee Yi

Research output: Contribution to journalArticle

18 Citations (Scopus)

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 querieswhole, 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.

Original languageEnglish
Article number5601717
Pages (from-to)1753-1758
Number of pages6
JournalIEEE Transactions on Knowledge and Data Engineering
Volume23
Issue number11
DOIs
Publication statusPublished - 2011 Oct 3

Fingerprint

Pattern matching
Trajectories
Location based services
Ubiquitous computing
Scalability

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

Roh, Gook Pil ; Roh, Jong Won ; Hwang, Seungwon ; Yi, Byoung Kee. / Supporting pattern-matching queries over trajectories on road networks. In: IEEE Transactions on Knowledge and Data Engineering. 2011 ; Vol. 23, No. 11. pp. 1753-1758.
@article{0cf13d32c6fa4102b885084307642a3d,
title = "Supporting pattern-matching queries over trajectories on road networks",
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 querieswhole, 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.",
author = "Roh, {Gook Pil} and Roh, {Jong Won} and Seungwon Hwang and Yi, {Byoung Kee}",
year = "2011",
month = "10",
day = "3",
doi = "10.1109/TKDE.2010.189",
language = "English",
volume = "23",
pages = "1753--1758",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "11",

}

Supporting pattern-matching queries over trajectories on road networks. / Roh, Gook Pil; Roh, Jong Won; Hwang, Seungwon; Yi, Byoung Kee.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 23, No. 11, 5601717, 03.10.2011, p. 1753-1758.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Supporting pattern-matching queries over trajectories on road networks

AU - Roh, Gook Pil

AU - Roh, Jong Won

AU - Hwang, Seungwon

AU - Yi, Byoung Kee

PY - 2011/10/3

Y1 - 2011/10/3

N2 - 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 querieswhole, 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.

AB - 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 querieswhole, 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.

UR - http://www.scopus.com/inward/record.url?scp=80053224193&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80053224193&partnerID=8YFLogxK

U2 - 10.1109/TKDE.2010.189

DO - 10.1109/TKDE.2010.189

M3 - Article

VL - 23

SP - 1753

EP - 1758

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 11

M1 - 5601717

ER -