pith. sign in

arxiv: 2504.10326 · v1 · pith:V3OMDMLOnew · submitted 2025-04-14 · 💻 cs.AI · cs.DB· cs.IR

AlayaDB: The Data Foundation for Efficient and Effective Long-context LLM Inference

classification 💻 cs.AI cs.DBcs.IR
keywords alayadbinferenceattentioncachecomputationdatabaseeffectiveefficient
0
0 comments X
read the original abstract

AlayaDB is a cutting-edge vector database system natively architected for efficient and effective long-context inference for Large Language Models (LLMs) at AlayaDB AI. Specifically, it decouples the KV cache and attention computation from the LLM inference systems, and encapsulates them into a novel vector database system. For the Model as a Service providers (MaaS), AlayaDB consumes fewer hardware resources and offers higher generation quality for various workloads with different kinds of Service Level Objectives (SLOs), when comparing with the existing alternative solutions (e.g., KV cache disaggregation, retrieval-based sparse attention). The crux of AlayaDB is that it abstracts the attention computation and cache management for LLM inference into a query processing procedure, and optimizes the performance via a native query optimizer. In this work, we demonstrate the effectiveness of AlayaDB via (i) three use cases from our industry partners, and (ii) extensive experimental results on LLM inference benchmarks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Generalized Range Filtering Approximate Nearest Neighbor Search: Containment and Overlap [Technical Report]

    cs.DB 2026-05 unverdicted novelty 6.0

    Multi-segment tree graph supports generalized RRANN queries for arbitrary predicates like containment and overlap, with up to 12.5x speedups over baselines on real data while keeping index size comparable.