Major Description
Trie structure is devised to index tagged entities and policies for a fast look-up. However, it may be take a lot of memory. This is a result of a design decision to optimize processing (mainly searching) time at the cost of extra memory.
It is desirable to find a more optimal trade-off between memory needs and processing requirements, especially for supporting a large number or policies and tagged entities.