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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. F. Codd, “Recent investigations in relational data base systems,” in J. Rosenfeld, ed.,Information Processing 74 (North-Holland, Amsterdam, 1974), pp. 1017–1021.
E. d. S. de Villiers and L. B. Wilson, “Hash coding methods for sparse matrices,” Tech. Rpt. 45, Computing Laboratory, Univ. of Newcastle upon Tyne (1973); see also: Hashing the subscripts of a sparse matrix,BIT 14:347–358 (1974).
D. E. Knuth,The Art of Computer Programming I: Fundamental Algorithms, (AddisonWesley, Reading, Massachusetts, 1968).
M. L. Minsky,Computation: Finite and Infinite Machines, (Prentice-Hall, Englewood Cliffs, New Jersey, 1967).
A. L. Rosenberg, Allocating storage for extendible arrays,J. ACM 21:652–670 (1974).
A. L. Rosenberg, “Computed access in ragged arrays,” in J. Rosenfeld, ed.,Information Processing 74 (North-Holland, Amsterdam, 1974), pp. 642–646.
A. L. Rosenberg, Managing storage for extendible arrays,SIAM J. Comput. 4, no. 3 (1975).
L. J. Stockmeyer, “Extendible array realizations with additive traversal,” IBM Report RC-4578 (1973).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rosenberg, A.L. On storing arbitrarily many extendible arrays of arbitrary dimensions. International Journal of Computer and Information Sciences 4, 189–196 (1975). https://doi.org/10.1007/BF00976243
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00976243