{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:17:08Z","timestamp":1767183428536,"version":"3.44.0"},"reference-count":55,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62472127"],"award-info":[{"award-number":["62472127"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,7,2]]},"DOI":"10.1109\/iwqos65803.2025.11143534","type":"proceedings-article","created":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T17:29:52Z","timestamp":1757438992000},"page":"1-10","source":"Crossref","is-referenced-by-count":2,"title":["PDPH: A Performant Dynamic Perfect Hash Index with Rehashing Optimizations"],"prefix":"10.1109","author":[{"given":"Jiarui","family":"Wang","sequence":"first","affiliation":[{"name":"Harbin Institute of Technology,Shenzhen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangyu","family":"Zou","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology,Shenzhen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen","family":"Xia","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology,Shenzhen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Hu","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology,Shenzhen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangrui","family":"Meng","sequence":"additional","affiliation":[{"name":"Jinan Inspur Data Technology Co., Ltd."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xudong","family":"Li","sequence":"additional","affiliation":[{"name":"Jinan Inspur Data Technology Co., Ltd."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742797"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544834"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522713"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915222"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4842-1329-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457245"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2916689"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2886107.2886110"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-004-0115-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389134"},{"key":"ref11","first-page":"799","article-title":"Lock-free concurrent level hashing for persistent memory","volume-title":"Proceedings of USENIX ATC \u201920","author":"Chen"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517884"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3588727"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00109"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04128-0_61"},{"issue":"2","key":"ref17","first-page":"09","article-title":"A new algorithm for constructing minimal perfect hash functions","volume":"100","author":"Botelho","year":"2004","journal-title":"Differences"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73951-7_13"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04128-0_61"},{"key":"ref20","volume-title":"A new algorithm for constructing minimal perfect hash functions","author":"Botelho","year":"2004"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90220-P"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/133160.133209"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462849"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791194094"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467240"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330853"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref28","first-page":"1007","article-title":"Hashkv: Enabling efficient updates in kv storage via hashing","volume-title":"Proceedings of USENIX ATC \u201918","author":"Chan"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1090191.1080114"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403059"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/397"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/152610.152611"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732227"},{"key":"ref34","first-page":"294","article-title":"A study of index structures for main memory database management systems","volume-title":"Proceedings of VLDB \u201986","author":"Lehman"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2013.80"},{"key":"ref36","first-page":"19","article-title":"Building a high-performance finegrained deduplication framework for backup storage with high deduplication ratio","volume-title":"Proceedings of USENIX ATC \u201922","author":"Zou"},{"key":"ref37","first-page":"247","article-title":"Deepsketch: A new machine learningbased reference search technique for post-deduplication delta compression","volume-title":"Proceedings of FAST \u201922","author":"Park"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915251"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592820"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-004-0115-2"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3588962"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2635816"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261567"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15775-2_37"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bty500"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btac245"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_12"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3596453"},{"key":"ref49","first-page":"25:1","article-title":"Fast and scalable minimal perfect hashing for massive key sets","volume-title":"16th International Symposium on Experimental Algorithms","volume":"75","author":"Limasset"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976007.14"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977561.ch15"},{"key":"ref52","first-page":"194","article-title":"Shockhash: Towards optimal-space minimal perfect hashing beyond brute-force","volume-title":"Proceedings of ALENEX \u201924"},{"key":"ref53","first-page":"31","article-title":"Write-optimize dynamic hashing for persistent memory","volume-title":"Proceedings of FAST \u201919","author":"Nam"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44676-1_10"},{"key":"ref55","volume-title":"Caida","year":"1997"}],"event":{"name":"2025 IEEE\/ACM International Symposium on Quality of Service (IWQoS)","location":"Gold Coast, Australia","start":{"date-parts":[[2025,7,2]]},"end":{"date-parts":[[2025,7,4]]}},"container-title":["2025 IEEE\/ACM 33rd International Symposium on Quality of Service (IWQoS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11143240\/11143247\/11143534.pdf?arnumber=11143534","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T05:04:51Z","timestamp":1757480691000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11143534\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/iwqos65803.2025.11143534","relation":{},"subject":[],"published":{"date-parts":[[2025,7,2]]}}}