language-icon Old Web
English
Sign In

Hash array mapped trie

A hash array mapped trie (HAMT) is an implementation of an associative array that combines the characteristics of a hash table and an array mapped trie.It is a refined version of the more general notion of a hash tree. A hash array mapped trie (HAMT) is an implementation of an associative array that combines the characteristics of a hash table and an array mapped trie.It is a refined version of the more general notion of a hash tree.

[ "Hash tree", "Perfect hash function", "Double hashing", "SHA-2", "Merkle tree" ]
Parent Topic
Child Topic
    No Parent Topic