01
HNSW and the Graph Structure Behind Fast Approximate Nearest-Neighbor 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.
↗