Database Paper Browser

Back to papers

Compact Summaries over Large Datasets

Summary: Tutorial on designing and analyzing compact, mergeable summaries that capture essential dataset properties for single‑machine storage and querying after distributed parallel construction. Covers count‑distinct estimators and linear sketches for norms/inner products, space/error tradeoffs, mergeability, and efficient algorithms to compute and combine them. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1666
Venue
PODS
Year
2015
Pagerank
4.1945683e-05
Overall Rank
11,901 | 17.21%
DOI
10.1145/2745754.2745781

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
109 Dremel: Interactive Analysis of Web-Scale Datasets 2010 VLDB 0.00048186983
126 Space-Efficient Online Computation of Quantile Summaries 2001 SIGMOD 0.00044744986
402 Mergeable Summaries 2012 PODS 0.00024196343
3,486 Holistic UDAFs at Streaming Speeds 2004 SIGMOD 7.0502199e-05
Previous Page 1 / 1 Next

Semantically Similar Papers