Answers are grounded in this paper and cite their sources.
Schemes which allocate storage for extendible arrays cannot utilize storage as efficiently as can their nonextendible counterparts. Relative to formal notions of array scheme and (extendible) array realization, a formal way of gauging efficiency of storage utilization by extendible array realizations is proposed; a lower bound of O(p · (log p)d - 1 ), where p is the array size and d the dimensionality, is derived for this measure; and an extendible allocation scheme which achieves this lower bound is exhibited. Certain seminorms on Euclidean spaces can be used to construct extendible array realizations. It is shown that for realizations so constructed, the lower bound on storage utilization efficiency is O(pᵈ ). In the opposite direction, certain restrictions on the patterns of expansions of arrays can be used to circumvent the lower bound: When arrays are constrained to expand according to some fixed finite set of patterns, then one can devise extendible realizations which (a) utilize storage very efficiently $(O(p))$ on arrays which conform to the patterns and (b) approach the general lower bound (O(p · (log p)d - 1 )) on arrays which do not conform. It is not known if this improvement is available for infinite sets of patterns.
No takes yet. Share an insight, caveat, or question.
Arnold L. Rosenberg (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: