Yingjia Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Yingjia Wang has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Ming-Chang Yang
The Chinese University of Hong Kong
7 shared publications - Yuhong Liang
Great Bay University
4 shared publications - Lok Yin Chow
The Department of Computer Science and Engineering, The Chinese University of Hong Kong
2 shared publications - Tsun-Yu Yang
The Chinese University of Hong Kong
2 shared publications - Caixin Gong
Alibaba Group, Hangzhou, China
1 shared publication - Fei Wu
Huazhong University of Science and Technology, Wuhan, China
1 shared publication
Latest Publications
- Open Access
- 14 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
Boosting ZNS SSD Write Performance with Zora
Zoned Namespace (ZNS) SSD presents a new class of storage devices that offers low cost, high and consistent performance, and software definability. Nevertheless, ZNS demands strict sequential writing within a zone, which severely limits the write performance of small-sized requests. Unfortunately, existing solutions are all sub-optimal due to unsatisfactory write performance, the need for invasive host software modifications, and/or compromised read performance. In this paper, we propose Zora , a host-SSD collaborative framework, to fully address the write performance limitation for ZNS SSDs. Zora includes two core components: a zone area abstraction tailored for generic writes and a request admission control module located in the Linux block layer. They collaborate to boost ZNS SSD write performance to near-optimal (i.e., up to 94.1% in raw SSD access, up to 96.2% in filesystem workloads, and 24.2% to 48.5% in applications such as Varmail, OLTP, and SQLite), while benefiting upper-level applications and filesystems with full transparency.
- 14 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
Open AccessBoosting ZNS SSD Write Performance with Zora
Zoned Namespace (ZNS) SSD presents a new class of storage devices that offers low cost, high and consistent performance, and software definability. Nevertheless, ZNS demands strict sequential writing within a zone, which severely limits the write performance of small-sized requests. Unfortunately, existing solutions are all sub-optimal due to unsatisfactory write performance, the need for invasive host software modifications, and/or compromised read performance. In this paper, we propose Zora , a host-SSD collaborative framework, to fully address the write performance limitation for ZNS SSDs. Zora includes two core components: a zone area abstraction tailored for generic writes and a request admission control module located in the Linux block layer. They collaborate to boost ZNS SSD write performance to near-optimal (i.e., up to 94.1% in raw SSD access, up to 96.2% in filesystem workloads, and 24.2% to 48.5% in applications such as Varmail, OLTP, and SQLite), while benefiting upper-level applications and filesystems with full transparency.
- Open Access
- 2 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (1) , 1-25
Making LSM-Tree-based Key-Value Store Practical and Efficient for Multi-Tenant Serverless Cloud Databases
Cloud databases revolutionize data processing and storage by providing on-demand and scalable services housed on the cloud infrastructure. Multi-tenancy and serverless are two key tenets transforming the cloud database architecture, offering significant cost savings and simplified user management. However, we found that cloud databases using LSM-tree-based key-value stores as the storage engine face a crucial conundrum when adopting this promising multi-tenant serverless architecture. Specifically, LSM-tree-based key-value store encounters a critical dilemma between maintaining performance service-level agreements (SLAs) for tenants and over-subscribing storage bandwidth for high cost-efficiency. In this paper, we present FlexEngine, a novel LSM-tree-based key-value store, which for the first time enables the practical and efficient adoption of LSM tree in multi-tenant serverless cloud databases. FlexEngine introduces a series of designs to navigate the above dilemma, including a two-level (i.e., partition- and node-level) I/O admission control framework and a two-stage compaction deferral mechanism. We implement FlexEngine on a commercially-deployed RocksDB and perform comprehensive experiments on both production traces and micro-level workloads. The experimental results demonstrate that FlexEngine can significantly improve the capability to over-subscribe storage bandwidth, which leads to high cost-efficiency, while still promising consistent performance SLAs for users.
- 2 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (1) , 1-25
Open AccessMaking LSM-Tree-based Key-Value Store Practical and Efficient for Multi-Tenant Serverless Cloud Databases
Cloud databases revolutionize data processing and storage by providing on-demand and scalable services housed on the cloud infrastructure. Multi-tenancy and serverless are two key tenets transforming the cloud database architecture, offering significant cost savings and simplified user management. However, we found that cloud databases using LSM-tree-based key-value stores as the storage engine face a crucial conundrum when adopting this promising multi-tenant serverless architecture. Specifically, LSM-tree-based key-value store encounters a critical dilemma between maintaining performance service-level agreements (SLAs) for tenants and over-subscribing storage bandwidth for high cost-efficiency. In this paper, we present FlexEngine, a novel LSM-tree-based key-value store, which for the first time enables the practical and efficient adoption of LSM tree in multi-tenant serverless cloud databases. FlexEngine introduces a series of designs to navigate the above dilemma, including a two-level (i.e., partition- and node-level) I/O admission control framework and a two-stage compaction deferral mechanism. We implement FlexEngine on a commercially-deployed RocksDB and perform comprehensive experiments on both production traces and micro-level workloads. The experimental results demonstrate that FlexEngine can significantly improve the capability to over-subscribe storage bandwidth, which leads to high cost-efficiency, while still promising consistent performance SLAs for users.
- Open Access
- 26 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 24 (5s) , 1-25
Unlocking the Full Potential of Dual-Interface SSDs: A Comprehensive Hardware and Software Perspective
The legacy block interface for I/O benefits from data locality but faces challenges with I/O amplification due to the frequent small read-write operations common in most applications. Dual-Interface SSDs, which integrate block-interface Flash memory with byte-addressable memory, create opportunities for application redesign by reducing unnecessary read-write amplification on storage devices. However, current Dual-Interface SSD hardware remains limited in terms of size and functionality. Existing software designs for Dual-Interface SSDs often use the byte-addressable space as sequential logs with basic batch reclamation. While this space allows random access, and batch reclamation introduces significant tail latency caused by excessive read and write-back operations. To fully exploit the potential of Dual-Interface SSDs, we have developed a prototype on a hardware-software configurable platform. This publicly accessible Dual-Interface SSD offers realistic and optimized performance, overcoming the size and functionality limitations of previous designs. In addition, we demonstrate the ability of Dual-Interface SSDs to reduce write amplification in a traditional Copy-on-Write B-Tree data store. By employing two key techniques—Tree Pointer Relocation, which decouples indirection from the tree structure, and Tree Node Accommodation, which enables small-sized key-value pair updates to be processed directly in the byte-addressable space—we significantly improve the efficiency of storage operations. Our evaluation reveals that these techniques, when applied to Dual-Interface SSDs, achieve performance gains of 30.5% and 52.5% compared to a CoW B-Tree operating on traditional block-interface SSDs.
- 26 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 24 (5s) , 1-25
Open AccessUnlocking the Full Potential of Dual-Interface SSDs: A Comprehensive Hardware and Software Perspective
The legacy block interface for I/O benefits from data locality but faces challenges with I/O amplification due to the frequent small read-write operations common in most applications. Dual-Interface SSDs, which integrate block-interface Flash memory with byte-addressable memory, create opportunities for application redesign by reducing unnecessary read-write amplification on storage devices. However, current Dual-Interface SSD hardware remains limited in terms of size and functionality. Existing software designs for Dual-Interface SSDs often use the byte-addressable space as sequential logs with basic batch reclamation. While this space allows random access, and batch reclamation introduces significant tail latency caused by excessive read and write-back operations. To fully exploit the potential of Dual-Interface SSDs, we have developed a prototype on a hardware-software configurable platform. This publicly accessible Dual-Interface SSD offers realistic and optimized performance, overcoming the size and functionality limitations of previous designs. In addition, we demonstrate the ability of Dual-Interface SSDs to reduce write amplification in a traditional Copy-on-Write B-Tree data store. By employing two key techniques—Tree Pointer Relocation, which decouples indirection from the tree structure, and Tree Node Accommodation, which enables small-sized key-value pair updates to be processed directly in the byte-addressable space—we significantly improve the efficiency of storage operations. Our evaluation reveals that these techniques, when applied to Dual-Interface SSDs, achieve performance gains of 30.5% and 52.5% compared to a CoW B-Tree operating on traditional block-interface SSDs.
- Open Access
- 26 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 24 (5s) , 1-21
Large or Small: Harnessing the Erase Duality of Emerging Bit-Alterable NAND Flash to Suppress Tail Latency
High-density NAND flash has revolutionized the storage ecosystem because of its rapidly decreasing per-bit costs and unprecedented capacities. However, the inherent large block size of modern high-density NAND flash inevitably aggravates the reclamation latency (i.e., the time required to reclaim the storage space occupied by the obsolete data), which subsequently prolongs the tail latency of flash-based storage devices. Inspired by the “erase duality” from the emerging bit-alterable NAND flash, this paper proposes a reclamation latency suppressed (RLS) space management design to synergize the strengths of both block-level erase and page-level erase. Taking into account the data update frequency during runtime, RLS enables proactive adjustment of the dual-granularity erase. Moreover, RLS tightly couples the data cluster allocation strategy with a novel dual-granularity space reclamation design, thereby alleviating the reclamation latency. We extensively examine the benefits of RLS with real-world workloads. Our evaluation results reveal that, with the suppressed space reclamation latency, RLS achieves up to 37.51% improvement for both write and read tail latency (latency at the 99.9th percentile) compared with the state-of-the-art approaches.
- 26 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 24 (5s) , 1-21
Open AccessLarge or Small: Harnessing the Erase Duality of Emerging Bit-Alterable NAND Flash to Suppress Tail Latency
High-density NAND flash has revolutionized the storage ecosystem because of its rapidly decreasing per-bit costs and unprecedented capacities. However, the inherent large block size of modern high-density NAND flash inevitably aggravates the reclamation latency (i.e., the time required to reclaim the storage space occupied by the obsolete data), which subsequently prolongs the tail latency of flash-based storage devices. Inspired by the “erase duality” from the emerging bit-alterable NAND flash, this paper proposes a reclamation latency suppressed (RLS) space management design to synergize the strengths of both block-level erase and page-level erase. Taking into account the data update frequency during runtime, RLS enables proactive adjustment of the dual-granularity erase. Moreover, RLS tightly couples the data cluster allocation strategy with a novel dual-granularity space reclamation design, thereby alleviating the reclamation latency. We extensively examine the benefits of RLS with real-world workloads. Our evaluation results reveal that, with the suppressed space reclamation latency, RLS achieves up to 37.51% improvement for both write and read tail latency (latency at the 99.9th percentile) compared with the state-of-the-art approaches.
- Open Access
- 19 March 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 21 (2) , 1-24
ZonesDB: Building Write-Optimized and Space-Adaptive Key-Value Store on Zoned Storage with Fragmented LSM Tree
The zoned storage has revolutionized the decades-old block storage in lowering the cost-per-gigabyte while enabling the host system to achieve better performance. With such benefit of cost and performance, we still require careful consideration on the endurance when deploying the applications on the zoned storage, since the modern storage tends to trade its endurance for larger capacity at lower cost. In this regard, although previous studies have deployed the log-structure merge (LSM-tree)-based key-value (KV) store on the zoned storage, the LSM-tree-based KV store can be suboptimal choice to build a cost-effective KV store on zoned storage, since LSM-tree has a well-known problem of write amplification (WA). Therefore, based on the key insight that the Fragmented Log-Structured Merge tree (FLSM-tree) substantially alleviates the notorious write amplification problem of the classical LSM-tree and inherently complies with the sequential write constraint of zoned storage, FLSM-tree would be a promising design choice to build a cost-effective KV store on zoned storage. However, based on our investigation, deploying an FLSM-tree-based KV store on zoned storage faces two challenges: The write amplification of the host-initiated garbage collection (GC) cancels out the low WA merit of FLSM-tree, and FLSM-tree results in high space amplification to increase the cost. In this regard, this article presents ZonesDB , a novel FLSM-tree-based KV store that comes with a series of innovative “zone-aware” techniques for pursuing write optimality and space adaptability. Our evaluations, based on two types of production-grade zoned storage (i.e., ZNS SSD and HM-SMR HDD), reveal that ZonesDB can bring into play the low WA merit of FLSM-tree, deliver outstanding write performance, and mitigate the space amplification problem of FLSM-tree on zoned storage.
- 19 March 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 21 (2) , 1-24
Open AccessZonesDB: Building Write-Optimized and Space-Adaptive Key-Value Store on Zoned Storage with Fragmented LSM Tree
The zoned storage has revolutionized the decades-old block storage in lowering the cost-per-gigabyte while enabling the host system to achieve better performance. With such benefit of cost and performance, we still require careful consideration on the endurance when deploying the applications on the zoned storage, since the modern storage tends to trade its endurance for larger capacity at lower cost. In this regard, although previous studies have deployed the log-structure merge (LSM-tree)-based key-value (KV) store on the zoned storage, the LSM-tree-based KV store can be suboptimal choice to build a cost-effective KV store on zoned storage, since LSM-tree has a well-known problem of write amplification (WA). Therefore, based on the key insight that the Fragmented Log-Structured Merge tree (FLSM-tree) substantially alleviates the notorious write amplification problem of the classical LSM-tree and inherently complies with the sequential write constraint of zoned storage, FLSM-tree would be a promising design choice to build a cost-effective KV store on zoned storage. However, based on our investigation, deploying an FLSM-tree-based KV store on zoned storage faces two challenges: The write amplification of the host-initiated garbage collection (GC) cancels out the low WA merit of FLSM-tree, and FLSM-tree results in high space amplification to increase the cost. In this regard, this article presents ZonesDB , a novel FLSM-tree-based KV store that comes with a series of innovative “zone-aware” techniques for pursuing write optimality and space adaptability. Our evaluations, based on two types of production-grade zoned storage (i.e., ZNS SSD and HM-SMR HDD), reveal that ZonesDB can bring into play the low WA merit of FLSM-tree, deliver outstanding write performance, and mitigate the space amplification problem of FLSM-tree on zoned storage.
- Open Access
- 27 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-8
ZnH2: Augmenting ZNS-based Storage System with Host-Managed Heterogeneous Zones
- 27 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Open AccessZnH2: Augmenting ZNS-based Storage System with Host-Managed Heterogeneous Zones
- 12 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 73 (11) , 2520-2533
Land of Oz: Resolving Orderless Writes in Zoned Namespace SSDs
Zoned Namespace (ZNS) SSDs present a new class of storage devices that promise low cost, stable performance, and software-defined capability. ZNS abstracts the SSD into an array of zones that can only be written sequentially. Although ZNS-compatible filesystems (e.g., F2FS) launch sequential writes, the zone write constraint may be violated due to orderless Linux I/O stack. Hence, the write queue depth of each zone must be limited to one, which severely degrades the performance of small writes. In this paper, we propose oZNS SSD (o: orderless), which allows multiple writes to be submitted to a zone and processed out-of-order in the SSD. To bridge the gap between ZNS sequential write contract and orderless writes on flash, a lightweight indirection layer is introduced and carefully designed by exploiting the characteristics of out-of-order writes. Specifically, memory-efficient metadata structures are devised to record the write deviations of data pages, and a two-tier buffering mechanism is employed to reduce metadata and accelerate metadata access. Moreover, a read-try policy removes metadata access from read critical path and thus improves the data read efficiency. Experimental results show that oZNS can achieve up to 8.6$\times$ higher write performance than traditional ZNS while providing comparable read performance.- 12 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 73 (11) , 2520-2533
Land of Oz: Resolving Orderless Writes in Zoned Namespace SSDs
Zoned Namespace (ZNS) SSDs present a new class of storage devices that promise low cost, stable performance, and software-defined capability. ZNS abstracts the SSD into an array of zones that can only be written sequentially. Although ZNS-compatible filesystems (e.g., F2FS) launch sequential writes, the zone write constraint may be violated due to orderless Linux I/O stack. Hence, the write queue depth of each zone must be limited to one, which severely degrades the performance of small writes. In this paper, we propose oZNS SSD (o: orderless), which allows multiple writes to be submitted to a zone and processed out-of-order in the SSD. To bridge the gap between ZNS sequential write contract and orderless writes on flash, a lightweight indirection layer is introduced and carefully designed by exploiting the characteristics of out-of-order writes. Specifically, memory-efficient metadata structures are devised to record the write deviations of data pages, and a two-tier buffering mechanism is employed to reduce metadata and accelerate metadata access. Moreover, a read-try policy removes metadata access from read critical path and thus improves the data read efficiency. Experimental results show that oZNS can achieve up to 8.6$\times$ higher write performance than traditional ZNS while providing comparable read performance.