Database Paper Browser

Back to papers

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
6901
Venue
SIGMOD
Year
2024
Pagerank
4.1945683e-05
Overall Rank
10,960 | 23.76%
DOI
10.1145/3654939

Incoming Non-self Citations Over Time

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

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,223 On Fair Epsilon Net and Geometric Hitting Set 2026 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers