{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T22:53:53Z","timestamp":1781477633399,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819541485","type":"print"},{"value":"9789819541492","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-4149-2_6","type":"book-chapter","created":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T22:45:53Z","timestamp":1781477153000},"page":"88-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["HiCHT: High-Performance Compact Hash Table"],"prefix":"10.1007","author":[{"given":"Biao","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pengcheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jifan","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weiguang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,2]]},"reference":[{"key":"6_CR1","unstructured":"Agarwal, R., Khandelwal, A., Stoica, I.: Succinct: enabling queries on compressed data. In: 12th $$\\{$$USENIX$$\\}$$ Symposium on Networked Systems Design and Implementation ($$\\{$$NSDI$$\\}$$ 15), pp. 337\u2013350 (2015)"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1093\/comjnl\/17.2.135","volume":"17","author":"O Amble","year":"1974","unstructured":"Amble, O., Knuth, D.E.: Ordered hash tables. Comput. J. 17(2), 135\u2013142 (1974)","journal-title":"Comput. J."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Arbitman, Y., Naor, M., Segev, G.: Backyard cuckoo hashing: constant worst-case operations with a succinct representation. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 787\u2013796. IEEE (2010)","DOI":"10.1109\/FOCS.2010.80"},{"key":"6_CR4","unstructured":"Bercea, I.O., Even, G.: A space-efficient dynamic dictionary for multisets with constant time operations. arXiv preprint arXiv:2005.02143 (2020)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Blandford, D.K., Blelloch, G.E.: Compact dictionaries for variable-length keys and data with applications. ACM Trans. Algorithms (TALG) 4(2), 1\u201325 (2008), publisher: ACM New York, NY, USA","DOI":"10.1145\/1361192.1361194"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Bowe, A., Onodera, T., Sadakane, K., Shibuya, T.: Succinct de bruijn graphs. In: International Workshop on Algorithms in Bioinformatics, pp. 225\u2013235. Springer (2012)","DOI":"10.1007\/978-3-642-33122-0_18"},{"issue":"9","key":"6_CR7","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1109\/TC.1984.1676499","volume":"100","author":"J Clerry","year":"1984","unstructured":"Clerry, J.: Compact hash tables using bidirectional linear probing. IEEE Trans. Comput. 100(9), 828\u2013834 (1984)","journal-title":"IEEE Trans. Comput."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Cooper, B.F., Silberstein, A., Tam, E., Ramakrishnan, R., Sears, R.: Benchmarking cloud serving systems with ycsb. In: Proceedings of the 1st ACM symposium on Cloud computing, pp. 143\u2013154 (2010)","DOI":"10.1145\/1807128.1807152"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Ding, J., et\u00a0al.: Alex: an updatable adaptive learned index. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 969\u2013984 (2020)","DOI":"10.1145\/3318464.3389711"},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1007\/s00034-015-0120-7","volume":"35","author":"S Kak","year":"2016","unstructured":"Kak, S.: Generalized unary coding. Circuits Systems Signal Process. 35(4), 1419\u20131426 (2016)","journal-title":"Circuits Systems Signal Process."},{"key":"6_CR11","volume-title":"Art Comput. Programm.","author":"DE Knuth","year":"1973","unstructured":"Knuth, D.E., et al.: Art Comput. Programm., vol. 3. Addison-Wesley Reading, MA (1973)"},{"issue":"9","key":"6_CR12","doi-asserted-by":"publisher","first-page":"2735","DOI":"10.1007\/s00453-022-00996-y","volume":"84","author":"D K\u00f6ppl","year":"2022","unstructured":"K\u00f6ppl, D., Puglisi, S.J., Raman, R.: Fast and simple compact hashing via bucketing. Algorithmica 84(9), 2735\u20132766 (2022)","journal-title":"Algorithmica"},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1145\/42404.42410","volume":"31","author":"PA Larson","year":"1988","unstructured":"Larson, P.A.: Dynamic hash tables. Commun. ACM 31(4), 446\u2013457 (1988)","journal-title":"Commun. ACM"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Li, X., Andersen, D.G., Kaminsky, M., Freedman, M.J.: Algorithmic improvements for fast concurrent cuckoo hashing. In: Proceedings of the Ninth European Conference on Computer Systems, pp. 1\u201314 (2014)","DOI":"10.1145\/2592798.2592820"},{"key":"6_CR15","unstructured":"Liu, M., Yin, Y., Yu, H.: Succinct filters for sets of unknown sizes. arXiv preprint arXiv:2004.12465 (2020)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Lu, B., Hao, X., Wang, T., Lo, E.: Dash: Scalable hashing on persistent memory. arXiv preprint arXiv:2003.07302 (2020)","DOI":"10.14778\/3389133.3389134"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Navarro, G.: Compact data structures: A practical approach. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781316588284"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Oukid, I., Lasperas, J., Nica, A., Willhalm, T., Lehner, W.: Fptree: a hybrid SCM dram persistent and concurrent b-tree for storage class memory. In: Proceedings of the 2016 International Conference on Management of Data, pp. 371\u2013386 (2016)","DOI":"10.1145\/2882903.2915251"},{"issue":"1","key":"6_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3588727","volume":"1","author":"P Pandey","year":"2023","unstructured":"Pandey, P., Bender, M.A., Conway, A., Farach-Colton, M., Kuszmaul, W., Tagliavini, G., Johnson, R.: Iceberght: high performance hash tables through stability and low associativity. Proc. ACM Manage. Data 1(1), 1\u201326 (2023)","journal-title":"Proc. ACM Manage. Data"},{"issue":"08","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1142\/S0129054118430025","volume":"29","author":"A Poyias","year":"2018","unstructured":"Poyias, A., Puglisi, S.J., Raman, R.: m-bonsai: a practical compact dynamic trie. Int. J. Found. Comput. Sci. 29(08), 1257\u20131278 (2018)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Raman, R., Rao, S.S.: Succinct dynamic dictionaries and trees. In: International Colloquium on Automata, Languages, and Programming, pp. 357\u2013368. Springer (2003)","DOI":"10.1007\/3-540-45061-0_30"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Wongkham, C., Lu, B., Liu, C., Zhong, Z., Lo, E., Wang, T.: Are updatable learned indexes ready? arXiv preprint arXiv:2207.02900 (2022)","DOI":"10.14778\/3551793.3551848"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4149-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T22:45:56Z","timestamp":1781477156000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4149-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819541485","9789819541492"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4149-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2025.github.io","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}