{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T10:14:52Z","timestamp":1781518492127,"version":"3.54.1"},"reference-count":64,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>Recently, numerous promising results have shown that updatable learned indexes can perform better than traditional indexes with much lower memory space consumption. But it is unknown how these learned indexes compare against each other and against the traditional ones under realistic workloads with changing data distributions and concurrency levels. This makes practitioners still wary about how these new indexes would actually behave in practice. To fill this gap, this paper conducts the first comprehensive evaluation on updatable learned indexes. Our evaluation uses ten real datasets and various workloads to challenge learned indexes in three aspects: performance, memory space efficiency and robustness. Based on the results, we give a series of takeaways that can guide the future development and deployment of learned indexes.<\/jats:p>","DOI":"10.14778\/3551793.3551848","type":"journal-article","created":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T22:25:03Z","timestamp":1664490303000},"page":"3004-3017","source":"Crossref","is-referenced-by-count":55,"title":["Are updatable learned indexes ready?"],"prefix":"10.14778","volume":"15","author":[{"given":"Chaichon","family":"Wongkham","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Baotong","family":"Lu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chris","family":"Liu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhicong","family":"Zhong","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Lo","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianzheng","family":"Wang","sequence":"additional","affiliation":[{"name":"Simon Fraser University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,9,29]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"R. Bayer and M. Schkolnick. 1977. Concurrency of Operations on B-Trees. Acta Inf. (1977).  R. Bayer and M. Schkolnick. 1977. Concurrency of Operations on B-Trees. Acta Inf. (1977).","DOI":"10.1007\/BF00263762"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW53142.2021.00029"},{"key":"e_1_2_1_3_1","volume-title":"https:\/\/panthema.net\/2007\/stx-btree\/, retrieved","author":"Bingmann Timo","year":"2021","unstructured":"Timo Bingmann . 2013. STX B+ Tree 0.9. https:\/\/panthema.net\/2007\/stx-btree\/, retrieved Sep. 1, 2021 . Timo Bingmann. 2013. STX B+ Tree 0.9. https:\/\/panthema.net\/2007\/stx-btree\/, retrieved Sep. 1, 2021."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 2018 International Conference on Management of Data.","author":"Robert","unstructured":"Robert Binna and et al. 2018. HOT: A Height Optimized Trie Index for Main-Memory Database Systems . In Proceedings of the 2018 International Conference on Management of Data. Robert Binna and et al. 2018. HOT: A Height Optimized Trie Index for Main-Memory Database Systems. In Proceedings of the 2018 International Conference on Management of Data."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3524060"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.75"},{"key":"e_1_2_1_7_1","volume-title":"Narasayya","author":"Chaudhuri Surajit","year":"1997","unstructured":"Surajit Chaudhuri and Vivek R . Narasayya . 1997 . An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server. In VLDB. 146--155. Surajit Chaudhuri and Vivek R. Narasayya. 1997. An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server. In VLDB. 146--155."},{"key":"e_1_2_1_8_1","volume-title":"https:\/\/console.cloud.google.com\/marketplace\/details\/openstreetmap\/geo-openstreetmap","author":"Cloud Google","year":"2017","unstructured":"Google Cloud . 2017. OpenStreetMap. ( 2017 ). https:\/\/console.cloud.google.com\/marketplace\/details\/openstreetmap\/geo-openstreetmap . Google Cloud. 2017. OpenStreetMap. (2017). https:\/\/console.cloud.google.com\/marketplace\/details\/openstreetmap\/geo-openstreetmap."},{"key":"e_1_2_1_9_1","volume-title":"Corbett and et al","author":"James","year":"2012","unstructured":"James C. Corbett and et al . 2012 . Spanner : Google's Globally-Distributed Database. In OSDI, Chandu Thekkath and Amin Vahdat (Eds .). James C. Corbett and et al. 2012. Spanner: Google's Globally-Distributed Database. In OSDI, Chandu Thekkath and Amin Vahdat (Eds.)."},{"key":"e_1_2_1_10_1","unstructured":"Andrew Crotty. 2021. Hist-Tree: Those Who Ignore It Are Doomed to Learn. In CIDR.  Andrew Crotty. 2021. Hist-Tree: Those Who Ignore It Are Doomed to Learn. In CIDR."},{"key":"e_1_2_1_11_1","volume-title":"14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20)","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 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20) . 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 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20)."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824074"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 23rd International Conference on Extending Database Technology, 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 23rd International Conference on Extending Database Technology, EDBT. 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 23rd International Conference on Extending Database Technology, EDBT."},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data.","author":"Jialin","unstructured":"Jialin Ding and et al. 2020. ALEX: An Updatable Adaptive Learned Index . In Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data. Jialin Ding and et al. 2020. ALEX: An Updatable Adaptive Learned Index. In Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data."},{"key":"e_1_2_1_15_1","volume-title":"Tsunami: A learned multi-dimensional index for correlated data and skewed workloads. PVLDB","author":"Ding Jialin","year":"2020","unstructured":"Jialin Ding , Vikram Nathan , Mohammad Alizadeh , and Tim Kraska . 2020 . Tsunami: A learned multi-dimensional index for correlated data and skewed workloads. PVLDB (2020). Jialin Ding, Vikram Nathan, Mohammad Alizadeh, and Tim Kraska. 2020. Tsunami: A learned multi-dimensional index for correlated data and skewed workloads. PVLDB (2020)."},{"key":"e_1_2_1_16_1","volume-title":"Recent Trends in Learning From Data","author":"Ferragina Paolo","unstructured":"Paolo Ferragina and Giorgio Vinciguerra . 2020. Learned Data Structures . In Recent Trends in Learning From Data . Springer International Publishing , 5--41. Paolo Ferragina and Giorgio Vinciguerra. 2020. Learned Data Structures. In Recent Trends in Learning From Data. Springer International Publishing, 5--41."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389135"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 2019 International Conference on Management of Data (SIGMOD '19)","author":"Alex","unstructured":"Alex Galakatos and et al. 2019. FITing-Tree: A Data-Aware Index Structure . In Proceedings of the 2019 International Conference on Management of Data (SIGMOD '19) . Alex Galakatos and et al. 2019. FITing-Tree: A Data-Aware Index Structure. In Proceedings of the 2019 International Conference on Management of Data (SIGMOD '19)."},{"key":"e_1_2_1_20_1","unstructured":"Ali Hadian and Thomas Heinis. 2021. Shift-Table: A Low-latency Learned Index for Range Queries using Model Correction. In EDBT. 253--264.  Ali Hadian and Thomas Heinis. 2021. Shift-Table: A Low-latency Learned Index for Range Queries using Model Correction. In EDBT. 253--264."},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the Third International Workshop on Exploiting Artificial Intelligence Techniques for Data Management (aiDM '20)","author":"Andreas","unstructured":"Andreas Kipf and et al. 2020. RadixSpline: A Single-Pass Learned Index . In Proceedings of the Third International Workshop on Exploiting Artificial Intelligence Techniques for Data Management (aiDM '20) . Andreas Kipf and et al. 2020. RadixSpline: A Single-Pass Learned Index. In Proceedings of the Third International Workshop on Exploiting Artificial Intelligence Techniques for Data Management (aiDM '20)."},{"key":"e_1_2_1_22_1","volume-title":"SOSD: A Benchmark for Learned Indexes. NeurIPS Workshop on Machine Learning for Systems","author":"Kipf Andreas","year":"2019","unstructured":"Andreas Kipf , Ryan Marcus , Alexander van Renen , Mihail Stoian , Alfons Kemper , Tim Kraska , and Thomas Neumann . 2019 . SOSD: A Benchmark for Learned Indexes. NeurIPS Workshop on Machine Learning for Systems (2019). Andreas Kipf, Ryan Marcus, Alexander van Renen, Mihail Stoian, Alfons Kemper, Tim Kraska, and Thomas Neumann. 2019. SOSD: A Benchmark for Learned Indexes. NeurIPS Workshop on Machine Learning for Systems (2019)."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407832"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047491"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933349.2933352"},{"key":"e_1_2_1_28_1","volume-title":"Proc. VLDB Endow.","author":"Lucas","year":"2019","unstructured":"Lucas Lersch and et al. 2019. Evaluating Persistent Memory Range Indexes . Proc. VLDB Endow. ( 2019 ). Lucas Lersch and et al. 2019. Evaluating Persistent Memory Range Indexes. Proc. VLDB Endow. (2019)."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384356"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489512"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389703"},{"key":"e_1_2_1_32_1","volume-title":"https:\/\/libraries.io\/data","author":"Repository","year":"2017","unstructured":"Libraries.io. 2017. Repository ID. ( 2017 ). https:\/\/libraries.io\/data . Libraries.io. 2017. Repository ID. (2017). https:\/\/libraries.io\/data."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-021-00825-0"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3494124.3494141"},{"key":"e_1_2_1_35_1","volume-title":"Performance-Optimal Read-Only Transactions. In 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20)","author":"Lu Haonan","year":"2020","unstructured":"Haonan Lu , Siddhartha Sen , and Wyatt Lloyd . 2020 . Performance-Optimal Read-Only Transactions. In 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20) . 333--349. Haonan Lu, Siddhartha Sen, and Wyatt Lloyd. 2020. Performance-Optimal Read-Only Transactions. In 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20). 333--349."},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the 26th ACM annual conference. ACM, 349--356","author":"Vincent","unstructured":"Vincent Y. Lum and Huei Ling. 1971. An optimization problem on the selection of secondary keys . In Proceedings of the 26th ACM annual conference. ACM, 349--356 . Vincent Y. Lum and Huei Ling. 1971. An optimization problem on the selection of secondary keys. In Proceedings of the 26th ACM annual conference. ACM, 349--356."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/3510397.3510405"},{"key":"e_1_2_1_38_1","unstructured":"Yandong Mao Eddie Kohler and Robert Tappan Morris. 2012. Cache craftiness for fast multicore key-value storage. In EuroSys. ACM 183--196.  Yandong Mao Eddie Kohler and Robert Tappan Morris. 2012. Cache craftiness for fast multicore key-value storage. In EuroSys. ACM 183--196."},{"key":"e_1_2_1_39_1","volume-title":"Proc. VLDB Endow.","author":"Ryan","year":"2020","unstructured":"Ryan Marcus and et al. 2020. Benchmarking Learned Indexes . Proc. VLDB Endow. ( 2020 ). Ryan Marcus and et al. 2020. Benchmarking Learned Indexes. Proc. VLDB Endow. (2020)."},{"key":"e_1_2_1_40_1","volume-title":"Bao: Making Learned Query Optimization Practical. In SIGMOD. 1275--1288.","author":"Marcus Ryan","year":"2021","unstructured":"Ryan Marcus , Parimarjan Negi , Hongzi Mao , Nesime Tatbul , Mohammad Alizadeh , and Tim Kraska . 2021 . Bao: Making Learned Query Optimization Practical. In SIGMOD. 1275--1288. Ryan Marcus, Parimarjan Negi, Hongzi Mao, Nesime Tatbul, Mohammad Alizadeh, and Tim Kraska. 2021. Bao: Making Learned Query Optimization Practical. In SIGMOD. 1275--1288."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342644"},{"key":"e_1_2_1_42_1","volume-title":"LEO: An autonomic query optimizer for DB2. IBM Syst. J.","author":"Markl Volker","year":"2003","unstructured":"Volker Markl , Guy M. Lohman , and Vijayshankar Raman . 2003 . LEO: An autonomic query optimizer for DB2. IBM Syst. J. (2003). Volker Markl, Guy M. Lohman, and Vijayshankar Raman. 2003. LEO: An autonomic query optimizer for DB2. IBM Syst. J. (2003)."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397232"},{"key":"e_1_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Vikram Nathan Jialin Ding Mohammad Alizadeh and Tim Kraska. 2020. Learning Multi-Dimensional Indexes. In SIGMOD. 985--1000.  Vikram Nathan Jialin Ding Mohammad Alizadeh and Tim Kraska. 2020. Learning Multi-Dimensional Indexes. In SIGMOD. 985--1000.","DOI":"10.1145\/3318464.3380579"},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Patrick O'Neil Edward Cheng Dieter Gawlick and Elizabeth O'Neil. 1996. The Log-Structured Merge-Tree (LSM-Tree). Acta Inf. (1996).  Patrick O'Neil Edward Cheng Dieter Gawlick and Elizabeth O'Neil. 1996. The Log-Structured Merge-Tree (LSM-Tree). Acta Inf. (1996).","DOI":"10.1007\/s002360050048"},{"key":"e_1_2_1_46_1","volume-title":"An On-Line Algorithm for Fitting Straight Lines between Data Ranges. Commun. ACM","author":"O'Rourke Joseph","year":"1981","unstructured":"Joseph O'Rourke . 1981. An On-Line Algorithm for Fitting Straight Lines between Data Ranges. Commun. ACM ( 1981 ). Joseph O'Rourke. 1981. An On-Line Algorithm for Fitting Straight Lines between Data Ranges. Commun. ACM (1981)."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407829"},{"key":"e_1_2_1_48_1","volume-title":"Rao and et al","author":"Suhas","year":"2014","unstructured":"Suhas S.P. Rao and et al . 2014 . A 3D Map of the Human Genome at Kilobase Resolution Reveals Principles of Chromatin Looping. Cell ( 2014). Suhas S.P. Rao and et al. 2014. A 3D Map of the Human Genome at Kilobase Resolution Reveals Principles of Chromatin Looping. Cell (2014)."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229866"},{"key":"e_1_2_1_50_1","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD. ACM, 767--776","author":"Srinath","unstructured":"Srinath Shankar and et al. 2012. Query optimization in microsoft SQL server PDW . In Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD. ACM, 767--776 . Srinath Shankar and et al. 2012. Query optimization in microsoft SQL server PDW. In Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD. ACM, 767--776."},{"key":"e_1_2_1_51_1","volume-title":"3rd International Workshop on Applied AI for Database Systems and Applications, AIDB Workshops.","author":"Spector Benjamin","year":"2021","unstructured":"Benjamin Spector , Andreas Kipf , Kapil Vaidya , Chi Wang , Umar Farooq Minhas , and Tim Kraska . 2021 . Bounding the Last Mile: Efficient Learned String Indexing (Extended Abstracts) . In 3rd International Workshop on Applied AI for Database Systems and Applications, AIDB Workshops. Benjamin Spector, Andreas Kipf, Kapil Vaidya, Chi Wang, Umar Farooq Minhas, and Tim Kraska. 2021. Bounding the Last Mile: Efficient Learned String Indexing (Extended Abstracts). In 3rd International Workshop on Applied AI for Database Systems and Applications, AIDB Workshops."},{"key":"e_1_2_1_52_1","volume-title":"https:\/\/archive.org\/download\/stackexchange","author":"Vote","year":"2021","unstructured":"Stackoverflow. 2021. Vote ID. ( 2021 ). https:\/\/archive.org\/download\/stackexchange . Stackoverflow. 2021. Vote ID. (2021). https:\/\/archive.org\/download\/stackexchange."},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP '20)","author":"Chuzhe","unstructured":"Chuzhe Tang and et al. 2020. XIndex: A Scalable Learned Index for Multicore Data Storage . In Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP '20) . Chuzhe Tang and et al. 2020. XIndex: A Scalable Learned Index for Multicore Data Storage. In Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP '20)."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2000.839397"},{"key":"e_1_2_1_55_1","volume-title":"Learned Index for Spatial Queries. In 2019 20th IEEE International Conference on Mobile Data Management (MDM). 569--574","author":"Wang Haixin","year":"2019","unstructured":"Haixin Wang , Xiaoyi Fu , Jianliang Xu , and Hua Lu . 2019 . Learned Index for Spatial Queries. In 2019 20th IEEE International Conference on Mobile Data Management (MDM). 569--574 . Haixin Wang, Xiaoyi Fu, Jianliang Xu, and Hua Lu. 2019. Learned Index for Spatial Queries. In 2019 20th IEEE International Conference on Mobile Data Management (MDM). 569--574."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3409963.3410496"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196895"},{"key":"e_1_2_1_58_1","volume-title":"Are Updatable Learned Indexes Ready? (Extended Version). arXiv","author":"Wongkham Chaichon","year":"2022","unstructured":"Chaichon Wongkham , Baotong Lu , Chris Liu , Zhicong Zhong , Eric Lo , and Tianzheng Wang . 2022. Are Updatable Learned Indexes Ready? (Extended Version). arXiv ( 2022 ). Chaichon Wongkham, Baotong Lu, Chris Liu, Zhicong Zhong, Eric Lo, and Tianzheng Wang. 2022. Are Updatable Learned Indexes Ready? (Extended Version). arXiv (2022)."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1088\/0004-6256\/140\/6\/1868"},{"key":"e_1_2_1_60_1","volume-title":"Proc. VLDB Endow.","author":"Jiacheng","unstructured":"Jiacheng Wu and et al. 2021. Updatable Learned Index with Precise Positions . Proc. VLDB Endow. Jiacheng Wu and et al. 2021. Updatable Learned Index with Precise Positions. Proc. VLDB Endow."},{"key":"e_1_2_1_61_1","first-page":"1","article-title":"Wormhole","volume":"18","author":"Wu Xingbo","year":"2019","unstructured":"Xingbo Wu , Fan Ni , and Song Jiang . 2019 . Wormhole : A Fast Ordered Index for In-memory Data Management. In EuroSys. 18 : 1 -- 18 :16. Xingbo Wu, Fan Ni, and Song Jiang. 2019. Wormhole: A Fast Ordered Index for In-memory Data Management. In EuroSys. 18:1--18:16.","journal-title":"A Fast Ordered Index for In-memory Data Management. In EuroSys."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00064"},{"key":"e_1_2_1_63_1","volume-title":"Qd-Tree: Learning Data Layouts for Big Data Analytics. In ACM SIGMOD International Conference on Management of Data.","author":"Zongheng","unstructured":"Zongheng Yang and et al. 2020 . Qd-Tree: Learning Data Layouts for Big Data Analytics. In ACM SIGMOD International Conference on Management of Data. Zongheng Yang and et al. 2020. Qd-Tree: Learning Data Layouts for Big Data Analytics. In ACM SIGMOD International Conference on Management of Data."},{"key":"e_1_2_1_64_1","volume-title":"Proceedings of the 2016 International Conference on Management of Data (SIGMOD '16)","author":"Huanchen","unstructured":"Huanchen Zhang and et al. 2016. Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes . In Proceedings of the 2016 International Conference on Management of Data (SIGMOD '16) . Huanchen Zhang and et al. 2016. Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes. In Proceedings of the 2016 International Conference on Management of Data (SIGMOD '16)."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3469830.3470892"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3551793.3551848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:49:00Z","timestamp":1672224540000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3551793.3551848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":64,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.14778\/3551793.3551848"],"URL":"https:\/\/doi.org\/10.14778\/3551793.3551848","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2022,7]]}}}