{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T15:39:26Z","timestamp":1787240366833,"version":"build-2736575974"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"13","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2017,9]]},"abstract":"<jats:p>Modern key-value stores often use write-optimized indexes and compact in-memory indexes to speed up read and write performance. One popular write-optimized index is the Log-structured merge-tree (LSM-tree) which provides indexed access to write-intensive data. It has been increasingly used as a storage backbone for many services, including file system metadata management, graph processing engines, and machine learning feature storage engines. Existing LSM-tree implementations often exhibit high write amplifications caused by compaction, and lack optimizations to maximize read performance on solid-state disks. The goal of this paper is to explore techniques that leverage common workload characteristics shared by many systems using key-value stores to reduce the read\/write amplification overhead typically associated with general-purpose LSM-tree implementations. Our experiments show that by applying these design techniques, our new implementation of a key-value store, SlimDB, can be two to three times faster, use less memory to cache metadata indices, and show lower tail latency in read operations compared to popular LSM-tree implementations such as LevelDB and RocksDB.<\/jats:p>","DOI":"10.14778\/3151106.3151108","type":"journal-article","created":{"date-parts":[[2017,10,19]],"date-time":"2017-10-19T08:30:08Z","timestamp":1508401808000},"page":"2037-2048","source":"Crossref","is-referenced-by-count":109,"title":["SlimDB"],"prefix":"10.14778","volume":"10","author":[{"given":"Kai","family":"Ren","sequence":"first","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qing","family":"Zheng","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joy","family":"Arulraj","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Garth","family":"Gibson","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465296"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2318857.2254766"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04128-0_61"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248393"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the annual ACM-SIAM symposium on Discrete algorithms","author":"Brodal G. S.","year":"2003"},{"key":"e_1_2_1_7_1","volume-title":"the USENIX Symposium on Operating Systems Design and Implementation","author":"Chang F.","year":"2006"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213947"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064054"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1921015"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989327"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294281"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2490483.2490495"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133129"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2648584.2648589"},{"key":"e_1_2_1_18_1","unstructured":"G. J. Jacobson. Succinct Static Data Structures. PhD thesis Pittsburgh PA USA 1988. AAI8918056.   G. J. Jacobson. Succinct Static Data Structures. PhD thesis Pittsburgh PA USA 1988. AAI8918056."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the International Conference on Very Large Data Bases","author":"Jagadish H. V.","year":"1997"},{"key":"e_1_2_1_20_1","unstructured":"LevelDB. A fast and lightweight key\/value database library 2011. http:\/\/code.google.com\/p\/leveldb\/.  LevelDB. A fast and lightweight key\/value database library 2011. http:\/\/code.google.com\/p\/leveldb\/."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2788582"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920990"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the Usenix Conference on File and Storage Technologies (FAST)","author":"Lim H.","year":"2016"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043558"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the 14th Usenix Conference on File and Storage Technologies","author":"Lu L.","year":"2016"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_2_1_28_1","volume-title":"Usenix Annual Technical Conference","author":"Ren K.","year":"2013"},{"key":"e_1_2_1_29_1","unstructured":"RocksDB. A facebook fork of leveldb which is optimized for flash and big memory machines 2013. https:\/\/rocksdb.org.  RocksDB. A facebook fork of leveldb which is optimized for flash and big memory machines 2013. https:\/\/rocksdb.org."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213862"},{"key":"e_1_2_1_32_1","volume-title":"Proccedings of the conference on File and Storage Technologies","author":"Shetty P.","year":"2013"},{"key":"e_1_2_1_33_1","volume-title":"USENIX Annual Technical Conference","author":"Wu X.","year":"2015"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3151106.3151108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T06:08:45Z","timestamp":1672207725000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3151106.3151108"}},"subtitle":["a space-efficient key-value storage engine for semi-sorted data"],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":32,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["10.14778\/3151106.3151108"],"URL":"https:\/\/doi.org\/10.14778\/3151106.3151108","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2017,9]]}}}