Shuning Chen

Shuning Chen

Auto-generated profile, based on publicly available information

Shuning Chen

PingCAP, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 August 2023
Verified
Conference Paper
Open access
CDChen Ding
Chen Ding
JZJian Zhou
Jian Zhou
JWJiguang Wan
Jiguang Wan
YXYiqin Xiong
Yiqin Xiong
SLSicen Li
Sicen Li
PXPeng Xu
Peng Xu

4 April 2024 in ACM Transactions on Storage
Verified
Journal Article
Open access
YZYuanhui Zhou
Yuanhui Zhou
JZJian Zhou
Jian Zhou
KLKai Lu
Kai Lu
LZLing Zhan
Ling Zhan
PXPeng Xu
Peng Xu
JWJiguang Wan
Jiguang Wan
Cloud storage is gaining popularity because features such as pay-as-you-go significantly reduce storage costs. However, the community has not sufficiently explored its contract model and latency characteristics. As LSM-Tree-based key-value stores (LSM stores) become the building block for numerous cloud applications, how cloud storage would impact the performance of key-value accesses is vital. This study reveals the significant latency variances of Amazon Elastic Block Store (EBS) under various I/O pressures, which challenges LSM store read performance on cloud storage. To reduce the corresponding tail latency, we propose Calcspar, a contract-aware LSM store for cloud storage, which efficiently addresses the challenges by regulating the rate of I/O requests to cloud storage and absorbing surplus I/O requests with the data cache. We specifically developed a fluctuation-aware cache to lower the high latency brought on by workload fluctuations. Additionally, we build a congestion-aware IOPS allocator to reduce the impact of LSM store internal operations on read latency. We evaluated Calcspar on EBS with different real-world workloads and compared it to the cutting-edge LSM stores. The results show that Calcspar can significantly reduce tail latency while maintaining regular read and write performance, keeping the 99 th percentile latency under 550μs and reducing average latency by 66%. In addition, Calcspar has lower write prices and average latency compared to Cloud NoSQL services offered by cloud vendors.

1 September 2021
Verified
Conference Paper
Open access
PXPeng Xu
Peng Xu
NZNannan Zhao
Nannan Zhao
JWJiguang Wan
Jiguang Wan
WLWei Liu
Wei Liu
SCShuning Chen
Shuning Chen
CXChangsheng Xie
Changsheng Xie
The explosive growth of modern web-scale applications has made cost-effectiveness a primary design goal for their underlying databases. As a backbone of modern databases, LSM-tree based key-value stores (LSM store) face limited storage options. They are either designed for local storage that is relatively small, expensive, and fast or for cloud storage that offers larger capacities at reduced costs but slower. Designing an LSM store by integrating local storage with cloud storage services is a promising way to balance the cost and performance. However, such design faces challenges such as data reorganization and metadata overhead issues. In this paper, we propose ROCKSMASH, a fast and efficient LSM store that uses local storage to store frequently accessed data and metadata while using cloud to hold the rest of the data to achieve cost-effectiveness. To improve metadata space-efficiency and read performance, ROCKSMASH uses an LSM-aware persistent cache that stores metadata in a space-efficient way and stores popular data blocks by using compaction-aware layouts. We implemented ROCKSMASH by embedding these designs into RocksDB. The evaluation results show that ROCKSMASH improves the performance by up to 1.7 × compared to the state-of-the-art schemes and delivers higher reliability and cost-effectiveness.