Fangyuan Zhang

Orcid: 0009-0004-3253-4661

Affiliations:
  • Chinese University of Hong Kong, Hong Kong


According to our database1, Fangyuan Zhang authored at least 19 papers between 2022 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Memory in the LLM Era: Modular Architectures and Strategies in a Unified Framework.
CoRR, April, 2026

BOTBIN: Accelerated Indexing for Structural Graph Clustering on Dynamic Graphs.
IEEE Trans. Knowl. Data Eng., February, 2026

Breaking the Static Graph: Context-Aware Traversal for Robust Retrieval-Augmented Generation.
CoRR, February, 2026

2025
LiCoMemory: Lightweight and Cognitive Agentic Memory for Efficient Long-Term Reasoning.
CoRR, November, 2025

AnalyticDB-PG: A Cloud-native High-performance Data Warehouse in Alibaba Cloud.
Proc. VLDB Endow., August, 2025

Streaming View: An Efficient Data Processing Engine for Modern Real-time Data Warehouse of Alibaba Cloud.
Proc. VLDB Endow., August, 2025

Efficient Dynamic Indexing for Range Filtered Approximate Nearest Neighbor Search.
Proc. ACM Manag. Data, June, 2025

DIGRA: A Dynamic Graph Indexing for Approximate Nearest Neighbor Search with Range Filter.
Proc. ACM Manag. Data, June, 2025

EraRAG: Efficient and Incremental Retrieval Augmented Generation for Growing Corpora.
CoRR, June, 2025

Efficient Concurrent Updates to Persistent Randomized Binary Search Trees.
Proc. VLDB Endow., January, 2025

2024
FICOM: an effective and scalable active learning framework for GNNs on semi-supervised node classification.
VLDB J., September, 2024

Efficient Approximation Algorithms for Minimum Cost Seed Selection with Probabilistic Coverage Guarantee.
Proc. ACM Manag. Data, September, 2024

2023
Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks.
Proc. ACM Manag. Data, December, 2023

Efficient Approximation Framework for Attribute Recommendation.
Proc. ACM Manag. Data, December, 2023

Efficient Algorithm for Budgeted Adaptive Influence Maximization: An Incremental RR-set Update Approach.
Proc. ACM Manag. Data, September, 2023

Efficient Dynamic Weighted Set Sampling and Its Extension.
Proc. VLDB Endow., 2023

Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme.
Proc. ACM Manag. Data, 2023

2022
Effective Indexing for Dynamic Structural Graph Clustering.
Proc. VLDB Endow., 2022

Efficient Approximate Algorithms for Empirical Variance with Hashed Block Sampling.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022


  Loading...