Annoy
Vector Search Library
Overview
Developed byErik Bernhardsson
Maintained bySpotify
LicenseApache License 2.0
Open source✓ Open Source
Primary languageC++
Use caseapproximate nearest neighbors search
Knowledge graph stats
Claims46
Avg confidence92%
Avg freshness100%
Last updatedUpdated 5 days ago
Trust distribution
100% unverified
Governance
Not assessed
Annoy
product
Approximate Nearest Neighbors Oh Yeah library by Spotify for fast similarity search.
Compare with...supports language binding
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Python | ○Unverified | High | Fresh | 1 |
open source
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| true | ○Unverified | High | Fresh | 1 |
pricing model
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| free | ○Unverified | High | Fresh | 1 |
primary use case
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| approximate nearest neighbors search | ○Unverified | High | Fresh | 1 |
| approximate nearest neighbor search | ○Unverified | High | Fresh | 1 |
supports language
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Python | ○Unverified | High | Fresh | 1 |
| Lua | ○Unverified | Moderate | Fresh | 1 |
| Java | ○Unverified | Moderate | Fresh | 1 |
license type
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Apache License 2.0 | ○Unverified | High | Fresh | 1 |
installable via
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| pip | ○Unverified | High | Fresh | 1 |
supports metric
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| cosine distance | ○Unverified | High | Fresh | 1 |
| cosine similarity | ○Unverified | High | Fresh | 1 |
| angular distance | ○Unverified | High | Fresh | 1 |
| euclidean distance | ○Unverified | High | Fresh | 1 |
| manhattan distance | ○Unverified | High | Fresh | 1 |
supports distance metric
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| angular distance | ○Unverified | High | Fresh | 1 |
| cosine distance | ○Unverified | High | Fresh | 1 |
| Euclidean distance | ○Unverified | High | Fresh | 1 |
| cosine similarity | ○Unverified | High | Fresh | 1 |
| manhattan distance | ○Unverified | High | Fresh | 1 |
programming language
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| C++ | ○Unverified | High | Fresh | 1 |
uses algorithm
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| random projection trees | ○Unverified | High | Fresh | 1 |
developed by
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Erik Bernhardsson | ○Unverified | High | Fresh | 1 |
| Spotify | ○Unverified | High | Fresh | 1 |
maintained by
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Spotify | ○Unverified | High | Fresh | 1 |
| Erik Bernhardsson | ○Unverified | High | Fresh | 1 |
memory mapped
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| true | ○Unverified | High | Fresh | 1 |
written in
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| C++ | ○Unverified | High | Fresh | 1 |
created by
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Erik Bernhardsson | ○Unverified | High | Fresh | 1 |
algorithm type
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| random projection trees | ○Unverified | High | Fresh | 1 |
algorithm based on
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| random projection trees | ○Unverified | High | Fresh | 1 |
memory maps indexes
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| true | ○Unverified | High | Fresh | 1 |
used by
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Spotify | ○Unverified | High | Fresh | 1 |
based on
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| random projection trees | ○Unverified | High | Fresh | 1 |
optimized for
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| memory usage | ○Unverified | High | Fresh | 1 |
| static datasets | ○Unverified | High | Fresh | 1 |
| read-only operations | ○Unverified | High | Fresh | 1 |
| memory efficiency | ○Unverified | Moderate | Fresh | 1 |
thread safe
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| true | ○Unverified | High | Fresh | 1 |
optimization focus
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| memory efficiency | ○Unverified | High | Fresh | 1 |
memory efficient
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| true | ○Unverified | High | Fresh | 1 |
competes with
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| Milvus | ○Unverified | Moderate | Fresh | 1 |
alternative to
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| FLANN | ○Unverified | Moderate | Fresh | 1 |
| Faiss | ○Unverified | Moderate | Fresh | 1 |
used for
| Value | Trust | Confidence | Freshness | Sources |
|---|---|---|---|---|
| music recommendation | ○Unverified | Moderate | Fresh | 1 |
| music recommendation systems | ○Unverified | Moderate | Fresh | 1 |