A relational model of data for large shared data banks
Communications of the ACM · 1970 · 5,919 citationsOpen access
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Codd, E. F. (1970). A relational model of data for large shared data banks. Communications of the ACM, 13(6), 377–387. https://doi.org/10.1145/362384.362685
In text: (Codd, 1970)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
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. Existing noninferential, formatted data systems provide users with tree-structured files or slightly more general network models of the data. In Section 1, inadequacies of these models are discussed. 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.
Related papers
- Mining frequent patterns without candidate generation2000
- The entity-relationship model—toward a unified view of data1976
- A relational model of data for large shared data banks1983
- Mining association rules between sets of items in large databases1993
- An overview of data warehousing and OLAP technology1997
Metadata from OpenAlex (CC0). Citations are generated from the published record.