PilotDB: Database-Agnostic Online Approximate Query Processing with A Priori Error Guarantees

After decades of research in approximate query processing (AQP), its adoption in the industry remains limited. Existing methods struggle to simultaneously provide user-specified error guarantees, eliminate maintenance overheads, and avoid modifications to database management systems. To address these challenges, we introduce two novel techniques, TAQA and BSAP. TAQA is a two-stage online AQP algorithm that achieves all three properties for arbitrary queries. However, it can be slower than exact queries if we use standard row-level sampling. BSAP resolves this by enabling block-level sampling with statistical guarantees in TAQA. We implement TAQA and BSAP in a prototype middleware system, PilotDB, that is compatible with all DBMSs supporting efficient block-level sampling. We evaluate PilotDB on PostgreSQL, SQL Server, and DuckDB over real-world benchmarks, demonstrating up to 126X speedups when running with a 5% guaranteed error.

Authors

Institutions

Publication Details

Journal
Proceedings of the ACM on Management of Data
Published
2025-06-17
DOI
https://doi.org/10.1145/3725335
Citations
1
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
3.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

PilotDB: Database-Agnostic Online Approximate Query Processing with A Priori Error Guarantees

Chengsong Zhang, Charith Mendis, Stefanos Baziotis, Daniel Kang et al.
1 citations
Proceedings of the ACM on Management of Data
Cloud Computing and Resource Management
3.25
article

PilotDB: Database-Agnostic Online Approximate Query Processing with A Priori Error Guarantees

Chengsong Zhang, Charith Mendis, Stefanos Baziotis, Daniel Kang, Yuxuan Zhu, Tengjun Jin
article en
1 citations

Abstract

After decades of research in approximate query processing (AQP), its adoption in the industry remains limited. Existing methods struggle to simultaneously provide user-specified error guarantees, eliminate maintenance overheads, and avoid modifications to database management systems. To address these challenges, we introduce two novel techniques, TAQA and BSAP. TAQA is a two-stage online AQP algorithm that achieves all three properties for arbitrary queries. However, it can be slower than exact queries if we use standard row-level sampling. BSAP resolves this by enabling block-level sampling with statistical guarantees in TAQA. We implement TAQA and BSAP in a prototype middleware system, PilotDB, that is compatible with all DBMSs supporting efficient block-level sampling. We evaluate PilotDB on PostgreSQL, SQL Server, and DuckDB over real-world benchmarks, demonstrating up to 126X speedups when running with a 5% guaranteed error.

Proceedings of the ACM on Management of DataVol. 3(3)
University of Illinois Urbana-Champaign (US)
Industry, innovation and infrastructure
Openalex Percentile: Top 8%
Cloud Computing and Resource Management
3.25
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.

PilotDB: Database-Agnostic Online Approximate Query Processing with A Priori Error Guarantees — Chengsong Zhang, Charith Mendis, et al. · Proceedings of the ACM on Management of Data (2025) | TGRS Research Map | TGRS