|
|
|
|
|
|
|
![HashTrie]()
|
|
|
By Softcomplete Development. HashTrie is a new highly efficient data structure for fast searching. It combines in itself properties of the hash-tables and trie (digital-trees). As against the usual hash-tables the size of HashTrie is not fixed which allows it to work with an unknown previous amount of data.
|
|
|
|
|
Related keywords:
hash, tree, dynamic, hashtrie,
|
|
|
|
|
|
|
|
|
|
