VLDB 2026 Research / reviewers in the wild / expert
Yiqin Xiong
dblp:356/8135
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2024
0009-0003-2113-7014ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 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 · 81% Hardware accelerators and domain-specific architectures · 19% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems › key-value storage
compaction |
0.8 | 1 | 2024 | D2Comp: Efficient Offload of LSM-tree Compaction with Data Processing Units on Disaggregated Storage · ACM Trans. Archit. Code Optim. 2024 |
Hardware accelerators and domain-specific architectures › domain-specific accelerator › data processing accelerator
data processing unit |
0.8 | 1 | 2024 | D2Comp: Efficient Offload of LSM-tree Compaction with Data Processing Units on Disaggregated Storage · ACM Trans. Archit. Code Optim. 2024 |
Storage systems
key-value storage |
0.8 | 1 | 2024 | D2Comp: Efficient Offload of LSM-tree Compaction with Data Processing Units on Disaggregated Storage · ACM Trans. Archit. Code Optim. 2024 |
Storage systems › key-value storage
LSM-tree |
0.8 | 1 | 2024 | D2Comp: Efficient Offload of LSM-tree Compaction with Data Processing Units on Disaggregated Storage · ACM Trans. Archit. Code Optim. 2024 |
Storage systems › computational storage
storage offload |
0.8 | 1 | 2024 | D2Comp: Efficient Offload of LSM-tree Compaction with Data Processing Units on Disaggregated Storage · ACM Trans. Archit. Code Optim. 2024 |
Storage systems › distributed storage
disaggregated storage |
0.2 | 1 | 2024 | D2Comp: Efficient Offload of LSM-tree Compaction with Data Processing Units on Disaggregated Storage · ACM Trans. Archit. Code Optim. 2024 |
Methods — techniques the papers use, named apart from their topics
hardware compression acceleration · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | D2Comp: Efficient Offload of LSM-tree Compaction with Data Processing Units on Disaggregated StorageabstractLSM-based key-value stores suffer from sub-optimal performance due to their slow and heavy background compactions. The compaction brings severe CPU and network overhead on high-speed disaggregated storage. This article further reveals that data-intensive compression in compaction consumes a significant portion of CPU power. Moreover, the multi-threaded compactions cause substantial CPU contention and network traffic during high-load periods. Based on the above observations, we propose fine-grained dynamical compaction offloading by leveraging the modern Data Processing Unit (DPU) to alleviate the CPU and network overhead. To achieve this, we first customized a file system to enable efficient data access for DPU. We then leverage the Arm cores on the DPU to meet the burst CPU and network requirements to reduce resource contention and data movement. We further employ dedicated hardware-based accelerators on the DPU to speed up the compression in compactions. We integrate our DPU-offloaded compaction with RocksDB and evaluate it with NVIDIA’s latest Bluefield-2 DPU on a real system. The evaluation shows that the DPU is an effective solution to solve the CPU bottleneck and reduce data traffic of compaction. The results show that compaction performance is accelerated by 2.86 to 4.03 times, system write and read throughput is improved by up to 3.2 times and 1.4 times respectively, and host CPU contention and network traffic are effectively reduced compared to the fine-tuned CPU-only baseline. Chen Ding 0012, Jian Zhou 0004, Kai Lu 0002, Sicen Li, Yiqin Xiong, Jiguang Wan 0001 |
ACM Trans. Archit. Code Optim. | 5 |
| 2023 | DComp: Efficient Offload of LSM-tree Compaction with Data Processing UnitsabstractLSM-based Key-value stores suffer from sub-optimal performance due to their slow and heavy background compactions. The compaction overhead shifts to the CPU as the storage performance continuously increases. This paper further reveals that data-intensive compression in compaction consumes a significant portion of CPU power. Moreover, the multi-threaded compactions cause substantial CPU contention during high-load periods. Based on the above observations, we propose fine-grained dynamical compaction offloading by leveraging the modern Data Processing Unit (DPU) to alleviate the CPU overhead. To achieve this, we first employ dedicated hardware-based accelerators on the DPU to speed up the compression in compactions. We then leverage the Arm cores on the DPU to meet the burst CPU requirements to reduce resource contention. We integrate our DPU-offloaded compaction with RocksDB and evaluate it with NVIDIA’s latest Bluefield-2 DPU on a real system. The evaluation shows that the DPU is an effective solution to solve the CPU bottleneck of compaction. The results show that compaction performance is accelerated by 2.86 to 4.03 times, system write and read throughput is improved by up to 3.2 times and 1.4 times respectively, and host CPU contention is effectively reduced compared to the fine-tuned CPU-only baseline. Chen Ding 0012, Jian Zhou 0004, Jiguang Wan 0001, Yiqin Xiong, Sicen Li, Shuning Chen, Kai Lu 0002 |
ICPP | 4 |