Demo Data from EDBT 2026 / reviewers in the wild / expert
Chi-Liang Qiu
dblp:431/2814
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0000-0953-3610ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-author · 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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems
flash and SSD |
1.0 | 1 | 2026 | Unlocking SSD Parallelism: A High-Performance B$^\epsilon$ε-Tree Framework for OCSSDs · IEEE Trans. Parallel Distributed Syst. 2026 |
Storage systems
key-value storage |
1.0 | 1 | 2026 | Unlocking SSD Parallelism: A High-Performance B$^\epsilon$ε-Tree Framework for OCSSDs · IEEE Trans. Parallel Distributed Syst. 2026 |
Storage systems › flash and SSD › SSD architecture
open-channel SSD |
1.0 | 1 | 2026 | Unlocking SSD Parallelism: A High-Performance B$^\epsilon$ε-Tree Framework for OCSSDs · IEEE Trans. Parallel Distributed Syst. 2026 |
Storage systems › flash and SSD › SSD architecture
SSD parallelism |
1.0 | 1 | 2026 | Unlocking SSD Parallelism: A High-Performance B$^\epsilon$ε-Tree Framework for OCSSDs · IEEE Trans. Parallel Distributed Syst. 2026 |
Methods — techniques the papers use, named apart from their topics
hardware-software co-design · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Unlocking SSD Parallelism: A High-Performance B$^\epsilon$ε-Tree Framework for OCSSDsabstractKey-value stores have become pivotal in the management of data for modern large-scale data centers. Unlike the log-structured merge (LSM) tree, the Bε tree enhances read performance by mitigating read amplification and by leveraging the temporal locality of keys in the buffer area of its internal nodes. However, its inability to fully harness the high parallelism of solid-state drives (SSDs) limits its effectiveness. This limitation stems from traditional SSDs concealing their parallelism from the host system. The advent of open-channel SSDs (OCSSDs), which expose the physical data storage layout to the host system, provides a unique opportunity to leverage SSDs' inherent high parallelism in read/write operations. This paper introduces a novel high-parallelism Bε (HP-Bε) indexing scheme designed for OCSSDs. The scheme specifically addresses conflicts between parallel units (PUs) during read operations, substantially improving read performance of the Bε indexing approach. To our knowledge, this is the first study to adapt the Bε indexing scheme for the OCSSD architecture, and our experimental results are promising. Chi-Liang Qiu, Yao-Yu Liao, Tseng-Yi Chen, Yuan-Hao Chang 0001 |
IEEE Trans. Parallel Distributed Syst. | 1 |