A Cost-Effective and Decompression-Transparent Compressor for OLTP-Oriented Databases
Hao Hu, Qiyang Zheng, Xiangyu Zou, Lisha Qin, Chengwei Zhang, Wanchuan Zhang, Zhaoheng Jiang, Dingwen Tao, Hongpeng Wang, Wen Xia
Abstract
The row-oriented store model is the cornerstone component of modern online transaction processing (OLTP) database systems. In response to the massive increase in data within database systems, compression techniques are employed to enhance storage efficiency. Regrettably, current compression methods suffer from either the amplification issue due to coarse compression granularity or inefficient decompression operations, thus usually decreasing the speed of query processing. To this end, we present DPTC, a cost-effective and decompression-transparent approach designed to compress data pages, the basic storage unit of OLTP database systems. Specifically, (1) DPTC applies a row-wise decompression-oriented structure to track the first occurrence of redundant data in compressed data, which effectively supports the decompression of individual records from pages, thereby avoiding unwarranted decompression in record access. Moreover, (2) DPTC employs an in-page dynamic packing strategy, which determines the compression units based on the impact of each data reduction operation on the compression gains and eliminates gains-inefficient data reductions. Furthermore, (3) DPTC utilizes a SIMD-based mechanism that leverages the characteristics of operations within the decompression process to improve the decompression speed. Our evaluation results confirm that DPTC is efficient in terms of decompression speed and compression ratio. Within an OLTP database system, DPTC yields throughput improvements of up to 4.28 x in TPC-C and reduces latency by up to 33.3% for data point queries in a row-oriented storage engine.
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.
Cited by top-tier papers3
- Error-bounded Point Cloud Compression Using Truncated Octahedron QuantizationYouyuan Liu, Longtao Zhang, Ruoyu Li, Bo Jiang et al.VLDB 2026
- Time-Varying Vector Field Compression with Preserved Critical Point TrajectoriesMingze Xia, Yuxiao Li, Pu Jiao, Bei Wang et al.ICDE 2026
- Towards Condensed and Efficient Read-Only File System via Sort-Enhanced CompressionHao Huang, Yifeng Zhang, Yanqi Pan, Wen Xia et al.FAST 2026
Related papers
- Blitzcrank: Fast Semantic Compression for In-memory Online Transaction ProcessingYiming Qiao, Yihan Gao, Huanchen ZhangVLDB 2024 · 3 citations
- High-Ratio Compression for Machine-Generated DataJiujing Zhang, Zhitao Shen, Shiyu Yang, Lingkai Meng et al.SIGMOD 2024 · 7 citations
- CompressStreamDB: Fine-Grained Adaptive Stream Processing without DecompressionYu Zhang, Feng Zhang, Hourun Li, Shuhao Zhang et al.ICDE 2023 · 18 citations
- Improving Time Series Data Compression in Apache IoTDBYuxin Tang, Feng Zhang, Jiawei Guan, Yuan Tian et al.VLDB 2025 · 2 citations
- Good to the Last Bit: Data-Driven Encoding with CodecDBHao Jiang, Chunwei Liu, John Paparrizos, Andrew A. Chien et al.SIGMOD 2021 · 45 citations
