HNSW: Hierarchical Navigable Small World
How HNSW navigates a layered proximity graph to find nearest neighbors in logarithmic time — the default in-memory index of modern vector databases.
9 min readConcept
Explore machine learning concepts related to HNSW. Clear explanations and practical insights.
How HNSW navigates a layered proximity graph to find nearest neighbors in logarithmic time — the default in-memory index of modern vector databases.