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

Panfeng Zhou

dblp:72/5994 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
2since 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 · 1 first-author · 2 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
Storage systems · 91% Cloud and datacenter computing · 9%
Databases, data mining, and information retrieval
1 paper
Database system architecture and tuning · 50% Transaction processing and concurrency control · 50%

Topics — the 6 heaviest of 7, 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
Storage systems
flash and SSD
0.812024
Bwe-tree: An Evolution of Bw-tree on Fast Storage · ICDE 2024
Storage systems › indexing
index structure
0.812024
Bwe-tree: An Evolution of Bw-tree on Fast Storage · ICDE 2024
Storage systems › file systems › write-optimized file system
log-structured file system
0.812024
Bwe-tree: An Evolution of Bw-tree on Fast Storage · ICDE 2024
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

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

primary-replica replication · 1.7b+ tree concurrency control · 1.7RDMA · 1.7structural modification operations · 0.8page concurrency control · 0.8
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.6
2024 Bwe-tree: An Evolution of Bw-tree on Fast Storage
abstract
Modern data-centric applications frequently need to store and read data with low latency. These requirements are difficult to achieve, even on high performance processors paired with fast solid state drives (SSDs). To this end, LSM tree is widely used in many systems such as in RocksDB and considered as an ideal index structure that fits SSDs. However, in spite of many improvements to LSM tree over the years, fundamental problems of limited read performance and expensive compaction operations remain. Microsoft Research proposed Bw-tree, a variant of B+ tree layered on top of log structured storage. Bw-tree achieves fast ingestion of data, similar to LSM tree, meanwhile it has less drawback on read performance and compaction. However, except for Microsoft, the industrial strength implementation of Bw-tree is rare. The open source OpenBw-Tree from Carnegie Mellon University was designed only for main memory. This paper describes Bwe-tree, an implementation and a significant evolution of Bw-tree on fast storage. It makes two contributions. First, Bwe-tree addresses reliability and performance issues revealed during running Bw-tree on fast storage in production, by revising structural modification operations, introducing page concurrency control, and storing large-size values off-tree. Performance improvements over Bw-tree are verified by experiments. Second, it demonstrates that Bw-tree is an effective alternative tree structure on SSDs. Compared to RocksDB (LSM tree) and BerkeleyDB (B+ tree), Bwe-vtree performs dramatically better (up to 3X or more) for the YCSB workloads. Our Bwe-vtree implementation has been integrated into production systems in Alibaba, including a flagshin cloud-native database service.
Rui Wang 0002, Xinjun Yang, Feifei Li 0001, David B. Lomet, Panfeng Zhou, Yongxiang Chen, Jingren Zhou 0001, Jiesheng Wu
ICDE6
2013 Analysis and Modeling of the LTE Broadband Channel for Train-Ground Communications on High-Speed Railway
abstract
The increasing interest that has been drawn to LTE system used in High-Speed Railway therefore requires measurement and analysis of broadband mobile channel for train-ground communications. By the approval of the Ministry of Railways of China, extensive and practical measurements are performed on Harbin- Dalian passenger dedicated line with the maximum running speed of 370 km/h. Based on the hierarchical two-hop network structure, this paper first presents comprehensive analyzed results of channel characteristics in viaduct scenario, including both the large-scale and small-scale fading parameters. The proposed path loss model benefits LTE system link budget and feasible transceiver-range determination. In particular, channel impulse response, power delay profile, the delay spread, the number of paths and delay-Doppler spectrum are extracted, evaluated and reported. All these informative results promote the evaluation and verification of broadband communication system on High-Speed Railway.
Min Zhao 0002, Muqing Wu, Yanzhi Sun, Guiyuan Jia, Shiping Di, Panfeng Zhou, Xiangbing Zeng, Shuyun Ge
VTC Fall6
2013 Analysis and Modeling for Train-Ground Wireless Wideband Channel of LTE on High-Speed Railway
abstract
The increasing interest that has been drawn to the LTE system used in High-Speed Railway therefore requires measurements and analysis of wideband mobile channel for train-ground communications. Based on the hierarchical two-hop network structure, extensive and practical measurements are performed on Harbin-Dalian passenger dedicated line with a speed up to 370 km/h by the approval of the Ministry of Railways of China. This paper first presents comprehensive analyzed results of the statistical channel properties, including both the large-scale and small-scale fading parameters. The proposed path loss model is applicable to high-speed railway plain scenarios and benefits the link budget of the LTE system. In particular, channel impulse response, power delay profile, the delay spread, the number of paths and delay-Doppler spectrum are extracted, evaluated and reported. All these results promote the evaluation and verification of wireless wideband communications on the high-peed railway.
Min Zhao 0002, Muqing Wu, Yanzhi Sun, Deshui Yu, Shiping Di, Panfeng Zhou, Xiangbing Zeng, Shuyun Ge
VTC Spring6
2008 The hB-pi* Tree: An Optimized Comprehensive Access Method for Frequent-Update Multi-dimensional Point Data
Panfeng Zhou, Betty Salzberg
SSDBM1