Optimal dynamic embedding of x-trees into arrays

AbstractWe present a dynamic embedding of the contents of a storage medium organized as an X-tree into a storage medium organized as a d-dimensional array. Let X be a multihead bounded activity machine with a single storage tape organized as an X-tree. A multihead bounded activity machine D with a single tape organized as a d-dimensional array is used to simulate X on-line. If X runs in time t(n) on inputs of length n, then D simulates X in time O(t(n)1+1dlog t(n)). Furthermore, this simulation is optimal