Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs(opens in a new tab)
HNSW: approximate nearest-neighbor search over stacked proximity graphs, where each element appears in a random number of layers and a search starts in the sparse top layer and descends, giving logarithmic scaling.