PECANN

Clustering-based approximate nearest neighbor algorithm that partitions vector space into Voronoi cells. Fast search through coarse-to-fine strategy, often combined with Product Quantization (IVF-PQ).

Hierarchical Clustering-based Nearest Neighbor Graph using MST to connect dataset points through multiple hierarchical clusters. Performs efficient guided search instead of traditional greedy routing.

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.

Fast and accurate graph-based ANN index for streaming similarity search, enabling real-time updates on billion-point indexes using a single machine with real-time freshness.

Low-Rank Matrix Factorization algorithm for Approximate Nearest Neighbor Search, offering competitive performance with faster query times than leading libraries at various recall levels.

Distributed disk-based approximate nearest neighbor system achieving near-linear throughput scaling. Delivers 6.21-6.49x throughput improvement over scatter-gather baseline with sub-6ms latency on 10 servers.