About: X-fast trie

An Entity of Type: building, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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.

thumbnail
Property Value
dbo: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. (en)
dbo:thumbnail
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 31450846 (xsd:integer)
dbo:wikiPageLength
  • 9732 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1109617541 (xsd:integer)
dbo:wikiPageWikiLink
dbp:deleteAvg
  • O amortized (en)
dbp:insertAvg
  • O amortized (en)
dbp:inventedBy
dbp:inventedYear
  • 1982 (xsd:integer)
dbp:name
  • X-fast trie (en)
dbp:searchAvg
  • O (en)
dbp:searchWorst
  • O (en)
dbp:spaceAvg
  • O (en)
dbp:spaceWorst
  • O (en)
dbp:type
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs: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. (en)
rdfs:label
  • X-fast trie (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is rdfs:seeAlso of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License