Radix Tree
A compressed variant of the trie that reduces node count by merging paths with only a single child node, lowering memory usage while preserving prefix query capabilities.
Timeline (last 90 days)
A Radix Tree (Patricia Trie) reduces node count by merging paths that have only a single child node.
RadixAttention manages shared prefixes through a Radix Tree structure to reduce redundant computation.
A radix tree, also known as a compressed prefix tree (Patricia Trie), compresses paths with only a single child node into a single node to reduce storage overhead.
All Facts (4)
A Radix Tree (Patricia Trie) reduces node count by merging paths that have only a single child node.
50%UnverifiedRadixAttention manages shared prefixes through a Radix Tree structure to reduce redundant computation.
50%UnverifiedA radix tree, also known as a compressed prefix tree (Patricia Trie), compresses paths with only a single child node into a single node to reduce storage overhead.
50%UnverifiedRadixAttention 引入全局共享 KV Cache 池，通过引用计数和 LRU 淘汰策略管理缓存生命周期，并在 Radix Tree 中执行最长前缀匹配
50%