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

Xizi Ni

dblp:222/6345 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0002-6257-200XORCID · corroborated

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

Artificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 2 · 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.

Databases, data mining, and information retrieval
2 papers
Distributed and cloud data management · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Distributed and cloud data management › consistency maintenance
data synchronization
0.912025
Local-to-Cloud Database Synchronization via Fine-Grained Hybrid Compression · ICDE 2025
Distributed and cloud data management › data replication
log-based replication
0.912025
Local-to-Cloud Database Synchronization via Fine-Grained Hybrid Compression · ICDE 2025
Cloud and datacenter computing
cluster resource management and scheduling
0.812024
Towards Millions of Database Transmission Services in the Cloud · Proc. VLDB Endow. 2024
Cloud and datacenter computing
database-as-a-service
0.812024
Towards Millions of Database Transmission Services in the Cloud · Proc. VLDB Endow. 2024

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

transaction dependency tracking · 1.5serverless computing · 1.5batching · 1.5hybrid adaptive compression · 0.9fine-grained block parsing · 0.9
YearPublicationVenuePosition
2025 Local-to-Cloud Database Synchronization via Fine-Grained Hybrid Compression
abstract
With the increasing migration of business operations to the cloud, cloud service providers are facing a growing demand for faster database synchronization across diverse network conditions. Thus, compression methods are predominantly employed over the synchronized database binlog files to reduce the volume of data to be transmitted across the network. However, previous solutions typically rely on using one single compression method. This can result in data compression rates failing to align well with network bandwidth, causing data to wait for compression or transmission, thereby leading to inferior performance. To address the above issues, we propose a fine-grained hybrid adaptive compression system that (1) parses binlog files into multiple fine-grained blocks, and (2) applies a hybrid combination of multiple compression methods to seamlessly align compression speed with the network bandwidth. We have conducted extensive evaluations which demonstrate that, compared to the cutting-edge compression methods like ZSTD, LZ4, and Snappy, our approach can cut down the average latency by 66% and improve the synchronization throughput by 2.45×.
Guoying Zhu, Haipeng Dai 0001, Kang Yuan, Lida Chen, Zhenghong Luo, Meng Li 0010, Rong Gu 0001, Xizi Ni, Hua Fan 0002, Dachao Fu, Wenchao Zhou
ICDE9
2024 Towards Millions of Database Transmission Services in the Cloud
abstract
Alibaba relies on its robust database infrastructure to facilitate realtime data access and ensure business continuity despite regional disruptions. To address these operational imperatives, Alibaba developed the Data Transmission Service (DTS), which has become critical for internal applications and public cloud services alike. This paper presents a comprehensive study of the architectural innovations, resource scheduling mechanisms, and performance optimization strategies that have been implemented within DTS to tackle the significant challenges of cross-network, heterogeneous data transmission in a cost-effective manner. We explore the novel Any-to-Any (A2A) architecture, which simplifies the complexity of data paths between diverse databases and mitigates network connectivity issues, thereby significantly reducing development overhead. Additionally, we examine a dynamic network bandwidth scheduling algorithm that effectively maintains Service-Level Objectives (SLOs), complemented by a serverless mechanism that ensures efficient resource utilization. Furthermore, DTS utilizes advanced strategies such as transaction dependency tracking, hot data consolidation, and batching to enhance synchronization performance and efficiency. DTS has distilled the lessons learned from years of serving our customer base and currently supports nearly 1 million public cloud instances annually. Our evaluation results show that DTS can effectively and efficiently handle real-time data transmission in both experimental and production environments.
Hua Fan 0002, Dachao Fu, Jiachi Zhang 0002, Chaoji Zuo, Zhengyi Wu, Kang Yuan, Xizi Ni, Huo Guocheng, Wenchao Zhou, Feifei Li 0001, Jingren Zhou 0001
Proc. VLDB Endow.9
2020 R2-Based Hypervolume Contribution Approximation
abstract
In this letter, a new hypervolume contribution approximation method is proposed which is formulated as an R2 indicator. The basic idea of the proposed method is to use different line segments only in the hypervolume contribution region for the hypervolume contribution approximation. Comparing with a traditional method which is based on the R2 indicator to approximate the hypervolume, the new method can directly approximate the hypervolume contribution and will utilize all the direction vectors only in the hypervolume contribution region. The new method, the traditional method, and the Monte Carlo sampling method together with two exact methods are compared through comprehensive experiments. Our results show the advantages of the new method over the other methods. Comparing with the other two approximation methods, the new method achieves the best performance for comparing hypervolume contributions of different solutions and identifying the solution with the smallest hypervolume contribution. Comparing with the exact methods, the new method is computationally efficient in high-dimensional spaces where the exact methods are impractical to use.
Ke Shang 0004, Hisao Ishibuchi, Xizi Ni
IEEE Trans. Evol. Comput.3
2020 Erratum to "R2-Based Hypervolume Contribution Approximation"
Ke Shang 0004, Hisao Ishibuchi, Xizi Ni
IEEE Trans. Evol. Comput.3