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

Zeshun Peng

dblp:328/6938 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
6since 2021 · last 2026
—ORCID · none

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

Databases, data management, data science and information retrieval · 6 · 2 first-author · 6 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
2 papers
Distributed systems · 100%
Databases, data mining, and information retrieval
2 papers
Transaction processing and concurrency control · 62% Distributed and cloud data management · 38%

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

TopicWeightPapersLastEvidence papers
Distributed systems
consensus
1.422025
MassBFT: Fast and Scalable Geo-Distributed Byzantine Fault-Tolerant Consensus · ICDE 2025
NeuChain: A Fast Permissioned Blockchain System with Deterministic Ordering · Proc. VLDB Endow. 2022
Transaction processing and concurrency control
concurrency control
0.912025
Concurrency Control as a Service · Proc. VLDB Endow. 2025
Distributed systems › consensus
byzantine agreement
0.912025
MassBFT: Fast and Scalable Geo-Distributed Byzantine Fault-Tolerant Consensus · ICDE 2025
Distributed systems › consensus
geo-distributed consensus
0.912025
MassBFT: Fast and Scalable Geo-Distributed Byzantine Fault-Tolerant Consensus · ICDE 2025
Distributed systems › replication › state machine replication
log replication
0.912025
MassBFT: Fast and Scalable Geo-Distributed Byzantine Fault-Tolerant Consensus · ICDE 2025
Distributed systems
replication
0.912025
MassBFT: Fast and Scalable Geo-Distributed Byzantine Fault-Tolerant Consensus · ICDE 2025
Transaction processing and concurrency control › transaction scheduling
transaction ordering
0.612022
NeuChain: A Fast Permissioned Blockchain System with Deterministic Ordering · Proc. VLDB Endow. 2022
Distributed systems
blockchain
0.612022
NeuChain: A Fast Permissioned Blockchain System with Deterministic Ordering · Proc. VLDB Endow. 2022
Distributed systems › blockchain
permissioned blockchain
0.612022
NeuChain: A Fast Permissioned Blockchain System with Deterministic Ordering · Proc. VLDB Endow. 2022

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

pipelining · 1.1byzantine fault tolerance · 1.1sharded multi-write OCC · 0.9encoded bijective log replication · 0.9deterministic conflict resolution · 0.9asynchronous log push-down · 0.9asynchronous log ordering · 0.9
YearPublicationVenuePosition
2026 PAT: Towards Transaction Routing with Page Affinity in Shared-Cache Databases
Zhongqin Tan, Yanfeng Zhang 0001, Zeshun Peng, Weixing Zhou, Guoliang Li 0001, Ge Yu 0001
ICDE4
2025 TaaSDB: A Transaction Management Service Platform Supporting Cross-Model Transactions
Yuan Teng, Weixing Zhou, Zeshun Peng
WISA3
2025 MassBFT: Fast and Scalable Geo-Distributed Byzantine Fault-Tolerant Consensus
abstract
Geo-distributed consensus protocols provide high availability and resilience for distributed database services. These protocols group nodes by their data centers to leverage the network topology that spans across multiple data centers, thereby reducing costly cross-datacenter communication. However, they still face performance and scalability challenges due to inefficient log replication mechanisms. 1) These protocols rely on the leader node in each group to perform cross-datacenter log replication, creating a single-node performance bottleneck. 2) Byzantine receivers can behave arbitrarily, forcing the group leader to send multiple log copies during replication to prevent loss, thus causing redundant transmissions. 3) Since all groups must execute these logs in the same order, synchronizations across groups are necessary to maintain consistency when multiple groups are proposing concurrently, which also slow down log replication. This paper presents MassBFT, a Byzantine fault-tolerant geo-consensus protocol that achieves high performance and scalability. We design an encoded bijective log replication to eliminate the leader bottleneck and reduce the cross-datacenter network consumption. We also propose asynchronous log ordering to eliminate synchronization across groups. Experimental results show that MassBFT is scalable, fault-tolerant, and outperforms state-of-the-art protocols with 5.49-29.96 times higher throughput under YCSB, SmallBank, and TPC-C workloads.
Zeshun Peng, Yanfeng Zhang 0001, Tinghao Feng, Weixing Zhou, Xiaohua Li 0004, Ge Yu 0001
ICDE1
2025 Concurrency Control as a Service
abstract
Existing disaggregated databases separate execution and storage layers, enabling independent and elastic scaling of resources. In most cases, this design makes transaction concurrency control (CC) a critical bottleneck, which demands significant computing resources for concurrent conflict management and struggles to scale due to the coordination overhead for concurrent conflict resolution. Coupling CC with execution or storage limits performance and elasticity, as CC's resource needs do not align with the free scaling of the transaction execution layer or the storage-bound data layer. This paper proposes Concurrency Control as a Service (CCaaS), which decouples CC from databases, building an execution-CC-storage three-layer decoupled database, allowing independent scaling and upgrades for improved elasticity, resource utilization, and development agility. However, adding a new layer increases latency due to the shift in communication from hardware to network. To address this, we propose a Sharded Multi-Write OCC (SM-OCC) algorithm with an asynchronous log push-down mechanism to minimize network communications overhead and transaction latency. Additionally, we implement a multi-write architecture with a deterministic conflict resolution method to reduce coordination overhead in the CC layer, thereby improving scalability. CCaaS is designed to be connected by a variety of execution and storage engines. Existing disaggregated databases can be revolutionized with CCaaS to achieve high elasticity, scalability, and high performance. Results show that CCaaS achieves 1.02–3.11X higher throughput and 1.11–2.75X lower latency than SoTA disaggregated databases.
Weixing Zhou, Yanfeng Zhang 0001, Xinji Zhou, Zhiyou Wang, Zeshun Peng, Sihao Li, Huanchen Zhang, Guoliang Li 0001, Ge Yu 0001
Proc. VLDB Endow.5
2024 HIChain: A Hierarchical IoT Permissioned Blockchain with Edge Cloud Architecture
Tinghao Feng, Zeshun Peng, Yanfeng Zhang 0001, Xiaohua Li 0004, Xiaomei Dong, Ge Yu 0001
WISE (3)2
2022 NeuChain: A Fast Permissioned Blockchain System with Deterministic Ordering
abstract
Blockchain serves as a replicated transactional processing system in a trustless distributed environment. Existing blockchain systems all rely on an explicit ordering step to determine the global order of transactions that are collected from multiple peers. The ordering consensus can be the bottleneck since it must be Byzantine-fault tolerant and can scarcely benefit from parallel execution. In this paper, we propose an ordering-free architecture that makes ordering implicit through deterministic execution. Based on this novel architecture, we develop a permissioned blockchain system NeuChain. A number of key optimizations such as asynchronous block generation and pipelining are leveraged for high throughput and low latency. Several security mechanisms are also designed to make our system robust to malicious attacks. Our geo-distributed experimental results show that NeuChain can achieve 47.2--64.1X throughput improvement over HyperLedger Fabric and 1.6--12.2X throughput improvement over the state-of-the-art high performance blockchains.
Zeshun Peng, Yanfeng Zhang 0001, Haixu Liu, Yuxiao Gao, Xiaohua Li 0004, Ge Yu 0001
Proc. VLDB Endow.1