Demo Data from EDBT 2026 / reviewers in the wild / expert
Canfang Shang
dblp:295/9113
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 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% | |
| Databases, data mining, and information retrieval
1 paper |
Transaction processing and concurrency control · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems › key-value storage
LSM-tree |
0.5 | 1 | 2021 | Revisiting the Design of LSM-tree Based OLTP Storage Engine with Persistent Memory · Proc. VLDB Endow. 2021 |
Storage systems › non-volatile memory storage
persistent memory systems |
0.5 | 1 | 2021 | Revisiting the Design of LSM-tree Based OLTP Storage Engine with Persistent Memory · Proc. VLDB Endow. 2021 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Revisiting the Design of LSM-tree Based OLTP Storage Engine with Persistent MemoryabstractThe recent byte-addressable and large-capacity commercialized persistent memory (PM) is promising to drive database as a service (DBaaS) into unchartered territories. This paper investigates how to leverage PMs to revisit the conventional LSM-tree based OLTP storage engines designed for DRAM-SSD hierarchy for DBaaS instances. Specifically we (1) propose a light-weight PM allocator named Hal-loc customized for LSM-tree, (2) build a high-performance Semi-persistent Memtable utilizing the persistent in-memory writes of PM, (3) design a concurrent commit algorithm named Reorder Ring to aschieve log-free transaction processing for OLTP workloads and (4) present a Global Index as the new globally sorted persistent level with non-blocking in-memory compaction. The design of Reorder Ring and Semi-persistent Memtable achieves fast writes without synchronized logging overheads and achieves near instant recovery time. Moreover, the design of Semi-persistent Memtable and Global Index with in-memory compaction enables the byte-addressable persistent levels in PM, which significantly reduces the read and write amplification as well as the background compaction overheads. The overall evaluation shows that the performance of our proposal over PM-SSD hierarchy outperforms the baseline by up to 3.8x in YCSB benchmark and by 2x in TPC-C benchmark. Baoyue Yan, Xuntao Cheng, Bo Jiang 0001, Shibin Chen, Canfang Shang, Kenry Huang, Xinjun Yang, Wei Cao 0006, Feifei Li 0001 |
Proc. VLDB Endow. | 5 |