Trie
A tree-shaped data structure that organizes cached KVs by token sequence, supporting the hitting and reuse of common prefixes of arbitrary length, used to improve cache hit rates in multi-user and multi-template scenarios.
Timeline (last 90 days)
A prefix tree (Trie) organizes cached KV into a tree by token sequence, so multiple requests can hit and reuse KV as long as they share a common prefix of any length, without requiring the entire prefix to be identical.
The time complexity of a Trie prefix tree query is O(m), where m is the length of the query string, independent of the total amount of data.
All Facts (2)
The time complexity of a Trie prefix tree query is O(m), where m is the length of the query string, independent of the total amount of data.
60%UnverifiedA prefix tree (Trie) organizes cached KV into a tree by token sequence, so multiple requests can hit and reuse KV as long as they share a common prefix of any length, without requiring the entire prefix to be identical.
50%