mlsanityData to 14 Oct 2026

Co-design Hardware and Algorithm for Vector Search

arXiv 2306.11182 ↗First posted 19 Jun 2023cs.LG cs.DB cs.IRcited by 6

Not on the map. Why?

Abstract (arXiv)

Vector search has emerged as the foundation for large-scale information retrieval and machine learning systems, with search engines like Google and Bing processing tens of thousands of queries per second on petabyte-scale document datasets by evaluating vector similarities between encoded query texts and web documents. As performance demands for vector search systems surge, accelerated hardware offers a promising solution in the post-Moore's Law era. We introduce textitFANNS, an end-to-end and scalable vector search framework on FPGAs. Given a user-provided recall requirement on a dataset and a hardware resource budget, textitFANNS automatically co-designs hardware and algorithm, subsequently generating the corresponding accelerator. The framework also supports scale-out by incorporating a hardware TCP/IP stack in the accelerator. textitFANNS attains up to 23.0× and 37.2× speedup compared to FPGA and CPU baselines, respectively, and demonstrates superior scalability to GPUs, achieving 5.5× and 7.6× speedup in median and 95textsuperscriptth percentile (P95) latency within an eight-accelerator configuration. The remarkable performance of textitFANNS lays a robust groundwork for future FPGA integration in data centers and AI supercomputers.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 19 of its 68 references that are in the map. First posted on arXiv 19 Jun 2023.

Builds on

19 of 68 references.

References · 19

  1. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,297
  2. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
  3. 2017Billion-scale similarity search with GPUscited by 2,497
  4. 2020REALM: Retrieval-Augmented Language Model Pre-Trainingcited by 2,141
  5. 2021Improving language models by retrieving from trillions of tokenscited by 1,293
  6. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
  7. 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 861
  8. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 849
  9. 2019ScispaCy: Fast and Robust Models for Biomedical Natural Language Processingcited by 244
  10. 2020Embedding-based Retrieval in Facebook Searchcited by 156
  11. 2017Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graphcited by 104
  12. 2021SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Searchcited by 35
7 more
  1. 2022TPU-KNN: K Nearest Neighbor Search at Peak FLOP/scited by 18
  2. 2018Transformations of High-Level Synthesis Codes for High-Performance Computingcited by 17
  3. 2017Efficient Large-scale Approximate Nearest Neighbor Search on the GPUcited by 8
  4. 2019Vector and Line Quantization for Billion-scale Similarity Search on GPUscited by 3
  5. 2019Flexible Communication Avoiding Matrix Multiplication on FPGA with High-Level Synthesiscited by 2
  6. 2020MicroRec: Efficient Recommendation Inference by Hardware and Data Structure Solutionscited by 2
  7. 2020Approximate kNN Classification for Biomedical Datacited by 2

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 3; 2025: 2.

6 papers.