DiskANN
Also known as Vamana. This is the canonical page; those names redirect here.
Vamana is the graph construction algorithm inside DiskANN; the system name is the one in common use.
Pairings in the atlas
- Vamana alpha-pruned graphstandardBillion-scale vector searchvector-search
Rivals: other methods for the same problems
- Annoy
- Ball tree
- Best-bin-first search
- CAGRA
- Cover tree
- Cross-polytope LSH
- HNSW
- IVF-Flat
- IVF-PQ
- Iterative quantization
- K-d tree
- Locality-sensitive hashing
- Multi-probe LSH
- NSG
- Navigable small world graph
- Optimized product quantization
- P-stable LSH
- Priority search k-means tree
- Product quantization
- RaBitQ
- Randomized k-d forest
- Residual quantization
- SPANN
- Scalar quantization