Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

COMPRESS: A Comprehensive Framework of Trajectory Compression in Road Networks

Published: 10 May 2017 Publication History

Abstract

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 (<underline>Com</underline>prehensive <underline>P</underline>aralleled <underline>R</underline>oad-Network-Based Trajectory Compr<underline>ess</underline>ion), 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.

References

[1]
Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, and Yusu Wang. 2005. Near-linear time approximation algorithms for curve simplification. Algorithmica 42 (2005), 203--219.
[2]
P. Arpaia, M. Buzio, and V. Inglese. 2010. A two-domain, real-time algorithm for optimal data reduction: A case study on accelerator magnet measurements. Measurements Science and Technology 21, 3 (2010), 035103.
[3]
Rudolf Bayer. 1972. Symmetric binary B-Trees: Data structure and maintenance algorithms. Acta Informatica 1, 4 (1972), 290--306.
[4]
Rudolf Bayer and Edward M. McCreight. 1972. Organization and maintenance of large ordered indexes. Acta Informatica 1, 3 (1972), 173--189.
[5]
Chazelle Bernard. 1991. Triangulating a simple polygon in linear time. Discrete and Computational Geometry 6 (1991), 485--524.
[6]
Sotiris Brakatsoulas, Dieter Pfoser, Randall Salas, and Carola Wenk. 2005. On map-matching vehicle tracking data. In Proceedings of the VLDB Endowment. 853--864.
[7]
Michael Burrows and David J. Wheeler. 1994. A Block Sorting Lossless Data Compression Algorithm. Retrieved from http://www.hpl.hp.com/techreports/Compaq-DEC/SRC-RR-124.html.
[8]
Hu Cao and Ouri Wolfson. 2005. Nonmaterialized motion information in transport networks. In International Conference on Database Theory (ICDT’05). Vol. 3363. 173--188.
[9]
Hu Cao, Ouri Wolfson, and Goce Trajcevski. 2006. Spatio-temporal data reduction with deterministic error bounds. VLDB Journal 15, 1 (2006), 211--228.
[10]
Yi Chiang and Roberto Tamassia. 1997. Optimal shortest path and minimum-Link path queries between two convex polygons in the presence of obstacles. International Journal of Computational Geometry 7 (1997), 85--121.
[11]
Thomas M. Cover and Joy A. Thomas. 2006. Elements of Information Theory (2nd ed.). Wiley-Interscience, Chapter 5: Data Compression 8 13: Universal Source Coding.
[12]
Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. 2000. Computational Geometry: Algorithms and Applications (2nd ed.). Springer-Verlag.
[13]
Edsger W. Dijkstra. 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1, 1 (1959), 269--271.
[14]
David Douglas and Thomas Peucker. 1973. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Canadian Cartographer 10, 2 (1973), 112--122.
[15]
R. L. Scot Drysdale, Gunter Rote, and Astrid Sturm. 2008. Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs. Computational Geometry 41, 1--2 (2008), 31--47.
[16]
Joseph S. B. Mitchell Esther M. Arkin and Subhash Suri. 1995. Logarithmic-time link path queries in a simple polygon. International Journal of Computational Geometry 5, 4 (1995), 369--395.
[17]
Chenglin Fan, Jun Luo, and Binhai Zhu. 2010. Fréchet-distance on road networks. In Computational Geometry, Graphs and Applications. 61--72.
[18]
Leonidas J. Guibas, John E. Hershberger, Joseph S. B. Mitchell, and Jack Scott Snoeyink. 1991. Approximating polygons and subdivisions with minimum link paths. In ISA’91 Algorithms. Vol. 557. 151--162.
[19]
Katsumi Hagita, Hiroaki Ohtani, Tsunehiko Kato, and Seiji Ishiguro. 2014. TOKI compression for plasma particle simulations. Plasma and Fusion Research 9 (2014), 3401083.
[20]
Yunheng Han, Weiwei Sun, and Baihua Zheng. 2016. Sample data and the online appendix. Retrieved from https://github.com/MasterChivu/TODS-EXP.
[21]
David A. Huffman. 1952. A method for the construction of minimum-redundancy codes. In Proceedings of the IRE. Vol. 40. 1098--1101. Issue 9.
[22]
Hiroshi Imai and Masao Iri. 1988. Polygonal approximations of a curve formulations and algorithms. Machine Intelligence and Pattern Recognition 6 (1988), 71--86.
[23]
Georgios Kellaris, Nikos Pelekis, and Yannis Theodoridis. 2013. Map-matched trajectory compression. Journal of Systems 8 Software 86, 6 (2013), 1566--1579.
[24]
Donald E. Knuth. 1997. The Art of Computer Programming Volume 3: Sorting and Searching (2nd ed.). Addison-Wesley, Chapter 6.3: Digital Searching.
[25]
Abraham Lempel and Jacob Ziv. 1977. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory 23, 3 (1977), 337--343.
[26]
Abraham Lempel and Jacob Ziv. 1978. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory 24, 5 (1978), 530--536.
[27]
Yin Lou, Chengyang Zhang, Yu Zheng, Xing Xie, Wei Wang, and Yan Huang. 2009. Map-matching for low-sampling-rate GPS trajectories. In Proceedings of the 17th ACM SIGSPATIAL GIS. 352--361.
[28]
Joseph S. B. Mitchell, Gnter Rote, and Gerhard Woeginger. 1992. Minimum-link paths among obstacles in the plane. Algorithmica 8, 1--6 (1992), 431--459.
[29]
Jonathan Muckell, Paul W. Olsen Jr., Jeong-Hyon Hwang, S. S. Ravi, and Catherine T. Lawson. 2013. A framework for efficient and convenient evaluation of trajectory compression algorithms. In Proceedings of the 2013 4th International Conference on Computing for Geospatial Research and Application. 24--31.
[30]
Paul Newson and John Krumm. 2009. Hidden markov map matching through noise and sparseness. In Proceedings of the 17th ACM SIGSPATIAL GIS. 336--343.
[31]
OHPI. 2014. Highway Statistics Series. Retrieved from http://www.fhwa.dot.gov/policyinformation/statistics/2011/vm2.cfm.
[32]
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, and Ahmed Kharrat. 2015. Spatio-temporal compression of trajectories in road networks. GeoInformatica 19, 1 (2015), 117--145.
[33]
Jorma J. Rissanen. 1976. Generalized kraft inequality and arithmetic coding. IBM Journal of Research and Development 30, 3 (1976), 198--203.
[34]
Zhangqing Shan, Hao Wu, Weiwei Sun, and Baihua Zheng. 2015. COBWEB: A robust map update system using GPS trajectories. In Proceedings of the 2015 ACM International Joint Conference on Pervasive and Ubiquitous Computing. 927--937.
[35]
Claude E. Shannon. 1948. A mathematical theory of communication. Bell System Technical Journal 27, 3 (1948), 379--243.
[36]
Renchu Song, Wei Lu, Weiwei Sun, Yan Huang, and Chunan Chen. 2012. Quick map matching using multi-core CPUs. In Proceedings of the 20th ACM SIGSPATIAL GIS. 605--608.
[37]
Renchu Song, Weiwei Sun, Baihua Zheng, and Yu Zheng. 2014. PRESS: A novel framework of trajectory compression in road networks. In Proceedings of the VLDB Endowment. Vol. 7. 661--672. Issue 9.
[38]
Subhash Suri. 1990. On some link distance problems in a simple polygon. IEEE Journal of Robotics and Automation 6, 1 (1990), 108--113.
[39]
K. R. Varadarajan. 1996. Approximating monotone polygonal curves using the uniform metric. In Symposium on Computational Geometry.
[40]
Terry Welch. 1984. A technique for high-performance data compression. Computer 17, 6 (1984), 8--19.
[41]
Ian H. Witten, Alistair Moffat, and Timothy C. Bell. 2001. Managing Gigabytes: Compressing and Indexing Documents and Images (2nd ed.). Elsevier, Chapter 2.7: Synchronization.
[42]
Hao Wu, Chuanchuan Tu, Weiwei Sun, Baihua Zheng, Hao Su, and Wei Wang. 2015. GLUE: A parameter-tuning-free map updating system. In Proceedings of the 24th ACM International Conference on Information and Knowledge Management. 683--692.

Cited By

View all
  • (2024)Collectively Simplifying Trajectories in a Database: A Query Accuracy Driven Approach2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00334(4383-4395)Online publication date: 13-May-2024
  • (2024)An adaptive trajectory compression and feature preservation method for maritime traffic analysisOcean Engineering10.1016/j.oceaneng.2024.119189312(119189)Online publication date: Nov-2024
  • (2024)TRGST: An enhanced generalized suffix tree for topological relations between pathsInformation Systems10.1016/j.is.2024.102406125(102406)Online publication date: Nov-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems
ACM Transactions on Database Systems  Volume 42, Issue 2
Invited Paper from SIGMOD 2015, Invited Paper from PODS 2015 and Regular Papers
June 2017
251 pages
ISSN:0362-5915
EISSN:1557-4644
DOI:10.1145/3086510
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 May 2017
Accepted: 01 November 2016
Revised: 01 August 2016
Received: 01 August 2015
Published in TODS Volume 42, Issue 2

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. GPS trajectory
  2. dictionary coder
  3. entropy encoding
  4. information entropy
  5. map matching
  6. road network
  7. stabbing polyline
  8. trajectory compression
  9. trajectory representation

Qualifiers

  • Research-article
  • Research
  • Refereed

Funding Sources

  • International Research Centres in Singapore Funding Initiative
  • National University Student Innovation Program
  • Fudan's Undergraduate Research Opportunities Program
  • National Research Foundation, Prime Ministers Office, Singapore
  • National Natural Science Foundation of China
  • Natural Science Foundation of Shanghai

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)58
  • Downloads (Last 6 weeks)5
Reflects downloads up to 12 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Collectively Simplifying Trajectories in a Database: A Query Accuracy Driven Approach2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00334(4383-4395)Online publication date: 13-May-2024
  • (2024)An adaptive trajectory compression and feature preservation method for maritime traffic analysisOcean Engineering10.1016/j.oceaneng.2024.119189312(119189)Online publication date: Nov-2024
  • (2024)TRGST: An enhanced generalized suffix tree for topological relations between pathsInformation Systems10.1016/j.is.2024.102406125(102406)Online publication date: Nov-2024
  • (2023)Trajectory Data Compression Algorithm Based on Ship Navigation State and Acceleration VariationJournal of Marine Science and Engineering10.3390/jmse1101021611:1(216)Online publication date: 13-Jan-2023
  • (2023)Efficient Large-Scale GPS Trajectory Compression on Spark: A Pipeline-Based ApproachElectronics10.3390/electronics1217356912:17(3569)Online publication date: 24-Aug-2023
  • (2023)TCFP: A Novel Privacy-Aware Edge Vehicular Trajectory Compression Scheme Using Fuzzy Markovian Prediction2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC)10.1109/SMC53992.2023.10394215(1217-1223)Online publication date: 1-Oct-2023
  • (2023)A Lightweight Framework for Fast Trajectory Simplification2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00184(2386-2399)Online publication date: Apr-2023
  • (2023)A pattern accumulated compression method for trajectories constrained by urban road networksData & Knowledge Engineering10.1016/j.datak.2023.102143145:COnline publication date: 5-Jun-2023
  • (2022)Layered Lossless Compression Method of Massive Fault Recording DataInternational Journal of Circuits, Systems and Signal Processing10.46300/9106.2022.16.316(17-25)Online publication date: 7-Jan-2022
  • (2022)Spatial Data Quality in the IoT Era: Management and ExploitationProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3522568(2474-2482)Online publication date: 10-Jun-2022
  • Show More Cited By

View Options

Get Access

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media