• Home
  • Categories
  • Tags
  • Pricing
  • Submit
    Decorative pattern
    1. Home
    2. Research Papers & Surveys
    3. Cagra

    Cagra

    Cagra provides highly parallel graph construction and approximate nearest neighbor search for GPUs, supporting large-scale vector database operations and efficient similarity search.

    🌐Visit Website

    About this tool

    #Cagra

    Cagra provides highly parallel graph construction and approximate nearest neighbor search for GPUs, supporting large-scale vector database operations and efficient similarity search.

    https://arxiv.org/pdf/2308.15136

    Surveys

    Loading more......

    Information

    Websitearxiv.org
    PublishedJun 7, 2025

    Categories

    1 Item
    Research Papers & Surveys

    Tags

    5 Items
    #graph construction#Ann#Gpu Acceleration#Similarity Search#Research

    Similar Products

    6 result(s)
    GTS

    GTS is a GPU-based tree index for fast similarity search over high-dimensional vector data, providing an efficient ANN index structure that can be integrated into or used to build high-performance vector database systems.

    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.

    BatANN

    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.

    MCGI

    Manifold-Consistent Graph Indexing for billion-scale disk-resident vector search. Leverages Local Intrinsic Dimensionality to achieve 5.8x throughput improvement over DiskANN on high-dimensional datasets.

    AiSAQ

    AiSAQ is an all-in-storage approximate nearest neighbor search system that uses product quantization to enable DRAM-free vector similarity search, serving as a specialized vector search/indexing approach for large-scale information retrieval.

    Efficient Locality Sensitive Hashing

    This work by Jingfan Meng is a comprehensive research thesis on efficient locality-sensitive hashing (LSH), covering algorithmic solutions, core primitives, and applications for approximate nearest neighbor search. It is relevant to vector databases because LSH-based indexing is a foundational technique for scalable similarity search over high-dimensional vectors, informing the design of vector indexes, retrieval engines, and similarity search modules in modern vector database systems.

    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