The Faiss Library

Abstract

Vector databases typically manage large collections of embedding vectors. Currently, AI applications are growing rapidly, and so is the number of embeddings that need to be stored and indexed. 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-off space of 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 applications to highlight its broad applicability.

Stats

• citations293
• S2 citations—
• github stars0
• HF likes0
• heat score18.51
• arxiv keydouze2024the

Related papers

• Fast And Scalable Gene Embedding Search: A Comparative Study Of FAISS And Scann (2025)2.26
• Vector Database Management Systems: Fundamental Concepts, Use-cases, And Current Challenges (2023)14.23
• Leanvec: Searching Vectors Faster By Making Them Fit (2023)0.00
• Reveal Hidden Pitfalls And Navigate Next Generation Of Vector Similarity Search From Task-centric Views (2025)0.00
• Vectorsearch: Enhancing Document Retrieval With Semantic Embeddings And Optimized Search (2024)0.00
• Semantic Vector Encoding And Similarity Search Using Fulltext Search Engines (2017)6.77
• Approximate Vector Set Search Inspired By Fly Olfactory Neural System (2024)0.00
• Optimization Of Latent-space Compression Using Game-theoretic Techniques For Transformer-based Vector Search (2025)0.00