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

    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.

    🌐Visit Website

    About this tool

    Overview

    ANN (Approximate Nearest Neighbors) is a library written in C++, which supports data structures and algorithms for both exact and approximate nearest neighbor searching in arbitrarily high dimensions.

    Features

    • Supports both exact and approximate nearest neighbor searching
    • Optimized for arbitrarily high dimensions
    • Provides kd-tree and bd-tree data structures
    • Priority search for approximate searching
    • Fixed-radius and k-nearest neighbor queries
    • Written in C++ for high performance
    • Portable across multiple platforms

    Applications

    Used in machine learning tasks including image recognition, natural language processing, and recommendation systems.

    Pricing

    Free and open-source.

    Surveys

    Loading more......

    Information

    Websitewww.cs.umd.edu
    PublishedMar 15, 2026

    Categories

    1 Item
    Sdks & Libraries

    Tags

    3 Items
    #Ann#Cpp#High Dimensional

    Similar Products

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

    FLANN

    Fast Library for Approximate Nearest Neighbors containing a collection of algorithms optimized for nearest neighbor search in high dimensional spaces with automatic algorithm and parameter selection.

    GLASS

    Leading graph-based ANN library optimized for approximate nearest neighbor search, offering competitive performance especially at lower recall levels across diverse datasets.

    RaBitQ

    RaBitQ is an open-source library implementing the "Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search" method, providing vector quantization and compression techniques designed to improve efficiency and accuracy of ANN search engines and vector databases operating in high-dimensional spaces.

    vsag

    vsag is an Alibaba open-source library implementing efficient vector search algorithms, including approximate nearest neighbor search for high-dimensional vectors.

    Annoy

    An open-source library for approximate nearest neighbor search in high-dimensional spaces, often used as a backend for vector databases and search engines.

    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