Search
Menu
Home
Sources
About
Contacts
Hash trie
In
computer science
,
hash
trie
can
refer
to:
Hash tree
, 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
.
A
data structure
which "combines
features
of
hash tables
and LC-tries in order to
perform
efficient
lookups and updates"
