{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:36:05Z","timestamp":1783035365089,"version":"3.54.6"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T00:00:00Z","timestamp":1758153600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62472002 and 62072001"],"award-info":[{"award-number":["62472002 and 62072001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"crossref","award":["IIS-1618669 and OAC-1642133"],"award-info":[{"award-number":["IIS-1618669 and OAC-1642133"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000104","name":"National Aeronautics and Space Administration","doi-asserted-by":"crossref","award":["80NSSC20M0044"],"award-info":[{"award-number":["80NSSC20M0044"]}],"id":[{"id":"10.13039\/100000104","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100008760","name":"National Highway Traffic Safety Administration","doi-asserted-by":"crossref","award":["451861-19158"],"award-info":[{"award-number":["451861-19158"]}],"id":[{"id":"10.13039\/100008760","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Wright Media, LLC","award":["240250 and 240311"],"award-info":[{"award-number":["240250 and 240311"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2025,9,30]]},"abstract":"<jats:p>\n            Log-Structured Merge tree-based key-value (KV) stores, like LevelDB and RocksDB, are extensively applied in large-scale data storage systems. This design excels in write-intensive environments by converting random writes into sequential append operations. Despite its advantages, KV stores struggle with real-world workloads where most updates in KV pairs are infrequent. The compaction process and hierarchical data organization result in high write and read amplification. To mitigate these issues, we propose\n            <jats:italic toggle=\"yes\">HAKV<\/jats:italic>\n            \u2013 a hotness-aware zone management approach to optimizing performance of KV stores. HAKV first separates hot KV pairs from cold KV pairs, storing hot KV pairs in dedicated zones within persistent memory (PM), enabling centralized and lightweight compaction. Second, we propose a storage zone structure in PM to achieve space optimization for cold KV pairs. Third, to bolster cache hit ratio in PM, we provide a hierarchical data framework for hot KV pairs \u2013 and a recycling strategy for invalid hot KV pairs in a zone to enhance the space utilization of PM for hot KV pairs. Finally, we design a dynamic window-based adaptive adjustment mechanism for zone pool in PM to optimize the space utilization. Thus, HAKV significantly reduces write amplification while boosting overall read and write performance. The experimental results demonstrate that HAKV achieves write amplification reduction by up to 92.3%, 79.2%, 90.2%, 41.1%, 80.6%, and 62.4% compared with LevelDB, RocksDB, NoveLSM, LightKV, Wisckey, and UniKV, respectively, with average reduction rates of 89.6%, 74.4%, 84.9% 32.3%, 63.7%, and 42.5%. Furthermore, HAKV boosts random write performance by up to 54.2\u00d7, 51.5\u00d7, 44.2\u00d7, 4.3\u00d7, 3.1\u00d7, and 4.3\u00d7, respectively\u2014and the average improvement reaches 25.8\u00d7, 20.9\u00d7, 23.9\u00d7, 2.7\u00d7, 2.5\u00d7, and 3.4\u00d7.\n          <\/jats:p>","DOI":"10.1145\/3747848","type":"journal-article","created":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T11:13:49Z","timestamp":1753182829000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["HAKV: A Hotness-Aware Zone Management Approach to Optimizing Performance of LSM-tree-based Key-Value Stores"],"prefix":"10.1145","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1811-1318","authenticated-orcid":false,"given":"Hui","family":"Sun","sequence":"first","affiliation":[{"name":"Computer Science and Technology, Anhui University","place":["Hefei, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-3751-5365","authenticated-orcid":false,"given":"Qianli","family":"Yue","sequence":"additional","affiliation":[{"name":"Anhui University","place":["Hefei, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-2228-5929","authenticated-orcid":false,"given":"Guanzhong","family":"Chen","sequence":"additional","affiliation":[{"name":"Anhui University","place":["Hefei, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1460-322X","authenticated-orcid":false,"given":"Yi","family":"Zou","sequence":"additional","affiliation":[{"name":"Columbus State University","place":["Columbus, United States"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8417-2234","authenticated-orcid":false,"given":"Yinliang","family":"Yue","sequence":"additional","affiliation":[{"name":"Zhongguancun Laboratory","place":["Beijing, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8345-3587","authenticated-orcid":false,"given":"Xiao","family":"Qin","sequence":"additional","affiliation":[{"name":"Computer Science, Auburn University","place":["Auburn, United States"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,9,18]]},"reference":[{"key":"e_1_3_1_2_2","unstructured":"Luis Barba and Pat Morin. 2014. Top-down skiplists. arXiv:1407.7917. Retrieved from https:\/\/arxiv.org\/abs\/1407.7917"},{"key":"e_1_3_1_3_2","first-page":"209","volume-title":"18th USENIX Conference on File and Storage Technologies (FAST 20)","author":"Cao Zhichao","year":"2020","unstructured":"Zhichao Cao, Siying Dong, Sagar Vemuri, and David HC Du. 2020. Characterizing, modeling, and benchmarking \\(\\lbrace\\) RocksDB \\(\\rbrace\\) \\(\\lbrace\\) Key-Value \\(\\rbrace\\) workloads at facebook. In 18th USENIX Conference on File and Storage Technologies (FAST 20). 209\u2013223."},{"issue":"6","key":"e_1_3_1_4_2","first-page":"2595","article-title":"Adaptive lower-level driven compaction to optimize LSM-tree key-value stores","volume":"34","author":"Chai Yunpeng","year":"2020","unstructured":"Yunpeng Chai, Yanfeng Chai, Xin Wang, Haocheng Wei, and Yangyang Wang. 2020. Adaptive lower-level driven compaction to optimize LSM-tree key-value stores. IEEE Transactions on Knowledge and Data Engineering 34, 6 (2020), 2595\u20132609.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_1_5_2","first-page":"1007","volume-title":"2018 USENIX Annual Technical Conference (USENIX ATC 18)","author":"Chan Helen HW","year":"2018","unstructured":"Helen HW Chan, Chieh-Jan Mike Liang, Yongkun Li, Wenjia He, Patrick PC Lee, Lianjie Zhu, Yaozu Dong, Yinlong Xu, Yu Xu, Jin Jiang, et\u00a0al. 2018. \\(\\lbrace\\) HashKV \\(\\rbrace\\) : Enabling efficient updates in \\(\\lbrace\\) KV \\(\\rbrace\\) storage via hashing. In 2018 USENIX Annual Technical Conference (USENIX ATC 18). 1007\u20131019."},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378515"},{"key":"e_1_3_1_7_2","first-page":"799","volume-title":"2020 USENIX Annual Technical Conference (USENIX ATC 20)","author":"Chen Zhangyu","year":"2020","unstructured":"Zhangyu Chen, Yu Hua, Bo Ding, and Pengfei Zuo. 2020. Lock-free concurrent level hashing for persistent memory. In 2020 USENIX Annual Technical Conference (USENIX ATC 20). 799\u2013812."},{"key":"e_1_3_1_8_2","first-page":"49","volume-title":"2020 USENIX Annual Technical Conference (USENIX ATC 20)","author":"Conway Alexander","year":"2020","unstructured":"Alexander Conway, Abhishek Gupta, Vijay Chidambaram, Martin Farach-Colton, Richard Spillane, Amy Tai, and Rob Johnson. 2020. \\(\\lbrace\\) SplinterDB \\(\\rbrace\\) : Closing the bandwidth gap for \\(\\lbrace\\) NVMe \\(\\rbrace\\) \\(\\lbrace\\) Key-Value \\(\\rbrace\\) stores. In 2020 USENIX Annual Technical Conference (USENIX ATC 20). 49\u201363."},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/2025\/1\/012093"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3575693.3575715"},{"key":"e_1_3_1_11_2","unstructured":"Facebook. 2019. Rocksdb a persistent key-value store for fast storage environments. Retrieved January 15 2025 from http:\/\/rocksdb.org\/"},{"key":"e_1_3_1_12_2","volume-title":"Proc. 36th International Conference on Massive Storage Systems and Technology (MSST\u201920)","author":"Han Shukai","year":"2020","unstructured":"Shukai Han, Dejun Jiang, and Jin Xiong. 2020. LightKV: A cross media key value store with persistent memory to cut long tail latency. In Proc. 36th International Conference on Massive Storage Systems and Technology (MSST\u201920)."},{"key":"e_1_3_1_13_2","first-page":"199","volume-title":"12th USENIX Conference on File and Storage Technologies (FAST 14)","author":"Harter Tyler","year":"2014","unstructured":"Tyler Harter, Dhruba Borthakur, Siying Dong, Amitanand Aiyer, Liyin Tang, Andrea C. Arpaci-Dusseau, and Remzi H. Arpaci-Dusseau. 2014. Analysis of \\(\\lbrace\\) HDFS \\(\\rbrace\\) under \\(\\lbrace\\) HBase \\(\\rbrace\\) : A facebook messages case study. In 12th USENIX Conference on File and Storage Technologies (FAST 14). 199\u2013212."},{"key":"e_1_3_1_14_2","first-page":"967","volume-title":"2018 USENIX Annual Technical Conference (USENIX ATC 18)","author":"Huang Yihe","year":"2018","unstructured":"Yihe Huang, Matej Pavlovic, Virendra Marathe, Margo Seltzer, Tim Harris, and Steve Byan. 2018. Closing the performance gap between volatile and persistent \\(\\lbrace\\) Key-value \\(\\rbrace\\) stores using \\(\\lbrace\\) cross-referencing \\(\\rbrace\\) logs. In 2018 USENIX Annual Technical Conference (USENIX ATC 18). 967\u2013979."},{"key":"e_1_3_1_15_2","unstructured":"IDC. 2023. Idc innovators: Privacy-preserving computation. Retrieved January 15 2025 from https:\/\/www.idc.com\/getdoc.jsp?containerId=prCHC51469323"},{"key":"e_1_3_1_16_2","first-page":"191","volume-title":"17th USENIX Conference on File and Storage Technologies (FAST 19)","author":"Kaiyrakhmet Olzhas","year":"2019","unstructured":"Olzhas Kaiyrakhmet, Songyi Lee, Beomseok Nam, Sam H. Noh, and Young-ri Choi. 2019. \\(\\lbrace\\) SLM-DB \\(\\rbrace\\) : \\(\\lbrace\\) Single-level \\(\\rbrace\\) \\(\\lbrace\\) key-value \\(\\rbrace\\) store with persistent memory. In 17th USENIX Conference on File and Storage Technologies (FAST 19). 191\u2013205."},{"key":"e_1_3_1_17_2","first-page":"993","volume-title":"2018 USENIX Annual Technical Conference (USENIX ATC 18)","author":"Kannan Sudarsun","year":"2018","unstructured":"Sudarsun Kannan, Nitish Bhat, Ada Gavrilovska, Andrea Arpaci-Dusseau, and Remzi Arpaci-Dusseau. 2018. Redesigning \\(\\lbrace\\) LSMs \\(\\rbrace\\) for nonvolatile memory with \\(\\lbrace\\) NoveLSM \\(\\rbrace\\) . In 2018 USENIX Annual Technical Conference (USENIX ATC 18). 993\u20131005."},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477132.3483589"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359628"},{"key":"e_1_3_1_21_2","unstructured":"Google. 2017. LevelDB LevelDB is a fast key-value storage. Retrieved January 15 2025 from https:\/\/github.com\/google\/leveldb"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","unstructured":"Jiazheng Zhang and Shouwei Li. 2023. Blockchain-Based Prefix-Hash and Improved Red-Black Tree Index Mechanism for Data Retrieving in Industry 4.0. Retrieved January 15 2025 from 10.2139\/ssrn.4655411","DOI":"10.2139\/ssrn.4655411"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3387902.3392621"},{"key":"e_1_3_1_24_2","first-page":"673","volume-title":"2021 USENIX Annual Technical Conference (USENIX ATC 21)","author":"Li Yongkun","year":"2021","unstructured":"Yongkun Li, Zhen Liu, Patrick PC Lee, Jiayu Wu, Yinlong Xu, Yi Wu, Liu Tang, Qi Liu, and Qiu Cui. 2021. Differentiated \\(\\lbrace\\) key-value \\(\\rbrace\\) storage management for balanced \\(\\lbrace\\) I\/O \\(\\rbrace\\) performance. In 2021 USENIX Annual Technical Conference (USENIX ATC 21). 673\u2013687."},{"key":"e_1_3_1_25_2","doi-asserted-by":"crossref","unstructured":"Bihui Liu Zhenyu Ye Qiao Hu Yupeng Hu Yuchong Hu Yang Xu and Keqin Li. 2024. HPDK: A hybrid PM-DRAM key-value store for high I\/O throughput. IEEE Transactions on Computers 73 6 (2024) 1575\u20131587.","DOI":"10.1109\/TC.2024.3377914"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3033273"},{"key":"e_1_3_1_27_2","first-page":"31","volume-title":"17th USENIX Conference on File and Storage Technologies (FAST 19)","author":"Nam Moohyeon","year":"2019","unstructured":"Moohyeon Nam, Hokeun Cha, Young-ri Choi, Sam H. Noh, and Beomseok Nam. 2019. \\(\\lbrace\\) Write-Optimized \\(\\rbrace\\) dynamic hashing for persistent memory. In 17th USENIX Conference on File and Storage Technologies (FAST 19). 31\u201344."},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132765"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.14778\/3151106.3151108"},{"key":"e_1_3_1_32_2","doi-asserted-by":"crossref","unstructured":"Hui Sun Guanzhong Chen Yinliang Yue and Xiao Qin. 2023. Improving LSM-Tree based key-value stores with fine-grained compaction mechanism. IEEE Transactions on Cloud Computing 11 4 (2023) 3778\u20133796.","DOI":"10.1109\/TCC.2023.3329646"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2022.3149003"},{"key":"e_1_3_1_34_2","first-page":"773","volume-title":"2022 USENIX Annual Technical Conference (USENIX ATC 22)","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 \\(\\lbrace\\) log-structured \\(\\rbrace\\) \\(\\lbrace\\) Key-Value \\(\\rbrace\\) store on persistent memory. In 2022 USENIX Annual Technical Conference (USENIX ATC 22). 773\u2013788."},{"key":"e_1_3_1_35_2","first-page":"817","volume-title":"2023 USENIX Annual Technical Conference (USENIX ATC 23)","author":"Wang Jing","year":"2023","unstructured":"Jing Wang, Youyou Lu, Qing Wang, Yuhao Zhang, and Jiwu Shu. 2023. Revisiting secondary indexing in \\(\\lbrace\\) LSM-based \\(\\rbrace\\) storage systems with persistent memory. In 2023 USENIX Annual Technical Conference (USENIX ATC 23). 817\u2013832."},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00279"},{"key":"e_1_3_1_37_2","first-page":"349","volume-title":"2017 USENIX Annual Technical Conference (USENIX ATC 17)","author":"Xia Fei","year":"2017","unstructured":"Fei Xia, Dejun Jiang, Jin Xiong, and Ninghui Sun. 2017. \\(\\lbrace\\) HiKV \\(\\rbrace\\) : A hybrid index \\(\\lbrace\\) key-value \\(\\rbrace\\) store for \\(\\lbrace\\) DRAM-NVM \\(\\rbrace\\) memory systems. In 2017 USENIX Annual Technical Conference (USENIX ATC 17). 349\u2013362."},{"key":"e_1_3_1_38_2","unstructured":"Yahoo! 2019. YCSB-C a C++ version of YCSB. Retrieved January 15 2025 from https:\/\/github.com\/brianfrankcooper\/YCSB"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3468521"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3603165.3607392"},{"key":"e_1_3_1_41_2","first-page":"17","volume-title":"2020 USENIX Annual Technical Conference","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. 17\u201331."},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3017651"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3453300"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00034"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447786.3456237"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372717"},{"key":"e_1_3_1_47_2","first-page":"461","volume-title":"13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18)","author":"Zuo Pengfei","year":"2018","unstructured":"Pengfei Zuo, Yu Hua, and Jie Wu. 2018. \\(\\lbrace\\) Write-optimized \\(\\rbrace\\) and \\(\\lbrace\\) high-performance \\(\\rbrace\\) hashing index scheme for persistent memory. In 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18). 461\u2013476."}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3747848","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3747848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T20:45:51Z","timestamp":1758228351000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3747848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,18]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9,30]]}},"alternative-id":["10.1145\/3747848"],"URL":"https:\/\/doi.org\/10.1145\/3747848","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,18]]},"assertion":[{"value":"2025-02-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-30","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-09-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}