Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Hash_tree_(persistent_data_structure)> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Hash_tree_(persistent_data_structure) abstract "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.Hash array mapped tries and Ctries are refined versions of this data structure, using particular type of trie implementations.".
- Hash_tree_(persistent_data_structure) wikiPageID "39393649".
- Hash_tree_(persistent_data_structure) wikiPageRevisionID "604716589".
- Hash_tree_(persistent_data_structure) subject Category:Functional_data_structures.
- Hash_tree_(persistent_data_structure) subject Category:Hashing.
- Hash_tree_(persistent_data_structure) comment "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.Hash array mapped tries and Ctries are refined versions of this data structure, using particular type of trie implementations.".
- Hash_tree_(persistent_data_structure) label "Hash tree (persistent data structure)".
- Hash_tree_(persistent_data_structure) sameAs m.0vpwb12.
- Hash_tree_(persistent_data_structure) sameAs Q16948622.
- Hash_tree_(persistent_data_structure) sameAs Q16948622.
- Hash_tree_(persistent_data_structure) wasDerivedFrom Hash_tree_(persistent_data_structure)?oldid=604716589.
- Hash_tree_(persistent_data_structure) isPrimaryTopicOf Hash_tree_(persistent_data_structure).