ACM Home Page
Please provide us with feedback. Feedback
A relational view of the data independent accessing model
Full text PdfPdf (1.50 MB)
Source International Conference on Management of Data archive
Proceedings of the 1976 ACM SIGMOD international conference on Management of data table of contents
Washington, D.C.
SESSION: Session III - logical design table of contents
Pages: 75 - 90  
Year of Publication: 1976
Author
L. S. Schneider  Denver, Colorado
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 15,   Citation Count: 8
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Senko, M. E., Altman, E. B., Astrahan, M. M., Fehder, P. L., Wang, C. P.; A Data Independent Architecture Model 1: Four Levels of Description from Logical Structures to Physical Search Structures, IBM Research Report #RJ982, February 1972.
 
2
McGee, W. C., "A Contribution to the Study of Data Equivalence," Proceedings of the IFIP TC-2 Working Conference on Data Base Management Systems, Cargese Corsica, France, April 1974.
3
 
4
Senko, M. E., Altman, E. B., Astrahan, M. M., Fehder, P. L.; "Data Structures and Accessing in Data Base Systems," IBM Systems Journal, No. 1, 1973, pp. 30-93.
 
5
Senko, M. E., personal correspondence, November 1974.
 
6
Senko, M. E., Altman, E. B.; DIAM Note 1: A "Framework" Mode for Implementing a Record-storing Facility, IBM Research Report #RJ1365, 1972.
 
7
Ghosh, S. P., Senko, M. E.; "String Path Search Procedures for Data Base Systems," IBM Journal of Research and Development, September 1974, pp. 408-422.
 
8
Astrahan, M. M., Ghosh, S. P.; Search Path Selection for the Data Independent Accessing Model, IBM Research Report #RJ1327, December 1973.
 
9
Schneider, L. S., Generalized Data Management Systems II: Formal Theories, National Aeronautics and Space Administration Report #NAS9-13951-002, November 1974.

CITED BY  8