Smoothed heights of tries and patricia tries
 Citation data:

Theoretical Computer Science, ISSN: 03043975, Vol: 609, Issue: 3, Page: 620626
 Publication Year:
 2016
 Groups:
 Researchers:
 Weitian Tong
 Repository URL:
 https://works.bepress.com/weitiantong/2; https://digitalcommons.georgiasouthern.edu/compscifacpubs/64
 DOI:
 10.1016/j.tcs.2015.02.009
 Author(s):
 Publisher(s):
 Tags:
 Mathematics; Computer Science; Smoothed analysis; Data structure; Trie; Patricia trie; Computer Sciences; Academic Units, Engineering & Computing, Computer Science, Computer Science Faculty Publications
article description
Tries and patricia tries are two popular data structures for storing strings. Let Hn denote the height of the trie (the patricia trie, respectively) on a set of n strings. Under the uniform distribution model on the strings, it is well known that Hn/logn→2 for tries and Hn/logn→1 for patricia tries, when n approaches infinity. Nevertheless, in the worst case, the height of a trie can be unbounded and the height of a patricia trie is in Θ(n). To better understand the practical performance of both tries and patricia tries, we investigate these two classical data structures in a smoothed analysis model. Given a set S={s1,s2,…,sn} of n binary strings, we perturb the set by adding an i.i.d. Bernoulli random noise to each bit of every string. We show that the resulting smoothed heights of the trie and the patricia trie are both in Θ(logn).