Publication Type
Journal Article
Version
publishedVersion
Publication Date
12-2025
Abstract
Approximate nearest neighbor search (ANNS) in high-dimensional vector spaces has a wide range of real-world applications. Numerous methods have been proposed to handle ANNS efficiently, while graph-based indexes have gained prominence due to their high accuracy and efficiency. However, the indexing overhead of graph-based indexes remains substantial. With exponential growth in data volume and increasing demands for dynamic index adjustments, this overhead continues to escalate, posing a critical challenge.In this paper, we introduce Tagore, a fasT library accelerated by GPUs for graph indexing, which has powerful capabilities of constructing refinement-based graph indexes such as NSG and Vamana. We first introduce GNN-Descent, a GPU-specific algorithm for efficient k-Nearest Neighbor (k-NN) graph initialization. GNN-Descent speeds up the similarity comparison by a two-phase descent procedure and enables highly parallelized neighbor updates. Next, aiming to support various k-NN graph pruning strategies, we formulate a universal pruning procedure termed CFS and devise two generalized GPU kernels for parallel processing complex dependencies in neighbor relationships. For large-scale datasets exceeding GPU memory capacity, we propose an asynchronous GPU-CPU-disk indexing framework with a cluster-aware caching mechanism to minimize the I/O pressure on the disk. Extensive experiments on 7 real-world datasets exhibit that Tagore achieves 1.32x to 112.79x speedup while maintaining the index quality.
Keywords
Approximate Nearest Neighbor Search, Graph-based Index Construction, GPU Acceleration
Discipline
Databases and Information Systems
Research Areas
Intelligent Systems and Optimization
Areas of Excellence
Digital transformation
Publication
Proceedings of the ACM on Management of Data
Volume
3
Issue
6
First Page
1
Last Page
27
ISSN
2836-6573
Identifier
10.1145/3769825
Publisher
Association for Computing Machinery (ACM)
Citation
Li, Zhonggen; KE, Xiangyu; ZHU, Yifan; YU, Bocheng; ZHENG, Baihua; and GAO, Yunjun.
Scalable graph indexing using GPUs for approximate nearest neighbor search. (2025). Proceedings of the ACM on Management of Data. 3, (6), 1-27.
Available at: https://ink.library.smu.edu.sg/sis_research/11250
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1145/3769825