Advertisement

MTSC: An Effective Multiple Time Series Compressing Approach

  • Ningting Pan
  • Peng Wang
  • Jiaye Wu
  • Wei Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11029)

Abstract

As the volume of time series data being accumulated is likely to soar, time series compression has become essential in a wide range of sensor-data applications, like Industry 4.0 and Smart grid. Compressing multiple time series simultaneously by exploiting the correlation between time series is more desirable. In this paper, we present MTSC, a novel approach to approximate multiple time series. First, we define a novel representation model, which uses a base series and a single value to represent each series. Second, two graph-based algorithms, \(MTSC_{mc}\) and \(MTSC_{star}\), are proposed to group time series into clusters. \(MTSC_{mc}\) can achieve higher compression ratio, while \(MTSC_{star}\) is much more efficient by sacrificing the compression ratio slightly. We conduct extensive experiments on real-world datasets, and the results verify that our approach outperforms existing approaches greatly.

References

  1. 1.
    UCI machine learning repository (2013). http://archive.ics.uci.edu/ml
  2. 2.
    Climatic Data Center. http://data.cma.cn/
  3. 3.
    Cheng, A., Hawkins, S., Nguyen, L., Monaco, C., Seagrave, G.: Data compression using Chebyshev transform. US Patent App. 10/633,447 (2004)Google Scholar
  4. 4.
    Deligiannakis, A., Kotidis, Y., Roussopoulos, N.: Compressing historical information in sensor networks. In: SIGMOD 2004, pp. 527–538 (2004)Google Scholar
  5. 5.
    Esling, P., Agon, C.: Time-series data mining. ACM Comput. Surv. 45(1), 12:1–12:34 (2012)CrossRefGoogle Scholar
  6. 6.
    Gandhi, S., Nath, S., Suri, S., Liu, J.: Gamps: compressing multi sensor data by grouping and amplitude scaling. In: SIGMOD 2009, pp. 771–784 (2009)Google Scholar
  7. 7.
    Guha, S., Koudas, N., Shim, K.: Approximation and streaming algorithms for histogram construction problems. TODS 31(1), 396–438 (2006)CrossRefGoogle Scholar
  8. 8.
    Lu, C., Yu, J.X., Wei, H., Zhang, Y.: Finding the maximum clique in massive graphs. VLDB 10(11), 1538–1549 (2017)Google Scholar
  9. 9.
    Luo, G., et al.: Piecewise linear approximation of streaming time series data with max-error guarantees. In: ICDE 2015, pp. 173–184 (2015)Google Scholar
  10. 10.
    Nguyen, Q.V.H., Jeung, H., Aberer, K.: An evaluation of model-based approaches to sensor data compression. TKDE 25(11), 2434–2447 (2013)Google Scholar
  11. 11.
    Östergård, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120(1–3), 197–207 (2002)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Pelkonen, T., Franklin, S., Teller, J., Cavallaro, P., Huang, Q., et al.: Gorilla: a fast, scalable, in-memory time series database. VLDB 8(12), 1816–1827 (2015)Google Scholar
  13. 13.
    Reiss, C., Wilkes, J., Hellerstein, J.L.: Google cluster-usage traces: format + schema. Technical report, Google Inc. (2011)Google Scholar
  14. 14.
    Dang, T., Bulusu, N., Feng, W.: RIDA: a robust information-driven data compression architecture for irregular wireless sensor networks. In: Langendoen, K., Voigt, T. (eds.) EWSN 2007. LNCS, vol. 4373, pp. 133–149. Springer, Heidelberg (2007).  https://doi.org/10.1007/978-3-540-69830-2_9CrossRefGoogle Scholar
  15. 15.
    Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theor. 24(5), 530–536 (2006)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.School of Computer ScienceFudan UniversityShanghaiChina
  2. 2.Shanghai Key Laboratoray of Data ScienceShanghaiChina

Personalised recommendations