Feng Chen
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
Research Subjects
Feng Chen has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Tong Zhang
Rensselaer Polytechnic Institute, Troy, NY, USA
3 shared publications - Zhaoyan Shen
Shandong University, Qingdao, China
3 shared publications - Zili Shao
The Chinese University of Hong Kong
3 shared publications - Kecheng Huang
The Chinese University of Hong Kong
2 shared publications - Linsen Ma
Rensselaer Polytechnic Institute, Troy, NY, USA
2 shared publications - Rui Xie
Rensselaer Polytechnic Institute, Troy, NY, USA
2 shared publications
Latest Publications
- Open Access
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Towards Encrypted Data Compression with Computational Storage Drives
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessTowards Encrypted Data Compression with Computational Storage Drives
- Open Access
- 5 May 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 22 (4) , 1-34
A Passive and Hybrid Data Persistence Scheme for LSM-tree based Relational Databases
Storage engine is a crucial component in relational databases (RDBs). With the emergence of Internet services and applications, a recent technical trend is to deploy a Log-structured Merge Tree (LSM-tree) based storage engine. Although such an approach can achieve high performance and efficient storage space usage, it also brings a critical double-logging problem—In LSM-tree based RDBs, both the upper RDB layer and the lower storage engine layer implement redundant logging facilities, which perform synchronous and costly I/Os for data persistence. Unfortunately, such “double protection” does not provide extra benefits but only incurs heavy and unnecessary performance overhead. In this paper, we propose a novel solution, called Passive Data Persistence Scheme (PASV), to address the double-logging problem in LSM-tree based RDBs. By completely removing Write-ahead Log (WAL) in the storage engine layer, we develop a set of mechanisms, including a passive memory buffer flushing policy, an epoch-based data persistence scheme, and an optimized partial data recovery process, to achieve reliable and low-cost data persistence during normal runs and also fast and efficient recovery upon system failures. We also comprehensively analyze the recovery inefficiencies inherent in the undetermined persistence speeds in real-world workloads, and propose a hybrid persistence scheme that incorporates virtual-flush-based recovery optimizations to achieve the optimal recovery performance when performing epoch-based persistence. We implement a fully functional, open-sourced prototype of PASV based on Facebook’s MyRocks. Evaluation results show that our solution can effectively improve system performance by increasing throughput by up to 49.9% and reducing latency by up to 89.3%, and it also saves disk I/Os by up to 42.9% and reduces recovery time by up to 4.8%.
- 5 May 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 22 (4) , 1-34
Open AccessA Passive and Hybrid Data Persistence Scheme for LSM-tree based Relational Databases
Storage engine is a crucial component in relational databases (RDBs). With the emergence of Internet services and applications, a recent technical trend is to deploy a Log-structured Merge Tree (LSM-tree) based storage engine. Although such an approach can achieve high performance and efficient storage space usage, it also brings a critical double-logging problem—In LSM-tree based RDBs, both the upper RDB layer and the lower storage engine layer implement redundant logging facilities, which perform synchronous and costly I/Os for data persistence. Unfortunately, such “double protection” does not provide extra benefits but only incurs heavy and unnecessary performance overhead. In this paper, we propose a novel solution, called Passive Data Persistence Scheme (PASV), to address the double-logging problem in LSM-tree based RDBs. By completely removing Write-ahead Log (WAL) in the storage engine layer, we develop a set of mechanisms, including a passive memory buffer flushing policy, an epoch-based data persistence scheme, and an optimized partial data recovery process, to achieve reliable and low-cost data persistence during normal runs and also fast and efficient recovery upon system failures. We also comprehensively analyze the recovery inefficiencies inherent in the undetermined persistence speeds in real-world workloads, and propose a hybrid persistence scheme that incorporates virtual-flush-based recovery optimizations to achieve the optimal recovery performance when performing epoch-based persistence. We implement a fully functional, open-sourced prototype of PASV based on Facebook’s MyRocks. Evaluation results show that our solution can effectively improve system performance by increasing throughput by up to 49.9% and reducing latency by up to 89.3%, and it also saves disk I/Os by up to 42.9% and reduces recovery time by up to 4.8%.
- Open Access
- 31 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 44 (4) , 1-34
A Single-Index Store for Hybrid Transactional and Analytical Processing on Modern Computational Storage Drives
Driven by the exploding demands for real-time data analytics, hybrid transactional and analytical processing (HTAP) has become a topic of great interest in academia and the database industry. To address the well-known conflict between optimal storage formats for online transactional processing (OLTP) and online analytical processing (OLAP), the conventional practice employs a mixture of distinct indexes and dynamically migrates data across different index domains. Unfortunately, such a multi-index design is notably subject to non-trivial trade-offs among OLTP/OLAP performance and data freshness. This work advocates a single-index design to serve HTAP workloads. This is made possible by computational storage drives (CSDs) with built-in transparent compression that are emerging on the commercial market. The key is to exploit the fact that compression-capable CSDs enable sparse data management without sacrificing physical storage capacity. Leveraging this, we have developed an HTAP-oriented B + -tree design that can effectively serve HTAP workloads and meanwhile achieve almost instant data freshness. We also comprehensively analyze the inherent effects of storage fill factor and propose a dynamic adapter design to achieve optimal storage/performance efficiency for varying workloads. We have developed and open-sourced a fully functional prototype. Evaluation results show that our design can ensure data freshness and deliver high performance.
- 31 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 44 (4) , 1-34
Open AccessA Single-Index Store for Hybrid Transactional and Analytical Processing on Modern Computational Storage Drives
Driven by the exploding demands for real-time data analytics, hybrid transactional and analytical processing (HTAP) has become a topic of great interest in academia and the database industry. To address the well-known conflict between optimal storage formats for online transactional processing (OLTP) and online analytical processing (OLAP), the conventional practice employs a mixture of distinct indexes and dynamically migrates data across different index domains. Unfortunately, such a multi-index design is notably subject to non-trivial trade-offs among OLTP/OLAP performance and data freshness. This work advocates a single-index design to serve HTAP workloads. This is made possible by computational storage drives (CSDs) with built-in transparent compression that are emerging on the commercial market. The key is to exploit the fact that compression-capable CSDs enable sparse data management without sacrificing physical storage capacity. Leveraging this, we have developed an HTAP-oriented B + -tree design that can effectively serve HTAP workloads and meanwhile achieve almost instant data freshness. We also comprehensively analyze the inherent effects of storage fill factor and propose a dynamic adapter design to achieve optimal storage/performance efficiency for varying workloads. We have developed and open-sourced a fully functional prototype. Evaluation results show that our design can ensure data freshness and deliver high performance.
- Open Access
- 30 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 116-128
ZipCache: A DRAM/SSD Cache with Built-in Transparent Compression
- 30 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 116-128
Open AccessZipCache: A DRAM/SSD Cache with Built-in Transparent Compression
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 293-303
One Size Never Fits All: A Flexible Storage Interface for SSDs
The rapid adoption of solid-state drives (SSDs) as a major storage component has been made possible thanks to their ability to export a standard block I/O interface to file system and application developers. Meanwhile, this high-level abstraction has been shown to limit the utilization of the devices and the performance of applications running on top of them. Indeed, many optimizations of performance-critical applications bypass the standard block interface and rely on low-level control over SSD internal processes. However, the need to directly manage the physical device significantly increases development complexity and cost, and reduces its portability. Thus, application developers must choose between two extreme options, either easy development or optimal performance, without a real possibility to balance between these two objectives. To bridge this gap, we propose a flexible storage interface that exports the SSD hardware in three levels of abstraction: as a raw flash media with its low-level details, as a group of functions to manage flash capacity, or as a configurable block device. This multi-level abstraction allows developers to choose the degree in which they desire to control the flash hardware in a manner that best suits their applications' semantics and performance objectives. We demonstrate the usability of this new model with Prism-SSD—a prototype of this interface as a user-level library on the Open-Channel SSD platform. We use each of the interface's three abstraction levels to modify the I/O module of three representative applications: a key-value cache system, a user-level file system, and a graph processing engine. Prism-SSD improves application performance by 5% to 27%, at varying development costs, between 200 and 3,500 lines of code.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 293-303
One Size Never Fits All: A Flexible Storage Interface for SSDs
The rapid adoption of solid-state drives (SSDs) as a major storage component has been made possible thanks to their ability to export a standard block I/O interface to file system and application developers. Meanwhile, this high-level abstraction has been shown to limit the utilization of the devices and the performance of applications running on top of them. Indeed, many optimizations of performance-critical applications bypass the standard block interface and rely on low-level control over SSD internal processes. However, the need to directly manage the physical device significantly increases development complexity and cost, and reduces its portability. Thus, application developers must choose between two extreme options, either easy development or optimal performance, without a real possibility to balance between these two objectives. To bridge this gap, we propose a flexible storage interface that exports the SSD hardware in three levels of abstraction: as a raw flash media with its low-level details, as a group of functions to manage flash capacity, or as a configurable block device. This multi-level abstraction allows developers to choose the degree in which they desire to control the flash hardware in a manner that best suits their applications' semantics and performance objectives. We demonstrate the usability of this new model with Prism-SSD—a prototype of this interface as a user-level library on the Open-Channel SSD platform. We use each of the interface's three abstraction levels to modify the I/O module of three representative applications: a key-value cache system, a user-level file system, and a graph processing engine. Prism-SSD improves application performance by 5% to 27%, at varying development costs, between 200 and 3,500 lines of code.