Zheng Fang

Zheng Fang

Auto-generated profile, based on publicly available information

Zheng Fang

School of Computer Science and Technology, Anhui University

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 June 2026 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
HSHui Sun
Hui Sun
XJXiangxiang Jiang
Xiangxiang Jiang
JXJinfeng Xu
Jinfeng Xu
EWEnhui Wang
Enhui Wang
ZFZheng Fang
Zheng Fang
Xiao QinXiao Qin
Xiao Qin
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 GDH+ . 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×, 1.5×, and 40% improvement in write performance, read performance, and CPU utilization, respectively, compared to state-of-the-art KV stores.