Bojun Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Bojun Li has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Ruochun Jin
College of Computer Science and Technology, National University of Defense Technology, Changsha, China
2 shared publications - Guangyan Zhang
Tsinghua University, Beijing, China
1 shared publication - Jintao Huang
College of Computer Science and Technology, National University of Defense Technology, Changsha, China
1 shared publication - Wenjing Yang
National university of defense technology, Changsha, China
1 shared publication - Xiaoguang Ren
Intelligent Game and Decision Lab, Beijing, China
1 shared publication - Yuanxi Peng
College of Computer Science and Technology, National University of Defense Technology, Changsha, China
1 shared publication
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 3405-3413
VOMEL: Void-Aware Optimization for Multimodal Entity Linking
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 3405-3413
Open AccessVOMEL: Void-Aware Optimization for Multimodal Entity Linking
- Open Access
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-27
PathSeer: Adaptive Neighbor Handling for Efficient Filtered ANN Search
Filtered approximate nearest neighbor (ANN) search over high-dimensional vectors and associated attributes is critical for recommendation systems and RAG-based LLMs. However, existing methods face performance bottlenecks under workloads of varying characteristics due to static and single neighbor-handling strategies---either computing distances before filtering or filtering before distance computation---which fail to adapt to diverse data and workload patterns. In this paper, we propose PathSeer, an approach that enables efficient filtered ANN search through dynamic and hybrid neighbor-handling strategies. PathSeer introduces three key techniques: (1) a fusion vector indexing scheme that supports two neighbor-handling strategies within a single index, (2) a dynamic neighbor traversal strategy that allows adjusting the ratios of different neighbor-handling strategies at each step of index traversal while preserving high search performance, and (3) a heuristic parameter tuning mechanism that adapts the ratios of neighbors employing different neighbor-handling strategies to workload characteristics. Evaluations on six workloads show that PathSeer delivers 1.17×–47.4× higher throughput for filtered ANN search compared to existing methods, without sacrificing recall.
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-27
Open AccessPathSeer: Adaptive Neighbor Handling for Efficient Filtered ANN Search
Filtered approximate nearest neighbor (ANN) search over high-dimensional vectors and associated attributes is critical for recommendation systems and RAG-based LLMs. However, existing methods face performance bottlenecks under workloads of varying characteristics due to static and single neighbor-handling strategies---either computing distances before filtering or filtering before distance computation---which fail to adapt to diverse data and workload patterns. In this paper, we propose PathSeer, an approach that enables efficient filtered ANN search through dynamic and hybrid neighbor-handling strategies. PathSeer introduces three key techniques: (1) a fusion vector indexing scheme that supports two neighbor-handling strategies within a single index, (2) a dynamic neighbor traversal strategy that allows adjusting the ratios of different neighbor-handling strategies at each step of index traversal while preserving high search performance, and (3) a heuristic parameter tuning mechanism that adapts the ratios of neighbors employing different neighbor-handling strategies to workload characteristics. Evaluations on six workloads show that PathSeer delivers 1.17×–47.4× higher throughput for filtered ANN search compared to existing methods, without sacrificing recall.