{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:02:44Z","timestamp":1766268164111,"version":"3.41.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2018,4,12]],"date-time":"2018-04-12T00:00:00Z","timestamp":1523491200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"OCI","award":["1147522"],"award-info":[{"award-number":["1147522"]}]},{"name":"CNS","award":["1162165"],"award-info":[{"award-number":["1162165"]}]},{"name":"CCF","award":["1453705,1513944,1629403,1629291"],"award-info":[{"award-number":["1453705,1513944,1629403,1629291"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2018,5,31]]},"abstract":"<jats:p>LSM-tree has been widely used in data management production systems for write-intensive workloads. However, as read and write workloads co-exist under LSM-tree, data accesses can experience long latency and low throughput due to the interferences to buffer caching from the compaction, a major and frequent operation in LSM-tree. After a compaction, the existing data blocks are reorganized and written to other locations on disks. As a result, the related data blocks that have been loaded in the buffer cache are invalidated since their referencing addresses are changed, causing serious performance degradations.<\/jats:p>\n          <jats:p>\n            To re-enable high-speed buffer caching during intensive writes, we propose Log-Structured buffered-Merge tree (simplified as LSbM-tree) by adding a\n            <jats:italic>compaction buffer<\/jats:italic>\n            on disks to minimize the cache invalidations on buffer cache caused by compactions. The compaction buffer efficiently and adaptively maintains the frequently visited datasets. In LSbM, strong locality objects can be effectively kept in the buffer cache with minimum or no harmful invalidations. With the help of a small on-disk compaction buffer, LSbM achieves a high query performance by enabling effective buffer caching, while retaining all the merits of LSM-tree for write-intensive data processing and providing high bandwidth of disks for range queries. We have implemented LSbM based on LevelDB. We show that with a standard buffer cache and a hard disk, LSbM can achieve 2x performance improvement over LevelDB. We have also compared LSbM with other existing solutions to show its strong cache effectiveness.\n          <\/jats:p>","DOI":"10.1145\/3162615","type":"journal-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T12:10:20Z","timestamp":1523621420000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["A Low-cost Disk Solution Enabling LSM-tree to Achieve High Performance for Mixed Read\/Write Workloads"],"prefix":"10.1145","volume":"14","author":[{"given":"Dejun","family":"Teng","sequence":"first","affiliation":[{"name":"The Ohio State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Guo","sequence":"additional","affiliation":[{"name":"Google Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rubao","family":"Lee","sequence":"additional","affiliation":[{"name":"The Ohio State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Chen","sequence":"additional","affiliation":[{"name":"Louisiana State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanfeng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Northeastern University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siyuan","family":"Ma","sequence":"additional","affiliation":[{"name":"The Ohio State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaodong","family":"Zhang","sequence":"additional","affiliation":[{"name":"The Ohio State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,4,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/2757807.2757810"},{"key":"e_1_2_1_2_1","unstructured":"Apache. 2017. Cassandra. Retrieved April 6 2017 from http:\/\/cassandra.apache.org\/.  Apache. 2017. Cassandra. Retrieved April 6 2017 from http:\/\/cassandra.apache.org\/."},{"key":"e_1_2_1_3_1","unstructured":"Apache. 2017. HBASE. Retrieved April 6 2017 from https:\/\/hbase.apache.org\/.  Apache. 2017. HBASE. Retrieved April 6 2017 from https:\/\/hbase.apache.org\/."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2318857.2254766"},{"key":"e_1_2_1_5_1","unstructured":"Basho. 2017. Riak. Retrieved April 6 2017from http:\/\/basho.com\/riak.  Basho. 2017. Riak. Retrieved April 6 2017from http:\/\/basho.com\/riak."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2014698.2014864"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_1_10_1","unstructured":"Facebook. 2017. RocksDB. Retrieved April 6 2017 from http:\/\/rocksdb.org\/.  Facebook. 2017. RocksDB. Retrieved April 6 2017 from http:\/\/rocksdb.org\/."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2741948.2741973"},{"key":"e_1_2_1_12_1","unstructured":"Google. 2017. LevelDB. Retrieved April 6 2017 from http:\/\/code.google.com\/p\/leveldb.  Google. 2017. LevelDB. Retrieved April 6 2017 from http:\/\/code.google.com\/p\/leveldb."},{"key":"e_1_2_1_13_1","volume-title":"Re-enabling high-speed caching for LSM-trees. arXiv preprint arXiv:1606.02015","author":"Guo Lei","year":"2016","unstructured":"Lei Guo , Dejun Teng , Rubao Lee , Feng Chen , Siyuan Ma , and Xiaodong Zhang . 2016. Re-enabling high-speed caching for LSM-trees. arXiv preprint arXiv:1606.02015 ( 2016 ). Lei Guo, Dejun Teng, Rubao Lee, Feng Chen, Siyuan Ma, and Xiaodong Zhang. 2016. Re-enabling high-speed caching for LSM-trees. arXiv preprint arXiv:1606.02015 (2016)."},{"key":"e_1_2_1_14_1","volume-title":"VLDB","volume":"97","author":"Jagadish H. V.","year":"1997","unstructured":"H. V. Jagadish , P. P. S. Narayan , Sridhar Seshadri , S. Sudarshan , and Rama Kanneganti . 1997 . Incremental organization for data recording and warehousing . In VLDB , Vol. 97 . Citeseer, 16--25. H. V. Jagadish, P. P. S. Narayan, Sridhar Seshadri, S. Sudarshan, and Rama Kanneganti. 1997. Incremental organization for data recording and warehousing. In VLDB, Vol. 97. Citeseer, 16--25."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920990"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2930583.2930595"},{"volume-title":"Proceedings of the 14th USENIX Conference on File and Storage Technologies (FAST\u201916)","author":"Lu Lanyue","key":"e_1_2_1_17_1","unstructured":"Lanyue Lu , Thanumalayan Sankaranarayana Pillai , Andrea C. Arpaci-Dusseau , and Remzi H . Arpaci-Dusseau. 2016. WiscKey: Separating keys from values in SSD-conscious storage . In Proceedings of the 14th USENIX Conference on File and Storage Technologies (FAST\u201916) . 133--148. Lanyue Lu, Thanumalayan Sankaranarayana Pillai, Andrea C. Arpaci-Dusseau, and Remzi H. Arpaci-Dusseau. 2016. WiscKey: Separating keys from values in SSD-conscious storage. In Proceedings of the 14th USENIX Conference on File and Storage Technologies (FAST\u201916). 133--148."},{"key":"e_1_2_1_18_1","volume-title":"Compaction Improvements in Cassandra 2.1","author":"Mcguire Ryan","year":"2014","unstructured":"Ryan Mcguire . 2014. Compaction Improvements in Cassandra 2.1 . April 6, 2014 from http:\/\/www.datastax.com\/dev\/blog\/compaction-improvements-in-cassandra-21. Ryan Mcguire. 2014. Compaction Improvements in Cassandra 2.1. April 6, 2014 from http:\/\/www.datastax.com\/dev\/blog\/compaction-improvements-in-cassandra-21."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213862"},{"volume-title":"Presented as part of the Proceedings of the 11th USENIX Conference on File and Storage Technologies (FAST\u201913). 17--30.","author":"Shetty Pradeep J.","key":"e_1_2_1_21_1","unstructured":"Pradeep J. Shetty , Richard P. Spillane , Ravikant R. Malpani , Binesh Andrews , Justin Seyster , and Erez Zadok . 2013. Building workload-independent storage with VT-trees . In Presented as part of the Proceedings of the 11th USENIX Conference on File and Storage Technologies (FAST\u201913). 17--30. Pradeep J. Shetty, Richard P. Spillane, Ravikant R. Malpani, Binesh Andrews, Justin Seyster, and Erez Zadok. 2013. Building workload-independent storage with VT-trees. In Presented as part of the Proceedings of the 11th USENIX Conference on File and Storage Technologies (FAST\u201913). 17--30."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2017.70"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592804"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 2015 USENIX Conference on Usenix Annual Technical Conference. USENIX Association, 71--82","author":"Wu Xingbo","year":"2015","unstructured":"Xingbo Wu , Yuehai Xu , Zili Shao , and Song Jiang . 2015 . LSM-trie: An LSM-tree-based ultra-large key-value store for small data . In Proceedings of the 2015 USENIX Conference on Usenix Annual Technical Conference. USENIX Association, 71--82 . Xingbo Wu, Yuehai Xu, Zili Shao, and Song Jiang. 2015. LSM-trie: An LSM-tree-based ultra-large key-value store for small data. In Proceedings of the 2015 USENIX Conference on Usenix Annual Technical Conference. USENIX Association, 71--82."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809984"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3162615","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3162615","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3162615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:29Z","timestamp":1750273649000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3162615"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,12]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,5,31]]}},"alternative-id":["10.1145\/3162615"],"URL":"https:\/\/doi.org\/10.1145\/3162615","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"type":"print","value":"1553-3077"},{"type":"electronic","value":"1553-3093"}],"subject":[],"published":{"date-parts":[[2018,4,12]]},"assertion":[{"value":"2017-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-04-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}