Loading...
NGT (Neighborhood Graph and Tree) is an open-source vector search engine designed for fast and scalable approximate nearest neighbor search.
KGraph is an open-source library for fast approximate nearest neighbor search in high-dimensional vector spaces, applicable to vector database solutions.
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.
An open-source library for approximate nearest neighbor search in high-dimensional spaces, often used as a backend for vector databases and search engines.
A distributed vector database designed for scalable and efficient vector similarity search. It is purpose-built for handling large-scale vector data and search workloads.
DiskANN is a graph-based approximate nearest neighbor search (ANNS) system optimized for fast and accurate billion-point nearest neighbor search on a single node, leveraging SSD storage. It is highly relevant for large-scale vector database applications requiring efficient vector search at scale.
Elasticsearch is a distributed search engine supporting various data types, including vectors, and provides scalable vector search capabilities, making it a popular choice for modern AI-powered applications. It can be extended with the k-NN plugin to provide scalable vector search using HNSW and Lucene, enabling hybrid semantic and keyword search capabilities.
NGT (Neighborhood Graph and Tree) is an open-source vector search engine designed for fast and scalable approximate nearest neighbor (ANN) search in high-dimensional data. It provides both command-line tools and a library for performing efficient searches on large datasets.
NGT can be built from source on Linux and macOS, with options to enable/disable specific features. Pre-built binaries are available via Homebrew for macOS.
NGT is open-source software and is available free of charge under an open-source license.
open-source vector-search ann scalable