IVF (Inverted File Index)

A graph-based approximate nearest neighbor search algorithm that uses both long-range and short-range links to achieve poly-logarithmic search complexity. Foundation for the more advanced HNSW algorithm.

Graph-based algorithm for approximate nearest neighbor search that maintains multi-layer graph structures for efficient vector similarity search with logarithmic complexity, widely used in modern vector databases.

Algorithmic technique for approximate nearest neighbor search in high-dimensional spaces using hash functions to map similar items to the same buckets with high probability.

Inverted File Index vector search algorithm that partitions high-dimensional vectors into clusters using k-means, enabling efficient nearest neighbor search by restricting searches to relevant clusters and dramatically reducing search space.

Family of algorithms trading perfect accuracy for speed in high-dimensional similarity search. Enables sub-linear query time with 90%+ recall on billion-scale datasets.

Inverted File Index with flat vectors using K-means clustering to partition high-dimensional space into regions, enhancing search efficiency by narrowing search area through neighbor partitions.