{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:09:51Z","timestamp":1784178591197,"version":"3.55.0"},"reference-count":60,"publisher":"Association for Computing Machinery (ACM)","issue":"8","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2023,4]]},"abstract":"<jats:p>Indexes can improve query-processing performance by avoiding full table scans. Although traditional indexes (e.g., B+-tree) have been widely used, learned indexes are proposed to adopt machine learning models to reduce the query latency and index size. However, existing learned indexes are (1) not thoroughly evaluated under the same experimental framework and are (2) not comprehensively compared with different settings (e.g., key lookup, key insert, concurrent operations, bulk loading). Moreover, it is hard to select appropriate learned indexes for practitioners in different settings. To address those problems, this paper detailedly reviews existing learned indexes and discusses the design choices of key components in learned indexes, including key lookup (position inference which predicts the position of a key, and position refinement which re-searches the position if the predicted position is incorrect), key insert, concurrency, and bulk loading. Moreover, we provide a testbed to facilitate the design and test of new learned indexes for researchers. We compare state-of-the-art learned indexes in the same experimental framework, and provide findings to select suitable learned indexes under various practical scenarios.<\/jats:p>","DOI":"10.14778\/3594512.3594528","type":"journal-article","created":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T00:28:36Z","timestamp":1687480116000},"page":"1992-2004","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":64,"title":["Learned Index: A Comprehensive Experimental Evaluation"],"prefix":"10.14778","volume":"16","author":[{"given":"Zhaoyan","family":"Sun","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuanhe","family":"Zhou","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guoliang","family":"Li","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,6,22]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"MADEX: Learning-augmented Algorithmic Index Structures","author":"Heinis A. H.","year":"2020","unstructured":"A. H. 0001 and T. Heinis . MADEX: Learning-augmented Algorithmic Index Structures . In B. He, B. Reinwald, and Y. Wu, editors, AIDB @VLDB 2020 , 2020. A. H. 0001 and T. Heinis. MADEX: Learning-augmented Algorithmic Index Structures. In B. He, B. Reinwald, and Y. Wu, editors, AIDB@VLDB 2020, 2020."},{"key":"e_1_2_1_2_1","first-page":"1","volume-title":"Exploiting Artificial Intelligence Techniques for Data Management","author":"Andersen M. M.","year":"2022","unstructured":"M. M. Andersen and P. T\u00f6z\u00fcn . Micro-architectural analysis of a learned index . In Exploiting Artificial Intelligence Techniques for Data Management , pages 1 -- 12 , 2022 . M. M. Andersen and P. T\u00f6z\u00fcn. Micro-architectural analysis of a learned index. In Exploiting Artificial Intelligence Techniques for Data Management, pages 1--12, 2022."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1734663.1734671","volume-title":"SIGFIDET '70","author":"Bayer R.","year":"1970","unstructured":"R. Bayer and E. McCreight . Organization and maintenance of large ordered indices. In SIGMOD , SIGFIDET '70 , page 107 -- 141 , New York, NY, USA , 1970 . Association for Computing Machinery. R. Bayer and E. McCreight. Organization and maintenance of large ordered indices. In SIGMOD, SIGFIDET '70, page 107--141, New York, NY, USA, 1970. Association for Computing Machinery."},{"key":"e_1_2_1_4_1","volume-title":"11th Annual Conference on Innovative Data Systems Research (CIDR)","author":"Crotty A.","year":"2021","unstructured":"A. Crotty . Hist-Tree : Those Who Ignore It Are Doomed to Learn . In 11th Annual Conference on Innovative Data Systems Research (CIDR) , 2021 . A. Crotty. Hist-Tree : Those Who Ignore It Are Doomed to Learn. In 11th Annual Conference on Innovative Data Systems Research (CIDR), 2021."},{"key":"e_1_2_1_5_1","volume-title":"Advances in Neural Information Processing Systems","volume":"11","author":"Dai Z.","year":"2020","unstructured":"Z. Dai and A. Shrivastava . Adaptive learned bloom filter (Ada-BF): Efficient utilization of the classifier with application to real-time information filtering on the web . In Advances in Neural Information Processing Systems , volume 2020-Decem, pages 1-- 11 , 2020 . Z. Dai and A. Shrivastava. Adaptive learned bloom filter (Ada-BF): Efficient utilization of the classifier with application to real-time information filtering on the web. In Advances in Neural Information Processing Systems, volume 2020-Decem, pages 1--11, 2020."},{"key":"e_1_2_1_6_1","volume-title":"EDBT","volume":"410","author":"Davitkova A.","year":"2020","unstructured":"A. Davitkova , E. Milchevski , and S. Michel . The ML-index: A multidimensional, learned index for point, range, and nearest-neighbor queries . In EDBT , volume 2020-March, pages 407-- 410 , 2020 . A. Davitkova, E. Milchevski, and S. Michel. The ML-index: A multidimensional, learned index for point, range, and nearest-neighbor queries. In EDBT, volume 2020-March, pages 407--410, 2020."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389711"},{"key":"e_1_2_1_8_1","first-page":"74","volume-title":"Proceedings of the VLDB Endowment","volume":"14","author":"Ding J.","year":"2020","unstructured":"J. Ding , V. Nathan , M. Alizadeh , and T. Kraska . Tsunami: A learned multidimensional index for correlated data and skewed workloads . In Proceedings of the VLDB Endowment , volume 14 , pages 74 -- 86 , 2020 . J. Ding, V. Nathan, M. Alizadeh, and T. Kraska. Tsunami: A learned multidimensional index for correlated data and skewed workloads. In Proceedings of the VLDB Endowment, volume 14, pages 74--86, 2020."},{"key":"e_1_2_1_9_1","first-page":"527","volume-title":"VLDB","volume":"15","author":"Dittrich J.","year":"2021","unstructured":"J. Dittrich , J. Nix , and C. Sch\u00f6n . The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures . In VLDB , volume 15 , pages 527 -- 540 , 2021 . J. Dittrich, J. Nix, and C. Sch\u00f6n. The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures. In VLDB, volume 15, pages 527--540, 2021."},{"key":"e_1_2_1_10_1","volume-title":"ICML 2020","author":"Ferragina P.","year":"2020","unstructured":"P. Ferragina , F. Lillo , and G. Vinciguerra . Why are learned indexes so effective? ICML 2020 , PartF16814: 3104--3113 , 2020 . P. Ferragina, F. Lillo, and G. Vinciguerra. Why are learned indexes so effective? ICML 2020, PartF16814:3104--3113, 2020."},{"key":"e_1_2_1_11_1","first-page":"1162","volume-title":"VLDB","volume":"13","author":"Ferragina P.","year":"2020","unstructured":"P. Ferragina and G. Vinciguerra . The PGM-index: A fully-dynamic compressed learned index with provable worst-case bounds . In VLDB , volume 13 , pages 1162 -- 1175 , 2020 . P. Ferragina and G. Vinciguerra. The PGM-index: A fully-dynamic compressed learned index with provable worst-case bounds. In VLDB, volume 13, pages 1162--1175, 2020."},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1145\/3299869.3319860","volume-title":"SIGMOD '19","author":"Galakatos A.","year":"2019","unstructured":"A. Galakatos , M. Markovitch , C. Binnig , R. Fonseca , and T. Kraska . Fiting-tree: A data-aware index structure. In SIGMOD , SIGMOD '19 , page 1189 -- 1206 , New York, NY, USA , 2019 . Association for Computing Machinery. A. Galakatos, M. Markovitch, C. Binnig, R. Fonseca, and T. Kraska. Fiting-tree: A data-aware index structure. In SIGMOD, SIGMOD '19, page 1189--1206, New York, NY, USA, 2019. Association for Computing Machinery."},{"key":"e_1_2_1_13_1","volume-title":"EDBT","volume":"713","author":"Hadian A.","year":"2019","unstructured":"A. Hadian and T. Heinis . Interpolation-friendly B-trees: Bridging the gap between algorithmic and learned indexes . In EDBT , volume 2019-March, pages 710-- 713 , 2019 . A. Hadian and T. Heinis. Interpolation-friendly B-trees: Bridging the gap between algorithmic and learned indexes. In EDBT, volume 2019-March, pages 710--713, 2019."},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/1807167.1807206","volume-title":"SIGMOD '10","author":"Kim C.","year":"2010","unstructured":"C. Kim , J. Chhugani , N. Satish , E. Sedlar , A. D. Nguyen , T. Kaldewey , V. W. Lee , S. A. Brandt , and P. Dubey . Fast: Fast architecture sensitive tree search on modern cpus and gpus. In SIGMOD , SIGMOD '10 , page 339 -- 350 , New York, NY, USA , 2010 . Association for Computing Machinery. C. Kim, J. Chhugani, N. Satish, E. Sedlar, A. D. Nguyen, T. Kaldewey, V. W. Lee, S. A. Brandt, and P. Dubey. Fast: Fast architecture sensitive tree search on modern cpus and gpus. In SIGMOD, SIGMOD '10, page 339--350, New York, NY, USA, 2010. Association for Computing Machinery."},{"key":"e_1_2_1_15_1","volume-title":"MLForSystems@NeurIPS","author":"Kipf A.","year":"2019","unstructured":"A. Kipf , R. Marcus , A. van Renen , M. Stoian , A. Kemper , T. Kraska , and T. Neumann . SOSD: A Benchmark for Learned Indexes . In MLForSystems@NeurIPS 2019 , 2019. A. Kipf, R. Marcus, A. van Renen, M. Stoian, A. Kemper, T. Kraska, and T. Neumann. SOSD: A Benchmark for Learned Indexes. In MLForSystems@NeurIPS 2019, 2019."},{"key":"e_1_2_1_16_1","volume-title":"USA","author":"Kipf A.","year":"2020","unstructured":"A. Kipf , R. Marcus , A. van Renen , M. Stoian , A. Kemper , T. Kraska , and T. Neumann . Radixspline: A single-pass learned index. In Exploiting Artificial Intelligence Techniques for Data Management, aiDM '20, New York, NY , USA , 2020 . Association for Computing Machinery. A. Kipf, R. Marcus, A. van Renen, M. Stoian, A. Kemper, T. Kraska, and T. Neumann. Radixspline: A single-pass learned index. In Exploiting Artificial Intelligence Techniques for Data Management, aiDM '20, New York, NY, USA, 2020. Association for Computing Machinery."},{"key":"e_1_2_1_17_1","first-page":"1331","volume-title":"SIGMOD '22","author":"Kornaropoulos E. M.","year":"2022","unstructured":"E. M. Kornaropoulos , S. Ren , and R. Tamassia . The price of tailoring the index to your data: Poisoning attacks on learned index structures. In SIGMOD , SIGMOD '22 , page 1331 -- 1344 , New York, NY, USA , 2022 . Association for Computing Machinery. E. M. Kornaropoulos, S. Ren, and R. Tamassia. The price of tailoring the index to your data: Poisoning attacks on learned index structures. In SIGMOD, SIGMOD '22, page 1331--1344, New York, NY, USA, 2022. Association for Computing Machinery."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-020-00149-7"},{"key":"e_1_2_1_20_1","first-page":"38","volume-title":"Proceedings - International Conference on Data Engineering","author":"Leis V.","year":"2013","unstructured":"V. Leis , A. Kemper , and T. Neumann . The adaptive radix tree: ARTful indexing for main-memory databases . In Proceedings - International Conference on Data Engineering , pages 38 -- 49 . IEEE, 2013 . V. Leis, A. Kemper, and T. Neumann. The adaptive radix tree: ARTful indexing for main-memory databases. In Proceedings - International Conference on Data Engineering, pages 38--49. IEEE, 2013."},{"key":"e_1_2_1_21_1","first-page":"1","volume-title":"Data Management on New Hardware","author":"Leis V.","year":"2016","unstructured":"V. Leis , F. Scheibner , A. Kemper , and T. Neumann . The art of practical synchronization . In Data Management on New Hardware , pages 1 -- 8 , 2016 . V. Leis, F. Scheibner, A. Kemper, and T. Neumann. The art of practical synchronization. In Data Management on New Hardware, pages 1--8, 2016."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557077"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457542"},{"key":"e_1_2_1_24_1","first-page":"321","volume-title":"VLDB","volume":"15","author":"Li P.","year":"2021","unstructured":"P. Li , Y. Hua , J. Jia , and P. Zuo . FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems . In VLDB , volume 15 , pages 321 -- 334 , 2021 . P. Li, Y. Hua, J. Jia, and P. Zuo. FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems. In VLDB, volume 15, pages 321--334, 2021."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389703"},{"key":"e_1_2_1_26_1","first-page":"2355","volume-title":"Proceedings of the VLDB Endowment","volume":"13","author":"Liu Q.","year":"2020","unstructured":"Q. Liu and L. Zheng . Stable Learned Bloom Filters for Data Streams . In Proceedings of the VLDB Endowment , volume 13 , pages 2355 -- 2367 , 2020 . Q. Liu and L. Zheng. Stable Learned Bloom Filters for Data Streams. In Proceedings of the VLDB Endowment, volume 13, pages 2355--2367, 2020."},{"key":"e_1_2_1_27_1","first-page":"597","volume-title":"VLDB","volume":"15","author":"Lu B.","year":"2021","unstructured":"B. Lu , J. Ding , E. Lo , U. F. Minhas , and T. Wang . APEX: A High-Performance Learned Index on Persistent Memory . In VLDB , volume 15 , pages 597 -- 610 , 2021 . B. Lu, J. Ding, E. Lo, U. F. Minhas, and T. Wang. APEX: A High-Performance Learned Index on Persistent Memory. In VLDB, volume 15, pages 597--610, 2021."},{"issue":"3","key":"e_1_2_1_28_1","first-page":"561","article-title":"Film: A fully learned index for larger-than-memory databases","volume":"16","author":"Ma C.","year":"2022","unstructured":"C. Ma , X. Yu , Y. Li , X. Meng , and A. Maoliniyazi . Film: A fully learned index for larger-than-memory databases . VLDB , 16 ( 3 ): 561 -- 573 , 2022 . C. Ma, X. Yu, Y. Li, X. Meng, and A. Maoliniyazi. Film: A fully learned index for larger-than-memory databases. VLDB, 16(3):561--573, 2022.","journal-title":"VLDB"},{"key":"e_1_2_1_29_1","first-page":"1079","volume-title":"Proceedings of the VLDB Endowment","volume":"15","author":"Maltry M.","year":"2022","unstructured":"M. Maltry and J. Dittrich . A critical analysis of recursive model indexes . In Proceedings of the VLDB Endowment , volume 15 , pages 1079 -- 1091 , 2022 . M. Maltry and J. Dittrich. A critical analysis of recursive model indexes. In Proceedings of the VLDB Endowment, volume 15, pages 1079--1091, 2022."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3421424.3421425"},{"key":"e_1_2_1_31_1","first-page":"2789","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Marcus R.","year":"2020","unstructured":"R. Marcus , E. Zhang , and T. Kraska . CDFShop: Exploring and Optimizing Learned Index Structures . In Proceedings of the ACM SIGMOD International Conference on Management of Data , pages 2789 -- 2792 , 2020 . R. Marcus, E. Zhang, and T. Kraska. CDFShop: Exploring and Optimizing Learned Index Structures. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 2789--2792, 2020."},{"key":"e_1_2_1_32_1","volume-title":"Parallel and Distributed Computing and Systems","volume":"509518","author":"McKenney P. E.","year":"1998","unstructured":"P. E. McKenney and J. D. Slingwine . Read-copy update: Using execution history to solve concurrency problems . In Parallel and Distributed Computing and Systems , volume 509518 , 1998 . P. E. McKenney and J. D. Slingwine. Read-copy update: Using execution history to solve concurrency problems. In Parallel and Distributed Computing and Systems, volume 509518, 1998."},{"key":"e_1_2_1_33_1","volume-title":"NIPS","volume":"473","author":"Mitzenmacher M.","year":"2018","unstructured":"M. Mitzenmacher . A model for learned bloom filters, and optimizing by sandwiching . In NIPS , volume 2018-Decem, pages 464-- 473 , 2018 . M. Mitzenmacher. A model for learned bloom filters, and optimizing by sandwiching. In NIPS, volume 2018-Decem, pages 464--473, 2018."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380579"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_2_1_36_1","first-page":"2341","volume-title":"VLDB","volume":"13","author":"Qi J.","year":"2020","unstructured":"J. Qi , G. Liu , C. S. Jensen , and L. Kulik . Effectively learning spatial indices . In VLDB , volume 13 , pages 2341 -- 2354 , 2020 . J. Qi, G. Liu, C. S. Jensen, and L. Kulik. Effectively learning spatial indices. In VLDB, volume 13, pages 2341--2354, 2020."},{"key":"e_1_2_1_37_1","volume-title":"ICML 2019","volume":"9197","author":"Rae J. W.","year":"2019","unstructured":"J. W. Rae , S. Bartunov , and T. P. Lillicrap . Meta-learning neural bloom filters . In ICML 2019 , volume 2019-June, pages 9188-- 9197 , 2019 . J. W. Rae, S. Bartunov, and T. P. Lillicrap. Meta-learning neural bloom filters. In ICML 2019, volume 2019-June, pages 9188--9197, 2019."},{"issue":"1","key":"e_1_2_1_38_1","first-page":"532","volume":"16","author":"Sabek I.","year":"2022","unstructured":"I. Sabek , K. Vaidya , D. Horn TUM, A. Kipf , M. Mitzenmacher , T. Kraska , D. Horn , and T . Kraska Can. Learned Models Replace Hash Functions. 16 ( 1 ): 532 -- 545 , 2022 . I. Sabek, K. Vaidya, D. Horn TUM, A. Kipf, M. Mitzenmacher, T. Kraska, D. Horn, and T. Kraska Can. Learned Models Replace Hash Functions. 16(1):532--545, 2022.","journal-title":"Kraska Can. Learned Models Replace Hash Functions."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3076113.3076116"},{"key":"e_1_2_1_40_1","volume-title":"AIDB@VLDB","author":"Spector B.","year":"2021","unstructured":"B. Spector , A. Kipf , K. Vaidya , C. Wang , U. F. Minhas , and T. Kraska . Bounding the Last Mile: Efficient Learned String Indexing . In AIDB@VLDB 2021 , 2021. B. Spector, A. Kipf, K. Vaidya, C. Wang, U. F. Minhas, and T. Kraska. Bounding the Last Mile: Efficient Learned String Indexing. In AIDB@VLDB 2021, 2021."},{"key":"e_1_2_1_41_1","volume-title":"AIDB@VLDB","author":"Stoian M.","year":"2021","unstructured":"M. Stoian , A. Kipf , R. Marcus , and T. Kraska . Towards Practical Learned Indexing . In AIDB@VLDB 2021 , 2021. M. Stoian, A. Kipf, R. Marcus, and T. Kraska. Towards Practical Learned Indexing. In AIDB@VLDB 2021, 2021."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3485450.3485459"},{"key":"e_1_2_1_43_1","first-page":"308","volume-title":"PPoPP","author":"Tang C.","year":"2020","unstructured":"C. Tang , Y. Wang , Z. Dong , G. Hu , Z. Wang , M. Wang , and H. Chen . Xindex: A scalable learned index for multicore data storage . In PPoPP , pages 308 -- 320 , 2020 . C. Tang, Y. Wang, Z. Dong, G. Hu, Z. Wang, M. Wang, and H. Chen. Xindex: A scalable learned index for multicore data storage. In PPoPP, pages 308--320, 2020."},{"key":"e_1_2_1_44_1","volume-title":"International Conference on Learning Representations","author":"Vaidya K.","year":"2021","unstructured":"K. Vaidya , E. Knorr , M. Mitzenmacher , and T. Kraska . Partitioned learned bloom filters . In International Conference on Learning Representations , 2021 . K. Vaidya, E. Knorr, M. Mitzenmacher, and T. Kraska. Partitioned learned bloom filters. In International Conference on Learning Representations, 2021."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/3485450.3485458"},{"key":"e_1_2_1_46_1","first-page":"17","volume-title":"APSys 2020","author":"Wang Y.","year":"2020","unstructured":"Y. Wang , C. Tang , Z. Wang , and H. Chen . SIndex: A scalable learned index for string keys . In APSys 2020 , pages 17 -- 24 , 2020 . Y. Wang, C. Tang, Z. Wang, and H. Chen. SIndex: A scalable learned index for string keys. In APSys 2020, pages 17--24, 2020."},{"issue":"1","key":"e_1_2_1_47_1","volume":"18","author":"Wang Z.","year":"2022","unstructured":"Z. Wang , H. Chen , Y. Wang , C. Tang , and H. Wang . The Concurrent Learned Indexes for Multicore Data Storage. ACM Transactions on Storage , 18 ( 1 ), 2022 . Z. Wang, H. Chen, Y. Wang, C. Tang, and H. Wang. The Concurrent Learned Indexes for Multicore Data Storage. ACM Transactions on Storage, 18(1), 2022.","journal-title":"The Concurrent Learned Indexes for Multicore Data Storage. ACM Transactions on Storage"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551848"},{"key":"e_1_2_1_49_1","first-page":"1276","volume-title":"VLDB","volume":"14","author":"Wu J.","year":"2021","unstructured":"J. Wu , Y. Zhang , S. Chen , J. Wang , Y. Chen , and C. Xing . Updatable learned index with precise positions . In VLDB , volume 14 , page 1276 , 2021 . J. Wu, Y. Zhang, S. Chen, J. Wang, Y. Chen, and C. Xing. Updatable learned index with precise positions. In VLDB, volume 14, page 1276, 2021."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.14778\/3547305.3547322"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-022-00186-4"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3302424.3303955"},{"key":"e_1_2_1_53_1","first-page":"1223","volume-title":"SIGMOD","author":"Wu Y.","year":"2019","unstructured":"Y. Wu , J. Yu , Y. Tian , R. Sidle , and R. Barber . Designing succinct secondary indexing mechanism by exploiting column correlations . SIGMOD , pages 1223 -- 1240 , 2019 . Y. Wu, J. Yu, Y. Tian, R. Sidle, and R. Barber. Designing succinct secondary indexing mechanism by exploiting column correlations. SIGMOD, pages 1223--1240, 2019."},{"key":"e_1_2_1_54_1","first-page":"193","volume-title":"SIGMOD, number 2","author":"Yang Z.","year":"2020","unstructured":"Z. Yang , B. Chandramouli , C. Wang , J. Gehrke , Y. Li , U. F. Minhas , P. \u00c5. Larson , D. Kossmann , and R. Acharya . Qd-tree: Learning Data Layouts for Big Data Analytics . In SIGMOD, number 2 , pages 193 -- 208 , 2020 . Z. Yang, B. Chandramouli, C. Wang, J. Gehrke, Y. Li, U. F. Minhas, P. \u00c5. Larson, D. Kossmann, and R. Acharya. Qd-tree: Learning Data Layouts for Big Data Analytics. In SIGMOD, number 2, pages 193--208, 2020."},{"key":"e_1_2_1_55_1","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/ISPASS.2014.6844459","volume-title":"2014 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS)","author":"Yasin A.","year":"2014","unstructured":"A. Yasin . A top-down method for performance analysis and counters architecture . In 2014 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS) , pages 35 -- 44 . IEEE, 2014 . A. Yasin. A top-down method for performance analysis and counters architecture. In 2014 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS), pages 35--44. IEEE, 2014."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.14778\/3565838.3565846"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00116"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551823"},{"issue":"2","key":"e_1_2_1_59_1","first-page":"243","article-title":"Plin: a persistent learned index for non-volatile memory with high performance and instant recovery","volume":"16","author":"Zhang Z.","year":"2022","unstructured":"Z. Zhang , Z. Chu , P. Jin , Y. Luo , X. Xie , S. Wan , Y. Luo , X. Wu , P. Zou , C. Zheng , Plin: a persistent learned index for non-volatile memory with high performance and instant recovery . VLDB , 16 ( 2 ): 243 -- 255 , 2022 . Z. Zhang, Z. Chu, P. Jin, Y. Luo, X. Xie, S. Wan, Y. Luo, X. Wu, P. Zou, C. Zheng, et al. Plin: a persistent learned index for non-volatile memory with high performance and instant recovery. VLDB, 16(2):243--255, 2022.","journal-title":"VLDB"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2994641"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3594512.3594528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T00:36:19Z","timestamp":1687480579000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3594512.3594528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":60,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["10.14778\/3594512.3594528"],"URL":"https:\/\/doi.org\/10.14778\/3594512.3594528","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2023,4]]},"assertion":[{"value":"2023-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}