Worst-Case Optimal Tree Layout in External Memory

Details Worst-Case Optimal Tree Layout in External Memory Worst-Case Optimal Tree Layout in External Memory

2004-10-19

arxiv.org/abs/cs/0410048v3

Computer Science

Data Structures and Algorithms

9 pages, 1 figure

Scientific paper

Consider laying out a fixed-topology 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 Theta({D / lg (1+B) when D = O(lg N), Lg N / lg (1 + (B lg N) / D)) when D = Omega(lg N) and D = O(B lg N), D / B when D = Omega(B lg N)}).

Affiliated with

Also associated with

No associations

Rating

Worst-Case Optimal Tree Layout in External Memory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Worst-Case Optimal Tree Layout in External Memory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Worst-Case Optimal Tree Layout in External Memory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-512638