Hierarchical navigable small world
Approximate nearest neighbor search algorithm
Hierarchical navigable small world (HNSW) is an algorithm for approximate nearest neighbor search. It is used to find items that are similar to a query item in a large collection, without comparing the query with every item one by one.
ATK 3487DEF 2962
