Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Nengjie Wang

dblp:221/0692 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0000-4997-0209ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems
flash and SSD
1.012026
HeapKV: Enabling Efficient Garbage Collection for KV-Separated LSM Stores on Modern SSDs · ACM Trans. Archit. Code Optim. 2026
Storage systems › flash and SSD › flash memory management
garbage collection
1.012026
HeapKV: Enabling Efficient Garbage Collection for KV-Separated LSM Stores on Modern SSDs · ACM Trans. Archit. Code Optim. 2026
Storage systems
key-value storage
1.012026
HeapKV: Enabling Efficient Garbage Collection for KV-Separated LSM Stores on Modern SSDs · ACM Trans. Archit. Code Optim. 2026
Storage systems › key-value storage
LSM-tree
1.012026
HeapKV: Enabling Efficient Garbage Collection for KV-Separated LSM Stores on Modern SSDs · ACM Trans. Archit. Code Optim. 2026
Storage systems › flash and SSD
write amplification reduction
1.012026
HeapKV: Enabling Efficient Garbage Collection for KV-Separated LSM Stores on Modern SSDs · ACM Trans. Archit. Code Optim. 2026
Storage systems › key-value storage
key-value separation
0.312026
HeapKV: Enabling Efficient Garbage Collection for KV-Separated LSM Stores on Modern SSDs · ACM Trans. Archit. Code Optim. 2026

Methods — techniques the papers use, named apart from their topics

two-level index · 1.0in-place overwrite · 1.0asynchronous value flushing · 1.0
YearPublicationVenuePosition
2026 HeapKV: Enabling Efficient Garbage Collection for KV-Separated LSM Stores on Modern SSDs
abstract
Key-value (KV) separation has emerged as a pivotal solution to tackle write amplification in LSM-tree-based KV stores (LSM stores). However, the garbage collection (GC) mechanism essential for reclaiming obsolete values introduces substantial overheads: (i) Additional LSM-tree I/O operations degrade foreground performance and cause data inconsistency issues; (ii) Exacerbated write amplification arises from excessive valid data migration in update-intensive workloads. Moreover, existing GC optimization schemes fundamentally struggle to balance space overhead, write amplification, and system performance. In this article, we propose HeapKV, a high-performance KV-separated LSM store that improves GC efficiency through three key technologies: (i) A lightweight two-level index and a global garbage view decouple GC operations of value storage from the LSM-tree, eliminating additional I/O operations; (ii) A novel valid data migration scheme mitigates write amplification during space reclamation by in-place overwrites and logical data copying; (iii) SSD-conscious I/O optimizations featuring asynchronous value flushing, fast read paths and concurrent prefetching for range queries. Extensive experiments demonstrate that HeapKV achieves 40%–7.4× higher throughput under diverse workloads with lower write/space amplification, compared to other state-of-the-art KV-separated LSM stores.
Kai Lu 0002, Yuanhui Zhou, Nengjie Wang, Jiguang Wan 0001, Bisheng Huang
ACM Trans. Archit. Code Optim.3