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

Zhu Pang

dblp:295/3167 · DBLP profile ↗
← Back
1ranked-venue papers
1as 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 · 1 · 1 first-author · 1 since 2021

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 87% Cloud and datacenter computing · 13%
Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 100%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines
key-value store
0.512021
ArkDB: A Key-Value Engine for Scalable Cloud Storage Services · SIGMOD Conference 2021
Indexing and storage engines
write amplification reduction
0.512021
ArkDB: A Key-Value Engine for Scalable Cloud Storage Services · SIGMOD Conference 2021
Storage systems › distributed storage
disaggregated storage
0.512021
ArkDB: A Key-Value Engine for Scalable Cloud Storage Services · SIGMOD Conference 2021
Storage systems › file systems
distributed file system
0.512021
ArkDB: A Key-Value Engine for Scalable Cloud Storage Services · SIGMOD Conference 2021
Cloud and datacenter computing
cloud storage
0.112021
ArkDB: A Key-Value Engine for Scalable Cloud Storage Services · SIGMOD Conference 2021

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

partition split and merge · 1.0page mapping table · 1.0garbage collection · 1.0
YearPublicationVenuePosition
2021 ArkDB: A Key-Value Engine for Scalable Cloud Storage Services
abstract
Persistent key-value stores play a crucial role in enabling internet-scale services. At Alibaba Cloud, scale-out cloud storage services including Object Storage Service, File Storage Service and Tablestore are built on distributed key-value stores. Key challenges in the design of the underlying key-value engine for these services lie in utilization of disaggregated storage, supporting write and range query-heavy workloads, and balancing of scalability, availability and resource usage. This paper presents ArkDB, a key-value engine designed to address these challenges by combining advantages of both LSM tree and Bw-tree, and leveraging advances in hardware technologies. Built on top of Pangu, an append-only distributed file system, ArkDB's innovations include shrinkable page mapping table, clear separation of system and user states for fast recovery, write amplification reduction, efficient garbage collection and lightweight partition split and merge. Experimental results demonstrate ArkDB's improvements over existing designs. Compared with Bw-tree, ArkDB efficiently stabilizes the mapping table size despite continuous write working set growth. Compared with RocksDB, an LSM tree-based key-value engine, ArkDB increases ingestion throughput by 2.16x, while reducing write amplification by 3.1x. It outperforms RocksDB by 52% and 37% respectively on a write-heavy workload and a range query-intensive workload of the Yahoo! Cloud Serving Benchmark. Experiments running in Tablestore in a cluster environment further demonstrate ArkDB's performance on Pangu and its efficient partition split/merge support.
Zhu Pang, Qingda Lu, Rui Wang 0002, Yikang Xu, Jiesheng Wu
SIGMOD Conference1