This HTML5 document contains 54 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
n14http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n16https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n15http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Predecessor_problem
rdfs:label
Predecessor problem
rdfs:comment
In computer science, the predecessor problem involves maintaining a set of items to, given an element, efficiently query which element precedes or succeeds that element in an order. Data structures used to solve the problem include balanced binary search trees, van Emde Boas trees, and fusion trees. In the static predecessor problem, the set of elements does not change, but in the dynamic predecessor problem, insertions into and deletions from the set are allowed.
foaf:depiction
n15:Xfast_trie_example.svg
dcterms:subject
dbc:Computational_problems dbc:Data_structures
dbo:wikiPageID
56037139
dbo:wikiPageRevisionID
1100495533
dbo:wikiPageWikiLink
dbr:Space_complexity dbr:Integer_sorting dbr:Word_size dbr:Integer_(computer_science) dbr:Balanced_binary_search_tree dbr:Nearest_neighbor_search dbr:Exponential_tree dbr:Y-fast_trie dbr:Expected_time dbr:Computer_science dbr:Mihai_Pătrașcu_(computer_scientist) dbr:There_exists dbr:Information_retrieval dbr:Michael_Fredman dbr:Fusion_tree dbr:Model_of_computation dbr:Word_RAM dbr:Cell-probe_model dbr:Communication_complexity dbc:Data_structures dbr:Data_structures dbr:Faith_Ellen dbr:Running_time dbr:Big_Theta_notation dbr:X-fast_trie dbr:Mikkel_Thorup dbc:Computational_problems dbr:Dan_Willard dbr:Hash_table n14:Xfast_trie_example.svg dbr:Big_O_notation dbr:Asymptotically_optimal dbr:Set_(mathematics) dbr:Van_Emde_Boas_tree dbr:For_all dbr:Transdichotomous_model dbr:Dynamization
owl:sameAs
wikidata:Q48999705 n16:4Xv3V
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Short_description dbt:Mvar
dbo:thumbnail
n15:Xfast_trie_example.svg?width=300
dbo:abstract
In computer science, the predecessor problem involves maintaining a set of items to, given an element, efficiently query which element precedes or succeeds that element in an order. Data structures used to solve the problem include balanced binary search trees, van Emde Boas trees, and fusion trees. In the static predecessor problem, the set of elements does not change, but in the dynamic predecessor problem, insertions into and deletions from the set are allowed. The predecessor problem is a simple case of the nearest neighbor problem, and data structures that solve it have applications in problems like integer sorting.
prov:wasDerivedFrom
wikipedia-en:Predecessor_problem?oldid=1100495533&ns=0
dbo:wikiPageLength
7860
foaf:isPrimaryTopicOf
wikipedia-en:Predecessor_problem