Hash trie

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In computer science, hash trie can refer to:

  • Hash tree (persistent data structure), a trie used to map hash values to keys
  • 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]
  • A data structure which "combines features of hash tables and LC-tries (Least Compression tries) in order to perform efficient lookups and updates" [2]

See also[edit]


  1. ^ Liang, Frank (June 1983), Word hy-phen-a-tion by com-pu-ter (PDF), Frank M. Liang, Ph.D. thesis, Stanford University., retrieved 2010-03-28  |first2= missing |last2= in Authors list (help)
  2. ^ 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