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.

Junquan Chen

dblp:93/163 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
3since 2021 · last 2026
0000-0002-4353-9327ORCID · corroborated

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

Databases, data management, data science and information retrieval · 4 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 first-author · 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
Distributed and cloud data management · 29% Transaction processing and concurrency control · 29% Indexing and storage engines · 29%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed and cloud data management › distributed database architecture
distributed relational database
0.612022
OceanBase: A 707 Million tpmC Distributed Relational Database System · Proc. VLDB Endow. 2022
Transaction processing and concurrency control
distributed transaction processing
0.612022
OceanBase: A 707 Million tpmC Distributed Relational Database System · Proc. VLDB Endow. 2022
Indexing and storage engines › storage management
storage engine
0.612022
OceanBase: A 707 Million tpmC Distributed Relational Database System · Proc. VLDB Endow. 2022
Distributed systems
fault tolerance
0.212022
OceanBase: A 707 Million tpmC Distributed Relational Database System · Proc. VLDB Endow. 2022
Information retrieval
keyword search
0.112009
Hermes: a travel through semantics on the data web · SIGMOD Conference 2009
Data integration and cleaning
schema mapping
0.112009
Hermes: a travel through semantics on the data web · SIGMOD Conference 2009
Data models and query languages
structured query
0.112009
Hermes: a travel through semantics on the data web · SIGMOD Conference 2009

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

shared-nothing architecture · 1.1multi-tenancy · 1.1schema matching · 0.1
YearPublicationVenuePosition
2026 OceanBase Mercury: Building a Distributed Real-Time Analytical Processing Database System
Quanqing Xu, Chuanhui Yang, Dongdong Xie 0004, Junquan Chen, Saitong Zhao, Fusheng Han
ICDE7
2024 TA-ASF: Attention-Sensitive Token Sampling and Fusing for Visual Transformer Models on the Edge
abstract
Vision Transformers ($V$iTs) have made significant progress in achieving performance comparable to traditional convolutional neural networks in computer vision tasks. However, high computational complexity restricts their application to resource-constrained edge devices. Previous methods for pruning redundant tokens have shown that it is possible to balance performance and computational cost by reducing the number of tokens. Unfortunately, simply removing redundant tokens often leads to the loss of crucial information. To address this issue, we propose a novel token compression scheme called TA-ASF. This scheme considers both the global role of low-importance tokens and the redundancy among similar tokens. TA-ASF employs novel approaches for token sampling and fusion, which are directly applicable to$V$iTs without introducing additional trainable parameters. A comprehensive evaluation against several edge devices demonstrates our method effectively reduces model complexity while preserving Top-1 accuracy. Experimental results show that on the ImageNet dataset, the proposed method reduces FLOPs by 37% and increases throughput by 1.48 times on the DeiT-S model, with only a 0.1% decrease in accuracy. Specifically, on the DeiT-B model, the proposed method decreases FLOPs by 35% and increases throughput by 1.52 times while maintaining the same accuracy.
Junquan Chen, Xingzhou Zhang, Wei Zhou 0011, Weisong Shi
SEC1
2022 OceanBase: A 707 Million tpmC Distributed Relational Database System
abstract
We have designed and developed OceanBase, a distributed relational database system from the very basics for a decade. Being a scale-out multi-tenant system, OceanBase is cross-region fault tolerant, which is based on the shared-nothing architecture. Besides sharing many similar goals with alternative distributed DBMS, such as horizontal scalability, fault-tolerance, etc., our design has been driven by the demands of typical RDBMS compatibility as well as both on-premise and off-premise deployments. OceanBase has fulfilled its design goal. It implements the salient features of certain mainstream classical RDBMS, and most applications on them can run on OceanBase, with or without a few minor modifications. Tens of thousands of OceanBase servers have been deployed in Alipay.com as well as many other commercial organizations. It has also successfully passed the TPC-C benchmark test and seized the first place with more than 707 million tpmC. This paper presents the goals, design criteria, infrastructure, and key components of OceanBase including its engines for storage and transaction processing. Further, it details how OceanBase achieves the above leading TPC-C benchmark in a distributed cluster with more than 1,500 servers from 3 zones. It also describes lessons what we have learnt in building OceanBase for more than a decade.
Chuanhui Yang, Fusheng Han, Mingqiang Zhuang, Zhifeng Yang, Xiaojun Cheng, Yuzhong Zhao, Wenhui Shi, Huafeng Xi, Huang Yu, Yi Pan 0001, Boxue Yin, Junquan Chen, Quanqing Xu
Proc. VLDB Endow.15
2010 Effective and Efficient Keyword Query Interpretation Using a Hybrid Graph
Junquan Chen, Kaifeng Xu, Haofen Wang, Wei Jin 0006, Yong Yu 0001
WISE1
2009 Hermes: a travel through semantics on the data web
abstract
The Web as a global information space is developing from a Web of documents to a Web of data. This development opens new ways for addressing complex information needs. Search is no longer limited to matching keywords against documents, but instead complex information needs can be expressed in a structured way, with precise answers as results. In this paper, we demonstrate Hermes, an infrastructure for data web search. To provide an end-user oriented interface, we support expressive keyword search by translating user information needs into structured queries. We integrate heterogeneous web data sources with automatically computed mappings. Schema-level mappings are exploited in constructing structured queries against the integrated schema. These structured queries are decomposed into queries against the local web data sources, which are then processed in a distributed way.
Haofen Wang, Thomas Penin, Kaifeng Xu, Junquan Chen, Xinruo Sun, Linyun Fu, Qiaoling Liu, Yong Yu 0001, Thanh Tran 0001, Peter Haase 0001, Rudi Studer
SIGMOD Conference4