Live briefing
Everything about Hash tree (persistent data structure)
Formatted data in computer science
In computer science, a hash tree is a persistent data structure that can be used to implement sets and maps, intended to replace hash tables in purely functional programming. In its basic form, a hash tree stores the hashes of its keys, regarded as strings of bits, in a trie, with the actual keys and (optional) values stored at the trie's "final" nodes. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Hash tree (persistent data structure)A 5-minute orientation
- Pick up a classic book: Database system conceptsThe most-reprinted book on the subject
- Go sideways: TrieA closely related topic
- Go sideways: Radix treeA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
- No matching papers found.
📚 Books worth reading
Database system conceptsAbraham Silberschatz · 1997
TCP/IP IllustratedW. Richard Stevens, Kevin R. Fall · 1993
Data structures, algorithms, and performanceDerick Wood · 1992
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Trie In computer science, a trie (/ˈtraɪ/, /ˈtriː/ ), also known as a digital tree or prefix tree, is a specialized search tree data structure used to store…
- Radix tree In computer science, a radix tree (also radix trie or compact prefix tree or compressed trie) is a data structure that represents a space-optimized trie…
- Hash array mapped trie A hash array mapped trie (HAMT, /ˈhæmt/) is an implementation of an associative array that combines the characteristics of a hash table and an array mapped…
- Ctrie A concurrent hash-trie or Ctrie is a concurrent thread-safe lock-free implementation of a hash array mapped trie. It is used to implement the concurrent…
- 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…
- List of data structures This is a list of well-known data structures. For a comparison of running times for a subset of this list see comparison of data structures. Boolean, true…
- Ternary search tree In computer science, a ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a binary…
- Judy array In computer science, a Judy array is an early-2000s Hewlett-Packard hand-optimized implementation of a 256-ary radix tree that uses many situational node…