A relational model of data for large shared data banks
Communications of the ACM
Database Reorganization—Principles and Practice
ACM Computing Surveys (CSUR)
A mathematical modeling approach to the automatic selection of database designs
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Introduction to the DIAM theory of algebraic access graphs
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
An Introduction To DIAM Levels Of Abstraction In Accessing Information
ACM '78 Proceedings of the 1978 annual conference
Data physics - an unorthodox view of data and its implications in data processors
CAW '78 Proceedings of the fourth workshop on Computer architecture for non-numeric processing
Data physics: an unorthodox view of data and its implications in data processors
ACM SIGARCH Computer Architecture News
A generalized end-user facility architecture for relational database systems
VLDB '77 Proceedings of the third international conference on Very large data bases - Volume 3
DIAM II and levels of abstraction - the physical device level: a general model for access methods
VLDB '76 Proceedings of the second international conference on Systems for Large Data Bases
Data structures and data accessing in data base systems past, present, future
IBM Systems Journal
| Hi-index | 0.00 |
Efficiency is of paramount importance in very large databases. A principal technique for increasing efficiency is to define the user's view of the data independently of the storage structure so that the storage structure can be varied at will to improve performance. A widely accepted user view for this purpose is the relational model [3] and substantial progress has been made since its introduction. Far less research has been devoted to fundamental models of storage structures and the only comprehensive treatment is the Data Independent Accessing Model (DIAM) [1]. The DIAM, however, has seen limited application due, at least in part, to its use of the (less popular) entity set view of data. And despite the close correspondence between the relational and entity set views [2], little has been done to exploit their similarities. This paper attempts to show that the DIAM's relevance to contemporary research in database systems can be enhanced by viewing it through n-ary relations. To accomplish this, the paper first develops a redefinition of the DIAM String Level in terms of n-ary relations. It then appeals to the remaining levels of the DIAM to describe various relational implementation alternatives. The paper concludes that the utility of both the DIAM and the relational model is enhanced by this approach.