Worst-Case Optimal Tree Layout in External Memory
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+...
| Main Authors: | , , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Springer-Verlag,
2014-04-11T19:51:16Z.
|
| Subjects: | |
| Online Access: | Get fulltext |