DBScholar

Back to papers

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)

Paper ID
5193
Venue
SIGMOD
Year
2016
Pagerank
0.00013815639
Overall Rank
819 | 94.39%
DOI
10.1145/2882903.2882940

Incoming Non-self Citations Over Time

Authors

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 50 of 53 citing papers.

Rank Citing Paper Year Venue Pagerank
772 VerdictDB: Universalizing Approximate Query Processing 2018 SIGMOD 0.00014147905
802 Random Sampling over Joins Revisited 2018 SIGMOD 0.00013907725
1,108 Approximate Query Processing: No Silver Bullet 2017 SIGMOD 0.00012145154
1,468 Towards a Learning Optimizer for Shared Clouds 2019 VLDB 0.00010686496
1,499 Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities 2019 SIGMOD 0.00010564536
1,664 Two-Level Sampling for Join Size Estimation 2017 SIGMOD 0.00010070362
1,799 DBEst: Revisiting Approximate Query Processing Engines with Machine Learning Models 2019 SIGMOD 9.7326398e-05
1,995 Database Learning: Toward a Database that Becomes Smarter Every Time 2017 SIGMOD 9.3403665e-05
3,366 AQP++: Connecting Approximate Query Processing With Aggregate Precomputation for Interactive Analytics 2018 SIGMOD 7.4748604e-05
4,630 Efficient Join Synopsis Maintenance for Data Warehouse 2020 SIGMOD 6.5955933e-05
4,789 Learned Approximate Query Processing: Make it Light, Accurate and Fast 2021 CIDR 6.5072039e-05
5,255 At-the-time and Back-in-time Persistent Sketches 2021 SIGMOD 6.2982495e-05
5,743 Joins on Samples: A Theoretical Guide for Practitioners 2020 VLDB 6.1025457e-05
5,785 BlinkML: Efficient Maximum Likelihood Estimation with Probabilistic Guarantees 2019 SIGMOD 6.0892672e-05
6,121 The Cosmos Big Data Platform at Microsoft: Over a Decade of Progress and a Decade to Look Forward 2021 VLDB 5.9688569e-05
6,206 Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing 2021 SIGMOD 5.9443409e-05
7,256 Weighted Distinct Sampling: Cardinality Estimation for SPJ Queries 2021 SIGMOD 5.6625146e-05
7,316 SpareLLM: Automatically Selecting Task-Specific Minimum-Cost Large Language Models under Equivalence Constraint 2025 SIGMOD 5.646695e-05
7,721 Identifying Insufficient Data Coverage in Databases with Multiple Relations 2020 VLDB 5.5587371e-05
7,787 A Practical Approach to Groupjoin and Nested Aggregates 2021 VLDB 5.5449593e-05
7,847 Biathlon: Harnessing Model Resilience for Accelerating ML Inference Pipelines 2024 VLDB 5.5330423e-05
8,002 Fast and Reliable Missing Data Contingency Analysis with Predicate-Constraints 2020 SIGMOD 5.5085906e-05
8,108 Experiences with Approximating Queries in Microsoft’s Production Big-Data Clusters 2019 VLDB 5.4850569e-05
8,161 LAQy: Efficient and Reusable Query Approximations via Lazy Sampling 2023 SIGMOD 5.4752972e-05
8,191 Probabilistic Database Summarization for Interactive Data Exploration 2017 VLDB 5.4699738e-05
8,204 PilotDB: Database-Agnostic Online Approximate Query Processing with A Priori Error Guarantees 2025 SIGMOD 5.4667903e-05
8,374 SPRINTER: A Fast n-ary Join Query Processing Method for Complex OLAP Queries 2020 SIGMOD 5.4399097e-05
8,492 ShadowAQP: Efficient Approximate Group-by and Join Query via Attribute-oriented Sample Size Allocation and Data Generation 2023 VLDB 5.4145838e-05
8,608 One Size Does Not Fit All: A Bandit-Based Sampler Combination Framework with Theoretical Guarantees 2022 SIGMOD 5.4024561e-05
8,701 Data Driven Approximation with Bounded Resources 2017 VLDB 5.3828806e-05
8,790 Practical Dynamic Extension for Sampling Indexes 2023 SIGMOD 5.3722049e-05
9,245 Towards Observability for Production Machine Learning Pipelines 2022 VLDB 5.2992628e-05
9,392 A Step Toward Deep Online Aggregation 2023 SIGMOD 5.2755515e-05
9,591 Sapprox: Enabling Efficient and Accurate Approximations on Sub-datasets with Distribution-aware Online Sampling 2017 VLDB 5.2518295e-05
9,785 Secure Sampling for Approximate Multi-party Query Processing 2023 SIGMOD 5.2209769e-05
9,832 The Data Interaction Game 2018 SIGMOD 5.2124469e-05
10,093 AB-tree: Index for Concurrent Random Sampling and Updates 2022 VLDB 5.1530576e-05
10,289 Sketch-based Secure Query Processing for Streaming Data 2026 SIGMOD 5.093636e-05
10,542 Secure Multi-Party Sampling over Joins 2026 VLDB 5.093636e-05
10,634 Efficient Approximate Query Processing with Block Sampling 2025 CIDR 5.093636e-05
10,760 FAAQP: Fast and Accurate Approximate Query Processing based on Bitmap-augmented Sum-Product Network 2025 SIGMOD 5.093636e-05
10,831 Holistic query Approximation via RL Modeling 2025 VLDB 5.093636e-05
11,159 PECJ: Stream Window Join on Disorder Data Streams with Proactive Error Compensation 2024 SIGMOD 5.093636e-05
11,194 Enabling Adaptive Sampling for Intra-Window Join: Simultaneously Optimizing Quantity and Quality 2024 SIGMOD 5.093636e-05
11,484 Approximate Queries over Concurrent Updates 2023 VLDB 5.093636e-05
11,625 Accelerating Complex Analytics using Speculation 2021 CIDR 5.093636e-05
11,700 In the Land of Data Streams where Synopses are Missing, One Framework to Bring Them All 2021 VLDB 5.093636e-05
11,736 FlashP: An Analytical Pipeline for Real-time Forecasting of Time-Series Relational Data 2021 VLDB 5.093636e-05
11,749 BitGourmet: Deterministic Approximation via Optimized Bit Selection 2020 CIDR 5.093636e-05
11,781 Demonstration of BitGourmet: Data Analysis via Deterministic Approximation 2020 SIGMOD 5.093636e-05
Previous Page 1 / 2 Next

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.

Rank Cited Paper Year Venue Pagerank
6 Pig Latin: A Not-So-Foreign Language for Data Processing 2008 SIGMOD 0.0010686205
9 Online Aggregation 1997 SIGMOD 0.00077458002
24 Spark SQL: Relational Data Processing in Spark 2015 SIGMOD 0.00054865648
26 Models and Issues in Data Stream Systems 2002 PODS 0.00052982574
30 SCOPE: Easy and Efficient Parallel Processing of Massive Data Sets 2008 VLDB 0.00051174276
32 Hive - A Warehousing Solution Over a Map-Reduce Framework 2009 VLDB 0.00050111008
51 Dremel: Interactive Analysis of Web-Scale Datasets 2010 VLDB 0.0004291425
54 On Random Sampling over Joins 1999 SIGMOD 0.00040810225
122 Approximate Frequency Counts over Data Streams 2002 VLDB 0.00031260115
150 Query Processing, Resource Management, and Approximation in a Data Stream Management System 2003 CIDR 0.00029208207
327 The Aqua Approximate Query Answering System 1999 SIGMOD 0.00021091539
508 Random Sampling for Histogram Construction: How much is enough? 1998 SIGMOD 0.00017275873
553 Congressional Samples for Approximate Answering of Group-By Queries 2000 SIGMOD 0.00016590619
689 On Synopses for Distinct-Value Estimation Under Multiset Operations 2007 SIGMOD 0.00014940023
909 Dynamic Sample Selection for Approximate Query Processing 2003 SIGMOD 0.00013291205
1,009 Online Aggregation for Large MapReduce Jobs 2011 VLDB 0.00012684342
1,064 Scalable Approximate Query Processing With The DBO Engine 2007 SIGMOD 0.00012336248
1,401 Knowing When You’re Wrong: Building Fast and Reliable Approximate Query Processing Systems 2014 SIGMOD 0.00010889902
1,582 SciBORQ: Scientific data management with Bounds On Runtime and Quality 2011 CIDR 0.00010295367
1,827 G-OLA: Generalized On-Line Aggregation for Interactive Analysis on Big Data 2015 SIGMOD 9.6690206e-05
1,872 The Analytical Bootstrap: a New Method for Fast Error Estimation in Approximate Query Processing 2014 SIGMOD 9.5759874e-05
2,413 A Sampling Algebra for Aggregate Estimation 2013 VLDB 8.6116764e-05
2,608 A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries 2001 SIGMOD 8.347674e-05
4,696 Error-bounded Sampling for Analytics on Big Sparse Data 2014 VLDB 6.557612e-05
5,193 Sampling Algorithms in a Stream Operator 2005 SIGMOD 6.3238562e-05
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