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

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

Namespace Prefixes

Prefix	IRI
dct	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
n8	http://en.wikipedia.org/wiki/
dbp	http://dbpedia.org/property/
prov	http://www.w3.org/ns/prov#
dbc	http://dbpedia.org/resource/Category:
xsdh	http://www.w3.org/2001/XMLSchema#
dbr	http://dbpedia.org/resource/

Statements

Subject Item

dbr:Radix_heap

rdfs:label

Radix heap

rdfs:comment

A radix heap is a data structure for realizing the operations of a monotone priority queue. A set of elements to which a key is assigned can then be managed. The run time of the operations depends on the difference between the largest and smallest key or constant. The data structure consists mainly of a series of buckets, the size of which increases exponentially.

dbp:wikiPageUsesTemplate

dbt:More_footnotes

dct:subject

dbc:Data_structures

prov:wasDerivedFrom

n8:Radix_heap?oldid=845440253&ns=0

dbo:wikiPageID

43934410

dbo:wikiPageLength

3628

dbo:wikiPageRevisionID

845440253

dbo:abstract

A radix heap is a data structure for realizing the operations of a monotone priority queue. A set of elements to which a key is assigned can then be managed. The run time of the operations depends on the difference between the largest and smallest key or constant. The data structure consists mainly of a series of buckets, the size of which increases exponentially.

foaf:isPrimaryTopicOf

n8:Radix_heap