• Home
  • Categories
  • Pricing
  • Submit
    Built with
    Ever Works
    Ever Works

    Connect with us

    Stay Updated

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

    Product

    • Categories
    • 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
    Decorative pattern
    Decorative pattern
    1. Home
    2. Research Papers & Surveys
    3. REAPER

    REAPER

    REAPER (Reasoning based Retrieval Planning for Complex RAG Systems) is a research framework that addresses multi-step retrieval planning in complex Retrieval-Augmented Generation scenarios. It enables retrieval systems to plan and execute reasoning-aware retrieval strategies rather than relying on simple similarity-based matching.

    REAPER

    REAPER (Reasoning based Retrieval Planning for Complex RAG Systems) is a research framework that addresses multi-step retrieval planning in complex Retrieval-Augmented Generation scenarios. It enables retrieval systems to plan and execute reasoning-aware retrieval strategies rather than relying on simple similarity-based matching.

    https://arxiv.org/abs/2407.18553

    Surveys

    Loading more......

    Information

    Websitearxiv.org
    PublishedApr 4, 2026

    Categories

    1 Item
    Research Papers & Surveys

    Tags

    3 Items
    #retrieval-planning#complex-rag#research

    Similar Products

    6 result(s)

    Exploring Distributed Vector Databases Performance on HPC Platforms

    SC'25 Workshop paper characterizing Qdrant vector database performance on high-performance computing platforms, bridging AI and HPC workloads.

    The Novel Vector Database

    Research paper proposing a decoupled storage architecture for vector databases that improves update speed by 10.05x for insertions and 6.89x for deletions through innovative design.

    Monte Carlo Tree Search for Vector Indexing

    Research on using Monte Carlo Tree Search algorithms for optimizing vector index construction and search strategies. Explores adaptive decision-making during graph building and query routing.

    Leech Lattice Vector Quantization

    Advanced vector quantization technique that explores the Leech lattice's optimal sphere packing properties at 24 dimensions. Delivers state-of-the-art LLM quantization performance, outperforming recent methods like Quip#, QTIP, and PVQ for extreme vector compression.

    SPLATE

    Sparse Late Interaction Retrieval model that combines the benefits of sparse representations with late interaction mechanisms. Provides efficient storage and fast retrieval while maintaining the accuracy advantages of token-level matching in sparse embedding space.

    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.