{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T16:44:50Z","timestamp":1772037890140,"version":"3.50.1"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"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":["62125202"],"award-info":[{"award-number":["62125202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U22B2022"],"award-info":[{"award-number":["U22B2022"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1109\/tkde.2023.3327009","type":"journal-article","created":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T18:24:36Z","timestamp":1698085476000},"page":"2301-2315","source":"Crossref","is-referenced-by-count":2,"title":["A Fast Learned Key-Value Store for Concurrent and Distributed Systems"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6793-0964","authenticated-orcid":false,"given":"Pengfei","family":"Li","sequence":"first","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7730-3796","authenticated-orcid":false,"given":"Yu","family":"Hua","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8633-2603","authenticated-orcid":false,"given":"Jingnan","family":"Jia","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9982-5130","authenticated-orcid":false,"given":"Pengfei","family":"Zuo","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489512"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"ref3","first-page":"1007","article-title":"HashKV: Enabling efficient updates in $kv$kv storage via hashing","volume-title":"Proc. USENIX Annu. Tech. Conf.","author":"Chan","year":"2018"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.44"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914847"},{"key":"ref6","first-page":"78","article-title":"Cache conscious indexing for decision-support in main memory","volume-title":"Proc. 25th Int. Conf. Very Large Data Bases","author":"Rao"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807206"},{"key":"ref8","first-page":"329","article-title":"Mitigating asymmetric read and write costs in cuckoo hashing for storage systems","volume-title":"Proc. USENIX Annu. Tech. Conf.","author":"Sun"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"ref10","article-title":"MongoDB","year":"2021"},{"key":"ref11","article-title":"IBM DB2","year":"2020"},{"key":"ref12","article-title":"LevelDB","author":"Ghemawat","year":"2011"},{"key":"ref13","article-title":"PostgreSQL","year":"1996"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915222"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.compind.2018.12.010"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463713"},{"key":"ref18","first-page":"209","article-title":"Characterizing, modeling, and benchmarking rocksdb key-value workloads at Facebook","volume-title":"Proc. 18th USENIX Conf. File Storage Technol.","author":"Cao"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319860"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389711"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389135"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374547"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3468520"},{"key":"ref25","article-title":"Outrageously large neural networks: The sparsely-gated mixture-of-experts layer","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Shazeer"},{"key":"ref26","first-page":"1","article-title":"Datacenter RPCs can be general and fast","volume-title":"Proc. 16th USENIX Symp. Netw. Syst. Des. Implementation","author":"Kalia"},{"key":"ref27","first-page":"15","article-title":"One-sided RDMA-conscious extendible hashing for disaggregated memory","volume-title":"Proc. USENIX Annu. Tech. Conf.","author":"Zuo"},{"key":"ref28","first-page":"181","article-title":"Cache-conscious concurrency control of main-memory indexes on shared-memory multiprocessor systems","volume-title":"Proc. 27th Int. Conf. Very Large Data Bases","author":"Cha"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517824"},{"key":"ref30","first-page":"451","article-title":"Balancing CPU and network in the cell distributed b-tree store","volume-title":"Proc. USENIX Annu. Tech. Conf.","author":"Mitchell"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300081"},{"issue":"5","key":"ref32","article-title":"And introduction to be-trees and write-optimization","volume":"40","author":"Bender","year":"2015","journal-title":"Login; Mag."},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511804410"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0355-0"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3401071.3401659"},{"key":"ref36","article-title":"SOSD: A benchmark for learned indexes","volume-title":"Proc. NeurIPS Workshop Mach. Learn. Syst.","author":"Kipf"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.14778\/3421424.3421425"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3384706"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384349"},{"key":"ref40","first-page":"155","article-title":"From wisckey to bourbon: A learned index for log-structured merge trees","volume-title":"Proc. 14th USENIX Symp. Operating Syst. Des. Implementation","author":"Dai"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.14778\/3425879.3425880"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389703"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335449"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882918"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3302424.3303955"},{"issue":"11","key":"ref46","first-page":"2634","article-title":"tree: A persistent b -tree with low tail latency","volume-title":"Proc. VLDB Endowment","volume":"13","author":"Chen"},{"key":"ref47","first-page":"227","article-title":"Efficient in-memory indexing with generalized prefix trees","volume":"180","author":"Boehm","year":"2011","journal-title":"Database Syst. Bus. Technol. Web"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1998.655800"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10506969\/10292900.pdf?arnumber=10292900","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T22:27:00Z","timestamp":1715120820000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10292900\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":47,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3327009","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,6]]}}}