Matthijs Douze

Matthijs Douze

Auto-generated profile, based on publicly available information

Matthijs Douze

FAIR, Meta, Paris, France

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 October 2025 in IEEE Transactions on Big Data
Verified
Journal Article
Open access
MDMatthijs Douze
Matthijs Douze
AGAlexandr Guzhva
Alexandr Guzhva
CDChengqi Deng
Chengqi Deng
JJJeff Johnson
Jeff Johnson
GSGergely Szilvasy
Gergely Szilvasy
HJHervé Jégou
Hervé Jégou
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.