{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:10:39Z","timestamp":1779174639064,"version":"3.51.4"},"reference-count":108,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T00:00:00Z","timestamp":1716940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"NSF","doi-asserted-by":"publisher","award":["2107290"],"award-info":[{"award-number":["2107290"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2024,5,29]]},"abstract":"<jats:p>Hashmap is a fundamental data structure in computer science. There has been extensive research on constructing hashmaps that minimize the number of collisions leading to efficient lookup query time. Recently, the data-dependant approaches, construct hashmaps tailored for a target data distribution that guarantee to uniformly distribute data across different buckets and hence minimize the collisions. Still, to the best of our knowledge, none of the existing technique guarantees group fairness among different groups of items stored in the hashmap.<\/jats:p>\n          <jats:p>Therefore, in this paper, we introduce FairHash, a data-dependant hashmap that guarantees uniform distribution at the group-level across hash buckets, and hence, satisfies the statistical parity notion of group fairness. We formally define, three notions of fairness and, unlike existing work, FairHash satisfies all three of them simultaneously. We propose three families of algorithms to design fair hashmaps, suitable for different settings. Our ranking-based algorithms reduce the unfairness of data-dependant hashmaps without any memory-overhead. The cut-based algorithms guarantee zero-unfairness in all cases, irrespective of how the data is distributed, but those introduce an extra memory-overhead. Last but not least, the discrepancy-based algorithms enable trading off between various fairness notions. In addition to the theoretical analysis, we perform extensive experiments to evaluate the efficiency and efficacy of our algorithms on real datasets. Our results verify the superiority of FairHash compared to the other baselines on fairness at almost no performance cost.<\/jats:p>","DOI":"10.1145\/3654939","type":"journal-article","created":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T09:44:53Z","timestamp":1717062293000},"page":"1-29","source":"Crossref","is-referenced-by-count":2,"title":["FairHash: A Fair and Memory\/Time-efficient Hashmap"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7016-3807","authenticated-orcid":false,"given":"Nima","family":"Shahbazi","sequence":"first","affiliation":[{"name":"University of Illinois Chicago, Chicago, Illinois, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2114-8886","authenticated-orcid":false,"given":"Stavros","family":"Sintos","sequence":"additional","affiliation":[{"name":"University of Illinois Chicago, Chicago, Illinois, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5251-6186","authenticated-orcid":false,"given":"Abolfazl","family":"Asudeh","sequence":"additional","affiliation":[{"name":"University of Illinois Chicago, Chicago, Illinois, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,5,30]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2015. COMPAS Recidivism Risk Score Data and Analysis. www.propublica.org\/datastore\/dataset\/compas-recidivism-risk-score-data-and-analysis."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384259"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.153"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00073"},{"key":"e_1_2_1_5_1","first-page":"21050","article-title":"Fair hierarchical clustering","volume":"33","author":"Ahmadian Sara","year":"2020","unstructured":"Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilvitskii, and Yuyan Wang. 2020. Fair hierarchical clustering. Advances in Neural Information Processing Systems 33 (2020), 21050--21060.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_6_1","volume-title":"Cryptographic hash functions: Recent design trends and security notions. Cryptology ePrint Archive","author":"Al-Kuwari Saif","year":"2011","unstructured":"Saif Al-Kuwari, James H Davenport, and Russell J Bradford. 2011. Cryptographic hash functions: Recent design trends and security notions. Cryptology ePrint Archive (2011)."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1201\/9781351241410"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(87)90055-7"},{"key":"e_1_2_1_9_1","volume-title":"48th International Colloquium on Automata, Languages, and Programming (ICALP","author":"Alon Noga","year":"2021","unstructured":"Noga Alon and Andrei Graur. 2021. Efficient splitting of necklaces. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1986-0861764-9"},{"key":"e_1_2_1_11_1","volume-title":"Fair markovian search. Available at SSRN 4347447","author":"Aminian Mohammad Reza","year":"2023","unstructured":"Mohammad Reza Aminian, Vahideh Manshadi, and Rad Niazadeh. 2023. Fair markovian search. Available at SSRN 4347447 (2023)."},{"key":"e_1_2_1_12_1","volume-title":"Ethics of data and analytics","author":"Angwin Julia","unstructured":"Julia Angwin, Jeff Larson, Surya Mattu, and Lauren Kirchner. 2022. Machine bias. In Ethics of data and analytics. Auerbach Publications, 254--264."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch20"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-022-01072-1"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3291264.3291269"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300079"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00056"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457315"},{"key":"e_1_2_1_19_1","volume-title":"arXiv preprint arXiv:2307.11355","author":"Asudeh Abolfazl","year":"2023","unstructured":"Abolfazl Asudeh, Nima Shahbazi, and Stavros Sintos. 2023. A Fair and Memory\/Time-efficient Hashmap. arXiv preprint arXiv:2307.11355 (2023)."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3471485.3471496"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3502867"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3387648"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00671-8"},{"key":"e_1_2_1_24_1","volume-title":"Fairness in machine learning. Nips tutorial 1","author":"Barocas Solon","year":"2017","unstructured":"Solon Barocas, Moritz Hardt, and Arvind Narayanan. 2017. Fairness in machine learning. Nips tutorial 1 (2017), 2017."},{"key":"e_1_2_1_25_1","volume-title":"Fairness and machine learning: Limitations and opportunities","author":"Barocas Solon","unstructured":"Solon Barocas, Moritz Hardt, and Arvind Narayanan. 2023. Fairness and machine learning: Limitations and opportunities. MIT Press."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.24432\/C5XW20"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519969"},{"key":"e_1_2_1_28_1","volume-title":"Fair algorithms for clustering. Advances in Neural Information Processing Systems 32","author":"Bera Suman","year":"2019","unstructured":"Suman Bera, Deeparnab Chakrabarty, Nicolas Flores, and Maryam Negahbani. 2019. Fair algorithms for clustering. Advances in Neural Information Processing Systems 32 (2019)."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520070"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106287"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_2_1_32_1","volume-title":"Fair clustering with multiple colors. arXiv preprint arXiv:2002.07892","author":"B\u00f6hm Matteo","year":"2020","unstructured":"Matteo B\u00f6hm, Adriano Fazzone, Stefano Leonardi, and Chris Schwiegelshohn. 2020. Fair clustering with multiple colors. arXiv preprint arXiv:2002.07892 (2020)."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/829502.830043"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261978"},{"key":"e_1_2_1_35_1","volume-title":"Karthikeyan Natesan Ramamurthy, and Kush R Varshney","author":"Calmon Flavio","year":"2017","unstructured":"Flavio Calmon, Dennis Wei, Bhanukiran Vinzamuri, Karthikeyan Natesan Ramamurthy, and Kush R Varshney. 2017. Optimized pre-processing for discrimination prevention. Advances in neural information processing systems 30 (2017)."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3287560.3287586"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00051"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3522672"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.67"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3047307"},{"key":"e_1_2_1_41_1","volume-title":"Fair clustering through fairlets. Advances in neural information processing systems 30","author":"Chierichetti Flavio","year":"2017","unstructured":"Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, and Sergei Vassilvitskii. 2017. Fair clustering through fairlets. Advances in neural information processing systems 30 (2017)."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.104"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206531"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00050"},{"key":"e_1_2_1_46_1","volume-title":"Conference on the Theory and Application of Cryptology. Springer, 416--427","author":"Damgard Ivan Bjerre","year":"1989","unstructured":"Ivan Bjerre Damgard. 1989. A design principle for hash functions. In Conference on the Theory and Application of Cryptology. Springer, 416--427."},{"key":"e_1_2_1_47_1","volume-title":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 419--428","author":"Dhar Manik","year":"2022","unstructured":"Manik Dhar and Zeev Dvir. 2022. Linear Hashing with l\u221e guarantees and two-sided Kakeya bounds. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 419--428."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3351095.3372847"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583483"},{"key":"e_1_2_1_50_1","volume-title":"Faster matrix multiplication via asymmetric hashing. arXiv preprint arXiv:2210.10173","author":"Duan Ran","year":"2022","unstructured":"Ran Duan, Hongxun Wu, and Renfei Zhou. 2022. Faster matrix multiplication via asymmetric hashing. arXiv preprint arXiv:2210.10173 (2022)."},{"key":"e_1_2_1_51_1","volume-title":"Proceedings 11","author":"Durand Marianne","year":"2003","unstructured":"Marianne Durand and Philippe Flajolet. 2003. Loglog counting of large cardinalities. In Algorithms-ESA 2003: 11th Annual European Symposium, Budapest, Hungary, September 16--19, 2003. Proceedings 11. Springer, 605--617."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"e_1_2_1_53_1","volume-title":"Algorithms in combinatorial geometry","author":"Edelsbrunner Herbert","unstructured":"Herbert Edelsbrunner. 1987. Algorithms in combinatorial geometry. Vol. 10. Springer Science & Business Media."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783311"},{"key":"e_1_2_1_55_1","volume-title":"Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. Discrete mathematics & theoretical computer science Proceedings","author":"Flajolet Philippe","year":"2007","unstructured":"Philippe Flajolet, \u00c9ric Fusy, Olivier Gandouet, and Fr\u00e9d\u00e9ric Meunier. 2007. Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. Discrete mathematics & theoretical computer science Proceedings (2007)."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch13"},{"key":"e_1_2_1_57_1","first-page":"395","article-title":"The future of systemic disparate treatment law","author":"Green Tristin K","year":"2011","unstructured":"Tristin K Green. 2011. The future of systemic disparate treatment law. Berkeley J. Emp. & Lab. L. 32 (2011), 395.","journal-title":"Berkeley J. Emp. & Lab."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3320244"},{"key":"e_1_2_1_59_1","unstructured":"Moritz Hardt Eric Price and Nati Srebro. 2016. Equality of opportunity in supervised learning. In Advances in neural information processing systems. 3315--3323."},{"key":"e_1_2_1_60_1","volume-title":"Inherent trade-offs in the fair allocation of treatments. arXiv preprint arXiv:2010.16409","author":"He Yuzi","year":"2020","unstructured":"Yuzi He, Keith Burghardt, Siyi Guo, and Kristina Lerman. 2020. Inherent trade-offs in the fair allocation of treatments. arXiv preprint arXiv:2010.16409 (2020)."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375627.3375864"},{"key":"e_1_2_1_62_1","volume-title":"Approximation Algorithms for Fair Range Clustering. In International Conference on Machine Learning. PMLR, 13270--13284","author":"Hotegni Sedjro Salomon","year":"2023","unstructured":"Sedjro Salomon Hotegni, Sepideh Mahabadi, and Ali Vakilian. 2023. Approximation Algorithms for Fair Range Clustering. In International Conference on Machine Learning. PMLR, 13270--13284."},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.09.016"},{"key":"e_1_2_1_64_1","volume-title":"Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming. arXiv preprint arXiv:2304.06853","author":"Kacham Praneeth","year":"2023","unstructured":"Praneeth Kacham, Rasmus Pagh, Mikkel Thorup, and David P Woodruff. 2023. Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming. arXiv preprint arXiv:2304.06853 (2023)."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-011-0463-8"},{"key":"e_1_2_1_66_1","volume-title":"Proceedings of Innovations in Theoretical Computer Science (ITCS)","author":"Kleinberg Jon","year":"2017","unstructured":"Jon Kleinberg, Sendhil Mullainathan, and Manish Raghavan. 2017. Inherent trade-offs in the fair determination of risk scores. Proceedings of Innovations in Theoretical Computer Science (ITCS) (2017)."},{"key":"e_1_2_1_67_1","volume-title":"The art of computer programming","author":"Knuth Donald Ervin","unstructured":"Donald Ervin Knuth. 1997. The art of computer programming. Vol. 3. Pearson Education."},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00097"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch10"},{"key":"e_1_2_1_71_1","volume-title":"Fairness in recommendation: A survey. arXiv preprint arXiv:2205.13619","author":"Li Yunqi","year":"2022","unstructured":"Yunqi Li, Hanxiong Chen, Shuyuan Xu, Yingqiang Ge, Juntao Tan, Shuchang Liu, and Yongfeng Zhang. 2022. Fairness in recommendation: A survey. arXiv preprint arXiv:2205.13619 (2022)."},{"key":"e_1_2_1_72_1","volume-title":"Conference on Learning Theory. PMLR, 3246--3264","author":"Makarychev Yury","year":"2021","unstructured":"Yury Makarychev and Ali Vakilian. 2021. Approximation algorithms for socially fair clustering. In Conference on Learning Theory. PMLR, 3246--3264."},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.14778\/3421424.3421425"},{"key":"e_1_2_1_74_1","volume-title":"A survey on bias and fairness in machine learning. ACM computing surveys (CSUR) 54, 6","author":"Mehrabi Ninareh","year":"2021","unstructured":"Ninareh Mehrabi, Fred Morstatter, Nripsuta Saxena, Kristina Lerman, and Aram Galstyan. 2021. A survey on bias and fairness in machine learning. ACM computing surveys (CSUR) 54, 6 (2021), 1--35."},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2014.01.008"},{"key":"e_1_2_1_76_1","volume-title":"A model for learned bloom filters and optimizing by sandwiching. Advances in Neural Information Processing Systems 31","author":"Mitzenmacher Michael","year":"2018","unstructured":"Michael Mitzenmacher. 2018. A model for learned bloom filters and optimizing by sandwiching. Advances in Neural Information Processing Systems 31 (2018)."},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476299"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3522567"},{"key":"e_1_2_1_79_1","volume-title":"PopSim: An Individual-level Population Simulator for Equitable Allocation of City Resources. SDM Workshop on Algorithmic Fairness in Artificial intelligence, Machine learning, and Decision making","author":"Nguyen Khanh Duy","year":"2023","unstructured":"Khanh Duy Nguyen, Nima Shahbazi, and Abolfazl Asudeh. 2023. PopSim: An Individual-level Population Simulator for Equitable Allocation of City Resources. SDM Workshop on Algorithmic Fairness in Artificial intelligence, Machine learning, and Decision making (2023)."},{"key":"e_1_2_1_80_1","volume-title":"International Conference on Machine Learning. PMLR, 16848--16887","author":"Nilforoshan Hamed","year":"2022","unstructured":"Hamed Nilforoshan, Johann D Gaebler, Ravi Shroff, and Sharad Goel. 2022. Causal conceptions of fairness and their consequences. In International Conference on Machine Learning. PMLR, 16848--16887."},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1356"},{"key":"e_1_2_1_82_1","volume-title":"Social data: Biases, methodological pitfalls, and ethical boundaries. Frontiers in big data 2","author":"Olteanu Alexandra","year":"2019","unstructured":"Alexandra Olteanu, Carlos Castillo, Fernando Diaz, and Emre Kiciman. 2019. Social data: Biases, methodological pitfalls, and ethical boundaries. Frontiers in big data 2 (2019), 13."},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780633"},{"key":"e_1_2_1_84_1","volume-title":"Soda","volume":"5","author":"Pagh Anna","year":"2005","unstructured":"Anna Pagh, Rasmus Pagh, and S Srinivasa Rao. 2005. An optimal Bloom filter replacement.. In Soda, Vol. 5. Citeseer, 823--829."},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/3494672"},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1145\/3351095.3372828"},{"key":"e_1_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.14778\/3570690.3570702"},{"key":"e_1_2_1_88_1","volume-title":"Data management for causal algorithmic fairness. arXiv preprint arXiv:1908.07924","author":"Salimi Babak","year":"2019","unstructured":"Babak Salimi, Bill Howe, and Dan Suciu. 2019. Data management for causal algorithmic fairness. arXiv preprint arXiv:1908.07924 (2019)."},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1145\/3422648.3422657"},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319901"},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39479-0_16"},{"key":"e_1_2_1_92_1","volume-title":"Representation Bias in Data: A Survey on Identification and Resolution Techniques. Comput. Surveys","author":"Shahbazi Nima","year":"2023","unstructured":"Nima Shahbazi, Yin Lin, Abolfazl Asudeh, and HV Jagadish. 2023. Representation Bias in Data: A Survey on Identification and Resolution Techniques. Comput. Surveys (2023)."},{"key":"e_1_2_1_93_1","volume-title":"Fairness-aware range queries for selecting unbiased data","author":"Shetiya Suraj","unstructured":"Suraj Shetiya, Ian P Swift, Abolfazl Asudeh, and Gautam Das. 2022. Fairness-aware range queries for selecting unbiased data. In ICDE. IEEE, 1423--1436."},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63450"},{"key":"e_1_2_1_95_1","volume-title":"An overview of cryptographic hash functions and their uses. GIAC 6","author":"Silva John Edward","year":"2003","unstructured":"John Edward Silva. 2003. An overview of cryptographic hash functions and their uses. GIAC 6 (2003)."},{"key":"e_1_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_2_1_97_1","volume-title":"Policy learning for fairness in ranking. Advances in neural information processing systems 32","author":"Singh Ashudeep","year":"2019","unstructured":"Ashudeep Singh and Thorsten Joachims. 2019. Policy learning for fairness in ranking. Advances in neural information processing systems 32 (2019)."},{"key":"e_1_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1145\/3488717"},{"key":"e_1_2_1_99_1","volume-title":"et al","author":"Strack Beata","year":"2014","unstructured":"Beata Strack, Jonathan P DeShazo, Chris Gennings, Juan L Olmo, Sebastian Ventura, Krzysztof J Cios, John N Clore, et al . 2014. Impact of HbA1c measurement on hospital readmission rates: analysis of 70,000 clinical database patient records. BioMed research international 2014 (2014)."},{"key":"e_1_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551824"},{"key":"e_1_2_1_101_1","volume-title":"Partitioned Learned Bloom Filters. In International Conference on Learning Representations.","author":"Vaidya Kapil","year":"2020","unstructured":"Kapil Vaidya, Eric Knorr, Michael Mitzenmacher, and Tim Kraska. 2020. Partitioned Learned Bloom Filters. In International Conference on Learning Representations."},{"key":"e_1_2_1_102_1","volume-title":"Jingkuan Song, and Jianqiu Ji.","author":"Wang Jingdong","year":"2014","unstructured":"Jingdong Wang, Heng Tao Shen, Jingkuan Song, and Jianqiu Ji. 2014. Hashing for similarity search: A survey. arXiv preprint arXiv:1408.2927 (2014)."},{"key":"e_1_2_1_103_1","volume-title":"Beating the Probabilistic Lower Bound on q-Perfect Hashing. Combinatorica","author":"Xing Chaoping","year":"2023","unstructured":"Chaoping Xing and Chen Yuan. 2023. Beating the Probabilistic Lower Bound on q-Perfect Hashing. Combinatorica (2023), 1--20."},{"key":"e_1_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052660"},{"key":"e_1_2_1_105_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3533379","article-title":"Fairness in ranking, part i: Score-based ranking","volume":"55","author":"Zehlike Meike","year":"2022","unstructured":"Meike Zehlike, Ke Yang, and Julia Stoyanovich. 2022. Fairness in ranking, part i: Score-based ranking. Comput. Surveys 55, 6 (2022), 1--36.","journal-title":"Comput. Surveys"},{"key":"e_1_2_1_106_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543843"},{"key":"e_1_2_1_107_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00030"},{"key":"e_1_2_1_108_1","first-page":"1124","article-title":"Public hospital inpatient room allocation and patient scheduling considering equity","volume":"17","author":"Zhou Liping","year":"2019","unstructured":"Liping Zhou, Na Geng, Zhibin Jiang, and Xiuxian Wang. 2019. Public hospital inpatient room allocation and patient scheduling considering equity. IEEE Transactions on Automation Science and Engineering 17, 3 (2019), 1124--1139.","journal-title":"IEEE Transactions on Automation Science and Engineering"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3654939","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3654939","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T14:37:04Z","timestamp":1755787024000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3654939"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,29]]},"references-count":108,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5,29]]}},"alternative-id":["10.1145\/3654939"],"URL":"https:\/\/doi.org\/10.1145\/3654939","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,29]]}}}