Hash trie
Appearance
In computer science, hash trie refers to two kinds of data structure:
- 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]
- An ordinary trie used to store hash values, for example, in an implementation of a hash tree.
- A data strcuture which "combines features of hash tables and LC-tries in order to perform efficient lookups and updates" [2]
References
- ^ Frank M. Liang (1983), Word hy-phen-a-tion by com-pu-ter, Ph.D. thesis, Stanford University.
- ^ 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, http://napl.gmu.edu/pubs/BookContrib/ThomasMarkJC-NPW04.pdf, retrieved 2009-05-03