Chinese B堆 Cited by user Duzhong on 30 Dec 2015 B堆()是一个用来保证子树在一个内存页的二叉堆。这样可以在使用虚拟内存时减少访问很大堆时内存页的访问。传统的实现中,元素位置的映射(几乎)每一级都放在不同的内存页中。 也有其他非常高效实用虚拟内存和缓存的堆的变种,例如、k堆、和。 == 参见 == * == 参考文献 == == 外部链接 == * 实现: https://archive.
English B-heap Cited by user Phil Boswell on 17 Jul 2012 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…
English Van Emde Boas tree Cited by user Phil Boswell on 17 Jul 2012 A Van Emde Boas tree, also known as a vEB tree, is a tree data structure which implements an associative array with m-bit integer keys.