PilotDB: Database-Agnostic Online Approximate Query Processing with A Priori Error Guarantees
Yuxuan Zhu, Tengjun Jin, Stefanos Baziotis, Chengsong Zhang, Charith Mendis, Daniel D. Kang
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 34fa6d71-9c5e-45d2-82f1-270bc6bb61f7Cited by top-tier papers1
Ask how each one uses itBuilds on8
- Learning a Partitioning Advisor for Cloud DatabasesBenjamin Hilprecht, Carsten Binnig, Uwe RöhmSIGMOD 2020 · 64 citations
- DSB: A Decision Support Benchmark for Workload-Driven and Traditional Database SystemsBailu Ding, Surajit Chaudhuri, Johannes Gehrke, Vivek R. NarasayyaVLDB 2021 · 62 citations
- Database Benchmarking for Supporting Real-Time Interactive Querying of Large DataLeilani Battle, Philipp Eichmann, Marco Angelini, Tiziana Catarci et al.SIGMOD 2020 · 35 citations
- Accelerating Approximate Aggregation Queries with Expensive PredicatesDaniel Kang, John Guibas, Peter Bailis, Tatsunori Hashimoto et al.VLDB 2021 · 34 citations
- Accelerating Aggregation Queries on Unstructured Streams of DataMatthew Russo, Tatsunori Hashimoto, Daniel Kang, Yi Sun et al.VLDB 2023 · 10 citations
Related papers
- A Backend-Agnostic Compiler for Approximate Query Processing with Probabilistic Tensor AlgebraJingwen Pan, James Cheney, Amir ShaikhhaSIGMOD 2026
- LAQy: Efficient and Reusable Query Approximations via Lazy SamplingViktor Sanca, Periklis Chrysogelos, Anastasia AilamakiSIGMOD 2023 · 5 citations
- ShadowAQP: Efficient Approximate Group-by and Join Query via Attribute-oriented Sample Size Allocation and Data GenerationRong Gu, Han Li, Haipeng Dai, Wenjie Huang et al.VLDB 2023 · 9 citations
- AQD: Online Adaptive Query Dispatcher for HTAP DatabasesYang Wu, Tongliang Li, Xuanhe Zhou, Jianying Wang et al.VLDB 2026
- Conditional Generative Model Based Predicate-Aware Query ApproximationNikhil Sheoran, Subrata Mitra, Vibhor Porwal, Siddharth Ghetia et al.AAAI 2022 · 14 citations
