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

    DiskANN

    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.

    🌐Visit Website

    About this tool

    DiskANN

    • Description: DiskANN is a graph-based approximate nearest neighbor search (ANNS) system designed for fast and accurate billion-point nearest neighbor search on a single node, utilizing SSD storage. It is suitable for large-scale vector database applications that require efficient and scalable vector search.
    • Source: arXiv:2105.09613
    • Category: SDKs & Libraries
    • Tags: ann, high-performance, scalable, vector-search

    Features

    • Graph-based ANNS algorithm
    • Optimized for billion-point nearest neighbor search
    • Efficient operation on a single node
    • Leverages SSD storage for scalability and performance
    • Suitable for large-scale vector database and similarity search applications

    Pricing

    • No pricing information provided.
    Surveys

    Loading more......

    Information

    Websitearxiv.org
    PublishedMay 13, 2025

    Categories

    1 Item
    Sdks & Libraries

    Tags

    4 Items
    #Ann#High Performance#Scalable#Vector Search

    Similar Products

    6 result(s)
    jvector

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

    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.

    BANG

    BANG is a billion-scale approximate nearest neighbor search system optimized for single GPU execution, enabling high-performance vector search in vector database environments at massive scale.

    NGT

    NGT (Neighborhood Graph and Tree) is an open-source vector search engine designed for fast and scalable approximate nearest neighbor search.

    KDB

    KDB is a high-performance vector database supporting billion-scale vector search, with features aimed at enterprises needing large-scale vector storage and retrieval.

    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.

    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