<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T09:20:03Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/10491" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/10491</identifier><datestamp>2025-03-26T23:34:26Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Munro, J. Ian</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">López-Ortiz, Alejandro</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="e24446d0-8252-4ca3-a53a-38a680bd3c2d" confidence="600">Daigle, Alexandre</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2016-05-16T19:24:02Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2016-05-16T19:24:02Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2016-05-16</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2016-05-11</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/10491</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">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 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.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Auto-completion</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Path-Decomposed Trie</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Optimal</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Data Structure</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Prefix Tree</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Heavy-Path</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Optimal Path-Decomposition of Tries</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">David R. Cheriton School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="comment" qualifier="hidden" lang="en">Please advise for comments before the end of the week.&#xd;
Friday May 20th is the 100% fee refund date for the Spring term.&#xd;
&#xd;
Thank you very much.</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Munro, J. Ian</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">López-Ortiz, Alejandro</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>