GPU-Accelerated ANNS: Quantized for Speed, Built for Change
Hunter McCoy, Zikun Wang, Prashant Pandey
Abstract
Approximate nearest neighbor search (ANNS) is a core problem in machine learning and information retrieval. GPUs offer a promising path to high-performance ANNS through massive parallelism and co-location with downstream applications, but current GPU indices face three limitations: inability to update without full rebuilds, lack of efficient quantization for high-dimensional vectors, and poor latency hiding due to data-dependent memory accesses.
We present Jasper, a GPU-native ANNS system built on the Vamana graph index that achieves both high query throughput and full updatability via three new techniques: (1) a batch-parallel construction algorithm enabling lock-free streaming insertions, (2) a GPU-efficient RaBitQ implementation that reduces memory footprint up to 8× without random access penalties, and (3) an optimized search kernel with improved compute utilization and latency hiding.
Across five datasets, Jasper achieves up to 1.84 × higher throughput than CAGRA, the current state-of-the-art GPU index, while providing updatability that CAGRA lacks, constructs indices 7.0× faster on average, and delivers 10 -74 × faster queries than BANG, the previous fastest GPU Vamana implementation.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 003f95ae-d8ad-45ee-8711-565a90257cfeCited by top-tier papers1
Ask how each one uses itBuilds on9
- SONG: Approximate Nearest Neighbor Search on GPUWeijie Zhao, Shulong Tan, Ping LiICDE 2020 · 103 citations
- Filtered-DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with FiltersSiddharth Gollapudi, Neel Karia, Varun Sivashankar, Ravishankar Krishnaswamy et al.WWW 2023 · 102 citations
- RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor SearchJianyang Gao, Cheng LongSIGMOD 2024 · 83 citations
- CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUsHiroyuki Ootomo, Akira Naruse, Corey Nolet, Ray Wang et al.ICDE 2024 · 59 citations
- ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search AlgorithmsMagdalen Dobson Manohar, Zheqi Shen, Guy E. Blelloch, Laxman Dhulipala et al.PPoPP 2024 · 39 citations
Related papers
- JUNO: Optimizing High-Dimensional Approximate Nearest Neighbour Search with Sparsity-Aware Algorithm and Ray-Tracing Core MappingZihan Liu, Wentao Ni, Jingwen Leng, Yu Feng et al.ASPLOS 2024 · 21 citations
- High-Throughput, Cost-Effective Billion-Scale Vector Search with a Single GPUHaodi Jiang, Hao Guo, Minhui Xie, Jiwu Shu et al.SIGMOD 2026
- CMANNS: GPU-Accelerated Graph Index Construction for ANNS via Compute-Memory DisaggregationChengying Huan, Renjie Yao, Shaonan Ma, Rong Gu et al.SIGMOD 2026
- FlashANNS: GPU-Driven Asynchronous I/O Pipelining for Eliminating Storage-Compute Bottlenecks in Billion-Scale Similarity SearchYang Xiao, Mo Sun, Ziyu Song, Bing Tian et al.SIGMOD 2026 · 3 citations
- Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSDHao Guo, Youyou LuOSDI 2025 · 26 citations
