Hash trie

From Wikipedia, the free encyclopedia

There are very few or no other articles that link to this one.
Please help introduce links in articles on related topics. After links have been created, remove this message.
This article has been tagged since September 2006.

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.

[edit] References

  1. ↑  Frank M. Liang (1983), Word hy-phen-a-tion by com-pu-ter, Ph.D. thesis, Stanford University.
Retrieved from "http://en.wikipedia.org../../../h/a/s/Hash_trie.html"