FairHash: A Fair and Memory/Time-efficient Hashmap

Summary: FairHash: data-dependent hashmap with group-level statistical parity across buckets, giving formal guarantees for three fairness notions. Three algorithmic families span zero/uniform unfairness vs. memory overhead, with ranking/cut/discrepancy trade-offs and near-baseline performance. (summarized by gpt-5.4-mini on May 24 2026)

Paper ID: 6963
Venue: SIGMOD
Year: 2024
Pagerank: 5.093636e-05
Overall Rank: 11,174 | 23.34%
DOI: 10.1145/3654939

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_sigmod24,
        title = {{FairHash: A Fair and Memory/Time-efficient Hashmap}},
        author = {Shahbazi, Nima and Sintos, Stavros and Asudeh, Abolfazl},
        series = {{SIGMOD} '24},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3654939},
        url = {https://dl.acm.org/doi/10.1145/3654939},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,238	Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor	2026	SIGMOD	5.093636e-05
10,511	On Fair Epsilon Net and Geometric Hitting Set	2026	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 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
847	Benchmarking Learned Indexes	2021	VLDB	0.0001365768
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
4,780	Can Learned Models Replace Hash Functions?	2023	VLDB	6.5118885e-05
5,465	On Obtaining Stable Rankings	2019	VLDB	6.2075408e-05
5,510	Responsible Data Integration: Next-generation Challenges	2022	SIGMOD	6.1919207e-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
8,930	MithraRanking: A System for Responsible Ranking Design	2019	SIGMOD	5.3483178e-05
9,848	Maximizing Fair Content Spread via Edge Suggestion in Social Networks	2022	VLDB	5.2094004e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,250	Cache-Efficient Aggregation: Hashing Is Sorting	2015	SIGMOD
2	11,419	Equitable Top-k Results for Long Tail Data	2023	SIGMOD
3	1,597	Designing Fair Ranking Schemes	2019	SIGMOD
4	12,544	A Fair Assignment Algorithm for Multiple Preference Queries	2009	VLDB
5	8,880	Entropy-Learned Hashing: Constant Time Hashing with Controllable Uniformity	2022	SIGMOD
6	9,393	Happiness Maximizing Sets under Group Fairness Constraints	2023	VLDB
7	11,175	Faster Algorithms for Fair Max-Min Diversification in Rd	2024	SIGMOD
8	10,511	On Fair Epsilon Net and Geometric Hitting Set	2026	VLDB
9	3,623	Fair Near Neighbor Search: Independent Range Sampling in High Dimensions	2020	PODS
10	10,238	Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor	2026	SIGMOD