| 词条 | 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.[1] 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,[2] and van Emde Boas layouts.[3] See also
References1. ^{{cite journal | first = Poul-Henning | last = Kamp | url = http://queue.acm.org/detail.cfm?id=1814327 | title = You're Doing It Wrong | journal = ACM Queue | date = June 11, 2010 }} 2. ^{{Cite journal | last1 = Naor | first1 = Dalit| last2 = Martel | first2 = Charles U.| last3 = Matloff | first3 = Norman S.| title = Performance of Priority Queue Structures in a Virtual Memory Environment | doi = 10.1093/comjnl/34.5.428 | journal = Comput. J. | volume = 34 | issue = 5 | pages = 428–437 | year = 1991 | pmid = | pmc = }} 3. ^{{Cite journal | last1 = van Emde Boas | first1 = P. | last2 = Kaas | first2 = R. | last3 = Zijlstra | first3 = E. | title = Design and implementation of an efficient priority queue | doi = 10.1007/BF01683268 | journal = Mathematical Systems Theory | volume = 10 | pages = 99–127| year = 1976 | pmid = | pmc = | url = http://www.springerlink.com/content/h63507n460256241/}} External links
1 : Heaps (data structures) |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。