Hash trie
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]
- 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
References
- ↑ 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) - ↑ 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
This article is issued from Wikipedia - version of the Wednesday, June 24, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.