DBScholar

Back to papers

An Optimal Algorithm for the Distinct Elements Problem

Summary: First algorithm achieving information-theoretically optimal space O(ε^-2 + log n) bits for (1±ε)-approximate distinct elements in data streams, closing decades of work. Also attains worst-case O(1) update and reporting time and extends to Hamming-norm estimation. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
h68fa01eaea4d21b2
Venue
PODS
Year
2010
Pagerank
0.00017387321
Overall Rank
494 | 96.69%
DOI
10.1145/1807085.1807094

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{kane_pods10,
        address = {New York, NY, USA},
        series = {{PODS} '10},
        title = {{An Optimal Algorithm for the Distinct Elements Problem}},
        url = {https://dl.acm.org/doi/10.1145/1807085.1807094},
        doi = {10.1145/1807085.1807094},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Kane, Daniel M. and Nelson, Jelani and Woodruff, David P.},
        year = {2010}
}

Incoming Citations (Sorted by Pagerank)

Showing 32 of 32 citing papers.

Rank Citing Paper Year Venue Pagerank
456 Mergeable Summaries 2012 PODS 0.0001791284
805 Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems 2011 PODS 0.00013794691
1,169 Graph Sketches: Sparsification, Spanners, and Subgraphs 2012 PODS 0.00011726145
2,852 All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis 2014 PODS 7.9412916e-05
3,050 Pan-private Algorithms Via Statistics on Sketches 2011 PODS 7.7067158e-05
3,858 Is Min-Wise Hashing Optimal for Summarizing Set Intersection? 2014 PODS 6.9676872e-05
4,330 MNC: Structure-Exploiting Sparsity Estimation for Matrix Expressions 2019 SIGMOD 6.6595681e-05
4,381 A Framework for Adversarially Robust Streaming Algorithms 2020 PODS 6.6265793e-05
5,093 Persistent Bloom Filter: Membership Testing for the Entire History 2018 SIGMOD 6.277732e-05
5,373 At-the-time and Back-in-time Persistent Sketches 2021 SIGMOD 6.1569337e-05
5,778 Data Streams with Bounded Deletions 2018 PODS 5.9977531e-05
6,121 The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication 2015 PODS 5.8800995e-05
6,122 Approximate Distinct Counts for Billions of Datasets 2019 SIGMOD 5.879545e-05
7,074 Better Cardinality Estimators for HyperLogLog, PCSA, and Beyond 2023 PODS 5.6064198e-05
7,364 Weighted Distinct Sampling: Cardinality Estimation for SPJ Queries 2021 SIGMOD 5.5418075e-05
7,472 On the Feasibility of Forgetting in Data Streams 2024 PODS 5.5168918e-05
7,849 Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model 2019 PODS 5.4410785e-05
8,085 Subspace Exploration: Bounds on Projected Frequency Estimation 2021 PODS 5.3942942e-05
8,433 Streaming Algorithms for Measuring H-Impact 2017 PODS 5.3350162e-05
10,379 On Sketching Trimmed Statistics 2026 PODS 4.9793485e-05
10,397 Representation Obliviousness and Pseudodeterminism in Streaming Algorithms 2026 PODS 4.9793485e-05
10,521 A Fast, Mergeable, and LDP Compatible Sketch for Counting the Number of Distinct Values in Fully Dynamic Tables 2026 SIGMOD 4.9793485e-05
11,094 Robust Statistical Analysis on Streaming Data with Near-Duplicates in General Metric Spaces 2025 PODS 4.9793485e-05
11,690 Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation 2023 PODS 4.9793485e-05
11,691 Applications of Sketching and Pathways to Impact 2023 PODS 4.9793485e-05
11,837 Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size 2022 PODS 4.9793485e-05
11,938 Model Counting meets F0 Estimation 2021 PODS 4.9793485e-05
11,947 Estimating the Size of Union of Sets in Streaming Models 2021 PODS 4.9793485e-05
12,194 Distributed Statistical Estimation of Matrix Products with Applications 2018 PODS 4.9793485e-05
12,197 Distinct Sampling on Streaming Data with Near-Duplicates 2018 PODS 4.9793485e-05
12,199 Reconciling Graphs and Sets of Sets 2018 PODS 4.9793485e-05
12,329 Streaming Algorithms for Robust Distinct Elements 2016 SIGMOD 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Rank Cited Paper Year Venue Pagerank
1 Access Path Selection in a Relational Database Management System 1979 SIGMOD 0.0023947656
267 Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports 2001 VLDB 0.00022722971
336 The Aqua Approximate Query Answering System 1999 SIGMOD 0.00020657819
435 Mining Database Structure; Or, How to Build a Data Quality Browser 2002 SIGMOD 0.0001832766
655 Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies 1996 VLDB 0.00015070228
707 On Synopses for Distinct-Value Estimation Under Multiset Operations 2007 SIGMOD 0.00014640173
2,233 Multi-Dimensional Clustering: A New Data Layout Scheme in DB2 2003 SIGMOD 8.7931449e-05
3,211 Comparing Data Streams Using Hamming Norms (How to Zero In) 2002 VLDB 7.536045e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 3,272 Processing Set Expressions over Continuous Update Streams 2003 SIGMOD
2 12,959 A Simple and Efficient Estimation Method for Stream Expression Cardinalities 2007 VLDB
3 6,570 An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems 2016 PODS
4 11,471 Streaming Algorithms with Few State Changes 2024 PODS
5 909 Finding Frequent Items in Data Streams 2008 VLDB
6 3,211 Comparing Data Streams Using Hamming Norms (How to Zero In) 2002 VLDB
7 13,014 Join-Distinct Aggregate Estimation over Update Streams 2005 PODS
8 12,197 Distinct Sampling on Streaming Data with Near-Duplicates 2018 PODS
9 11,945 Frequent Elements with Witnesses in Data Streams 2021 PODS
10 12,329 Streaming Algorithms for Robust Distinct Elements 2016 SIGMOD