{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T21:19:31Z","timestamp":1775855971389,"version":"3.50.1"},"reference-count":164,"publisher":"Association for Computing Machinery (ACM)","issue":"10","funder":[{"DOI":"10.13039\/\"http:\/\/dx.doi.org\/10.13039\/100008398","name":"Villum Fonden","doi-asserted-by":"publisher","award":["54451"],"award-info":[{"award-number":["54451"]}],"id":[{"id":"10.13039\/\"http:\/\/dx.doi.org\/10.13039\/100008398","id-type":"DOI","asserted-by":"publisher"}]},{"name":"European Union's Horizon 2020 research and innovation programme","award":["882500"],"award-info":[{"award-number":["882500"]}]},{"name":"Pilot program Core Informatics at KIT (KiKIT) of the Helmholtz Association"},{"name":"\u201cSEcurity and RIghts In the CyberSpace - SERICS\u201d under the National Recovery and Resilience Plan (NRRP) funded by the European Union - NextGenerationEU","award":["CUP H73C2200089001"],"award-info":[{"award-number":["CUP H73C2200089001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2026,7,31]]},"abstract":"<jats:p>\n                    Given a set\n                    <jats:italic toggle=\"yes\">S<\/jats:italic>\n                    of\n                    <jats:italic toggle=\"yes\">n<\/jats:italic>\n                    keys, a perfect hash function for\n                    <jats:italic toggle=\"yes\">S<\/jats:italic>\n                    maps the keys in\n                    <jats:italic toggle=\"yes\">S<\/jats:italic>\n                    to the first\n                    <jats:italic toggle=\"yes\">m \u2265 n<\/jats:italic>\n                    integers without collisions. It may return an arbitrary result for any key not in\n                    <jats:italic toggle=\"yes\">S<\/jats:italic>\n                    and is called\n                    <jats:italic toggle=\"yes\">minimal<\/jats:italic>\n                    if\n                    <jats:italic toggle=\"yes\">m=n<\/jats:italic>\n                    . The most important parameters are its space consumption, construction time, and query time. Years of research now enable modern perfect hash functions to be extremely fast to query, very space-efficient, and scale to billions of keys. Different approaches give different trade-offs between these aspects. For example, the smallest constructions get within 0.1% of the space lower bound of log\n                    <jats:sub>2<\/jats:sub>\n                    <jats:italic toggle=\"yes\">e<\/jats:italic>\n                    bits per key. Others are particularly fast to query, requiring only one memory access. Perfect hashing has many applications, for example, to avoid collision resolution in static hash tables, and is used in databases, bioinformatics, and stringology.\n                  <\/jats:p>\n                  <jats:p>Since the last comprehensive survey in 1997, significant progress has been made. This survey covers the latest developments and provides a starting point for getting familiar with the topic. Additionally, our extensive experimental evaluation can serve as a guide to select a perfect hash function for use in applications.<\/jats:p>","DOI":"10.1145\/3797036","type":"journal-article","created":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T21:23:34Z","timestamp":1770845014000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Modern Minimal Perfect Hashing: A Survey"],"prefix":"10.1145","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0474-1805","authenticated-orcid":false,"given":"Hans-Peter","family":"Lehmann","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology","place":["Karlsruhe, Germany"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6614-3296","authenticated-orcid":false,"given":"Thomas","family":"Mueller","sequence":"additional","affiliation":[{"name":"Independent researcher","place":["Basel, Switzerland"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1516-9306","authenticated-orcid":false,"given":"Rasmus","family":"Pagh","sequence":"additional","affiliation":[{"name":"BARC, University of Copenhagen","place":["Copenhagen, Denmark"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0724-7092","authenticated-orcid":false,"given":"Giulio Ermanno","family":"Pibiri","sequence":"additional","affiliation":[{"name":"Ca' Foscari University of Venice","place":["Venice, Italy"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3330-9349","authenticated-orcid":false,"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology","place":["Karlsruhe, Germany"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3257-651X","authenticated-orcid":false,"given":"Sebastiano","family":"Vigna","sequence":"additional","affiliation":[{"name":"Universita degli Studi di Milano","place":["Milan, Italy"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6477-0106","authenticated-orcid":false,"given":"Stefan","family":"Walzer","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology","place":["Karlsruhe, Germany"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,3,11]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384259"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1093\/BIOINFORMATICS\/BTY292"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/359060.359071"},{"key":"e_1_3_2_6_2","unstructured":"Austin Appleby. 2010. SMHasher. Retrieved from https:\/\/github.com\/rurban\/smhasher"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.CH20"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","unstructured":"Matthias Becht Hans-Peter Lehmann and Peter Sanders. 2024. Brief announcement: Parallel construction of bumped ribbon retrieval. DOI:10.48550\/ARXIV.2411.12365","DOI":"10.48550\/ARXIV.2411.12365"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2014.48"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.86"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15775-2_37"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04128-0_61"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3381417"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/2635816"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/J.JDA.2012.07.005"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3596453"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","unstructured":"Piotr Beling and Peter Sanders. 2025. PHast\u2013Perfect hashing with fast evaluation. DOI:10.48550\/arXiv.2504.17918","DOI":"10.48550\/arXiv.2504.17918"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00026"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00089"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ESA.2023.19"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_33"},{"issue":"2","key":"e_1_3_2_23_2","first-page":"09","article-title":"A new algorithm for constructing minimal perfect hash functions","volume":"100","author":"Botelho Fabiano C.","year":"2004","unstructured":"Fabiano C. Botelho, David M. Gomes, and Nivio Ziviani. 2004. A new algorithm for constructing minimal perfect hash functions. Differences 100, 2 (2004), 09.","journal-title":"Differences"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","unstructured":"Fabiano C. Botelho Rasmus Pagh and Nivio Ziviani. 2007. Perfect hashing for data management applications. DOI:10.48550\/arXiv.cs\/0702159","DOI":"10.48550\/arXiv.cs\/0702159"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73951-7_13"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/J.IS.2012.06.002"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321532"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4379(90)90001-6"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/69.277768"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/2983573"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"e_1_3_2_32_2","article-title":"A block-sorting lossless data compression algorithm","volume":"124","author":"Burrows Michael","year":"1994","unstructured":"Michael Burrows and D. J. Wheeler. 1994. A block-sorting lossless data compression algorithm. SRC 124 (1994).","journal-title":"SRC"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804332"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(84)90032-X"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90096-8"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1093\/COMJNL\/34.5.469"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1093\/COMJNL\/BXH074"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1002\/SPE.4380210104"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/358027.358051"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0023501"},{"key":"e_1_3_2_41_2","first-page":"30","volume-title":"Proceedings of the SODA","author":"Chazelle Bernard","year":"2004","unstructured":"Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, and Ayellet Tal. 2004. The bloomier filter: An efficient data structure for static support lookup tables. In Proceedings of the SODA. SIAM, 30\u201339."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1093\/BIOINFORMATICS\/BTW279"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/358808.358813"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/947955.947957"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1093\/COMJNL\/28.1.54"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90220-P"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00146-6"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1093\/COMJNL\/36.6.579"},{"issue":"7","key":"e_1_3_2_49_2","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"Bruijn Nicolaas Govert De","year":"1946","unstructured":"Nicolaas Govert De Bruijn. 1946. A combinatorial problem. Proceedings of the Section of Sciences of the Koninklijke Nederlandse Akademie van Wetenschappen te Amsterdam 49, 7 (1946), 758\u2013764.","journal-title":"Proceedings of the Section of Sciences of the Koninklijke Nederlandse Akademie van Wetenschappen te Amsterdam"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1007\/11682462_34"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14165-2_19"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFB0032018"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55719-9_77"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23719-5_52"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_32"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_30"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.STACS.2019.24"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.SEA.2022.4"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1983.236866"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_50"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321820"},{"key":"e_1_3_2_62_2","unstructured":"Indeed Engineering. 2018. Indeed MPH: Fast and Compact Immutable Key-Value Stores. Retrieved from https:\/\/engineering.indeedblog.com\/blog\/2018\/02\/indeed-mph"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976007.14"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_2_65_2","volume-title":"On the Number of Bits Required to Implement an Associative Memory","author":"Fano Robert Mario","year":"1971","unstructured":"Robert Mario Fano. 1971. On the Number of Bits Required to Implement an Associative Memory. Technical Report. MIT, Computer Structures Group. Project MAC, Memorandum 61\u201d."},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/125187.125200"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1145\/133160.133209"},{"key":"e_1_3_2_68_2","unstructured":"Edward A. Fox Lenwood S Heath and Qi-Fan Chen. 1989. An O(n log n) algorithm for finding minimal perfect hash functions. (1989)."},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1145\/129617.129623"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1137\/0605009"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_16"},{"key":"e_1_3_2_73_2","volume-title":"CIDR","author":"Gaffney Kevin P.","year":"2024","unstructured":"Kevin P. Gaffney and Jignesh M. Patel. 2024. Is perfect hashing practical for OLAP systems?. In CIDR."},{"key":"e_1_3_2_74_2","doi-asserted-by":"publisher","DOI":"10.1145\/3375890"},{"key":"e_1_3_2_75_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-38851-9_23"},{"key":"e_1_3_2_76_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30642-6_15"},{"key":"e_1_3_2_77_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053907"},{"key":"e_1_3_2_78_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-21.3.167"},{"key":"e_1_3_2_79_2","unstructured":"Google. 2017. Abseil. Retrieved from https:\/\/abseil.io"},{"key":"e_1_3_2_80_2","unstructured":"Google. 2017. Abseil\u2019s Swiss Table. Retrieved from https:\/\/abseil.io\/about\/design\/swisstables"},{"key":"e_1_3_2_81_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932700"},{"key":"e_1_3_2_82_2","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.1883"},{"key":"e_1_3_2_83_2","doi-asserted-by":"publisher","DOI":"10.1145\/3376122"},{"key":"e_1_3_2_84_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SEA.2025.21"},{"key":"e_1_3_2_85_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14165-2_57"},{"key":"e_1_3_2_86_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44693-1_28"},{"key":"e_1_3_2_87_2","doi-asserted-by":"publisher","DOI":"10.1145\/5600.5899"},{"key":"e_1_3_2_88_2","volume-title":"Graph Theoretic Obstacles to Perfect Hashing","author":"Havas George","year":"1993","unstructured":"George Havas and Bohdan S. Majewski. 1993. Graph Theoretic Obstacles to Perfect Hashing. Key Centre for Software Technology, Department of Computer Science, The University of Queensland, Australia."},{"key":"e_1_3_2_89_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57899-4_49"},{"key":"e_1_3_2_90_2","doi-asserted-by":"publisher","unstructured":"Stefan Hermann. 2025. MorphisHash: Improving space efficiency of shockhash for minimal perfect hashing. In ESA (LIPIcs). 9:1\u20139:16. DOI:10.4230\/LIPICS.ESA.2025.9","DOI":"10.4230\/LIPICS.ESA.2025.9"},{"key":"e_1_3_2_91_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ESA.2024.69"},{"key":"e_1_3_2_92_2","first-page":"80","volume-title":"Proceedings of the IASTED Conference","author":"Hwang Gwo-Jen","year":"2002","unstructured":"Gwo-Jen Hwang, W. F. Tsai, and Judy C. R. Tseng. 2002. A minimal perfect hashing approach for mining association rules from very large databases. In Proceedings of the IASTED Conference. 80\u201385."},{"key":"e_1_3_2_93_2","doi-asserted-by":"publisher","DOI":"10.1038\/ng.1028"},{"key":"e_1_3_2_94_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90041-4"},{"key":"e_1_3_2_95_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63533"},{"key":"e_1_3_2_96_2","doi-asserted-by":"publisher","DOI":"10.1145\/359038.3084011"},{"key":"e_1_3_2_97_2","doi-asserted-by":"publisher","DOI":"10.1145\/358800.358806"},{"key":"e_1_3_2_98_2","doi-asserted-by":"publisher","DOI":"10.1002\/RSA.20147"},{"key":"e_1_3_2_99_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-022-02743-6"},{"key":"e_1_3_2_100_2","volume-title":"The Art of Computer Programming: Combinatorial algorithms. Part 1","author":"Knuth Donald E.","year":"2011","unstructured":"Donald E. Knuth. 2011. The Art of Computer Programming: Combinatorial algorithms. Part 1. Vol. 4A. Addison-Wesley."},{"key":"e_1_3_2_101_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CPM.2024.19"},{"key":"e_1_3_2_102_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977561.CH14"},{"key":"e_1_3_2_103_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.135"},{"key":"e_1_3_2_104_2","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649649"},{"key":"e_1_3_2_105_2","doi-asserted-by":"publisher","unstructured":"Hans-Peter Lehmann Peter Sanders Stefan Walzer and Jonatan Ziegler. 2025. Combined search and encoding for seeds with an application to minimal perfect hashing. In ESA (LIPIcs) 351 (2025) 109:1\u2013109:18. DOI:10.48550\/ARXIV.2502.05613","DOI":"10.48550\/ARXIV.2502.05613"},{"key":"e_1_3_2_106_2","unstructured":"Hans-Peter Lehmann. 2023. MPHF Experiments - GitHub. Retrieved from https:\/\/github.com\/ByteHamster\/MPHF-Experiments"},{"key":"e_1_3_2_107_2","doi-asserted-by":"publisher","DOI":"10.5445\/IR\/1000176432"},{"key":"e_1_3_2_108_2","doi-asserted-by":"publisher","unstructured":"Hans-Peter Lehmann Thomas Mueller Rasmus Pagh Giulio Ermanno Pibiri Peter Sanders Sebastiano Vigna and Stefan Walzer. 2025. Modern minimal perfect hashing: A survey. DOI:10.48550\/ARXIV.2506.06536","DOI":"10.48550\/ARXIV.2506.06536"},{"key":"e_1_3_2_109_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977561.CH15"},{"key":"e_1_3_2_110_2","doi-asserted-by":"publisher","unstructured":"Hans-Peter Lehmann Peter Sanders and Stefan Walzer. 2023. SicHash small irregular cuckoo tables for perfect hashing. In ALENEX. SIAM 176\u2013189. DOI:10.1137\/1.9781611977561.CH15","DOI":"10.1137\/1.9781611977561.CH15"},{"key":"e_1_3_2_111_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977929.15"},{"key":"e_1_3_2_112_2","doi-asserted-by":"publisher","DOI":"10.1109\/2.7056"},{"key":"e_1_3_2_113_2","doi-asserted-by":"publisher","DOI":"10.1007\/S40484-019-0166-9"},{"key":"e_1_3_2_114_2","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043558"},{"key":"e_1_3_2_115_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.SEA.2017.25"},{"key":"e_1_3_2_116_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261567"},{"key":"e_1_3_2_117_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.76"},{"key":"e_1_3_2_118_2","doi-asserted-by":"publisher","DOI":"10.1093\/COMJNL\/39.6.547"},{"key":"e_1_3_2_119_2","doi-asserted-by":"publisher","DOI":"10.5555\/311445"},{"key":"e_1_3_2_120_2","doi-asserted-by":"publisher","DOI":"10.1016\/J.DAM.2018.03.035"},{"key":"e_1_3_2_121_2","doi-asserted-by":"publisher","DOI":"10.1093\/BIOINFORMATICS\/BTAB217"},{"key":"e_1_3_2_122_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.80"},{"key":"e_1_3_2_123_2","article-title":"Data structures and algorithms, Vol. 1: Sorting and searching","author":"Mehlhorn Kurt","year":"1984","unstructured":"Kurt Mehlhorn. 1984. Data structures and algorithms, Vol. 1: Sorting and searching. EATCS Monogr. Theor. Comput. Sci. (1984).","journal-title":"EATCS Monogr. Theor. Comput. Sci."},{"key":"e_1_3_2_124_2","doi-asserted-by":"publisher","DOI":"10.1109\/71.963420"},{"key":"e_1_3_2_125_2","doi-asserted-by":"publisher","DOI":"10.1002\/RSA.20061"},{"key":"e_1_3_2_126_2","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060606"},{"key":"e_1_3_2_127_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_12"},{"key":"e_1_3_2_128_2","doi-asserted-by":"publisher","DOI":"10.1145\/2535933"},{"key":"e_1_3_2_129_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316588284"},{"key":"e_1_3_2_130_2","doi-asserted-by":"publisher","unstructured":"Racin Nygaard and Hein Meling. 2023. SNIPS: Succinct proof of storage for efficient data synchronization in decentralized storage systems. DOI:10.48550\/ARXIV.2304.04891","DOI":"10.48550\/ARXIV.2304.04891"},{"key":"e_1_3_2_131_2","doi-asserted-by":"publisher","DOI":"10.1137\/060658400"},{"key":"e_1_3_2_132_2","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250839"},{"key":"e_1_3_2_133_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48447-7_5"},{"key":"e_1_3_2_134_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_3_2_135_2","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78978"},{"key":"e_1_3_2_136_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.171285098"},{"key":"e_1_3_2_137_2","doi-asserted-by":"publisher","DOI":"10.1093\/BIOINFORMATICS\/BTAC245"},{"key":"e_1_3_2_138_2","doi-asserted-by":"publisher","DOI":"10.1186\/S13015-023-00226-2"},{"key":"e_1_3_2_139_2","doi-asserted-by":"publisher","DOI":"10.1093\/BIOINFORMATICS\/BTAD219"},{"key":"e_1_3_2_140_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462849"},{"key":"e_1_3_2_141_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3303341"},{"key":"e_1_3_2_142_2","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080798"},{"key":"e_1_3_2_143_2","doi-asserted-by":"publisher","DOI":"10.1145\/3302913"},{"key":"e_1_3_2_144_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548315000097"},{"key":"e_1_3_2_145_2","doi-asserted-by":"publisher","DOI":"10.1145\/63500.63521"},{"key":"e_1_3_2_146_2","doi-asserted-by":"publisher","unstructured":"Julian Reichinger Thomas Krismayer and Jan S. Rellermeyer. 2024. COPR \u2013 Efficient large-scale log storage and retrieval. DOI:10.48550\/ARXIV.2402.18355","DOI":"10.48550\/ARXIV.2402.18355"},{"key":"e_1_3_2_147_2","article-title":"Some practical universal noiseless coding techniques","author":"Rice Robert F.","year":"1979","unstructured":"Robert F. Rice. 1979. Some practical universal noiseless coding techniques. JPL Publ. (1979).","journal-title":"JPL Publ."},{"key":"e_1_3_2_148_2","unstructured":"Thomas J Sager. 1984. A new method for generating minimal perfect hash functions. (1984)."},{"key":"e_1_3_2_149_2","doi-asserted-by":"publisher","DOI":"10.1145\/3532.3538"},{"key":"e_1_3_2_150_2","doi-asserted-by":"publisher","DOI":"10.1137\/0219054"},{"key":"e_1_3_2_151_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-023-02968-z"},{"key":"e_1_3_2_152_2","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808705"},{"key":"e_1_3_2_153_2","doi-asserted-by":"publisher","DOI":"10.1145\/359863.359887"},{"key":"e_1_3_2_154_2","doi-asserted-by":"publisher","DOI":"10.21437\/INTERSPEECH.2020-1939"},{"key":"e_1_3_2_155_2","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359175"},{"key":"e_1_3_2_156_2","doi-asserted-by":"publisher","DOI":"10.1145\/3068772"},{"key":"e_1_3_2_157_2","doi-asserted-by":"publisher","DOI":"10.1145\/142040.142077"},{"key":"e_1_3_2_158_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.131"},{"key":"e_1_3_2_159_2","doi-asserted-by":"publisher","DOI":"10.1145\/3711822"},{"key":"e_1_3_2_160_2","doi-asserted-by":"publisher","DOI":"10.1609\/AAAI.V34I02.5529"},{"key":"e_1_3_2_161_2","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.13"},{"key":"e_1_3_2_162_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-53504-7_85"},{"key":"e_1_3_2_163_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02017345"},{"key":"e_1_3_2_164_2","volume-title":"Managing Gigabytes: Compressing and Indexing Documents and Images, Second Edition","author":"Witten Ian H.","year":"1999","unstructured":"Ian H. Witten, Alistair Moffat, and Timothy C. Bell. 1999. Managing Gigabytes: Compressing and Indexing Documents and Images, Second Edition. Morgan Kaufmann."},{"key":"e_1_3_2_165_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934995"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3797036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T20:42:05Z","timestamp":1775853725000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3797036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,11]]},"references-count":164,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2026,7,31]]}},"alternative-id":["10.1145\/3797036"],"URL":"https:\/\/doi.org\/10.1145\/3797036","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,11]]},"assertion":[{"value":"2025-06-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-04","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-03-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}