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)
@inproceedings{li_sigmod26,
title = {{A Fast, Mergeable, and LDP Compatible Sketch for Counting the Number of Distinct Values in Fully Dynamic Tables}},
author = {Li, Zhicheng and Wang, Pinghui and Lin, Zeli and Chen, Bichun and Xie, Dongdong},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3749157},
url = {https://dl.acm.org/doi/10.1145/3749157},
year = {2026}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
Rank
Citing Paper
Year
Venue
Pagerank
PreviousPage 1 / 1Next
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.