HVS is a graph-based index structure leveraging Voronoi diagrams for approximate nearest neighbor search in high-dimensional vector spaces. It is directly relevant to vector databases as it provides efficient similarity search capabilities for large-scale vector data.
KGraph is an open-source library for fast approximate nearest neighbor search in high-dimensional vector spaces, applicable to vector database solutions.
FAISS (Facebook AI Similarity Search) is a popular open-source library for efficient similarity search and clustering of dense vectors. Developed by Facebook/Meta, it supports billions of vectors and is widely used to power vector search engines and databases, especially where raw speed and scalability are needed.
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.
Arroy is an open-source library for efficient similarity search and management of vector embeddings, useful in vector database systems.
Epsilla is an open-source vector database optimized for high-performance similarity search and scalable storage of vector embeddings.
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.
Source: GitHub Repository
Category: Open Source
Tags: open-source, ann, graph-database, similarity-search
HVS is a graph-based index structure that leverages Voronoi diagrams for approximate nearest neighbor (ANN) search in high-dimensional vector spaces. It is designed to provide efficient similarity search capabilities, making it suitable for large-scale vector data, such as those found in vector databases.
HVS is open source and free to use.