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
- Chengsong Zhang (ORCID: https://orcid.org/0009-0008-2120-1879)
- Charith Mendis (ORCID: https://orcid.org/0000-0002-8140-2321)
- Stefanos Baziotis (ORCID: https://orcid.org/0009-0001-4061-7094)
- Daniel Kang (ORCID: https://orcid.org/0000-0001-9860-9938)
- Yuxuan Zhu (ORCID: https://orcid.org/0009-0001-6738-8930)
- Tengjun Jin (ORCID: https://orcid.org/0009-0005-0353-4184)
Institutions
- University of Illinois Urbana-Champaign (US)
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