[VLDB 26, NeurIPS 25] Scalable long-context LLM decoding that leverages sparsity—by treating the KV cache as a vector storage system.
☆154Sep 14, 2026Updated last month
Alternatives and similar repositories for RetrievalAttention
Users that are interested in RetrievalAttention are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- [SIGMOD 2025] PQCache: Product Quantization-based KVCache for Long Context LLM Inference☆94Dec 7, 2025Updated 10 months ago
- ☆13Jul 31, 2025Updated last year
- [ICML 2025 Spotlight] ShadowKV: KV Cache in Shadows for High-Throughput Long-Context LLM Inference☆316May 1, 2025Updated last year
- Segmented Code Adjustment Quantization (SAQ)☆28Sep 22, 2025Updated last year
- ClusterKV: Manipulating LLM KV Cache in Semantic Space for Recallable Compression (DAC'25)☆32Feb 26, 2026Updated 8 months ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- [SIGMOD'26] Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search☆20Nov 9, 2025Updated 11 months ago
- Query-Adaptive Vector Search☆76Mar 19, 2026Updated 7 months ago
- ArkVale: Efficient Generative LLM Inference with Recallable Key-Value Eviction (NIPS'24)☆54Dec 17, 2024Updated last year
- This is the implementation repository of our SOSP'24 paper: Aceso: Achieving Efficient Fault Tolerance in Memory-Disaggregated Key-Value …☆24Oct 20, 2024Updated 2 years ago
- ☆13Nov 16, 2024Updated last year
- PipeRAG: Fast Retrieval-Augmented Generation via Algorithm-System Co-design (KDD 2025)☆32Jun 14, 2024Updated 2 years ago
- 🔥 [ICML'26] ParisKV: Fast and Drift-Robust KV-Cache Retrieval for Long-Context LLMs☆37Aug 14, 2026Updated 2 months ago
- Algorithms for approximate nearest neighbor search with window filters☆47Feb 5, 2024Updated 2 years ago
- VLDB 2024 paper repo. RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search☆65Sep 16, 2024Updated 2 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- A cross-modal vector index with fast construction on heterogeneous CPU-GPU environment. Published on DaMoN@SIGMOD 2025.☆16Jul 16, 2025Updated last year
- InfiniGen: Efficient Generative Inference of Large Language Models with Dynamic KV Cache Management (OSDI'24)☆195Jul 10, 2024Updated 2 years ago
- ☆37Sep 13, 2025Updated last year
- Public repository for CleANN, an efficient fully-dynamic approximate nearest neighbor search index☆19Sep 18, 2025Updated last year
- Official implementation for paper "Navigating Labels and Vectors: A Unified Approach to Filtered Approximate Nearest Neighbor Search"☆38Dec 21, 2024Updated last year
- [ICLR2025 Spotlight] MagicPIG: LSH Sampling for Efficient LLM Generation☆257Dec 16, 2024Updated last year
- Dynamic Context Selection for Efficient Long-Context LLMs☆65May 20, 2025Updated last year
- ☆137Nov 11, 2024Updated last year
- ☆14Nov 18, 2025Updated 11 months ago
- End-to-end encrypted cloud storage - Proton Drive • AdSpecial offer: 40% Off Yearly / 80% Off First Month. Protect your most important files, photos, and documents from prying eyes.
- This is the implementation repository of our OSDI '26 paper: Disentangling Graph Dependencies for Efficient Billion-Scale GPU Vector Sear…☆16Jul 11, 2026Updated 3 months ago
- ☆26Jun 1, 2025Updated last year
- MSVBASE is a system that efficiently supports complex queries of both approximate similarity search and relational operators. It integrat…☆102Nov 19, 2024Updated last year
- [ICML 2024] Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inference☆414Jul 10, 2025Updated last year
- Repo for ECHO: Efficient KV Cache Offloading with Lossless Prefetching for Serving Native Sparse Attention LLMs (OSDI'26)☆39Jul 12, 2026Updated 3 months ago
- [ACL 2025] Squeezed Attention: Accelerating Long Prompt LLM Inference☆58Nov 20, 2024Updated last year
- A low-latency, billion-scale, and updatable graph-based vector store on SSD.☆158Oct 17, 2026Updated last week
- [OSDI'24] Serving LLM-based Applications Efficiently with Semantic Variable☆228Oct 14, 2026Updated 2 weeks ago
- Source code for the paper: "Accelerating Graph Indexing for ANNS on Modern CPUs"☆33Nov 9, 2025Updated 11 months ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- 16-fold memory access reduction with nearly no loss☆107Mar 26, 2025Updated last year
- NEO is a LLM inference engine built to save the GPU memory crisis by CPU offloading☆99Jun 16, 2025Updated last year
- ☆32Mar 24, 2025Updated last year
- ☆10Sep 9, 2025Updated last year
- 📚 Awesome papers and technical blogs on vector DB (database), semantic-based vector search or approximate nearest neighbor search (ANN S…☆117Dec 2, 2025Updated 10 months ago
- ☆39Jul 18, 2025Updated last year
- ☆19Aug 9, 2026Updated 2 months ago