Hash trie
From Wikipedia, the free encyclopedia
 |
This article is orphaned as few or no other articles link to it. Please help introduce links in articles on related topics. (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.)
- An ordinary trie used to store hash values, for example, in an implementation of a hash tree.
[edit] References
- ^ Frank M. Liang (1983), Word hy-phen-a-tion by com-pu-ter, Ph.D. thesis, Stanford University.
