{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:23Z","timestamp":1750309343460,"version":"3.41.0"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T00:00:00Z","timestamp":1732060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2023YFB4502905"],"award-info":[{"award-number":["2023YFB4502905"]}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["92270202"],"award-info":[{"award-number":["92270202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of Shanghai","award":["23ZR1418300"],"award-info":[{"award-number":["23ZR1418300"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2024,12,31]]},"abstract":"<jats:p>\n            The CPU overhead of the LSM-tree becomes increasingly significant when high-speed storage devices are utilized. In this article, we propose\n            <jats:italic>SuccinctKV<\/jats:italic>\n            , a key-value store based on LSM-tree that is optimized to improve CPU efficiency in mixed workload scenarios. To achieve this,\n            <jats:italic>SuccinctKV<\/jats:italic>\n            reduces the CPU overhead of compaction by writing scan-sorted data directly to the storage device.\n            <jats:italic>SuccinctKV<\/jats:italic>\n            also redesigns the merge-sort operation of the LSM-tree, enhancing CPU locality and reducing the unnecessary CPU overhead of cache accesses and I\/O system calls. Additionally,\n            <jats:italic>SuccinctKV<\/jats:italic>\n            introduces a scheduler to resolve potential bursty I\/O contention by autonomously initiating I\/O requests at appropriate times and quickly relieving I\/O pressure by terminating background I\/O requests. We implement\n            <jats:italic>SuccinctKV<\/jats:italic>\n            on RocksDB and conduct extensive experiments to evaluate our proposed methods. The experimental results demonstrate that, compared with RocksDB,\n            <jats:italic>SuccinctKV<\/jats:italic>\n            achieves a maximum improvement of 2.6x in scan performance and reduces CPU overhead of compaction by up to 89% under mixed workloads.\n          <\/jats:p>","DOI":"10.1145\/3695873","type":"journal-article","created":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T07:58:53Z","timestamp":1726214333000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["SuccinctKV: a CPU-efficient LSM-tree Based KV Store with Scan-based Compaction"],"prefix":"10.1145","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-2398-9185","authenticated-orcid":false,"given":"Yinan","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Data Science and Engineering, ECNU, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-8157-0396","authenticated-orcid":false,"given":"Shun","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Data Science and Engineering, ECNU, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5220-3166","authenticated-orcid":false,"given":"Huiqi","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Data Science and Engineering, ECNU, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5128-8882","authenticated-orcid":false,"given":"Chengcheng","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Data Science and Engineering, ECNU, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7468-7695","authenticated-orcid":false,"given":"Peng","family":"Cai","sequence":"additional","affiliation":[{"name":"School of Data Science and Engineering, ECNU, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8426-9450","authenticated-orcid":false,"given":"Xuan","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Data Science and Engineering, ECNU, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2024,11,20]]},"reference":[{"unstructured":"2024. Cassandra. Retrieved from https:\/\/github.com\/apache\/cassandra","key":"e_1_3_3_2_2"},{"unstructured":"2024. HBase. Retrieved from https:\/\/github.com\/apache\/hbase","key":"e_1_3_3_3_2"},{"unstructured":"2024. LevelDB. Retrieved from https:\/\/github.com\/google\/leveldb","key":"e_1_3_3_4_2"},{"unstructured":"2024. Leveled-Compaction. Retrieved from https:\/\/github.com\/facebook\/rocksdb\/wiki\/Leveled-Compaction","key":"e_1_3_3_5_2"},{"unstructured":"2024. RocksDB. Retrieved from https:\/\/github.com\/facebook\/rocksdb","key":"e_1_3_3_6_2"},{"doi-asserted-by":"publisher","key":"e_1_3_3_7_2","DOI":"10.1145\/2882903.2915231"},{"doi-asserted-by":"publisher","key":"e_1_3_3_8_2","DOI":"10.14778\/3358701.3358707"},{"doi-asserted-by":"publisher","key":"e_1_3_3_9_2","DOI":"10.1145\/3380905"},{"doi-asserted-by":"publisher","key":"e_1_3_3_10_2","DOI":"10.1145\/1365815.1365816"},{"doi-asserted-by":"publisher","key":"e_1_3_3_11_2","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_3_12_2","volume-title":"12th Conference on Innovative Data Systems Research, CIDR 2022, Chaminade, CA, USA, January 9-12, 2022","author":"Crotty Andrew","year":"2022","unstructured":"Andrew Crotty, Viktor Leis, and Andrew Pavlo. 2022. Are you sure you want to use MMAP in your database management system?. In 12th Conference on Innovative Data Systems Research, CIDR 2022, Chaminade, CA, USA, January 9-12, 2022. www.cidrdb.org. Retrieved from https:\/\/www.cidrdb.org\/cidr2022\/papers\/p13-crotty.pdf"},{"doi-asserted-by":"publisher","key":"e_1_3_3_13_2","DOI":"10.1145\/3605573.3605633"},{"doi-asserted-by":"publisher","key":"e_1_3_3_14_2","DOI":"10.1145\/2543697"},{"key":"e_1_3_3_15_2","volume-title":"HBase: The Definitive Guide: Random Access to your Planet-size Data","author":"George Lars","year":"2011","unstructured":"Lars George. 2011. HBase: The Definitive Guide: Random Access to your Planet-size Data. \u201cO\u2019Reilly Media, Inc.\u201d."},{"doi-asserted-by":"publisher","key":"e_1_3_3_16_2","DOI":"10.14778\/3415478.3415535"},{"doi-asserted-by":"publisher","key":"e_1_3_3_17_2","DOI":"10.1145\/3299869.3314041"},{"doi-asserted-by":"publisher","key":"e_1_3_3_18_2","DOI":"10.1145\/3341301.3359628"},{"doi-asserted-by":"publisher","key":"e_1_3_3_19_2","DOI":"10.1145\/3459637.3481913"},{"doi-asserted-by":"publisher","key":"e_1_3_3_20_2","DOI":"10.1007\/s00778-019-00555-y"},{"doi-asserted-by":"publisher","key":"e_1_3_3_21_2","DOI":"10.14778\/2002938.2002940"},{"key":"e_1_3_3_22_2","first-page":"537","volume-title":"2016 USENIX Annual Technical Conference, USENIX ATC 2016, Denver, CO, USA, June 22-24, 2016","author":"Papagiannis Anastasios","year":"2016","unstructured":"Anastasios Papagiannis, Giorgos Saloustros, Pilar Gonz\u00e1lez-F\u00e9rez, and Angelos Bilas. 2016. Tucana: Design and implementation of a fast and efficient scale-up key-value store. In 2016 USENIX Annual Technical Conference, USENIX ATC 2016, Denver, CO, USA, June 22-24, 2016, Ajay Gulati and Hakim Weatherspoon (Eds.). USENIX Association, 537\u2013550. Retrieved from https:\/\/www.usenix.org\/conference\/atc16\/technical-sessions\/presentation\/papagiannis"},{"doi-asserted-by":"publisher","key":"e_1_3_3_23_2","DOI":"10.1145\/3418414"},{"doi-asserted-by":"publisher","key":"e_1_3_3_24_2","DOI":"10.1109\/ICDE55515.2023.00097"},{"doi-asserted-by":"publisher","key":"e_1_3_3_25_2","DOI":"10.1109\/HPCA51647.2021.00033"},{"doi-asserted-by":"publisher","key":"e_1_3_3_26_2","DOI":"10.1145\/3575693.3575722"},{"doi-asserted-by":"publisher","key":"e_1_3_3_27_2","DOI":"10.1145\/3633782"},{"key":"e_1_3_3_28_2","first-page":"307","volume-title":"19th USENIX Conference on File and Storage Technologies (FAST 21)","author":"Wu Kan","year":"2021","unstructured":"Kan Wu, Zhihan Guo, Guanzhou Hu, Kaiwei Tu, Ramnatthan Alagappan, Rathijit Sen, Kwanghyun Park, Andrea C Arpaci-Dusseau, and Remzi H Arpaci-Dusseau. 2021. The storage hierarchy is not a hierarchy: Optimizing caching on modern storage devices with orthus. In 19th USENIX Conference on File and Storage Technologies (FAST 21). 307\u2013323."},{"doi-asserted-by":"publisher","key":"e_1_3_3_29_2","DOI":"10.14778\/3554821.3554830"},{"key":"e_1_3_3_30_2","first-page":"17","volume-title":"2020 USENIX Annual Technical Conference, USENIX ATC 2020, July 15-17, 2020","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 2020, July 15-17, 2020, Ada Gavrilovska and Erez Zadok (Eds.). USENIX Association, 17\u201331. Retrieved from https:\/\/www.usenix.org\/conference\/atc20\/presentation\/yao"},{"doi-asserted-by":"publisher","key":"e_1_3_3_31_2","DOI":"10.1145\/3183713.3196931"},{"key":"e_1_3_3_32_2","first-page":"225","volume-title":"18th USENIX Conference on File and Storage Technologies, FAST 2020, Santa Clara, CA, USA, February 24-27, 2020","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, Zhongdong Huang, and Jianling Sun. 2020. FPGA-Accelerated compactions for LSM-based key-value store. In 18th USENIX Conference on File and Storage Technologies, FAST 2020, Santa Clara, CA, USA, February 24-27, 2020, Sam H. Noh and Brent Welch (Eds.). USENIX Association, 225\u2013237."},{"doi-asserted-by":"publisher","key":"e_1_3_3_33_2","DOI":"10.1109\/ICDE55515.2023.00258"},{"unstructured":"Fuheng Zhao Zach Miller Leron Reznikov Divyakant Agrawal and Amr El Abbadi. 2024. Autumn: A scalable read optimized LSM-tree based Key-Value stores with fast point and range read speed. arXiv:2305.05074 [cs.DB] https:\/\/arxiv.org\/abs\/2305.05074","key":"e_1_3_3_34_2"},{"key":"e_1_3_3_35_2","first-page":"51","volume-title":"19th USENIX Conference on File and Storage Technologies (FAST 21)","author":"Zhong Wenshao","year":"2021","unstructured":"Wenshao Zhong, Chen Chen, Xingbo Wu, and Song Jiang. 2021. \\(\\lbrace\\) REMIX \\(\\rbrace\\) : Efficient range query for \\(\\lbrace\\) LSM-trees \\(\\rbrace\\) . In 19th USENIX Conference on File and Storage Technologies (FAST 21). 51\u201364."}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3695873","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3695873","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:29Z","timestamp":1750291469000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3695873"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,20]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12,31]]}},"alternative-id":["10.1145\/3695873"],"URL":"https:\/\/doi.org\/10.1145\/3695873","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2024,11,20]]},"assertion":[{"value":"2024-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-26","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}