Database Systems
Retrieval and query machinery inside production engines — graph-based RAG in GaussDB, subgraph matching, and graph query languages.
Huawei HKRC · Hong Kong
Database & ML Research
Ph.D. in Computer Science and Senior Software Engineer building research systems across database engines, machine learning, and AI agents — and shipping the ones that work into production.
About
I am a Senior Software Engineer on the database team at Huawei Hong Kong Research Center, working across database systems, machine learning, and AI agents. I hold a Ph.D. in Computer Science from The University of Hong Kong, with publications at VLDB, ICDE, and CIKM.
My work sits between research and engineering: prototype in Python, move hot paths into C++, and carry the result into a real system. Recent projects include graph-based retrieval inside GaussDB, token-efficient memory for coding agents, and autonomous memory under edge–cloud constraints.
Before Huawei I was a postdoctoral fellow at HKU and a visiting scholar at UIUC and the University of Kiel. Away from work I play competitive chess and research quantitative markets.
Research
Retrieval and query machinery inside production engines — graph-based RAG in GaussDB, subgraph matching, and graph query languages.
Graph neural networks and their limits: subgraph counting benchmarks, one-shot pruning for sparsification, and representation learning on graphs.
Memory and context for agents that operate at scale — hierarchical code memory, context gating, and autonomous memory across edge and cloud.
An independent research interest: time-series foundation models for forecasting, systematic execution, and options-implied densities.
Experience
Huawei Hong Kong Research Center · Database team
Research in database systems and AI agents
The University of Hong Kong · with Prof. Reynold C.K. Cheng
University of Illinois Urbana-Champaign · with Prof. Kevin C.-C. Chang
University of Kiel · with Prof. Matthias Renz
Cafe Bazaar · Android marketplace with 40M users
HKU · IPM · Andisheh Computer
Publications
Graph sparsification & pruning · manuscript
IEEE ICDE 2025 · pp. 2548–2561
IEEE ICDE 2024 · pp. 2972–2985
PVLDB 17(7) · pp. 1765–1774
ACM CIKM 2020
Ph.D. thesis — Network Motif Discovery: Efficiency, Scalability, and Benchmarking, HKU 2024. Full list on Google Scholar.
Projects
Scalable network motif discovery using serial testing — the core system from my Ph.D., with open-source code.
A benchmark for efficient and accurate subgraph counting, built to stress-test GNN and algorithmic approaches.
Associative multi-hop retrieval designed for a production database engine, with a filed patent and product integration.
Hierarchical code memory and context gating for coding agents — substantial token savings at comparable resolution rates.
Autonomous memory systems for agents operating across resource-constrained edge devices and cloud backends.
Fine-tuning time-series foundation models for BTC forecasting, systematic DCA and grid execution, and options-implied risk-neutral densities.
Teaching & Service
Honors & Awards
Beyond the lab
A tournament player since school. Champion of the Hong Kong Inter-School Chess Championship and 2nd runner-up at the Tehran Open. Chess is still how I think about search, evaluation, and knowing when to stop calculating.
An ongoing independent research interest: fine-tuning time-series foundation models for crypto forecasting, building systematic DCA and grid execution, and recovering risk-neutral densities from options data.
Stack
Contact
Open to research collaborations, technical conversations, and opportunities across databases, machine learning, and production ML systems.