Reference articles on history, science, culture and more
Surprise meSurprise meSubscribe
Encyclopedia

Hash trie

Index of articles associated with the same name

Wikipedia contributorsAdapted for Fathomly · View authors
1 min read
Source updated May 30, 2026

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
  • A data structure which "combines features of hash tables and LC-tries (least compression tries) in order to perform efficient lookups and updates"
Watch videos about Hash trieExplainers and documentaries on YouTube (opens in a new tab)

Sources and credits

This article is adapted from the Wikipedia article “Hash trie”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.

Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.

Continue exploring

Related topics

Hash array mapped trie

A hash array mapped trie 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.

Hashed array tree

In computer science, a hashed array tree is a dynamic array data-structure published by Edward Sitarski in 1996, maintaining an array of separate memory fragments (or "leaves") to store the data elements, unlike simple dynamic arrays which maintain their data in one contiguous memory area. Its primary objective is to reduce the amount of element copying due to automatic array resizing operations, and to improve memory usage patterns.

Merkle tree

In cryptography and computer science, a hash tree or Merkle tree is a tree in which every "leaf" node is labelled with the cryptographic hash of a data block, and every node that is not a leaf is labelled with the cryptographic hash of the labels of its child nodes. A hash tree allows efficient and secure verification of the contents of a large data structure.