Jump to content

File:Hierarchical Navigable Small World (HNSW).png

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia
Original file (2,520 × 1,060 pixels, file size: 511 KB, MIME type: image/png)

Summary

Description
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.
Date
Source Own work
Author Rose electric

Licensing

I, the copyright holder of this work, hereby publish it under the following license:
w:en:Creative Commons
attribution
This file is licensed under the Creative Commons Attribution 4.0 International license.
You are free:
  • 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.

Captions

Illustration of the multi-layered search process of a Hierarchical Navigable Small World (HNSW) graph for approximate nearest neighbor search

Items portrayed in this file

depicts

7 September 2025

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current05:58, 8 September 2025Thumbnail for version as of 05:58, 8 September 20252,520 × 1,060 (511 KB)Rose electricUploaded own work with UploadWizard

The following page uses this file:

Metadata