Optimal dynamic embedding of X-trees into arrays (Q1105377)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4058872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal dynamic embedding of X-trees into arrays |
scientific article; zbMATH DE number 4058872 |
Statements
Optimal dynamic embedding of X-trees into arrays (English)
0 references
1988
0 references
We 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+1/d}/\log t(n))\). Furthermore, this simulation is optimal.
0 references
on-line simulation
0 references
dynamic embedding
0 references
storage medium
0 references
X-tree
0 references
array
0 references
multihead bounded activity machine
0 references
0.7638940811157227
0 references
0.7290846705436707
0 references
0.7235518097877502
0 references
0.7185584306716919
0 references
0.7154014110565186
0 references
