some distances used in Ann related crates
A Rust implementation of DiskANN (Disk-based Approximate Nearest Neighbor search) using the Vamana graph algorithm. Provides memory-efficient vector search through graph traversal and memory-mapped storage, enabling billion-scale search with minimal RAM usage.
A native Rust implementation of DiskANN (Disk-based Approximate Nearest Neighbor search)
Ann based on Hierarchical Navigable Small World Graphs from Yu.A. Malkov and D.A Yashunin
Coreset and (streaming) clustering
Ultra-fast approximate UniFrac via Weighted MinHash