Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Hash_tree_(persistent_data_structure)> ?p ?o }
Showing triples 1 to 36 of
36
with 100 triples 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) wikiPageLength "1018".
- Hash_tree_(persistent_data_structure) wikiPageOutDegree "11".
- Hash_tree_(persistent_data_structure) wikiPageRevisionID "660564299".
- Hash_tree_(persistent_data_structure) wikiPageWikiLink Associative_array.
- Hash_tree_(persistent_data_structure) wikiPageWikiLink Category:Functional_data_structures.
- Hash_tree_(persistent_data_structure) wikiPageWikiLink Category:Hashing.
- Hash_tree_(persistent_data_structure) wikiPageWikiLink Ctrie.
- Hash_tree_(persistent_data_structure) wikiPageWikiLink Hash_array_mapped_trie.
- Hash_tree_(persistent_data_structure) wikiPageWikiLink Hash_function.
- Hash_tree_(persistent_data_structure) wikiPageWikiLink Hash_table.
- Hash_tree_(persistent_data_structure) wikiPageWikiLink Persistent_data_structure.
- Hash_tree_(persistent_data_structure) wikiPageWikiLink Purely_functional.
- Hash_tree_(persistent_data_structure) wikiPageWikiLink Set_(abstract_data_type).
- Hash_tree_(persistent_data_structure) wikiPageWikiLink Trie.
- Hash_tree_(persistent_data_structure) wikiPageWikiLinkText "Hash tree (persistent data structure)".
- Hash_tree_(persistent_data_structure) wikiPageWikiLinkText "Hash tree".
- Hash_tree_(persistent_data_structure) wikiPageWikiLinkText "Tiger tree hashes".
- Hash_tree_(persistent_data_structure) wikiPageWikiLinkText "hash tree".
- Hash_tree_(persistent_data_structure) hasPhotoCollection Hash_tree_(persistent_data_structure).
- Hash_tree_(persistent_data_structure) wikiPageUsesTemplate Template:CS-Trees.
- Hash_tree_(persistent_data_structure) wikiPageUsesTemplate Template:Compu-prog-stub.
- Hash_tree_(persistent_data_structure) wikiPageUsesTemplate Template:Data_structures.
- Hash_tree_(persistent_data_structure) wikiPageUsesTemplate Template:Reflist.
- Hash_tree_(persistent_data_structure) subject Category:Functional_data_structures.
- Hash_tree_(persistent_data_structure) subject Category:Hashing.
- Hash_tree_(persistent_data_structure) hypernym Structure.
- Hash_tree_(persistent_data_structure) type Building.
- 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=660564299.
- Hash_tree_(persistent_data_structure) isPrimaryTopicOf Hash_tree_(persistent_data_structure).