A Compact Patricia Trie for a Large Set of Keys

Y.-K. Chan, C.-C. Chang, and J.-J. Shen (Taiwan)


binary digital search, binary trie, Patricia trie, information retrieval.


Since the Patricia trie gives the shallowest trie by removing all single descendant nodes, it is often employed as the indices of information retrieval systems. This paper introduces three new Patricia trie representations. Each of these methods is the revision of its previous one. The theoretical evaluations and experimental results are also presented in this paper.

Important Links:

Go Back