TY - GEN
T1 - Querying Massive Trajectories by Path on the Cloud?
AU - Li, Ruiyuan
AU - Ruan, Sijie
AU - Bao, Jie
AU - Li, Yanhua
AU - Wu, Yingcai
AU - Zheng, Yu
N1 - Publisher Copyright:
© 2017 Copyright held by the owner/author(s).
PY - 2017/11/7
Y1 - 2017/11/7
N2 - A path query aims to find the trajectories that pass a given sequence of connected road segments within a time period. It is very useful in many urban applications, e.g., 1) traffic modeling, 2) frequent path mining, and 3) traffic anomaly detection. Existing solutions for path query are implemented based on single machines, which are not efficient for the following tasks: 1) indexing large-scale historical data; 2) handling real-time trajectory updates; and 3) processing concurrent path queries. In this paper, we design and implement a cloud-based path query processing framework based on Microsoft Azure. We modify the suffix tree structure to index the trajectories using Azure Table. The proposed system consists of two main parts: 1) backend processing, which performs the pre-processing and suffix index building with distributed computing platform (i.e., Storm) used to efficiently handle massive real-time trajectory updates; and 2) query processing, which answers path queries using Azure Storm to improve efficiency and overcome the I/O bottleneck. We evaluate the performance of our proposed system based on a real taxi dataset from Guiyang, China.
AB - A path query aims to find the trajectories that pass a given sequence of connected road segments within a time period. It is very useful in many urban applications, e.g., 1) traffic modeling, 2) frequent path mining, and 3) traffic anomaly detection. Existing solutions for path query are implemented based on single machines, which are not efficient for the following tasks: 1) indexing large-scale historical data; 2) handling real-time trajectory updates; and 3) processing concurrent path queries. In this paper, we design and implement a cloud-based path query processing framework based on Microsoft Azure. We modify the suffix tree structure to index the trajectories using Azure Table. The proposed system consists of two main parts: 1) backend processing, which performs the pre-processing and suffix index building with distributed computing platform (i.e., Storm) used to efficiently handle massive real-time trajectory updates; and 2) query processing, which answers path queries using Azure Storm to improve efficiency and overcome the I/O bottleneck. We evaluate the performance of our proposed system based on a real taxi dataset from Guiyang, China.
UR - http://www.scopus.com/inward/record.url?scp=85041003417&partnerID=8YFLogxK
U2 - 10.1145/3139958.3139996
DO - 10.1145/3139958.3139996
M3 - Conference contribution
AN - SCOPUS:85041003417
SN - 9781450354905
T3 - GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
BT - GIS
A2 - Ravada, Siva
A2 - Hoel, Erik
A2 - Tamassia, Roberto
A2 - Newsam, Shawn
A2 - Trajcevski, Goce
A2 - Trajcevski, Goce
PB - Association for Computing Machinery
T2 - 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2017
Y2 - 7 November 2017 through 10 November 2017
ER -