{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,14]],"date-time":"2026-08-14T17:35:52Z","timestamp":1786728952330,"version":"build-2736575974"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2026,8,14]],"date-time":"2026-08-14T00:00:00Z","timestamp":1786665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"The National Key R&D Program of China","award":["2024YFB4504400"],"award-info":[{"award-number":["2024YFB4504400"]}]},{"name":"The Major Research Plan of the National Natural Science Foundation of China","award":["92582116"],"award-info":[{"award-number":["92582116"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["624B2120"],"award-info":[{"award-number":["624B2120"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"The Alibaba PolarDB","award":["Alibaba Innovative Research Program"],"award-info":[{"award-number":["Alibaba Innovative Research Program"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2026,12,30]]},"abstract":"<jats:p>\n                    As data volumes continue to escalate, conventional index structures struggle to keep pace with high-performance demands. Learned indexing is a data structure that leverages machine learning models to predict the locations of data, which significantly improves search performance compared to traditional indexing methods. However, existing learned index schemes often focus solely on optimizing read and write operations, neglecting scalability and robustness in their index design. This oversight leads to significant performance variations across workloads with different characteristics. In this article, we present\n                    <jats:sans-serif>SRIndex<\/jats:sans-serif>\n                    , a scalable and robust learned index, to address the abovementioned problems.\n                    <jats:sans-serif>SRIndex<\/jats:sans-serif>\n                    consists of the following design primitives: (i) It implements a\n                    <jats:italic toggle=\"yes\">model layer<\/jats:italic>\n                    , which is optimized with a select number of keys to reduce asynchronous retraining time and accelerate query processes; (ii) It incorporates a\n                    <jats:italic toggle=\"yes\">transition layer<\/jats:italic>\n                    to achieve the scalability of the index; and (iii) It introduces a\n                    <jats:italic toggle=\"yes\">leaf layer<\/jats:italic>\n                    to provide efficient storage and high access efficiency. Extensive experimental results demonstrate that\n                    <jats:sans-serif>SRIndex<\/jats:sans-serif>\n                    outperforms state-of-the-art learned indexes by improving 1.27\u00d7 of write throughput under dynamic workloads.\n                  <\/jats:p>\n                  <jats:p\/>","DOI":"10.1145\/3806051","type":"journal-article","created":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T10:52:42Z","timestamp":1776163962000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["SRIndex: Bridging the Last Mile between Learned-Index Scalability and Workload Dynamics for Memory Pooling Systems"],"prefix":"10.1145","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9056-735X","authenticated-orcid":false,"given":"Zhiwei","family":"Yang","sequence":"first","affiliation":[{"name":"Xiamen University","place":["Xiamen, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2355-3738","authenticated-orcid":false,"given":"Shuyue","family":"Zhou","sequence":"additional","affiliation":[{"name":"Schoold of Informatics, Xiamen University","place":["Xiamen, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2673-5868","authenticated-orcid":false,"given":"Zhirong","family":"Shen","sequence":"additional","affiliation":[{"name":"Xiamen University","place":["Xiamen, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7448-8674","authenticated-orcid":false,"given":"Yixiu","family":"Zhou","sequence":"additional","affiliation":[{"name":"Xiamen University","place":["Xiamen, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9008-5401","authenticated-orcid":false,"given":"Ronglong","family":"Wu","sequence":"additional","affiliation":[{"name":"Xiamen University","place":["Xiamen, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7362-2789","authenticated-orcid":false,"given":"Jiwu","family":"Shu","sequence":"additional","affiliation":[{"name":"Tsinghua University","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4070-135X","authenticated-orcid":false,"given":"Li","family":"Cheng","sequence":"additional","affiliation":[{"name":"Tencent","place":["Shenzhen, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-0172-7977","authenticated-orcid":false,"given":"Zheng","family":"Chen","sequence":"additional","affiliation":[{"name":"Tencent","place":["Shenzhen, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2765-4509","authenticated-orcid":false,"given":"Dmitrii","family":"Kaplun","sequence":"additional","affiliation":[{"name":"Saint Petersburg Electrotechnical University LETI","place":["Saint Petersburg, Russian Federation"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,8,14]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"crossref","unstructured":"Youmin Chen Youyou Lu Kedong Fang Qing Wang and Jiwu Shu. 2020. uTree: A persistent B+-Tree with Low Tail Latency. VLDB Endowment 12 (2020) 2634\u20132648.","DOI":"10.14778\/3407790.3407850"},{"key":"e_1_3_1_3_2","unstructured":"Google Cloud. 2017. OpenStgreetMap. Retrieved May 1 2023 from https:\/\/console.cloud.google.com\/marketplace\/details\/openstreetmap\/geo-openstreetmap"},{"key":"e_1_3_1_4_2","doi-asserted-by":"crossref","unstructured":"Douglas Comer. 1979. Ubiquitous B-tree. Computing Surveys (1979) 121\u2013137.","DOI":"10.1145\/356770.356776"},{"key":"e_1_3_1_5_2","first-page":"155","volume-title":"Proceedings of the 2020 USENIX Symposium on Operating Systems Design and Implementation","author":"Dai Yifan","year":"2020","unstructured":"Yifan Dai, Yien Xu, Aishwarya Ganesan, Ramnatthan Alagappan, Brian Kroth, Andrea Arpaci-Dusseau, and Remzi Arpaci-Dusseau. 2020. From wisckey to bourbon: A learned index for log-structured merge trees. In Proceedings of the 2020 USENIX Symposium on Operating Systems Design and Implementation. 155\u2013171."},{"key":"e_1_3_1_6_2","first-page":"407","volume-title":"Proceedings of the EDBT","author":"Davitkova Angjela","year":"2020","unstructured":"Angjela Davitkova, Evica Milchevski, and Sebastian Michel. 2020. The ML-index: A multidimensional, learned index for point, range, and nearest-neighbor queries. In Proceedings of the EDBT. 407\u2013410."},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389711"},{"key":"e_1_3_1_8_2","doi-asserted-by":"crossref","unstructured":"Siying Dong Andrew Kryczka Yanqin Jin and Michael Stumm. 2021. Rocksdb: Evolution of development priorities in a key-value store serving large-scale applications. ACM Transactions on Storage 4 (2021) 1\u201332.","DOI":"10.1145\/3483840"},{"key":"e_1_3_1_9_2","doi-asserted-by":"crossref","unstructured":"Paolo Ferragina and Giorgio Vinciguerra. 2020. The PGM-index: A fully-dynamic compressed learned index with provable worst-case bounds. VLDB Endowment 8 (2020) 1162\u20131175.","DOI":"10.14778\/3389133.3389135"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319860"},{"key":"e_1_3_1_11_2","first-page":"1","volume-title":"Proceedings of the 2024 ACM International Conference on Management of Data","author":"Ge Jiake","year":"2024","unstructured":"Jiake Ge, Huanchen Zhang, Boyu Shi, Yuanhui Luo, Yunda Guo, Yunpeng Chai, Yuxing Chen, and Anqun Pan. 2024. SALI: A scalable adaptive learned index framework based on probability models. In Proceedings of the 2024 ACM International Conference on Management of Data. 1\u201325."},{"key":"e_1_3_1_12_2","unstructured":"Sanjay Ghemawat and Jeff Dean. 2011. LevelDB. Retrieved January 1 2024 from https:\/\/github.com\/google\/leveldb"},{"key":"e_1_3_1_13_2","unstructured":"The PostgreSQL Global Development Group. 1996-2021. PostgreSQL. Retrieved June 6 2023 from https:\/\/www.postgresql.org\/"},{"key":"e_1_3_1_14_2","first-page":"1","volume-title":"Proceedings of the 2020 International Workshop on Applied AI for Database Systems and Applications","author":"Hadian Ali","year":"2020","unstructured":"Ali Hadian and Thomas Heinis. 2020. MADEX: Learning-augmented algorithmic index structures. In Proceedings of the 2020 International Workshop on Applied AI for Database Systems and Applications. 1\u201312."},{"key":"e_1_3_1_15_2","first-page":"253","volume-title":"Proceedings of the 24th International Conference on Extending Database Technology","author":"Hadian Ali","year":"2021","unstructured":"Ali Hadian and Thomas Heinis. 2021. Shift-table: A low-latency learned index for range queries using model correction. In Proceedings of the 24th International Conference on Extending Database Technology. 253\u2013264."},{"key":"e_1_3_1_16_2","doi-asserted-by":"crossref","unstructured":"Kaisong Huang Yuliang He and Tianzheng Wang. 2022. The past present and future of indexing on persistent memory. Proceedings of the VLDB Endowment (2022) 3774\u20133777.","DOI":"10.14778\/3554821.3554897"},{"key":"e_1_3_1_17_2","unstructured":"IBM Inc. 2020. IBM DB2. Retrieved May 16 2023 from https:\/\/www.ibm.com\/analytics\/db2"},{"key":"e_1_3_1_18_2","unstructured":"MongDB Inc. 2021. MongDB. Retrieved May 1 2023 from https:\/\/www.mongodb.com\/"},{"key":"e_1_3_1_19_2","first-page":"1","volume-title":"Proceedings of the 58th International Symposium on Microarchitecture","author":"Chen Xenia Xu Dan Schatzberg Nastaran Hajinaza Rupin Vakharwala Andy Anderson Dimitrios Skarlatos Kaiyang Zhao, Yuang","year":"2025","unstructured":"Xenia Xu Dan Schatzberg Nastaran Hajinaza Rupin Vakharwala Andy Anderson Dimitrios Skarlatos Kaiyang Zhao, Yuang Chen. 2025. Learning to walk: Architecting learned virtual memory translation. In Proceedings of the 58th International Symposium on Microarchitecture. 1\u201316."},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3401071.3401659"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_3_1_22_2","doi-asserted-by":"crossref","unstructured":"Guoliang Li Xuanhe Zhou Ji Sun Xiang Yu Yue Han Lianyuan Jin Wenbo Li Tianqing Wang and Shifu Li. 2021. Opengauss: An autonomous database system. VLDB Endowment 12 (2021) 3028\u20133042.","DOI":"10.14778\/3476311.3476380"},{"key":"e_1_3_1_23_2","doi-asserted-by":"crossref","unstructured":"Pengfei Li Yu Hua Jingnan Jia and Pengfei Zuo. 2021. FINEdex: A fine-grained learned index scheme for scalable and concurrent memory systems. VLDB Endowment 2 (2021) 321\u2013334.","DOI":"10.14778\/3489496.3489512"},{"key":"e_1_3_1_24_2","first-page":"99","volume-title":"Proceedings of the 2023 USENIX Conference on File and Storage Technologies","author":"Li Pengfei","year":"2023","unstructured":"Pengfei Li, Yu Hua, Pengfei Zuo, Zhangyu Chen, and Jiajie Sheng. 2023. ROLEX: A scalable RDMA-oriented learned key-value store for disaggregated memory systems. In Proceedings of the 2023 USENIX Conference on File and Storage Technologies. 99\u2013114."},{"key":"e_1_3_1_25_2","doi-asserted-by":"crossref","unstructured":"Jihang Liu Shimin Chen and Lujun Wang. 2020. LB+ trees: Optimizing persistent index performance on 3DXPoint memory. VLDB Endowment 7 (2020) 1078\u20131090.","DOI":"10.14778\/3384345.3384355"},{"key":"e_1_3_1_26_2","doi-asserted-by":"crossref","unstructured":"Baotong Lu Jialin Ding Eric Lo Umar Farooq Minhas and Tianzheng Wang. 2021. APEX: A high-performance learned index on persistent memory. VLDB Endowment 3 (2021) 597\u2013610.","DOI":"10.14778\/3494124.3494141"},{"key":"e_1_3_1_27_2","unstructured":"Mario Lurig. 2018. Amazon Sales Rank Data for Print And Kindle Books. Retrieved January 1 2024 from https:\/\/www.kaggle.com\/ucffool\/amazon-sales-rank-data-for-print-and-kindle-books"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_3_1_29_2","first-page":"509","volume-title":"Proceedings of the Parallel and Distributed Computing and Systems.","author":"McKenney Paul E.","year":"1998","unstructured":"Paul E. McKenney and John D. Slingwine. 1998. Read-copy update: Using execution history to solve concurrency problems. In Proceedings of the Parallel and Distributed Computing and Systems.509\u2013518."},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380579"},{"key":"e_1_3_1_31_2","doi-asserted-by":"crossref","unstructured":"Patrick O\u2019Neil Edward Cheng Dieter Gawlick and Elizabeth O\u2019Neil. 1996. The log-structured merge-tree (LSM-tree). Acta Informatica 4 (1996) 351\u2013385.","DOI":"10.1007\/s002360050048"},{"key":"e_1_3_1_32_2","doi-asserted-by":"crossref","unstructured":"Rasmus Pagh and Flemming Friche Rodler. 2004. Cuckoo hashing. Journal of Algorithms 2 (2004) 122\u2013144.","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_3_1_33_2","doi-asserted-by":"crossref","unstructured":"Varun Pandey Andreas Kipf Thomas Neumann and Alfons Kemper. 2018. How ggood are modern spatial analytics systems? VLDB Endowment 11 (2018) 1661\u20131673.","DOI":"10.14778\/3236187.3236213"},{"key":"e_1_3_1_34_2","doi-asserted-by":"crossref","unstructured":"Suhas S. P. Rao Miriam H. Huntley Neva C. Durand Elena K. Stamenova Ivan D. Bochkov James T. Robinson Adrian L. Sanborn Ido Machol Arina D. Omer Eric S. Lander et\u00a0al. 2014. A 3D map of the human genome at kilobase resolution reveals principles of chromatin looping. Cell 7 (2014) 1665\u20131680.","DOI":"10.1016\/j.cell.2014.11.021"},{"key":"e_1_3_1_35_2","unstructured":"redislabs. 2021. Redis. Retrieved March 1 2025 from https:\/\/redis.io\/"},{"key":"e_1_3_1_36_2","doi-asserted-by":"crossref","unstructured":"Takayuki Tanabe Takashi Hoshino Hideyuki Kawashima and Osamu Tatebe. 2020. An analysis of concurrency control protocols for in-memory databases with ccbench. VLDB Endowment 13 (2020) 3531\u20133544.","DOI":"10.14778\/3424573.3424575"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374547"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300075"},{"key":"e_1_3_1_39_2","doi-asserted-by":"crossref","unstructured":"Ke Wang Guanqun Yang Yiwei Li Huanchen Zhang and Mingyu Gao. 2023. When tree meets hash: Reducing random reads for index structures on persistent memories. ACM on Management of Data 1 (2023) 1\u201326.","DOI":"10.1145\/3588959"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517824"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3409963.3410496"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196895"},{"key":"e_1_3_1_43_2","first-page":"117","volume-title":"Proceedings of the 2020 USENIX Symposium on Operating Systems Design and Implementation","author":"Wei Xingda","year":"2020","unstructured":"Xingda Wei, Rong Chen, and Haibo Chen. 2020. Fast RDMA-based ordered key-value store using remote learned cache. In Proceedings of the 2020 USENIX Symposium on Operating Systems Design and Implementation. 117\u2013135."},{"key":"e_1_3_1_44_2","doi-asserted-by":"crossref","unstructured":"Tom Wilcox Nanlin Jin Peter Flach and Joshua Thumim. 2019. A big data platform for smart meter data analytics. Computers in Industry 1 (2019) 250\u2013259.","DOI":"10.1016\/j.compind.2018.12.010"},{"key":"e_1_3_1_45_2","doi-asserted-by":"crossref","unstructured":"Chaichon Wongkham Baotong Lu Chris Liu Zhicong Zhong Eric Lo and Tianzheng Wang. 2022. Are updatable learned indexes ready? VLDB Endowment (2022) 3004\u20133017.","DOI":"10.14778\/3551793.3551848"},{"key":"e_1_3_1_46_2","doi-asserted-by":"crossref","unstructured":"Jiacheng Wu Yong Zhang Shimin Chen Jin Wang Yu Chen and Chunxiao Xing. 2021. Updatable learned index with precise positions. VLDB Endowment 8 (2021) 1276\u20131288.","DOI":"10.14778\/3457390.3457393"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300081"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3806051","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,14]],"date-time":"2026-08-14T16:48:14Z","timestamp":1786726094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3806051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,14]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,12,30]]}},"alternative-id":["10.1145\/3806051"],"URL":"https:\/\/doi.org\/10.1145\/3806051","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"value":"1553-3077","type":"print"},{"value":"1553-3093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,14]]},"assertion":[{"value":"2025-06-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-07","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-08-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}