The Excellence
Directory Platform Template

Graph-based approximate nearest neighbor search library built on LMDB key-value storage. The successor to Arroy, Hannoy combines graph-based ANN algorithms with production-ready persistent storage for vector databases.

A portable WebAssembly vector similarity search engine written in Rust with a tiny footprint (75KB gzipped). Designed for edge deployment, browsers, and IoT devices with support for k-d tree indexing and optimized for modern web applications.

Pure-Rust implementation of HNSW algorithm for approximate nearest neighbor search. Decouples graph from vector storage for flexible deployment. Supports dense floating point and quantized int8 vectors. This is an OSS library.

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.

HelixDB is a powerful, open-source graph-vector database built in Rust, designed for intelligent data storage for Retrieval-Augmented Generation (RAG) and AI applications. It combines graph database features with vector search, making it directly relevant to AI and machine learning workflows that require vector data management.

Hora is an efficient, open-source library for approximate nearest neighbor search, written in Rust. It offers high-performance vector search capabilities for AI and machine learning applications.