{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:14:33Z","timestamp":1779174873648,"version":"3.51.4"},"reference-count":54,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T00:00:00Z","timestamp":1685059200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["2118620,1938180,2106999"],"award-info":[{"award-number":["2118620,1938180,2106999"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2023,5,26]]},"abstract":"<jats:p>A critical aspect of modern key-value stores is the interaction between compaction policy and filters. Aggressive compaction reduces the on-disk footprint of a key-value store and can improve query performance, but can reduce insertion throughput because it is I\/O and CPU expensive. Filters can mitigate the query costs of lazy compaction, but only if they fit in RAM, limiting the scalability of queries with lazy compaction. And, with fast storage devices, the CPU costs of querying filters in a lazy compacting system can be significant.<\/jats:p>\n          <jats:p>In this work, we present Mapped SplinterDB, a key-value store that achieves excellent insertion performance, query performance, space efficiency, and scalability by replacing filters with maplets, space-efficient data structures that act as lossy maps with false positives. Critically, we use quotient maplets, which can be merged and resized without access to the underlying data, enabling us to decouple compaction of the data from compaction of the quotient maplets. Thus Mapped SplinterDB can compact data lazily and quotient maplets aggressively, so that each level has multiple sorted runs of data but only one quotient maplet. Quotient maplets are so small that compacting them aggressively is still cheaper than compacting the (much larger) data lazily, so overall we get the insertion performance of a lazily compacted system. And, since there is only one quotient maplet to query on each level, we get the query performance of an aggressively compacted system. Furthermore, quotient maplets can accelerate queries even when they don't fit in RAM, improving scalability to huge datasets. We also show how to use quotient maplets to estimate when a compaction could resolve a high density of updates, enabling Mapped SplinterDB to perform targeted compactions for space recovery.<\/jats:p>\n          <jats:p>In our benchmarks, Mapped SplinterDB matches the insertion performance of SplinterDB, a state-of-the-art lazily compacted system, and beats RocksDB, an aggressive compacting system, by up to 9\u00d7. On queries, Mapped SplinterDB outperforms SplinterDB and RocksDB by up to 89% and 83%, respectively, and scales gracefully to huge datasets. Mapped SplinterDB is able to dynamically trade update performance for space efficiency, resulting in space overheads on update-heavy workloads as low as 15-61%, whereas RocksDB had 80-117% and SplinterDB had up to 137% space overhead.<\/jats:p>","DOI":"10.1145\/3588726","type":"journal-article","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T17:42:05Z","timestamp":1685468525000},"page":"1-27","source":"Crossref","is-referenced-by-count":19,"title":["SplinterDB and Maplets: Improving the Tradeoffs in Key-Value Store Compaction Policy"],"prefix":"10.1145","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4890-7413","authenticated-orcid":false,"given":"Alex","family":"Conway","sequence":"first","affiliation":[{"name":"VMware Research Group, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3616-7788","authenticated-orcid":false,"given":"Mart\u00edn","family":"Farach-Colton","sequence":"additional","affiliation":[{"name":"Rutgers University, New Brunswick, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0784-7410","authenticated-orcid":false,"given":"Rob","family":"Johnson","sequence":"additional","affiliation":[{"name":"VMware Research Group, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,5,30]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"September","year":"2021","unstructured":"Amazon. Amazon ec2 instance types. https:\/\/aws.amazon.com\/ec2\/instance-types\/, September 2021."},{"key":"e_1_2_2_2_1","first-page":"461","volume-title":"Proceedings of the 19th International Conference on Extending Database Technology, EDBT 2016","author":"Athanassoulis Manos","year":"2016","unstructured":"Manos Athanassoulis, Michael S. Kester, Lukas M. Maas, Radu Stoica, Stratos Idreos, Anastasia Ailamaki, and Mark Callaghan. Designing access methods: The RUM conjecture. In Evaggelia Pitoura, Sofian Maabout, Georgia Koutrika, Am\u00e9lie Marian, Letizia Tanca, Ioana Manolescu, and Kostas Stefanidis, editors, Proceedings of the 19th International Conference on Extending Database Technology, EDBT 2016, Bordeaux, France, March 15--16, 2016, Bordeaux, France, March 15--16, 2016, pages 461--466. OpenProceedings.org, 2016."},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254756.2254766"},{"key":"e_1_2_2_4_1","first-page":"363","volume-title":"TRIAD: creating synergies between memory, disk and log in log structured key-value stores","author":"Balmau Oana","year":"2017","unstructured":"Oana Balmau, Diego Didona, Rachid Guerraoui, Willy Zwaenepoel, Huapeng Yuan, Aashray Arora, Karan Gupta, and Pavan Konka. TRIAD: creating synergies between memory, disk and log in log structured key-value stores. In Dilma Da Silva and Bryan Ford, editors, 2017 USENIX Annual Technical Conference, USENIX ATC 2017, Santa Clara, CA, USA, July 12--14, 2017, pages 363--375. USENIX Association, 2017."},{"key":"e_1_2_2_5_1","first-page":"753","volume-title":"SILK: preventing latency spikes in log-structured merge key-value stores","author":"Balmau Oana","year":"2019","unstructured":"Oana Balmau, Florin Dinu, Willy Zwaenepoel, Karan Gupta, Ravishankar Chandhiramoorthi, and Diego Didona. SILK: preventing latency spikes in log-structured merge key-value stores. In Dahlia Malkhi and Dan Tsafrir, editors, 2019 USENIX Annual Technical Conference, USENIX ATC 2019, Renton, WA, USA, July 10--12, 2019, pages 753--766. USENIX Association, 2019."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350275"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_2_2_8_1","volume-title":"Rocksdb github wiki -- performance benchmarks","author":"Borthakur Dhruba","year":"2013","unstructured":"Dhruba Borthakur. Rocksdb github wiki -- performance benchmarks, 2013."},{"key":"e_1_2_2_9_1","volume-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12--14, 2003","author":"Brodal Gerth St\u00f8lting","year":"2003","unstructured":"Gerth St\u00f8lting Brodal and Rolf Fagerberg. Lower bounds for external memory dictionaries. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12--14, 2003, Baltimore, Maryland, USA, pages 546--554. ACM\/SIAM, 2003."},{"key":"e_1_2_2_10_1","first-page":"209","volume-title":"18th USENIX Conference on File and Storage Technologies, FAST 2020","author":"Cao Zhichao","year":"2020","unstructured":"Zhichao Cao, Siying Dong, Sagar Vemuri, and David H. C. Du. Characterizing, modeling, and benchmarking rocksdb key-value workloads at facebook. In Sam H. Noh and Brent Welch, editors, 18th USENIX Conference on File and Storage Technologies, FAST 2020, Santa Clara, CA, USA, February 24--27, 2020, pages 209--223. USENIX Association, 2020."},{"key":"e_1_2_2_11_1","first-page":"275","volume-title":"Proceedings of the 2018 International Conference on Management of Data, SIGMOD Conference 2018","author":"Chandramouli Badrish","year":"2018","unstructured":"Badrish Chandramouli, Guna Prasaad, Donald Kossmann, Justin J. Levandoski, James Hunter, and Mike Barnett. FASTER: A concurrent key-value store with in-place updates. In Gautam Das, Christopher M. Jermaine, and Philip A. Bernstein, editors, Proceedings of the 2018 International Conference on Management of Data, SIGMOD Conference 2018, Houston, TX, USA, June 10--15, 2018, pages 275--290. ACM, 2018."},{"key":"e_1_2_2_12_1","volume-title":"7th Symposium on Operating Systems Design and Implementation (OSDI '06)","author":"Chang Fay","year":"2006","unstructured":"Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Michael Burrows, Tushar Chandra, Andrew Fikes, and Robert Gruber. Bigtable: A distributed storage system for structured data (awarded best paper!). In Brian N. Bershad and Jeffrey C. Mogul, editors, 7th Symposium on Operating Systems Design and Implementation (OSDI '06), November 6--8, Seattle, WA, USA, pages 205--218. USENIX Association, 2006."},{"key":"e_1_2_2_13_1","unstructured":"Yann Collet. xxhash - extremely fast hash algorithm."},{"key":"e_1_2_2_14_1","first-page":"45","volume-title":"15th USENIX Conference on File and Storage Technologies, FAST 2017","author":"Conway Alexander","year":"2017","unstructured":"Alexander Conway, Ainesh Bakshi, Yizheng Jiao, William Jannen, Yang Zhan, Jun Yuan, Michael A. Bender, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter, and Martin Farach-Colton. File systems fated for senescence? nonsense, says science! In Geoff Kuenning and Carl A. Waldspurger, editors, 15th USENIX Conference on File and Storage Technologies, FAST 2017, Santa Clara, CA, USA, February 27 - March 2, 2017, pages 45--58. USENIX Association, 2017."},{"key":"e_1_2_2_15_1","first-page":"49","volume-title":"2020 USENIX Annual Technical Conference, USENIX ATC 2020, July 15--17, 2020","author":"Conway Alexander","year":"2020","unstructured":"Alexander Conway, Abhishek Gupta, Vijay Chidambaram, Martin Farach-Colton, Richard P. Spillane, Amy Tai, and Rob Johnson. Splinterdb: Closing the bandwidth gap for nvme key-value stores. In Ada Gavrilovska and Erez Zadok, editors, 2020 USENIX Annual Technical Conference, USENIX ATC 2020, July 15--17, 2020, pages 49--63. USENIX Association, 2020."},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064054"},{"key":"e_1_2_2_17_1","first-page":"505","volume-title":"Proceedings of the 2018 International Conference on Management of Data, SIGMOD Conference 2018","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 Gautam Das, Christopher M. Jermaine, and Philip A. Bernstein, editors, Proceedings of the 2018 International Conference on Management of Data, SIGMOD Conference 2018, Houston, TX, USA, June 10--15, 2018, pages 505--520. ACM, 2018."},{"key":"e_1_2_2_18_1","first-page":"449","volume-title":"Proceedings of the 2019 International Conference on Management of Data, SIGMOD Conference 2019","author":"Dayan Niv","year":"2019","unstructured":"Niv Dayan and Stratos Idreos. The log-structured merge-bush & the wacky continuum. In Peter A. Boncz, Stefan Manegold, Anastasia Ailamaki, Amol Deshpande, and Tim Kraska, editors, Proceedings of the 2019 International Conference on Management of Data, SIGMOD Conference 2019, Amsterdam, The Netherlands, June 30 - July 5, 2019, pages 449--466. ACM, 2019."},{"key":"e_1_2_2_19_1","first-page":"365","volume-title":"SIGMOD '21: International Conference on Management of Data","author":"Dayan Niv","year":"2021","unstructured":"Niv Dayan and Moshe Twitto. Chucky: A succinct cuckoo filter for lsm-tree. In Guoliang Li, Zhanhuai Li, Stratos Idreos, and Divesh Srivastava, editors, SIGMOD '21: International Conference on Management of Data, Virtual Event, China, June 20--25, 2021, pages 365--378. ACM, 2021."},{"key":"e_1_2_2_20_1","volume-title":"Dillinger and Stefan Walzer. Ribbon filter: practically smaller than bloom and xor. CoRR, abs\/2103.02515","author":"Peter","year":"2021","unstructured":"Peter C. Dillinger and Stefan Walzer. Ribbon filter: practically smaller than bloom and xor. CoRR, abs\/2103.02515, 2021."},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3483840"},{"key":"e_1_2_2_22_1","first-page":"33","volume-title":"19th USENIX Conference on File and Storage Technologies, FAST 2021, February 23--25, 2021","author":"Dong Siying","year":"2021","unstructured":"Siying Dong, Andrew Kryczka, Yanqin Jin, and Michael Stumm. Evolution of development priorities in key-value stores serving large-scale applications: The rocksdb experience. In Marcos K. Aguilera and Gala Yadgar, editors, 19th USENIX Conference on File and Storage Technologies, FAST 2021, February 23--25, 2021, pages 33--49. USENIX Association, 2021."},{"key":"e_1_2_2_23_1","unstructured":"Inc. FaceBook. A rocksdb storage engine with mysql. http:\/\/myrocks.io\/ 2020."},{"key":"e_1_2_2_24_1","first-page":"75","volume-title":"Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies, CoNEXT 2014","author":"Fan Bin","year":"2014","unstructured":"Bin Fan, David G. Andersen, Michael Kaminsky, and Michael Mitzenmacher. Cuckoo filter: Practically better than bloom. In Aruna Seneviratne, Christophe Diot, Jim Kurose, Augustin Chaintreau, and Luigi Rizzo, editors, Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies, CoNEXT 2014, Sydney, Australia, December 2--5, 2014, pages 75--88. ACM, 2014."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90177-C"},{"key":"e_1_2_2_26_1","unstructured":"Apache Software Foundation. Apache Cassandra 2019."},{"key":"e_1_2_2_27_1","unstructured":"Inc. Google. Leveldb 2019."},{"key":"e_1_2_2_28_1","first-page":"2014","volume-title":"FAST","volume":"14","author":"Harter Tyler","unstructured":"Tyler Harter, Dhruba Borthakur, Siying Dong, Amitanand S Aiyer, Liyin Tang, Andrea C Arpaci-Dusseau, and Remzi H Arpaci-Dusseau. Analysis of hdfs under hbase: a facebook messages case study. In FAST, volume 14, page 12th, 2014."},{"key":"e_1_2_2_29_1","first-page":"967","volume-title":"Closing the performance gap between volatile and persistent key-value stores using cross-referencing logs","author":"Huang Yihe","year":"2018","unstructured":"Yihe Huang, Matej Pavlovic, Virendra J. Marathe, Margo I. Seltzer, Tim Harris, and Steve Byan. Closing the performance gap between volatile and persistent key-value stores using cross-referencing logs. In Haryadi S. Gunawi and Benjamin Reed, editors, 2018 USENIX Annual Technical Conference, USENIX ATC 2018, Boston, MA, USA, July 11--13, 2018, pages 967--979. USENIX Association, 2018."},{"key":"e_1_2_2_30_1","first-page":"570","volume-title":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Iacono John","year":"2012","unstructured":"John Iacono and Mihai Patrascu. Using hashing to solve the dictionary problem. In Yuval Rabani, editor, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012, pages 570--582. SIAM, 2012."},{"key":"e_1_2_2_31_1","volume-title":"9th Biennial Conference on Innovative Data Systems Research, CIDR 2019, Asilomar, CA, USA, January 13--16, 2019, Online Proceedings. www.cidrdb.org","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, and Zichen Zhu. Design continuums and the path toward self-designing key-value stores that know and learn. In 9th Biennial Conference on Innovative Data Systems Research, CIDR 2019, Asilomar, CA, USA, January 13--16, 2019, Online Proceedings. www.cidrdb.org, 2019."},{"key":"e_1_2_2_32_1","first-page":"173","volume-title":"2020 USENIX Annual Technical Conference, USENIX ATC 2020, July 15--17, 2020","author":"Im Junsu","year":"2020","unstructured":"Junsu Im, Jinwook Bae, Chanwoo Chung, Arvind, and Sungjin Lee. Pink: High-speed in-storage key-value store with bounded tails. In Ada Gavrilovska and Erez Zadok, editors, 2020 USENIX Annual Technical Conference, USENIX ATC 2020, July 15--17, 2020, pages 173--187. USENIX Association, 2020."},{"key":"e_1_2_2_33_1","first-page":"301","volume-title":"Proceedings of the 13th USENIX Conference on File and Storage Technologies, FAST 2015","author":"Jannen William","year":"2015","unstructured":"William Jannen, Jun Yuan, Yang Zhan, Amogh Akshintala, John Esmet, Yizheng Jiao, Ankur Mittal, Prashant Pandey, Phaneendra Reddy, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, and Donald E. Porter. Betrfs: A right-optimized write-optimized file system. In Jiri Schindler and Erez Zadok, editors, Proceedings of the 13th USENIX Conference on File and Storage Technologies, FAST 2015, Santa Clara, CA, USA, February 16--19, 2015, pages 301--315. USENIX Association, 2015."},{"key":"e_1_2_2_34_1","first-page":"821","volume-title":"2021 USENIX Annual Technical Conference, USENIX ATC 2021, July 14--16, 2021","author":"Kassa Hiwot Tadese","year":"2021","unstructured":"Hiwot Tadese Kassa, Jason Akers, Mrinmoy Ghosh, Zhichao Cao, Vaibhav Gogte, and Ronald G. Dreslinski. Improving performance of flash based key-value stores using storage class memory as a volatile memory extension. In Irina Calciu and Geoff Kuenning, editors, 2021 USENIX Annual Technical Conference, USENIX ATC 2021, July 14--16, 2021, pages 821--837. USENIX Association, 2021."},{"key":"e_1_2_2_35_1","first-page":"447","volume-title":"Proceedings of the 27th ACM Symposium on Operating Systems Principles, SOSP 2019, Huntsville, ON, Canada, October 27--30, 2019","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 Tim Brecht and Carey Williamson, editors, Proceedings of the 27th ACM Symposium on Operating Systems Principles, SOSP 2019, Huntsville, ON, Canada, October 27--30, 2019, pages 447--461. ACM, 2019."},{"key":"e_1_2_2_36_1","first-page":"2817","volume-title":"Proceedings of the 2020 International Conference on Management of Data, SIGMOD Conference 2020, online conference [Portland, OR, USA], June 14--19, 2020","author":"Luo Chen","year":"2020","unstructured":"Chen Luo. Breaking down memory walls in lsm-based storage systems. In David Maier, Rachel Pottinger, AnHai Doan, Wang-Chiew Tan, Abdussalam Alawini, and Hung Q. Ngo, editors, Proceedings of the 2020 International Conference on Management of Data, SIGMOD Conference 2020, online conference [Portland, OR, USA], June 14--19, 2020, pages 2817--2819. ACM, 2020."},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372719"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00555-y"},{"key":"e_1_2_2_39_1","volume-title":"The database for modern applications. https:\/\/www.mongodb.com\/","author":"DB.","year":"2020","unstructured":"MongoDB. The database for modern applications. https:\/\/www.mongodb.com\/, 2020."},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035963"},{"key":"e_1_2_2_42_1","first-page":"537","volume-title":"Tucana: Design and implementation of a fast and efficient scale-up key-value store","author":"Papagiannis Anastasios","year":"2016","unstructured":"Anastasios Papagiannis, Giorgos Saloustros, Pilar Gonz\u00e1lez-F\u00e9rez, and Angelos Bilas. Tucana: Design and implementation of a fast and efficient scale-up key-value store. In Ajay Gulati and Hakim Weatherspoon, editors, 2016 USENIX Annual Technical Conference, USENIX ATC 2016, Denver, CO, USA, June 22--24, 2016, pages 537--550. USENIX Association, 2016."},{"key":"e_1_2_2_43_1","first-page":"14","article-title":"and space-efficient bloom filters","author":"Putze Felix","year":"2009","unstructured":"Felix Putze, Peter Sanders, and Johannes Singler. Cache-, hash-, and space-efficient bloom filters. ACM J. Exp. Algorithmics, 14, 2009.","journal-title":"ACM J. Exp. Algorithmics"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132765"},{"key":"e_1_2_2_45_1","first-page":"145","volume-title":"TABLEFS: enhancing metadata efficiency in the local file system","author":"Ren Kai","year":"2013","unstructured":"Kai Ren and Garth A. Gibson. TABLEFS: enhancing metadata efficiency in the local file system. In Andrew Birrell and Emin G\u00fcn Sirer, editors, 2013 USENIX Annual Technical Conference, San Jose, CA, USA, June 26--28, 2013, pages 145--156. USENIX Association, 2013."},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151106.3151108"},{"key":"e_1_2_2_47_1","unstructured":"RocksDB. Issue #6448: read performance issue related to use_direct_reads."},{"key":"e_1_2_2_48_1","first-page":"2429","volume-title":"SIGMOD '22: International Conference on Management of Data","author":"Sarkar Subhadeep","year":"2022","unstructured":"Subhadeep Sarkar, Kaijie Chen, Zichen Zhu, and Manos Athanassoulis. Compactionary: A dictionary for LSM compactions. In Zachary G. Ives, Angela Bonifati, and Amr El Abbadi, editors, SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12 - 17, 2022, pages 2429--2432. ACM, 2022."},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476274"},{"key":"e_1_2_2_50_1","unstructured":"Inc. ScyllaDB. Choose a compaction strategy. https:\/\/docs.scylladb.com\/architecture\/compaction\/compaction-strategies\/."},{"key":"e_1_2_2_51_1","unstructured":"Tokutek Inc. TokuDB 2014. http:\/\/www.tokutek.com."},{"key":"e_1_2_2_52_1","unstructured":"WiredTiger. Making big data roar. http:\/\/www.wiredtiger.com\/ 2020."},{"key":"e_1_2_2_53_1","unstructured":"Yugabyte. The leading high-performance distributed sql database. https:\/\/www.yugabyte.com\/."},{"key":"e_1_2_2_54_1","first-page":"75","volume-title":"18th USENIX Conference on File and Storage Technologies, FAST 2020","author":"Zhan Yang","year":"2020","unstructured":"Yang Zhan, Alexander Conway, Yizheng Jiao, Nirjhar Mukherjee, Ian Groombridge, Michael A. Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Donald E. Porter, and Jun Yuan. How to copy files. In Sam H. Noh and Brent Welch, editors, 18th USENIX Conference on File and Storage Technologies, FAST 2020, Santa Clara, CA, USA, February 24--27, 2020, pages 75--89. USENIX Association, 2020."}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588726","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3588726","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3588726","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:35Z","timestamp":1750178855000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588726"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,26]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,5,26]]}},"alternative-id":["10.1145\/3588726"],"URL":"https:\/\/doi.org\/10.1145\/3588726","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,26]]}}}