awesome-vector-databases

A curated list of vector database solutions, libraries, and resources for AI applications - https://vectordb.works
https://github.com/ever-works/awesome-vector-databases

Last synced: 7 days ago
JSON representation

Research Papers & Surveys
- SLIM (Sparsified Late Interaction Multi-Vector Retrieval) - Efficient multi-vector retrieval system using sparsified late interaction with inverted indexes. Achieves 40% less storage and 83% lower latency than ColBERT-v2 while maintaining competitive accuracy. ([Read more](/details/slim-sparsified-late-interaction-multi-vector-retrieval.md)) `Retrieval` `Research` `Sparse`
- SPFresh - Incremental in-place update system for billion-scale vector search from Microsoft Research. Maintains 2.41x lower P99.9 latency than baselines while supporting efficient vector updates with minimal resource overhead. ([Read more](/details/spfresh.md)) `Ann` `Research` `Dynamic Updates`
- SPLATE - Sparse Late Interaction Retrieval model that combines the benefits of sparse representations with late interaction mechanisms. Provides efficient storage and fast retrieval while maintaining the accuracy advantages of token-level matching in sparse embedding space. ([Read more](/details/splate.md)) `Sparse Retrieval` `Late Interaction` `Research`
- Updatable Balanced Index for Stable Streaming - Research on maintaining balanced, high-quality graph indexes while streaming data arrives continuously. Addresses the challenge of index degradation over time with incremental updates. ([Read more](/details/updatable-balanced-index-streaming.md)) `Streaming` `Indexing` `Graph Based` `Dynamic Updates`
- VQKV - A training-free vector quantization method for KV cache compression in Large Language Models that achieves 82.8% compression ratio on LLaMA3.1-8B while retaining 98.6% baseline performance and enabling 4.3x longer generation length on the same memory footprint. ([Read more](/details/vqkv.md)) `Compression` `Quantization` `Llm Optimization`
- ACL 2023 Tutorial: Retrieval-Based Language Models and Applications - This ACL 2023 tutorial reviews retrieval-based language models, which often rely on vector databases and vector search systems to retrieve relevant context. The tutorial covers methods and applications central to the use of vector databases in modern NLP systems. ([Read more](/details/acl-2023-tutorial-retrieval-based-language-models-and-applications.md)) `Tutorials` `Retrieval` `vector databases` `Applications`
- MUVERA - Multi-Vector Retrieval Algorithm that reduces multi-vector similarity search to single-vector similarity search via Fixed Dimensional Encodings. Achieves 10% improved recall with 90% lower latency compared to existing approaches. ([Read more](/details/muvera.md)) `Multi Vector` `Google` `Efficiency`
- ConstBERT - Novel approach to reduce storage footprint of multi-vector retrieval by encoding each document with a fixed, smaller set of learned embeddings. Reduces index sizes by over 50% compared to ColBERT while retaining most effectiveness. ([Read more](/details/constbert.md)) `Multi Vector` `Compression` `Colbert`
- Exploring Distributed Vector Databases Performance on HPC Platforms - SC'25 Workshop paper characterizing Qdrant vector database performance on high-performance computing platforms, bridging AI and HPC workloads. ([Read more](/details/exploring-distributed-vector-databases-performance-on-hpc-platforms.md)) `Research` `Hpc` `Performance` `Qdrant`
- Intelligence Per Watt - Research metric from Stanford measuring AI model efficiency, showing local language models improved 5.3× from 2023 to 2025, handling 88.7% of single-turn queries. ([Read more](/details/intelligence-per-watt.md)) `Efficiency` `Metrics` `On Device`
- The Novel Vector Database - Research paper proposing a decoupled storage architecture for vector databases that improves update speed by 10.05x for insertions and 6.89x for deletions through innovative design. ([Read more](/details/the-novel-vector-database.md)) `Research` `Architecture` `Performance` `Academic`
- When Large Language Models Meet Vector Databases: A Survey - Comprehensive 2026 research survey examining the integration of LLMs with vector databases, addressing challenges like hallucination, bias, and real-time knowledge updates through vector-based retrieval. ([Read more](/details/when-large-language-models-meet-vector-databases-a-survey.md)) `Research` `Llm` `Survey` `Academic`
- XTR - ConteXtualized Token Retriever that introduces a novel objective function encouraging the model to retrieve the most important document tokens first. Enables ranking 4,000x cheaper than ColBERT's refinement stage with state-of-the-art performance. ([Read more](/details/xtr.md)) `Multi Vector` `Token Retrieval` `Efficiency`
- Accelerating ANNS in Hierarchical Graphs via Shortcuts - VLDB 2025 paper proposing efficient level navigation with shortcuts for accelerating approximate nearest neighbor search in hierarchical graph indexes, improving traversal speed across multi-layer graph structures. ([Read more](/details/accelerating-anns-in-hierarchical-graphs-via-shortcuts.md)) `Graph Index` `Hierarchical` `Acceleration`
- Accelerating Graph Indexing for ANNS on Modern CPUs - SIGMOD 2025 paper proposing optimizations for graph-based approximate nearest neighbor search indexing on modern CPU architectures, leveraging SIMD instructions and cache-aware algorithms for improved index construction performance. ([Read more](/details/accelerating-graph-indexing-for-anns-on-modern-cpus.md)) `Cpu Optimization` `Graph Index` `High Performance`
- Accelerating Graph-based ANNS with Adaptive Awareness - SIGKDD 2025 paper proposing adaptive awareness capabilities for graph-based approximate nearest neighbor search, enabling the search algorithm to dynamically adjust its strategy based on local graph characteristics and query properties. ([Read more](/details/accelerating-graph-based-anns-with-adaptive-awareness.md)) `Graph Index` `Adaptive Search` `Ann`
- AdaptiveIndex — Adaptive Indexing in High-Dimensional Metric Spaces - VLDB 2023 paper introducing an adaptive indexing approach for high-dimensional metric spaces that dynamically adjusts its structure based on query workloads to improve search performance over time. ([Read more](/details/adaptiveindex-adaptive-indexing-in-high-dimensional-metric-spaces.md)) `Adaptive Index` `Metric Spaces` `Dynamic`
- ARKGraph — All-Range Approximate K-Nearest-Neighbor Graph - VLDB 2023 paper proposing ARKGraph, a graph-based method for all-range approximate k-nearest neighbor search that adapts to various recall requirements. ([Read more](/details/arkgraph-all-range-approximate-k-nearest-neighbor-graph.md)) `Graph Index` `Knn` `Approximate Nearest Neighbor`
- BLISS — A Billion Scale Index using Iterative Re-partitioning - SIGKDD 2022 paper introducing BLISS, a billion-scale indexing method using iterative re-partitioning for large-scale approximate nearest neighbor search. ([Read more](/details/bliss-a-billion-scale-index-using-iterative-re-partitioning.md)) `Billion Scale` `Distributed` `Partitions`
- Boosting Deep Vector Quantization with Progressive Distribution Transformation - SIGKDD 2025 paper proposing a progressive distribution transformation approach for boosting deep vector quantization, improving quantization accuracy by progressively adapting data distributions during training. ([Read more](/details/boosting-deep-vector-quantization-with-progressive-distribution-transformation.md)) `Quantization` `Deep Learning` `Distribution Transformation`
- CAPS: A Practical Partition Index for Filtered Similarity Search - Research paper introducing CAPS, a practical partition index designed for filtered similarity search. Published as an arXiv preprint in 2023 by Gaurav Gupta et al., it addresses the challenge of combining attribute filtering with approximate nearest neighbor search efficiently. ([Read more](/details/caps-a-practical-partition-index-for-filtered-similarity-search.md)) `Filtered Search` `Partition Index` `Similarity Search`
- DB-LSH — Locality-Sensitive Hashing with Query-based Dynamic Bucketing - ICDE 2023 and TKDE 2023 papers introducing DB-LSH, a locality-sensitive hashing approach with query-based dynamic bucketing for efficient approximate nearest neighbor search. ([Read more](/details/db-lsh-locality-sensitive-hashing-with-query-based-dynamic-bucketing.md)) `Hash Based` `Locality Sensitive` `Dynamic Bucketing`
- DIDS — Double Indices and Double Summarizations for Fast Similarity Search - VLDB 2024 paper presenting DIDS, a fast similarity search method using double indices and double summarizations to accelerate high-dimensional vector queries. ([Read more](/details/dids-double-indices-and-double-summarizations-for-fast-similarity-search.md)) `Tree Index` `Similarity Search` `High Dimensional`
- DIMS — Distributed Index for Similarity Search in Metric Spaces - TKDE 2024 paper presenting DIMS, a distributed indexing method for efficient similarity search across metric spaces. The approach enables parallel processing of vector similarity queries at scale. ([Read more](/details/dims-distributed-index-for-similarity-search-in-metric-spaces.md)) `Distributed` `Similarity Search` `Metric Spaces`
- EFANNA — Extremely Fast Approximate Nearest Neighbor Search Based on kNN Graph - Paper proposing EFANNA, an extremely fast approximate nearest neighbor search algorithm based on kNN graph construction. The method introduces an efficient approximate kNN graph building approach and a search algorithm that achieves state-of-the-art query performance. ([Read more](/details/efanna-extremely-fast-approximate-nearest-neighbor-search-based-on-knn-graph.md)) `Graph Index` `Knn Graph` `Approximate Nearest Neighbor`
- FANNG — Fast Approximate Nearest Neighbour Graphs - Paper introducing FANNG, a fast algorithm for constructing approximate nearest neighbor graphs. The method builds graphs that enable efficient nearest neighbor queries while maintaining high quality approximations. ([Read more](/details/fanng-fast-approximate-nearest-neighbour-graphs.md)) `Graph Construction` `Ann` `Approximate Nearest Neighbor`
- FINGER — Fast Inference for Graph-based ANNS - FINGER provides a fast inference framework for graph-based approximate nearest neighbor search, optimizing search path traversal to reduce query latency while maintaining high recall. Published at Web 2023. ([Read more](/details/finger-fast-inference-for-graph-based-anns.md)) `Graph Index` `Inference` `High Performance`
- Hercules — Against Data Series Similarity Search - VLDB 2022 paper introducing Hercules, an approach for efficient data series (time series) similarity search at scale, leveraging advanced indexing and pruning techniques for billion-scale sequence datasets. ([Read more](/details/hercules-against-data-series-similarity-search.md)) `Time Series` `Similarity Search` `Billion Scale`
- High-Dimensional Approximate Nearest Neighbor Search with Reliable and Efficient Distance Comparison - Research paper on high-dimensional approximate nearest neighbor search focusing on reliable and efficient distance comparison operations. Published in Proceedings of the ACM on Management of Data, Volume 1, Issue 2 in 2023 by Jianyang Gao and Cheng Long. ([Read more](/details/high-dimensional-approximate-nearest-neighbor-search-with-reliable-and-efficient-distance-comparison.md)) `Nearest Neighbor` `Distance Comparison` `High Dimensional`
- HNSW — Efficient and Robust ANNS Using Hierarchical Navigable Small World Graphs - Foundational TPAMI 2018 paper introducing Hierarchical Navigable Small World (HNSW) graphs, one of the most widely adopted approximate nearest neighbor search algorithms. The hierarchical multi-layer graph structure enables logarithmic-time search with high recall. ([Read more](/details/hnsw-efficient-and-robust-anns-using-hierarchical-navigable-small-world-graphs.md)) `Graph Index` `Approximate Nearest Neighbor` `Foundational`
- HVS — Hierarchical Graph Structure Based on Voronoi Diagrams for ANNS - VLDB 2021 paper introducing HVS, a hierarchical graph structure based on Voronoi diagrams for solving approximate nearest neighbor search with improved search efficiency through geometric partitioning. ([Read more](/details/hvs-hierarchical-graph-structure-based-on-voronoi-diagrams-for-anns.md)) `Graph Index` `Voronoi` `Geometric Index`
- IDEA: Inverted Deduplication-Aware Index - Research paper presenting IDEA, an inverted deduplication-aware index that compares physical vs. logical indexing approaches for vector search. Published at the 22nd USENIX Conference on File and Storage Technologies (FAST 24) in 2024. ([Read more](/details/idea-inverted-deduplication-aware-index.md)) `Indexing` `Deduplication` `Fast24`
- Improving ANNS through Learned Adaptive Early Termination - SIGMOD 2020 paper proposing learned adaptive early termination for approximate nearest neighbor search, using machine learning to predict when to stop searching, balancing accuracy and latency dynamically. ([Read more](/details/improving-anns-through-learned-adaptive-early-termination.md)) `Learning Based` `Early Termination` `Graph Index`
- Juno — Optimizing ANNS with Sparsity-Aware Algorithm and Ray-Tracing Core Mapping - ASPLOS 2024 paper introducing Juno, a system that accelerates high-dimensional approximate nearest neighbor search using sparsity-aware algorithms and GPU ray-tracing (RT) core mapping for hardware-level computation acceleration. ([Read more](/details/juno-optimizing-anns-with-sparsity-aware-algorithm-and-ray-tracing-core-mapping.md)) `Gpu Acceleration` `Hardware Acceleration` `High Performance`
- LANNS: A Web-scale Approximate Nearest Neighbor Lookup System - Research paper introducing LANNS, a web-scale approximate nearest neighbor lookup system developed at Facebook (Meta). Published as an arXiv preprint in 2020, it describes techniques for serving ANN search at massive scale in production systems. ([Read more](/details/lanns-a-web-scale-approximate-nearest-neighbor-lookup-system.md)) `Nearest Neighbor` `Web Scale` `Production System`
- LeanVec: Search Your Vectors Faster by Making Them Fit - Research paper introducing LeanVec, a technique to accelerate vector search by reducing vector dimensionality while preserving search accuracy. Published as an arXiv preprint in 2023 by Mariano Tepper et al. ([Read more](/details/leanvec-search-your-vectors-faster-by-making-them-fit.md)) `Dimensionality Reduction` `Vector Search` `Performance`
- Learning Balanced Tree Indexes for Large-Scale Vector Retrieval - SIGKDD 2023 paper proposing learned balanced tree indexing for large-scale vector retrieval, using machine learning to construct balanced tree structures optimized for vector similarity search at scale. ([Read more](/details/learning-balanced-tree-indexes-for-large-scale-vector-retrieval.md)) `Tree Index` `Learning Based` `Large Scale`
- Learning to Route in Similarity Graphs - ICML 2019 paper introducing a learned routing approach for similarity graphs, using machine learning to guide greedy search traversal in graph-based approximate nearest neighbor search. ([Read more](/details/learning-to-route-in-similarity-graphs.md)) `Graph Index` `Learning Based` `Ann`
- LIRA — Learning-based Query-aware Partition Framework for Large-scale ANN Search - WWW 2025 paper proposing LIRA, a learning-based query-aware partition framework designed for large-scale approximate nearest neighbor search, adapting partitions based on query characteristics to improve search efficiency. ([Read more](/details/lira-learning-based-query-aware-partition-framework-for-large-scale-ann-search.md)) `Learning Based` `Partitions` `Large Scale`
- Locality-Sensitive Indexing for Graph-Based ANNS - SIGIR 2025 paper proposing a locality-sensitive indexing approach for graph-based approximate nearest neighbor search, combining LSH principles with graph structure for improved search accuracy. ([Read more](/details/locality-sensitive-indexing-for-graph-based-anns.md)) `Graph Index` `Hash Based` `Locality Sensitive`
- Long-Context LLMs Meet RAG - A research paper examining the intersection of long-context LLMs and Retrieval-Augmented Generation, focusing on the challenges of combining long-context windows with RAG pipelines, including the 'hard negatives' problem where irrelevant retrieved documents can degrade LLM output quality. ([Read more](/details/long-context-llms-meet-rag.md)) `Long Context` `Rag` `Hard Negatives`
- LSH-APG — Towards Efficient Index Construction and ANNS in High-Dimensional Spaces - VLDB 2023 paper proposing LSH-APG, a method combining locality-sensitive hashing with adaptive proximity graphs for efficient index construction and approximate nearest neighbor search in high-dimensional spaces. ([Read more](/details/lsh-apg-towards-efficient-index-construction-and-anns-in-high-dimensional-spaces.md)) `Graph Index` `Hash Based` `High Dimensional`
- Maze: A Cost-Efficient Video Deduplication System at Web-scale - Research paper presenting Maze, a web-scale video deduplication system designed for cost efficiency. Published at the 30th ACM International Conference on Multimedia in 2022, it addresses large-scale video similarity detection. ([Read more](/details/maze-a-cost-efficient-video-deduplication-system-at-web-scale.md)) `Video Deduplication` `Web Scale` `Similarity Search`
- MP-RW-LSH — Multi-probe LSH for A1-Norm Nearest Neighbor Search - VLDB 2021 paper introducing MP-RW-LSH, an efficient multi-probe locality-sensitive hashing solution for A1-norm (Manhattan distance) approximate nearest neighbor search. ([Read more](/details/mp-rw-lsh-multi-probe-lsh-for-a1-norm-nearest-neighbor-search.md)) `Hash Based` `Locality Sensitive` `Multi Probe`
- NHQ — Approximate Nearest Neighbor Search with Attribute Constraint - NeurIPS 2023 paper presenting NHQ, an efficient and robust framework for approximate nearest neighbor search with attribute constraints, enabling hybrid queries combining vector similarity with structured filtering. ([Read more](/details/nhq-approximate-nearest-neighbor-search-with-attribute-constraint.md)) `Hybrid Search` `Filtering` `Similarity Search`
- NSSG — High Dimensional Similarity Search with Satellite System Graph - Paper proposing the Satellite System Graph (NSSG) approach for high dimensional similarity search, emphasizing efficiency, scalability, and unindexed query compatibility. Published in TPAMI 2021 by Fu et al. ([Read more](/details/nssg-high-dimensional-similarity-search-with-satellite-system-graph.md)) `Graph Index` `Similarity Search` `High Dimensional`
- NSW — Approximate Nearest Neighbor Search on Navigable Small World Graphs - Foundational paper introducing the navigable small world (NSW) graph algorithm for approximate nearest neighbor search, which became the basis for widely-used graph-based ANN methods including HNSW. ([Read more](/details/nsw-approximate-nearest-neighbor-search-on-navigable-small-world-graphs.md)) `Graph Index` `Ann` `Approximate Nearest Neighbor`
- OneSparse: A Unified System for Multi-index Vector Search - Research paper presenting OneSparse, a unified system for multi-index vector search. Published at the Companion Proceedings of the ACM on Web Conference 2024, it addresses the challenge of efficient vector search across multiple index structures. ([Read more](/details/onesparse-a-unified-system-for-multi-index-vector-search.md)) `Multi Index` `Vector Search` `Acm`
- Optimizing Clusters for Billion-Scale Quantization-Based NNS - TKDE 2024 paper on optimizing the number of clusters for billion-scale quantization-based nearest neighbor search, providing methods to determine optimal clustering for quantized vector indexing. ([Read more](/details/optimizing-clusters-for-billion-scale-quantization-based-nns.md)) `Quantization` `Clustering` `Billion Scale`
- ParlayANN — Scalable and Deterministic Parallel Graph-Based ANNS - PPoPP 2024 paper presenting ParlayANN, a scalable and deterministic parallel framework for graph-based approximate nearest neighbor search algorithms, achieving high parallelism with deterministic results. ([Read more](/details/parlayann-scalable-and-deterministic-parallel-graph-based-anns.md)) `Parallel Computing` `Graph Index` `Deterministic`
- PM-LSH — A Fast and Accurate In-memory Framework for High-Dimensional ANNS - VLDB 2022 paper introducing PM-LSH, an in-memory locality-sensitive hashing framework for high-dimensional approximate nearest neighbor and closest pair search with strong accuracy guarantees. ([Read more](/details/pm-lsh-a-fast-and-accurate-in-memory-framework-for-high-dimensional-anns.md)) `Hash Based` `In Memory` `Locality Sensitive`
- Probabilistic Routing for Graph-Based ANNS - Paper from 2024 proposing a probabilistic routing approach for graph-based approximate nearest neighbor search, introducing probability models to guide search traversal on proximity graphs. ([Read more](/details/probabilistic-routing-for-graph-based-anns.md)) `Graph Index` `Probabilistic` `Ann`
- QALSH — Query-Aware Locality-Sensitive Hashing for ANNS - VLDB 2015 paper introducing QALSH, a query-aware locality-sensitive hashing scheme that improves retrieval accuracy by dynamically adjusting hash functions based on query characteristics. ([Read more](/details/qalsh-query-aware-locality-sensitive-hashing-for-anns.md)) `Hash Based` `Locality Sensitive` `Query Aware`
- Query Likelihood Boosting and Two-Level Approximate Search - Research on search optimization using query likelihood boosting combined with two-level approximate search algorithms optimized for edge devices. Addresses the challenge of performing efficient vector similarity search in resource-constrained environments. ([Read more](/details/query-likelihood-boosting-and-two-level-approximate-search.md)) `Edge Devices` `Query Optimization` `Approximate Search`
- RaBitQ — Quantizing High-Dimensional Vectors with Theoretical Error Bound for ANNS - SIGMOD 2024 paper introducing RaBitQ, a quantization method for high-dimensional vectors with provable theoretical error bounds for approximate nearest neighbor search in Euclidean space. ([Read more](/details/rabitq-quantizing-high-dimensional-vectors-with-theoretical-error-bound-for-anns.md)) `Quantization` `Theoretical Guarantees` `High Dimensional`
- RAGOps: Operating and Managing Retrieval-Augmented Generation Pipelines - Research paper on operating and managing Retrieval-Augmented Generation (RAG) pipelines at scale, covering production infrastructure patterns, monitoring, microservices decomposition, and multi-model architecture for enterprise embedding systems. ([Read more](/details/ragops-operating-and-managing-retrieval-augmented-generation-pipelines.md)) `Rag` `Production System` `Observability`
- REAPER - REAPER (Reasoning based Retrieval Planning for Complex RAG Systems) is a research framework that addresses multi-step retrieval planning in complex Retrieval-Augmented Generation scenarios. It enables retrieval systems to plan and execute reasoning-aware retrieval strategies rather than relying on simple similarity-based matching. ([Read more](/details/reaper.md)) `Retrieval Planning` `Complex Rag` `Research`
- Reinforcement Routing on Proximity Graph for Efficient Recommendation - TOIS 2023 paper proposing reinforcement learning-based routing on proximity graphs for efficient recommendation, applying graph traversal optimization to recommendation systems using vector-based item representations. ([Read more](/details/reinforcement-routing-on-proximity-graph-for-efficient-recommendation.md)) `Graph Index` `Reinforcement Learning` `Recommendation`
- Residual Quantization with Implicit Neural Codebooks - ICML 2024 paper presenting a novel residual quantization approach using implicit neural codebooks for vector compression in high-dimensional similarity search, replacing traditional fixed codebooks with learned representations. ([Read more](/details/residual-quantization-with-implicit-neural-codebooks.md)) `Quantization` `Neural Networks` `Compression`
- RoarGraph — A Projected Bipartite Graph for Efficient Cross-Modal ANNS - VLDB 2024 paper proposing RoarGraph, a projected bipartite graph structure for efficient cross-modal approximate nearest neighbor search. The method addresses the challenges of searching across different modalities (e.g., text, image) using graph-based indexing. ([Read more](/details/roargraph-a-projected-bipartite-graph-for-efficient-cross-modal-anns.md)) `Cross Modal` `Graph Index` `Ann`
- Routing-Guided Learned Product Quantization for Graph-Based ANNS - ICDE 2024 paper proposing a routing-guided learned product quantization method that enhances graph-based approximate nearest neighbor search by learning optimal quantization guided by graph routing information. ([Read more](/details/routing-guided-learned-product-quantization-for-graph-based-anns.md)) `Quantization` `Graph Index` `Learning Based`
- RTNN: Accelerating Neighbor Search Using Hardware Ray Tracing - Research paper by Yuhao Zhu presenting RTNN, a novel approach that leverages hardware ray tracing capabilities to accelerate approximate nearest neighbor search. Published at the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming in 2022. ([Read more](/details/rtnn-accelerating-neighbor-search-using-hardware-ray-tracing.md)) `Ray Tracing` `Gpu` `Ppopp22`
- ScaNN — Accelerating Large-Scale Inference with Anisotropic Vector Quantization - ICML 2020 paper introducing ScaNN (Scalable Nearest Neighbors), a system for accelerating large-scale vector similarity search using anisotropic vector quantization, combining quantization with asymmetric distance computation for high-performance ANN search. ([Read more](/details/scann-accelerating-large-scale-inference-with-anisotropic-vector-quantization.md)) `Quantization` `Asymmetric Distance` `Google Research`
- SeRF — Segment Graph for Range-Filtering ANNS - SIGMOD 2024 paper introducing SeRF, a segment graph approach for range-filtering approximate nearest neighbor search, enabling efficient hybrid queries that combine vector similarity with range constraints on attributes. ([Read more](/details/serf-segment-graph-for-range-filtering-anns.md)) `Hybrid Search` `Graph Index` `Range Filtering`
- Steiner-Hardness — A Query Hardness Measure for Graph-based ANN Indexes - VLDB 2025 paper introducing Steiner-Hardness, a novel query hardness measure for graph-based approximate nearest neighbor search that characterizes query difficulty based on graph topology. ([Read more](/details/steiner-hardness-a-query-hardness-measure-for-graph-based-ann-indexes.md)) `Graph Index` `Query Analysis` `Theoretical Analysis`
- Survey of Vector Database Management Systems - VLDB 2024 paper presenting a comprehensive survey of vector database management systems, covering architecture, indexing techniques, query processing, and emerging trends in the rapidly evolving field of vector databases. ([Read more](/details/survey-of-vector-database-management-systems.md)) `Survey` `Vector Database` `Systematic Review`
- TongSearch-QR - TongSearch-QR (Reinforced Query Reasoning for Retrieval) is a research model that applies reinforcement learning techniques to query reasoning in retrieval systems, enabling improved reasoning capabilities for complex query understanding and retrieval planning in vector search. ([Read more](/details/tongsearch-qr.md)) `Query Reasoning` `Reinforcement Learning` `Retrieval`
- UNIFY — Unified Index for Range Filtered ANNS - VLDB 2025 paper presenting UNIFY, a unified index structure for range-filtered approximate nearest neighbor search, enabling efficient retrieval with both vector similarity and range constraints on structured attributes. ([Read more](/details/unify-unified-index-for-range-filtered-anns.md)) `Hybrid Search` `Range Filtering` `Unified Index`
- Wolverine — Highly Efficient Monotonic Search Path Repair for Graph-based ANN Index Updates - VLDB 2025 paper introducing Wolverine, a highly efficient method for maintaining and repairing monotonic search paths during incremental updates to graph-based approximate nearest neighbor indexes. ([Read more](/details/wolverine-highly-efficient-monotonic-search-path-repair-for-graph-based-ann-index-updates.md)) `Graph Index` `Incremental Update` `Maintenance`
- CoTra: Towards Efficient and Scalable Distributed Vector Search with RDMA - CoTra system by Zhi et al. for efficient distributed vector search using RDMA. Published in SIGMOD 2026 proceedings. ([Read more](/details/cotra-towards-efficient-and-scalable-distributed-vector-search-with-rdma.md)) `Distributed` `rdma` `Scalable`
- Distance Comparison Operators for Approximate Nearest Neighbor Search: Exploration and Benchmark - Explores and benchmarks distance comparison operators for ANN. arXiv preprint arXiv:2403.13491 (2024) by Zeyu Wang et al. Aids in vector search optimization. ([Read more](/details/distance-comparison-operators-for-approximate-nearest-neighbor-search-exploration-and-benchmark.md)) `research` `Ann` `distance-metrics` `benchmark`
- Exploring the Meaningfulness of Nearest Neighbor Search in High-Dimensional Space - Research paper by Chen et al. examining the meaningfulness of nearest neighbor search in high-dimensional spaces. Analyzes limitations and implications for vector similarity search. Key for understanding ANN effectiveness. ([Read more](/details/exploring-the-meaningfulness-of-nearest-neighbor-search-in-high-dimensional-space.md)) `Ann` `high-dimensional` `nearest-neighbor`
- FusionANNS: An Efficient CPU/GPU Cooperative Processing Architecture for Billion-scale Approximate Nearest Neighbor Search - FusionANNS architecture by Bing Tian et al. for billion-scale ANN search using CPU/GPU cooperation. ([Read more](/details/fusionanns-an-efficient-cpugpu-cooperative-processing-architecture-for-billion-scale-approximate-nearest-neighbor-search.md)) `Ann` `cpu-gpu` `Billion Scale`
- GleanVec: Accelerating vector search with minimalist nonlinear dimensionality reduction - Paper by Tepper et al. proposing GleanVec, a method to accelerate vector search using minimalist nonlinear dimensionality reduction. Improves efficiency for high-dimensional vector queries. ([Read more](/details/gleanvec-accelerating-vector-search-with-minimalist-nonlinear-dimensionality-reduction.md)) `dimensionality-reduction` `Vector Search` `Ann`
- iDEC: Indexable Distance Estimating Codes for Approximate Nearest Neighbor Search - iDEC by Gong et al. for approximate nearest neighbor search using indexable distance estimating codes. VLDB Endowment 13.9 (2020). ([Read more](/details/idec-indexable-distance-estimating-codes-for-approximate-nearest-neighbor-search.md)) `Ann` `distance-estimating` `codes`
- SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search - Highly-efficient billion-scale approximate nearest neighbor search algorithm introduced by Chen et al. Focuses on scalability and performance for large datasets in high-dimensional spaces. Relevant for vector database indexing techniques. ([Read more](/details/spann-highly-efficient-billion-scale-approximate-nearest-neighbor-search.md)) `Ann` `Billion Scale` `approximate-nearest-neighbor`
- Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search - Framework by Wei et al. for high-dimensional ANN search using subspace collision techniques. Offers efficiency and accuracy improvements for vector databases. ([Read more](/details/subspace-collision-an-efficient-and-accurate-framework-for-high-dimensional-approximate-nearest-neighbor-search.md)) `Ann` `high-dimensional` `subspace`
- Vector search with small radiuses - Research on vector search using small radius queries. arXiv preprint arXiv:2403.10746 (2024) by Gergely Szilvasy et al. Optimizes ANN for narrow searches. ([Read more](/details/vector-search-with-small-radiuses.md)) `research` `Ann` `radius-search`
- VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning - VHP method by Lu et al. for approximate nearest neighbor search using virtual hypersphere partitioning. Published in VLDB Endowment 13.9 (2020). ([Read more](/details/vhp-approximate-nearest-neighbor-search-via-virtual-hypersphere-partitioning.md)) `Ann` `partitioning` `hypersphere`
- Accelerating ANNS in Hierarchical Graphs via Shortcuts - VLDB 2025 paper proposing efficient level navigation with shortcuts for accelerating approximate nearest neighbor search in hierarchical graph indexes, improving traversal speed across multi-layer graph structures. ([Read more](/details/accelerating-anns-in-hierarchical-graphs-via-shortcuts.md)) `graph-index` `hierarchical` `acceleration`
- NSW — Approximate Nearest Neighbor Search on Navigable Small World Graphs - Foundational paper introducing the navigable small world (NSW) graph algorithm for approximate nearest neighbor search, which became the basis for widely-used graph-based ANN methods including HNSW. ([Read more](/details/nsw-approximate-nearest-neighbor-search-on-navigable-small-world-graphs.md)) `graph-index` `Ann` `approximate-nearest-neighbor`
- PANTHER: Private Approximate Nearest Neighbor Search in the Single Server Setting - PANTHER provides private ANN search in single server settings. Relevant for secure vector databases in AI. Cryptology ePrint Archive (2024) by Jingyu Li et al. ([Read more](/details/panther-private-approximate-nearest-neighbor-search-in-the-single-server-setting.md)) `research` `privacy` `Ann`
- SOAR — Improved Indexing for Approximate Nearest Neighbor Search - NeurIPS 2023 paper proposing SOAR, a method for improved indexing in approximate nearest neighbor search, focusing on better space partitioning and search optimization. ([Read more](/details/soar-improved-indexing-for-approximate-nearest-neighbor-search.md)) `indexing` `approximate-nearest-neighbor` `neurips`
- Starling — I/O-Efficient Disk-Resident Graph Index Framework - SIGMOD 2024 paper introducing Starling, an I/O-efficient disk-resident graph index framework for high-dimensional vector similarity search on data segments, optimizing disk access patterns for billion-scale datasets. ([Read more](/details/starling-io-efficient-disk-resident-graph-index-framework.md)) `Disk Based` `graph-index` `io-efficient`
Rust-based Vector Databases
- nano-vectordb-rs - A simple, easy-to-hack vector database library implemented in Rust. It supports fast cosine similarity searches with Rayon parallelism, embedded persistence, and a minimal API ideal for prototyping and educational purposes. ([Read more](/details/nano-vectordb-rs.md)) `Rust` `Open Source` `Embedded` `Lightweight` `No Server` `Rust Lang` `Performance Critical` `Wasm Support`
- RuVector - A self-learning, self-optimizing vector database with graph intelligence, local AI runtime, and PostgreSQL integration. It improves search quality over time using GNNs that learn from queries and feedback, supports hybrid search, Graph RAG, DiskANN, and deploys as a single file anywhere including browsers and edge devices. Open-source under MIT license, free forever. ([Read more](/details/ruvector.md)) `Open Source` `Hybrid Search` `Graph Database` `Rust` `Wasm` `Rust Lang` `Performance Critical` `Wasm Support`
Rust-Based Vector DBs
- rust-vector-db - rust-vector-db is a lightweight, educational vector database implemented in Rust, leveraging memory safety, high performance, and SIMD instructions for efficient vector storage and retrieval. It supports HNSW indexing, product quantization, disk persistence, and distance metrics like cosine similarity, Euclidean, and dot product. Perfect for high-perf embedded and edge AI applications or learning purposes; more performant and safer than Python-based libraries like Chroma. ([Read more](/details/rust-vector-db.md)) `Rust Lang` `Memory Safe` `Simd` `Embedded Rust` `Disk Persistence`
Scalable Distributed Vector DBs
- Vald - Vald is a distributed vector search engine built for high scalability and low latency, using NGram-based filtering and Go implementation. It supports sharding and high availability for cloud-native deployments. Suited for real-time recommendations; similar to Milvus but lighter with focus on NG-Tree indexing vs full feature set. ([Read more](/details/vald.md)) `distributed search` `ngt index` `go lang`
Sdks & Libraries
- Annoy - An open-source library for approximate nearest neighbor search in high-dimensional spaces, often used as a backend for vector databases and search engines. ([Read more](/details/annoy.md)) `open-source` `ANN` `high-dimensional` `vector search`
- Deep Searcher - Deep Searcher is a local open-source deep research solution that integrates Milvus and LangChain to provide advanced vector search and retrieval capabilities using open-source models. ([Read more](/details/deep-searcher.md)) `open-source` `Milvus` `LangChain` `vector search`
- DiskANN - 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. ([Read more](/details/diskann.md)) `ANN` `high-performance` `scalable` `vector search`
- FAISS - 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. ([Read more](/details/faiss.md)) `open-source` `ANN` `similarity search` `scalable`
- FastText - FastText is an open-source library by Facebook for efficient learning of word representations and text classification. It generates high-dimensional vector embeddings used in vector databases for tasks like semantic search and document clustering. ([Read more](/details/fasttext.md)) `open-source` `vector embeddings` `semantic search` `machine learning`
- Gensim - Gensim is a Python library for topic modeling and vector space modeling, providing tools to generate high-dimensional vector embeddings from text data. These embeddings can be stored and efficiently searched in vector databases, making Gensim directly relevant to vector search use cases. ([Read more](/details/gensim.md)) `Python` `vector embeddings` `open-source` `topic modeling`
- GloVe - GloVe is a widely used method for generating word embeddings using co-occurrence statistics from text corpora. These embeddings are commonly used as input to vector databases for semantic search and other vector-based information retrieval tasks. ([Read more](/details/glove.md)) `vector embeddings` `machine learning` `open-source` `semantic search`
- HNSWLIB - HNSWLIB is a C++ library with Python bindings for fast approximate nearest neighbor search using Hierarchical Navigable Small World (HNSW) graphs, commonly used in vector database backends. ([Read more](/details/hnswlib.md)) `open-source` `ANN` `HNSW` `vector search`
- hora - Hora is an efficient, open-source library for approximate nearest neighbor search, written in Rust. It offers high-performance vector search capabilities for AI and machine learning applications. ([Read more](/details/hora.md)) `open-source` `ANN` `Rust` `high-performance`
- LangChain - LangChain is an open-source framework that integrates with various vector databases, including Pinecone, Weaviate, and Chroma, to facilitate retrieval-augmented generation (RAG) and advanced AI workflows. ([Read more](/details/langchain.md)) `open-source` `RAG` `AI` `integration`
- Milvus CLI - Milvus CLI is a command-line interface for managing and interacting with Milvus vector databases, allowing users to perform database operations and manage collections efficiently. ([Read more](/details/milvus-cli.md)) `Milvus` `CLI` `management` `vector databases`
- NMSLIB - 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. ([Read more](/details/nmslib.md)) `open-source` `ANN` `similarity search` `high-dimensional`
- NVIDIA CAGRA - NVIDIA CAGRA is a GPU-accelerated graph-based library for approximate nearest neighbor searches, optimized for high-performance vector search leveraging modern GPU parallelism. It is suitable for scenarios requiring rapid, large-scale vector retrieval. ([Read more](/details/nvidia-cagra.md)) `GPU acceleration` `ANN` `high-performance` `vector search`
- PGVector - PostgreSQL supports vector indexing and similarity search via the PGVector extension, allowing relational databases to manage and retrieve vector embeddings efficiently. ([Read more](/details/pgvector.md)) `open-source` `vector search` `PostgreSQL` `similarity search`
- pymilvus - pymilvus is the official Python SDK for Milvus, allowing developers to interact programmatically with the Milvus vector database. It provides utilities for transforming unstructured data into vector embeddings and supports advanced features such as reranking for optimized search results. The pymilvus[model] variant includes utilities for generating vector embeddings from text using built-in models. `Python` `Milvus` `vector embeddings` `SDK`
- RediSearch - RediSearch is a Redis module that provides high-performance vector search and similarity search capabilities on top of Redis, enabling advanced search and retrieval features for AI and data applications. ([Read more](/details/redisearch.md)) `vector search` `Redis` `open-source` `similarity search`
- RETA-LLM - RETA-LLM is a toolkit designed for retrieval-augmented large language models. It is directly relevant to vector databases as it involves retrieval-based methods that typically leverage vector search and vector databases to enhance language model capabilities through external knowledge retrieval. ([Read more](/details/reta-llm.md)) `RAG` `LLM` `retrieval` `vector search`
- ScaNN - A library by Google Research for efficient vector similarity search, suitable for large-scale nearest neighbor applications in AI. ([Read more](/details/scann.md)) `open-source` `ANN` `vector search` `AI`
- spaCy - spaCy is an industrial-strength NLP library in Python that provides advanced tools for generating word, sentence, and document embeddings. These embeddings are commonly stored and searched in vector databases for NLP and semantic search applications. ([Read more](/details/spacy.md)) `Python` `vector embeddings` `NLP` `open-source`
- SPTAG - SPTAG is a distributed approximate nearest neighbor (ANN) library for building and searching large-scale vector indexes, supporting efficient and scalable vector search scenarios. ([Read more](/details/sptag.md)) `open-source` `ANN` `distributed` `scalable`
- Tantivy - Tantivy is a full-text search engine library inspired by Apache Lucene, offering fast and scalable similarity search capabilities. While primarily focused on text, it supports efficient vector-based similarity searches, making it useful for vector search tasks. ([Read more](/details/tantivy.md)) `open-source` `full-text search` `vector search` `scalable`
- txtai - txtai is an open-source AI framework that provides semantic search and vector database capabilities for language model workflows. ([Read more](/details/txtai.md)) `open-source` `semantic search` `vector databases` `AI`
- usearch - usearch is a fast, open-source search and clustering engine designed for efficient vector search across multiple programming languages. ([Read more](/details/usearch.md)) `open-source` `vector search` `clustering` `multi-language`
- AutoTokenizer (Hugging Face Transformers) - A utility class from the Hugging Face Transformers library that automatically loads the correct tokenizer for a given pre-trained model. It is crucial for consistent text preprocessing and tokenization, a vital step before generating embeddings for vector database storage. ([Read more](/details/autotokenizer-hugging-face-transformers.md)) `NLP` `tokenization` `Hugging Face`
- Sentence-Transformers - A Python library for creating sentence, text, and image embeddings, enabling the conversion of text into high-dimensional numerical vectors that capture semantic meaning. It is essential for tasks like semantic search and Retrieval Augmented Generation (RAG), which often leverage vector databases. ([Read more](/details/sentence-transformers.md)) `Python` `embeddings` `semantic search`
- Hugging Face Sentence Transformers Embedding Function for ChromaDB Java Client - An embedding function implementation within the ChromaDB Java client (tech.amikos.chromadb.embeddings.hf.HuggingFaceEmbeddingFunction) that utilizes Hugging Face's cloud-based inference API to generate vector embeddings for documents. ([Read more](/details/hugging-face-sentence-transformers-embedding-function-for-chromadb-java-client.md)) `embeddings` `Java` `Hugging Face`
- JinaEmbeddingFunction - A wrapper embedding function for Jina Embedding models, used to generate vector embeddings. ([Read more](/details/jinaembeddingfunction.md)) `embeddings` `Jina` `API`
- OpenAIEmbeddingFunction - An embedding function that utilizes the OpenAI API to compute vector embeddings, commonly used with vector databases. ([Read more](/details/openaiembeddingfunction.md)) `embeddings` `OpenAI` `API`
- Amazon OpenSearch k-NN - Amazon OpenSearch's k-NN plugin enables scalable, efficient vector search using ANN algorithms (IVF, HNSW) directly within a managed OpenSearch cluster. It is directly relevant for building, querying, and scaling vector databases on AWS. ([Read more](/details/amazon-opensearch-k-nn.md)) `vector search` `ANN` `managed service` `OpenSearch`
- AHPQ.jl - AHPQ.jl is a Julia library providing training and inference for anisotropic hierarchical product quantization, compatible with ScaNN-style vector quantization and useful for building high-performance vector search pipelines. ([Read more](/details/ahpqjl.md)) `product quantization` `Julia` `vector search`
- EFANNA - EFANNA is an extremely fast approximate nearest neighbor search algorithm based on kNN graphs and randomized KD-trees. The provided implementation offers a high-performance ANN index suitable as a building block in custom vector search and retrieval infrastructure. ([Read more](/details/efanna.md)) `ANN` `high-performance` `vector indexing`
- HNSW (Go) - A Go implementation of the HNSW approximate nearest neighbor search algorithm, enabling developers to embed efficient vector similarity search directly into Go services and custom vector database solutions. ([Read more](/details/hnsw-go.md)) `ANN` `Go` `vector search`
- HNSW (Rust) - A Rust implementation of the HNSW (Hierarchical Navigable Small World) approximate nearest neighbor search algorithm, useful for building high-performance, memory-safe vector search components in Rust-based AI and retrieval systems. ([Read more](/details/hnsw-rust.md)) `ANN` `Rust` `vector search`
- IDEA - 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. ([Read more](/details/idea.md)) `similarity search` `indexing` `high-dimensional`
- iRangeGraph - iRangeGraph is an ANN indexing approach and accompanying implementation for range-filtering nearest neighbor search. It provides a specialized graph-based index that supports vector similarity search under range constraints, making it directly useful as a component or reference implementation for advanced vector database indexing and retrieval. ([Read more](/details/irangegraph.md)) `ANN` `graph index` `similarity search`
- jvector - jvector is a high-performance Java-based library and engine for vector search and approximate nearest neighbor indexing. ([Read more](/details/jvector.md)) `ANN` `vector search` `high-performance`
- LibVQ - LibVQ is an open-source toolkit for optimizing vector quantization and efficient neural retrieval, offering training and indexing components that can serve as the core of high-performance approximate nearest neighbor search and vector database systems. ([Read more](/details/libvq.md)) `vector quantization` `neural search` `ANN`
- NearestNeighbors.jl - NearestNeighbors.jl is a Julia package implementing various nearest neighbor search algorithms and index structures for high-dimensional vector data. ([Read more](/details/nearestneighborsjl.md)) `ANN` `Julia` `vector search`
- NSG - NSG is an approximate nearest neighbor search algorithm based on a sparse navigable graph structure designed for high-dimensional vector similarity search. The reference implementation provides a graph-based ANN index that can be integrated into custom vector retrieval systems. ([Read more](/details/nsg.md)) `ANN` `graph index` `similarity search`
- ParlayANN - ParlayANN is a scalable and deterministic parallel graph-based approximate nearest neighbor (ANN) search library. It provides parallel algorithms and implementations for high-dimensional vector similarity search, suitable as a core search component in large-scale vector database and retrieval systems. ([Read more](/details/parlayann.md)) `ANN` `parallel` `scalable`
- PilotANN - PilotANN is a memory-bounded GPU-accelerated framework for large-scale vector search, designed to improve performance and efficiency of approximate nearest neighbor (ANN) search workloads, making it relevant as a high-performance engine/component in vector database and vector search systems. ([Read more](/details/pilotann.md)) `GPU acceleration` `ANN` `high-performance`
- Product-Quantization - Product-Quantization is a GitHub repository implementing the inverted multi-index structure for product-quantization-based approximate nearest neighbor search, providing building blocks for scalable vector search engines. ([Read more](/details/product-quantization.md)) `product quantization` `ANN` `vector indexing`
- Qinco - Qinco is an open-source implementation from Facebook Research for Residual Quantization with Implicit Neural Codebooks. It provides quantization and indexing methods for compact vector representations to accelerate similarity and nearest neighbor search, making it relevant as a low-level vector indexing and compression component for vector databases and large-scale AI retrieval systems. ([Read more](/details/qinco.md)) `vector compression` `similarity search` `open-source`
- RaBitQ - 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. ([Read more](/details/rabitq.md)) `ANN` `vector compression` `high-dimensional`
- Reconfigurable Inverted Index - Reconfigurable Inverted Index (Rii) is a research project and open-source library for approximate nearest neighbor and similarity search over high-dimensional vectors. It focuses on flexible, reconfigurable inverted index structures that support efficient vector search, making it directly relevant as a vector-search engine component for AI and multimedia retrieval applications. ([Read more](/details/reconfigurable-inverted-index.md)) `ANN` `vector indexing` `similarity search`
- RTNN - RTNN is a research prototype system and codebase that accelerates high-dimensional nearest neighbor search using hardware ray tracing units on modern GPUs. It targets vector similarity search workloads common in AI applications, exploring ray-tracing hardware as an alternative acceleration path to traditional CPU- or CUDA-based ANN indexes. ([Read more](/details/rtnn.md)) `GPU acceleration` `ANN` `similarity search`
- SimSIMD - Open‑source library providing fast SIMD‑accelerated implementations of similarity and distance computations (e.g., vector inner products and distances), serving as an efficient alternative to scipy.spatial.distance and numpy.inner for vector search and vector database workloads. ([Read more](/details/simsimd.md)) `similarity search` `optimization` `vector processing`
- SymphonyQG - SymphonyQG is a research codebase and method that integrates vector quantization with graph-based indexing to build efficient approximate nearest neighbor (ANN) indexes for high-dimensional vector search. It targets vector database and similarity search scenarios where combining compact codes with navigable graphs can improve recall–latency tradeoffs and memory footprint. ([Read more](/details/symphonyqg.md)) `ANN` `vector quantization` `graph index`
- Voyager - Voyager is a Spotify open-source vector search library and service for efficient nearest neighbor search on large-scale vector datasets. ([Read more](/details/voyager.md)) `ANN` `vector search` `open-source`
- Neighbor - Ruby gem for approximate nearest neighbor search that can integrate with pgvector and other backends to power vector similarity search in Ruby applications. ([Read more](/details/neighbor.md)) `ANN` `Ruby` `similarity search`
- pgvector-cobol - COBOL bindings and examples for pgvector, letting legacy COBOL systems interact with PostgreSQL as a vector database. ([Read more](/details/pgvector-cobol.md)) `SDK` `pgvector` `vector store`
- pgvector-crystal - Crystal language client for pgvector, providing idiomatic Crystal access to vector operations in PostgreSQL. ([Read more](/details/pgvector-crystal.md)) `SDK` `pgvector` `vector store`
- pgvector-dotnet - .NET (C#, F#, Visual Basic) library for pgvector that exposes vector storage and similarity queries on PostgreSQL to .NET applications. ([Read more](/details/pgvector-dotnet.md)) `SDK` `pgvector` `vector store`
- pgvector-elixir - Elixir wrapper and examples for pgvector, integrating PostgreSQL-based vector search into Elixir ecosystems like Phoenix. ([Read more](/details/pgvector-elixir.md)) `SDK` `pgvector` `vector store`
- pgvector-erlang - Erlang client and examples for pgvector, providing tools to run vector operations against PostgreSQL from Erlang systems. ([Read more](/details/pgvector-erlang.md)) `SDK` `pgvector` `vector store`
- pgvector-gleam - Gleam language client and examples for pgvector, allowing Gleam applications to perform vector similarity search using PostgreSQL. ([Read more](/details/pgvector-gleam.md)) `SDK` `pgvector` `vector store`
- pgvector-haskell - Haskell bindings and examples for pgvector, enabling Haskell applications to treat PostgreSQL as a vector database. ([Read more](/details/pgvector-haskell.md)) `SDK` `pgvector` `vector store`
- pgvector-lisp - Lisp bindings and examples for pgvector, allowing Common Lisp projects to leverage PostgreSQL as a vector store. ([Read more](/details/pgvector-lisp.md)) `SDK` `pgvector` `vector store`
- pgvector-node - JavaScript/TypeScript (Node.js) client for pgvector, enabling server-side JS apps to run vector queries on PostgreSQL. ([Read more](/details/pgvector-node.md)) `SDK` `pgvector` `vector store`
- pgvector-ocaml - OCaml client and examples for pgvector that provide access to vector indexing and nearest-neighbor search in PostgreSQL from OCaml code. ([Read more](/details/pgvector-ocaml.md)) `SDK` `pgvector` `vector store`
- pgvector-pascal - Pascal bindings and examples for pgvector, supporting PostgreSQL-powered vector search from Pascal applications. ([Read more](/details/pgvector-pascal.md)) `SDK` `pgvector` `vector store`
- pgvector-perl - Perl client and examples for pgvector, exposing vector data types and similarity queries in PostgreSQL to Perl scripts and apps. ([Read more](/details/pgvector-perl.md)) `SDK` `pgvector` `vector store`
- pgvector-prolog - Prolog client and examples for pgvector, enabling logic programs to interact with vector search capabilities in PostgreSQL. ([Read more](/details/pgvector-prolog.md)) `SDK` `pgvector` `vector store`
- pgvector-python - Python library and examples for pgvector, integrating Python AI/ML pipelines with PostgreSQL vector storage and similarity queries. ([Read more](/details/pgvector-python.md)) `SDK` `pgvector` `vector store`
- pgvector-ruby - Ruby client and examples for pgvector, integrating Ruby applications (including Rails) with PostgreSQL vector operations for AI use cases. ([Read more](/details/pgvector-ruby.md)) `SDK` `pgvector` `vector store`
- pgvector-rust - Rust client and examples for pgvector, offering idiomatic Rust APIs for embedding storage and similarity queries in PostgreSQL. ([Read more](/details/pgvector-rust.md)) `SDK` `pgvector` `vector store`
- pgvector-swift - Swift bindings and examples for pgvector, allowing Swift and server-side Swift apps to use PostgreSQL as a vector database. ([Read more](/details/pgvector-swift.md)) `SDK` `pgvector` `vector store`
- NVIDIA cuVS - GPU-accelerated vector search and clustering library from NVIDIA RAPIDS. Provides 8-12x faster index building and queries with multiple language support (C, C++, Python, Rust). This is an OSS library. ([Read more](/details/nvidia-cuvs.md)) `Open Source` `Gpu Acceleration` `Nvidia`
- hnswlib-rs - Pure-Rust implementation of HNSW algorithm for approximate nearest neighbor search. Decouples graph from vector storage for flexible deployment. Supports dense floating point and quantized int8 vectors. This is an OSS library. ([Read more](/details/hnswlib-rs.md)) `Open Source` `Rust` `Hnsw`
- PyNNDescent - Python implementation of Nearest Neighbor Descent for k-neighbor-graph construction and ANN search. Targets 80%-100% accuracy with fast performance and supports wide variety of distance metrics. This is an OSS library. ([Read more](/details/pynndescent.md)) `Open Source` `Python` `Ann`
- VectorDB - Lightweight Python package for storing and retrieving text using chunking, embeddings, and vector search. Powers AI features in Kagi Search with low latency and small memory footprint. This is an OSS library. ([Read more](/details/vectordb.md)) `Open Source` `Python` `Lightweight`
- ELPIS - Graph-based similarity search algorithm achieving 0.99 recall, building indexes 3-8x faster than competitors with 40% less memory. Answers 1-NN queries up to 10x faster than serial scan. ([Read more](/details/elpis.md)) `Ann` `Graph Based` `Research`
- GLASS - Leading graph-based ANN library optimized for approximate nearest neighbor search, offering competitive performance especially at lower recall levels across diverse datasets. ([Read more](/details/glass.md)) `Ann` `Graph Based` `Cpp`
- OdinANN - Billion-scale graph-based ANNS index with direct insertion capabilities. Achieves <1ms search latency with >10x less memory than in-memory indexes through GC-free design and update combining. ([Read more](/details/odinann.md)) `Ann` `Disk Based` `High Performance`
- PageANN - Disk-based approximate nearest neighbor search framework with page-aligned graph structure. Achieves 1.85x-10.83x higher throughput than state-of-the-art methods through optimized SSD utilization. ([Read more](/details/pageann.md)) `Ann` `Disk Based` `Open Source`
- PipeANN - Low-latency, billion-scale updatable graph-based vector store on SSD. Achieves <1ms search latency with 10x less memory than in-memory indexes through alignment of best-first search with SSD characteristics. ([Read more](/details/pipeann.md)) `Ann` `Disk Based` `Open Source`
- SPANN - Highly-efficient billion-scale approximate nearest neighbor search system from Microsoft Research. Uses a memory-disk hybrid architecture storing centroid points in memory and large posting lists on disk. ([Read more](/details/spann.md)) `Ann` `Hybrid Search` `Microsoft`
Sdks Libraries
- @ruvector/attention - Library implementing 46 attention mechanisms including dot-product, multi-head, Flash, linear, hyperbolic, graph, and sheaf attention. Supports SIMD optimization, streaming, caching, hard negative mining, and hyperbolic math functions for transformers and GNNs. ([Read more](/details/ruvectorattention.md)) `Attention Mechanisms` `Transformers` `Gnn` `Simd`
- ruvector-graph-transformer-node - Node.js NAPI-RS bindings for ruvector-graph-transformer with 22+ methods and 20 tests. ([Read more](/details/ruvector-graph-transformer-node.md)) `Open Source` `Nodejs` `Graph` `Napi`
- ruvector-wasm - WASM bindings for RuVector vector database, enabling browser and edge runtime vector search and storage. ([Read more](/details/ruvector-wasm.md)) `Wasm` `Browser` `Edge` `Open Source`
- RuVix - RuVix is an operating system kernel designed for AI agents and cognitive workloads, replacing file/process thinking with vectors, graphs, proofs, and capabilities. Features proof-gated mutations, unforgeable capability tokens, io_uring-style IPC, coherence-aware scheduling, and support for bare-metal AArch64, multi-core, Raspberry Pi, networking, and distributed QEMU swarms. ([Read more](/details/ruvix.md)) `Os Kernel` `Ai Agents` `Proofs` `Rust`
- ruvector-attention-unified-wasm - Unified WASM bindings for 18+ attention mechanisms including neural, DAG, and Mamba SSM, optimized for vector search and processing. ([Read more](/details/ruvector-attention-unified-wasm.md)) `Open Source` `Rust` `Wasm` `attention`
- ruvector-cli - Command-line interface for RuVector vector database, supporting initialization, insert, search, and hooks for AI coding assistants. ([Read more](/details/ruvector-cli.md)) `Rust` `cli` `Open Source`
- ruvector-economy-wasm - CRDT-based autonomous credit economy in WASM for decentralized vector resource allocation and AI agent economics. ([Read more](/details/ruvector-economy-wasm.md)) `Open Source` `Rust` `Wasm` `crdt`
- ruvector-exotic-wasm - WASM crate with exotic AI primitives like strange loops and time crystals for advanced vector computations in novel AI architectures. ([Read more](/details/ruvector-exotic-wasm.md)) `Open Source` `Rust` `Wasm` `experimental`
- ruvector-gnn - Rust crate for Graph Neural Network layers and training integrated with vector search. Powers GNN-enhanced HNSW reranking and semantic routing in RuVector. Supports browser and edge deployment via WASM. ([Read more](/details/ruvector-gnn.md)) `Open Source` `Rust` `gnn` `Wasm`
- ruvector-graph-transformer - Unified graph transformer with proof-gated mutation substrate for verified graph-vector operations, featuring 8 modules and 186 tests. ([Read more](/details/ruvector-graph-transformer.md)) `Open Source` `Rust` `Graph` `transformer`
- ruvector-graph-transformer-wasm - WASM bindings for browser-side graph transformers with proof verification. ([Read more](/details/ruvector-graph-transformer-wasm.md)) `Open Source` `Rust` `Wasm` `Graph`
- ruvector-learning-wasm - WASM library for MicroLoRA adaptation with sub-100µs latency, enabling fast fine-tuning for vector embeddings and AI models in browser environments. ([Read more](/details/ruvector-learning-wasm.md)) `Open Source` `Rust` `Wasm` `lora`
- ruvector-mincut - Rust implementation of subpolynomial fully-dynamic min-cut algorithm for AI coherence checks, network resilience, and agent coordination. Features 256-core parallel optimization and WASM bindings for browser use. ([Read more](/details/ruvector-mincut.md)) `Open Source` `Rust` `min-cut` `Wasm` `ai-safety`
- ruvector-nervous-system - Rust crate implementing spiking neural networks with BTSP learning and EWC plasticity for neuromorphic and bio-inspired vector processing in AI applications. Provides energy-efficient alternatives to traditional ANNs with 10-50x efficiency gains. Designed for integration into vector databases and real-time AI systems. ([Read more](/details/ruvector-nervous-system.md)) `Open Source` `Rust` `Neuromorphic`
- ruvector-nervous-system-wasm - WASM bindings for ruvector-nervous-system, enabling browser and edge deployment of spiking neural networks with BTSP and EWC for vector similarity tasks. Supports neuromorphic learning in web environments for AI vector applications. ([Read more](/details/ruvector-nervous-system-wasm.md)) `Open Source` `Rust` `Wasm` `Neuromorphic`
- ruvector-node - Native Node.js bindings for RuVector via napi-rs, providing high-performance vector database operations in Node.js environments. ([Read more](/details/ruvector-node.md)) `Rust` `Nodejs` `napi` `Open Source`
- ruvector-onnx-embeddings - Production-ready ONNX embedding generation in pure Rust using ONNX Runtime, no Python required. Supports 8+ pretrained models including all-MiniLM-L6-v2, BGE, E5, GTE with pooling strategies and GPU acceleration (CUDA, TensorRT, CoreML, WebGPU). Enables direct integration with RuVector indices for RAG pipelines and semantic similarity computation. ([Read more](/details/ruvector-onnx-embeddings.md)) `Rust` `onnx` `Embeddings` `Open Source`
- ruvector-robotics - Rust crate for cognitive robotics platform with perception, A* planning, behavior trees, and swarm coordination using vector search. Supports no_std and cross-domain transfer learning. ([Read more](/details/ruvector-robotics.md)) `Open Source` `Rust` `robotics` `planning`
- ruvector-server - HTTP/gRPC server for RuVector vector database, exposing REST API for vector operations. ([Read more](/details/ruvector-server.md)) `Rust` `Grpc` `http-server` `Open Source`
- ruvector-solver - Library providing sublinear-time solvers for large-scale math problems like PageRank, graph Laplacians, and AI attention using 8 algorithms including Neumann Series, Conjugate Gradient, Forward/Backward Push, and more. Optimized for scale with SIMD SpMV, fused kernels, and arena allocators; supports WASM and NAPI bindings. ([Read more](/details/ruvector-solver.md)) `solvers` `sublinear` `Simd` `Graph`
- ruvector-sparsifier - Incremental graph sparsifier that compresses large graphs into a 'shadow graph' preserving key properties like connectivity, cuts, and flow. Uses random walks for importance scoring, spectral sampling, union-find backbone, and periodic auditing to maintain accuracy without full rebuilds. ([Read more](/details/ruvector-sparsifier.md)) `Graph` `sparsifier` `spectral` `incremental`
- ruvector-tiny-dancer-core - Core library for AI agent routing using FastGRNN in the RuVector ecosystem. Enables efficient semantic routing for multi-agent AI systems with low resource footprint, suitable for vector database-integrated workflows. ([Read more](/details/ruvector-tiny-dancer-core.md)) `Rust` `Ai Agents` `routing` `Open Source`
- ruvector-verified - Rust crate for proof-carrying vector operations using lean-agentic dependent types, providing formal verification with ~500ns proofs for secure vector computations in AI systems. ([Read more](/details/ruvector-verified.md)) `Open Source` `Rust` `verification` `proofs`
- ruvector-verified-wasm - WASM bindings for ruvector-verified, enabling browser/edge formal verification of vector operations. ([Read more](/details/ruvector-verified-wasm.md)) `Open Source` `Rust` `Wasm` `verification`
- ruvllm-wasm - Browser-based LLM inference using WebGPU for RuVector ecosystem, enabling lightweight AI model execution in WASM environments. ([Read more](/details/ruvllm-wasm.md)) `Wasm` `llm-inference` `webgpu` `Open Source`
- rvDNA - AI-native genomic diagnostics library enabling instant genomic analysis on any device, including phones and browsers, in milliseconds without cloud, GPU, or subscription. Supports mutation detection with Bayesian calling, DNA-to-protein translation using GNNs, biological age prediction, drug dosing, health risk scoring, biomarker streaming with anomaly detection, genome similarity search via HNSW k-mer vectors, and .rvdna feature storage. ([Read more](/details/rvdna.md)) `genomics` `Vector Search` `Open Source` `browser`
- rvf-types - Core type definitions for RVF segments, headers, and structures in no_std Rust. Essential foundation for building verified vector data containers in the RuVector project. ([Read more](/details/rvf-types.md)) `Rust` `no-std` `types` `Open Source`
- thermorust - Thermodynamic neural motif engine using Ising/soft-spin Hamiltonians, Langevin dynamics, and Landauer dissipation for bio-inspired vector neural networks. ([Read more](/details/thermorust.md)) `Open Source` `Rust` `Neuromorphic` `thermodynamic`
SDKs & Libraries
- Amazon OpenSearch k-NN - Amazon OpenSearch's k-NN plugin enables scalable, efficient vector search using ANN algorithms (IVF, HNSW) directly within a managed OpenSearch cluster. It is directly relevant for building, querying, and scaling vector databases on AWS. ([Read more](/details/amazon-opensearch-k-nn.md)) `vector search` `ANN` `managed service` `OpenSearch`
- ANN Library - 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. ([Read more](/details/ann-library.md)) `Ann` `Cpp` `High Dimensional`
- Chroma Explorer - 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. ([Read more](/details/chroma-explorer.md)) `Macos` `Gui` `Chromadb`
- Dense Passage Retrieval (DPR) - Set of tools and models from Meta AI Research for open domain Q&A using dense representations, outperforming BM25 by 9%-19% in passage retrieval accuracy with a dual-encoder BERT framework. ([Read more](/details/dense-passage-retrieval-dpr.md)) `Retrieval` `Open Source` `Nlp`
- EntityDB - A powerful, lightweight in-browser vector database that wraps IndexedDB and Transformers.js over WebAssembly, enabling semantic search and AI memory entirely in the browser without server requirements. ([Read more](/details/entitydb.md)) `Browser` `Javascript` `Webassembly`
- FastEmbed - A lightweight, fast Python library for embedding generation using ONNX Runtime that achieves 12x inference speedup on CPUs, requires no GPU, and provides state-of-the-art accuracy with Flag Embedding as the default model, maintained by Qdrant. ([Read more](/details/fastembed.md)) `Embedding Inference` `Onnx` `Lightweight`
- FLANN - Fast Library for Approximate Nearest Neighbors containing a collection of algorithms optimized for nearest neighbor search in high dimensional spaces with automatic algorithm and parameter selection. ([Read more](/details/flann.md)) `Ann` `Open Source` `Cpp`

Programming Languages

Python 59 C++ 25 Rust 20 Go 10 Jupyter Notebook 6 TypeScript 6 Java 6 C 5 JavaScript 4 C# 2

ecosyste.ms

Data

Tools

Indexes

Applications

Experiments

Awesome

awesome-vector-databases

Research Papers & Surveys

Rust-based Vector Databases

Rust-Based Vector DBs

Scalable Distributed Vector DBs

Sdks & Libraries

Sdks Libraries

SDKs & Libraries