Home > Archive > 2013 > Volume 3 Number 4 (Aug. 2013) >
IJIET 2013 Vol.3(4): 480-487 ISSN: 2010-3689
DOI: 10.7763/IJIET.2013.V3.322

An Online Data Compression Algorithm for Trajectories (An OLDCAT)

Ting Wang

Abstract—In the regime of “Big Data”, data compression techniques take crucial part in preparation phase of data analysis. It is challenging because statistical properties and other characteristics need to be preserved while the size of data need to be reduced. In particular, to compress trajectory data, movement status (such as position, direction, and speed etc.) need to be retained. Moreover, for the increasing demand of real-time processing capability, “online” algorithms are becoming more desirable in data analysis. In this paper, we introduce an On-Line Data Compression Algorithms for Trajectories (OLDCAT), which is an elegant, fast algorithm to effectively compress trajectory data to desirable volume. It is able to deal with real-time data, and scalable to adapt to different sensitivity, accuracy, and compression requirements. An evaluation of its parameter settings and a case study are also discussed in this paper.

Index Terms—Data compression, trajectory data, online algorithm.

Wang Ting is with SAP Asia Pte Ltd, Singapore (e-mail: dean.wang@sap.com).

[PDF]

Cite:Ting Wang, "An Online Data Compression Algorithm for Trajectories (An OLDCAT)," International Journal of Information and Education Technology vol. 3, no. 4, pp. 480-487, 2013.

General Information

  • ISSN: 2010-3689 (Online)
  • Abbreviated Title: Int. J. Inf. Educ. Technol.
  • Frequency: Monthly
  • DOI: 10.18178/IJIET
  • Editor-in-Chief: Prof. Jon-Chao Hong
  • Managing Editor: Ms. Nancy Y. Liu
  • E-mail: editor@ijiet.org
  • Abstracting/ Indexing: Scopus (CiteScore 2023: 2.8), INSPEC (IET), UGC-CARE List (India), CNKI, EBSCO, Google Scholar
  • Article Processing Charge: 800 USD

 

Article Metrics in Dimensions