The Excellence
Directory Platform Template

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.

IDEA is an inverted, deduplication-aware index structure designed to improve storage efficiency and query performance for similarity search workloads. It is implemented as research code and targets high-dimensional vector and content-addressable data, making it relevant to large-scale vector database and ANN indexing systems.

RaBitQ is an open-source library implementing the "Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search" method, providing vector quantization and compression techniques designed to improve efficiency and accuracy of ANN search engines and vector databases operating in high-dimensional spaces.

vsag is an Alibaba open-source library implementing efficient vector search algorithms, including approximate nearest neighbor search for high-dimensional vectors.

An open-source library for approximate nearest neighbor search in high-dimensional spaces, often used as a backend for vector databases and search engines.

Cottontail DB is an open-source vector database for storing and searching high-dimensional data, with features geared towards research and production environments.

K-means Tree is a clustering-based data structure that organizes high-dimensional vectors for fast similarity search and retrieval. It is used as an indexing method in some vector databases to optimize performance for vector search operations.

mem0 is an open-source vector database focused on efficient storage and retrieval of high-dimensional embeddings for large-scale AI applications.

MRPT (Multi-Resolution Proximity Trees) is an open-source library for fast approximate nearest neighbor search in high-dimensional vector spaces, applicable to vector database backends.

NMSLIB is an efficient similarity search library and toolkit for high-dimensional vector spaces, supporting a variety of indexing algorithms for vector database use cases.

OasysDB is an open-source vector database focused on efficient similarity search and management of high-dimensional data.

Vexvault is an open-source vector database designed for efficient storage, management, and similarity search of high-dimensional vector data.