Paper

On storing arbitrarily many extendible arrays of arbitrary dimensions

Abstract

Techniques that were developed for allocating storage for extendible arrays can be adapted to allocate storage for a (possibly growing) collection of (possibly extendible) arrays of arbitrary dimensions. By carefully selecting the allocation scheme to be adapted, one can ensure that the computational characteristics of the allocation schemes for the constituent arrays are not too badly degraded in the adaptation process, although some degradation is inevitable. © 1975 Plenum Publishing Corporation.

Related

Conference paper

Compact B-trees

Arnold L. Rosenberg, Lawrence Snyder

SIGMOD 1979