Caching Hyperedges: KV-Cache Reuse for Hypergraph RAG
Hypergraph-based retrieval captures the n-ary relational facts that binary-graph methods fragment, but answering a query is slow: the model must read the text of many retrieved units before it can answer. We present Cachy, which removes this reading cost by precomputing a key-value (KV) cache for each retrieval unit an...