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[clarification needed] 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
[edit]References
[edit]- ↑ Liang, Frank Mark (June 1983). Word hy-phen-a-tion by com-pu-ter (PDF) (PhD dissertation). Stanford University. p. 32. Retrieved March 28, 2010.
- ↑ Thomas, Roshan; Mark, Brian; Johnson, Tommy; Croall, James (2003). "High-speed Legitimacy-based DDoS Packet Filtering with Network Processors: A Case Study and Implementation on the Intel IXP1200" (PDF). In Crowley, Patrick; Franklin, Mark A.; Hadimioglu, Haldun; Onufryk, Peter Z. (eds.). Network Processor Design: Issues and Practices. Series in Computer Architecture and Design. Vol. 2. San Francisco: Morgan Kaufmann Publishers. Chapter 12, pp. 243–272. ISBN 9780121981570. Retrieved May 3, 2009.
This set index article includes a list of related items that share the same name (or similar names).
If an internal link incorrectly led you here, you may wish to change the link to point directly to the intended article.
If an internal link incorrectly led you here, you may wish to change the link to point directly to the intended article.