Hierarchical Navigable Small World
Algorithm
Overview
Developed byYu. A. Malkov
Maintained byNMSLIB team
Founded2016
LicenseApache License 2.0
Open source✓ Open Source
Use caseapproximate nearest neighbor search
Integrates with
Also see
Based onNavigable Small World graphs
Knowledge graph stats
Claims43
Avg confidence91%
Avg freshness100%
Last updatedUpdated 21 days ago
Trust distribution
100% unverified
Hierarchical Navigable Small World
concept
Graph-based algorithm for approximate nearest neighbor search in high-dimensional spaces (HNSW).
Compare with...publication year
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| 2016 | ○Unverified | High | Fresh | 1 |
primary use case
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| approximate nearest neighbor search | ○Unverified | High | Fresh | 1 |
| high-dimensional vector similarity search | ○Unverified | High | Fresh | 1 |
published year
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| 2016 | ○Unverified | High | Fresh | 1 |
algorithm type
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| graph-based search algorithm | ○Unverified | High | Fresh | 1 |
| graph-based search | ○Unverified | High | Fresh | 1 |
developed by
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Yu. A. Malkov | ○Unverified | High | Fresh | 1 |
| D. A. Yashunin | ○Unverified | High | Fresh | 1 |
| Yury Malkov | ○Unverified | High | Fresh | 1 |
| Yu. A. Malkov and D. A. Yashunin | ○Unverified | High | Fresh | 1 |
implementation available
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| hnswlib library | ○Unverified | High | Fresh | 1 |
founded year
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| 2016 | ○Unverified | High | Fresh | 1 |
co developed by
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| D. A. Yashunin | ○Unverified | High | Fresh | 1 |
based on
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Navigable Small World graphs | ○Unverified | High | Fresh | 1 |
| small world networks | ○Unverified | High | Fresh | 1 |
supports use case
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| vector similarity search | ○Unverified | High | Fresh | 1 |
supports language
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| C++ | ○Unverified | High | Fresh | 1 |
| Python | ○Unverified | High | Fresh | 1 |
primary application
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| high-dimensional vector search | ○Unverified | High | Fresh | 1 |
application domain
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| machine learning | ○Unverified | High | Fresh | 1 |
| information retrieval | ○Unverified | High | Fresh | 1 |
implemented in
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| hnswlib library | ○Unverified | High | Fresh | 1 |
used by
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Weaviate | ○Unverified | High | Fresh | 1 |
| vector databases | ○Unverified | Moderate | Fresh | 1 |
open source
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| true | ○Unverified | High | Fresh | 1 |
used in
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| vector databases | ○Unverified | High | Fresh | 1 |
| machine learning applications | ○Unverified | Moderate | Fresh | 1 |
supports metric
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Euclidean distance | ○Unverified | High | Fresh | 1 |
| cosine similarity | ○Unverified | Moderate | Fresh | 1 |
complexity time
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| O(log N) query time | ○Unverified | High | Fresh | 1 |
license type
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Apache License 2.0 | ○Unverified | High | Fresh | 1 |
computational complexity
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| O(log N) search complexity | ○Unverified | High | Fresh | 1 |
| O(log N) search time | ○Unverified | Moderate | Fresh | 1 |
time complexity
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| O(log n) search | ○Unverified | High | Fresh | 1 |
alternative to
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Locality Sensitive Hashing | ○Unverified | Moderate | Fresh | 1 |
| LSH (Locality Sensitive Hashing) | ○Unverified | Moderate | Fresh | 1 |
| KD-trees | ○Unverified | Moderate | Fresh | 1 |
| k-d tree | ○Unverified | Moderate | Fresh | 1 |
| KD-tree | ○Unverified | Moderate | Fresh | 1 |
integrates with
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| vector databases | ○Unverified | Moderate | Fresh | 1 |
| Faiss | ○Unverified | Moderate | Fresh | 1 |
| Annoy | ○Unverified | Moderate | Fresh | 1 |
maintained by
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| NMSLIB team | ○Unverified | Moderate | Fresh | 1 |