Kangaroo: Efficient Lossless Floating-Point Compression via Dynamic Reference Selection
Shuo Li, Xiaochun Yang, Chunhui Shen, Yutong Han, Xiang Wang, Lingdu Kong, Bin Wang, Feibo Li
Abstract
To address the dual challenges of data transmission and storage in Internet of Things (IoT) systems, the development of efficient streaming lossless compression algorithms for floating-point data has become a critical research focus. Existing XOR-based floating-point compression algorithms adopt a fixed reference selection strategy by using the immediate predecessor value as the reference. Usually, this choice is not the best, as earlier values in the data stream often provide more similar and effective references. Based on this observation, we propose dynamically searching previous values to identify the reference value that yields the best compression results for the current value. To this end, we present Kangaroo, an efficient lossless compression algorithm for floating-point time series that implements a dynamic reference selection. Our approach begins by establishing optimal reference selection criteria aimed at minimizing the number of encoded bits, introducing a pruning-based encoding strategy to reduce encoding overhead. We further propose a dynamic search strategy that selects reference values from an extended historical window, skipping historical data that generates suboptimal XOR results. This strategy enables precise identification of the suitable reference value while improving search efficiency. Additionally, we design a bit-flip-based erasure strategy to maximize trailing zeros, thereby comprehensively enhancing compression performance. Extensive experiments on 26 datasets demonstrate that Kangaroo outperforms all baseline methods across all evaluation metrics. Most notably, compared to state-of-the-art streaming compression algorithms, our algorithm achieves a 23.2% average improvement (peaking at 98.0% ) in compression ratio, with compression and decompression speeds averaging 2.13× and 2.21× (reaching up to 11.75× and 5.24×) of the baseline, respectively. This novel solution establishes comprehensive performance leadership in floating-point time-series compression, and has been applied to the Lindorm database on Alibaba Cloud since 2024, managing tens of petabytes of Internet of Vehicles (IoV) data.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 20fd5f89-75dd-45b7-a481-5f3da95f80d9Related papers
- Elf: Erasing-based Lossless Floating-Point CompressionRuiyuan Li, Zheng Li, Yi Wu, Chao Chen et al.VLDB 2023 · 44 citations
- Camel: Efficient Compression of Floating-Point Time SeriesYuanyuan Yao, Lu Chen, Ziquan Fang, Yunjun Gao et al.SIGMOD 2025 · 4 citations
- Serf: Streaming Error-Bounded Floating-Point CompressionRuiyuan Li, Zechao Chen, Ruyun Lu, Xiaolong Xu et al.SIGMOD 2025 · 7 citations
- Chimp: Efficient Lossless Floating Point Compression for Time Series DatabasesPanagiotis Liakos, Katia Papakonstantinopoulou, Yannis KotidisVLDB 2022 · 76 citations
- DeXOR: Enabling XOR in Decimal Space for Streaming Lossless Compression of Floating-point DataChuanyi Lv, Huan Li, Dingyu Yang, Zhonele Xie et al.VLDB 2026
