The Excellence
Directory Platform Template

Python implementation of Nearest Neighbor Descent for k-neighbor-graph construction and ANN search. Targets 80%-100% accuracy with fast performance and supports wide variety of distance metrics. This is an OSS library.

Ruby gem for approximate nearest neighbor search that can integrate with pgvector and other backends to power vector similarity search in Ruby applications.

IVF is an indexing technique widely used in vector databases where vectors are clustered into inverted lists (partitions), enabling efficient Approximate Nearest Neighbor search by probing only a subset of relevant partitions at query time.

Product Quantization is a compression and indexing technique for vector search that splits vectors into subspaces and quantizes each part separately, allowing vector databases to store large-scale embeddings compactly while supporting efficient ANN search.

AiSAQ is an all-in-storage approximate nearest neighbor search system that uses product quantization to enable DRAM-free vector similarity search, serving as a specialized vector search/indexing approach for large-scale information retrieval.

DET-LSH is a locality-sensitive hashing scheme that introduces a dynamic encoding tree structure to accelerate approximate nearest neighbor (ANN) search in high-dimensional spaces. While it is a research algorithm rather than a production database, it directly targets the core operation behind vector databases—efficient ANN search over vector embeddings—and is relevant for designing or optimizing vector indexing components within vector database systems.

EFANNA is an extremely fast approximate nearest neighbor search algorithm based on kNN graphs and randomized KD-trees. The provided implementation offers a high-performance ANN index suitable as a building block in custom vector search and retrieval infrastructure.

faiss-quickeradc is an extension of FAISS that implements the Quicker ADC approach to accelerate product-quantization-based approximate nearest neighbor search using SIMD, improving performance in vector database retrieval.

GTS is a GPU-based tree index for fast similarity search over high-dimensional vector data, providing an efficient ANN index structure that can be integrated into or used to build high-performance vector database systems.

A Go implementation of the HNSW approximate nearest neighbor search algorithm, enabling developers to embed efficient vector similarity search directly into Go services and custom vector database solutions.

A Rust implementation of the HNSW (Hierarchical Navigable Small World) approximate nearest neighbor search algorithm, useful for building high-performance, memory-safe vector search components in Rust-based AI and retrieval systems.

iRangeGraph is an ANN indexing approach and accompanying implementation for range-filtering nearest neighbor search. It provides a specialized graph-based index that supports vector similarity search under range constraints, making it directly useful as a component or reference implementation for advanced vector database indexing and retrieval.