A compact and fast structure for trie retrieval algorithms

Tries in data retrieval and syntactic pattern recognition

“…Aoe et al [64,101,140] described an algorithm for the compaction of a trie that is applicable to a dynamic set of keys. They named the new trie structure the "two-trie" .…”

“…This structure and the resulting algorithms were based on maximizing the benefits of strings that share common prefixes and suffixes. In Chapter 2 (Section 2.2.3), we gave an overview about the two-trie [64,101,140] data structure. More details will be summarized presently.…”

“…The proposed DT data structure has been rigorously tested so as to evaluate its relative perfor mance when compared to the trie and the two-trie [64,101,140] data structures.…”

“…The difference between the DT and the Two-Trie (Section 2.2.3) described in [64,101,140] will be outlined in this Chapter. However, both structures share a common goal, namely that of decreasing the storage space of the trie by trying to decrease the number of nodes needed to build the trie, while attempting to maintain the same search time for the standard trie.…”

“…The organization of this Chapter is as follows: Section 4.2 reviews the two-trie data structure proposed by Aoe et al [64,101,140] and shows the difference between the two-trie and the compact trie. Section 4.3 describes, in detail, the proposed Dual-Trie (DT) data structure.…”