An efficient data processing framework for mining the massive trajectory of moving objects |
| |
Affiliation: | 1. Department of Geography and City & Regional Planning, California State University, Fresno, CA 93740, USA;2. Department of City and Regional Planning, The Ohio State University, Columbus, OH 43210, USA;1. Argonne National Laboratory, United States;2. University Carlos III, Spain |
| |
Abstract: | Recently, there has been increasing development of positioning technology, which enables us to collect large scale trajectory data for moving objects. Efficient processing and analysis of massive trajectory data has thus become an emerging and challenging task for both researchers and practitioners. Therefore, in this paper, we propose an efficient data processing framework for mining massive trajectory data. This framework includes three modules: (1) a data distribution module, (2) a data transformation module, and (3) a high performance I/O module. Specifically, we first design a two-step consistent hashing algorithm, which takes into account load balancing, data locality, and scalability, for a data distribution module. In the data transformation module, we present a parallel strategy of a linear referencing algorithm with reduced subtask coupling, easy-implemented parallelization, and low communication cost. Moreover, we propose a compression-aware I/O module to improve the processing efficiency. Finally, we conduct a comprehensive performance evaluation on a synthetic dataset (1.114 TB) and a real world taxi GPS dataset (578 GB). The experimental results demonstrate the advantages of our proposed framework. |
| |
Keywords: | Big data Trajectory of moving object Compression contribution model Parallel linear referencing Two step consistent hashing |
本文献已被 ScienceDirect 等数据库收录! |
|