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.
About this tool
ParlayANN
Category: SDKs & Libraries
Website: https://github.com/cmuparlay/ParlayANN
License: See LICENSE file in repository
Description
ParlayANN is a C++ library of scalable, deterministic, parallel graph-based approximate nearest neighbor (ANN) search algorithms for high-dimensional vector similarity search. It is designed for use as a core search component in large-scale vector databases and retrieval systems, and builds on parallel primitives from ParlayLib.
Features
- Multiple ANN algorithms implemented
- DiskANN
- HNSW
- HCNNG
- pyNNDescent
- Graph-based indices suitable for high-dimensional ANN search
- Parallel execution using ParlayLib primitives for scalability
- Range search support via algorithms from the paper Range Retrieval with Graph-Based Indices
- Tools for algorithm design: utilities and data tools to help design and experiment with ANN algorithms
- C++ implementation for performance and low-level control
- Python directory present in the repo, indicating Python-related bindings or tooling
- Build system support
- CMake configuration (
CMakeLists.txt) - Bazel configuration (
WORKSPACE,.bazelrc)
- CMake configuration (
Technology Stack
- Language: C++ (with associated Python directory)
- Parallel library: ParlayLib
- Focus: Graph-based approximate nearest neighbor and range search in high dimensions
Use Cases
- Core similarity search component in vector databases
- Large-scale vector retrieval and recommendation systems
- Research and experimentation on graph-based ANN algorithms
Pricing
ParlayANN is an open-source library. No pricing plans are specified; usage terms are governed by the license provided in the repository (LICENSE).
Loading more......
Information
Categories
Similar Products
6 result(s)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.
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.
SPTAG is a distributed approximate nearest neighbor (ANN) library for building and searching large-scale vector indexes, supporting efficient and scalable vector search scenarios.
NGT (Neighborhood Graph and Tree) is an open-source vector search engine designed for fast and scalable approximate nearest neighbor search.
Ruby gem for approximate nearest neighbor search that can integrate with pgvector and other backends to power vector similarity search in Ruby applications.
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.