Tag: similarity-search

Hierarchical Navigable Small World graphs made high-recall approximate nearest-neighbor search practical by organizing vectors into layered proximity graphs that support coarse-to-fine navigation.

FAISS turned research in quantization, inverted files and GPU selection into a practical library for similarity search over millions and billions of dense vectors.