Back to papers
CoopStore: Optimizing Precomputed Summaries for Aggregation
Summary: CoopStore optimizes per-segment item-frequency and quantile summaries to improve aggregation accuracy without scanning raw data. By leveraging extra memory for construction and aggregation, it yields tighter combined results than mergeable summaries, with provable worst-case guarantees and up to 25x interval and 4.5x data-cube error reduction.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 12107
- Venue
- VLDB
- Year
- 2020
- Pagerank
- 4.4709116e-05
- Overall Rank
- 8,673 | 39.67%
- DOI
-
10.14778/3407790.3407817
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 20 of 20 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 11 |
Implementing Data Cubes Efficiently |
1996 |
SIGMOD |
0.0011708144 |
| 14 |
Online Aggregation |
1997 |
SIGMOD |
0.0010801504 |
| 126 |
Space-Efficient Online Computation of Quantile Summaries |
2001 |
SIGMOD |
0.00044744986 |
| 402 |
Mergeable Summaries |
2012 |
PODS |
0.00024196343 |
| 429 |
The Aqua Approximate Query Answering System |
1999 |
SIGMOD |
0.00023476494 |
| 719 |
Understanding Hierarchical Methods for Differentially Private Histograms |
2013 |
VLDB |
0.00017626484 |
| 848 |
Approximate Counts and Quantiles over Sliding Windows |
2004 |
PODS |
0.0001597308 |
| 1,359 |
Range Queries in OLAP Data Cubes |
1997 |
SIGMOD |
0.0001238588 |
| 1,588 |
Druid: A Real-time Analytical Data Store |
2014 |
SIGMOD |
0.00011239313 |
| 2,914 |
DDSketch: A Fast and Fully-Mergeable Quantile Sketch with Relative-Error Guarantees |
2019 |
VLDB |
7.9118579e-05 |
| 2,953 |
Moment-Based Quantile Sketches for Efficient High Cardinality Aggregation Queries |
2018 |
VLDB |
7.8267643e-05 |
| 3,271 |
Data Sketches for Disaggregated Subset Sum and Frequent Item Estimation |
2018 |
SIGMOD |
7.2968732e-05 |
| 3,399 |
Answering Range Queries Under Local Differential Privacy |
2019 |
VLDB |
7.1408089e-05 |
| 3,944 |
AQP++: Connecting Approximate Query Processing With Aggregate Precomputation for Interactive Analytics |
2018 |
SIGMOD |
6.6078243e-05 |
| 4,767 |
Pinot: Realtime OLAP for 530 Million Users |
2018 |
SIGMOD |
5.9364731e-05 |
| 4,831 |
DigitHist: a Histogram-Based Data Summary with Tight Error Bounds |
2017 |
VLDB |
5.8924198e-05 |
| 6,298 |
Hillview: A trillion-cell spreadsheet for big data |
2019 |
VLDB |
5.1226987e-05 |
| 6,431 |
Finding Global Icebergs over Distributed Data Sets |
2006 |
PODS |
5.0654592e-05 |
| 8,594 |
Stream Frequency over Interval Queries |
2019 |
VLDB |
4.4891331e-05 |
| 8,605 |
Structure-Aware Sampling: Flexible and Accurate Summarization |
2011 |
VLDB |
4.4865144e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 2,953 |
Moment-Based Quantile Sketches for Efficient High Cardinality Aggregation Queries |
2018 |
VLDB |
7.8267643e-05 |
| 8,640 |
Efficacious Data Cube Exploration by Semantic Summarization and Compression |
2003 |
VLDB |
4.4792752e-05 |
| 3,991 |
Beyond Simple Aggregates: Indexing for Summary Queries |
2011 |
PODS |
6.5553055e-05 |
| 3,310 |
Optimal and Approximate Computation of Summary Statistics for Range Aggregates |
2001 |
PODS |
7.2408955e-05 |
| 11,901 |
Compact Summaries over Large Datasets |
2015 |
PODS |
4.1945683e-05 |
| 8,605 |
Structure-Aware Sampling: Flexible and Accurate Summarization |
2011 |
VLDB |
4.4865144e-05 |
| 9,431 |
PairwiseHist: Fast, Accurate and Space-Efficient Approximate Query Processing with Data Compression |
2024 |
VLDB |
4.3434046e-05 |
| 2,580 |
Sample + Seek: Approximating Aggregates with Distribution Precision Guarantee |
2016 |
SIGMOD |
8.5058814e-05 |
| 6,740 |
Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing |
2021 |
SIGMOD |
4.944395e-05 |
| 10,927 |
Computing A Well-Representative Summary of Conjunctive Query Results |
2024 |
PODS |
4.1945683e-05 |