skip to main content
10.1145/800297.811532acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article
Free Access

The relational and network approaches: Comparison of the application programming interfaces

Published:01 January 1975Publication History

ABSTRACT

For some time now there has been considerable debate in the field of database systems over the fundamental question of the underlying design philosophy of such a system. The controversy has centered on the structure of the programmer interface, though of course the design chosen for this interface has repercussions throughout the rest of the system. Two approaches to this problem have received particular attention: the network approach, which is typified by the proposals of the CODASYL Data Base Task Group (DBTG), and the relational approach, which is advocated by the present authors (among others). The purpose of this paper is to give some comparisons between these two approaches (primarily from the application programming viewpoint), and to show what the authors believe to be the advantages of the relational approach. The reader is assumed to have a basic familiarity with the two approaches.

References

  1. 1.C. W. Bachman: "Implementation Techniques for Data Structure Sets", Proc. SHARE Workshop on Data Base Management Systems, Montreal, July 1973, SHARE Distribution.Google ScholarGoogle Scholar
  2. 2.CODASYL Data Base Task Group: Report, April 1971.Google ScholarGoogle Scholar
  3. 3.CODASYL Data Base Language Task Group: Proposal, February 1973.Google ScholarGoogle Scholar
  4. 4.CODASYL Data Description Language Committee: Journal of Development, June 1973.Google ScholarGoogle Scholar
  5. 5.E. F. Codd: "A Relational Model of Data for Large Shared Data Banks", CACM 13,6 June 1970. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.E. F. Codd: "Normalized Data Base Structure: A Brief Tutorial", Proc. 1971 ACM SIGFIDET Workshop on Data Description, Access and Control.Google ScholarGoogle Scholar
  7. 7.E. F. Codd: "A Data Base Sublanguage Founded on the Relational Calculus", Proc. 1971 ACM SIGFIDET Workshop on Data Description, Access and Control.Google ScholarGoogle Scholar
  8. 8.E. F. Codd: "Further Normalization of the Data Base Relational Model", In "Data Base Systems", Courant Computer Science Symposia 6, Prentice-Hall 1972.Google ScholarGoogle Scholar
  9. 9.E. F. Codd: "Relational Completeness of Data Base Sublanguages", Courant Computer Science Symposia 6, Prentice-Hall 1972.Google ScholarGoogle Scholar
  10. 10.E. F. Codd: "Access Control for Relational Data Base Systems", Presented at BCS Symposium on Relational Database Concepts, London, April 1973.Google ScholarGoogle Scholar
  11. 11.C. J. Date: "Relational Database Systems: a Tutorial", Proc. 4th International Symposium on Computer and Information Science, Miami Beach, December 1972, Plenum, New YorkGoogle ScholarGoogle Scholar
  12. 12.C. J. Date, P. Hopewell: "Storage Structure and Physical Data Independence", Proc. 1971 ACM SIGFIDET Workshop on Data Description, Access and Control.Google ScholarGoogle Scholar
  13. 13.C. J. Date, P. Hopewell: "File Definition and Logical Data Independence", Proc. 1971 ACM SIGFIDET Workshop on Data Description, Access and Control.Google ScholarGoogle Scholar
  14. 14.R. W. Engles: "An Analysis of the April 1971 DBTG Report", Proc. 1971 ACM SIGFIDET Workshop on Data Description, Access and Control.Google ScholarGoogle Scholar
  15. 15.R. C. Goldstein, A. J. Strnad: "The MacAIMS Data Management System", Proc. 1970 ACM SIGFIDET Workshop on Data Description and Access.Google ScholarGoogle Scholar
  16. 16.I. J. Heath: "Unacceptable File Operations in a Relational Database", Proc. 1971 ACM SIGFIDET Workshop on Data Description, Access and Control.Google ScholarGoogle Scholar
  17. 17.F. P. Palermo: "A Data Base Search Problem", Proc. 4th International Symposium on Computer and Information Science, Miami Beach, December 1972, Plenum, New York.Google ScholarGoogle Scholar
  18. 18.P. H. Prowse: "The Relational Model as a System Analysis Tool", Presented at BCS Symposium on Relational Database Concepts, London, April 1973.Google ScholarGoogle Scholar
  19. 19.C. W. Bachman: "Data Structure Diagrams", Data Base 1,2, Summer 1969. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20.C. W. Bachman: "The Programmer as Navigator" (1973 Turing Award Lecture), CACM 16,11 November 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21.J. B. Rothnie: "The Design of Generalized Data Management Systems", Ph.D. Dissertation, Dept. of Civil Engineering, MIT (September 1972).Google ScholarGoogle Scholar
  22. 22.D. D. Chamberlin, R. F. Boyce: "SEQUEL: A Structured English Query Language", Proc. ACM-SIGFIDET Workshop 1974 Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 23.R. Boyce, D. D. Chamberlin: "Using a Structured English Query Language as a Data Definition Facility", IBM Research Report RJ 1318.Google ScholarGoogle Scholar
  24. 24.D. D. Chamberlin, R. F. Boyce, I. L. Traiger: "A Deadlock-Free Scheme for Resource Locking in a Database Environment", Information Processing 74, North-Holland, Amsterdam.Google ScholarGoogle Scholar
  25. 25.V. K. M. Whitney: "Fourth Generation Data Management Systems", Proc. 1973 National Computer Conference, New York.Google ScholarGoogle Scholar

Index Terms

  1. The relational and network approaches: Comparison of the application programming interfaces

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          SIGFIDET '74: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational
          January 1975
          144 pages
          ISBN:9781450374187
          DOI:10.1145/800297

          Copyright © 1975 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 January 1975

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader