Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kyoungho Koo

dblp:274/5849 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0009-1078-1772ORCID · 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 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems
i/o scheduling
0.912025
Maintaining Inter-Layer Equilibrium in Hierarchical-Storage-based KV Store · ACM Trans. Storage 2025
Storage systems
key-value storage
0.912025
Maintaining Inter-Layer Equilibrium in Hierarchical-Storage-based KV Store · ACM Trans. Storage 2025
Storage systems › key-value storage
LSM-tree key-value store
0.912025
Maintaining Inter-Layer Equilibrium in Hierarchical-Storage-based KV Store · ACM Trans. Storage 2025
Storage systems
storage hierarchy
0.912025
Maintaining Inter-Layer Equilibrium in Hierarchical-Storage-based KV Store · ACM Trans. Storage 2025
Storage systems › storage hierarchy
tiered storage
0.912025
Maintaining Inter-Layer Equilibrium in Hierarchical-Storage-based KV Store · ACM Trans. Storage 2025

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

flush i/o throttling · 0.9dynamic data layout · 0.9
YearPublicationVenuePosition
2025 Maintaining Inter-Layer Equilibrium in Hierarchical-Storage-based KV Store
abstract
Modern storage technologies aim at enhancing performance and lower costs. With advances in storage devices, numerous studies propose key-value store designs for heterogeneous storage systems. Many rely on the Log-Structured Merge-Tree (LSM), which optimizes write-heavy workloads and flash storage. However, LSM-tree-based key-value stores on heterogeneous storage systems suffer from severe performance degradation and a surge in query latency. A key issue is write stall constraints , which arise from considering only single-tier storage, limiting key-value stores from leveraging multi-tier architectures. Another problem with key-value stores for heterogeneous storage systems is the inter-storage imbalance . Performance discrepancies between storage tiers fluctuate due to each storage device’s differing storage media technologies and garbage collection mechanisms. Consequently, existing hierarchical storage-based key-value stores (HSKVS) do not fully utilize the resources of storage devices across tiers and do not account for the performance imbalance between storage tiers. This article presents an I/O scheduler designed to maintain data balance across storage tiers of multi-tiered storage engines. Our approach leverages two key techniques: dynamic data layout and flush I/O throttling . Dynamic data layout optimizes data placement by adapting to performance metrics and workload demands. This approach ensures data is stored in the most appropriate tier, improving access times and reducing latency. Meanwhile, flush I/O throttling aims at efficiently managing the I/O workload by controlling data movement between memory and storage. It balances data flow, preventing bottlenecks, especially during peak usage. To evaluate the effectiveness of our proposed I/O scheduler, we integrated it into a conventional HSKVS system. This integration achieved up to a 14.7× performance improvement on YCSB workload D compared to conventional HSKVS systems. Furthermore, our proposed scheduler reduced the tail latency for get queries by about 9.3× , from 13 ms to 1.4 ms.
Kyoungho Koo, Junhan Lee
ACM Trans. Storage1