Fusionanns: An Efficient CPU/GPU Cooperative Processing Architecture For Billion-scale Approximate Nearest Neighbor Search
2024 Β· Bing Tian, Haikun Liu, Yuhang Tang, et al.
Abstract
Approximate nearest neighbor search (ANNS) has emerged as a crucial component of database and AI infrastructure. Ever-increasing vector datasets pose significant challenges in terms of performance, cost, and accuracy for ANNS services. None of modern ANNS systems can address these issues simultaneously. We present FusionANNS, a high-throughput, low-latency, cost-efficient, and high-accuracy ANNS system for billion-scale datasets using SSDs and only one entry-level GPU. The key idea of FusionANNS lies in CPU/GPU collaborative filtering and re-ranking mechanisms, which significantly reduce I/O operations across CPUs, GPU, and SSDs to break through the I/O performance bottleneck. Specifically, we propose three novel designs: (1) multi-tiered indexing to avoid data swapping between CPUs and GPU, (2) heuristic re-ranking to eliminate unnecessary I/Os and computations while guaranteeing high accuracy, and (3) redundant-aware I/O deduplication to further improve I/O efficiency. We implement F
Authors
(none)
Tags
Stats
Related papers
- Breaking The Storage-compute Bottleneck In Billion-scale ANNS: A Gpu-driven Asynchronous I/O Framework (2025)0.00
- CAGRA: Highly Parallel Graph Construction And Approximate Nearest Neighbor Search For Gpus (2023)12.17
- GGNN: Graph-based GPU Nearest Neighbor Search (2019)13.39
- A Real-time Adaptive Multi-stream GPU System For Online Approximate Nearest Neighborhood Search (2024)5.84
- SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search (2021)0.00
- Results Of The Neurips'21 Challenge On Billion-scale Approximate Nearest Neighbor Search (2022)0.00
- DGAI: Decoupled On-disk Graph-based ANN Index For Efficient Updates And Queries (2025)0.00
- Efficient And Effective Retrieval Of Dense-sparse Hybrid Vectors Using Graph-based Approximate Nearest Neighbor Search (2024)0.00