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

Fanyu Kong 0004

dblp:05/3013-4 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0002-8911-8533ORCID · conflict

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

Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 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.

Databases, data mining, and information retrieval
2 papers
Transaction processing and concurrency control · 57% Distributed and cloud data management · 43%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control
deadlock detection and resolution
0.912025
LCL+: a Lock Chain Length-based Distributed Deadlock Detection and Resolution Service Built for OceanBase · ACM Trans. Comput. Syst. 2025
Distributed systems › concurrency control › deadlock detection
distributed deadlock detection
0.912025
LCL+: a Lock Chain Length-based Distributed Deadlock Detection and Resolution Service Built for OceanBase · ACM Trans. Comput. Syst. 2025
Distributed and cloud data management
distributed database architecture
0.712023
OceanBase Paetica: A Hybrid Shared-nothing/Shared-everything Database for Supporting Single Machine and Distributed Cluster · Proc. VLDB Endow. 2023
Distributed systems
distributed coordination
0.312025
LCL+: a Lock Chain Length-based Distributed Deadlock Detection and Resolution Service Built for OceanBase · ACM Trans. Comput. Syst. 2025

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

lock chain length analysis · 1.7fault injection · 1.7parallel execution · 0.7adaptive configuration · 0.7
YearPublicationVenuePosition
2025 LCL+: a Lock Chain Length-based Distributed Deadlock Detection and Resolution Service Built for OceanBase
abstract
The problem of deadlock detection and resolution in database systems has been studied for decades. Although it has long been a mature feature of classical centralized database systems for many years, its use in distributed database systems remains in its infancy. A simple and fully distributed deadlock detection and resolution algorithm was proposed by Don P. Mitchell and Michael J. Merritt ( M&M ), but its assumption that each process waits for only one resource at a time prevents it from being generally applicable. The distributed deadlock detection algorithm based on Lock Chain Length (LCL) surpasses the limitations of the M&M algorithm. However, it is less effective in quickly detecting deadlocks that encompass both distributed and local deadlocks. In this article, we introduce LCL + , an advanced and universally applicable algorithm specifically designed for the detection and resolution of resource deadlocks in distributed environments. This algorithm improves the efficiency of identifying distributed deadlocks by accelerating the detection of hybrid deadlocks. Our extensive experiments demonstrate that LCL + significantly outperforms its predecessor, LCL, in efficiency. In addition, it has been successfully implemented in the OceanBase distributed relational database system. Detailed analyses from multiple perspectives within OceanBase confirm that LCL + significantly improves the system’s scalability and ensures the provision of high-quality service.
Xuwang Teng, Fanyu Kong 0004, Fusheng Han, Quanqing Xu, Daokun Hu
ACM Trans. Comput. Syst.4
2023 OceanBase Paetica: A Hybrid Shared-nothing/Shared-everything Database for Supporting Single Machine and Distributed Cluster
abstract
In the ongoing evolution of the OceanBase database system, it is essential to enhance its adaptability to small-scale enterprises. The OceanBase database system has demonstrated its stability and effectiveness within the Ant Group and other commercial organizations, besides through the TPC-C and TPC-H tests. In this paper, we have designed a stand-alone and distributed integrated architecture named Paetica to address the overhead caused by the distributed components in the stand-alone mode, with respect to the OceanBase system. Paetica enables adaptive configuration of the database that allows OceanBase to support both serial and parallel executions in stand-alone and distributed scenarios, thus providing efficiency and economy. This design has been implemented in version 4.0 of the OceanBase system, and the experiments show that Paetica exhibits notable scalability and outperforms alternative stand-alone or distributed databases. Furthermore, it enables the transition of OceanBase from primarily serving large enterprises to truly catering to small and medium enterprises, by employing a single OceanBase database for the successive stages of enterprise or business development, without the requirement for migration. Our experiments confirm that Paetica has achieved linear scalability with the increasing CPU core number within the stand-alone mode. It also outperforms MySQL and Greenplum in the Sysbench and TPC-H evaluations.
Zhifeng Yang, Quanqing Xu, Shanyan Gao, Chuanhui Yang, Yuzhong Zhao, Fanyu Kong 0004, Wanhong Wang, Jinliang Xiao
Proc. VLDB Endow.7