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

Zhihui Xue

dblp:30/4565 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · conflict

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

Databases, data management, data science and information retrieval · 2 · 2 since 2021Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 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
1 paper
Distributed and cloud data management · 87% Indexing and storage engines · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 87% Cloud and datacenter computing · 13%

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

TopicWeightPapersLastEvidence papers
Distributed and cloud data management › cloud database
multi-tenant database
0.612022
ESDB: Processing Extremely Skewed Workloads in Real-time · SIGMOD Conference 2022
Storage systems › data reduction
data deduplication
0.512021
SLIMSTORE: A Cloud-based Deduplication System for Multi-version Backups · ICDE 2021

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

full-text search · 0.6dynamic secondary hashing · 0.6locality and similarity exploitation · 0.5history-aware deduplication · 0.5
YearPublicationVenuePosition
2025 Configuration Optimization of a Dual-Arm Reconfigurable Space Robot Based on Closed-Chain Inertia Matching
abstract
The dual-arm space robot usually forms a closed-chain constraint system with a target through collaborative operations when performing tasks. Most previous related research has focused on the performance of open-chain robots themselves. Studying the manipulation performance of a closed-chain robot system is of great significance. This article proposes a reconfigurable space robot (RSR) system for on-orbit servicing. A graph theory based framework for the automatic generation of reconfigurable robot models is proposed to address the characteristics of variable topology structures. Meanwhile, a new index – the closed-chain inertia matching index is proposed to evaluate its configuration effectively. Compared with traditional dynamic manipulability ellipsoid (DME) and manipulating force ellipsoid (MFE), the effectiveness of the proposed closed-chain inertia matching ellipsoid (IME) is verified. Compared with the DME and MFE, the IME effectively considers the influence of load and can effectively express the dynamic torque force/torque transmission efficiency from the joint actuator to the load in a closed-chain system. The IME can not only be used to determine the optimal joint configuration under a specific closed-chain configuration, but also to determine the optimal nonisomorphic configuration of a reconfigurable robot. Finally, the results of configuration optimization of the closed-chain dual-arm reconfigurable space robot are given.Note to Practitioners—This paper aims to study the determination of the optimal configuration for the RSR during task execution. Due to its various configurations, the RSR has a complex modeling process. This article proposes a modeling framework for automatically generating RSR models that can effectively achieve automatic modeling of various configurations. In addition, most of the previous related research focused on the performance of open-chain robots themselves, ignoring the impact of load. This article proposes a new closed-chain system performance indicator to evaluate the robot configuration. The proposed evaluation indicator effectively considers the influence of load, which is of practical significance to improve the efficiency of task execution. The effectiveness of the proposed index in determining the optimal configuration is demonstrated by simulation verification. In the future, we will focus on multi-arm collaborative operations under a specific configuration.
Zhihui Xue, Jinguo Liu, Yangmin Li 0001, Junsen Liu
IEEE Trans Autom. Sci. Eng.1
2022 ESDB: Processing Extremely Skewed Workloads in Real-time
abstract
With the rapid growth of cloud computing, efficient management of multi-tenant databases has become a vital challenge for cloud service providers. It is particularly important for Alibaba, which hosts a distributed multi-tenant database supporting one of the world's largest e-commerce platforms. It serves tens of millions of sellers as tenants, and supports transactions from hundreds of millions of buyers. The inherent imbalance of shopping preferences from the buyers essentially generates a drastically skewed workload on the database, which could create unpredictable hotspots and consequently large throughput decline and latency increase. In this paper, we present the architecture and implementation of ESDB (ElasticSearch Database), a cloud-native document-oriented database which has been running on Alibaba Cloud for 5 years as the main transaction database behind Alibaba's e-commerce platform. ESDB provides strong full-text search and retrieval capability, and proposes dynamic secondary hashing as the solution for processing extremely skewed workloads. We evaluate ESDB with both simulated workloads and real-world workloads, and demonstrate that ESDB significantly enhances write throughput and reduces the completion time of writes without sacrificing query throughput.
Jiachi Zhang 0001, Zhihui Xue, Jianjun Deng, Cuiyun Fu, Wenchao Zhou, Sheng Wang 0011, Changcheng Chen, Feifei Li 0001
SIGMOD Conference3
2021 SLIMSTORE: A Cloud-based Deduplication System for Multi-version Backups
abstract
Cloud backup is becoming the preferred way for users to support disaster recovery. In addition to its convenience, users are deeply concerned about reducing storage costs in the face of large-scale backup data. Data deduplication is an effective method for backup storage. However, current deduplicate methods lack the utilization of cloud resources to provide scalable backup service for cloud backup users, and cannot meet the biased preference for different backup versions. For new backup versions, users want higher deduplicate and restore speed to reduce the waiting time. Conversely, reducing storage costs is more necessary for old backup versions.In this paper, we present SLIMSTORE, with a cloud-based deduplication architecture that disassembles the system into a storage layer and a computing layer to support elastic utilization of cloud resources. We propose two types of processing nodes with different design focuses to meet the needs of cloud-based backup. The L-node exploits locality and similarity, and adopts a history-aware strategy to provide fast online deduplication service. L-node also optimizes online restoration to realize high restore efficiency. Meanwhile, the G-node provides exact deduplication offline for the old versions, and helps the restore performance of the new versions by optimizing their physical storage. We compare SLIMSTORE with some state-of-art deduplicate and restore methods. Experimental results show that SLIMSTORE can achieve fast deduplication, efficient restoration, and effective space reduction. Furthermore, SLIMSTORE attains scalable deduplication and restoration.
Huiqi Hu, Zhihui Xue, Changcheng Chen, Cuiyun Fu, Xuan Zhou 0001, Feifei Li 0001
ICDE3
2005 The maximum traveling salesman problem on van der Veen matrices
George Steiner, Zhihui Xue
Discret. Appl. Math.2