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.
Key Words and Phrases
- data bank
- data base
- data structure
- data organization
- hierarchies of data
- networks of data
- relations
- derivability
- redundancy
- consistency
- composition
- join
- retrieval language
- predicate calculus
- security
- data integrity
CR Categories
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
CHILDS, D. L. Feasibility of a set-theoretical data structure—a general structure based on a reconstituted definition of relation. Proc. IFIP Cong., 1968, North Holland Pub. Co., Amsterdam, p. 162–172.
LEVEIN, R. E., AND MARON, M. E. A computer system for inference execution and data retrieval. Comm. ACM 10, 11 (Nov. 1967), 715–721.
BACHMAN, C. W. Software for random access processing. Datamation (Apr. 1965), 36–41.
MCGEE, W. C. Generalized file processing. In Annual Review in Automatic Programming 6, 13, Pergamon Press, New York, 1969, pp. 77–149.
Information Management System/360, Application Description Manual H20–0524–1. IBM Corp., White Plains, N. Y., July 1968.
GIS (Generalized Information System), Application Description Manual H20–0574. IBM Corp., White Plains, N. Y., 1965.
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.
IDS Reference Manual GE 625/635, GE Inform. Sys. Div.,Pheonix, Ariz., CPB 1093B, Feb. 1968.
CHURCH, A. An Introduction to Mathematical Logic I. Princeton U. Press, Princeton, N.J., 1956.
FELDMAN, J. A., AND ROVNER, P. D. An Algol-based associative language. Stanford Artificial Intelligence Rep. AI-66, Aug. 1, 1968.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Codd, E.F. (2002). A Relational Model of Data for Large Shared Data Banks. In: Broy, M., Denert, E. (eds) Software Pioneers. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59412-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-59412-0_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63970-8
Online ISBN: 978-3-642-59412-0
eBook Packages: Springer Book Archive