6 Repos
Data structures that organize vectors into multi-layered graphs for efficient approximate nearest neighbor search.
Distinguishing note: Specifically targets graph-based structures like HNSW.
Explore 6 awesome GitHub repositories matching data & databases · Graph-Based Indexing. Refine with filters or upvote what's useful.
This project is a high-performance library designed for the similarity search and clustering of dense vectors across massive datasets. It functions as a vector similarity search engine, providing the necessary tools to organize complex numerical data into specialized structures that facilitate rapid retrieval and efficient querying of millions of records. The library distinguishes itself through a variety of advanced indexing and compression techniques, including hierarchical navigable small worlds for logarithmic time complexity and inverted file indexing to partition vector spaces into mana
Constructs a multi-layered graph structure that allows logarithmic time complexity for finding approximate nearest neighbors in high-dimensional space.
Sonic is a high-performance, lightweight search backend designed to provide real-time full-text search and autocomplete capabilities for applications. It functions as a persistent indexing server that maps text terms to object identifiers, allowing developers to integrate rapid search functionality without storing raw document content directly within the search engine. The system distinguishes itself through a specialized graph-based index that enables real-time word prediction and typo correction. Communication is handled via a custom, low-latency binary protocol over raw TCP sockets, which
Maintains a specialized graph structure to enable real-time word prediction and typo correction.
Weaviate is a cloud-native vector database and distributed vector store designed to save high-dimensional vectors alongside structured data. It functions as a hybrid search engine that combines vector similarity, keyword matching, and structured metadata filtering within a single query. The system is optimized for retrieval-augmented generation, integrating vector search with generative AI and reranking to power question-and-answer workflows. It distinguishes itself through the ability to merge semantic search with traditional keyword queries and structured metadata filters to improve result
Implements HNSW graph-based indexing for fast approximate nearest neighbor searches.
USearch is a high-performance vector similarity search engine and approximate nearest neighbor index designed for dense embeddings. It functions as a low-level vector database core and high-dimensional vector indexer, providing the primitives necessary to store and retrieve vectors across massive datasets. The engine distinguishes itself through hardware-level SIMD acceleration for distance kernels and a proximity-graph indexing system that enables fast retrieval across billions of vectors. It supports multi-precision vector quantization to balance memory usage and accuracy, and utilizes memo
Organizes high-dimensional vectors into a graph structure to enable fast approximate nearest neighbor search via traversal.
pgvecto.rs is a database extension that integrates high-dimensional vector search capabilities directly into PostgreSQL. It functions as a specialized engine for storing and retrieving embeddings, allowing relational databases to perform similarity searches alongside traditional structured data queries. The extension distinguishes itself through hardware-aware execution strategies that maximize performance. It performs runtime analysis of the host machine to utilize specific processor instruction sets for accelerated mathematical operations. To manage memory efficiently, it employs quantizati
Organizes high-dimensional data into navigable proximity graphs to enable rapid traversal and retrieval during similarity search operations.
Vald is a distributed, cloud-native search engine designed for high-dimensional vector data. It functions as an approximate nearest neighbor search platform, enabling the identification of similar data points across massive datasets through horizontal scaling and distributed indexing. The system is built for container orchestration environments, utilizing custom resource controllers to automate cluster lifecycle management and infrastructure state. It employs graph-based indexing to perform rapid similarity lookups and supports zero-downtime operations by decoupling index construction from qu
Organizes high-dimensional vectors into navigable graph structures for rapid similarity lookups.