Hash tree (persistent data structure)

From Infogalactic: the planetary knowledge core
Jump to: navigation, search

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 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.[1]

Hash array mapped tries and Ctries are refined versions of this data structure, using particular type of trie implementations.[1]

References

<templatestyles src="Reflist/styles.css" />

Cite error: Invalid <references> tag; parameter "group" is allowed only.

Use <references />, or <references group="..." />


<templatestyles src="Asbox/styles.css"></templatestyles>

Stub icon

This computer-programming-related article is a stub. You can help Wikipedia by expanding it.
  1. ↑ 1.0 1.1 Lua error in package.lua at line 80: module 'strict' not found.
Retrieved from "https://infogalactic.com/w/index.php?title=Hash_tree_(persistent_data_structure)&oldid=660564299"