Memory Data Structures Research Articles

Evaluation of the MIDAS DBMS in an equation-solving environment

The paper describes an evaluation of a data base management system, MIDAS, for the solution of linear equations. A brief description of the system is given. It is used and evaluated employing skyline and hypermatrix approaches for solving large matrix equations. Performance of the two subsystems of MIDAS—MIDAS/N and MIDAS/R—is measured and compared in terms of several system parameters. Programming for efficient use of the available memory is noted. Suggestions for application programming using MIDAS are given. Major conclusions of the study are that memory management schemes, data structures, and data access methods of the DBMS play very important roles for its efficient use in dynamic environment. Such methods must be developed and implemented for large-scale engineering applications.

Abstract code network as a model of perceptual memory

According to Structural Information Theory human observers represent important aspects of the information of visual patterns in abstract sequential codes. The theory proposes a syntax for the structural form of these codes. In this paper a generative syntax is presented that is suitable for the generation of a theory based computer model of the human memory. The model consists of many abstract codes. The memory is assumed to be actively used to interpret new information. Our aim is to simulate this interpretation process. The present development of memory data structures and of processes working upon them is a first step.

Associative tabular data structures

Attention is drawn to a method of implementing data structures in core memory by means of associative links instead of pointers. The properties of associative links are discussed and the way in which they may be exploited in a program for formal differentiation is illustrated. There is a section on microprogramming support for the associative search operations involved.