This HTML5 document contains 15 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#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
n6	http://en.wikipedia.org/wiki/
prov	http://www.w3.org/ns/prov#
dbc	http://dbpedia.org/resource/Category:
dbp	http://dbpedia.org/property/
xsdh	http://www.w3.org/2001/XMLSchema#
gold	http://purl.org/linguistics/gold/
dbr	http://dbpedia.org/resource/

Statements

Subject Item

dbr:Shadow_heap

rdf:type

dbo:Building

rdfs:label

Shadow heap

rdfs:comment

In computer science, a shadow heap is a mergeable heap data structure which supports efficient heap merging in the amortized sense. More specifically, shadow heaps make use of the shadow merge algorithm to achieve insertion in O(f(n)) amortized time and deletion in O((log n log log n)/f(n)) amortized time, for any choice of 1 ≤ f(n) ≤ log log n. Throughout this article, it is assumed that A and B are binary heaps with |A| ≤ |B|.

owl:sameAs

freebase:m.0107yryk

dbp:wikiPageUsesTemplate

dbt:Reflist dbt:Data_structures

dct:subject

dbc:Amortized_data_structures dbc:Heaps_(data_structures)

gold:hypernym

dbr:Structure

prov:wasDerivedFrom

n6:Shadow_heap?oldid=815059970&ns=0

dbo:wikiPageID

42442221

dbo:wikiPageLength

8352

dbo:wikiPageRevisionID

815059970

dbo:abstract

In computer science, a shadow heap is a mergeable heap data structure which supports efficient heap merging in the amortized sense. More specifically, shadow heaps make use of the shadow merge algorithm to achieve insertion in O(f(n)) amortized time and deletion in O((log n log log n)/f(n)) amortized time, for any choice of 1 ≤ f(n) ≤ log log n. Throughout this article, it is assumed that A and B are binary heaps with |A| ≤ |B|.

foaf:isPrimaryTopicOf

n6:Shadow_heap