Zhongle Xie

Zhongle Xie

Auto-generated profile, based on publicly available information

Zhongle Xie

Zhejiang University

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 March 2025 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JZJun Zhang
Jun Zhang
JWJue Wang
Jue Wang
HLHUAN LI
HUAN LI
ZXZhongle Xie
Zhongle Xie
KCKe Chen
Ke Chen
LSLidan Shou
Lidan Shou
Active learning (AL) reduces human annotation costs for machine learning systems by strategically selecting the most informative unlabeled data for annotation, but performing it individually may still be insufficient due to restricted data diversity and annotation budget. Federated Active Learning (FAL) addresses this by facilitating collaborative data selection and model training, while preserving the confidentiality of raw data samples. Yet, existing FAL methods fail to account for the heterogeneity of data distribution across clients and the associated fluctuations in global and local model parameters, adversely affecting model accuracy. To overcome these challenges, we propose ${\sf CHASe}$ (Client Heterogeneity-Aware Data Selection), specifically designed for FAL. ${\sf CHASe}$ focuses on identifying those unlabeled samples with high epistemic variations (EVs), which notably oscillate around the decision boundaries during training. To achieve both effectiveness and efficiency, ${\sf CHASe}$ encompasses techniques for 1) tracking EVs by analyzing inference inconsistencies across training epochs, 2) calibrating decision boundaries of inaccurate models with a new alignment loss, and 3) enhancing data selection efficiency via a data freeze and awaken mechanism with subset sampling. Experiments show that ${\sf CHASe}$ surpasses various established baselines in terms of effectiveness and efficiency, validated across diverse datasets, model complexities, and heterogeneous federation settings.

22 October 2025 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
PLPengkai Lu
Pengkai Lu
ZXZhongle Xie
Zhongle Xie
DJDawei Jiang
Dawei Jiang
KCKe Chen
Ke Chen
LSLidan Shou
Lidan Shou

20 February 2023 in arXiv
Verified
Preprint
Open access
PDF file
CYCong Yue
Cong Yue
TDTien Tuan Anh Dinh
Tien Tuan Anh Dinh
ZXZhongle Xie
Zhongle Xie
MZMeihui Zhang
Meihui Zhang
GCGang Chen
Gang Chen
XXXiaokui Xiao
Xiaokui Xiao
Verifiable ledger databases protect data history against malicious tampering. Existing systems, such as blockchains and certificate transparency, are based on transparency logs -- a simple abstraction allowing users to verify that a log maintained by an untrusted server is append-only. They expose a simple key-value interface. Building a practical database from transparency logs, on the other hand, remains a challenge. In this paper, we explore the design space of verifiable ledger databases along three dimensions: abstraction, threat model, and performance. We survey existing systems and identify their two limitations, namely, the lack of transaction support and the inferior efficiency. We then present GlassDB, a distributed database that addresses these limitations under a practical threat model. GlassDB inherits the verifiability of transparency logs, but supports transactions and offers high performance. It extends a ledger-like key-value store with a data structure for efficient proofs, and adds a concurrency control mechanism for transactions. GlassDB batches independent operations from concurrent transactions when updating the core data structures. In addition, we design a new benchmark for evaluating verifiable ledger databases, by extending YCSB and TPC-C benchmarks. Using this benchmark, we compare GlassDB against four baselines: reimplemented versions of three verifiable databases, and a verifiable map backed by a transparency log. Experimental results demonstrate that GlassDB is an efficient, transactional, and verifiable ledger database.

11 November 2026 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JLJiaye Li
Jiaye Li
ZXZhongle Xie
Zhongle Xie
KCKe Chen
Ke Chen
LSLidan Shou
Lidan Shou
GYGongsheng Yuan
Gongsheng Yuan
GCGang Chen
Gang Chen

8 December 2025 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
XCXinyu Chen
Xinyu Chen
ZXZhongle Xie
Zhongle Xie
HLHUAN LI
HUAN LI
KCKe Chen
Ke Chen
LSLidan Shou
Lidan Shou
GCGang Chen
Gang Chen
Deep neural network (DNN) models are crucial for Internet-of-Things (IoT) applications. In a multi-access edge computing (MEC) system, IoT devices dispatch their requests to a nearby edge server to accelerate DNN inference. Recently, processing-in-memory (PIM) accelerators have emerged for DNN inference due to their power and area efficiency. However, current scheduling methods primarily focus on single-DNN workloads and do not fully utilize PIM’s potential for managing multi-DNN workloads in MEC scenarios. Additionally, PIM accelerators face challenges such as inflexible resource allocation and costly write operations, constraining the direct application of GPU scheduling techniques. In this paper, we define the multi-DNN scheduling problem on the PIM accelerator. To reduce the problem’s complexity, we propose a heuristic optimization algorithm, called Leader-Follower. Using this algorithm, we present PimShare, a scheduler for the PIM accelerator to process multi-DNN workloads. PimShare schedules multi-DNN inference requests to enable both temporal and spatial multiplexing, which can enhance hardware utilization. Compared with baseline scheduling methods, including those adapted from GPU scheduling, PimShare can achieve up to a two-order-of-magnitude improvement in throughput and scale the high throughput to workloads containing 18 DNN models. In addition, PimShare reduces write operations and processing latency.

4 December 2025 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
SWSai Wu
Sai Wu
RXRuichen Xia
Ruichen Xia
DYDingyu Yang
Dingyu Yang
RWRui Wang
Rui Wang
HLHuihang Lai
Huihang Lai
GCGang Chen
Gang Chen
The increasing demand for deep neural inference within database environments has driven the emergence of AI?native DBMSs. However, existing solutions either rely on model-centric designs requiring developers to manually select, configure, and maintain models, resulting in high development overhead, or adopt task-centric AutoML approaches with high computational costs and poor DBMS integration. We present MorphingDB, a task-centric AI-native DBMS that automates model storage, selection, and inference within PostgreSQL. To enable flexible, I/O-efficient storage of deep learning models, we first introduce specialized schemas and multi-dimensional tensor data types to support BLOB-based all-in-one and decoupled model storage. Then we design a transfer learning framework for model selection in two phases, which builds a transferability subspace via offline embedding of historical tasks and employs online projection through feature-aware mapping for real-time tasks. To further optimize inference throughput, we propose pre-embedding with vectoring sharing to eliminate redundant computations and DAG-based batch pipelines with cost-aware scheduling to minimize the inference time. Implemented as a PostgreSQL extension with LibTorch, MorphingDB outperforms AI-native DBMSs (EvaDB, Madlib, GaussML) and AutoML platforms (AutoGluon, AutoKeras, AutoSklearn) across nine public datasets, encompassing series, NLP, and image tasks. Our evaluation demonstrates a robust balance among accuracy, resource consumption, and time cost in model selection and significant gains in throughput and resource efficiency.