LAQy: Efficient and Reusable Query Approximations via Lazy Sampling
Summary: LAQy enables lazy, reusable samples for online AQP that adapt to changing predicates. It merges and expands samples to cross-query reuse, avoiding per-query sampling, with 2.5–19.3x speedups on a code-generation-based in-memory engine under unpredictable workloads. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Viktor Sanca (EPFL)
- 2. Periklis Chrysogelos (Oracle)
- 3. Anastasia Ailamaki (EPFL)
BibTeX Citation
@inproceedings{sanca_sigmod23,
title = {{LAQy: Efficient and Reusable Query Approximations via Lazy Sampling}},
author = {Sanca, Viktor and Chrysogelos, Periklis and Ailamaki, Anastasia},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3589319},
url = {https://dl.acm.org/doi/10.1145/3589319},
year = {2023}
}
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,351 | PairwiseHist: Fast, Accurate and Space-Efficient Approximate Query Processing with Data Compression | 2024 | VLDB | 5.6354898e-05 |
| 10,760 | FAAQP: Fast and Accurate Approximate Query Processing based on Bitmap-augmented Sum-Product Network | 2025 | SIGMOD | 5.093636e-05 |
| 10,774 | PLM4NDV: Minimizing Data Access for Number of Distinct Values Estimation with Pre-trained Language Models | 2025 | SIGMOD | 5.093636e-05 |
| 11,194 | Enabling Adaptive Sampling for Intra-Window Join: Simultaneously Optimizing Quantity and Quality | 2024 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 23 of 23 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,872 | The Analytical Bootstrap: a New Method for Fast Error Estimation in Approximate Query Processing | 2014 | SIGMOD |
| 2 | 5,743 | Joins on Samples: A Theoretical Guide for Practitioners | 2020 | VLDB |
| 3 | 909 | Dynamic Sample Selection for Approximate Query Processing | 2003 | SIGMOD |
| 4 | 11,484 | Approximate Queries over Concurrent Updates | 2023 | VLDB |
| 5 | 3,366 | AQP++: Connecting Approximate Query Processing With Aggregate Precomputation for Interactive Analytics | 2018 | SIGMOD |
| 6 | 819 | Quickr: Lazily Approximating Complex AdHoc Queries in BigData Clusters | 2016 | SIGMOD |
| 7 | 1,401 | Knowing When You’re Wrong: Building Fast and Reliable Approximate Query Processing Systems | 2014 | SIGMOD |
| 8 | 1,962 | Sample + Seek: Approximating Aggregates with Distribution Precision Guarantee | 2016 | SIGMOD |
| 9 | 6,206 | Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing | 2021 | SIGMOD |
| 10 | 10,634 | Efficient Approximate Query Processing with Block Sampling | 2025 | CIDR |