• Home
  • Categories
  • Tags
  • Pricing
  • Submit
    Decorative pattern
    1. Home
    2. Sdks & Libraries
    3. EFANNA

    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.

    🌐Visit Website

    About this tool

    EFANNA

    Category: SDKs & Libraries
    Tags: ann, high-performance, vector-indexing
    Source: https://github.com/ZJULearning/efanna

    Overview

    EFANNA is a C++ library for extremely fast approximate nearest neighbor (ANN) search on large-scale data. It implements the EFANNA algorithm described in the paper “EFANNA: Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph” and provides both ANN search and approximate kNN graph construction.

    Features

    • Approximate nearest neighbor search

      • High-performance ANN search on large-scale vector datasets.
      • Designed as a building block for custom vector search and retrieval infrastructure.
    • kNN graph construction

      • Efficient construction of approximate k-nearest neighbor graphs.
      • Can be used as a base structure for various graph-based search algorithms.
    • Flexible initialization structures

      • Supports multiple hierarchical structures for search initialization, including:
        • Randomized KD-trees.
        • Random projection trees.
        • Hierarchical clustering trees.
        • Multi-table hashing (via the provided hashing samples).
    • Algorithm framework

      • Implements the EFANNA framework as described in the associated research paper.
      • Separated modules under algorithm, general, and samples directories for experimentation and extension.
    • Language and ecosystem

      • C++ implementation (efanna.hpp, Makefiles provided).
      • Example code and usage patterns under samples/.
      • Additional MATLAB-related utilities in the matlab/ directory.
    • Documentation and examples

      • docs/ folder for algorithm and usage documentation (as provided in the repository).
      • Sample programs demonstrating index construction and query workflows.
    • Performance focus

      • Designed specifically for speed on ANN search and kNN graph construction tasks.
      • Benchmark references and figures for ANN search performance on standard datasets (e.g., SIFT) included in the repository.

    Pricing

    EFANNA is an open-source library hosted on GitHub. No pricing or paid plans are specified in the provided content.

    License

    • A LICENSE file is present in the repository.
    • Consult the repository’s LICENSE file for the exact license terms and conditions.
    Surveys

    Loading more......

    Information

    Websitegithub.com
    PublishedDec 25, 2025

    Categories

    1 Item
    Sdks & Libraries

    Tags

    3 Items
    #Ann#High Performance#vector indexing

    Similar Products

    6 result(s)
    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.

    jvector

    jvector is a high-performance Java-based library and engine for vector search and approximate nearest neighbor indexing.

    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.

    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.

    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.

    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.

    Decorative pattern
    Built with
    Ever Works
    Ever Works

    Connect with us

    Stay Updated

    Get the latest updates and exclusive content delivered to your inbox.

    Product

    • Categories
    • Tags
    • Pricing
    • Help

    Clients

    • Sign In
    • Register
    • Forgot password?

    Company

    • About Us
    • Admin
    • Sitemap

    Resources

    • Blog
    • Submit
    • API Documentation
    All product names, logos, and brands are the property of their respective owners. All company, product, and service names used in this repository, related repositories, and associated websites are for identification purposes only. The use of these names, logos, and brands does not imply endorsement, affiliation, or sponsorship. This directory may include content generated by artificial intelligence.
    Copyright © 2025 Awesome Vector Databases. All rights reserved.·Terms of Service·Privacy Policy·Cookies