YZYiwen Zhang

Yiwen Zhang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yiwen Zhang has a total of 21 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    GearDB: A GC-free Key-Value Store on HM-SMR Drives with Gear Compaction

    by Ting Yao, Jiguang Wan, Ping Huang, Yiwen Zhang, Changsheng Xie, Xubin He


  • PetaKV: Building Efficient Key-Value Store for File System Metadata on Persistent Memory

    by Yiwen Zhang, Jian Zhou, Xinhao Min, Song Ge, Jiguang Wan, Ting Yao, Daohui Wang

    Previous works proposed building file systems and organizing the metadata with KV stores because KV stores handle entries of various sizes efficiently and have excellent scalability. The emergence of the byte-addressable persistent memory (PM) enables metadata service to be faster than before by tailoring the KV store for the PM. However, existing PM-based KV stores cannot handle the workloads of file systems’ metadata well because simply depending on hash tables or trees cannot simultaneously provide fast file accessing and efficient directory traversing. In this paper, we exploit the insight of the metadata operations and propose the PetaKV, a KV store tailored for the metadata management of file systems on PM. PetaKV leverages dual hash indexing to achieve fast file put and get operations. Moreover, it cooperates with PM-tailored peta logs to collocate KV entries for each directory, thus supporting efficient directory scans. Our evaluation indicates PetaKV outperforms state-of-art tree-based KV stores on put, get and scan $2.5\times$ , $3.2\times$ , and $2.8\times$ on average, respectively. Moreover, the file system built with PetaKV achieves $1.2\times$ to $6.4\times$ speedup compared to those built with tree-based KV stores on the metadata operations.


  • Open Access

    Building GC-free Key-value Store on HM-SMR Drives with ZoneFS

    by Yiwen Zhang, Ting Yao, Jiguang Wan, Changsheng Xie

    Host-managed shingled magnetic recording drives (HM-SMR) are advantageous in capacity to harness the explosive growth of data. For key-value (KV) stores based on log-structured merge trees (LSM-trees), the HM-SMR drive is an ideal solution owning to its capacity, predictable performance, and economical cost. However, building an LSM-tree-based KV store on HM-SMR drives presents severe challenges in maintaining the performance and space utilization efficiency due to the redundant cleaning processes for applications and storage devices (i.e., compaction and garbage collection). To eliminate the overhead of on-disk garbage collection (GC) and improve compaction efficiency, this article presents GearDB , a GC-free KV store tailored for HM-SMR drives. GearDB improves the write performance and space efficiency through three new techniques: a new on-disk data layout, compaction windows, and a novel gear compaction algorithm. We further augment the read performance of GearDB with a new SSTable layout and read ahead mechanism. We implement GearDB with LevelDB, and use zonefs to access a real HM-SMR drive. Our extensive experiments confirm that GearDB achieves both high performance and space efficiency, i.e., on average 1.7× and 1.5× better than LevelDB in random write and read, respectively, with up to 86.9% space efficiency.


  • TriangleKV: Reducing Write Stalls and Write Amplification in LSM-Tree Based KV Stores With Triangle Container in NVM

    by Chen Ding, Ting Yao, Hong Jiang, Qiu Cui, Liu Tang, Yiwen Zhang, Jiguang Wan, Zhihu Tan

    Popular LSM-tree based key-value stores suffer from suboptimal and unpredictable performance due to write amplification and write stalls that cause application performance to periodically drop to nearly zero. Our preliminary experimental studies reveal that (1) write stalls mainly stem from the significantly large amount of data involved in each compaction between $L_{0}$ - $L_{1}$ (i.e., the first two levels of LSM-tree), and (2) write amplification increases with the depth of LSM-trees. Existing work mainly focus on reducing write amplification, while only a couple of them target mitigating write stalls. In this paper, we exploit unique features of non-volatile memory (NVM) to address these two limitations and propose TriangleKV, a new LSM-tree based persistent KV store with multi-tier DRAM-NVM-SSD storage. TriangleKV's design principles include performing smaller and cheaper $L_{0}$ - $L_{1}$ compaction to reduce write stalls while reducing the depth of LSM-trees to mitigate write amplification. To this end, four novel techniques are proposed. First, we relocate and manage the $L_{0}$ level in NVM with our proposed triangle container . Second, the new right-angle side compaction is devised to compact $L_{0}$ to $L_{1}$ at fine-grained key ranges, thus substantially reducing the amount of compaction data. Third, TriangleKV increases the width of each level to decrease the depth of LSM-trees thus mitigating write amplification. Finally, the cross-row hint search is introduced for the triangle container to keep adequate read performance. We implement TriangleKV based on MatrixKV and evaluate it on a hybrid DRAM/NVM/SSD system using Intel's latest 3D Xpoint NVM device Optane DC PMM. Evaluation results show that, with the same amount of NVM, TriangleKV outperforms RocksDB, NoveLSM and MatrixKV in 99th-percentile latencies by $5.5\times$ , $2.1\times$ and $1.1\times$ , and random write throughput by $4.9\times$ , $3.5\times$ and $1.4\times$ respectively.


  • ComboTree: A Persistent Indexing Structure With Universal Operational Efficiency and Scalability

    by Zhonghua Wang, Ting Yao, Jiguang Wan, Hong Jiang, Qiu Cui, Liu Tang, Yiwen Zhang, Qiuyang Zhang

    To leverage the larger-than-DRAM capacity and close-to-DRAM performance of persistent memory (PM) to build future memory systems, more scalable and efficient indexing structures are of paramount importance. However, as we evaluate existing PM indexing structures, we find that (1) both ordered and unordered indexing structures cannot support efficiently all KV operation types, i.e., Put, Get, Delete and Scan, and (2) the majority of indexes scale poorly as the PM capacity and dataset increases, i.e., the decreasing throughput of ordered indexes with the growth of dataset and the blocking of foreground requests by costly hash resizing of unordered indexes. To provide better operational efficiency on both point accesses and range queries for persistent memory in the ever-increasing volume of data, this paper proposes ComboTree, a three-tiered indexing structure with a sorted key space. In ComboTree, we break the global B+Tree into multiple low height B+Trees (Tier C) and arrange them with a sorted array (Tier B). Further, we accelerate the lookup of the sorted array by cumulative distribution function (Tier A). Last but not least, a background resizing policy is proposed to avoid performance degradation when the capacity of the ComboTree grows. We implement and evaluate ComboTree on Intels Optane DCPMM. Test results show that ComboTree delivers 2.1 - 3.6 put throughput and 1.5 - 2.1 get throughput of the state-of-art sorted indexes. Furthermore, ComboTree is 1.27 faster than the efficient B+Tree variant in various scan granularities, and it is open-sourced.


  • [Identification of dynamic co-expression networks in peripheral blood of rats after middle cerebral artery occlusion].

    by Zongfu Pan, Xiaoping Hu, Yiwen Zhang, Li Li, Ping Huang

    To identify the time dependent profiles of gene expression and featured co-expression network modules in peripheral blood of rats after middle cerebral artery occlusion (MCAO). Microarray GSE119121 from GEO database was analyzed by R language to identify the significantly changed genes in peripheral blood at different time points (0, 1, 2, 3, 6 and 24 h) after MCAO. Gene expression patterns at different time courses were screened by STEM tools. Then, function annotation and pathway enrichment of differentially expressed genes (DEGs) were performed using the Gene Ontology (GO) database and the Kyoto Gene and Genomic Encyclopedia (KEGG) database. Depending on CEMiTool package, gene expression profile matrix was inputted into R to construct the co-expression networks and to analyze modules, and enrichment analysis was conducted to evaluate the correlation between the modules and different time points. Comparing with gene at 0 h, the numbers of DEGs in peripheral blood at different time points after MCAO were 163 (1 h), 502 (2 h), 527 (3 h), 550 (6 h), and 75 (24 h), respectively. Moreover, a total of 38 gene expression patterns were enriched, and pattern 65 and pattern 34 were specifically up-regulated or down-regulated at 2-6 h. Hp, Nos2, P2ry10, and Klf12 were representative genes of these two models. The co-expression network module analysis showed that the gene status in the early acute phase (1-6 h) was positively correlated with the Module 2. Module 3 and Module 4 was positively correlated with phase phase 1-3 h and 2-6 h, respectively. Noteworthy, Module 6 gradually changed from positive correlation (0-2 h) to negative correlation (3-24 h) with the MCAO time course, and Module 6 was mainly related to viral response and innate immune response. The hub genes of Module 6 included Mx1, Mx2, and Rtp4. Our study has identified the featured genes and dynamic co-expression network modules in peripheral blood after acute ischemic stroke, which provides a potential basis for judging the onset time of ischemic stroke.

  • SEALDB: An Efficient LSM-tree Based KV Store on SMR Drives with Sets and Dynamic Bands

    by Ting Yao, Zhihu Tan, Jiguang Wan, Ping Huang, Yiwen Zhang, Changsheng Xie, Xubin He

    Key-value (KV) stores play an increasingly critical role in supporting diverse large-scale applications in modern data centers hosting terabytes of KV items which even might reside on a single server due to virtualization purposes. The combination of the ever-growing volume of KV items and storage/application consolidation is driving a trend of high storage density for KV stores. Shingled Magnetic Recording (SMR) represents a promising technology for increasing disk capacity, which however comes with the increased complexity of handling random writes. To take the best advantages of SMR drives, applications are expected to work in an SMR-friendly way. In this work, we present SEALDB, a Log-Structured Merge tree (LSM-tree) based key-value store that is specifically optimized for SMR drives via avoiding random writes and the corresponding write amplification on SMR drives. First, for LSM-trees, SEALDB collects and groups participating data of each compaction into sets. Using a set as the basic unit for compactions, SEALDB improves compaction efficiency by reducing random I/Os. Second, SEALDB creates variable sized bands on original HM-SMR drives, named dynamic bands. Dynamic bands store sets in an SMR-friendly way to eliminate the auxiliary write amplification from SMR drives. Third, SEALDB employs two light-weight garbage collection (GC) policies to further improve the space efficiency. We demonstrate the advantages of SEALDB via extensive experiments with various workloads. Overall, SEALDB delivers impressive performance compared with LevelDB, e.g., $3.42 \times /2.65\times$ faster for random writes (without or with GCs), and $3.96\times$ faster for sequential reads.