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.

Parameterless and Universal Fast Finding of Nearest Neighbors - an LSH-based library for approximate nearest neighbor search with probabilistic guarantees. Features a parameterless design requiring only memory budget and result quality specifications.

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.

Native macOS desktop application designed for working with ChromaDB vector databases. Provides an intuitive interface to easily browse and manage collections, documents, embeddings, and metadata without relying heavily on API calls.

Semantic caching solution for LLM applications that reduces API calls and costs by recognizing semantically similar queries. Achieves up to 73% cost reduction in conversational workloads with sub-millisecond cache retrieval through vector similarity search.

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.

Scalable Nearest Neighbors library by Google Research that provides efficient vector similarity search at scale. Uses anisotropic vector quantization and advanced compression techniques to handle twice as many queries per second compared to alternatives.