Approximate Distinct Counts for Billions of Datasets
Summary: Single-pass blends CountMin and HyperLogLog to estimate billions of distinct counts and enable multi-resolution aggregations. Offers correctness guarantees, tight error bounds, and consistent estimators with exact asymptotic coverage for multisets. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Daniel Ting (Tableau Research)
BibTeX Citation
@inproceedings{ting_sigmod19,
title = {{Approximate Distinct Counts for Billions of Datasets}},
author = {Ting, Daniel},
series = {{SIGMOD} '19},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3299869.3319897},
url = {https://dl.acm.org/doi/10.1145/3299869.3319897},
year = {2019}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,920 | UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting | 2024 | VLDB | 5.7390922e-05 |
| 7,256 | Weighted Distinct Sampling: Cardinality Estimation for SPJ Queries | 2021 | SIGMOD | 5.6625146e-05 |
| 7,290 | Learning to be a Statistician: Learned Estimator for Number of Distinct Values | 2022 | VLDB | 5.6540503e-05 |
| 7,551 | Enabling Efficient and General Subpopulation Analytics in Multidimensional Data Streams | 2022 | VLDB | 5.6006414e-05 |
| 8,527 | View Selection over Knowledge Graphs in Triple Stores | 2021 | VLDB | 5.4119882e-05 |
| 10,110 | Adaptive threshold sampling | 2022 | SIGMOD | 5.1347137e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 122 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00031260115 |
| 482 | An Optimal Algorithm for the Distinct Elements Problem | 2010 | PODS | 0.00017772185 |
| 1,045 | Sketching Streams Through the Net: Distributed Approximate Query Tracking | 2005 | VLDB | 0.00012440928 |
| 2,792 | All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis | 2014 | PODS | 8.1191853e-05 |
| 2,878 | Data Sketches for Disaggregated Subset Sum and Frequent Item Estimation | 2018 | SIGMOD | 8.0058242e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 401 | Deep Unsupervised Cardinality Estimation | 2020 | VLDB |
| 2 | 10,759 | Efficient and Accurate Differentially Private Cardinality Continual Releases | 2025 | SIGMOD |
| 3 | 11,164 | An LDP Compatible Sketch for Securely Approximating Set Intersection Cardinalities | 2024 | SIGMOD |
| 4 | 5,516 | Distributed Set-Expression Cardinality Estimation | 2004 | VLDB |
| 5 | 689 | On Synopses for Distinct-Value Estimation Under Multiset Operations | 2007 | SIGMOD |
| 6 | 12,669 | A Simple and Efficient Estimation Method for Stream Expression Cardinalities | 2007 | VLDB |
| 7 | 11,503 | Bayesian Sketches for Volume Estimation in Data Streams | 2023 | VLDB |
| 8 | 6,934 | Better Cardinality Estimators for HyperLogLog, PCSA, and Beyond | 2023 | PODS |
| 9 | 7,747 | Convolution and Cross-Correlation of Count Sketches Enables Fast Cardinality Estimation of Multi-Join Queries | 2024 | SIGMOD |
| 10 | 1,516 | Cardinality Estimation: An Experimental Survey | 2018 | VLDB |