Skip to main content
SpringerLink
Log in

A Relational Model of Data for Large Shared Data Banks

  • Chapter
Pioneers and Their Contributions to Software Engineering

Abstract

Future users of large data banks must be protected from having to know how the data is organized in the machine (the internal representation). A prompting service which supplies such information is not a satisfactory solution. Activities of users at terminals and most application programs should remain unaffected when the internal representation of data is changed and even when some aspects of the external representation are changed. Changes in data representation will often be needed as a result of changes in query, update, and report traffic and natural growth in the types of stored information.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Refeences

  1. Childs, D. L. Feasibility of a set-theoretical data structure —a general structure based on a reconstituted definition of relation. Proc. IFEP Cong., 1968, North Holland Pub. Co., Amsterdam, p. 162–172.

    Google Scholar 

  2. Levein, R. E., and Maron, M. E. A computer system for inference execution and data retrieval. Coram. ACM 10, 11 (Nov. 1967), 715–721.

    Article  Google Scholar 

  3. Bachman, C. W. Software for random access processing. Datamation (Apr. 1965), 36-41.

    Google Scholar 

  4. McGee, W. C. Generalized file processing. In Annual Review in Automatic Programming 6, 13, Pergamon Press, New York, 1969, pp. 77–149.

    Google Scholar 

  5. Information Management System/360, Application Description Manual H20-0524-1. IBM Corp., White Plains, N. Y., July 1968.

    Google Scholar 

  6. GIS (Generalized Information System), Application Description Manual H20-0574. IBM Corp., White Plains, N. Y., 1965.

    Google Scholar 

  7. Bleier, R. E. Treating hierarchical data structures in the SDC time-shared data management system (TDMS). Proc. ACM 22nd Nat. Conf., 1967, MDI Publications, Wayne, Pa., pp. 41–49.

    Chapter  Google Scholar 

  8. IDS Reference Manual GE 625/635, GE Inform. Sys. Div., Pheonix, Ariz., CPB 1093B, Feb. 1968.

    Google Scholar 

  9. Church, A. An Introduction to Mathematical Logic I. Princeton U. Press, Princeton, N.J., 1956.

    Google Scholar 

  10. Feldman, J. A., and Rovner, P. D. An Algol-based associative language. Stanford Artificial Intelligence Rep. AI-66, Aug. 1, 196S.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Research Laboratory, San Jose, California, USA

    E. F. Codd

Authors
  1. E. F. Codd
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität München, 80290, München, Germany

    Manfred Broy

  2. software design & management, sd&m AG, Postfach 83 08 51, 81708, München, Germany

    Ernst Denert

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Codd, E.F. (2001). A Relational Model of Data for Large Shared Data Banks. In: Broy, M., Denert, E. (eds) Pioneers and Their Contributions to Software Engineering. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48354-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-48354-7_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42290-7

  • Online ISBN: 978-3-642-48354-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation