Skip to content
Preprint

Oasis: Hiding the Cost of Querying Parquet Files in the Datapath

Aug 2026 · 0 citations · 54 references
Computer Science

TL;DR

Oasis is a data-processing SmartNIC that offloads Parquet decoding into the network datapath as a custom hardware accelerator, and shows that Oasis hides the cost of Parquet decoding behind the network datapath with minimal overhead, overlapping the scan with the remainder of the query execution.

Abstract

Cloud-native database systems disaggregate compute and storage resources to improve cost efficiency over traditional monolithic architectures through elasticity and resource pooling. Studies of production data warehouse workloads show that scans (including round trips to storage) account for roughly half of total query runtime. Data lakes and lakehouses amplify this bottleneck through per-query decoding of storage-optimized, compressed file formats such as Parquet. As storage and network bandwidth continue to outpace CPU cost-performance, the CPU cycles spent on decoding increasingly undermine the cloud's cost-efficiency promise. This has led to a wave of specialization across the stack with custom hardware at cloud-vendor scale at the extreme end. We build on this trend and present Oasis, a data-processing SmartNIC that offloads Parquet decoding into the network datapath as a custom hardware accelerator. Oasis features a hardware decoder architecture, software abstraction layer, and end-to-end integration with DuckDB. Our evaluation shows that Oasis hides the cost of Parquet decoding behind the network datapath with minimal overhead, overlapping the scan with the remainder of the query execution. In the best case, this almost doubles DuckDB query throughput.

View source

Similar papers

The Free Lunch Has a Queue: Characterizing On-chip Compression Accelerators for Analytics

It is found that hardware offload is not a universal replacement for CPU compression, and compression should be scheduled dynamically: route blocks by codec, operation, size, and accelerator load; cap per-device sub-mission concurrency; and fall back to software when offload is unsupported or saturated.

Yi Jiang, Antonio Boffa, Hamish Nicholson et al. · 0 citations
Aug 2026

TQP++: Bridging ML Compilers and Analytical Query Processing on GPUs

This paper presents TQP++, an ML-compiler-native analytical query processor that repurposes ML compiler infrastructure to close this gap, achieving high performance and hardware portability from a single codebase.

Wei Cui, Peng Cheng, Carlo Curino 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
Aug 2026

Lakebase: Serverless Postgres over Open Lake Storage

Lakebase is presented, a new open database architecture that decouples transactional compute from storage while placing database data directly in low-cost cloud object stores in open format and analyzes how this architecture reduces operational complexity, enables Git-like database workflows, improves failure recovery...

Jasraj Dange, Andrei Drâguş, Ali Ghodsi et al. · 0 citations
Aug 2026

A Unified Bandwidth Orchestration Framework for Hierarchical Data Storage Systems

This paper presents an in-depth analysis of data migration behavior in commercial HSSs, uncovering substantial performance variability when multiple migration tasks execute concurrently, and proposes PASCAL, a system-level bandwidth orchestration framework that improves performance robustness in production-grade HSSs.

Ji Zhang, Li Liu, André Brinkmann et al. · 0 citations
Book Aug 2026

WADO: A Distributed WORM Storage Service for Asynchronous Data Operations

WADO is presented, a distributed write-once-read-many (WORM) object-store runtime for data-centric workloads that closes this gap through three coordinated mechanisms: scope-centric processing, explicit pipeline decomposition, and interference-aware explicit parallelism.

Karim Youssef, Hariharan Devarajan, Nikoli Dryden 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.