{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T20:52:19Z","timestamp":1730321539385,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,5,31]],"date-time":"2021-05-31T00:00:00Z","timestamp":1622419200000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["1900933"]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["16-43-D3M-FP040"],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3318464.3389711","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T17:12:33Z","timestamp":1590772353000},"page":"969-984","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":148,"title":["ALEX: An Updatable Adaptive Learned Index"],"prefix":"10.1145","author":[{"given":"Jialin","family":"Ding","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]},{"given":"Umar Farooq","family":"Minhas","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Jia","family":"Yu","sequence":"additional","affiliation":[{"name":"Arizona State University & Microsoft Research, Tempe, AZ, USA"}]},{"given":"Chi","family":"Wang","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Jaeyoung","family":"Do","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Yinan","family":"Li","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Hantian","family":"Zhang","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology & Microsoft Research, Atlanta, GA, USA"}]},{"given":"Badrish","family":"Chandramouli","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Johannes","family":"Gehrke","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}]},{"given":"Donald","family":"Kossmann","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"David","family":"Lomet","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Tim","family":"Kraska","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"14","article-title":"BF-Tree","volume":"7","author":"Athanassoulis Manos","year":"2014","unstructured":"Manos Athanassoulis and Anastasia Ailamaki . 2014 . BF-Tree : Approximate Tree Indexing. Proc. VLDB Endow. , Vol. 7 , 14 (Oct. 2014), 1881--1892. https:\/\/doi.org\/10.14778\/2733085.2733094 Manos Athanassoulis and Anastasia Ailamaki. 2014. BF-Tree: Approximate Tree Indexing. Proc. VLDB Endow., Vol. 7, 14 (Oct. 2014), 1881--1892. https:\/\/doi.org\/10.14778\/2733085.2733094","journal-title":"Approximate Tree Indexing. Proc. VLDB Endow."},{"key":"e_1_3_2_2_2_1","unstructured":"Amazon AWS. [n. d.]. OpenStreetMap on AWS. https:\/\/registry.opendata.aws\/osm\/. Amazon AWS. [n. d.]. OpenStreetMap on AWS. https:\/\/registry.opendata.aws\/osm\/."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-005-1237-z"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1292609.1292616"},{"key":"e_1_3_2_2_5_1","unstructured":"Timo Bingmann. [n. d.]. STX B+ Tree. https:\/\/panthema.net\/2007\/stx-btree\/. Timo Bingmann. [n. d.]. STX B+ Tree. https:\/\/panthema.net\/2007\/stx-btree\/."},{"volume-title":"18th USENIX Conference on File and Storage Technologies (FAST 20)","author":"Cao Zhichao","key":"e_1_3_2_2_6_1","unstructured":"Zhichao Cao , Siying Dong , Sagar Vemuri , and David H.C. Du . 2020. Characterizing, Modeling, and Benchmarking RocksDB Key-Value Workloads at Facebook . In 18th USENIX Conference on File and Storage Technologies (FAST 20) . USENIX Association, Santa Clara, CA, 209--223. https:\/\/www.usenix.org\/conference\/fast20\/presentation\/cao-zhichao Zhichao Cao, Siying Dong, Sagar Vemuri, and David H.C. Du. 2020. Characterizing, Modeling, and Benchmarking RocksDB Key-Value Workloads at Facebook. In 18th USENIX Conference on File and Storage Technologies (FAST 20). USENIX Association, Santa Clara, CA, 209--223. https:\/\/www.usenix.org\/conference\/fast20\/presentation\/cao-zhichao"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375688"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_2_2_9_1","unstructured":"Armon Dadgar. [n. d.]. Adaptive Radix Trees implemented in C. Armon Dadgar. [n. d.]. Adaptive Radix Trees implemented in C."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3329772.3329780"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319860"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140402.1140409"},{"key":"e_1_3_2_2_14_1","first-page":"4","article-title":"Modern B-Tree Techniques","volume":"3","author":"Graefe Goetz","year":"2011","unstructured":"Goetz Graefe . 2011 . Modern B-Tree Techniques . Found. Trends Databases , Vol. 3 , 4 (April 2011), 203--402. https:\/\/doi.org\/10.1561\/1900000028 Goetz Graefe. 2011. Modern B-Tree Techniques. Found. Trends Databases , Vol. 3, 4 (April 2011), 203--402. https:\/\/doi.org\/10.1561\/1900000028","journal-title":"Found. Trends Databases"},{"volume-title":"Proceedings of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS '03)","author":"Richard","key":"e_1_3_2_2_15_1","unstructured":"Richard A. Hankins and Jignesh M. Patel. 2003. Effect of Node Size on the Performance of Cache-Conscious B+-Trees . In Proceedings of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS '03) . Association for Computing Machinery, New York, NY, USA, 283--294. https:\/\/doi.org\/10.1145\/781027.781063 Richard A. Hankins and Jignesh M. Patel. 2003. Effect of Node Size on the Performance of Cache-Conscious B+-Trees. In Proceedings of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS '03). Association for Computing Machinery, New York, NY, USA, 283--294. https:\/\/doi.org\/10.1145\/781027.781063"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807206"},{"key":"e_1_3_2_2_17_1","volume-title":"Learned Cardinalities: Estimating Correlated Joins with Deep Learning. arXiv preprint arXiv:1809.00677","author":"Kipf Andreas","year":"2018","unstructured":"Andreas Kipf , Thomas Kipf , Bernhard Radke , Viktor Leis , Peter Boncz , and Alfons Kemper . 2018 . Learned Cardinalities: Estimating Correlated Joins with Deep Learning. arXiv preprint arXiv:1809.00677 (2018). Andreas Kipf, Thomas Kipf, Bernhard Radke, Viktor Leis, Peter Boncz, and Alfons Kemper. 2018. Learned Cardinalities: Estimating Correlated Joins with Deep Learning. arXiv preprint arXiv:1809.00677 (2018)."},{"key":"e_1_3_2_2_18_1","unstructured":"Donald E. Knuth. 1998. The Art of Computer Programming Volume 3: (2nd Ed.) Sorting and Searching .Addison Wesley Longman Publishing Co. Inc. USA. Donald E. Knuth. 1998. The Art of Computer Programming Volume 3: (2nd Ed.) Sorting and Searching .Addison Wesley Longman Publishing Co. Inc. USA."},{"key":"e_1_3_2_2_19_1","volume-title":"Jialin Ding, Ani Kristo, Guillaume Leclerc, Samuel Madden, Hongzi Mao, and Vikram Nathan.","author":"Kraska Tim","year":"2019","unstructured":"Tim Kraska , Mohammad Alizadeh , Alex Beutel , Ed H. Chi , Jialin Ding, Ani Kristo, Guillaume Leclerc, Samuel Madden, Hongzi Mao, and Vikram Nathan. 2019 . SageDB: A Learned Database System. In CIDR 2019, 9th Biennial Conference on Innovative Data Systems Research, Asilomar, CA, USA, January 13--16, 2019, Online Proceedings . www.cidrdb.org. http:\/\/cidrdb.org\/cidr2019\/papers\/p117-kraska-cidr19.pdf Tim Kraska, Mohammad Alizadeh, Alex Beutel, Ed H. Chi, Jialin Ding, Ani Kristo, Guillaume Leclerc, Samuel Madden, Hongzi Mao, and Vikram Nathan. 2019. SageDB: A Learned Database System. In CIDR 2019, 9th Biennial Conference on Innovative Data Systems Research, Asilomar, CA, USA, January 13--16, 2019, Online Proceedings. www.cidrdb.org. http:\/\/cidrdb.org\/cidr2019\/papers\/p117-kraska-cidr19.pdf"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1988.105439"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"e_1_3_2_2_23_1","volume-title":"Digital B-trees. In Proceedings of the seventh international conference on Very Large Data Bases-Volume 7. VLDB Endowment, 333--344","author":"Lomet David B","year":"1981","unstructured":"David B Lomet . 1981 . Digital B-trees. In Proceedings of the seventh international conference on Very Large Data Bases-Volume 7. VLDB Endowment, 333--344 . David B Lomet. 1981. Digital B-trees. In Proceedings of the seventh international conference on Very Large Data Bases-Volume 7. VLDB Endowment, 333--344."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/12047.12049"},{"key":"e_1_3_2_2_25_1","volume-title":"Proceedings of the 2018 International Conference on Management of Data (SIGMOD '18)","author":"Ma Lin","year":"1837","unstructured":"Lin Ma , Dana Van Aken , Ahmed Hefny , Gustavo Mezerhane , Andrew Pavlo , and Geoffrey J. Gordon . 2018. Query-Based Workload Forecasting for Self-Driving Database Management Systems . In Proceedings of the 2018 International Conference on Management of Data (SIGMOD '18) . Association for Computing Machinery, New York, NY, USA, 631--645. https:\/\/doi.org\/10.1145\/3 1837 13.3196908 Lin Ma, Dana Van Aken, Ahmed Hefny, Gustavo Mezerhane, Andrew Pavlo, and Geoffrey J. Gordon. 2018. Query-Based Workload Forecasting for Self-Driving Database Management Systems. In Proceedings of the 2018 International Conference on Management of Data (SIGMOD '18). Association for Computing Machinery, New York, NY, USA, 631--645. https:\/\/doi.org\/10.1145\/3183713.3196908"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_3_2_2_27_1","first-page":"11","article-title":"Neo","volume":"12","author":"Marcus Ryan","year":"2019","unstructured":"Ryan Marcus , Parimarjan Negi , Hongzi Mao , Chi Zhang , Mohammad Alizadeh , Tim Kraska , Olga Papaemmanouil , and Nesime Tatbul . 2019 . Neo : A Learned Query Optimizer. Proc. VLDB Endow. , Vol. 12 , 11 (July 2019), 1705--1718. https:\/\/doi.org\/10.14778\/3342263.3342644 Ryan Marcus, Parimarjan Negi, Hongzi Mao, Chi Zhang, Mohammad Alizadeh, Tim Kraska, Olga Papaemmanouil, and Nesime Tatbul. 2019. Neo: A Learned Query Optimizer. Proc. VLDB Endow., Vol. 12, 11 (July 2019), 1705--1718. https:\/\/doi.org\/10.14778\/3342263.3342644","journal-title":"A Learned Query Optimizer. Proc. VLDB Endow."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380579"},{"key":"e_1_3_2_2_29_1","unstructured":"Thomas Neumann. 2017. The Case for B-Tree Index Structures. http:\/\/databasearchitects.blogspot.com\/2017\/12\/the-case-for-b-tree-index-structures.html. Thomas Neumann. 2017. The Case for B-Tree Index Structures. http:\/\/databasearchitects.blogspot.com\/2017\/12\/the-case-for-b-tree-index-structures.html."},{"volume-title":"Database Management Systems 3 ed.)","author":"Ramakrishnan Raghu","key":"e_1_3_2_2_30_1","unstructured":"Raghu Ramakrishnan and Johannes Gehrke . 2002. Database Management Systems 3 ed.) . McGraw-Hill, Inc. , USA. Raghu Ramakrishnan and Johannes Gehrke. 2002. Database Management Systems 3 ed.). McGraw-Hill, Inc., USA."},{"volume-title":"Proceedings of the 25th International Conference on Very Large Data Bases (VLDB '99)","author":"Rao Jun","key":"e_1_3_2_2_31_1","unstructured":"Jun Rao and Kenneth A. Ross . 1999. Cache Conscious Indexing for Decision-Support in Main Memory . In Proceedings of the 25th International Conference on Very Large Data Bases (VLDB '99) . Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 78--89. Jun Rao and Kenneth A. Ross. 1999. Cache Conscious Indexing for Decision-Support in Main Memory. In Proceedings of the 25th International Conference on Very Large Data Bases (VLDB '99). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 78--89."},{"key":"e_1_3_2_2_32_1","volume-title":"Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (SIGMOD '00)","author":"Rao Jun","year":"2009","unstructured":"Jun Rao and Kenneth A. Ross . 2000. Making B+- Trees Cache Conscious in Main Memory . In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (SIGMOD '00) . Association for Computing Machinery, New York, NY, USA, 475--486. https:\/\/doi.org\/10.1145\/34 2009 .335449 Jun Rao and Kenneth A. Ross. 2000. Making B+- Trees Cache Conscious in Main Memory. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (SIGMOD '00). Association for Computing Machinery, New York, NY, USA, 475--486. https:\/\/doi.org\/10.1145\/342009.335449"},{"key":"e_1_3_2_2_33_1","unstructured":"TPC. [n. d.]. TPC-C. http:\/\/www.tpc.org\/tpcc\/. TPC. [n. d.]. TPC-C. http:\/\/www.tpc.org\/tpcc\/."},{"volume-title":"Proceedings of the 2019 International Conference on Management of Data (SIGMOD '19)","author":"Sandt Peter Van","key":"e_1_3_2_2_34_1","unstructured":"Peter Van Sandt , Yannis Chronis , and Jignesh M. Patel . 2019. Efficiently Searching In-Memory Sorted Arrays: Revenge of the Interpolation Search? . In Proceedings of the 2019 International Conference on Management of Data (SIGMOD '19) . Association for Computing Machinery, New York, NY, USA, 36--53. https:\/\/doi.org\/10.1145\/3299869.3300075 Peter Van Sandt, Yannis Chronis, and Jignesh M. Patel. 2019. Efficiently Searching In-Memory Sorted Arrays: Revenge of the Interpolation Search?. In Proceedings of the 2019 International Conference on Management of Data (SIGMOD '19). Association for Computing Machinery, New York, NY, USA, 36--53. https:\/\/doi.org\/10.1145\/3299869.3300075"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319861"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389770"}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Portland OR USA","acronym":"SIGMOD\/PODS '20"},"container-title":["Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3389711","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3389711","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T10:14:20Z","timestamp":1673345660000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389711"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,31]]},"references-count":35,"alternative-id":["10.1145\/3318464.3389711","10.1145\/3318464"],"URL":"https:\/\/doi.org\/10.1145\/3318464.3389711","relation":{},"subject":[],"published":{"date-parts":[[2020,5,31]]},"assertion":[{"value":"2020-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}