Efficient Tree Layout in a Multilevel Memory Hierarchy

Details Efficient Tree Layout in a Multilevel Memory Hierarchy Efficient Tree Layout in a Multilevel Memory Hierarchy

2002-11-12

arxiv.org/abs/cs/0211010v2

Computer Science

Data Structures and Algorithms

18 pages. Version 2 adds faster dynamic programs. Preliminary version appeared in European Symposium on Algorithms, 2002

Scientific paper

We consider the problem of laying out a tree with fixed parent/child structure in hierarchical memory. The goal is to minimize the expected number of block transfers performed during a search along a root-to-leaf path, subject to a given probability distribution on the leaves. This problem was previously considered by Gil and Itai, who developed optimal but slow algorithms when the block-transfer size B is known. We present faster but approximate algorithms for the same problem; the fastest such algorithm runs in linear time and produces a solution that is within an additive constant of optimal. In addition, we show how to extend any approximately optimal algorithm to the cache-oblivious setting in which the block-transfer size is unknown to the algorithm. The query performance of the cache-oblivious layout is within a constant factor of the query performance of the optimal known-block-size layout. Computing the cache-oblivious layout requires only logarithmically many calls to the layout algorithm for known block size; in particular, the cache-oblivious layout can be computed in O(N lg N) time, where N is the number of nodes. Finally, we analyze two greedy strategies, and show that they have a performance ratio between Omega(lg B / lg lg B) and O(lg B) when compared to the optimal layout.

Affiliated with

Also associated with

No associations

Rating

Efficient Tree Layout in a Multilevel Memory Hierarchy 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 Efficient Tree Layout in a Multilevel Memory Hierarchy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Tree Layout in a Multilevel Memory Hierarchy will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-19031