Compact balanced tries
| Author(s) : | Pierre Nicod Eme, |
| Publisher : | N/A |
| Publication Date : | 1992 |
| ISSN : | N/A |
| Abstract : | Classical B trees offer both fast direct addressing and easy sequential processing. The minimum storage utilization of a B-tree is 50%. Moreover it is always possible to shrink a B tree to a minimum size as follows: scan the leaves in key increasing order; when reaching a leaf, transfer, |