Show simple item record

dc.contributor.authorDaigle, Alexandre 19:24:02 (GMT) 19:24:02 (GMT)
dc.description.abstractIn 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 strategy in O(N) time for a trie containing n words with total length N. To prove this result, we show a complete characterization of the choices made by the optimal decomposition strategy. Using this characterization, we describe how to efficiently support dynamic operations on the path-decomposed trie while preserving the optimality in O(sigma * |w|) time for an alphabet size of sigma and a word length of |w|. We also give entropy-based bounds of the node accesses per query for their respective probabilities. Finally, we show theoretical and experimental results on the performance of heavy-path versus max-score, another popular path-decomposition strategy.en
dc.publisherUniversity of Waterlooen
dc.subjectPath-Decomposed Trieen
dc.subjectData Structureen
dc.subjectPrefix Treeen
dc.titleOptimal Path-Decomposition of Triesen
dc.typeMaster Thesisen
dc.pendingfalse R. Cheriton School of Computer Scienceen Scienceen of Waterlooen
uws-etd.degreeMaster of Mathematicsen
uws.comment.hiddenPlease advise for comments before the end of the week. Friday May 20th is the 100% fee refund date for the Spring term. Thank you very much.en
uws.contributor.advisorMunro, J. Ian
uws.contributor.advisorLópez-Ortiz, Alejandro
uws.contributor.affiliation1Faculty of Mathematicsen

Files in this item


This item appears in the following Collection(s)

Show simple item record


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages