EDBT 2026 Demo / reviewers in the wild / expert
Zihan Xie
dblp:267/0809
· DBLP profile ↗
6ranked-venue papers
1as first author
6since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Memory systems · 67% Hardware accelerators and domain-specific architectures · 33% | |
| Network and information security
1 paper |
Security and privacy of machine learning · 50% Privacy and data protection · 50% | |
| Artificial intelligence
1 paper |
Language models and text generation · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Graph data management · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection
differential privacy |
1.0 | 1 | 2026 | Parameter-Agnostic Privacy-Preserving Machine Unlearning for Large Language Models · IEEE Trans. Inf. Forensics Secur. 2026 |
Security and privacy of machine learning
machine unlearning |
1.0 | 1 | 2026 | Parameter-Agnostic Privacy-Preserving Machine Unlearning for Large Language Models · IEEE Trans. Inf. Forensics Secur. 2026 |
Memory systems
cache management |
1.0 | 1 | 2026 | CEGraph: Cache-Efficient Management for Streaming Graph Processing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026 |
Memory systems › cache management
cache replacement |
1.0 | 1 | 2026 | CEGraph: Cache-Efficient Management for Streaming Graph Processing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026 |
Hardware accelerators and domain-specific architectures › graph processing accelerator
streaming graph processing |
1.0 | 1 | 2026 | CEGraph: Cache-Efficient Management for Streaming Graph Processing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026 |
Natural language and speech › Language models and text generation › trustworthy language model
large language model privacy |
0.3 | 1 | 2026 | Parameter-Agnostic Privacy-Preserving Machine Unlearning for Large Language Models · IEEE Trans. Inf. Forensics Secur. 2026 |
Graph data management › graph processing
streaming graph processing |
0.3 | 1 | 2026 | CEGraph: Cache-Efficient Management for Streaming Graph Processing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026 |
Methods — techniques the papers use, named apart from their topics
vertex importance evaluation · 2.0semantic filtering · 2.0information retrieval · 2.0differential privacy · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | CEGraph: Cache-Efficient Management for Streaming Graph ProcessingabstractEfficient processing of streaming graphs is crucial to improve system performance. Due to the highly irregular and frequent access to data in streaming graph processing, existing cache management methods are difficult to accurately predict cache behavior, resulting in serious cache misses. To address the issues, we propose CEGraph, an efficient cache management approach for streaming graph processing. Specifically, for graph data, we propose a cache replacement policy based on vertex importance. This policy accurately evaluates the importance of vertices in the incremental processing of streaming graphs from our proposed three factors: the association degree of affected state of a vertex, the path distance of a vertex, and whether a vertex will be updated. Vertices with high importance are identified and kept in the cache to reduce cache thrashing. Experimental results reveal that compared with LRU, DRRIP and Grasp, CEGraph reduces the LLC misses by an average of 22.93% (maximum 34.27%), 20.87% and 11.91%, respectively. Compared with the state-of-the-art cache management method P-OPT, CEGraph reduces the LLC misses by 6.46% on average, therefore demonstrating the effectiveness of CEGraph. Fubing Mao, Zihan Xie, Longyu Nie, Yu Zhang 0027, Haikun Liu, Xiaofei Liao, Hai Jin 0001, Wei Zhang 0012, Yapu Guo, Jingkang Liu |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 2 |
| 2026 | Parameter-Agnostic Privacy-Preserving Machine Unlearning for Large Language ModelsabstractIn recent years, advancements in large language models have led to significant innovation and critical progress in AI. However, some of these innovations are raising privacy and security concerns. Machine unlearning has therefore emerged as a potential solution to mitigate such risks. Yet, while erasing data records from traditional models is relatively straightforward, making a large language model “forget” what it has learned is often very challenging. This is not just because they include so many parameters, it is also because the knowledge they possess is intricately entangled. Further, the privacy risk of unlearned data remains neglected in most unlearning solutions. To overcome these limitations, we took advantage of information retrieval and developed an efficient privacy-preserving unlearning mechanism. Our solution eliminates the impact of targeted information by removing high-risk semantic meanings from the model’s output. It also incorporates differentially-private randomization to make the unlearned information statistically indiscernible. Most importantly, the algorithm requires neither parametric fine-tuning nor in-context prompt calibration. A theoretical analysis demonstrates that this method satisfies rigorous privacy and unlearning guarantees. Additionally, experiments on real-world datasets prove that the method is both effective and has the capacity to handle practical unlearning tasks for large language model applications. Lefeng Zhang, Tianqing Zhu, Zihan Xie, Shang Wang 0004, Binxing Fang, Wanlei Zhou 0001 |
IEEE Trans. Inf. Forensics Secur. | 3 |
| 2025 | The Evaluation of Retrieval-Based Unlearning Mechanisms on Large Language Models
Zihan Xie, Lefeng Zhang, Minfeng Qi |
KSEM (3) | 1 |
| 2025 | I Can Still Steal Your Encoder: A Defense-Penetrating Encoder-Stealing Attack
Rongbin Xiao, Changyu Dong, Jie Zhang 0008, Zihan Xie |
PRCV (18) | 5 |
| 2024 | ReadCurrent: a VDCNN-based tool for fast and accurate nanopore selective sequencingabstractNanopore selective sequencing allows the targeted sequencing of DNA of interest using computational approaches rather than experimental methods such as targeted multiplex polymerase chain reaction or hybridization capture. Compared to sequence-alignment strategies, deep learning (DL) models for classifying target and nontarget DNA provide large speed advantages. However, the relatively low accuracy of these DL-based tools hinders their application in nanopore selective sequencing. Here, we present a DL-based tool named ReadCurrent for nanopore selective sequencing, which takes electric currents as inputs. ReadCurrent employs a modified very deep convolutional neural network (VDCNN) architecture, enabling significantly lower computational costs for training and quicker inference compared to conventional VDCNN. We evaluated the performance of ReadCurrent across 10 nanopore sequencing datasets spanning human, yeasts, bacteria, and viruses. We observed that ReadCurrent achieved a mean accuracy of 98.57% for classification, outperforming four other DL-based selective sequencing methods. In experimental validation that selectively sequenced microbial DNA from human DNA, ReadCurrent achieved an enrichment ratio of 2.85, which was higher than the 2.7 ratio achieved by MinKNOW using the sequence-alignment strategy. In summary, ReadCurrent can rapidly classify target and nontarget DNA with high accuracy, providing an alternative in the toolbox for nanopore selective sequencing. ReadCurrent is available at https://github.com/Ming-Ni-Group/ReadCurrent. Kechen Fan, Jiarong Zhang, Zihan Xie, Daguang Jiang, Xiaochen Bo, Shenghui Shi |
Briefings Bioinform. | 4 |
| 2024 | The prominent and heterogeneous gender disparities in scientific novelty: Evidence from biomedical doctoral theses
Meijun Liu, Zihan Xie, Alex Jie Yang, Jian Xu 0003, Ying Ding 0001, Yi Bu 0001 |
Inf. Process. Manag. | 2 |