Data replication in static tree structures

摘要

We presented complete mappings of static tree structures to blocks of size B under the assumption that nodes can be replicated. The quality of a mapping is measured by the blocknumber and the amount of replication. Our results showed that by allowing 50% more space, we can generate a complete mapping achieving a blocknumber proportional to the optimal one of [h/B]. Bounding the total replication allows replication decisions to be made on the basis of which replications are the most useful ones, while keeping the total space used under control.