{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:42:49Z","timestamp":1787017369831,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"German Research Foundation","award":["Ke 401\/22-2"],"award-info":[{"award-number":["Ke 401\/22-2"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,10]]},"DOI":"10.1145\/3514221.3526121","type":"proceedings-article","created":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T22:33:49Z","timestamp":1654986829000},"page":"1626-1639","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Adaptive Hybrid Indexes"],"prefix":"10.1145","author":[{"given":"Christoph","family":"Anneser","sequence":"first","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Kipf","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huanchen","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Peking, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Neumann","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfons","family":"Kemper","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,6,11]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"AWS EC2 Instances. https:\/\/aws.amazon.com\/en\/ec2\/instance-types\/high-memory [accessed 2021-03-01]."},{"key":"e_1_3_2_2_2_1","unstructured":"LevelDB. https:\/\/github.com\/google\/leveldb [accessed 2021-03-01]."},{"key":"e_1_3_2_2_3_1","unstructured":"RocksDB. https:\/\/rocksdb.org\/ [accessed 2021-03-01]."},{"key":"e_1_3_2_2_4_1","unstructured":"S2 Geometry Library. https:\/\/s2geometry.io\/ [accessed 2021-03-01]."},{"key":"e_1_3_2_2_5_1","unstructured":"Tape is dead Disk is tape Flash is disk RAM locality is king. http:\/\/research.microsoft.com\/en-us\/um\/people\/gray\/talks\/Flash_is_Good.ppt [accessed 2021-03-01]."},{"key":"e_1_3_2_2_6_1","unstructured":"C++ HopscotchMap. https:\/\/github.com\/Tessil\/hopscotch-map [accessed 2021-03-01]."},{"key":"e_1_3_2_2_7_1","volume-title":"Succinct: Enabling Queries on Compressed Data","author":"Agarwal Rachit","year":"2015","unstructured":"Rachit Agarwal, Anurag Khandelwal, and Ion Stoica. 2015. Succinct: Enabling Queries on Compressed Data. In NSDI. USENIX Association, 337--350."},{"key":"e_1_3_2_2_8_1","unstructured":"Adnan Alhomssi and Viktor Leis. 2021. Contention and Space Management in B-Trees. In CIDR. 26--37."},{"key":"e_1_3_2_2_9_1","unstructured":"Christoph Anneser Andreas Kipf Harald Lang Thomas Neumann and Alfons Kemper. 2020. The Case for Hybrid Succinct Data Structures. In EDBT. 391--394."},{"key":"e_1_3_2_2_10_1","unstructured":"Nikolas Askitis and Ranjan Sinha. 2007. HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings. In ACSC. 97--105."},{"key":"e_1_3_2_2_11_1","unstructured":"Manos Athanassoulis Michael S Kester Lukas M Maas Radu Stoica Stratos Idreos Anastasia Ailamaki and Mark Callaghan. 2016. Designing Access Methods: The RUM Conjecture. In EDBT. 461--466."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1146-6"},{"key":"e_1_3_2_2_13_1","volume-title":"Ulrike Fischer, Dirk Habich, and Wolfgang Lehner.","author":"B\u00f6hm Matthias","year":"2011","unstructured":"Matthias B\u00f6hm, Benjamin Schlegel, Peter Benjamin Volk, Ulrike Fischer, Dirk Habich, and Wolfgang Lehner. 2011. Efficient In-Memory Indexing with Generalized Prefix Trees. In BTW. 227--246."},{"key":"e_1_3_2_2_14_1","volume-title":"Du","author":"Cao Zhichao","year":"2020","unstructured":"Zhichao Cao, Siying Dong, Sagar Vemuri, and David H. C. Du. 2020. Characterizing, Modeling, and Benchmarking RocksDB Key-Value Workloads at Facebook. In USENIX. 209--223."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0078--6"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Edith Cohen Nadav Grossaug and Haim Kaplan. 2006. Processing Top k Queries from Samples. In CoNEXT.","DOI":"10.1145\/1368436.1368446"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","unstructured":"Brian F Cooper Adam Silberstein Erwin Tam Raghu Ramakrishnan and Russell Sears. 2010. Benchmarking Cloud Serving Systems with YCSB. In SoCC. 143--154. https:\/\/doi.org\/10.1145\/1807128.1807152","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389711"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW49219.2020.00015"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389135"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350258"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","unstructured":"Alex Galakatos Michael Markovitch Carsten Binnig Rodrigo Fonseca and Tim Kraska. 2019. FITing-Tree: A Data-aware Index Structure. In SIGMOD. ACM 1189--1206. https:\/\/doi.org\/10.1145\/3299869.3319860","DOI":"10.1145\/3299869.3319860"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2656332"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702402354"},{"key":"e_1_3_2_2_25_1","volume-title":"BlowFish: Dynamic Storage-Performance Tradeoff in Data Stores","author":"Khandelwal Anurag","unstructured":"Anurag Khandelwal, Rachit Agarwal, and Ion Stoica. 2016. BlowFish: Dynamic Storage-Performance Tradeoff in Data Stores. In NSDI. USENIX Association, 485--500."},{"key":"e_1_3_2_2_26_1","volume-title":"SOSD: A Benchmark for Learned Indexes. NeurIPS Workshop on Machine Learning for Systems (Dec. 2019","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 (Dec. 2019). http:\/\/arxiv.org\/abs\/1911.13014"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Andreas Kipf Ryan Marcus Alexander van Renen Mihail Stoian Alfons Kemper Tim Kraska and Thomas Neumann. 2020. RadixSpline: A Single-Pass Learned Index. In aiDM. 1--5.","DOI":"10.1145\/3401071.3401659"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882925"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00026"},{"key":"e_1_3_2_2_31_1","first-page":"38","article-title":"The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases","volume":"13","author":"Leis Viktor","year":"2013","unstructured":"Viktor Leis, Alfons Kemper, and Thomas Neumann. 2013. The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases. In ICDE, Vol. 13. 38--49.","journal-title":"ICDE"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Viktor Leis Florian Scheibner Alfons Kemper and Thomas Neumann. 2016. The ART of Practical Synchronization. In DaMoN. 1--8.","DOI":"10.1145\/2933349.2933352"},{"key":"e_1_3_2_2_33_1","volume-title":"Identifying Hot and Cold Data in Main-Memory Databases","author":"Levandoski Justin J","unstructured":"Justin J Levandoski, Per-\u00c5ke Larson, and Radu Stoica. 2013. Identifying Hot and Cold Data in Main-Memory Databases. In ICDE. IEEE, 26--37."},{"key":"e_1_3_2_2_34_1","unstructured":"Xiaozhou Li David G Andersen Michael Kaminsky and Michael J Freedman. 2014. Algorithmic Improvements for Fast Concurrent Cuckoo Hashing. In EuroSys. 1--14."},{"key":"e_1_3_2_2_35_1","unstructured":"Yandong Mao Eddie Kohler and Robert Tappan Morris. 2012. Cache Craftiness for Fast Multicore Key-Value Storage. In EuroSys. 183--196."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3421424.3421425"},{"key":"e_1_3_2_2_37_1","volume-title":"Efficient Computation of Frequent and Top-k Elements in Data Streams","author":"Metwally Ahmed","unstructured":"Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi. 2005. Efficient Computation of Frequent and Top-k Elements in Data Streams. In ICDT. Springer, 398--412."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Kyriakos Mouratidis Spiridon Bakiras and Dimitris Papadias. 2006. Continuous Monitoring of Top-k Queries over Sliding Windows. In SIGMOD. 635--646.","DOI":"10.1145\/1142473.1142544"},{"key":"e_1_3_2_2_39_1","volume-title":"Compact Data Structures - A Practical Approach","author":"Navarro Gonzalo","unstructured":"Gonzalo Navarro. 2016. Compact Data Structures - A Practical Approach. Cambridge University Press."},{"key":"e_1_3_2_2_40_1","volume-title":"Umbra: A Disk-Based System with In-Memory Performance. In CIDR.","author":"Neumann Thomas","year":"2020","unstructured":"Thomas Neumann and Michael J Freitag. 2020. Umbra: A Disk-Based System with In-Memory Performance. In CIDR."},{"key":"e_1_3_2_2_41_1","volume-title":"et al","author":"Pavlo Andrew","year":"2017","unstructured":"Andrew Pavlo, Gustavo Angulo, Joy Arulraj, Haibin Lin, Jiexi Lin, Lin Ma, Prashanth Menon, Todd C Mowry, Matthew Perron, Ian Quah, et al . 2017. Self- Driving Database Management Systems. In CIDR."},{"key":"e_1_3_2_2_42_1","volume-title":"Carlo Curino, and Stanley Zdonik","author":"Pavlo Andrew","year":"2012","unstructured":"Andrew Pavlo, Carlo Curino, and Stanley Zdonik. 2012. Skew-Aware Automatic Database Partitioning in Shared-Nothing, Parallel OLTP Systems. In SIGMOD. 61--72."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0185-7"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290680"},{"key":"e_1_3_2_2_45_1","volume-title":"Flow-Join: Adaptive Skew Handling for Distributed Joins over High-Speed Networks","author":"R\u00f6diger Wolf","unstructured":"Wolf R\u00f6diger, Sam Idicula, Alfons Kemper, and Thomas Neumann. 2016. Flow-Join: Adaptive Skew Handling for Distributed Joins over High-Speed Networks. In ICDE. IEEE, 1194--1205."},{"key":"e_1_3_2_2_46_1","volume-title":"Bounding the Last Mile: Efficient Learned String Indexing. 3rd International Workshop on Applied AI for Database Systems and Applications","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. 3rd International Workshop on Applied AI for Database Systems and Applications (2021)."},{"key":"e_1_3_2_2_47_1","volume-title":"PLEX: Towards Practical Learned Indexing. 3rd International Workshop on Applied AI for Database Systems and Applications","author":"Stoian Mihail","year":"2021","unstructured":"Mihail Stoian, Andreas Kipf, Ryan Marcus, and Tim Kraska. 2021. PLEX: Towards Practical Learned Indexing. 3rd International Workshop on Applied AI for Database Systems and Applications (2021)."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.50912"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","unstructured":"Ziqi Wang Andrew Pavlo Hyeontaek Lim Viktor Leis Huanchen Zhang Michael Kaminsky and David G Andersen. 2018. Building a Bw-Tree Takes More Than Just Buzz Words. In SIGMOD. 473--488.","DOI":"10.1145\/3183713.3196895"},{"key":"e_1_3_2_2_51_1","first-page":"1276","article-title":"Updatable Learned Index with Precise Positions","volume":"14","author":"Wu Jiacheng","year":"2021","unstructured":"Jiacheng Wu, Yong Zhang, Shimin Chen, Jin Wang, Yu Chen, and Chunxiao Xing. 2021. Updatable Learned Index with Precise Positions. VLDB 14, 8 (2021), 1276--1288.","journal-title":"VLDB"},{"key":"e_1_3_2_2_52_1","unstructured":"Qiumin Xu Huzefa Siyamwala Mrinmoy Ghosh Tameesh Suri Manu Awasthi Zvika Guz Anahita Shayesteh and Vijay Balakrishnan. 2015. Performance Analysis of NVMe SSDs and their Implication on Real World Databases. In SYSTOR. 1--11."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"crossref","unstructured":"Huanchen Zhang David G Andersen Andrew Pavlo Michael Kaminsky Lin Ma and Rui Shen. 2016. Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes. In SIGMOD. ACM 1567--1581.","DOI":"10.1145\/2882903.2915222"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2427795"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"crossref","unstructured":"Huanchen Zhang Hyeontaek Lim Viktor Leis David G Andersen Michael Kaminsky Kimberly Keeton and Andrew Pavlo. 2018. SuRF: Practical Range Query Filtering with Fast Succinct Tries. In SIGMOD. 323--336.","DOI":"10.1145\/3183713.3196931"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"crossref","unstructured":"Huanchen Zhang Xiaoxuan Liu David G Andersen Michael Kaminsky Kimberly Keeton and Andrew Pavlo. 2020. Order-Preserving Key Compression for In-Memory Search Trees. In SIGMOD. 1601--1615.","DOI":"10.1145\/3318464.3380583"}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2022 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3526121","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3514221.3526121","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T14:10:07Z","timestamp":1750169407000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3526121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":56,"alternative-id":["10.1145\/3514221.3526121","10.1145\/3514221"],"URL":"https:\/\/doi.org\/10.1145\/3514221.3526121","relation":{},"subject":[],"published":{"date-parts":[[2022,6,10]]},"assertion":[{"value":"2022-06-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}