Publications

2026

• [VLDB2026] A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs
  Yingli Zhou, HuiZhong Wang, Chenhao Ma, Yixiang Fang

• [ICSE2026-Inch] LLM-Based Test Case Generation in DBMS through Monte Carlo Tree Search
  Yujia Chen, Yingli Zhou, Fangyuan Zhang, Cuiyun Gao

• [VLDB2026] Scalable Approximate Biclique Counting over Large Bipartite Graphs
  Jingbang Chen^#, Weinuo Li^#, Yingli Zhou^#, Hangrui Zhou, Qiuyang Mang, Can Wang, Yixiang Fang, Chenhao Ma

• [KDD2026] Accelerated Coordinate Descent for Directed Densest Subgraph Discovery
  Luocheng Liang, Yingli Zhou, Yixiang Fang

• [SIGMOD2026] Efficient Influential Community Search over Dynamic Graphs
  Youran Sun, Yingli Zhou, Yixiang Fang, Cheng Chen, Yongmin Hu, Yingqian Hu

• [AAAI2026-Oral] ArchRAG: Attributed Community-based Hierarchical Retrieval-Augmented Generation
  Shu Wang, Yixiang Fang, Yingli Zhou, Xilin Liu, Yuchi Ma

• [VLDB2026] Effective Durable Community Search in Large Temporal Graph
  Yingli Zhou^#, Yige Jiang^#, Yixiang Fang, Wensheng Luo, Yongmin Hu, Yingqian Hu, Cheng Chen

• [SIGMOD2026] Efficient and Scalable Directed Densest Subgraph Discovery
  Yingli Zhou, Luocheng Liang, Yixiang Fang

2025

• [VLDB2025] In-depth Analysis of Graph-based RAG in a Unified Framework (High-Star Project)
  Yingli Zhou, Yaodong Su, Youran Sun, Shu Wang, Taotao Wang, Runyuan He, Yongwei Zhang, Sicong Liang, Xilin Liu, Yuchi Ma, Yixiang Fang

• [VLDB2025-LLM+Graph] Towards the Next Generation of Agent Systems: From RAG to Agentic AI
  Yingli Zhou, Shu Wang

• [VLDB2025-LLM+Graph] Scalable Graph-based Retrieval-Augmented Generation via Locality-Sensitive Hashing
  Fangyuan Zhang, Zhengjun Huang, Yingli Zhou^${*}$, Qingtian Guo, Wensheng Luo, Xiaofang Zhou

• [VLDB2025(Industry)] Streaming View: An Efficient Data Processing Engine for Modern Real-time Data Warehouse of Alibaba Cloud
  Fangyuan Zhang, Mengqi Wu, Chunlei Xu, Yunong Bao, Jiyu Qiao, Yingli Zhou, HuaFan, Caihua Yin, Wenchao Zhou, Feifei Li

• [VLDB2025] Efficient 𝑘-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory
  Yingli Zhou^#, Qingshuo Guo^#, Yixiang Fang

• [SIGIR2025(Short)] UTCS: Effective Unsupervised Temporal Community Search with Pre-training of Temporal Dynamics and Subgraph Knowledge
  Yue Zhang, Yankai Chen, Yingli Zhou, Yucan Guo, Xiaolin Han, Chenhao Ma.

• [VLDB2025] Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index
  Qiuyang Mang, Jingbang Chen, Hangrui Zhou, Yu Gao, Yingli Zhou, Qingyu Shi, Richard Peng, Yixiang Fang, Chenhao Ma

• [VLDB2025] In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
  Yingli Zhou, Qingshuo Guo, Yi Yang, Yixiang Fang, Chenhao Ma, Laks V.S. Lakshmanan

• [VLDB2025] PRICE: A Pretrained Model for Cross-Database Cardinality Estimation
  Tianjing Zeng, Junwei Lan, Jiahong Ma, Wenqing Wei, Rong Zhu, Yingli Zhou, Pengfei Li, Bolin, Ding, Defu Lian, Zhewei Wei, Jingren Zhou

2024

• [VLDB2024] Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks
  Yingli Zhou, Yixiang Fang, Chenhao Ma, Tianci Hou, Xin Huang

• [VLDB2024] Efficient Parallel D-core Decomposition at Scale
  Wensheng Luo, Yixiang Fang, Chunxu Lin, Yingli Zhou

• [SIGMOD2024] A Counting-based Approach for Efficient 𝑘-Clique Densest Subgraph Discovery
  Yingli Zhou, Qingshuo Guo, Yixiang Fang, Chenhao Ma

2023

• [VLDB2023] Influential Community Search over Large Heterogeneous Information Networks
  Yingli Zhou, Yixiang Fang, Wensheng Luo, Yunming Ye | [pdf] | [Code]