M. M. Astrahan
ABSTRACT
The Data Independent Accessing Model (DIAM) represents a constructive combination of the formal mathematical and the evolutionary pragmatic approaches to a Generalized Data Base Management System. It aims at a complete separation between the user's (application programmer's) model of real-world objects, events, and the relationships among them, and the internal representation of those objects, events, and relationships. At the same time, it aims at complete flexibility of internal representation in terms of simple specifications, the effects of which are easy to understand.
The DIAM encompasses four levels of descriptive models (Figure 1), each providing for flexible augmentation of the descriptions of the preceding level. Specifications at each level are retained in a catalog.
- 1.Altman, E. B., et. al., Specifications in a Data Independent Accessing Model, SIGFIDET Workshop, Denver, Col., Nov. 29, 1972. Google Scholar
Digital Library
- 2.Davies, C. T., A Logical Concept for the Control and Management of Data, IBM Report AR-0803-00, Poughkeesie, New York, March 13, 1967.Google Scholar
- 3.Engles, R. W., A Tutorial on Data Base Organization, IBM Report TR 00.2004, Poughkeepsie, New York, March 20, 1970.Google Scholar
- 4.Meltzer, H. S., Data Base Concepts and Architecture for Data Base Systems, IBM Report to SHARE Information Systems Research Project, August 20, 1969.Google Scholar
Index Terms
- Concepts of a Data Independent Accessing Model
Recommendations
Model independent order relations for processes
APLAS'10: Proceedings of the 8th Asian conference on Programming languages and systemsSemantic preorders between processes are usually applied in practice to model approximation or implementation relationships. For interactive models these preorders depend crucially on the observational behaviours of processes as well as on the observing ...
Distributed maximal independent set using small messages
SODA '19: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete AlgorithmsMaximal Independent Set (MIS) is one of the central problems in distributed graph algorithms. The celebrated works of Luby [STOC'85] and Alon, Babai, and Itai [JALG'86] provide O(log n)-round randomized distributed MIS algorithms, which work with O(log ...
An improved distributed algorithm for maximal independent set
SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithmsThe Maximal Independent Set (MIS) problem is one of the basics in the study of locality in distributed graph algorithms. This paper presents a very simple randomized algorithm for this problem providing a near-optimal local complexity, which ...
Comments