{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:49:41Z","timestamp":1765039781670,"version":"3.44.0"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2025,8]]},"abstract":"<jats:p>\n            Modern large-scale services such as search engines, messaging platforms, and serverless functions, rely on key-value (KV) stores to maintain high performance at scale. When such services are deployed in constrained memory environments, they present challenging requirements: point operations requiring high throughput, working sets\n            <jats:italic toggle=\"yes\">much larger<\/jats:italic>\n            than main memory, and natural skew in key access patterns. Traditional KV stores, based on LSM- and B-Trees, have been widely used to handle such use cases, but they often suffer from suboptimal use of modern hardware resources. The FASTER project, developed as a high-performance open-source KV storage library, has demonstrated remarkable success in both inmemory and hybrid storage environments. However, when tasked with serving large skewed workloads, it faced challenges, including high indexing and compactions overheads, and inefficient management of non-overlapping read-hot and write-hot working sets.\n          <\/jats:p>\n          <jats:p>In this paper, we introduce F2 (for FASTER v2), an evolution of FASTER designed to meet the requirements of large skewed workloads common in industry applications. F2 adopts a two-tier record-oriented design to handle larger-than-memory skewed workloads, along with new concurrent latch-free mechanisms and components to maximize performance on modern hardware. To realize this design, F2 tackles key challenges and introduces several innovations, including new latch-free algorithms for multi-threaded log compaction, a two-level hash index to reduce indexing overhead for cold records, and a read-cache for serving read-hot records. Our evaluation shows that F2 achieves 2\u201311.9\u00d7 better throughput compared to existing KV stores, effectively serving the target workload. F2 is open-source and available as part of the FASTER project.<\/jats:p>","DOI":"10.14778\/3750601.3750615","type":"journal-article","created":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T13:38:05Z","timestamp":1758029885000},"page":"4910-4923","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["From FASTER to F2: Evolving Concurrent Key-Value Store Designs for Large Skewed Workloads"],"prefix":"10.14778","volume":"18","author":[{"given":"Konstantinos","family":"Kanellis","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Badrish","family":"Chandramouli","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ted","family":"Hart","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shivaram","family":"Venkataraman","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,9,16]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"281","volume-title":"BTW","author":"Alhomssi Adnan","year":"2023","unstructured":"Adnan Alhomssi, Michael Haubenschild, and Viktor Leis. The evolution of leanstore. In BTW 2023, pages 259\u2013281. Gesellschaft f\u00fcr Informatik eV, 2023."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687590"},{"key":"e_1_2_1_3_1","first-page":"64","volume-title":"Proceedings of the 12th ACM SIGMETRICS\/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS '12","author":"Atikoglu Berk","year":"2012","unstructured":"Berk Atikoglu, Yuehai Xu, Eitan Frachtenberg, Song Jiang, and Mike Paleczny. Workload analysis of a large-scale key-value store. In Proceedings of the 12th ACM SIGMETRICS\/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS '12, page 53\u201364, New York, NY, USA, 2012. Association for Computing Machinery."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/176575.176576"},{"key":"e_1_2_1_5_1","volume-title":"February","author":"Analytics Azure Stream","year":"2025","unstructured":"Azure Stream Analytics. https:\/\/azure.microsoft.com\/en-us\/products\/stream-analytics, February 2025."},{"issue":"8","key":"e_1_2_1_6_1","doi-asserted-by":"crossref","first-page":"1591","DOI":"10.14778\/3529337.3529344","article-title":"Efficient execution of serverless workflows","volume":"15","author":"Burckhardt Sebastian","year":"2022","unstructured":"Sebastian Burckhardt, Badrish Chandramouli, Chris Gillum, David Justo, Konstantinos Kallas, Connor McMahon, Christopher S Meiklejohn, and Xiangfeng Zhu. Netherite: Efficient execution of serverless workflows. Proceedings of the VLDB Endowment, 15(8):1591\u20131604, 2022.","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"2","key":"e_1_2_1_7_1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s00778-024-00898-1","article-title":"efficient execution of serverless workflows","volume":"34","author":"Burckhardt Sebastian","year":"2025","unstructured":"Sebastian Burckhardt, Badrish Chandramouli, Chris Gillum, David Justo, Konstantinos Kallas, Connor McMahon, Christopher S Meiklejohn, and Xiangfeng Zhu. Netherite: efficient execution of serverless workflows. The VLDB Journal, 34(2):25, 2025.","journal-title":"The VLDB Journal"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the ACM on Programming Languages, 5(OOPSLA):1\u201327","author":"Burckhardt Sebastian","year":"2021","unstructured":"Sebastian Burckhardt, Chris Gillum, David Justo, Konstantinos Kallas, Connor McMahon, and Christopher S Meiklejohn. Durable functions: Semantics for stateful serverless. Proceedings of the ACM on Programming Languages, 5(OOPSLA):1\u201327, 2021."},{"key":"e_1_2_1_9_1","volume-title":"18th USENIX Conference on File and Storage Technologies (FAST'20)","author":"Cao Zhichao","year":"2020","unstructured":"Zhichao Cao and Siying Dong. Characterizing, modeling, and benchmarking rocksdb key-value workloads at facebook. In 18th USENIX Conference on File and Storage Technologies (FAST'20), 2020."},{"key":"e_1_2_1_10_1","first-page":"101","volume-title":"Proceedings of the 2012 IEEE 28th International Conference on Data Engineering, ICDE '12","author":"Chandramouli Badrish","year":"2012","unstructured":"Badrish Chandramouli, Jonathan Goldstein, and Songyun Duan. Temporal analytics on big data for web advertising. In Proceedings of the 2012 IEEE 28th International Conference on Data Engineering, ICDE '12, page 90\u2013101, USA, 2012. IEEE Computer Society."},{"key":"e_1_2_1_11_1","first-page":"290","volume-title":"Proceedings of the 2018 International Conference on Management of Data","author":"Chandramouli Badrish","year":"2018","unstructured":"Badrish Chandramouli, Guna Prasaad, Donald Kossmann, Justin Levandoski, James Hunter, and Mike Barnett. FASTER: A concurrent key-value store with inplace updates. In Proceedings of the 2018 International Conference on Management of Data, pages 275\u2013290, 2018."},{"issue":"12","key":"e_1_2_1_12_1","doi-asserted-by":"crossref","first-page":"1930","DOI":"10.14778\/3229863.3236227","article-title":"an embedded concurrent key-value store for state management","volume":"11","author":"Chandramouli Badrish","year":"2018","unstructured":"Badrish Chandramouli, Guna Prasaad, Donald Kossmann, Justin Levandoski, James Hunter, and Mike Barnett. FASTER: an embedded concurrent key-value store for state management. Proceedings of the VLDB Endowment, 11(12):1930\u20131933, 2018.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_2_1_13_1","volume-title":"Bigtable: A distributed storage system for structured data. ACM Transactions on Computer Systems (TOCS), 26(2):1\u201326","author":"Chang Fay","year":"2008","unstructured":"Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C Hsieh, Deborah A Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, and Robert E Gruber. Bigtable: A distributed storage system for structured data. ACM Transactions on Computer Systems (TOCS), 26(2):1\u201326, 2008."},{"key":"e_1_2_1_14_1","volume-title":"October","author":"Control Group v2.","year":"2023","unstructured":"Control Group v2. https:\/\/docs.kernel.org\/admin-guide\/cgroup-v2.html, October 2023."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588726"},{"key":"e_1_2_1_16_1","first-page":"63","volume-title":"2020 USENIX Annual Technical Conference (USENIX ATC 20)","author":"Conway Alexander","unstructured":"Alexander Conway, Abhishek Gupta, Vijay Chidambaram, Martin Farach-Colton, Richard Spillane, Amy Tai, and Rob Johnson. SplinterDB: Closing the bandwidth gap for NVMe Key-Value stores. In 2020 USENIX Annual Technical Conference (USENIX ATC 20), pages 49\u201363. USENIX Association, July 2020."},{"key":"e_1_2_1_17_1","first-page":"154","volume-title":"Proceedings of the 1st ACM symposium on Cloud computing","author":"Cooper Brian F","year":"2010","unstructured":"Brian F Cooper, Adam Silberstein, Erwin Tam, Raghu Ramakrishnan, and Russell Sears. Benchmarking cloud serving systems with ycsb. In Proceedings of the 1st ACM symposium on Cloud computing, pages 143\u2013154, 2010."},{"key":"e_1_2_1_18_1","first-page":"94","volume-title":"Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD '17","author":"Dayan Niv","year":"2017","unstructured":"Niv Dayan, Manos Athanassoulis, and Stratos Idreos. Monkey: Optimal navigable key-value store. In Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD '17, page 79\u201394, New York, NY, USA, 2017. Association for Computing Machinery."},{"key":"e_1_2_1_19_1","first-page":"520","volume-title":"Proceedings of the 2018 International Conference on Management of Data, SIGMOD '18","author":"Dayan Niv","year":"2018","unstructured":"Niv Dayan and Stratos Idreos. Dostoevsky: Better space-time trade-offs for lsm-tree based key-value stores via adaptive removal of superfluous merging. In Proceedings of the 2018 International Conference on Management of Data, SIGMOD '18, page 505\u2013520, New York, NY, USA, 2018. Association for Computing Machinery."},{"key":"e_1_2_1_20_1","first-page":"378","volume-title":"Proceedings of the 2021 International Conference on Management of Data, SIGMOD '21","author":"Dayan Niv","year":"2021","unstructured":"Niv Dayan and Moshe Twitto. Chucky: A succinct cuckoo filter for lsm-tree. In Proceedings of the 2021 International Conference on Management of Data, SIGMOD '21, page 365\u2013378, New York, NY, USA, 2021. Association for Computing Machinery."},{"issue":"11","key":"e_1_2_1_21_1","doi-asserted-by":"crossref","first-page":"3071","DOI":"10.14778\/3551793.3551853","article-title":"granulating lsm-tree compactions correctly","volume":"15","author":"Dayan Niv","year":"2022","unstructured":"Niv Dayan, Tamar Weiss, Shmuel Dashevsky, Michael Pan, Edward Bortnikov, and Moshe Twitto. Spooky: granulating lsm-tree compactions correctly. Proc. VLDB Endow., 15(11):3071\u20133084, July 2022.","journal-title":"Proc. VLDB Endow."},{"key":"e_1_2_1_22_1","first-page":"36","volume-title":"Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, SIGMOD '11","author":"Debnath Biplob","year":"2011","unstructured":"Biplob Debnath, Sudipta Sengupta, and Jin Li. Skimpystash: Ram space skimpy key-value store on flash-based storage. In Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, SIGMOD '11, page 25\u201336, New York, NY, USA, 2011. Association for Computing Machinery."},{"issue":"14","key":"e_1_2_1_23_1","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.14778\/2556549.2556575","article-title":"A new approach to database management system architecture","volume":"6","author":"DeBrabant Justin","year":"2013","unstructured":"Justin DeBrabant, Andrew Pavlo, Stephen Tu, Michael Stonebraker, and Stan Zdonik. Anti-caching: A new approach to database management system architecture. Proceedings of the VLDB Endowment, 6(14):1942\u20131953, 2013.","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"4","key":"e_1_2_1_24_1","article-title":"Evolution of development priorities in a key-value store serving large-scale applications","volume":"17","author":"Dong Siying","year":"2021","unstructured":"Siying Dong, Andrew Kryczka, Yanqin Jin, and Michael Stumm. Rocksdb: Evolution of development priorities in a key-value store serving large-scale applications. ACM Trans. Storage, 17(4), October 2021.","journal-title":"ACM Trans. Storage"},{"key":"e_1_2_1_25_1","first-page":"14","volume-title":"Proceedings of the 2019 USENIX Conference on Usenix Annual Technical Conference, USENIX ATC '19","author":"Duplyakin Dmitry","year":"2019","unstructured":"Dmitry Duplyakin, Robert Ricci, Aleksander Maricq, Gary Wong, Jonathon Duerig, Eric Eide, Leigh Stoller, Mike Hibler, David Johnson, Kirk Webb, Aditya Akella, Kuangching Wang, Glenn Ricart, Larry Landweber, Chip Elliott, Michael Zink, Emmanuel Cecchet, Snigdhaswin Kar, and Prabodh Mishra. The design and operation of cloudlab. In Proceedings of the 2019 USENIX Conference on Usenix Annual Technical Conference, USENIX ATC '19, page 1\u201314, USA, 2019. USENIX Association."},{"key":"e_1_2_1_26_1","volume-title":"October","author":"FASTER","year":"2023","unstructured":"FASTER: Fast persistent recoverable log and key-value store + cache. https:\/\/github.com\/microsoft\/FASTER, October 2023."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3598581.3598584"},{"key":"e_1_2_1_28_1","volume-title":"Endure: a robust tuning paradigm for lsm trees under workload uncertainty. arXiv preprint arXiv:2110.13801","author":"Huynh Andy","year":"2021","unstructured":"Andy Huynh, Harshal A Chaudhari, Evimaria Terzi, and Manos Athanassoulis. Endure: a robust tuning paradigm for lsm trees under workload uncertainty. arXiv preprint arXiv:2110.13801, 2021."},{"key":"e_1_2_1_29_1","volume-title":"August","author":"Point-Lookup Using Improving","year":"2018","unstructured":"Improving Point-Lookup Using Data Block Hash Index. https:\/\/rocksdb.org\/blog\/2018\/08\/23\/data-block-hash-index.html, August 2018."},{"key":"e_1_2_1_30_1","first-page":"196","volume-title":"2018 IEEE 34th International Conference on Data Engineering (ICDE)","author":"Leis Viktor","unstructured":"Viktor Leis, Michael Haubenschild, Alfons Kemper, and Thomas Neumann. Leanstore: In-memory data management beyond main memory. In 2018 IEEE 34th International Conference on Data Engineering (ICDE), pages 185\u2013196. IEEE, 2018."},{"key":"e_1_2_1_31_1","first-page":"461","volume-title":"Proceedings of the 27th ACM Symposium on Operating Systems Principles","author":"Lepers Baptiste","year":"2019","unstructured":"Baptiste Lepers, Oana Balmau, Karan Gupta, and Willy Zwaenepoel. Kvell: the design and implementation of a fast persistent key-value store. In Proceedings of the 27th ACM Symposium on Operating Systems Principles, pages 447\u2013461, 2019."},{"key":"e_1_2_1_32_1","volume-title":"2013 IEEE 29th International Conference on Data Engineering (ICDE). IEEE","author":"Levandoski Justin","year":"2013","unstructured":"Justin Levandoski, David Lomet, and Sudipta Sengupta. The bw-tree: A b-tree for new hardware platforms. In 2013 IEEE 29th International Conference on Data Engineering (ICDE). IEEE, April 2013."},{"key":"e_1_2_1_33_1","first-page":"37","volume-title":"2013 IEEE 29th International Conference on Data Engineering (ICDE)","author":"Levandoski Justin J.","year":"2013","unstructured":"Justin J. Levandoski, Per-\u00c5ke Larson, and Radu Stoica. Identifying hot and cold data in main-memory databases. In 2013 IEEE 29th International Conference on Data Engineering (ICDE), pages 26\u201337, 2013."},{"key":"e_1_2_1_34_1","volume-title":"October","author":"DB.","year":"2023","unstructured":"LevelDB. https:\/\/github.com\/google\/leveldb, October 2023."},{"key":"e_1_2_1_35_1","first-page":"13","volume-title":"Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, SOSP '11","author":"Lim Hyeontaek","year":"2011","unstructured":"Hyeontaek Lim, Bin Fan, David G. Andersen, and Michael Kaminsky. Silt: A memory-efficient, high-performance key-value store. In Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, SOSP '11, page 1\u201313, New York, NY, USA, 2011. Association for Computing Machinery."},{"issue":"1","key":"e_1_2_1_36_1","first-page":"393","article-title":"Lsm-based storage techniques: A survey","volume":"29","author":"Luo Chen","year":"2019","unstructured":"Chen Luo and Michael J. Carey. Lsm-based storage techniques: A survey. The VLDB Journal, 29(1):393\u2013418, jul 2019.","journal-title":"The VLDB Journal"},{"key":"e_1_2_1_37_1","first-page":"2086","volume-title":"Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, SIGMOD '20","author":"Luo Siqiang","year":"2020","unstructured":"Siqiang Luo, Subarna Chatterjee, Rafael Ketsetsidis, Niv Dayan, Wilson Qin, and Stratos Idreos. Rosetta: A robust space-time optimized range filter for key-value stores. In Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, SIGMOD '20, page 2071\u20132086, New York, NY, USA, 2020. Association for Computing Machinery."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933349.2933358"},{"key":"e_1_2_1_39_1","first-page":"12","volume-title":"Proceedings of the 10th USENIX Conference on File and Storage Technologies, FAST'12","author":"Min Changwoo","year":"2012","unstructured":"Changwoo Min, Kangnyeon Kim, Hyunjin Cho, Sang-Won Lee, and Young Ik Eom. Sfs: Random write considered harmful in solid state drives. In Proceedings of the 10th USENIX Conference on File and Storage Technologies, FAST'12, page 12, USA, 2012. USENIX Association."},{"key":"e_1_2_1_40_1","volume-title":"July","author":"Gallery NuGet","year":"2025","unstructured":"NuGet Gallery. https:\/\/nuget.org\/, July 2025."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_2_1_42_1","first-page":"787","volume-title":"Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD '17","author":"Pandey Prashant","year":"2017","unstructured":"Prashant Pandey, Michael A. Bender, Rob Johnson, and Rob Patro. A generalpurpose counting filter: Making every bit count. In Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD '17, page 775\u2013787, New York, NY, USA, 2017. Association for Computing Machinery."},{"key":"e_1_2_1_43_1","first-page":"514","volume-title":"Proceedings of the 26th Symposium on Operating Systems Principles","author":"Raju Pandian","year":"2017","unstructured":"Pandian Raju, Rohan Kadekodi, Vijay Chidambaram, and Ittai Abraham. Pebblesdb: Building key-value stores using fragmented log-structured merge trees. In Proceedings of the 26th Symposium on Operating Systems Principles, pages 497\u2013514, 2017."},{"key":"e_1_2_1_44_1","volume-title":"https:\/\/github.com\/facebook\/rocksdb\/wiki\/RocksDB-Tuning-Guide, october","author":"Tuning Guide DB","year":"2023","unstructured":"RocksDB Tuning Guide. https:\/\/github.com\/facebook\/rocksdb\/wiki\/RocksDB-Tuning-Guide, october 2023."},{"key":"e_1_2_1_45_1","first-page":"2432","volume-title":"Proceedings of the 2022 International Conference on Management of Data, SIGMOD '22","author":"Sarkar Subhadeep","year":"2022","unstructured":"Subhadeep Sarkar, Kaijie Chen, Zichen Zhu, and Manos Athanassoulis. Compactionary: A dictionary for lsm compactions. In Proceedings of the 2022 International Conference on Management of Data, SIGMOD '22, page 2429\u20132432, New York, NY, USA, 2022. Association for Computing Machinery."},{"key":"e_1_2_1_46_1","volume-title":"Operating systems: design and implementation","author":"Tanenbaum Andrew S","year":"1997","unstructured":"Andrew S Tanenbaum and Albert S Woodhull. Operating systems: design and implementation, volume 2. Prentice Hall Englewood Cliffs, 1997."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522713"},{"key":"e_1_2_1_48_1","first-page":"208","volume-title":"14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20)","author":"Yang Juncheng","unstructured":"Juncheng Yang, Yao Yue, and K. V. Rashmi. A large scale analysis of hundreds of in-memory cache clusters at twitter. In 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20), pages 191\u2013208. USENIX Association, November 2020."},{"issue":"1","key":"e_1_2_1_49_1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.14778\/3561261.3561270","article-title":"An update-in-place key-value store for modern storage","volume":"16","author":"Yu Geoffrey X.","year":"2022","unstructured":"Geoffrey X. Yu, Markos Markakis, Andreas Kipf, Per-\u00c5ke Larson, Umar Farooq Minhas, and Tim Kraska. Treeline: An update-in-place key-value store for modern storage. Proc. VLDB Endow., 16(1):99\u2013112, sep 2022.","journal-title":"Proc. VLDB Endow."},{"key":"e_1_2_1_50_1","volume-title":"Proceedings of the 21st USENIX Conference on File and Storage Technologies, FAST'23, USA","author":"Yu Jinghuan","year":"2023","unstructured":"Jinghuan Yu, Sam H. Noh, Young-ri Choi, and Chun Jason Xue. Adoc: automatically harmonizing dataflow between components in log-structured key-value stores for improved performance. In Proceedings of the 21st USENIX Conference on File and Storage Technologies, FAST'23, USA, 2023. USENIX Association."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3461470"},{"key":"e_1_2_1_52_1","volume-title":"13th Conference on Innovative Data Systems Research, CIDR 2023, Amsterdam, Online Proceedings","author":"Zhou Xinjing","year":"2023","unstructured":"Xinjing Zhou, Xiangyao Yu, Goetz Graefe, and Michael Stonebraker. Two is better than one: The case for 2-tree for skewed data sets. In 13th Conference on Innovative Data Systems Research, CIDR 2023, Amsterdam, Online Proceedings, 2023."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3750601.3750615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T13:41:11Z","timestamp":1758030071000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3750601.3750615"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8]]},"references-count":52,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["10.14778\/3750601.3750615"],"URL":"https:\/\/doi.org\/10.14778\/3750601.3750615","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2025,8]]},"assertion":[{"value":"2025-09-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}