EDBT 2026 Demo / reviewers in the wild / expert
In-Yeong Song
dblp:322/1568
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021Databases, 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.
| Databases, data mining, and information retrieval
1 paper |
Indexing and storage engines · 87% Transaction processing and concurrency control · 13% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Storage systems · 100% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Indexing and storage engines
buffer management |
0.6 | 1 | 2022 | Avoiding Read Stalls on Flash Storage · SIGMOD Conference 2022 |
Indexing and storage engines › buffer management
page replacement |
0.6 | 1 | 2022 | Avoiding Read Stalls on Flash Storage · SIGMOD Conference 2022 |
Storage systems
flash and SSD |
0.6 | 1 | 2022 | Avoiding Read Stalls on Flash Storage · SIGMOD Conference 2022 |
Storage systems › flash and SSD › flash memory
flash storage |
0.6 | 1 | 2022 | Avoiding Read Stalls on Flash Storage · SIGMOD Conference 2022 |
Transaction processing and concurrency control › transaction performance
transaction throughput |
0.2 | 1 | 2022 | Avoiding Read Stalls on Flash Storage · SIGMOD Conference 2022 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Avoiding Read Stalls on Flash StorageabstractWhen a dirty victim page is selected for replacement upon page miss, the buffer manager has to first flush the dirty victim to the storage before reading the missing page. This conventional read-after-write (RAW) protocol, while working well on hard disks, causes the problem of read stall on flash storage with asymmetric read-write speed and parallelism; because of the resource conflict for a buffer frame between write and read operations, a page-missing process has to wait for the slow write to complete to secure a clean frame for the missing page. This strict write-then-read serialization under-utilizes CPU and storage, worsening transaction throughput and latency. To avoid the read stall problem on flash storage, this paper proposes write-after-read (WAR) protocol as a new I/O architecture between buffer manager and flash storage. In WAR, foreground processes make victim frames clean instantly by temporarily copying dirty pages at LRU tail into a separate DRAM space and read their missing pages into the cleaned frames with no stall. The dirty pages will be written to the storage asynchronously. By resolving resource conflict and thus avoiding read stalls, the database engine can issue more I/Os in parallel and better utilize CPU as well as storage, improving throughput and latency. We prototype WAR in two database storage engines, MySQL/InnoDB and Zero. Our comprehensive experimental results show that WAR improves transaction throughput by up to 2.9x compared to RAW. Mijin An, In-Yeong Song, Yong Ho Song, Sang-Won Lee 0001 |
SIGMOD Conference | 2 |
| 2022 | Achieving low write latency through new stealth program operation supporting early write completion in NAND flash memory
Moonseok Jang, Sangjin Lee 0001, Hyeonggyu Jeong, In-Yeong Song, Yong Ho Song, Jungwook Choi |
J. Syst. Archit. | 5 |