A computer system for inference execution and data retrieval
Communications of the ACM
Treating hierarchical data structures in the SDC Time-Shared Data Management System (TDMS)
ACM '67 Proceedings of the 1967 22nd national conference
Tramp: An interpretive associative processor with deductive capabilities
ACM '68 Proceedings of the 1968 23rd ACM national conference
A search path selection algorithm for the Data Independent Accessing Model (DIAM)
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
IAM: an inferential abstract modeling approach to design of conceptual schema
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
| Hi-index | 0.00 |
The notion of dividing complex problems into hierarchic levels of abstraction has a long history. Recently this approach under the name, structured programming, has been used in a pragmatic way to simplify the structure of procedural programs. The notion has also been used in the data base area - notable early papers include those of Madnick (1) and Meltzer (2). In these early papers, level structures (for example, involving logical and physical levels) were also relatively pragmatic creations. One new aspect of the DIAM I architecture (3) was that it defined a detailed, relatively formal basis for four levels of abstraction and the mappings between these levels. Each level had a small set of primitive generalized building blocks, each with its own small permanent set of parameters. By specifying values for these parameters, the user could define essentially any reasonable data structure and file organization he wished for his stored information.