Hash trie
Appearance
In computer science, hash trie can refer to:
- A space-efficient implementation of a sparse trie, in which the descendants of each node may be interleaved in memory. (The name is suggested by a similarity to a closed hash table.) [1] [verification needed]
- An ordinary trie used to store hash values, for example, in an implementation of a hash tree.
- A data structure which "combines features of hash tables and LC-tries in order to perform efficient lookups and updates" [2]
References
- ^ Liang, Frank (1983), Word hy-phen-a-tion by com-pu-ter (PDF), Frank M. Liang, Ph.D. thesis, Stanford University., retrieved 2010-03-28
{{citation}}
:|first2=
missing|last2=
(help); Unknown parameter|month=
ignored (help) - ^ Thomas, Roshan; Mark, Brian; Johnson, Tommy; Croall, James (2004), High-speed Legitimacy-based DDoS Packet Filtering with Network Processors: A Case Study and Implementation on the Intel IXP1200 (PDF), retrieved 2009-05-03