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 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
References
<templatestyles src="Reflist/styles.css" />
- ↑ Template:Cite thesis
- ↑ Script error: No such module "citation/CS1".
Script error: No such module "Check for unknown parameters".
<templatestyles src="Dmbox/styles.css" />
