DAQ: A New Paradigm for Approximate Query Processing
Summary: DAQ replaces probabilistic AQP with deterministic approximation, forming a closed algebra and key design principles. Demonstrates a deterministic online approximation using a bitsliced index; MSBs first; speedups over exact aggregation and beating sampling for extremes. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 17 of 17 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 14 | Online Aggregation | 1997 | SIGMOD | 0.0010813443 |
| 46 | Simple Random Sampling from Relational Databases | 1986 | VLDB | 0.00071588702 |
| 121 | Improved Query Performance with Variant Indexes | 1997 | SIGMOD | 0.00045429472 |
| 649 | Progressive Approximate Aggregate Queries with a Multi-Resolution Tree Structure | 2001 | SIGMOD | 0.00018652362 |
| 960 | Aqua: A Fast Decision Support System Using Approximate Query Answers | 1999 | VLDB | 0.00015031055 |
| 1,867 | Knowing When You’re Wrong: Building Fast and Reliable Approximate Query Processing Systems | 2014 | SIGMOD | 0.00010264932 |
| 2,424 | The Analytical Bootstrap: a New Method for Fast Error Estimation in Approximate Query Processing | 2014 | SIGMOD | 8.8415494e-05 |
| 3,133 | Relational Confidence Bounds Are Easy With The Bootstrap* | 2005 | SIGMOD | 7.4979168e-05 |
| 3,858 | Bit-Sliced Index Arithmetic | 2001 | SIGMOD | 6.6893766e-05 |
Previous
Page 1 / 1
Next