Community hub
0 subscribers7 pages, 0 posts
Recent from talks
All channels
Be the first to start a discussion here.
Be the first to start a discussion here.
Be the first to start a discussion here.
Be the first to start a discussion here.
Contribute something
Welcome to the community hub built to collect knowledge and have discussions related to Hash tree (persistent data structure).
Nothing was collected or created yet.
Hash tree (persistent data structure)
View on Wikipediafrom Wikipedia
 | This article relies largely or entirely on a single source. (April 2024) |
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
[edit]- ^ a b Phil Bagwell (2000). Ideal Hash Trees (PDF) (Report). Infoscience Department, École Polytechnique Fédérale de Lausanne.
 | This computer-programming-related article is a stub. You can help Wikipedia by expanding it. |