Back to papers
PairwiseHist: Fast, Accurate and Space-Efficient Approximate Query Processing with Data Compression
Summary: PairwiseHist: histogram-based AQP using recursive hypothesis testing to produce accurate pairwise-aware synopses. Operates directly on Generalized Deduplication-compressed data, giving higher accuracy, lower latency, much smaller synopses and faster builds.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 13386
- Venue
- VLDB
- Year
- 2024
- Pagerank
- 4.3434046e-05
- Overall Rank
- 9,431 | 34.40%
- DOI
-
10.14778/3648160.3648181
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 17 of 17 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 327 |
Balancing Histogram Optimality and Practicality for Query Result Size Estimation |
1995 |
SIGMOD |
0.00027308479 |
| 608 |
DeepDB: Learn from Data, not from Queries! |
2020 |
VLDB |
0.00019235898 |
| 1,204 |
VerdictDB: Universalizing Approximate Query Processing |
2018 |
SIGMOD |
0.00013319541 |
| 1,260 |
Dynamic Sample Selection for Approximate Query Processing |
2003 |
SIGMOD |
0.00012993347 |
| 1,574 |
Approximate Query Processing: No Silver Bullet |
2017 |
SIGMOD |
0.00011287495 |
| 1,874 |
Knowing When You’re Wrong: Building Fast and Reliable Approximate Query Processing Systems |
2014 |
SIGMOD |
0.00010244443 |
| 1,981 |
Improved Selectivity Estimation by Combining Knowledge from Sampling and Synopses |
2018 |
VLDB |
9.8687545e-05 |
| 2,129 |
IDEBench: A Benchmark for Interactive Data Exploration |
2020 |
SIGMOD |
9.480002e-05 |
| 2,365 |
The Analytical Bootstrap: a New Method for Fast Error Estimation in Approximate Query Processing |
2014 |
SIGMOD |
8.9551432e-05 |
| 2,501 |
DBEst: Revisiting Approximate Query Processing Engines with Machine Learning Models |
2019 |
SIGMOD |
8.6453446e-05 |
| 3,944 |
AQP++: Connecting Approximate Query Processing With Aggregate Precomputation for Interactive Analytics |
2018 |
SIGMOD |
6.6078243e-05 |
| 4,831 |
DigitHist: a Histogram-Based Data Summary with Tight Error Bounds |
2017 |
VLDB |
5.8924198e-05 |
| 5,879 |
Fast and Near–Optimal Algorithms for Approximating Distributions by Histograms |
2015 |
PODS |
5.2908101e-05 |
| 6,230 |
Learned Approximate Query Processing: Make it Light, Accurate and Fast |
2021 |
CIDR |
5.145989e-05 |
| 6,740 |
Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing |
2021 |
SIGMOD |
4.944395e-05 |
| 8,393 |
LAQy: Efficient and Reusable Query Approximations via Lazy Sampling |
2023 |
SIGMOD |
4.5280102e-05 |
| 9,107 |
NeuroSketch: Fast and Approximate Evaluation of Range Aggregate Queries with Neural Networks |
2023 |
SIGMOD |
4.3950706e-05 |
Semantically Similar Papers