DBScholar

Back to papers

Double-Anonymous Sketch: Achieving Top-K-fairness for Finding Global Top-K Frequent Items

Summary: Proposes Double-Anonymous sketch to compute global top-K across disjoint streams with top-K-fairness. Leverages double-anonymity, hot panning, and early freezing; provides theoretical guarantees and extensive experiments showing substantial error reductions vs state-of-the-art; open-source code. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6644
Venue
SIGMOD
Year
2023
Pagerank
5.5605526e-05
Overall Rank
7,716 | 47.07%
DOI
10.1145/3588933

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{zhao_sigmod23,
        title = {{Double-Anonymous Sketch: Achieving Top-K-fairness for Finding Global Top-K Frequent Items}},
        author = {Zhao, Yikai and Han, Wenchen and Zhong, Zheng and Zhang, Yinda and Yang, Tong and Cui, Bin},
        series = {{SIGMOD} '23},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3588933},
        url = {https://dl.acm.org/doi/10.1145/3588933},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 24 of 24 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
1,294 Augmented Sketch: Faster and More Accurate Stream Processing 2016 SIGMOD 0.00011291308
1,975 Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity 2018 VLDB 9.3645236e-05
2,043 A General-Purpose Counting Filter: Making Every Bit Count 2017 SIGMOD 9.2674387e-05
2,148 Graph Stream Summarization: From Big Bang to Big Crunch 2016 SIGMOD 9.0825156e-05
2,878 Data Sketches for Disaggregated Subset Sum and Frequent Item Estimation 2018 SIGMOD 8.0058242e-05
3,023 Persistent Data Sketching 2015 SIGMOD 7.8398269e-05
3,228 Correlation Sketches for Approximate Join-Correlation Queries 2021 SIGMOD 7.6215176e-05
3,283 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.56675e-05
3,445 Sketching Linear Classifiers over Data Streams 2018 SIGMOD 7.4089141e-05
3,798 Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design 2021 SIGMOD 7.1165678e-05
3,898 BurstSketch: Finding Bursts in Data Streams 2021 SIGMOD 7.0367583e-05
4,691 Fast Processing and Querying of 170TB of Genomics Data via a Repeated And Merged BloOm Filter (RAMBO) 2021 SIGMOD 6.5609196e-05
4,863 Pyramid Sketch: a Sketch Framework for Frequency Estimation of Data Streams 2017 VLDB 6.4740702e-05
4,898 Finding Persistent Items in Data Streams 2017 VLDB 6.454197e-05
4,900 COMPASS: Online Sketch-based Query Optimization for In-Memory Databases 2021 SIGMOD 6.4534715e-05
4,971 Persistent Bloom Filter: Membership Testing for the Entire History 2018 SIGMOD 6.4195676e-05
5,255 At-the-time and Back-in-time Persistent Sketches 2021 SIGMOD 6.2982495e-05
5,372 Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams 2016 SIGMOD 6.2426538e-05
5,793 Active Sampling Count Sketch (ASCS) for Online Sparse Estimation of a Trillion Scale Covariance Matrix 2021 SIGMOD 6.0868713e-05
6,685 Out of Many We are One: Measuring Item Batch with Clock-Sketch 2021 SIGMOD 5.8034001e-05
8,413 Conditional Cuckoo Filters 2021 SIGMOD 5.4306049e-05
8,612 Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying 2021 SIGMOD 5.4012878e-05
8,613 Bidirectionally Densifying LSH Sketches with Empty Bins 2021 SIGMOD 5.4012878e-05
Previous Page 1 / 1 Next

Semantically Similar Papers