出典:Wikipedia
出典:『Wikipedia』 (2011/02/27 00:07 UTC 版)
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.