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

Xingxuan Zhou

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

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

Databases, data management, data science and information retrieval · 3 · 3 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.

Databases, data mining, and information retrieval
3 papers
Transaction processing and concurrency control · 37% Recommender systems · 26% Database system architecture and tuning · 22%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 62% Storage systems · 38%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control
distributed transaction processing
0.912025
From Scale-Up to Scale-Out: PolarDB's Journey to Achieving 2 Billion tpmC · Proc. VLDB Endow. 2025
Transaction processing and concurrency control › isolation levels
snapshot isolation
0.612022
Remus: Efficient Live Migration for Distributed Databases with Snapshot Isolation · SIGMOD Conference 2022
Recommender systems
click-through rate prediction
0.512021
GemNN: Gating-enhanced Multi-task Neural Networks with Feature Interaction Learning for CTR Prediction · SIGIR 2021
Recommender systems › click-through rate prediction
feature interaction learning
0.512021
GemNN: Gating-enhanced Multi-task Neural Networks with Feature Interaction Learning for CTR Prediction · SIGIR 2021
Cloud and datacenter computing
database-as-a-service
0.312025
From Scale-Up to Scale-Out: PolarDB's Journey to Achieving 2 Billion tpmC · Proc. VLDB Endow. 2025
Storage systems › distributed storage
disaggregated storage
0.312025
From Scale-Up to Scale-Out: PolarDB's Journey to Achieving 2 Billion tpmC · Proc. VLDB Endow. 2025
Cloud and datacenter computing › elastic computing
cloud elasticity
0.212022
Remus: Efficient Live Migration for Distributed Databases with Snapshot Isolation · SIGMOD Conference 2022

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

primary-replica replication · 1.7b+ tree concurrency control · 1.7RDMA · 1.7unidirectional dual execution · 1.1parameter server · 0.5neural network · 0.5multi-task learning · 0.5gating mechanism · 0.5
YearPublicationVenuePosition
2025 From Scale-Up to Scale-Out: PolarDB's Journey to Achieving 2 Billion tpmC
abstract
In the past decade, cloud databases have experienced rapid development and growth. PolarDB, Alibaba's cloud-native OLTP database, has evolved significantly to meet the increasing demand for cloud-native architectures and now serves hundreds of thousands of customers across various industries. This paper presents PolarDB's evolution over the past eight years, with a focus on scalability, performance, and cost-efficiency. Initially, PolarDB adopted a primary-replica architecture based on disaggregated storage, with an emphasis on enhancing single-node performance for scale-up in modern many-core systems. To achieve this, we co-designed PolarDB with cutting-edge hardware, including RDMA, to improve performance. Meanwhile, we refined the internal architecture, including improvements to B+ tree concurrency control and transaction management, ensuring high scalability in scale-up scenarios. More recently, our focus has shifted to scaling out PolarDB to meet the performance and scalability needs of ultra-large-scale applications. By leveraging RDMA, we optimized distributed transaction processing, transforming PolarDB into a high-performance, high-scalability and cost-effective distributed database. In the TPC-C benchmark, PolarDB scaled out to 2340 nodes and achieved over 2 billion tpmC, with a jitter rate of no more than 0.16% during the 8-hour stress test. Compared to the second- and third-highest-performing databases in public TPC-C results, PolarDB's tpmC is 2.52× and 2.91× higher, respectively. In terms of cost-effectiveness, PolarDB's per-tpmC cost is 37% and 79.5% lower than that of the other two systems, respectively.
Xinjun Yang, Feifei Li 0001, Yingqiang Zhang, Hao Chen 0080, Qingda Hu, Panfeng Zhou, Zongzhi Chen, Zheyu Miao, Rongbiao Xie, Zetao Wei, Xingxuan Zhou
Proc. VLDB Endow.15
2022 Remus: Efficient Live Migration for Distributed Databases with Snapshot Isolation
abstract
Shared-nothing, distributed databases scale transactional and analytical processing over a large data volume by spreading data across servers. However, static sharding of data across nodes makes such systems fail to timely adapt to changing workloads and struggle to obey the cloud pay-as-you-go model. Migrating shards between nodes online is a key technique to react to dynamic changes of workloads for cloud elasticity. Existing approaches introduce severely degraded performance and service interruption, resulting in SLA violation on the cloud; or they are tailor-made to deterministic databases. In this paper, we propose Remus, a new live migration approach for shared-nothing, distributed databases with snapshot isolation. Remus migrates shards between nodes with zero service interruption and minimal performance impact. This is achieved by an efficient unidirectional dual execution during migration. We implement Remus on a shared-nothing, distributed version of PolarDB-PG and evaluate it against state-of-the-art approaches using standard OLTP workloads TPC-C and YCSB, and hybrid workloads consisting of long-lived and short transactions. The results demonstrate Remus is the only effective approach to achieve the goal of zero transaction interruption, zero downtime and marginal performance impact, paving the way for applying the shared-nothing architecture to a cloud database which needs to provide elasticity while guaranteeing strict SLAs.
Junbin Kang, Le Cai, Feifei Li 0001, Xingxuan Zhou, Wei Cao 0006, Songlu Cai, Daming Shao
SIGMOD Conference4
2021 GemNN: Gating-enhanced Multi-task Neural Networks with Feature Interaction Learning for CTR Prediction
abstract
Deep neural network (DNN) models have been widely used for click-through rate (CTR) prediction in online advertising. The training framework typically consists of embedding layers and multi-layer perceptions (MLP). At Baidu Search Ads (a.k.a. Phoenix Nest), the new generation of CTR training platform has become PaddleBox, a GPU-based parameter server system. In this paper, we present Baidu's recently updated CTR training framework, called Gating-enhanced Multi-task Neural Networks (GemNN). In particular, we develop a neural network based multi-task learning model to predict CTR in a coarse-to-fine manner, which gradually reduces ad candidates and allows parameter sharing from upstream tasks to downstream tasks to improve the training efficiency. Also, we introduce a gating mechanism between embedding layers and MLP to learn feature interactions and control the information flow fed to MLP layers. We have launched our solution in Baidu PaddleBox platform and observed considerable improvements in both offline and online evaluations. It is now part of the current production~system.
Hongliang Fei, Xingxuan Zhou, Junhao Zhao, Xinyang Qi, Ping Li 0001
SIGIR3