A relational model of data for large shared data banks

@article{Codd1970ARM,
  title={A relational model of data for large shared data banks},
  author={E. F. Codd},
  journal={M.D. computing : computers in medical practice},
  year={1970},
  volume={15 3},
  pages={
          162-6
        }
}
  • E. Codd
  • Published 1970
  • Computer Science
  • M.D. computing : computers in medical practice
Future users of large data banks must be protected from having to know how the data is organized in the machine (the internal representation. [] Key Method A model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced. In Section 2, certain operations on relations (other than logical inference) are discussed and applied to the problems of redundancy and consistency in the user's model.

Figures from this paper

Another look at data-bases
TLDR
In an attempt to clarify the concept of database, the definition is an oversimplification, as any definition of such a fuzzy concept must be; it will emphasize certain characteristics of databases, at the expense of other, equally important, properties.
A Formal Representation for Structured Data
TLDR
A formalism, by which, structured data can be considered as a directly generalized model of relational databases, is described, which proves that many concepts and results of relational database management can be transferred to structured data, accordingly to this generalization.
The relational data management system: A perspective
TLDR
The functional capabilities and economic features of the Relational Data Management System (RDMS) are discussed and the basic concepts of RDMS are introduced and the similarities between the conventional file concept and the relation concept are discussed.
Toward logical data independence: a relational query language without relations
TLDR
The goal is a powerful, yet concise, query language with natural semantics, where a user need not be concerned with how the data has been partitioned into various relations in a relational database.
A database query language for operations on historical data
TLDR
A historical model is presented which integrates comprehensive time pro­ cessing capabilities into the relational model, an alge­ bra for historical relations is defined, and HQL, the Historical Query Language, is defined and implemented.
A Polygen Data Model for data source tagging in Composite Information Systems
TLDR
A Polygen Data Model (PDM) has been developed and the strong and weak conditions for accurately tagging data in PDM are established, and a polygen query processor is being implemented to tag data sources upon request of an end-user.
An approach for a working relational data system
TLDR
This paper proposes a system which acts as an interface between a user or an applications program, and a data base which consists of multiple files of differing types, and presents a standard view of data that is highly independent of its machine representation.
Programming languages for relational database systems
TLDR
The authors' discussion is divided into four areas: type system, data base operations, compilation, and abstraction, which considers the integration of data base objects and operations into a programming language.
Robust data profiling and schema design for incomplete relational databases
TLDR
A new approach is established for the design of incomplete relational databases that is robust under different interpretations of missing values, and only depends on the complete fragments of an incomplete database, and introduces the classes of embedded uniqueness constraints and embedded functional dependencies that enable users to declare completeness and integrity requirements of a given application within a single framework.
Comparative analysis of PropertyFirst vs. EntityFirst modeling approaches in graph databases
TLDR
This chapter discusses graph databases as a model for relational databases, and some examples show how the model changed over time from simple to complex to Relational.
...
...

References

SHOWING 1-10 OF 19 REFERENCES
Treating hierarchical data structures in the SDC Time-Shared Data Management System (TDMS)
TLDR
This paper describes how a method has been devised for maintaining hierarchical associations within logical entries of a data base within the Time-Shared Data Management System (TDMS), and permits the automatic association of related data through a device known as a repeating group.
Feasibility of a set-theoretic data structure. A general structure based on a reconstituted definition of relation
  • D. Childs
  • Computer Science, Mathematics
    IFIP Congress
  • 1968
TLDR
These problems are resolved in this paper with the introduction of the concept of a 'complex' which has an additional feature of allowing a natural extension of properties of binary relations to properties of general relations.
A computer system for inference execution and data retrieval
This paper presents a RAND project concerned with the use of computers as assistants in the logical analysis of large collections of factual data. A system called the Relational Data File was
An ALGOL-based associative language
TLDR
A high level programming language for large, complex associative structures has been designed and implemented using a hash-coding technique and the discussion includes a comparison with other work and examples of applications.
GE 625/G35, GE Inform
  • Sys. Div., Pheonix, Ariz., CPB 1093B, Feb.
  • 1968
GE 625/635, GE Inform
  • Sys. Div., Pheonix, Ariz., CPB 1093B, Feb.
  • 1968
Generalized file processing
Generalized file processing Information Management System/360, Application Description Manual H20-0524-1
  • Annual Review in Automatic Programming 6
  • 1968
IDS Reference Manual GE 625
  • IDS Reference Manual GE 625
  • 1968
Information Management System/360, Application Description Manual H20-0524-1
  • Information Management System/360, Application Description Manual H20-0524-1
...
...