Weixing Zhou

dblp:19/9456 · DBLP profile ↗
← Back
5ranked-venue papers in the field
2as first author
5since 2021 · last 2026
0009-0000-9665-6052ORCID · corroborated

Domains — venue-derived; a paper can count in several

Database Systems & Data Management · 4 (2 first)Knowledge Engineering, Semantic Web & Information Systems · 1
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
ICDE5
2025 TaaSDB: A Transaction Management Service Platform Supporting Cross-Model Transactions
Yuan Teng, Weixing Zhou, Zeshun Peng
WISA2
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
ICDE4
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.1
2023 GeoGauss: Strongly Consistent and Light-Coordinated OLTP for Geo-Replicated SQL Database
abstract
Multinational enterprises conduct global business that has a demand for geo-distributed transactional databases. Existing state-of-the-art databases adopt a sharded master-follower replication architecture. However, the single-master serving mode incurs massive cross-region writes from clients, and the sharded architecture requires multiple round-trip acknowledgments (e.g., 2PC) to ensure atomicity for cross-shard transactions. These limitations drive us to seek yet another design choice. In this paper, we propose a strongly consistent OLTP database GeoGauss with full replica multi-master architecture. To efficiently merge the updates from different master nodes, we propose a multi-master OCC that unifies data replication and concurrent transaction processing. By leveraging an epoch-based delta state merge rule and the optimistic asynchronous execution, GeoGauss ensures strong consistency with light-coordinated protocol and allows more concurrency with weak isolation, which are sufficient to meet our needs. Our geo-distributed experimental results show that GeoGauss achieves 7.06X higher throughput and 17.41X lower latency than the state-of-the-art geo-distributed database CockroachDB on the TPC-C benchmark.
Weixing Zhou, Qi Peng 0004, Zijie Zhang 0005, Yanfeng Zhang 0001, Sihao Li, Guo Fu, Yulong Cui, Caiyi Wu, Shangjun Han, Guoliang Li 0001, Ge Yu 0001
Proc. ACM Manag. Data1