Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Hash_trie> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Hash_trie abstract "In computer science, hash trie can refer to: Hash tree (persistent data structure), a trie used to map hash values to keys A space-efficient implementation of a sparse trie, in which the descendants of each node may be interleaved in memory. (The name is suggested by a similarity to a closed hash table.) A data structure which "combines features of hash tables and LC-tries in order to perform efficient lookups and updates" ↑ ↑".
- Hash_trie wikiPageID "3568843".
- Hash_trie wikiPageRevisionID "571324753".
- Hash_trie hasPhotoCollection Hash_trie.
- Hash_trie subject Category:Trees_(data_structures).
- Hash_trie comment "In computer science, hash trie can refer to: Hash tree (persistent data structure), a trie used to map hash values to keys A space-efficient implementation of a sparse trie, in which the descendants of each node may be interleaved in memory. (The name is suggested by a similarity to a closed hash table.) A data structure which "combines features of hash tables and LC-tries in order to perform efficient lookups and updates" ↑ ↑".
- Hash_trie label "Hash trie".
- Hash_trie sameAs m.09m49m.
- Hash_trie sameAs Q5678860.
- Hash_trie sameAs Q5678860.
- Hash_trie wasDerivedFrom Hash_trie?oldid=571324753.
- Hash_trie isPrimaryTopicOf Hash_trie.