Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/X-fast_trie> ?p ?o }
Showing triples 1 to 55 of
55
with 100 triples per page.
- X-fast_trie abstract "In computer science, an x-fast trie is a data structure for storing integers from a bounded domain. It supports exact and predecessor or successor queries in time O(log log M), using O(n log M) space, where n is the number of stored values and M is the maximum value in the domain. The structure was proposed by Dan Willard in 1982, along with the more complicated y-fast trie, as a way to improve the space usage of van Emde Boas trees, while retaining the O(log log M) query time.".
- X-fast_trie thumbnail Xfast_trie_example.svg?width=300.
- X-fast_trie wikiPageExternalLink node64.html.
- X-fast_trie wikiPageID "31450846".
- X-fast_trie wikiPageLength "9932".
- X-fast_trie wikiPageOutDegree "29".
- X-fast_trie wikiPageRevisionID "681519483".
- X-fast_trie wikiPageWikiLink Amortized_analysis.
- X-fast_trie wikiPageWikiLink Associative_array.
- X-fast_trie wikiPageWikiLink Big-O_notation.
- X-fast_trie wikiPageWikiLink Big_O_notation.
- X-fast_trie wikiPageWikiLink Binary_number.
- X-fast_trie wikiPageWikiLink Binary_numeral_system.
- X-fast_trie wikiPageWikiLink Binary_search.
- X-fast_trie wikiPageWikiLink Binary_search_algorithm.
- X-fast_trie wikiPageWikiLink Binary_tree.
- X-fast_trie wikiPageWikiLink Category:Articles_created_via_the_Article_Wizard.
- X-fast_trie wikiPageWikiLink Category:Associative_arrays.
- X-fast_trie wikiPageWikiLink Category:Trees_(data_structures).
- X-fast_trie wikiPageWikiLink Computer_science.
- X-fast_trie wikiPageWikiLink Cuckoo_hashing.
- X-fast_trie wikiPageWikiLink Dan_Willard.
- X-fast_trie wikiPageWikiLink Data_structure.
- X-fast_trie wikiPageWikiLink Doubly_linked_list.
- X-fast_trie wikiPageWikiLink Dynamic_perfect_hashing.
- X-fast_trie wikiPageWikiLink Hash_table.
- X-fast_trie wikiPageWikiLink Integer.
- X-fast_trie wikiPageWikiLink List_of_data_structures.
- X-fast_trie wikiPageWikiLink Patricia_trie.
- X-fast_trie wikiPageWikiLink Radix_tree.
- X-fast_trie wikiPageWikiLink Trie.
- X-fast_trie wikiPageWikiLink Van_Emde_Boas_tree.
- X-fast_trie wikiPageWikiLink Y-fast_trie.
- X-fast_trie wikiPageWikiLink File:Xfast_trie_example.svg.
- X-fast_trie wikiPageWikiLinkText "X-fast trie".
- X-fast_trie wikiPageWikiLinkText "x-fast trie".
- X-fast_trie hasPhotoCollection X-fast_trie.
- X-fast_trie wikiPageUsesTemplate Template:CS-Trees.
- X-fast_trie wikiPageUsesTemplate Template:Reflist.
- X-fast_trie subject Category:Articles_created_via_the_Article_Wizard.
- X-fast_trie subject Category:Associative_arrays.
- X-fast_trie subject Category:Trees_(data_structures).
- X-fast_trie hypernym Structure.
- X-fast_trie type Building.
- X-fast_trie type Array.
- X-fast_trie type Structure.
- X-fast_trie type Technique.
- X-fast_trie comment "In computer science, an x-fast trie is a data structure for storing integers from a bounded domain. It supports exact and predecessor or successor queries in time O(log log M), using O(n log M) space, where n is the number of stored values and M is the maximum value in the domain. The structure was proposed by Dan Willard in 1982, along with the more complicated y-fast trie, as a way to improve the space usage of van Emde Boas trees, while retaining the O(log log M) query time.".
- X-fast_trie label "X-fast trie".
- X-fast_trie sameAs m.0glnw58.
- X-fast_trie sameAs Q8041554.
- X-fast_trie sameAs Q8041554.
- X-fast_trie wasDerivedFrom X-fast_trie?oldid=681519483.
- X-fast_trie depiction Xfast_trie_example.svg.
- X-fast_trie isPrimaryTopicOf X-fast_trie.