A Relational Model of Data for Large Shared Data Banks

M.D. Computing

Volumn 15, Issue 3, 1998, Pages 162-166

  Codd, E F ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; COMPUTER INTERFACE; COMPUTER LANGUAGE; DATA BASE; FACTUAL DATABASE; HISTORY; THEORETICAL MODEL;

DATABASES; DATABASES, FACTUAL; HISTORY, 20TH CENTURY; MODELS, THEORETICAL; PROGRAMMING LANGUAGES; USER-COMPUTER INTERFACE;

EID: 0348203675     PISSN: 07246811     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. Childs D.L. Feasibility of a set-theoretical data structure - a general structure based on a reconstituted definition of relation. Proc IFIP Cong, North Holland Pub. Co., Amsterdam, 1968, p. 162-172.
2. Levein, R.E., and Maron, M.E. A computer system for inference execution and data retrieval. Comm. ACM 10, 11 (Nov. 1967), 715-721.
3. Bachman, C.W. Software for random access processing Datamation (Apr. 1965), 36-41.
4. McGee, W.C. Generalized file processing. In Annual Review in Automatic Programming 5, 13, Pergamon Press, New York, 1969, pp. 77-149.
5. Information Management System/ 360, Application Description Manual H20-0524-1. IBM Corp., White Plains, N. Y., July 1968.
6. GIS (Generalized Information System), Application Description Manual H20-0574. IBM Corp., White Plains, N. Y., 1965.
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-9.
8. Church, A. An Introduction to Mathematical Logic I. Princeton U. Press, Princeton, N.J., 1956.