3. Two papers accepted by VLDB LLM + Graph Workshop 2025;
4. Paper “Efficient 𝑘-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory” accepted by VLDB 2025;
5. Paper “Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index” accepted by VLDB 2025.
Research Experience
1. Conducting research at CUHK-Shenzhen, working closely with Prof. Chenhao Ma and Wensheng Luo;
2. Research as a visiting scholar at NUS.
Education
1. Ph.D. Candidate at the School of Data Science, The Chinese University of Hong Kong, Shenzhen (CUHK-Shenzhen), advised by Prof. Yixiang Fang, expected to graduate in January 2026;
2. Visiting Scholar at NUS, mentored by Prof. Xiaokui Xiao;
3. Master's degree from Harbin Institute of Technology Shenzhen, supervised by Prof. Yunming Ye, graduated in June 2022;
4. Bachelor's degree from Harbin Institute of Technology, graduated in June 2020.
Background
Research interests: large-scale data management and data mining, particularly graph data management and cost-efficient Large Language Models (LLMs) approaches. Specific research areas include LLM-based applications, graph data management/mining, AI4DB, etc.
Miscellany
Idols: Jay Chou (Music), Steve Jobs, and Cristiano Ronaldo;
Favorite Songs: 轨迹 (Chinese) and Something Just Like This (English);
Hobbies: Enjoy jogging in free time, helps to think and clear the mind;
Favorite Quote: 最平凡日子,最卑微梦想. (Even in ordinary life, we should cherish our small yet sincere dreams — they give meaning to every day.)