Leading graph-based ANN library optimized for approximate nearest neighbor search, offering competitive performance especially at lower recall levels across diverse datasets.
Loading more......
HVS (Hierarchical Graph Structure)
HVS is an open-source, self-hosted graph-based ANN index using Voronoi diagrams for high-dimensional vector similarity search. Key features include hierarchical graphs, efficient large-scale queries, and free use. Suited for RAG embedding storage/search prototypes, cost-free self-hosting vs Pinecone.
ANN Library
A C++ library for approximate nearest neighbor searching in arbitrarily high dimensions, developed by David Mount and Sunil Arya at the University of Maryland. Provides data structures and algorithms for both exact and approximate nearest neighbor searching.
FLANN (Fast Library for Approximate Nearest Neighbors)
A C++ library for performing fast approximate nearest neighbor searches in high dimensional spaces. Contains multiple ANN algorithms and automatic algorithm selection based on dataset characteristics.
Navigable Small World (NSW)
A graph-based approximate nearest neighbor search algorithm that uses both long-range and short-range links to achieve poly-logarithmic search complexity. Foundation for the more advanced HNSW algorithm.
FLANN
Fast Library for Approximate Nearest Neighbors containing a collection of algorithms optimized for nearest neighbor search in high dimensional spaces with automatic algorithm and parameter selection.
FreshDiskANN
Fast and accurate graph-based ANN index for streaming similarity search, enabling real-time updates on billion-point indexes using a single machine with real-time freshness.
