Summary
This paper presents a constructive model for data structures description based on the concept of data space defined as the Cartesian product of a name space and a value space. The subsets of name space are ordered by an a priori given selector function. The model is used for classification of data structures into regular (array-like), semiregular (key-ordered list-like) and irregular (threaded list-like) data structures. The notion of data storage structures induced by addressing mechanism is introduced and storage mapping functions are described using this concept together with the data structure model. The first part of the paper contains also some of the model applications to regular and semiregular data structure problems and a brief comparison withAlgol 68 treatment of regular data structures.
Similar content being viewed by others
References
Bosak, R.,et al.: An information algebra. CACM5, 190–204 (1962).
Greniewski, M., Turski, W. M.: The external language KLIPA for the URAL-2 digital computer. CACM6, 231–240 (1963).
Hellerman, H.: Addressing multidimensional arrays. CACM5, 205–207 (1962).
Mealy, G. H.: Another look at data. Proc. FJCC 1967, 525–534.
Morris, R.: Scatter storage techniques. CACM11, 38–44 (1968).
Turski, W. M.: Some results of research on automatic programming in Eastern Europe. Advances in Computers5, 23–108 (1964).
— Data structures and their ordering. IAG Journal3, 141–150 (1970).
Turski, W. M. Data structures — a book to be published by WNT (Scientific and Technical Publishers).
Wijngaarden, A. van (ed.): Report on the algorithmic languageAlgol 68. Num. Math.14, 29–218 (1969).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Turski, W.M. A model for data structures and its applications. I. Acta Informatica 1, 26–34 (1971). https://doi.org/10.1007/BF00264290
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00264290