{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T10:51:41Z","timestamp":1781779901000,"version":"3.54.5"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"European Union's Horizon Europe research and innovation programme EFRA project","award":["101093026"],"award-info":[{"award-number":["101093026"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1109\/tkde.2023.3303341","type":"journal-article","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T17:40:45Z","timestamp":1691516445000},"page":"1249-1259","source":"Crossref","is-referenced-by-count":11,"title":["Parallel and External-Memory Construction of Minimal Perfect Hash Functions With PTHash"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0724-7092","authenticated-orcid":false,"given":"Giulio Ermanno","family":"Pibiri","sequence":"first","affiliation":[{"name":"Ca’ Foscari University of Venice, Venice, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6753-3149","authenticated-orcid":false,"given":"Roberto","family":"Trani","sequence":"additional","affiliation":[{"name":"HPC-Lab, ISTI-CNR, Pisa, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2635816"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261567"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxh074"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15775-2_37"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3302913"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2020-1939"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btac245"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-023-00226-2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btad219"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3376122"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.80"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462849"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2012.06.002"},{"key":"ref17","first-page":"352","article-title":"Cache-oblivious peeling of random hypergraphs","volume-title":"Proc. Data Compression Conf.","author":"Belazzougui"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44693-1_28"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/133160.133209"},{"key":"ref20","first-page":"682","article-title":"Hash, displace, and compress","volume-title":"Proc. Eur. Symp. Algorithms","author":"Belazzougui"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_16"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/39.6.547"},{"key":"ref23","first-page":"30","article-title":"The bloomier filter: An efficient data structure for static support lookup tables","volume-title":"Proc. 15th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Chazelle"},{"key":"ref24","first-page":"339","article-title":"Fast scalable construction of (minimal perfect hash) functions","volume-title":"Proc. Int. Symp. Exp. Algorithms","author":"Genuzio"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2020.104517"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_12"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63533"},{"key":"ref28","first-page":"1","article-title":"Fast and scalable minimal perfect hashing for massive key sets","volume-title":"Proc. 16th Int. Symp. Exp. Algorithms","author":"Limasset"},{"key":"ref29","first-page":"175","article-title":"RecSplit: Minimal perfect hashing via recursive splitting","volume-title":"Proc. 22nd Workshop Algorithm Eng. Experiments","author":"Esposito"},{"key":"ref30","article-title":"On the number of bits required to implement an associative memory","volume-title":"Memorandum 61, Computer Structures Group","author":"Fano","year":"1971"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321820"},{"key":"ref32","article-title":"GoogleBooks corpus, version 2.0","year":"2012"},{"key":"ref33","article-title":"The ClueWeb09 dataset","year":"2009"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/spe.587"},{"key":"ref35","article-title":"U.K.-2005","year":"2005"},{"key":"ref36","first-page":"177","article-title":"TweetsKB: A public and large-scale RDF corpus of annotated tweets","volume-title":"Proc. Eur. Semantic Web Conf.","author":"Fafalios"},{"key":"ref37","volume-title":"Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis","author":"Mitzenmacher","year":"2017"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10422839\/10210677.pdf?arnumber=10210677","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T19:51:45Z","timestamp":1707767505000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10210677\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":37,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3303341","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3]]}}}