COMPRESS: A Comprehensive Framework of Trajectory Compression in Road Networks

被引:37
作者
Han, Yunheng [1 ,2 ]
Sun, Weiwei [1 ,2 ]
Zheng, Baihua [3 ]
机构
[1] Fudan Univ, Sch Comp Sci, 825 Zhangheng Rd, Shanghai 201203, Peoples R China
[2] Shanghai Key Lab Data Sci, Shanghai 201203, Peoples R China
[3] Singapore Management Univ, Sch Informat Syst, 80 Stamford Rd, Singapore 178902, Singapore
来源
ACM TRANSACTIONS ON DATABASE SYSTEMS | 2017年 / 42卷 / 02期
基金
中国国家自然科学基金; 上海市自然科学基金; 新加坡国家研究基金会;
关键词
Design; Algorithms; Performance; GPS trajectory; road network; trajectory compression; map matching; information entropy; trajectory representation; entropy encoding; dictionary coder; stabbing polyline; MINIMUM; APPROXIMATION; POLYGONS; CURVE;
D O I
10.1145/3015457
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
More and more advanced technologies have become available to collect and integrate an unprecedented amount of data from multiple sources, including GPS trajectories about the traces of moving objects. Given the fact that GPS trajectories are vast in size while the information carried by the trajectories could be redundant, we focus on trajectory compression in this article. As a systematic solution, we propose a comprehensive framework, namely, COMPRESS (Comprehensive Paralleled Road-Network- Based Trajectory Compression), to compress GPS trajectory data in an urban road network. In the preprocessing step, COMPRESS decomposes trajectories into spatial paths and temporal sequences, with a thorough justification for trajectory decomposition. In the compression step, COMPRESS performs spatial compression on spatial paths, and temporal compression on temporal sequences in parallel. It introduces two alternative algorithms with different strengths for lossless spatial compression and designs lossy but error-bounded algorithms for temporal compression. It also presents query processing algorithms to support error-bounded location-based queries on compressed trajectories without full decompression. All algorithms under COMPRESS are efficient and have the time complexity of O(|T|), where |T| is the size of the input trajectory T. We have also conducted a comprehensive experimental study to demonstrate the effectiveness of COMPRESS, whose compression ratio is significantly better than related approaches.
引用
收藏
页数:49
相关论文
共 42 条
[1]   Near-linear time approximation algorithms for curve simplification [J].
Agarwal, PK ;
Har-Peled, S ;
Mustafa, NH ;
Wang, YS .
ALGORITHMICA, 2005, 42 (3-4) :203-219
[2]  
[Anonymous], 1997, The Art of Computer Programming: Seminumerical Algorithms
[3]  
[Anonymous], 2009, P 17 ACM SIGSPATIAL, DOI [10.1145/1653771.1653820, DOI 10.1145/1653771.1653820]
[4]  
[Anonymous], 1973, Cartographica: the international journal for geographic information and geovisualization, DOI [DOI 10.3138/FM57-6770-U75U-7727, 10.3138/FM57-6770-U75U-7727]
[5]  
[Anonymous], 2005, P 31 INT C VERY LARG
[6]   A two-domain real-time algorithm for optimal data reduction: a case study on accelerator magnet measurements [J].
Arpaia, Pasquale ;
Buzio, Marco ;
Inglese, Vitaliano .
MEASUREMENT SCIENCE AND TECHNOLOGY, 2010, 21 (03)
[7]  
Bayer R., 1972, Acta Informatica, V1, P173, DOI 10.1007/BF00288683
[8]  
Bayer R., 1972, Acta Informatica, V1, P290, DOI 10.1007/BF00289509
[9]  
Burrows Michael, 1994, SRS RES REPORT
[10]  
Cao H, 2005, LECT NOTES COMPUT SC, V3363, P173