B-heap
http://dbpedia.org/resource/B-heap
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.
rdf:langString
B堆（英語：B-heap）是一个用来保证子树在一个内存页的二叉堆。这样可以在使用虚拟内存时减少访问很大堆时内存页的访问。传统的实现中，元素位置的映射（几乎）每一级都放在不同的内存页中。 也有其他非常高效实用虚拟内存和缓存的堆的变种，例如、k堆、和。
rdf:langString
rdf:langString
B-heap
rdf:langString
B堆
xsd:integer
30047903
xsd:integer
1038844819
rdf:langString
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.
rdf:langString
B堆（英語：B-heap）是一个用来保证子树在一个内存页的二叉堆。这样可以在使用虚拟内存时减少访问很大堆时内存页的访问。传统的实现中，元素位置的映射（几乎）每一级都放在不同的内存页中。 也有其他非常高效实用虚拟内存和缓存的堆的变种，例如、k堆、和。
xsd:nonNegativeInteger
6106