Live briefing
Everything about Hash array mapped trie
Formatted data in computer science
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. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Hash array mapped trieA 5-minute orientation
- Read the landmark paper: Optimizing hash-array mapped tries for fast and lean immutable JVM collectionsCited 3 times
- Go sideways: CtrieA closely related topic
- Go sideways: Persistent data structureA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Open Library didn't respond; try again in a moment.
đź”— Related topics
- 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…
- Persistent data structure In computing, a persistent data structure or not ephemeral data structure is a data structure that always preserves the previous version of itself when…
- 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…
- Set (abstract data type) In computer science, a set is an abstract data type that can store distinct values, without any particular order. It is a computer implementation of the…
- Associative array In computer science, an associative array, key-value store, map, symbol table, or dictionary is an abstract data type that stores a collection of key/value…
- Hash tree (persistent data structure) In computer science, a hash tree (or hash trie) is a persistent data structure that can be used to implement sets and maps, intended to replace hash tables…
- 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…
- 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…