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.
Loading more......
PilotANN
Memory-bounded GPU-accelerated framework for graph-based ANN vector search using CUDA and LibTorch, optimized for large-scale workloads beyond GPU memory. Features batch processing for high efficiency; outperforms CPU-only ANN in speed for similarity search in vector databases.
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.
BigANN Benchmarks
Main competition for large-scale vector database algorithms held at NeurIPS conferences. Framework for evaluating approximate nearest neighbor search algorithms on billion-scale datasets with standardized metrics and datasets.
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.
FLANN (Fast Library for Approximate Nearest Neighbors)
A C++ library for performing fast approximate nearest neighbor searches in high dimensional spaces. Contains multiple ANN algorithms and automatic algorithm selection based on dataset characteristics.
NGT
NGT (Neighborhood Graph and Tree) is an open-source vector search engine designed for fast and scalable approximate nearest neighbor search.
