[go: nahoru, domu]
Jump to content

Hash trie

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by SmackBot (talk | contribs) at 13:37, 3 May 2009 (Date maintenance tags and general fixes). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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] [verification needed]
  • 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

  1. ^ Frank M. Liang (1983), Word hy-phen-a-tion by com-pu-ter, Ph.D. thesis, Stanford University.
  1. ^ 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
Retrieved from "https://en.wikipedia.org/w/index.php?title=Hash_trie&oldid=287638311"