{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:55:11Z","timestamp":1775638511196,"version":"3.50.1"},"reference-count":87,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T00:00:00Z","timestamp":1716940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Arizona State University","doi-asserted-by":"publisher","award":["CC1125 PG14707"],"award-info":[{"award-number":["CC1125 PG14707"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2337806"],"award-info":[{"award-number":["2337806"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2024,5,29]]},"abstract":"<jats:p>Optimizing LSM-based Key-Value Stores (LSM-KVS) for disaggregated storage is essential to achieve better resource utilization, performance, and flexibility. Most of the existing studies focus on offloading the compaction to the storage nodes to mitigate the performance penalties caused by heavy network traffic between computing and storage. However, several critical issues are not addressed including the strong dependency between offloaded compaction and LSM-KVS, resource load-balancing, compaction scheduling, and complex transient errors.<\/jats:p>\n          <jats:p>To address the aforementioned issues and limitations, in this paper, we propose CaaS-LSM, a novel disaggregated LSM-KVS with a new idea of Compaction-as-a-Service. CaaS-LSM brings three key contributions. First, CaaS-LSM decouples the compaction from LSM-KVS and achieves stateless execution to ensure high flexibility and avoid coordination overhead with LSM-KVS. Second, CaaS-LSM introduces a performance- and resource-optimized control plane to guarantee better performance and resource utilization via an adaptive run-time scheduling and management strategy. Third, CaaS-LSM addresses different levels of transient and execution errors via sophisticated error-handling logic. We implement the prototype of CaaS-LSM based on RocksDB and evaluate it with different LSM-based distributed databases (Kvrocks and Nebula). In the storage disaggregated setup, CaaS-LSM achieves up to 8X throughput improvement and reduces the P99 latency up to 98% compared with the conventional LSM-KVS, and up to 61% of improvement compared with state-of-the-art LSM-KVS optimized for disaggregated storage.<\/jats:p>","DOI":"10.1145\/3654927","type":"journal-article","created":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T09:44:53Z","timestamp":1717062293000},"page":"1-28","source":"Crossref","is-referenced-by-count":9,"title":["CaaS-LSM: Compaction-as-a-Service for LSM-based Key-Value Stores in Storage Disaggregated Infrastructure"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-1979-1645","authenticated-orcid":false,"given":"Qiaolin","family":"Yu","sequence":"first","affiliation":[{"name":"Arizona State University &amp; Cornell University, Tempe, AZ, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4561-9945","authenticated-orcid":false,"given":"Chang","family":"Guo","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-0455-9564","authenticated-orcid":false,"given":"Jay","family":"Zhuang","sequence":"additional","affiliation":[{"name":"Independent, San Francisco, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0317-1214","authenticated-orcid":false,"given":"Viraj","family":"Thakkar","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3039-1175","authenticated-orcid":false,"given":"Jianguo","family":"Wang","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6950-1776","authenticated-orcid":false,"given":"Zhichao","family":"Cao","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,5,30]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"d.]. Apache. Kvrocks. https:\/\/github.com\/apache\/incubator-kvrocks. Accessed","year":"2023","unstructured":"[n. d.]. Apache. Kvrocks. https:\/\/github.com\/apache\/incubator-kvrocks. Accessed 10 Jan, 2023."},{"key":"e_1_2_2_2_1","volume-title":"d.]. Azure SQL Database. Hyperscale service tier. https:\/\/learn.microsoft.com\/enus\/azure\/azure-sql\/database\/service-tier-hyperscale?view=azuresql,2023.. Accessed","year":"2023","unstructured":"[n. d.]. Azure SQL Database. Hyperscale service tier. https:\/\/learn.microsoft.com\/enus\/azure\/azure-sql\/database\/service-tier-hyperscale?view=azuresql,2023.. Accessed 10 Jan, 2023."},{"key":"e_1_2_2_3_1","volume-title":"d.]. ByteDance. TerarkDB. https:\/\/github.com\/bytedance\/terarkdb. Accessed","year":"2023","unstructured":"[n. d.]. ByteDance. TerarkDB. https:\/\/github.com\/bytedance\/terarkdb. Accessed 10 Jan, 2023."},{"key":"e_1_2_2_4_1","unstructured":"[n. d.]. CaaS-LSM. https:\/\/github.com\/asu-idi\/CaaS-LSM."},{"key":"e_1_2_2_5_1","unstructured":"[n. d.]. Cassandra on RocksDB at Instagram. https:\/\/developers.facebook.com\/videos\/f8--2018\/cassandra-on-rocksdb-at-instagram."},{"key":"e_1_2_2_6_1","volume-title":"d.]. db_bench. https:\/\/github.com\/facebook\/rocksdb\/wiki\/Benchmarking-tools. Accessed","year":"2023","unstructured":"[n. d.]. db_bench. https:\/\/github.com\/facebook\/rocksdb\/wiki\/Benchmarking-tools. Accessed 10 Jan, 2023."},{"key":"e_1_2_2_7_1","unstructured":"[n. d.]. GearDB: A GC-free Key-Value Store on HM-SMR Drives with Gear Compaction | USENIX. https:\/\/www.usenix.org\/conference\/fast19\/presentation\/yao"},{"key":"e_1_2_2_8_1","volume-title":"d.]. Google Cloud. AlloyDB for PostgreSQL Under the Hood: Intelligent, atabaseaware Storage. https:\/\/cloud.google.com\/blog\/products\/databases\/alloydb-forpostgresql-intelligent-scalable-storage","year":"2022","unstructured":"[n. d.]. Google Cloud. AlloyDB for PostgreSQL Under the Hood: Intelligent, atabaseaware Storage. https:\/\/cloud.google.com\/blog\/products\/databases\/alloydb-forpostgresql-intelligent-scalable-storage, 2022. Accessed 10 Jan, 2023."},{"key":"e_1_2_2_9_1","volume-title":"d.]. gRPC. https:\/\/grpc.io\/. Accessed","year":"2023","unstructured":"[n. d.]. gRPC. https:\/\/grpc.io\/. Accessed 10 Jan, 2023."},{"key":"e_1_2_2_10_1","volume-title":"d.]. Kvrocks controller. https:\/\/github.com\/KvrocksLabs\/kvrocks_controller. Accessed","year":"2023","unstructured":"[n. d.]. Kvrocks controller. https:\/\/github.com\/KvrocksLabs\/kvrocks_controller. Accessed 10 Jan, 2023."},{"key":"e_1_2_2_11_1","volume-title":"d.]. Machine families resource and comparison guide. https:\/\/cloud.google.com\/compute\/docs\/machine-resource. Accessed","year":"2023","unstructured":"[n. d.]. Machine families resource and comparison guide. https:\/\/cloud.google.com\/compute\/docs\/machine-resource. Accessed 10 Jan, 2023."},{"key":"e_1_2_2_12_1","unstructured":"[n. d.]. Meta. MyRocks. http:\/\/myrocks.io\/. Accessed 10 Jan 2023."},{"key":"e_1_2_2_13_1","volume-title":"d.]. OCEANBASE. https:\/\/www.oceanbase.com\/. Accessed","year":"2023","unstructured":"[n. d.]. OCEANBASE. https:\/\/www.oceanbase.com\/. Accessed 10 Jan, 2023."},{"key":"e_1_2_2_14_1","volume-title":"d.]. PingCAP. TIKV. https:\/\/tikv.org\/. Accessed","year":"2023","unstructured":"[n. d.]. PingCAP. TIKV. https:\/\/tikv.org\/. Accessed 10 Jan, 2023."},{"key":"e_1_2_2_15_1","volume-title":"d.]. RocksDB Compression. https:\/\/github.com\/facebook\/rocksdb\/wiki\/Compression. Accessed","year":"2024","unstructured":"[n. d.]. RocksDB Compression. https:\/\/github.com\/facebook\/rocksdb\/wiki\/Compression. Accessed 10 Jan, 2024."},{"key":"e_1_2_2_16_1","volume-title":"d.]. RocksDB Integrated BlobDB. https:\/\/rocksdb.org\/blog\/2021\/05\/26\/integrated-blob-db.html. Accessed","year":"2024","unstructured":"[n. d.]. RocksDB Integrated BlobDB. https:\/\/rocksdb.org\/blog\/2021\/05\/26\/integrated-blob-db.html. Accessed 10 Jan, 2024."},{"key":"e_1_2_2_17_1","volume-title":"d.]. RocksDB Ribbon Filter. https:\/\/rocksdb.org\/blog\/2021\/12\/29\/ribbon-filter.html. Accessed","year":"2024","unstructured":"[n. d.]. RocksDB Ribbon Filter. https:\/\/rocksdb.org\/blog\/2021\/12\/29\/ribbon-filter.html. Accessed 10 Jan, 2024."},{"key":"e_1_2_2_18_1","volume-title":"d.]. RocksDB Storage Engine Module for MongoDB. https:\/\/github.com\/mongodb-partners\/mongo-rocks. Accessed","year":"2023","unstructured":"[n. d.]. RocksDB Storage Engine Module for MongoDB. https:\/\/github.com\/mongodb-partners\/mongo-rocks. Accessed 10 Jan, 2023."},{"key":"e_1_2_2_19_1","volume-title":"d.]. RocksDB. https:\/\/github.com\/facebook\/rocksdb. Accessed","year":"2023","unstructured":"[n. d.]. RocksDB. https:\/\/github.com\/facebook\/rocksdb. Accessed 10 Jan, 2023."},{"key":"e_1_2_2_20_1","volume-title":"d.]. TerarkZipTable Compression. TerarkDB. https:\/\/bytedance.larkoffice.com\/docs\/ doccnZmYFqHBm06BbvYgjsHHcKc. Accessed","year":"2024","unstructured":"[n. d.]. TerarkZipTable Compression. TerarkDB. https:\/\/bytedance.larkoffice.com\/docs\/ doccnZmYFqHBm06BbvYgjsHHcKc. Accessed 10 Jan, 2024."},{"key":"e_1_2_2_21_1","volume-title":"d.]. Vesoft Inc. Nebula. https:\/\/github.com\/vesoft-inc\/nebula. Accessed","year":"2023","unstructured":"[n. d.]. Vesoft Inc. Nebula. https:\/\/github.com\/vesoft-inc\/nebula. Accessed 10 Jan, 2023."},{"key":"e_1_2_2_22_1","volume-title":"d.]. ZippyDB: a modern, distributed key-value data store. https:\/\/www.youtube.com\/watch?v=DfiN7pG0D0k. Accessed","year":"2023","unstructured":"[n. d.]. ZippyDB: a modern, distributed key-value data store. https:\/\/www.youtube.com\/watch?v=DfiN7pG0D0k. Accessed 10 Jan, 2023."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2757807.2757810"},{"key":"e_1_2_2_24_1","volume-title":"Alex Averbuch, Peter Boncz, Orri Erling, Andrey Gubichev, Vlad Haprian, Moritz Kaufmann, Josep Llu\u00eds Larriba Pey, Norbert Mart\u00ednez, et al.","author":"Angles Renzo","year":"2020","unstructured":"Renzo Angles, J\u00e1nos Benjamin Antal, Alex Averbuch, Peter Boncz, Orri Erling, Andrey Gubichev, Vlad Haprian, Moritz Kaufmann, Josep Llu\u00eds Larriba Pey, Norbert Mart\u00ednez, et al. 2020. The LDBC social network benchmark. arXiv preprint arXiv:2001.02299 (2020)."},{"key":"e_1_2_2_25_1","volume-title":"Disk and Log in Log Structured Key-Value Stores. In 2017 USENIX Annual Technical Conference (USENIX ATC 17)","author":"Balmau Oana","year":"2017","unstructured":"Oana Balmau, Diego Didona, Rachid Guerraoui, Willy Zwaenepoel, Huapeng Yuan, Aashray Arora, Karan Gupta, and Pavan Konka. 2017. TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores. In 2017 USENIX Annual Technical Conference (USENIX ATC 17). 363--375."},{"key":"e_1_2_2_26_1","volume-title":"SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores. In 2019 USENIX Annual Technical Conference (USENIX ATC 19)","author":"Balmau Oana","year":"2019","unstructured":"Oana Balmau, Florin Dinu, Willy Zwaenepoel, Karan Gupta, Ravishankar Chandhiramoorthi, and Diego Didona. 2019. SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores. In 2019 USENIX Annual Technical Conference (USENIX ATC 19). 753--766."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378504"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3488368"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/3386691.3386712"},{"key":"e_1_2_2_30_1","volume-title":"USENIX Annual Technical Conference,USENIX Annual Technical Conference (Jul","author":"Chan H.W.","year":"2018","unstructured":"HelenH.W. Chan, Yongkun Li, PatrickP.C. Lee, and Yinlong Xu. 2018. HashKV: enabling efficient updates in KV storage via hashing. USENIX Annual Technical Conference,USENIX Annual Technical Conference (Jul 2018)."},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_2_2_32_1","volume-title":"19th USENIX Conference on File and Storage Technologies (FAST 21)","author":"Chen Hao","year":"2021","unstructured":"Hao Chen, Chaoyi Ruan, Cheng Li, Xiaosong Ma, and Yinlong Xu. 2021. SpanDB: A Fast,Cost-Effective LSM-tree Based KV Store on Hybrid Storage. In 19th USENIX Conference on File and Storage Technologies (FAST 21). 17--32."},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05051-1_7"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588726"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064054"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196927"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319903"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457273"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551853"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3483840"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589772"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742786"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342360"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/3026877.3026897"},{"key":"e_1_2_2_46_1","unstructured":"Sanjay Ghemawat and Jeff Dean. 2011. LevelDB."},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_2_2_48_1","volume-title":"AisLSM: Revolutionizing the Compaction with Asynchronous I\/Os for LSM-tree. arXiv preprint arXiv:2307.16693","author":"Hu Yanpeng","year":"2023","unstructured":"Yanpeng Hu, Li Zhu, Lei Jia, and Chundong Wang. 2023. AisLSM: Revolutionizing the Compaction with Asynchronous I\/Os for LSM-tree. arXiv preprint arXiv:2307.16693 (2023)."},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457297"},{"key":"e_1_2_2_50_1","volume-title":"PinK: High-speed In-storage Key-value Store with Bounded Tails. In 2020 USENIX Annual Technical Conference (USENIX ATC 20)","author":"Im Junsu","year":"2020","unstructured":"Junsu Im, Jinwook Bae, Chanwoo Chung, Sungjin Lee, et al. 2020. PinK: High-speed In-storage Key-value Store with Bounded Tails. In 2020 USENIX Annual Technical Conference (USENIX ATC 20). 173--187."},{"key":"e_1_2_2_51_1","volume-title":"2021 USENIX Annual Technical Conference (USENIX ATC 21)","author":"Kassa Hiwot Tadese","year":"2021","unstructured":"Hiwot Tadese Kassa, Jason Akers, Mrinmoy Ghosh, Zhichao Cao, Vaibhav Gogte, and Ronald Dreslinski. 2021. Improving performance of flash based {Key-Value} stores using storage class memory as a volatile memory extension. In 2021 USENIX Annual Technical Conference (USENIX ATC 21). 821--837."},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511905"},{"key":"e_1_2_2_53_1","first-page":"4","article-title":"Paxos made simple","volume":"32","author":"Lamport Leslie","year":"2001","unstructured":"Leslie Lamport. 2001. Paxos made simple. ACM SIGACT News (Distributed Computing Column) 32, 4 (Whole Number 121, December 2001) (2001), 51--58.","journal-title":"ACM SIGACT News (Distributed Computing Column)"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3481913"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387902.3392621"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.1900612"},{"key":"e_1_2_2_57_1","volume-title":"WiscKey: separating keys from values in SSD-conscious storage. File and Storage Technologies,File and Storage Technologies (Feb","author":"Lu Lanyue","year":"2016","unstructured":"Lanyue Lu, ThanumalayanSankaranarayana Pillai, AndreaC. Arpaci-Dusseau, and RemziH. Arpaci-Dusseau. 2016. WiscKey: separating keys from values in SSD-conscious storage. File and Storage Technologies,File and Storage Technologies (Feb 2016)."},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389731"},{"key":"e_1_2_2_59_1","volume-title":"2014 USENIX Annual Technical Conference (Usenix ATC 14)","author":"Ongaro Diego","year":"2014","unstructured":"Diego Ongaro and John Ousterhout. 2014. In search of an understandable consensus algorithm. In 2014 USENIX Annual Technical Conference (Usenix ATC 14). 305--319."},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-016-0472-z"},{"key":"e_1_2_2_61_1","volume-title":"19th USENIX Conference on File and Storage Technologies (FAST 21)","author":"Pan Satadru","year":"2021","unstructured":"Satadru Pan, Theano Stavrinos, Yunqiao Zhang, Atul Sikaria, Pavel Zakharov, Abhinav Sharma, Mike Shuey, Richard Wareing, Monika Gangapuram, Guanglei Cao, et al . 2021. Facebook's tectonic filesystem: Efficiency from exascale. In 19th USENIX Conference on File and Storage Technologies (FAST 21). 217--231."},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3654983"},{"key":"e_1_2_2_63_1","volume-title":"d.]. Remote Compactions in RocksDB-Cloud. https:\/\/rockset.com\/blog\/remote-compactions-in-rocksdb-cloud\/. Accessed","author":"Pham Hieu","year":"2023","unstructured":"Hieu Pham. [n. d.]. Remote Compactions in RocksDB-Cloud. https:\/\/rockset.com\/blog\/remote-compactions-in-rocksdb-cloud\/. Accessed 10 Jan, 2023."},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","unstructured":"Felix Putze Peter Sanders and Johannes Singler. 2007. Cache- Hash- and Space-Efficient Bloom Filters. 108--121. https:\/\/doi.org\/10.1007\/978--3--540--72845-0_9","DOI":"10.1007\/978--3--540--72845-0_9"},{"key":"e_1_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132765"},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151106.3151108"},{"key":"e_1_2_2_67_1","volume-title":"Constructing and Analyzing the LSM Compaction Design Space (Updated Version). arXiv preprint arXiv:2202.04522","author":"Sarkar Subhadeep","year":"2022","unstructured":"Subhadeep Sarkar, Dimitris Staratzis, Zichen Zhu, and Manos Athanassoulis. 2022. Constructing and Analyzing the LSM Compaction Design Space (Updated Version). arXiv preprint arXiv:2202.04522 (2022)."},{"key":"e_1_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213862"},{"key":"e_1_2_2_69_1","volume-title":"Building workload-independent storage with VT-trees. File and Storage Technologies,File and Storage Technologies (Feb","author":"Shetty Pradeep","year":"2013","unstructured":"Pradeep Shetty, RichardP. Spillane, Ravikant Malpani, Binesh Andrews, Justin Seyster, and Erez Zadok. 2013. Building workload-independent storage with VT-trees. File and Storage Technologies,File and Storage Technologies (Feb 2013)."},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2020.103217"},{"key":"e_1_2_2_71_1","volume-title":"An Asynchronous Compaction Acceleration Scheme for Near-Data Processing-enabled LSM-Tree-based KV Stores. ACM Transactions on Embedded Computing Systems","author":"Sun Hui","year":"2023","unstructured":"Hui Sun, Bendong Lou, Chao Zhao, Deyan Kong, Chaowei Zhang, Jianzhong Huang, Yinliang Yue, and Xiao Qin. 2023. An Asynchronous Compaction Acceleration Scheme for Near-Data Processing-enabled LSM-Tree-based KV Stores. ACM Transactions on Embedded Computing Systems (2023)."},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056101"},{"key":"e_1_2_2_73_1","volume-title":"Pacman: An Efficient Compaction Approach for {Log-Structured} {Key-Value} Store on Persistent Memory. 773--788. https:\/\/www.usenix.org\/conference\/atc22\/presentation\/wang-jing","author":"Wang Jing","year":"2022","unstructured":"Jing Wang, Youyou Lu, Qing Wang, Minhui Xie, Keji Huang, and Jiwu Shu. 2022. Pacman: An Efficient Compaction Approach for {Log-Structured} {Key-Value} Store on Persistent Memory. 773--788. https:\/\/www.usenix.org\/conference\/atc22\/presentation\/wang-jing"},{"key":"e_1_2_2_74_1","volume-title":"Disaggregated Database Systems. In Companion of the International Conference on Management of Data (SIGMOD). 37--44","author":"Wang Jianguo","year":"2023","unstructured":"Jianguo Wang and Qizhen Zhang. 2023. Disaggregated Database Systems. In Companion of the International Conference on Management of Data (SIGMOD). 37--44."},{"key":"e_1_2_2_75_1","volume-title":"Aref","author":"Wang Ruihong","year":"2024","unstructured":"Ruihong Wang, Chuqing Gao, Jianguo Wang, Prishita Kadam, M. Tamer Ozsu, and Walid G. Aref. 2024. Optimizing LSM-based Indexes for Disaggregated Memory. VLDB Journal (VLDBJ) (2024)."},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00217"},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00158"},{"key":"e_1_2_2_78_1","doi-asserted-by":"crossref","unstructured":"Hao Wen Zhichao Cao Yang Zhang Xiang Cao Ziqi Fan Doug Voigt and David Du. 2018. Joins: Meeting latency slo with integrated control for networked storage. In 2018 IEEE 26th International Symposium on Modeling Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS). IEEE 194--200.","DOI":"10.1109\/MASCOTS.2018.00027"},{"key":"e_1_2_2_79_1","volume-title":"USENIX Annual Technical Conference,USENIX Annual Technical Conference (Jul","author":"Wu Xingbo","year":"2015","unstructured":"Xingbo Wu, Yuehai Xu, Zehui Shao, and Song Jiang. 2015. LSM-trie: an LSM-tree-based ultra-large key-value store for small data. USENIX Annual Technical Conference,USENIX Annual Technical Conference (Jul 2015)."},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3472883.3487012"},{"key":"e_1_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/3139922"},{"key":"e_1_2_2_82_1","volume-title":"MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with Matrix Container in NVM. In 2020 USENIX Annual Technical Conference (USENIX ATC 20)","author":"Yao Ting","year":"2020","unstructured":"Ting Yao, Yiwen Zhang, Jiguang Wan, Qiu Cui, Liu Tang, Hong Jiang, Changsheng Xie, and Xubin He. 2020. MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with Matrix Container in NVM. In 2020 USENIX Annual Technical Conference (USENIX ATC 20). 17--31."},{"key":"e_1_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196931"},{"key":"e_1_2_2_84_1","volume-title":"Conference on Innovative Data Systems Research.","author":"Zhang Qizhen","year":"2020","unstructured":"Qizhen Zhang, Yifan Cai, Sebastian Angel, Ang Chen, Vincent Liu, and Boon Thau Loo. 2020. Rethinking data management systems for disaggregated data centers. In Conference on Innovative Data Systems Research."},{"key":"e_1_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517856"},{"key":"e_1_2_2_86_1","volume-title":"FPGA-Accelerated Compactions for LSM-based Key-Value Store. In 18th USENIX Conference on File and Storage Technologies (FAST 20)","author":"Zhang Teng","year":"2020","unstructured":"Teng Zhang, Jianying Wang, Xuntao Cheng, Hao Xu, Nanlong Yu, Gui Huang, Tieying Zhang, Dengcheng He, Feifei Li, Wei Cao, et al. 2020. FPGA-Accelerated Compactions for LSM-based Key-Value Store. In 18th USENIX Conference on File and Storage Technologies (FAST 20). 225--237."},{"key":"e_1_2_2_87_1","doi-asserted-by":"publisher","DOI":"10.1109\/ipdps.2014.85"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3654927","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3654927","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T14:42:12Z","timestamp":1755787332000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3654927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,29]]},"references-count":87,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5,29]]}},"alternative-id":["10.1145\/3654927"],"URL":"https:\/\/doi.org\/10.1145\/3654927","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,29]]}}}