{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T12:10:08Z","timestamp":1750421408774,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T00:00:00Z","timestamp":1782086400000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1910216"],"award-info":[{"award-number":["IIS-1910216"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,23]]},"DOI":"10.1145\/3733723.3733732","type":"proceedings-article","created":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T08:49:08Z","timestamp":1750409348000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Adaptive Index for Oscillating Write-Heavy and Read-Heavy Workloads"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-4369-4440","authenticated-orcid":false,"given":"Lu","family":"Xing","sequence":"first","affiliation":[{"name":"Computer Science, Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5938-5879","authenticated-orcid":false,"given":"Ruihong","family":"Wang","sequence":"additional","affiliation":[{"name":"Computer Science, Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8169-7775","authenticated-orcid":false,"given":"Walid G.","family":"Aref","sequence":"additional","affiliation":[{"name":"Computer Science, Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,22]]},"reference":[{"key":"e_1_3_3_1_2_2","volume-title":"ETL","unstructured":"[n.d.]. ETL. https:\/\/www.snowflake.com\/guides\/etl-pipeline\/"},{"key":"e_1_3_3_1_3_2","volume-title":"LevelDB","unstructured":"[n.d.]. LevelDB. https:\/\/github.com\/google\/leveldb"},{"key":"e_1_3_3_1_4_2","volume-title":"RocksDB","unstructured":"[n.d.]. RocksDB. https:\/\/github.com\/facebook\/rocksdb"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3605573.3605576"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526121"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"crossref","unstructured":"Lars Arge. 2003. The buffer tree: A technique for designing batched external data structures. Algorithmica 37 (2003) 1\u201324.","DOI":"10.1007\/s00453-003-1021-x"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","unstructured":"Joy Arulraj Justin Levandoski Umar\u00a0Farooq Minhas and Per-Ake Larson. 2018. Bztree: a high-performance latch-free range index for non-volatile memory. Proc. VLDB Endow. 11 5 (Oct. 2018) 553\u2013565. 10.1145\/3164135.3164147","DOI":"10.1145\/3164135.3164147"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"crossref","unstructured":"Berk Atikoglu Yuehai Xu Eitan Frachtenberg Song Jiang and Mike Paleczny. 2012. Workload analysis of a large-scale key-value store. SIGMETRICS Perform. Eval. Rev. 53\u201364.","DOI":"10.1145\/2254756.2254766"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1734663.1734671"},{"key":"e_1_3_3_1_11_2","unstructured":"Michael\u00a0A Bender Martin Farach-Colton William Jannen Rob Johnson Bradley\u00a0C Kuszmaul Donald\u00a0E Porter Jun Yuan and Yang Zhan. 2015. An introduction to B-trees and write-optimization. login; magazine 40 5 (2015)."},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"crossref","unstructured":"Burton\u00a0H Bloom. 1970. Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13 7 (1970) 422\u2013426.","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/3386691.3386712"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"crossref","unstructured":"Hokeun Cha Xiangpeng Hao Tianzheng Wang Huanchen Zhang Aditya Akella and Xiangyao Yu. 2023. Blink-hash: An adaptive hybrid index for in-memory time-series databases. Proc. of the VLDB Endow. 16 6 (2023) 1235\u20131248.","DOI":"10.14778\/3583140.3583143"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"crossref","unstructured":"Subarna Chatterjee Meena Jagadeesan Wilson Qin and Stratos Idreos. 2021. Cosine: a cloud-cost optimized self-designing key-value storage engine. Proc. VLDB Endow. 15 1 (Sept. 2021) 112\u2013126.","DOI":"10.14778\/3485450.3485461"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"crossref","unstructured":"Subarna Chatterjee Mark\u00a0F. Pekala Lev Kruglyak and Stratos Idreos. 2024. Limousine: Blending Learned and Classical Indexes to Self-Design Larger-than-Memory Cloud Storage Engines. Proc. ACM Manag. Data 2 1 Article 47 (2024).","DOI":"10.1145\/3639302"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"crossref","unstructured":"Bernard Chazelle and Leonidas\u00a0J Guibas. 1986. Fractional cascading: I. A data structuring technique. Algorithmica 1 1 (1986) 133\u2013162.","DOI":"10.1007\/BF01840440"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"crossref","unstructured":"Douglas Comer. 1979. Ubiquitous B-tree. ACM Computing Surveys (CSUR) 11 2 (1979) 121\u2013137.","DOI":"10.1145\/356770.356776"},{"key":"e_1_3_3_1_19_2","first-page":"49","volume-title":"2020 USENIX ATC","author":"Conway Alexander","year":"2020","unstructured":"Alexander Conway, Abhishek Gupta, Vijay Chidambaram, Martin Farach-Colton, Richard Spillane, Amy Tai, and Rob Johnson. 2020. { SplinterDB} : closing the bandwidth gap for { NVMe}{ Key-Value} stores. In 2020 USENIX ATC. 49\u201363."},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989357"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"crossref","unstructured":"Anas Daghistani Walid\u00a0G Aref Arif Ghafoor and Ahmed\u00a0R Mahmood. 2021. Swarm: Adaptive load balancing in distributed streaming systems for big spatial data. ACM Transactions on Spatial Algorithms and Systems 7 3 (2021) 1\u201343.","DOI":"10.1145\/3460013"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"crossref","unstructured":"Jiake Ge Huanchen Zhang Boyu Shi Yuanhui Luo Yunda Guo Yunpeng Chai Yuxing Chen and Anqun Pan. 2023. SALI: A Scalable Adaptive Learned Index Framework based on Probability Models. Proc. ACM Manag. of Data 1 4 (2023).","DOI":"10.1145\/3626752"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2007.4362193"},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316748"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"publisher","unstructured":"Felix Halim Stratos Idreos Panagiotis Karras and Roland H.\u00a0C. Yap. 2012. Stochastic database cracking: towards robust adaptive indexing in main-memory column-stores. Proc. VLDB Endow. 5 6 (Feb. 2012) 502\u2013513. 10.14778\/2168651.2168652","DOI":"10.14778\/2168651.2168652"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"publisher","unstructured":"Xiangpeng Hao and Badrish Chandramouli. 2024. Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index. Proc. VLDB Endow. 17 11 (Aug. 2024) 3442\u20133455. 10.14778\/3681954.3682012","DOI":"10.14778\/3681954.3682012"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"publisher","unstructured":"Pedro Holanda Mark Raasveldt Stefan Manegold and Hannes M\u00fchleisen. 2019. Progressive indexes: indexing for interactive data analysis. Proc. VLDB Endow. 12 13 (Sept. 2019) 2366\u20132378. 10.14778\/3358701.3358705","DOI":"10.14778\/3358701.3358705"},{"key":"e_1_3_3_1_28_2","volume-title":"CIDR","author":"Idreos Stratos","year":"2019","unstructured":"Stratos Idreos, Niv Dayan, Wilson Qin, Mali Akmanalp, Sophie Hilgard, Andrew Ross, James Lennon, Varun Jain, Harshita Gupta, David Li, et\u00a0al. 2019. Design Continuums and the Path Toward Self-Designing Key-Value Stores that Know and Learn.. In CIDR."},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247527"},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559878"},{"key":"e_1_3_3_1_31_2","first-page":"68","volume-title":"CIDR","author":"Idreos Stratos","year":"2007","unstructured":"Stratos Idreos, Martin\u00a0L Kersten, Stefan Manegold, et\u00a0al. 2007. Database Cracking.. In CIDR , Vol.\u00a07. 68\u201378."},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"crossref","unstructured":"Aarati Kakaraparthy Jignesh\u00a0M Patel Brian\u00a0P Kroth and Kwanghyun Park. 2022. VIP hashing: adapting to skew in popularity of data on the fly. Proc. of the VLDB Endowment 15 10 (2022) 1978\u20131990.","DOI":"10.14778\/3547305.3547306"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544834"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389731"},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00172"},{"key":"e_1_3_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196908"},{"key":"e_1_3_3_1_37_2","doi-asserted-by":"crossref","unstructured":"Kurt Mehlhorn and Stefan N\u00e4her. 1990. Dynamic fractional cascading. Algorithmica 5 1 (1990) 215\u2013241.","DOI":"10.1007\/BF01840386"},{"key":"e_1_3_3_1_38_2","doi-asserted-by":"crossref","unstructured":"Dingheng Mo Fanchao Chen Siqiang Luo and Caihua Shan. 2023. Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads. Proc. ACM Manag. Data 1 3 (Nov. 2023).","DOI":"10.1145\/3617333"},{"key":"e_1_3_3_1_39_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 33 (1996) 351\u2013385.","DOI":"10.1007\/s002360050048"},{"key":"e_1_3_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132765"},{"key":"e_1_3_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00097"},{"key":"e_1_3_3_1_42_2","doi-asserted-by":"publisher","unstructured":"Daniel\u00a0Dominic Sleator and Robert\u00a0Endre Tarjan. 1985. Self-adjusting binary search trees. J. ACM 32 3 (July 1985) 652\u2013686. 10.1145\/3828.3835","DOI":"10.1145\/3828.3835"},{"key":"e_1_3_3_1_43_2","doi-asserted-by":"publisher","unstructured":"Haitao Wang Zhanhuai Li Xiao Zhang Xiaonan Zhao and Song Jiang. 2021. WOBTree: a write-optimized B+-tree for non-volatile memory. Front. Comput. Sci. 15 5 (Oct. 2021) 15. 10.1007\/s11704-020-0228-1","DOI":"10.1007\/s11704-020-0228-1"},{"key":"e_1_3_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517824"},{"key":"e_1_3_3_1_45_2","unstructured":"Sepanta Zeighami. 2019. Nested b-tree: efficient indexing method for fast insertions with asymptotically optimal query time. Ph.D. Dissertation."},{"key":"e_1_3_3_1_46_2","doi-asserted-by":"crossref","unstructured":"Teng Zhang Jian Tan Xin Cai Jianying Wang Feifei Li and Jianling Sun. 2022. SA-LSM: optimize data layout for LSM-tree based storage using survival analysis. Proc. of the VLDB Endowment 15 10 (2022) 2161\u20132174.","DOI":"10.14778\/3547305.3547320"},{"key":"e_1_3_3_1_47_2","first-page":"51","volume-title":"19th USENIX Conference on File and Storage Technologies (FAST 21)","author":"Zhong Wenshao","year":"2021","unstructured":"Wenshao Zhong, Chen Chen, Xingbo Wu, and Song Jiang. 2021. { REMIX} : Efficient Range Query for { LSM-trees}. In 19th USENIX Conference on File and Storage Technologies (FAST 21). 51\u201364."}],"event":{"name":"SSDBM 2025: 37th International Conference on Scalable Scientific Data Management","location":"Columbus USA","acronym":"SSDBM 2025"},"container-title":["Proceedings of the 37th International Conference on Scalable Scientific Data Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3733723.3733732","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3733723.3733732","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T11:37:43Z","timestamp":1750419463000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3733723.3733732"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":46,"alternative-id":["10.1145\/3733723.3733732","10.1145\/3733723"],"URL":"https:\/\/doi.org\/10.1145\/3733723.3733732","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]},"assertion":[{"value":"2025-06-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}