Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/B-heap> ?p ?o }
Showing triples 1 to 31 of
31
with 100 triples per page.
- B-heap abstract "A B-heap is a binary heap implemented to keep subtrees in a single page. This reduces the number of pages accessed by up to a factor of ten for big heaps when using virtual memory, compared with the traditional implementation.The traditional mapping of elements to locations in an array puts (almost) every level in a different page.There are other heap variants which are efficient in computers using virtual memory or caches, such as cache-oblivious algorithms, k-heaps, and van Emde Boas layouts.".
- B-heap wikiPageExternalLink cache-oblivious-data-structures.aspx.
- B-heap wikiPageExternalLink binheap.c.
- B-heap wikiPageExternalLink 2008-03-13_DeptSeminar_BenSach.pdf.
- B-heap wikiPageExternalLink binary_heap.c.
- B-heap wikiPageExternalLink gheap.
- B-heap wikiPageID "30047903".
- B-heap wikiPageLength "2309".
- B-heap wikiPageOutDegree "8".
- B-heap wikiPageRevisionID "678453271".
- B-heap wikiPageWikiLink Array_data_structure.
- B-heap wikiPageWikiLink Binary_heap.
- B-heap wikiPageWikiLink Cache-oblivious_algorithm.
- B-heap wikiPageWikiLink Category:Heaps_(data_structures).
- B-heap wikiPageWikiLink D-ary_heap.
- B-heap wikiPageWikiLink Page_(computer_memory).
- B-heap wikiPageWikiLink Van_Emde_Boas_tree.
- B-heap wikiPageWikiLink Virtual_memory.
- B-heap wikiPageWikiLinkText "B-heap".
- B-heap hasPhotoCollection B-heap.
- B-heap wikiPageUsesTemplate Template:Datastructure-stub.
- B-heap wikiPageUsesTemplate Template:Reflist.
- B-heap subject Category:Heaps_(data_structures).
- B-heap hypernym Heap.
- B-heap comment "A B-heap is a binary heap implemented to keep subtrees in a single page. This reduces the number of pages accessed by up to a factor of ten for big heaps when using virtual memory, compared with the traditional implementation.The traditional mapping of elements to locations in an array puts (almost) every level in a different page.There are other heap variants which are efficient in computers using virtual memory or caches, such as cache-oblivious algorithms, k-heaps, and van Emde Boas layouts.".
- B-heap label "B-heap".
- B-heap sameAs m.0g53lkg.
- B-heap sameAs Q4833727.
- B-heap sameAs Q4833727.
- B-heap wasDerivedFrom B-heap?oldid=678453271.
- B-heap isPrimaryTopicOf B-heap.