Worst-Case Optimal Tree Layout in External Memory
Author(s)Demaine, Erik D.; Iacono, John; Langerman, Stefan
MetadataShow full item record
Consider laying out a fixed-topology binary tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse a path from the root to a node of depth D. We prove that the optimal number of memory transfers is Θ([D over lg(1+B))] when D = O(lgN), Θ([lgN over lg(1+[BlgN over D])]) when D=Ω(lgN) and D=O(BlgN), Θ([D over B]) ,when D=Ω(BlgN).
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Demaine, Erik D., John Iacono, and Stefan Langerman. “Worst-Case Optimal Tree Layout in External Memory.” Algorithmica (January 15, 2014).
Author's final manuscript