Unverified70% confidenceFactExact time
RadixAttention introduces a globally shared KV Cache pool, manages cache lifecycle through reference counting and LRU eviction strategies, and performs longest-prefix matching in a Radix Tree.
2
Sources
70%
Confidence
Long-term
Relevance
7/16/2026
First Seen
Sources
Related Claims
UnverifiedRadixAttention 通过将 KV Cache 组织为前缀树结构，使具有相同前缀的多个请求共享同一份缓存75% similarUnverifiedRadixAttention manages shared prefixes through a Radix Tree structure to reduce redundant computation.72% similarUnverifiedvLLM's prefix caching implementation is based on a radix tree data structure for fine-grained cache hit matching.65% similarUnverifiedHybrid Search, Re-ranking, and multi-path retrieval are advanced techniques in RAG.61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/533861API
curl https://kongchang.com/api/v1/knowledge/claims/533861MCP
get_claim(id=533861)