{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:57:04Z","timestamp":1773482224714,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T00:00:00Z","timestamp":1628899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Natural Science Foundation of China (NSFC)","award":["No. U20A20179"],"award-info":[{"award-number":["No. U20A20179"]}]},{"name":"Primary Research & Development Plan of China","award":["2016YFB1000304"],"award-info":[{"award-number":["2016YFB1000304"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,14]]},"DOI":"10.1145\/3447548.3467240","type":"proceedings-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T06:12:08Z","timestamp":1628748728000},"page":"1863-1872","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["MapEmbed"],"prefix":"10.1145","author":[{"given":"Yuhan","family":"Wu","sequence":"first","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Zirui","family":"Liu","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Xiang","family":"Yu","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Jie","family":"Gui","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Haochen","family":"Gan","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Yuhao","family":"Han","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}]},{"given":"Tao","family":"Li","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}]},{"given":"Ori","family":"Rottenstreich","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Tong","family":"Yang","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2021,8,14]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330853"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_2_3_1","unstructured":"Helen HW Chan Chieh-Jan Mike Liang Yongkun Li Wenjia He Patrick PC Lee Lianjie Zhu Yaozu Dong Yinlong Xu Yu Xu Jin Jiang et al. Hashkv: Enabling efficient updates in {KV} storage via hashing. In 2018 {USENIX} Annual Technical Conference ({USENIX}{ATC} 18) pages 1007--1019 2018.  Helen HW Chan Chieh-Jan Mike Liang Yongkun Li Wenjia He Patrick PC Lee Lianjie Zhu Yaozu Dong Yinlong Xu Yu Xu Jin Jiang et al. Hashkv: Enabling efficient updates in {KV} storage via hashing. In 2018 {USENIX} Annual Technical Conference ({USENIX}{ATC} 18) pages 1007--1019 2018."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1090191.1080114"},{"key":"e_1_3_2_2_5_1","first-page":"165","volume-title":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","author":"Michael Shi Hao-Jun","year":"2020","unstructured":"Hao-Jun Michael Shi , Dheevatsa Mudigere , Maxim Naumov , and Jiyan Yang . Compositional embeddings using complementary partitions for memory-efficient recommendation systems . In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , pages 165 -- 175 , 2020 . Hao-Jun Michael Shi, Dheevatsa Mudigere, Maxim Naumov, and Jiyan Yang. Compositional embeddings using complementary partitions for memory-efficient recommendation systems. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pages 165--175, 2020."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/397"},{"key":"e_1_3_2_2_7_1","unstructured":"The benefits of altera's high-speed ddr sdram memory interface solution. https:\/\/www.intel.com\/content\/dam\/www\/programmable\/us\/en\/pdfs\/literature\/wp\/wp_stratix_ddr.pdf.  The benefits of altera's high-speed ddr sdram memory interface solution. https:\/\/www.intel.com\/content\/dam\/www\/programmable\/us\/en\/pdfs\/literature\/wp\/wp_stratix_ddr.pdf."},{"key":"e_1_3_2_2_8_1","first-page":"104","volume-title":"Matching the speed gap between sram and dram. In \u00b6roc IEEE HSPR","author":"Feng Wang","year":"2008","unstructured":"Wang Feng and Hamdi Mounir . Matching the speed gap between sram and dram. In \u00b6roc IEEE HSPR , pages 104 -- 109 , 2008 . Wang Feng and Hamdi Mounir. Matching the speed gap between sram and dram. In \u00b6roc IEEE HSPR, pages 104--109, 2008."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976007.14"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxh074"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261567"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw279"},{"key":"e_1_3_2_2_13_1","unstructured":"C minimal perfect hashing library. http:\/\/cmph.sourceforge.net\/.  C minimal perfect hashing library. http:\/\/cmph.sourceforge.net\/."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"e_1_3_2_2_15_1","first-page":"682","volume-title":"European Symposium on Algorithms","author":"Belazzougui Djamal","year":"2009","unstructured":"Djamal Belazzougui , Fabiano C Botelho , and Martin Dietzfelbinger . Hash, displace, and compress. In European Symposium on Algorithms , pages 682 -- 693 . Springer , 2009 . Djamal Belazzougui, Fabiano C Botelho, and Martin Dietzfelbinger. Hash, displace, and compress. In European Symposium on Algorithms, pages 682--693. Springer, 2009."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73951-7_13"},{"key":"e_1_3_2_2_17_1","volume-title":"A new algorithm for constructing minimal perfect hash functions. differences, 100(2):09","author":"Botelho Fabiano C","year":"2004","unstructured":"Fabiano C Botelho , David M Gomes , and Nivio Ziviani . A new algorithm for constructing minimal perfect hash functions. differences, 100(2):09 , 2004 . Fabiano C Botelho, David M Gomes, and Nivio Ziviani. A new algorithm for constructing minimal perfect hash functions. differences, 100(2):09, 2004."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791194094"},{"key":"e_1_3_2_2_19_1","unstructured":"Intel instructions. Available: https:\/\/software.intel.com\/sites\/landingpage\/IntrinsicsGuide\/.  Intel instructions. Available: https:\/\/software.intel.com\/sites\/landingpage\/IntrinsicsGuide\/."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350275"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2889329"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035963"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2016.7577353"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850585"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-765-3_9"},{"key":"e_1_3_2_2_26_1","unstructured":"Gnu gperf. https:\/\/www.gnu.org\/software\/gperf\/.  Gnu gperf. https:\/\/www.gnu.org\/software\/gperf\/."},{"key":"e_1_3_2_2_27_1","first-page":"95","article-title":"An approach for minimal perfect hash functions for very large databases. Universidade Federal de Minas Gerais, Belo Horizonte, Brazil","author":"Botelho Fabiano C","year":"2006","unstructured":"Fabiano C Botelho , Yoshiharu Kohayakawa , and Nivio Ziviani . An approach for minimal perfect hash functions for very large databases. Universidade Federal de Minas Gerais, Belo Horizonte, Brazil , Tech. Rep , 95 , 2006 . Fabiano C Botelho, Yoshiharu Kohayakawa, and Nivio Ziviani. An approach for minimal perfect hash functions for very large databases. Universidade Federal de Minas Gerais, Belo Horizonte, Brazil, Tech. Rep, 95, 2006.","journal-title":"Tech. Rep"},{"key":"e_1_3_2_2_28_1","volume-title":"An optimal algorithm for generating minimal perfect hash functions. Information processing letters, 43(5):257--264","author":"Czech Zbigniew J","year":"1992","unstructured":"Zbigniew J Czech , George Havas , and Bohdan S Majewski . An optimal algorithm for generating minimal perfect hash functions. Information processing letters, 43(5):257--264 , 1992 . Zbigniew J Czech, George Havas, and Bohdan S Majewski. An optimal algorithm for generating minimal perfect hash functions. Information processing letters, 43(5):257--264, 1992."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/133160.133209"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2747645"},{"key":"e_1_3_2_2_32_1","volume-title":"ACM CoNEXT","author":"Fan Bin","year":"2014","unstructured":"Bin Fan , Dave G Andersen , Michael Kaminsky , and Michael D Mitzenmacher . Cuckoo filter : Practically better than bloom . In ACM CoNEXT , 2014 . Bin Fan, Dave G Andersen, Michael Kaminsky, and Michael D Mitzenmacher. Cuckoo filter: Practically better than bloom. In ACM CoNEXT, 2014."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2818716"},{"key":"e_1_3_2_2_34_1","first-page":"385","volume-title":"NSDI","volume":"13","author":"Fan Bin","year":"2013","unstructured":"Bin Fan , David G Andersen , and Michael Kaminsky . Memc3 : Compact and concurrent memcache with dumber caching and smarter hashing . In NSDI , volume 13 , pages 385 -- 398 , 2013 . Bin Fan, David G Andersen, and Michael Kaminsky. Memc3: Compact and concurrent memcache with dumber caching and smarter hashing. In NSDI, volume 13, pages 385--398, 2013."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809984"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737454"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00112"},{"key":"e_1_3_2_2_38_1","volume-title":"SBC","author":"de Cristo Flaviene","year":"2019","unstructured":"Flaviene de Cristo , Eduardo de Almeida , and Marco Alves . Vivid cuckoo hash: Fast cuckoo table building in simd. In Anais Principais do XX Simp\u00f3sio em Sistemas Computacionais de Alto Desempenho, pages 288--299 . SBC , 2019 . Flaviene de Cristo, Eduardo de Almeida, and Marco Alves. Vivid cuckoo hash: Fast cuckoo table building in simd. In Anais Principais do XX Simp\u00f3sio em Sistemas Computacionais de Alto Desempenho, pages 288--299. SBC, 2019."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213884"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303757"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364333"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056115"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536354.2536359"},{"key":"e_1_3_2_2_44_1","unstructured":"Murmur hashing source codes. https:\/\/github.com\/aappleby\/smhasher\/blob\/master\/src\/MurmurHash3.cpp.  Murmur hashing source codes. https:\/\/github.com\/aappleby\/smhasher\/blob\/master\/src\/MurmurHash3.cpp."},{"key":"e_1_3_2_2_45_1","unstructured":"CAIDA [on line]. Available: http:\/\/www.caida.org\/home.  CAIDA [on line]. Available: http:\/\/www.caida.org\/home."},{"key":"e_1_3_2_2_46_1","unstructured":"The web page data set. http:\/\/fimi.ua.ac.be\/.  The web page data set. http:\/\/fimi.ua.ac.be\/."}],"event":{"name":"KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event Singapore","acronym":"KDD '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467240","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:28Z","timestamp":1750191508000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467240"}},"subtitle":["Perfect Hashing with High Load Factor and Fast Update"],"short-title":[],"issued":{"date-parts":[[2021,8,14]]},"references-count":46,"alternative-id":["10.1145\/3447548.3467240","10.1145\/3447548"],"URL":"https:\/\/doi.org\/10.1145\/3447548.3467240","relation":{},"subject":[],"published":{"date-parts":[[2021,8,14]]},"assertion":[{"value":"2021-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}