A Relational Model of Data for Large Shared Data Banks.

Codd, E. F. (1970). A Relational Model of Data for Large Shared Data Banks. ACM, 13(6), 377-387.

Type

Journal article

Intellectual base

Primary research

Year

1970

DOI

10.1145/362384.362685

Link

https://doi.org/10.1145/362384.362685

Cited from

computer_science, engineering_design, information_theory, literature_literary_theory, mathematics, physics, statistics_experimental_design, systems_cybernetics

Cited by

15 citations across 15 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Compression

  • This sourceFounds the relational data model. Tier C (bibliography only). DOI verified.

• Data Integrity

  • This sourceIntroduces the relational model and the notion of declared integrity constraints over relations. Bibliography-only after re-sourcing (removed from D30-111). Existence-verified and linked. NON-SUPPORTING for its former marker: the relational-model paper does not address the 'layered protection (network + application + storage + organizational controls)' claim it was attached to; defense-in-depth/layering was re-sourced to Saltzer & Schroeder 1975.

• Denormalization
  • The prime is the trade: one accepts a synchronization burden, in which every duplicated fact must be kept in sync as the underlying truth changes

    This sourceFoundational paper introducing the relational model and normalization, defining the canonical form against which denormalization re-introduces controlled redundancy.

• Discrete vs. Continuous (Quantization)

  • This sourceFounds the relational data model over discrete n-ary relations. Bibliography-only entry.

• Entropy (Thermodynamic Sense)

  • This sourceIntroduces the relational data model. Bibliography-only; not cited in the body and unrelated to entropy — likely a residual template entry.

• Fabula And Syuzhet
  • The pattern instantiates the broader underlying-versus-presented duality: logical schema versus physical schema, abstract syntax tree versus source text, model versus view, semantics versus surface form, signal versus encoding.

    This sourceEstablishes the logical schema as independent of physical storage/views — the schema-versus-view instance of the underlying-versus-presented separation.

• Measurement Uncertainty and Observational Noise
  • Listed in the references but not attached to a specific claim.
• Multiplexing
  • Listed in the references but not attached to a specific claim.
• Projection
  • In databases the select operation is literally called projection in relational algebra — drop the columns not in the target, keep the rows.

    This sourceDefines the relational model whose projection operation drops attributes not in the target.

• Redundancy
  • Listed in the references but not attached to a specific claim.
• Relation
  • Arity is part of the relation's identity; changing it produces a different relation
• Set and Membership
  • In predicate logic, sets are the extensions of predicates and the domains of quantification: every formula "for all x in S, P(x)" presumes a set S. In relational databases
• Signal Decay and Fadeout
  • Listed in the references but not attached to a specific claim.
• Transaction
  • Listed in the references but not attached to a specific claim.

Domain-specific

• Data Model
  • Codd's relational model introduced relations, operations, and integrity concerns while separating logical representation from machine organization.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:2ac7b29ada60 · see in the full table