Hierarchical Navigable Small World
algorithm
Overview
Developed byYury Malkov
LicenseApache License 2.0
Open source✓ Open Source
Use caseapproximate nearest neighbor search
Technical
Integrates with
Knowledge graph stats
Claims42
Avg confidence93%
Avg freshness100%
Last updatedUpdated 5 days ago
WikidataQ124785393
Trust distribution
100% unverified
Governance
Not assessed
Hierarchical Navigable Small World
concept
Graph-based algorithm for approximate nearest neighbor search with logarithmic complexity
Compare with...published year
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| 2016 | ○Unverified | High | Fresh | 1 |
algorithm type
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| graph-based search | ○Unverified | High | Fresh | 1 |
| graph-based search algorithm | ○Unverified | High | Fresh | 1 |
paper published year
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| 2016 | ○Unverified | High | Fresh | 1 |
supports model
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| vector embeddings | ○Unverified | High | Fresh | 1 |
| embedding vectors | ○Unverified | High | Fresh | 1 |
primary use case
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| approximate nearest neighbor search | ○Unverified | High | Fresh | 1 |
| high-dimensional vector search | ○Unverified | High | Fresh | 1 |
| vector similarity search | ○Unverified | High | Fresh | 1 |
| similarity search | ○Unverified | High | Fresh | 1 |
| high-dimensional data indexing | ○Unverified | High | Fresh | 1 |
implemented in
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| hnswlib library | ○Unverified | High | Fresh | 1 |
supports language
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Python | ○Unverified | High | Fresh | 1 |
| C++ | ○Unverified | High | Fresh | 1 |
open source
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| true | ○Unverified | High | Fresh | 1 |
based on
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Navigable Small World networks | ○Unverified | High | Fresh | 1 |
| small world networks | ○Unverified | High | Fresh | 1 |
| navigable small world graphs | ○Unverified | High | Fresh | 1 |
| small world networks theory | ○Unverified | High | Fresh | 1 |
| skip list data structure | ○Unverified | High | Fresh | 1 |
developed by
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Yury Malkov | ○Unverified | High | Fresh | 1 |
| Yu. A. Malkov and D. A. Yashunin | ○Unverified | High | Fresh | 1 |
integrates with
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Python | ○Unverified | High | Fresh | 1 |
| C++ | ○Unverified | High | Fresh | 1 |
| Faiss library | ○Unverified | Moderate | Fresh | 1 |
supports protocol
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Euclidean distance | ○Unverified | High | Fresh | 1 |
| cosine similarity | ○Unverified | High | Fresh | 1 |
| vector similarity search | ○Unverified | High | Fresh | 1 |
license type
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Apache License 2.0 | ○Unverified | High | Fresh | 1 |
| Apache 2.0 | ○Unverified | High | Fresh | 1 |
time complexity
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| O(log N) search time | ○Unverified | High | Fresh | 1 |
used in
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| vector databases | ○Unverified | Moderate | Fresh | 1 |
| embedding search systems | ○Unverified | Moderate | Fresh | 1 |
alternative to
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Locality Sensitive Hashing | ○Unverified | Moderate | Fresh | 1 |
| Locality-Sensitive Hashing | ○Unverified | Moderate | Fresh | 1 |
| k-d trees | ○Unverified | Moderate | Fresh | 1 |
| Annoy algorithm | ○Unverified | Moderate | Fresh | 1 |
| FAISS | ○Unverified | Moderate | Fresh | 1 |
| LSH (Locality Sensitive Hashing) | ○Unverified | Moderate | Fresh | 1 |
| Annoy | ○Unverified | Moderate | Fresh | 1 |
competes with
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Annoy | ○Unverified | Moderate | Fresh | 1 |
| Faiss | ○Unverified | Moderate | Fresh | 1 |
Alternatives & Similar Tools
Commonly Used With
Related entities
Graph Insights
4 entities depend on Hierarchical Navigable Small World
View full impact analysis →