Xuzhen Jiang

dblp:343/4786 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0008-8606-8466ORCID · 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 · 75% Memory systems · 25%
Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems › storage hierarchy
hybrid storage
0.812024
SplitDB: Closing the Performance Gap for LSM-Tree-Based Key-Value Stores · IEEE Trans. Computers 2024
Storage systems
key-value storage
0.812024
SplitDB: Closing the Performance Gap for LSM-Tree-Based Key-Value Stores · IEEE Trans. Computers 2024
Storage systems › key-value storage
LSM-tree
0.812024
SplitDB: Closing the Performance Gap for LSM-Tree-Based Key-Value Stores · IEEE Trans. Computers 2024
Memory systems
non-volatile memory
0.812024
SplitDB: Closing the Performance Gap for LSM-Tree-Based Key-Value Stores · IEEE Trans. Computers 2024

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

split LSM tree · 1.5hot-cold data separation · 1.5
YearPublicationVenuePosition
2024 SplitDB: Closing the Performance Gap for LSM-Tree-Based Key-Value Stores
abstract
Log Structured Merge Tree (LSM tree) serves as the core data storage engine in modern key-value stores. Its adoption is rapidly accelerated with cloud computing and data center development. Acknowledging its widespread use, the LSM tree still faces severe performance issues such as write stall, write amplification, and read inefficiency. This article presents research on improving LSM-tree-based key-value store performance using emerging Non-Volatile Memory (NVM) technology. Our performance diagnosis reveals that the above-mentioned issues result primarily from intensive hot key-value data processing, which is compounded by slow storage devices. To address hotspot bottlenecks, we propose a split log-structured merge tree over hybrid storage by leveraging the intrinsic hot and cold data separation property of the LSM tree. Our approach promotes frequently accessed, small-sized high levels onto fast NVM and offloads the remaining cold, large-sized low levels into slow devices, effectively closing the performance gap for DRAM-disk-based LSM trees. Additionally, we optimize the split LSM tree read and write performance by proposing a variety of novel techniques. We build a hotspot-aware key-value database named SplitDB and perform extensive experiments. Experimental results demonstrate that SplitDB effectively prevents write stalls, achieves a 6-fold write reduction, and improves read throughputs by 3.5 times compared to state-of-the-art key-value databases.
Miao Cai 0001, Xuzhen Jiang, Junru Shen
IEEE Trans. Computers2