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
he18aef291158387b
Venue
SIGMOD
Year
2023
Pagerank
5.4152499e-05
Overall Rank
7,895 | 47.08%
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 3 of 3 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
124 Approximate Frequency Counts over Data Streams 2002 VLDB 0.00030503973
1,329 Augmented Sketch: Faster and More Accurate Stream Processing 2016 SIGMOD 0.00011013041
1,856 Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity 2018 VLDB 9.4802321e-05
2,081 A General-Purpose Counting Filter: Making Every Bit Count 2017 SIGMOD 9.0581443e-05
2,202 Graph Stream Summarization: From Big Bang to Big Crunch 2016 SIGMOD 8.861907e-05
2,938 Data Sketches for Disaggregated Subset Sum and Frequent Item Estimation 2018 SIGMOD 7.8224388e-05
3,090 Persistent Data Sketching 2015 SIGMOD 7.6420011e-05
3,093 Correlation Sketches for Approximate Join-Correlation Queries 2021 SIGMOD 7.6378811e-05
3,105 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.6278115e-05
3,525 Sketching Linear Classifiers over Data Streams 2018 SIGMOD 7.2156031e-05
3,720 Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design 2021 SIGMOD 7.0516727e-05
3,996 BurstSketch: Finding Bursts in Data Streams 2021 SIGMOD 6.8528809e-05
4,755 Fast Processing and Querying of 170TB of Genomics Data via a Repeated And Merged BloOm Filter (RAMBO) 2021 SIGMOD 6.4210218e-05
5,005 Pyramid Sketch: a Sketch Framework for Frequency Estimation of Data Streams 2017 VLDB 6.3061786e-05
5,029 COMPASS: Online Sketch-based Query Optimization for In-Memory Databases 2021 SIGMOD 6.2952031e-05
5,040 Finding Persistent Items in Data Streams 2017 VLDB 6.2901248e-05
5,119 Persistent Bloom Filter: Membership Testing for the Entire History 2018 SIGMOD 6.2541554e-05
5,399 At-the-time and Back-in-time Persistent Sketches 2021 SIGMOD 6.1336701e-05
5,525 Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams 2016 SIGMOD 6.0809613e-05
5,929 Active Sampling Count Sketch (ASCS) for Online Sparse Estimation of a Trillion Scale Covariance Matrix 2021 SIGMOD 5.9278154e-05
6,838 Out of Many We are One: Measuring Item Batch with Clock-Sketch 2021 SIGMOD 5.6517516e-05
7,208 Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying 2021 SIGMOD 5.5701802e-05
8,604 Conditional Cuckoo Filters 2021 SIGMOD 5.2899825e-05
8,802 Bidirectionally Densifying LSH Sketches with Empty Bins 2021 SIGMOD 5.2601468e-05
Previous Page 1 / 1 Next

Semantically Similar Papers