Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor

Summary: Fair-Count-Min is a group-aware Count-Min variant that partitions columns and uses semi-uniform hashing to eliminate cross-group collisions, equalizing expected approximation factors rather than additive error. Experiments show fairness with small overhead and near-standard efficiency. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID: 7429
Venue: SIGMOD
Year: 2026
Pagerank: 5.093636e-05
Overall Rank: 10,238 | 29.76%
DOI: 10.1145/3802056

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Nima Shahbazi (University of Illinois Chicago)
2. Stavros Sintos (University of Illinois Chicago)
3. Abolfazl Asudeh (University of Illinois Chicago)

BibTeX Citation

@inproceedings{shahbazi_sigmod26,
        title = {{Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor}},
        author = {Shahbazi, Nima and Sintos, Stavros and Asudeh, Abolfazl},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3802056},
        url = {https://dl.acm.org/doi/10.1145/3802056},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,511	On Fair Epsilon Net and Geometric Hitting Set	2026	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
43	The Case for Learned Index Structures	2018	SIGMOD	0.00046060254
862	Spectral Bloom Filters	2003	SIGMOD	0.00013532857
863	Interventional Fairness : Causal Database Repair for Algorithmic Fairness	2019	SIGMOD	0.00013531835
1,340	Responsible Data Management	2020	VLDB	0.00011111667
1,597	Designing Fair Ranking Schemes	2019	SIGMOD	0.00010246472
3,623	Fair Near Neighbor Search: Independent Range Sampling in High Dimensions	2020	PODS	7.2463734e-05
5,631	Tailoring Data Source Distributions for Fairness-aware Data Integration	2021	VLDB	6.1427477e-05
7,367	Identifying Insufficient Data Coverage for Ordinal Continuous-Valued Attributes	2021	SIGMOD	5.6319194e-05
9,388	Chameleon: Foundation Models for Fairness-aware Multi-modal Data Augmentation to Enhance Coverage of Minorities	2024	VLDB	5.2755515e-05
9,848	Maximizing Fair Content Spread via Edge Suggestion in Social Networks	2022	VLDB	5.2094004e-05
10,511	On Fair Epsilon Net and Geometric Hitting Set	2026	VLDB	5.093636e-05
11,174	FairHash: A Fair and Memory/Time-efficient Hashmap	2024	SIGMOD	5.093636e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	7,747	Convolution and Cross-Correlation of Count Sketches Enables Fast Cardinality Estimation of Multi-Join Queries	2024	SIGMOD
2	10,511	On Fair Epsilon Net and Geometric Hitting Set	2026	VLDB
3	885	Finding Frequent Items in Data Streams	2008	VLDB
4	3,795	Is Min-Wise Hashing Optimal for Summarizing Set Intersection?	2014	PODS
5	1,294	Augmented Sketch: Faster and More Accurate Stream Processing	2016	SIGMOD
6	7,716	Double-Anonymous Sketch: Achieving Top-K-fairness for Finding Global Top-K Frequent Items	2023	SIGMOD
7	11,175	Faster Algorithms for Fair Max-Min Diversification in Rd	2024	SIGMOD
8	5,998	Approximate Distinct Counts for Billions of Datasets	2019	SIGMOD
9	10,329	SieveSketch: A Fine-grained and Adaptive Sketch Framework for Accurate Frequency Estimation	2026	SIGMOD
10	11,174	FairHash: A Fair and Memory/Time-efficient Hashmap	2024	SIGMOD