navigable

Definition

Describes a graph you can traverse to a target in few hops by repeatedly stepping to a closer neighbour. Approximate nearest-neighbour indexes such as HNSW build layered small-world graphs with this property, so a query walks a short path instead of scoring every stored vector. The word captures the core trick of modern vector search: replace exhaustive comparison with structure you can navigate.

Explainers using this term

• Build Your Own Vector DB — From Brute Force to HNSWEfficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs
• Hashing and Nearest-Neighbor Search — The Groundwork Under Vector SearchEfficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs
• Graph Algorithms from Scratch — Shortest Paths and Where They LeadEfficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs