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.
Loading more......
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.
ClickHouse
ClickHouse is a columnar OLAP database with vector indexes (ANN via AMM, brute-force), supporting SQL queries over vectors + structured data at petabyte scale. Excels in aggregations with vectors. For analytics workloads with embeddings; faster ingestion than Postgres pgvector for big data.
HVS (Hierarchical Graph Structure)
HVS is an open-source, self-hosted graph-based ANN index using Voronoi diagrams for high-dimensional vector similarity search. Key features include hierarchical graphs, efficient large-scale queries, and free use. Suited for RAG embedding storage/search prototypes, cost-free self-hosting vs Pinecone.
NGT
NGT (Neighborhood Graph and Tree) is an open-source vector search engine designed for fast and scalable approximate nearest neighbor search.
KGraph
KGraph is an open-source library for fast approximate nearest neighbor search in high-dimensional vector spaces, applicable to vector database solutions.
MRPT
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.
