Embeddings & Vector Search · Level 3 of 5
HNSW (HNSW)
A graph-based approximate-neighbor index using multiple navigable layers.
Its connectivity and search settings trade recall against memory and latency.
Listen to the definition and example
Audio transcript
HNSW. A graph-based approximate-neighbor index using multiple navigable layers. Its connectivity and search settings trade recall against memory and latency. For example: A query navigates a coarse graph before exploring finer neighbors.
Explore this concept
Why it matters
This helps you understand why a retrieval system finds or misses related information.
Start with
Related concepts
Quick recall question
Try answering before looking back at the definition.