Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Path-Decomposed Trie"”.

  1. Optimal Path-Decomposition of Tries

    In this thesis, we consider the path-decomposition representation of prefix trees. We show that given query probabilities for every word in the prefix tree, the heavy-path strategy produces the optimal trie with respect to the number of node accesses. We show how to implement the heavy-path …

    waterloo Repository record for Optimal Path-Decomposition of Tries (opens in a new tab)