Show simple item record

dc.contributor.authorDaigle, Alexandre
dc.date.accessioned2016-05-16 19:24:02 (GMT)
dc.date.available2016-05-16 19:24:02 (GMT)
dc.date.issued2016-05-16
dc.date.submitted2016-05-11
dc.identifier.urihttp://hdl.handle.net/10012/10491
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.language.isoenen
dc.publisherUniversity of Waterlooen
dc.subjectAuto-completionen
dc.subjectPath-Decomposed Trieen
dc.subjectOptimalen
dc.subjectData Structureen
dc.subjectPrefix Treeen
dc.subjectHeavy-Pathen
dc.titleOptimal Path-Decomposition of Triesen
dc.typeMaster Thesisen
dc.pendingfalse
uws-etd.degree.departmentDavid R. Cheriton School of Computer Scienceen
uws-etd.degree.disciplineComputer Scienceen
uws-etd.degree.grantorUniversity of Waterlooen
uws-etd.degreeMaster of Mathematicsen
uws.contributor.advisorMunro, J. Ian
uws.contributor.advisorLópez-Ortiz, Alejandro
uws.contributor.affiliation1Faculty of Mathematicsen
uws.published.cityWaterlooen
uws.published.countryCanadaen
uws.published.provinceOntarioen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

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