



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.
Hierarchical Navigable Small World (HNSW) is a graph-based algorithm that performs approximate nearest neighbor searches (ANN) in vector databases. HNSW is among the top-performing indexes for vector similarity search.
HNSW builds upon two fundamental concepts:
Navigable Small World (NSW) graphs: Creates proximity graphs with both long-range and short-range links, reducing search times to logarithmic complexity
Skip lists: Borrows the concept of maintaining multiple layers, where HNSW uses layers of NSW graphs instead of linked lists
Hierarchical NSW incrementally builds a multi-layer structure:
Original Paper: "Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs" (Malkov & Yashunin, 2016)
ArXiv: https://arxiv.org/abs/1603.09320
Loading more......
Open algorithm implemented in various databases, no licensing cost.