Tag: faiss

All the articles with the tag "faiss".

• Vector Search: Exact Search and the Approximate Indexes

  Updated:19 Oct, 2026

  Finding the nearest embeddings is easy and linear; every index trades a little recall for a lot of speed. Similarity metrics and when they agree, why trees fail in high dimensions, and LSH, IVF, product quantization with a worked 8-byte code, and HNSW as a navigable small world, with an interactive graph search. Then all of them measured with FAISS on 71,865 real sentence embeddings: recall against latency and bytes per vector.