Revisiting Data Compression in Column-Stores
Alexander Slesarev, Evgeniy Klyuchikov, Kirill Smirnov, George, Chernishev

TL;DR
This paper reevaluates data compression techniques in disk-based column-stores, considering modern hardware advancements and new algorithms, to determine optimal compression strategies for query performance and storage efficiency.
Contribution
It provides an experimental analysis of heavy-weight versus light-weight compression schemes and assesses the impact of SIMD-based decompression in modern disk-based column-stores.
Findings
Heavy-weight compression schemes are still generally unsuitable for disk-based column-stores.
New light-weight algorithms outperform older ones in modern hardware contexts.
SIMD-based decompression offers performance benefits in disk-based systems.
Abstract
Data compression is widely used in contemporary column-oriented DBMSes to lower space usage and to speed up query processing. Pioneering systems have introduced compression to tackle the disk bandwidth bottleneck by trading CPU processing power for it. The main issue of this is a trade-off between the compression ratio and the decompression CPU cost. Existing results state that light-weight compression with small decompression costs outperforms heavy-weight compression schemes in column-stores. However, since the time these results were obtained, CPU, RAM, and disk performance have advanced considerably. Moreover, novel compression algorithms have emerged. In this paper, we revisit the problem of compression in disk-based column-stores. More precisely, we study the I/O-RAM compression scheme which implies that there are two types of pages of different size: disk pages (compressed) and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
