Chimp: Efficient Lossless Floating Point Compression for Time Series Databases
Panagiotis Liakos, Katia Papakonstantinopoulou, Yannis Kotidis
Abstract
Applications in diverse domains such as astronomy, economics and industrial monitoring, increasingly press the need for analyzing massive collections of time series data. The sheer size of the latter hinders our ability to efficiently store them and also yields significant storage costs. Applying general purpose compression algorithms would effectively reduce the size of the data, at the expense of introducing significant computational overhead. Time Series Management Systems that have emerged to address the challenge of handling this overwhelming amount of information, cannot suffer the ingestion rate restrictions that such compression algorithms would cause. Data points are usually encoded using faster, streaming compression approaches. However, the techniques that contemporary systems use do not fully utilize the compression potential of time series data, with implications in both storage requirements and access times. In this work, we propose a novel streaming compression algorithm, suitable for floating point time series data. We empirically establish properties exhibited by a diverse set of time series and harness these features in our proposed encodings. Our experimental evaluation demonstrates that our approach readily outperforms competing techniques, attaining compression ratios that are competitive with slower general purpose algorithms, and on average around 50% of the space required by state-of-the-art streaming approaches. Moreover, our algorithm outperforms all earlier techniques with regards to both compression and access time , offering a significantly improved trade-off between space and speed. The aforementioned benefits of our approach - in terms of all space requirements, compression time and read access - significantly improve the efficiency in which we can store and analyze time series data.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b921d407-97ea-4d21-b1cd-dffc1182fdbfCited by top-tier papers29
- An Empirical Evaluation of Columnar Storage FormatsXinyu Zeng, Yulong Hui, Jiahong Shen, Andrew Pavlo et al.VLDB 2024 · 59 citations
- BtrBlocks: Efficient Columnar Compression for Data LakesMaximilian Kuschewski, David Sauerwein, Adnan Alhomssi, Viktor LeisSIGMOD 2023 · 47 citations
- Elf: Erasing-based Lossless Floating-Point CompressionRuiyuan Li, Zheng Li, Yi Wu, Chao Chen et al.VLDB 2023 · 44 citations
- ALP: Adaptive Lossless floating-Point CompressionAzim Afroozeh, Leonardo Kuffó, Peter BonczSIGMOD 2024 · 33 citations
- FCBench: Cross-Domain Benchmarking of Lossless Compression for Floating-point DataXinyu Chen, Jiannan Tian, Ian Beaver, Cynthia Freeman et al.VLDB 2024 · 24 citations
Builds on2
Related papers
- Camel: Efficient Compression of Floating-Point Time SeriesYuanyuan Yao, Lu Chen, Ziquan Fang, Yunjun Gao et al.SIGMOD 2025 · 4 citations
- Kangaroo: Efficient Lossless Floating-Point Compression via Dynamic Reference SelectionShuo Li, Xiaochun Yang, Chunhui Shen, Yutong Han et al.SIGMOD 2026
- Learned Compression of Nonlinear Time Series with Random AccessAndrea Guerra, Giorgio Vinciguerra, Antonio Boffa, Paolo FerraginaICDE 2025 · 5 citations
- Hierarchical Residual Encoding for Multiresolution Time Series CompressionBruno Barbarioli, Gabriel Mersy, Stavros Sintos, Sanjay KrishnanSIGMOD 2023 · 17 citations
- Sim-Piece: Highly Accurate Piecewise Linear Approximation through Similar Segment MergingXenophon Kitsios, Panagiotis Liakos, Katia Papakonstantinopoulou, Yannis KotidisVLDB 2023 · 20 citations
