The Faiss library
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914108289318912 |
|---|---|
| author | Douze, Matthijs Guzhva, Alexandr Deng, Chengqi Johnson, Jeff Szilvasy, Gergely Mazaré, Pierre-Emmanuel Lomeli, Maria Hosseini, Lucas Jégou, Hervé |
| author_facet | Douze, Matthijs Guzhva, Alexandr Deng, Chengqi Johnson, Jeff Szilvasy, Gergely Mazaré, Pierre-Emmanuel Lomeli, Maria Hosseini, Lucas Jégou, Hervé |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_08281 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Faiss library Douze, Matthijs Guzhva, Alexandr Deng, Chengqi Johnson, Jeff Szilvasy, Gergely Mazaré, Pierre-Emmanuel Lomeli, Maria Hosseini, Lucas Jégou, Hervé Machine Learning Computer Vision and Pattern Recognition Software Engineering 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. |
| title | The Faiss library |
| topic | Machine Learning Computer Vision and Pattern Recognition Software Engineering |
| url | https://arxiv.org/abs/2401.08281 |