HNSW (Hierarchical Navigable Small World)
Concept
HNSW is a graph-based approximate nearest neighbor algorithm that builds a multi-layer proximity graph for fast vector search. It keeps the whole graph in memory, which makes it fast but RAM-intensive at large scale.
| Type | Concept |
|---|---|
| Wikipedia | en.wikipedia.org/wiki/Hierarchical_navigable_small_world |
Community wiki
Short info above, community knowledge below: add practical tips, examples or corrections. New contributions are reviewed first; trusted members publish directly.
Experts and companies for this topic
Nobody has listed this topic yet. Add it to your profile.
Sources
Maintained by Mirko Peters (Microsoft MVP) · Last updated: