DescriptionHierarchical Navigable Small World (HNSW).png
English: This diagram shows the core idea of a Hierarchical Navigable Small World (HNSW) graph, an algorithm for efficient approximate nearest-neighbor search in high-dimensional vector spaces. The structure is multi-layered: the top layer (Layer 2) is the sparsest and provides an entry point. The closest node found in each layer is used as the entry point for the subsequent, denser layer. HNSW is a multi-level graph index over the vector space; each layer is a coarser (sparser) or finer (denser) level of the index used during search.
to share – to copy, distribute and transmit the work
to remix – to adapt the work
Under the following conditions:
attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
https://creativecommons.org/licenses/by/4.0CC BY 4.0 Creative Commons Attribution 4.0 truetrue
Captions
Illustration of the multi-layered search process of a Hierarchical Navigable Small World (HNSW) graph for approximate nearest neighbor search