{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T16:46:21Z","timestamp":1782405981670,"version":"3.54.5"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T00:00:00Z","timestamp":1782345600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072001 and 62472002"],"award-info":[{"award-number":["62072001 and 62472002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000104","name":"National Aeronautics and Space Administration","doi-asserted-by":"publisher","award":["80NSSC20M0044"],"award-info":[{"award-number":["80NSSC20M0044"]}],"id":[{"id":"10.13039\/100000104","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008760","name":"National Highway Traffic Safety Administration","doi-asserted-by":"publisher","award":["451861-19158"],"award-info":[{"award-number":["451861-19158"]}],"id":[{"id":"10.13039\/100008760","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2026,6,30]]},"abstract":"<jats:p>\n                    The rapid growth of unstructured data has driven the widespread adoption of LSM-tree-based key-value stores (KV stores). The write amplification resulting from compaction in LSM-trees causes a performance bottleneck. Existing solutions attempt to address this issue through key-value separation strategies. However, these studies fail to optimize the memory components of LSM-trees or provide efficient garbage collection (GC) strategies that achieve high performance while minimizing CPU overhead. These limitations motivate us to propose a GPGPU-empowered gradient data hierarchy and key-value separation for optimizing KV stores, named\n                    <jats:italic toggle=\"yes\">\n                      <jats:bold>GDH+<\/jats:bold>\n                    <\/jats:italic>\n                    . We utilize GPGPU acceleration for sorting and flushing operations, optimizing the memory components of the LSM-tree. Additionally, we enhance read performance with an LRU-based memory component that distinguishes between hot and cold data, in combination with an adaptive migration strategy. Furthermore, we propose an in-place GC strategy to reduce CPU overhead while maintaining high performance. GDH+ achieves a 2\u00d7, 1.5\u00d7, and 40% improvement in write performance, read performance, and CPU utilization, respectively, compared to state-of-the-art KV stores.\n                  <\/jats:p>","DOI":"10.1145\/3799980","type":"journal-article","created":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T09:05:54Z","timestamp":1779181554000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["GDH+: A GPGPU-Empowered Gradient Data Hierarchy and Key-Value Separation for Optimizing LSM-Tree-Based KV Stores"],"prefix":"10.1145","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1811-1318","authenticated-orcid":false,"given":"Hui","family":"Sun","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Anhui University","place":["Hefei, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6747-214X","authenticated-orcid":false,"given":"Xiangxiang","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Anhui University","place":["Hefei, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9731-1363","authenticated-orcid":false,"given":"Jinfeng","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Anhui University","place":["Hefei, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5881-4097","authenticated-orcid":false,"given":"Enhui","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Anhui University","place":["Hefei, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-1588-4253","authenticated-orcid":false,"given":"Zheng","family":"Fang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, 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":[[2026,6,25]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1145\/2463676.2465296","volume-title":"Proc. the 2013 ACM SIGMOD Int. Conf. on Management of Data","author":"Armstrong Timothy G.","year":"2013","unstructured":"Timothy G. Armstrong, Vamsi Ponnekanti, Dhruba Borthakur, and Mark Callaghan. 2013. Linkbench: A database benchmark based on the facebook social graph. In Proc. the 2013 ACM SIGMOD Int. Conf. on Management of Data. 1185\u20131196."},{"key":"e_1_3_1_3_2","first-page":"53","volume-title":"Proc. the 12th ACM SIGMETRICS\/PERFORMANCE joint Int. Conf. on Measurement and Modeling of Computer Systems","author":"Atikoglu Berk","year":"2012","unstructured":"Berk Atikoglu, Yuehai Xu, Eitan Frachtenberg, Song Jiang, and Mike Paleczny. 2012. Workload analysis of a large-scale key-value store. In Proc. the 12th ACM SIGMETRICS\/PERFORMANCE joint Int. Conf. on Measurement and Modeling of Computer Systems. 53\u201364."},{"key":"e_1_3_1_4_2","first-page":"209","volume-title":"Proc. the 18th USENIX Conf. on File and Storage Technologies (FAST 20)","author":"Cao Zhichao","year":"2020","unstructured":"Zhichao Cao, Siying Dong, Sagar Vemuri, and David H. C. Du. 2020. Characterizing, modeling, and benchmarking \\(\\lbrace\\) RocksDB \\(\\rbrace\\) \\(\\lbrace\\) Key-Value \\(\\rbrace\\) workloads at facebook. In Proc. the 18th USENIX Conf. on File and Storage Technologies (FAST 20). 209\u2013223."},{"key":"e_1_3_1_5_2","first-page":"722","volume-title":"Proc. the 2019 IEEE 35th Int. Conf. on Data Engineering (ICDE)","author":"Chai Yunpeng","year":"2019","unstructured":"Yunpeng Chai, Yanfeng Chai, Xin Wang, Haocheng Wei, Ning Bao, and Yushi Liang. 2019. LDC: A lower-level driven compaction method to optimize SSD-oriented key-value stores. In Proc. the 2019 IEEE 35th Int. Conf. on Data Engineering (ICDE). 722\u2013733."},{"issue":"6","key":"e_1_3_1_6_2","first-page":"2595","article-title":"Adaptive lower-level driven compaction to optimize LSM-tree key-value stores","volume":"34","author":"Chai Yunpeng","year":"2022","unstructured":"Yunpeng Chai, Yanfeng Chai, Xin Wang, Haocheng Wei, and Yangyang Wang. 2022. Adaptive lower-level driven compaction to optimize LSM-tree key-value stores. IEEE Tran. Knowledge and Data Engineering 34, 6 (2022), 2595\u20132609.","journal-title":"IEEE Tran. Knowledge and Data Engineering"},{"key":"e_1_3_1_7_2","first-page":"1007","volume-title":"Proc. the USENIX Annual Technical Conf.","author":"Chan Helen H. W.","year":"2018","unstructured":"Helen H. W. Chan, Yongkun Li, Patrick P. C. Lee, and Yinlong Xu. 2018. HashKV: Enabling efficient updates in KV storage via hashing. In Proc. the USENIX Annual Technical Conf.1007\u20131019."},{"key":"e_1_3_1_8_2","first-page":"17","volume-title":"Proc. the 19th USENIX Conf. 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. \\(\\lbrace\\) SpanDB \\(\\rbrace\\) : A fast, \\(\\lbrace\\) cost-effective \\(\\rbrace\\) \\(\\lbrace\\) LSM-tree \\(\\rbrace\\) based \\(\\lbrace\\) KV \\(\\rbrace\\) store on hybrid storage. In Proc. the 19th USENIX Conf. on File and Storage Technologies (FAST 21). 17\u201332."},{"key":"e_1_3_1_9_2","first-page":"2207","volume-title":"Proc. the 2023 IEEE 39th Int. Conf. on Data Engineering (ICDE)","author":"Chen Lixiang","year":"2023","unstructured":"Lixiang Chen, Ruihao Chen, Chengcheng Yang, Yuxing Han, Rong Zhang, Xuan Zhou, Peiquan Jin, and Weining Qian. 2023. Workload-aware log-structured merge key-value store for NVM-SSD hybrid storage. In Proc. the 2023 IEEE 39th Int. Conf. on Data Engineering (ICDE). 2207\u20132219."},{"key":"e_1_3_1_10_2","first-page":"1077","volume-title":"Proc. the 25th Int. Conf. on Architectural Support for Programming Languages and Operating Systems","author":"Chen Youmin","year":"2020","unstructured":"Youmin Chen, Youyou Lu, Fan Yang, Qing Wang, Yang Wang, and Jiwu Shu. 2020. Flatstore: An efficient log-structured key-value storage engine for persistent memory. In Proc. the 25th Int. Conf. on Architectural Support for Programming Languages and Operating Systems. 1077\u20131091."},{"issue":"1","key":"e_1_3_1_11_2","first-page":"917","article-title":"SwapKV: A hotness aware in-memory key-value store for hybrid memory systems","volume":"35","author":"Cui Lixiao","year":"2023","unstructured":"Lixiao Cui, Kewen He, Yusen Li, Peng Li, Jiachen Zhang, Gang Wang, and Xiaoguang Liu. 2023. SwapKV: A hotness aware in-memory key-value store for hybrid memory systems. IEEE Trans. Knowl. Data Eng. 35, 1 (2023), 917\u2013930.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_1_12_2","first-page":"155","volume-title":"Proc. the 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20)","author":"Dai Yifan","year":"2020","unstructured":"Yifan Dai, Yien Xu, Aishwarya Ganesan, Ramnatthan Alagappan, Brian Kroth, Andrea Arpaci-Dusseau, and Remzi Arpaci-Dusseau. 2020. From wisckey to bourbon: A learned index for log-structured merge trees. In Proc. the 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20). 155\u2013171."},{"key":"e_1_3_1_13_2","first-page":"674","volume-title":"Proc. the 28th ACM Int. Conf. on Architectural Support for Programming Languages and Operating Systems","author":"Duan Zhuohui","year":"2023","unstructured":"Zhuohui Duan, Jiabo Yao, Haikun Liu, Xiaofei Liao, Hai Jin, and Yu Zhang. 2023. Revisiting log-structured merging for kv stores in hybrid memory systems. In Proc. the 28th ACM Int. Conf. on Architectural Support for Programming Languages and Operating Systems 2 (2023), 674\u2013687."},{"key":"e_1_3_1_14_2","article-title":"Rocksdb","year":"2024","unstructured":"Facebook. 2024. Rocksdb. Retrieved from http:\/\/rocksdb.org\/","journal-title":"Retrieved from http:\/\/rocksdb.org\/"},{"key":"e_1_3_1_15_2","article-title":"LevelDB.","year":"2017","unstructured":"Google. 2017. LevelDB. Retrieved from https:\/\/github.com\/google\/leveldb","journal-title":"Retrieved from https:\/\/github.com\/google\/leveldb"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3579855"},{"key":"e_1_3_1_17_2","article-title":"TiDB Documentation","author":"Inc PingCAP","year":"2024","unstructured":"PingCAP Inc. 2024. TiDB Documentation. Retrieved from https:\/\/download.pingcap.org\/tidb-stable-en-manual.pdf","journal-title":"Retrieved from https:\/\/download.pingcap.org\/tidb-stable-en-manual.pdf"},{"key":"e_1_3_1_18_2","first-page":"1","volume-title":"Proc. the 2023 31st International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","author":"Krishnan R. Madhava","year":"2023","unstructured":"R. Madhava Krishnan, Naga Sanjana Bikonda, Shashwat Jain, Wook-Hee Kim, Hamid Hadian, Vishwanath Maram, and Changwoo Min. 2023. Retina: Cross-layered key-value store for computational storage. In Proc. the 2023 31st International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS). 1\u20138."},{"key":"e_1_3_1_19_2","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1145\/3341301.3359628","volume-title":"Proc. the 27th ACM Symposium on Operating Systems Principles","author":"Lepers Baptiste","year":"2019","unstructured":"Baptiste Lepers, Oana Balmau, Karan Gupta, and Willy Zwaenepoel. 2019. Kvell: The design and implementation of a fast persistent key-value store. In Proc. the 27th ACM Symposium on Operating Systems Principles. 447\u2013461."},{"key":"e_1_3_1_20_2","first-page":"673","volume-title":"Proc. the 2021 USENIX Annual Technical Conf.","author":"Li Yongkun","year":"2021","unstructured":"Yongkun Li, Zhen Liu, Patrick P. C. Lee, Jiayu Wu, Yinlong Xu, Yi Wu, Liu Tang, Qi Liu, and Qiu Cui. 2021. Differentiated key-value storage management for balanced I\/O performance. In Proc. the 2021 USENIX Annual Technical Conf.673\u2013687."},{"key":"e_1_3_1_21_2","article-title":"HPDK: A hybrid PM-DRAM key-value store for high I\/O throughput","author":"Liu Bihui","year":"2024","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 Trans. Comput. 73, 6 (2024), 1575\u20131587.","journal-title":"IEEE Trans. Comput."},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3033273"},{"key":"e_1_3_1_23_2","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1145\/3132747.3132765","volume-title":"Proc. the Symp. Operating Systems Principles","author":"Raju Pandian","year":"2017","unstructured":"Pandian Raju, Rohan Kadekodi, Vijay Chidambaram, and Ittai Abraham. 2017. PebblesDB: Building key-value stores using fragmented log-structured merge trees. In Proc. the Symp. Operating Systems Principles. 497\u2013514."},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335449"},{"key":"e_1_3_1_25_2","unstructured":"Adam Wright. 2024. Worldwide global datasphere and global storagesphere structured and unstructured data forecast. 2024\u20132028. Retrieved from https:\/\/techcontentwave.com\/files\/1763389937_64b594fd4f7f5607256a.pdf"},{"key":"e_1_3_1_26_2","first-page":"588","volume-title":"Proc. the 28th ACM Int. Conf. on Architectural Support for Programming Languages and Operating Systems","author":"Song Yongju","year":"2023","unstructured":"Yongju Song, Wook-Hee Kim, Sumit Kumar Monga, Changwoo Min, and Young Ik Eom. 2023. Prism: Optimizing key-value store for modern heterogeneous storage devices. In Proc. the 28th ACM Int. Conf. on Architectural Support for Programming Languages and Operating Systems 2 (2023), 588\u2013602."},{"key":"e_1_3_1_27_2","doi-asserted-by":"crossref","unstructured":"Hui Sun Wei Liu Jianzhong Huang and Weisong Shi. 2019. Collaborative compaction optimization system using near-data processing for LSM-tree-based key-value stores. J. Parallel and Distrib. Comput. 131 C (2019) 29\u201343.","DOI":"10.1016\/j.jpdc.2019.04.011"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3626097"},{"key":"e_1_3_1_29_2","doi-asserted-by":"crossref","unstructured":"Hui Sun Qiang Wang Yin Liang Yue Yuhong Zhao and Song Fu. 2022. A storage computing architecture with multiple NDP devices for accelerating compaction performance in LSM-tree based KV stores. Journal of Systems Architecture 130 C (2022) 102681.","DOI":"10.1016\/j.sysarc.2022.102681"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3633782"},{"key":"e_1_3_1_31_2","doi-asserted-by":"crossref","unstructured":"Hui Sun Chao Zhao Yinliang Yue and Xiao Qin. 2025. ProckStore: An NDP-empowered key-value store with asynchronous and multi-threaded compaction scheme for optimized performance. Journal of Systems Architecture 160 C (2025) 103342.","DOI":"10.1016\/j.sysarc.2025.103342"},{"key":"e_1_3_1_32_2","first-page":"1261","volume-title":"Proc. the IEEE Int. Conf. Data Engineering","author":"Sun Xuan","year":"2020","unstructured":"Xuan Sun, Jinghuan Yu, Zimeng Zhou, and Chun Jason Xue. 2020. FPGA-based compaction engine for accelerating LSM-tree key-value stores. In Proc. the IEEE Int. Conf. Data Engineering. 1261\u20131272."},{"key":"e_1_3_1_33_2","first-page":"30","volume-title":"Proc. the 28th ACM Int. Conf. on Architectural Support for Programming Languages and Operating Systems","author":"Sutherland Mark","year":"2022","unstructured":"Mark Sutherland, Babak Falsafi, and Alexandros Daglis. 2022. Cooperative concurrency control for write-intensive key-value workloads. In Proc. the 28th ACM Int. Conf. on Architectural Support for Programming Languages and Operating Systems 1 (2022), 30\u201346."},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2022.3149003"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.14778\/3547305.3547307"},{"key":"e_1_3_1_36_2","first-page":"773","volume-title":"Proc. the 2022 USENIX Annual Technical Conf. (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 log-structured key-value store on persistent memory. In Proc. the 2022 USENIX Annual Technical Conf. (USENIX ATC 22). 773\u2013788."},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3626736"},{"key":"e_1_3_1_38_2","first-page":"603","volume-title":"Proc. the 2020 USENIX Annual Technical Conf. (USENIX ATC 20)","author":"Wu Fenggang","year":"2020","unstructured":"Fenggang Wu, Ming-Hong Yang, Baoquan Zhang, and David H. C. Du. 2020. AC-Key: Adaptive caching for LSM-based key-value stores. In Proc. the 2020 USENIX Annual Technical Conf. (USENIX ATC 20). 603\u2013615."},{"key":"e_1_3_1_39_2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1145\/3472883.3487012","volume-title":"Proc. the ACM Symposium on Cloud Computing","author":"Xanthakis Giorgos","year":"2021","unstructured":"Giorgos Xanthakis, Giorgos Saloustros, Nikos Batsaras, Anastasios Papagiannis, and Angelos Bilas. 2021. Parallax: Hybrid key-value placement in LSM-based key-value stores. In Proc. the ACM Symposium on Cloud Computing. 305\u2013318."},{"key":"e_1_3_1_40_2","unstructured":"Peng Xu Jiguang Wan Ping Huang Xiaogang Yang Chenlei Tang Fei Wu and Changsheng Xie. 2020. LUDA: Boost LSM key value store compactions with GPUs. Retrieved from https:\/\/arxiv.org\/pdf\/2004.03054"},{"key":"e_1_3_1_41_2","first-page":"191","volume-title":"Proc. the 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20)","author":"Yang Juncheng","year":"2020","unstructured":"Juncheng Yang, Yao Yue, and K. V. Rashmi. 2020. A large scale analysis of hundreds of in-memory cache clusters at Twitter. In Proc. the 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20). 191\u2013208."},{"key":"e_1_3_1_42_2","first-page":"17","volume-title":"Proc. the USENIX Annual Technical Conf.","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 Proc. the USENIX Annual Technical Conf.17\u201331."},{"key":"e_1_3_1_43_2","first-page":"313","volume-title":"Proc. the 2020 IEEE 36th Int. Conf. on Data Engineering (ICDE)","author":"Zhang Qiang","year":"2020","unstructured":"Qiang Zhang, Yongkun Li, Patrick P. C. Lee, Yinlong Xu, Qiu Cui, and Liu Tang. 2020. UniKV: Toward high-performance and scalable KV storage in mixed workloads via unified indexing. In Proc. the 2020 IEEE 36th Int. Conf. on Data Engineering (ICDE). 313\u2013324."},{"key":"e_1_3_1_44_2","first-page":"225","volume-title":"Proc. the USENIX Conf. File and Storage Technologies","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 Proc. the USENIX Conf. File and Storage Technologies. 225\u2013237."},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.85"},{"key":"e_1_3_1_46_2","volume-title":"Proc. the 38th Int. Conf. on Massive Storage Systems and Technology","author":"Zhou Hao","year":"2024","unstructured":"Hao Zhou, Yuanhui Chen, Lixiao Cui, Gang Wang, and Xiaoguang Liu. 2024. A GPU-accelerated compaction strategy for LSM-based key-value store system. In Proc. the 38th Int. Conf. on Massive Storage Systems and Technology."}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3799980","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T15:53:18Z","timestamp":1782402798000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3799980"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,25]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6,30]]}},"alternative-id":["10.1145\/3799980"],"URL":"https:\/\/doi.org\/10.1145\/3799980","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,25]]},"assertion":[{"value":"2025-01-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-02","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-06-25","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}