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

Zhushi Cheng

dblp:247/8167 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 1 since 2021Systems, architecture and hardware · 1

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.

Databases, data mining, and information retrieval
3 papers
Distributed and cloud data management · 32% Query processing and optimization · 28% Indexing and storage engines · 24%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 54% Cloud and datacenter computing · 46%

Topics — the 7 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed and cloud data management › cloud database
disaggregated database architecture
0.512021
PolarDB Serverless: A Cloud Native Database for Disaggregated Data Centers · SIGMOD Conference 2021
Cloud and datacenter computing › cloud data management
cloud-native database
0.512021
PolarDB Serverless: A Cloud Native Database for Disaggregated Data Centers · SIGMOD Conference 2021
Indexing and storage engines
in-memory index
0.412019
S3: A Scalable In-memory Skip-List Index for Key-Value Store · Proc. VLDB Endow. 2019
Storage systems
key-value storage
0.412019
S3: A Scalable In-memory Skip-List Index for Key-Value Store · Proc. VLDB Endow. 2019
Storage systems › key-value storage
LSM-tree key-value store
0.412019
S3: A Scalable In-memory Skip-List Index for Key-Value Store · Proc. VLDB Endow. 2019
Cloud and datacenter computing
resource provisioning
0.112021
PolarDB Serverless: A Cloud Native Database for Disaggregated Data Centers · SIGMOD Conference 2021
Database system architecture and tuning
index tuning
0.112019
S3: A Scalable In-memory Skip-List Index for Key-Value Store · Proc. VLDB Endow. 2019

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

optimistic locking · 1.0index-aware prefetching · 1.0neural model for guard entry selection · 0.8cache-sensitive structure · 0.8
YearPublicationVenuePosition
2021 PolarDB Serverless: A Cloud Native Database for Disaggregated Data Centers
abstract
\beginabstract The trend in the DBMS market is to migrate to the cloud for elasticity, high availability, and lower costs. The traditional, monolithic database architecture is difficult to meet these requirements. With the development of high-speed network and new memory technologies, disaggregated data center has become a reality: it decouples various components from monolithic servers into separated resource pools (e.g., compute, memory, and storage) and connects them through a high-speed network. The next generation cloud native databases should be designed for disaggregated data centers. In this paper, we describe the novel architecture of \name, which follows thedisaggregation design paradigm: the CPU resource on compute nodes is decoupled from remote memory pool and storage pool. Each resource pool grows or shrinks independently, providing \revon-demand provisoning at multiple dimensions while improving reliability. We also design our system to mitigate the inherent penalty brought by resource disaggregation, and introduce optimizations such as optimistic locking and index awared prefetching. Compared to the architecture that uses local resources, \name achieves better dynamic resource provisioning capabilities and 5.3 times faster failure recovery speed, while achieving comparable performance. \endabstract
Wei Cao 0006, Yingqiang Zhang, Xinjun Yang, Feifei Li 0001, Sheng Wang 0011, Qingda Hu, Xuntao Cheng, Zongzhi Chen, Zhenjun Liu, Bo Wang 0114, Haiqing Sun, Zhushi Cheng, Yusong Gao, Songlu Cai, Yunyang Zhang, Jiawang Tong
SIGMOD Conference15
2020 POLARDB Meets Computational Storage: Efficiently Support Analytical Workloads in Cloud-Native Relational Database
Yang Liu 0256, Zhushi Cheng, Linqiang Ouyang, Ray Kuan, Zhenjun Liu, Tong Zhang 0002
FAST3
2019 S3: A Scalable In-memory Skip-List Index for Key-Value Store
abstract
Many new memory indexing structures have been proposed and outperform current in-memory skip-list index adopted by LevelDB, RocksDB and other key-value systems. However, those new indexes cannot be easily intergrated with key-value systems, because most of them do not consider how the data can be efficiently flushed to disk. Some assumptions, such as fixed size key and value, are unrealistic for real applications. In this paper, we present S3, a scalable in-memory skip-list index for the customized version of RocksDB in Alibaba Cloud. S3 adopts a two-layer structure. In the top layer, a cache-sensitive structure is used to maintain a few guard entries to facilitate the search over the skip-list. In the bottom layer, a semi-ordered skip-list index is built to support highly concurrent insertions and fast lookup and range query. To further improve the performance, we train a neural model to select guard entries intelligently according to the data distribution and query distribution. Experiments on multiple datasets show that S3 achieves a comparable performance to other new memory indexing schemes, and can replace current in-memory skip-list of LevelDB and RocksDB to support huge volume of data.
Jingtian Zhang, Sai Wu, Zeyuan Tan, Gang Chen 0001, Zhushi Cheng, Wei Cao 0006, Yusong Gao, Xiaojie Feng
Proc. VLDB Endow.5