Back to papers
A Fast, Mergeable, and LDP Compatible Sketch for Counting the Number of Distinct Values in Fully Dynamic Tables
Summary: GMod: fast, mergeable NDV sketch for fully dynamic tables with LDP. Deletions with minimal overhead via a single discrete uniform random variable; a lightweight NDV estimator delivers ~3x speed and 8x LDP accuracy, using 1/3 memory vs SOTA.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 7314
- Venue
- SIGMOD
- Year
- 2026
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,012 | 30.35%
- DOI
-
10.1145/3749157
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 378 |
Towards Estimation Error Guarantees for Distinct Values |
2000 |
PODS |
0.0002497492 |
| 383 |
An Optimal Algorithm for the Distinct Elements Problem |
2010 |
PODS |
0.00024820873 |
| 659 |
The Making of TPC-DS |
2006 |
VLDB |
0.00018500853 |
| 1,683 |
Cardinality Estimation: An Experimental Survey |
2018 |
VLDB |
0.00010922679 |
| 3,102 |
Processing Set Expressions over Continuous Update Streams |
2003 |
SIGMOD |
7.5586568e-05 |
| 3,702 |
Every Row Counts: Combining Sketches and Sampling for Accurate Group-By Result Estimates |
2019 |
CIDR |
6.8295759e-05 |
| 5,673 |
Distributed Set-Expression Cardinality Estimation |
2004 |
VLDB |
5.3780919e-05 |
| 6,889 |
Better Cardinality Estimators for HyperLogLog, PCSA, and Beyond |
2023 |
PODS |
4.893581e-05 |
| 7,709 |
UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting |
2024 |
VLDB |
4.6720658e-05 |
| 10,946 |
An LDP Compatible Sketch for Securely Approximating Set Intersection Cardinalities |
2024 |
SIGMOD |
4.1945683e-05 |
| 11,182 |
An Effective and Differentially Private Protocol for Secure Distributed Cardinality Estimation |
2023 |
SIGMOD |
4.1945683e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 6,244 |
Approximate Distinct Counts for Billions of Datasets |
2019 |
SIGMOD |
5.139669e-05 |
| 6,599 |
Local Differentially Private Heavy Hitter Detection in Data Streams with Bounded Memory |
2024 |
SIGMOD |
4.9973567e-05 |
| 2,434 |
Optimizing error of high-dimensional statistical queries under differential privacy |
2018 |
VLDB |
8.8278955e-05 |
| 3,702 |
Every Row Counts: Combining Sketches and Sampling for Accurate Group-By Result Estimates |
2019 |
CIDR |
6.8295759e-05 |
| 2,437 |
gSketch: On Query Estimation in Graph Streams |
2012 |
VLDB |
8.8231651e-05 |
| 2,894 |
Pan-private Algorithms Via Statistics on Sketches |
2011 |
PODS |
7.9474698e-05 |
| 8,697 |
Convolution and Cross-Correlation of Count Sketches Enables Fast Cardinality Estimation of Multi-Join Queries |
2024 |
SIGMOD |
4.4657888e-05 |
| 10,480 |
Efficient and Accurate Differentially Private Cardinality Continual Releases |
2025 |
SIGMOD |
4.1945683e-05 |
| 11,182 |
An Effective and Differentially Private Protocol for Secure Distributed Cardinality Estimation |
2023 |
SIGMOD |
4.1945683e-05 |
| 10,946 |
An LDP Compatible Sketch for Securely Approximating Set Intersection Cardinalities |
2024 |
SIGMOD |
4.1945683e-05 |