{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T14:40:20Z","timestamp":1756478420026,"version":"3.44.0"},"reference-count":76,"publisher":"Association for Computing Machinery (ACM)","issue":"6","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2025,2]]},"abstract":"<jats:p>\n            B\n            <jats:sup>+<\/jats:sup>\n            -trees are prevalent in traditional database systems due to their versatility and balanced structure. While binary search is typically utilized for branch operations, it may lead to inefficient cache utilization in main-memory scenarios. In contrast, trie-based index structures drive branch operations through prefix matching. While these structures generally produce fewer cache misses and are thus increasingly popular, they may underperform in range scans because of frequent pointer chasing.\n          <\/jats:p>\n          <jats:p>\n            This paper proposes a new high-performance B\n            <jats:sup>+<\/jats:sup>\n            -tree variant called\n            <jats:bold>\n              Feature B\n              <jats:sup>+<\/jats:sup>\n              -tree (FB\n              <jats:sup>+<\/jats:sup>\n              -tree\n            <\/jats:bold>\n            ). Similar to employing bit or byte for branch operation in tries, FB\n            <jats:sup>+<\/jats:sup>\n            -tree progressively considers several bytes following the common prefix on each level of its inner nodes\u2014referred to as features, which allows FB\n            <jats:sup>+<\/jats:sup>\n            -tree to benefit from prefix skewness. FB\n            <jats:sup>+<\/jats:sup>\n            -tree blurs the lines between B\n            <jats:sup>+<\/jats:sup>\n            -trees and tries, while still retaining balance. In the best case, FB\n            <jats:sup>+<\/jats:sup>\n            -tree almost becomes a trie, whereas in the worst case, it continues to function as a B\n            <jats:sup>+<\/jats:sup>\n            -tree. Meanwhile, a crafted synchronization protocol that combines the link technique and optimistic lock is designed to support efficient concurrent index access. Distinctively, FB\n            <jats:sup>+<\/jats:sup>\n            -tree leverages subtle atomic operations seamlessly coordinated with optimistic lock to facilitate latch-free updates, which can be easily extended to other structures. Intensive experiments on multiple workload-dataset combinations demonstrate that FB\n            <jats:sup>+<\/jats:sup>\n            -tree shows comparable lookup performance to state-of-the-art trie-based indexes and outperforms popular B\n            <jats:sup>+<\/jats:sup>\n            -trees by 2.3x ~ 3.7x under 96 threads. FB\n            <jats:sup>+<\/jats:sup>\n            -tree also exhibits significant potential on other workloads, especially update workloads under contention and scan workloads.\n          <\/jats:p>","DOI":"10.14778\/3725688.3725691","type":"journal-article","created":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T14:19:21Z","timestamp":1756477161000},"page":"1579-1592","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["FB\n            <sup>+<\/sup>\n            -Tree: A Memory-Optimized B\n            <sup>+<\/sup>\n            -Tree with Latch-Free Update"],"prefix":"10.14778","volume":"18","author":[{"given":"Yuan","family":"Chen","sequence":"first","affiliation":[{"name":"School of Computer Science, Wuhan University"}]},{"given":"Ao","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science, Wuhan University"}]},{"given":"Wenhai","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science, Wuhan University"}]},{"given":"Lingfeng","family":"Deng","sequence":"additional","affiliation":[{"name":"School of Computer Science, Wuhan University"}]}],"member":"320","published-online":{"date-parts":[[2025,8,29]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"ACSC (CRPIT)","volume":"62","author":"Askitis Nikolas","year":"2007","unstructured":"Nikolas Askitis and Ranjan Sinha. 2007. HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings. In ACSC (CRPIT), Vol. 62. Australian Computer Society, 97\u2013105."},{"key":"e_1_2_1_2_1","volume-title":"Ives","author":"Auer S\u00f6ren","year":"2007","unstructured":"S\u00f6ren Auer, Christian Bizer, Georgi Kobilarov, Jens Lehmann, Richard Cyganiak, and Zachary G. Ives. 2007. DBpedia: A Nucleus for a Web of Open Data. In ISWC\/ASWC (Lecture Notes in Computer Science), Vol. 4825. Springer, 722\u2013735."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00263762"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/320521.320530"},{"key":"e_1_2_1_5_1","article-title":"B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys","volume":"41","author":"Bender Michael A.","year":"2016","unstructured":"Michael A. Bender, Roozbeh Ebrahimi, Haodong Hu, and Bradley C. Kuszmaul. 2016. B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys. ACM Trans. Database Syst. 41, 3 (2016), 19:1\u201319:33.","journal-title":"ACM Trans. Database Syst."},{"key":"e_1_2_1_6_1","volume-title":"Kuszmaul","author":"Bender Michael A.","year":"2006","unstructured":"Michael A. Bender, Martin Farach-Colton, and Bradley C. Kuszmaul. 2006. Cache-oblivious string B-trees. In PODS. ACM, 233\u2013242."},{"key":"e_1_2_1_7_1","volume-title":"Kuszmaul","author":"Bender Michael A.","year":"2005","unstructured":"Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, and Bradley C. Kuszmaul. 2005. Concurrent cache-oblivious b-trees. In SPAA. ACM, 228\u2013237."},{"key":"e_1_2_1_8_1","volume-title":"Kuszmaul","author":"Bender Michael A.","year":"2010","unstructured":"Michael A. Bender, Haodong Hu, and Bradley C. Kuszmaul. 2010. Performance guarantees for B-trees with different-sized atomic keys. In PODS. ACM, 305\u2013316."},{"key":"e_1_2_1_9_1","volume-title":"TLX: Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers. https:\/\/panthema.net\/tlx, retrieved","author":"Bingmann Timo","year":"2018","unstructured":"Timo Bingmann. 2018. TLX: Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers. https:\/\/panthema.net\/tlx, retrieved Oct. 7, 2020."},{"key":"e_1_2_1_10_1","volume-title":"HOT: A Height Optimized Trie Index for Main-Memory Database Systems. In SIGMOD Conference. ACM, 521\u2013534","author":"Binna Robert","year":"2018","unstructured":"Robert Binna, Eva Zangerle, Martin Pichl, G\u00fcnther Specht, and Viktor Leis. 2018. HOT: A Height Optimized Trie Index for Main-Memory Database Systems. In SIGMOD Conference. ACM, 521\u2013534."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3506692"},{"key":"e_1_2_1_12_1","volume-title":"Main-Memory Index Structures with Fixed-Size Partial Keys. In SIGMOD Conference. ACM, 163\u2013174","author":"Bohannon Philip","year":"2001","unstructured":"Philip Bohannon, Peter McIlroy, and Rajeev Rastogi. 2001. Main-Memory Index Structures with Fixed-Size Partial Keys. In SIGMOD Conference. ACM, 163\u2013174."},{"key":"e_1_2_1_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 (LNI), Vol. P-180. GI, 227\u2013246."},{"key":"e_1_2_1_14_1","unstructured":"Sang Kyun Cha Sangyong Hwang Kihong Kim and Keunjoo Kwon. 2001. Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems. In VLDB. Morgan Kaufmann 181\u2013190."},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Ciprian Chelba Tom\u00e1s Mikolov Mike Schuster Qi Ge Thorsten Brants Phillipp Koehn and Tony Robinson. 2014. One billion word benchmark for measuring progress in statistical language modeling. In INTERSPEECH. ISCA 2635\u20132639.","DOI":"10.21437\/Interspeech.2014-564"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3659437.3659447"},{"key":"e_1_2_1_17_1","volume-title":"SIGMOD Conference. ACM, 235\u2013246","author":"Chen Shimin","unstructured":"Shimin Chen, Phillip B. Gibbons, and Todd C. Mowry. 2001. Improving Index Performance through Prefetching. In SIGMOD Conference. ACM, 235\u2013246."},{"key":"e_1_2_1_18_1","volume-title":"SIGMOD Conference. ACM, 157\u2013168","author":"Chen Shimin","year":"2002","unstructured":"Shimin Chen, Phillip B. Gibbons, Todd C. Mowry, and Gary Valentin. 2002. Fractal prefetching B\u00b1Trees: optimizing both cache and disk performance. In SIGMOD Conference. ACM, 157\u2013168."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Brian F. Cooper Adam Silberstein Erwin Tam Raghu Ramakrishnan and Russell Sears. 2010. Benchmarking cloud serving systems with YCSB. In SoCC. ACM 143\u2013154.","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_1_21_1","unstructured":"Intel Corporation. 2023. Intel\u00ae 64 and IA-32 Architectures Optimization Reference Manual. https:\/\/cdrdv2.intel.com\/v1\/dl\/getContent\/779559?fileName=355308-Software-Optimization-Manual-048-Changes-Doc-2.pdf"},{"key":"e_1_2_1_22_1","unstructured":"Intel Corporation. 2023. Intel\u00ae 64 and IA-32 Architectures Software Developer's Manual. https:\/\/cdrdv2.intel.com\/v1\/dl\/getContent\/789583?fileName=325462-sdm-vol-1-2abcd-3abcd-4.pdf"},{"key":"e_1_2_1_23_1","volume-title":"ALEX: An Updatable Adaptive Learned Index. In SIGMOD Conference. ACM, 969\u2013984","author":"Ding Jialin","year":"2020","unstructured":"Jialin Ding, Umar Farooq Minhas, Jia Yu, Chi Wang, Jaeyoung Do, Yinan Li, Hantian Zhang, Badrish Chandramouli, Johannes Gehrke, Donald Kossmann, David B. Lomet, and Tim Kraska. 2020. ALEX: An Updatable Adaptive Learned Index. In SIGMOD Conference. ACM, 969\u2013984."},{"key":"e_1_2_1_24_1","volume-title":"Conf. Computing Frontiers. ACM, 13\u201322","author":"Dreslinski Ronald G.","unstructured":"Ronald G. Dreslinski, Ali G. Saidi, Trevor N. Mudge, and Steven K. Reinhardt. 2007. Analysis of hardware prefetching across virtual page boundaries. In Conf. Computing Frontiers. ACM, 13\u201322."},{"key":"e_1_2_1_25_1","volume-title":"Wenisch","author":"Falsafi Babak","year":"2014","unstructured":"Babak Falsafi and Thomas F. Wenisch. 2014. A Primer on Hardware Prefetching. Morgan & Claypool Publishers."},{"key":"e_1_2_1_26_1","article-title":"Foster b-trees","volume":"37","author":"Graefe Goetz","year":"2012","unstructured":"Goetz Graefe, Hideaki Kimura, and Harumi A. Kuno. 2012. Foster b-trees. ACM Trans. Database Syst. 37, 3 (2012), 17:1\u201317:29.","journal-title":"ACM Trans. Database Syst."},{"key":"e_1_2_1_27_1","volume-title":"B-Tree Indexes and CPU Caches","author":"Graefe Goetz","unstructured":"Goetz Graefe and Per-\u00c5ke Larson. 2001. B-Tree Indexes and CPU Caches. In ICDE. IEEE Computer Society, 349\u2013358."},{"key":"e_1_2_1_28_1","first-page":"1","article-title":"Optimistic concurrency with OPTIK","volume":"18","author":"Guerraoui Rachid","year":"2016","unstructured":"Rachid Guerraoui and Vasileios Trigonakis. 2016. Optimistic concurrency with OPTIK. In PPoPP. ACM, 18:1\u201318:12.","journal-title":"PPoPP. ACM"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/506309.506312"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855591.1855600"},{"key":"e_1_2_1_31_1","volume-title":"HyPer: A hybrid OLTP&OLAP main memory database system based on virtual memory snapshots","author":"Kemper Alfons","unstructured":"Alfons Kemper and Thomas Neumann. 2011. HyPer: A hybrid OLTP&OLAP main memory database system based on virtual memory snapshots. In ICDE. IEEE Computer Society, 195\u2013206."},{"key":"e_1_2_1_32_1","volume-title":"SIGMOD Conference. ACM, 339\u2013350","author":"Kim Changkyu","year":"2010","unstructured":"Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eric Sedlar, Anthony D. Nguyen, Tim Kaldewey, Victor W. Lee, Scott A. Brandt, and Pradeep Dubey. 2010. FAST: fast architecture sensitive tree search on modern CPUs and GPUs. In SIGMOD Conference. ACM, 339\u2013350."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3659437.3659439"},{"key":"e_1_2_1_34_1","first-page":"1","article-title":"RadixSpline: a single-pass learned index. In aiDM@SIGMOD","volume":"5","author":"Kipf Andreas","year":"2020","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@SIGMOD. ACM, 5:1\u20135:5.","journal-title":"ACM"},{"key":"e_1_2_1_35_1","volume-title":"Meet the walkers: accelerating index traversals for in-memory databases. In MICRO. ACM, 468\u2013479","author":"Ko\u00e7berber Yusuf Onur","year":"2013","unstructured":"Yusuf Onur Ko\u00e7berber, Boris Grot, Javier Picorel, Babak Falsafi, Kevin T. Lim, and Parthasarathy Ranganathan. 2013. Meet the walkers: accelerating index traversals for in-memory databases. In MICRO. ACM, 468\u2013479."},{"key":"e_1_2_1_36_1","volume-title":"The Case for Learned Index Structures. In SIGMOD Conference. ACM, 489\u2013504","author":"Kraska Tim","year":"2018","unstructured":"Tim Kraska, Alex Beutel, Ed H. Chi, Jeffrey Dean, and Neoklis Polyzotis. 2018. The Case for Learned Index Structures. In SIGMOD Conference. ACM, 489\u2013504."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2023.102287"},{"key":"e_1_2_1_38_1","volume-title":"Shasha","author":"Lanin Vladimir","year":"1986","unstructured":"Vladimir Lanin and Dennis E. Shasha. 1986. A Symmetric Concurrent B-Tree Algorithm. In FJCC. IEEE Computer Society, 380\u2013389."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2133382.2133384"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/319628.319663"},{"key":"e_1_2_1_41_1","volume-title":"Carey","author":"Lehman Tobin J.","year":"1986","unstructured":"Tobin J. Lehman and Michael J. Carey. 1986. A Study of Index Structures for Main Memory Database Management Systems. In VLDB. Morgan Kaufmann, 294\u2013303."},{"key":"e_1_2_1_42_1","first-page":"73","article-title":"Optimistic Lock Coupling: A Scalable and Efficient General-Purpose Synchronization Method","volume":"42","author":"Leis Viktor","year":"2019","unstructured":"Viktor Leis, Michael Haubenschild, and Thomas Neumann. 2019. Optimistic Lock Coupling: A Scalable and Efficient General-Purpose Synchronization Method. IEEE Data Eng. Bull. 42, 1 (2019), 73\u201384.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_1_43_1","volume-title":"The adaptive radix tree: ARTful indexing for main-memory databases","author":"Leis Viktor","unstructured":"Viktor Leis, Alfons Kemper, and Thomas Neumann. 2013. The adaptive radix tree: ARTful indexing for main-memory databases. In ICDE. IEEE Computer Society, 38\u201349."},{"key":"e_1_2_1_44_1","first-page":"1","article-title":"The ART of practical synchronization","volume":"3","author":"Leis Viktor","year":"2016","unstructured":"Viktor Leis, Florian Scheibner, Alfons Kemper, and Thomas Neumann. 2016. The ART of practical synchronization. In DaMoN. ACM, 3:1\u20133:8.","journal-title":"DaMoN. ACM"},{"key":"e_1_2_1_45_1","volume-title":"The Bw-Tree: A B-tree for new hardware platforms","author":"Levandoski Justin J.","unstructured":"Justin J. Levandoski, David B. Lomet, and Sudipta Sengupta. 2013. The Bw-Tree: A B-tree for new hardware platforms. In ICDE. IEEE Computer Society, 302\u2013313."},{"key":"e_1_2_1_46_1","volume-title":"SIGMOD Conference. ACM, 2859\u20132866","author":"Li Guoliang","year":"2021","unstructured":"Guoliang Li, Xuanhe Zhou, and Lei Cao. 2021. AI Meets Database: AI4DB and DB4AI. In SIGMOD Conference. ACM, 2859\u20132866."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384355"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/3494124.3494141"},{"key":"e_1_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Yandong Mao Eddie Kohler and Robert Tappan Morris. 2012. Cache craftiness for fast multicore key-value storage. In EuroSys. ACM 183\u2013196.","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/103727.103729"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/321479.321481"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01354877"},{"key":"e_1_2_1_53_1","volume-title":"FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory. In SIGMOD Conference. ACM, 371\u2013386","author":"Oukid Ismail","year":"2016","unstructured":"Ismail Oukid, Johan Lasperas, Anisoara Nica, Thomas Willhalm, and Wolfgang Lehner. 2016. FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory. In SIGMOD Conference. ACM, 371\u2013386."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"e_1_2_1_55_1","volume-title":"Ross","author":"Rao Jun","year":"1999","unstructured":"Jun Rao and Kenneth A. Ross. 1999. Cache Conscious Indexing for Decision-Support in Main Memory. In VLDB. Morgan Kaufmann, 78\u201389."},{"key":"e_1_2_1_56_1","volume-title":"SIGMOD Conference. ACM, 475\u2013486","author":"Rao Jun","unstructured":"Jun Rao and Kenneth A. Ross. 2000. Making B+ -Trees Cache Conscious in Main Memory. In SIGMOD Conference. ACM, 475\u2013486."},{"key":"e_1_2_1_57_1","volume-title":"Programming Persistent Memory: A Comprehensive Guide for Developers","author":"Scargall Steve","unstructured":"Steve Scargall. 2020. Programming Persistent Memory: A Comprehensive Guide for Developers. Springer Nature."},{"key":"e_1_2_1_58_1","doi-asserted-by":"crossref","unstructured":"Benjamin Schlegel Rainer Gemulla and Wolfgang Lehner. 2009. k-ary search on modern processors. In DaMoN. ACM 52\u201360.","DOI":"10.1145\/1565694.1565705"},{"key":"e_1_2_1_59_1","volume-title":"BTW (LNI)","author":"Schmei\u00dfer Josef","unstructured":"Josef Schmei\u00dfer, Maximilian E. Sch\u00fcle, Viktor Leis, Thomas Neumann, and Alfons Kemper. 2021. B2-Tree: Cache-Friendly String Indexing within B-Trees. In BTW (LNI), Vol. P-311. Gesellschaft f\u00fcr Informatik, Bonn, 39\u201358."},{"key":"e_1_2_1_60_1","doi-asserted-by":"crossref","first-page":"795","DOI":"10.14778\/3402707.3402719","article-title":"PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors","volume":"4","author":"Sewall Jason","year":"2011","unstructured":"Jason Sewall, Jatin Chhugani, Changkyu Kim, Nadathur Satish, and Pradeep Dubey. 2011. PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors. Proc. VLDB Endow. 4, 11 (2011), 795\u2013806.","journal-title":"Proc. VLDB Endow."},{"key":"e_1_2_1_61_1","volume-title":"SIGMOD Conference. ACM, 1523\u20131538","author":"Shahvarani Amirhesam","year":"2016","unstructured":"Amirhesam Shahvarani and Hans-Arno Jacobsen. 2016. A Hybrid B+-tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms. In SIGMOD Conference. ACM, 1523\u20131538."},{"key":"e_1_2_1_62_1","volume-title":"Occualizer: Optimistic Concurrent Search Trees From Sequential Code","author":"Shanny Tomer","year":"2022","unstructured":"Tomer Shanny and Adam Morrison. 2022. Occualizer: Optimistic Concurrent Search Trees From Sequential Code. In OSDI. USENIX Association, 321\u2013337."},{"key":"e_1_2_1_63_1","first-page":"3","volume-title":"Proc. ACM Manag. Data 1","author":"Shi Ge","year":"2023","unstructured":"Ge Shi, Ziyi Yan, and Tianzheng Wang. 2023. OptiQL: Robust Optimistic Locking for Memory-Optimized Indexes. Proc. ACM Manag. Data 1, 3 (2023), 216:1\u2013216:26."},{"key":"e_1_2_1_64_1","volume-title":"Umar Farooq Minhas, and Tim Kraska","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. CoRR abs\/2111.14905 (2021)."},{"key":"e_1_2_1_65_1","doi-asserted-by":"crossref","unstructured":"Stephen Tu Wenting Zheng Eddie Kohler Barbara Liskov and Samuel Madden. 2013. Speedy transactions in multicore in-memory databases. In SOSP. ACM 18\u201332.","DOI":"10.1145\/2517349.2522713"},{"key":"e_1_2_1_66_1","volume-title":"Weems","author":"Wang Zhenlin","year":"2003","unstructured":"Zhenlin Wang, Doug Burger, Steven K. Reinhardt, Kathryn S. McKinley, and Charles C. Weems. 2003. Guided Region Prefetching: A Cooperative Hardware\/Software Approach. In ISCA. IEEE Computer Society, 388\u2013398."},{"key":"e_1_2_1_67_1","volume-title":"SIGMOD Conference. ACM, 473\u2013488","author":"Wang Ziqi","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 Conference. ACM, 473\u2013488."},{"key":"e_1_2_1_68_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. ACM, 18:1\u201318:16.","journal-title":"A Fast Ordered Index for In-memory Data Management. In EuroSys. ACM"},{"key":"e_1_2_1_69_1","unstructured":"Juncheng Yang Yao Yue and K. V. Rashmi. 2020. A large scale analysis of hundreds of in-memory cache clusters at Twitter. In OSDI. USENIX Association 191\u2013208."},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.14778\/3681954.3682010"},{"key":"e_1_2_1_71_1","volume-title":"Cuckoo Trie: Exploiting Memory-Level Parallelism for Efficient DRAM Indexing. In SOSP. ACM, 147\u2013162.","author":"Zeitak Adar","year":"2021","unstructured":"Adar Zeitak and Adam Morrison. 2021. Cuckoo Trie: Exploiting Memory-Level Parallelism for Efficient DRAM Indexing. In SOSP. ACM, 147\u2013162."},{"key":"e_1_2_1_72_1","volume-title":"Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes. In SIGMOD Conference. ACM, 1567\u20131581","author":"Zhang Huanchen","year":"2016","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 Conference. ACM, 1567\u20131581."},{"key":"e_1_2_1_73_1","first-page":"151","article-title":"Making In-Memory Learned Indexes Efficient on Disk","volume":"2","author":"Zhang Jiaoyi","year":"2024","unstructured":"Jiaoyi Zhang, Kai Su, and Huanchen Zhang. 2024. Making In-Memory Learned Indexes Efficient on Disk. Proc. ACM Manag. Data 2, 3 (2024), 151.","journal-title":"Proc. ACM Manag. Data"},{"key":"e_1_2_1_74_1","first-page":"145","article-title":"Hyper: A High-Performance and Memory-Efficient Learned Index via Hybrid Construction","volume":"2","author":"Zhang Shunkang","year":"2024","unstructured":"Shunkang Zhang, Ji Qi, Xin Yao, and Andr\u00e9 Brinkmann. 2024. Hyper: A High-Performance and Memory-Efficient Learned Index via Hybrid Construction. Proc. ACM Manag. Data 2, 3 (2024), 145.","journal-title":"Proc. ACM Manag. Data"},{"key":"e_1_2_1_75_1","doi-asserted-by":"crossref","unstructured":"Weihua Zhang Chuanlei Zhao Lu Peng Yuzhe Lin Fengzhe Zhang and Yunping Lu. 2023. Boosting Performance and QoS for Concurrent GPU B+trees by Combining-Based Synchronization. In PPoPP. ACM 1\u201313.","DOI":"10.1145\/3572848.3577474"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.14778\/3641204.3641209"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3725688.3725691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T14:19:50Z","timestamp":1756477190000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3725688.3725691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":76,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["10.14778\/3725688.3725691"],"URL":"https:\/\/doi.org\/10.14778\/3725688.3725691","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2025,2]]},"assertion":[{"value":"2025-08-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}