THE FAISS LIBRARY
Author(s) -
Matthijs Douze,
Alexandr Guzhva,
Chengqi Deng,
Jeff Johnson,
Gergely Szilvasy,
Pierre-Emmanuel Mazare,
Maria Lomeli,
Lucas Hosseini,
Herve Jegou
Publication year - 2025
Publication title -
ieee transactions on big data
Language(s) - English
Resource type - Magazines
SCImago Journal Rank - 0.959
H-Index - 6
eISSN - 2332-7790
DOI - 10.1109/tbdata.2025.3618474
Subject(s) - computing and processing
Vector databases typically manage large collections of embedding vectors. As AI applications are growing rapidly, the number of embeddings that need to be stored and indexed is increasing. The Faiss library is dedicated to vector similarity search, a core functionality of vector databases. Faiss is a toolkit of indexing methods and related primitives used to search, cluster, compress and transform vectors. This paper describes the trade-offs in vector search and the design principles of Faiss in terms of structure, approach to optimization and interfacing. We benchmark key features of the library and discuss a few selected use cases to highlight its broad applicability.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom