Compression-Aware GPU Buffer Management

Abstract Hardware accelerators, such as graphics processing units (GPUs) connected via PCIe, provide their own byte-addressable device memory. When integrating their memory into the global buffer pool, database systems should place compressed data and the associated operators on the best suited units to maximise overall throughput and bandwidth. This paper presents a three-tier buffer manager that manages encoded pages across SSD, RAM and GPU device memory while codec-specific operators fuse decompression, selection, join and aggregation. Splitting the workload between CPU (uncompressed in RAM) and GPU (compressed on device) and combining partial aggregates yields a throughput of 3.76 GiB/s, which is 15% higher than GPU-only execution. The results are the basis for a cost-model for data and operator placement.

Authors

Institutions

Publication Details

Journal
Datenbank-Spektrum
Published
2026-09-12
DOI
https://doi.org/10.1007/s13222-026-00560-w
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

Compression-Aware GPU Buffer Management

Maximilian E. Schüle, Maha Alwahibi
Datenbank-Spektrum
Parallel Computing and Optimization Techniques
article

Compression-Aware GPU Buffer Management

Maximilian E. Schüle, Maha Alwahibi
article en

Abstract

Abstract Hardware accelerators, such as graphics processing units (GPUs) connected via PCIe, provide their own byte-addressable device memory. When integrating their memory into the global buffer pool, database systems should place compressed data and the associated operators on the best suited units to maximise overall throughput and bandwidth. This paper presents a three-tier buffer manager that manages encoded pages across SSD, RAM and GPU device memory while codec-specific operators fuse decompression, selection, join and aggregation. Splitting the workload between CPU (uncompressed in RAM) and GPU (compressed on device) and combining partial aggregates yields a throughput of 3.76 GiB/s, which is 15% higher than GPU-only execution. The results are the basis for a cost-model for data and operator placement.

Datenbank-Spektrum
University of Bamberg (DE)
Deutsche Forschungsgemeinschaft
Openalex Percentile: Top 6%
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.