Skip to content

High-Throughput Chunk-Based GPU Bitmap Compression for Dense Retrieval Workloads

2026 · International Conference on Conceptual Structures · pp. 579-594 · 0 citations · 32 references
Computer Science

TL;DR

This work establishes a basis for GPU-resident computational frameworks, allowing for the elimination of the overhead associated with decompression in high-scale filtering, Graph Neural Networks (GNN) pre-processing, and in-situ scientific analytics.

View source

Similar papers

Book Open access Sep 2026

A Low-Overhead, Lightweight, Lossless GPU Compression Algorithm for Numerical Simulations

HPC (High Performance Computing) applications such as numerical simulations are memory-intensive. As memory grows scarce compared to compute power, compression could alleviate hardware demands by reducing memory footprint at runtime, especially on GPU. Existing compression algorithms for scientific data are not specifi...

T. Hovi, François Letierce, L. Lucas · 0 citations

FitFloat: Read/Write Random-Access Compressed Floating-Point Arrays for GPUs

FitFloat is presented, a drop-in floating-point array replacement supporting user-specified precision on GPUs with the goal of reducing storage requirements of scientific applications while maximizing performance over Unified Memory.

Andrew Rodriguez, Martin Burtscher · 0 citations
Open access Sep 2026

Compression-Aware GPU Buffer Management

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 throu...

Maha Alwahibi, Maximilian E. Schüle · 0 citations
Preprint Sep 2026

FastPair: GPU-Optimized String Decoding

Modern data systems compress data at rest and decompress it only when needed to preserve interconnect bandwidth. This design is often inefficient on GPU-based compute platforms because many conventional compression techniques exhibit serial data dependencies that limit GPU parallelism, leaving resources idle. Recent NV...

J. Isaacs, Francesco Gargiulo, P. Boncz et al. · 0 citations
Aug 2026

Overlay Bitmap Encoding for Efficient Consumption of Apache Parquet Files

Overlay bitmaps is introduced, a data structure that organizes column chunks into sequences of bitmap parts, each representing distinct column values that are further compressed using run-length encoding, which surpasses traditional dictionary encoding in compression and reduces load execution times by up to two orders...

Günes Aluç, Daniel J. Farrar, Manoj Kumar Sharma et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.