EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

GDH+: A GPGPU-Empowered Gradient Data Hierarchy and Key-Value Separation for Optimizing LSM-Tree-Based KV Stores

Hui Sun, Xiangxiang Jiang, Jinfeng Xu, Enhui Wang, Zheng Fang, Yi Zou, Yinliang Yue, Xiao Qin

ACM Transactions on Architecture and Code Optimization · 30.06.2026 · 23 (2) · 1-27

DOI: 10.1145/3799980 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Architecture and Code Optimization, online erschienen am 25.06.2026. Verfasst von Hui Sun und 7 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 45 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, National Aeronautics and Space Administration, National Highway Traffic Safety Administration.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Förderung

  • National Natural Science Foundation of China
  • National Aeronautics and Space Administration
  • National Highway Traffic Safety Administration

Zitieren

APA

Sun, H., Jiang, X., Xu, J., Wang, E., Fang, Z., Zou, Y., Yue, Y., & Qin, X. (2026). GDH+: A GPGPU-Empowered Gradient Data Hierarchy and Key-Value Separation for Optimizing LSM-Tree-Based KV Stores. ACM Transactions on Architecture and Code Optimization, 23(2), 1-27. https://doi.org/10.1145/3799980

Vancouver

Sun H, Jiang X, Xu J, Wang E, Fang Z, Zou Y, et al. GDH+: A GPGPU-Empowered Gradient Data Hierarchy and Key-Value Separation for Optimizing LSM-Tree-Based KV Stores. ACM Transactions on Architecture and Code Optimization. 2026;23(2):1-27. doi:10.1145/3799980

BibTeX
@article{Sun2026,
  author = {Sun, Hui and Jiang, Xiangxiang and Xu, Jinfeng and Wang, Enhui and Fang, Zheng and Zou, Yi and Yue, Yinliang and Qin, Xiao},
  title = {GDH+: A GPGPU-Empowered Gradient Data Hierarchy and Key-Value Separation for Optimizing LSM-Tree-Based KV Stores},
  journal = {ACM Transactions on Architecture and Code Optimization},
  year = {2026},
  volume = {23},
  number = {2},
  pages = {1--27},
  doi = {10.1145/3799980}
}
Kostenlos starten →