Hash trie
From HandWiki
Revision as of 01:04, 14 June 2021 by imported>S.Timg (url)
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
References
- ↑ Liang, Frank Mark (June 1983) (Ph.D. thesis), Word hy-phen-a-tion by com-pu-ter, Stanford University, http://www.tug.org/docs/liang/liang-thesis.pdf, retrieved 2010-03-28
- ↑ 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
 |  |
