I’m a Ph.D. Candidate in the School of Data Science at The Chinese University of Hong Kong, Shenzhen (CUHK-Shenzhen), advised by Prof. Yixiang Fang. Currently, i am a visiting scholar in NUS, mentored by Prof.Xiaokui Xiao. I am working closely with Prof. Chenhao Ma and Wensheng Luo. I got my Master degree from Harbin Institute of Technology Shenzhen in June 2022, under the supervision of Prof. Yunming Ye. Before that, I received my Bachelor’s degree from Harbin Institute of Technology in June 2020.

If all goes smoothly, I expect to graduate in March 2026. Shortly thereafter, I will join the University of Lyon (Lyon 1), France, as a postdoctoral scholar, affiliated with the CNRS Liris research lab, under the supervision of Prof.Angela Bonifati.

• 💬Wechat: JayL981001
• 📧Email: yinglizhou@link.cuhk.edu.cn or zhouyingli.hit@gmail.com

I am always open for possible collaborations, and visiting opportunities, please do not hesitate to contact me if you are interested!

Interests

My research interests mainly focus on large-scale data management and data mining, particularly graph data management and cost-efficient Large Language Models (LLMs) approaches for data management. Specifically, my research spans the following topics:

• Data $\times$ LLM: cost-efficient systems and methods for LLM-based applications (e.g., RAG), graph-based agent memory, and intelligent agent (e.g., Data2Insight).
• Graph data management/mining: densest subgraph discovery, community search, clique listing/counting.
• AI4DB: latency prediction, cardinality estimation, GED estimation, and graph query.

Yingli is working hard 😭😭😭 to produce impactful 🔥 and novel work 🌟. In addition, I am passionate about open-source communities and familiar with database kernels (such as TiDB).

LLM-based projects

1. Graph-based RAG system

• : DIGIMON

• : EraRAG

News

• 2026.01 💥💥 One paper is accepted by VLDB 2026!
• 2025.09 💥💥 One paper is accepted by VLDB 2026!
• 2025.08 💥💥 One paper is accepted by SIGMOD 2026! One paper is accepted by VLDB 2026!
• 2025.06 💥💥 Two papers are accepted by VLDB LLM + Graph Workshop 2025! Our new work about the graph-based RAG on dynamic corpus is available on arXiv! [arXiv]!
• 2025.06 💥💥 One Paper “Efficient 𝑘-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory” is accepted by VLDB 2025!
• 2025.03 💥💥 Our paper about the systemly benchmarck and analysis of graph-based RAG is available on arXiv! [arXiv]!