This HTML5 document contains 18 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/
n6	http://dbpedia.org/resource/File:
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#
n11	http://en.wikipedia.org/wiki/
dbc	http://dbpedia.org/resource/Category:
dbp	http://dbpedia.org/property/
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
dbr	http://dbpedia.org/resource/

Statements

Subject Item

dbr:K-D_heap

rdfs:label

K-D heap

rdfs:comment

A K-D heap is a data structure in computer science which implements a multidimensional priority queue without requiring additional space. It is a generalization of the Heap. It allows for efficient insertion, query of the minimum element, and deletion of the minimum element in any of the k dimensions, and therefore includes the double-ended heap as a special case.

dbp:wikiPageUsesTemplate

dbt:Reflist

dct:subject

dbc:Data_structures

prov:wasDerivedFrom

n11:K-D_heap?oldid=1071751110&ns=0

dbo:wikiPageID

61017112

dbo:wikiPageLength

2595

dbo:wikiPageRevisionID

1071751110

dbo:wikiPageWikiLink

dbc:Data_structures dbr:Data_structure n6:K-d_heap_2_keys.png dbr:Heap_(data_structure) dbr:Priority_queue dbr:Binary_tree dbr:Computer_science dbr:Double-ended_priority_queue

dbo:abstract

A K-D heap is a data structure in computer science which implements a multidimensional priority queue without requiring additional space. It is a generalization of the Heap. It allows for efficient insertion, query of the minimum element, and deletion of the minimum element in any of the k dimensions, and therefore includes the double-ended heap as a special case.

foaf:isPrimaryTopicOf

n11:K-D_heap