Quickr: Lazily Approximating Complex AdHoc Queries in BigData Clusters
Summary: Quickr lazily injects samplers into optimized query plans, approximating complex ad-hoc queries without precomputed samples. Its universe sampler supports multi-input joins, while accuracy analysis preserves groups and bounds aggregates; TPC-DS achieves median 2× resource reduction at cluster scale. (summarized by gpt-5.6-luna on Jul 21 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Srikanth Kandula (Microsoft)
- 2. Anil Shanbhag (Microsoft)
- 3. Aleksandar Vitorovic (Microsoft)
- 4. Matthaios Olma (Microsoft)
- 5. Robert Grandl (Microsoft)
- 6. Surajit Chaudhuri (Microsoft)
- 7. Bolin Ding (Microsoft)
BibTeX Citation
@inproceedings{kandula_sigmod16,
title = {{Quickr: Lazily Approximating Complex AdHoc Queries in BigData Clusters}},
author = {Kandula, Srikanth and Shanbhag, Anil and Vitorovic, Aleksandar and Olma, Matthaios and Grandl, Robert and Chaudhuri, Surajit and Ding, Bolin},
series = {{SIGMOD} '16},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2882903.2882940},
url = {https://dl.acm.org/doi/10.1145/2882903.2882940},
year = {2016}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 53 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,845 | Query-Driven Learning for Next Generation Predictive Modeling & Analytics | 2019 | SIGMOD | 5.093636e-05 |
| 11,902 | Tighter Upper Bounds for Join Cardinality Estimates | 2018 | SIGMOD | 5.093636e-05 |
| 11,916 | Demonstration of VerdictDB, the Platform-Independent AQP System | 2018 | SIGMOD | 5.093636e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 25 of 25 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 | 909 | Dynamic Sample Selection for Approximate Query Processing | 2003 | SIGMOD |
| 2 | 1,256 | Sampling-Based Query Re-Optimization | 2016 | SIGMOD |
| 3 | 6,206 | Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing | 2021 | SIGMOD |
| 4 | 136 | Join Synopses for Approximate Query Answering | 1999 | SIGMOD |
| 5 | 1,401 | Knowing When You’re Wrong: Building Fast and Reliable Approximate Query Processing Systems | 2014 | SIGMOD |
| 6 | 8,161 | LAQy: Efficient and Reusable Query Approximations via Lazy Sampling | 2023 | SIGMOD |
| 7 | 149 | New Sampling-Based Summary Statistics for Improving Approximate Query Answers | 1998 | SIGMOD |
| 8 | 8,108 | Experiences with Approximating Queries in Microsoft’s Production Big-Data Clusters | 2019 | VLDB |
| 9 | 10,634 | Efficient Approximate Query Processing with Block Sampling | 2025 | CIDR |
| 10 | 1,962 | Sample + Seek: Approximating Aggregates with Distribution Precision Guarantee | 2016 | SIGMOD |