Skip to content
A Relational Model of Data for Large Shared Data Banks 3 min

E. F. Codd · Communications of the ACM 1970

A Relational Model of Data for Large Shared Data Banks

The 1970 paper that gave us tables, keys and joins. See why data independence and normalization still matter, and try moving an office in one table versus two.

Read the original paper

Databases · White Belt · Pro · 3 min read

A Relational Model of Data for Large Shared Data Banks

Picture a company's records in 1969. Data lives in files and in clever linked structures. A program that asks "who works in Sales?" does not just ask. It follows a chain of pointers from a department record, to its first employee, then to the next, and so on. If anyone reorganizes the storage, the program breaks.

In 1970, Edgar F. Codd of IBM published a short paper that changed that. His proposal: store data as simple tables, called relations, and let users ask for data by what it is, not by where it is stored. This is the idea behind SQL and every relational database since.

Describe data as relations (tables of rows with named columns), connect them by matching values, and give users a high-level way to ask questions. That separates what data means from how it is stored, a property Codd calls data independence.

The problem: programs welded to storage

Codd lists three ways that programs of his day depended on how data was arranged:

  • Ordering dependence. A program assumes records are stored in a certain order. If the order changes, it gives wrong answers.
  • Indexing dependence. A program uses a particular index to be fast. Remove the index and it breaks.
  • Access path dependence. A program walks a tree or network of links. If the structure changes, the program must be rewritten.

Each of these made it expensive to improve a database. Every storage change meant touching every program that used it.

Older systems made programs walk fixed pointer paths through the data. Codd proposed plain tables, linked only by matching values, so programs would not depend on how the data is stored.

Keep reading with Pro

This paper is part of Pro. Pro and Architect open the full breakdown, with animated diagrams, interactive elements you can play with and a quiz. A few papers stay free to read in full.

Still to read

3 more sections, 1 more diagram and 2 interactive elements to play with

  • The relational idea
  • Normal form: storing each fact once
  • Why it still matters

Found this breakdown useful?

Share it with someone else wrestling with this paper.

Discussion0

Join the Discussion

Sign in to leave comments, reply to others, or like insights.

Sign In to ScaleDojo

No comments yet. Be the first to start the thread!

Enjoyed this? Get more like it.

New paper breakdowns, levels, and one concept worth knowing, straight to your inbox.

No spam, ever. Unsubscribe in one click.

Enjoyed this content?

Your support keeps us creating free resources

We put a lot of hours into researching and writing these guides. If it helped you, consider buying us a coffee. Every bit goes toward keeping ScaleDojo's content free and growing.

$

One-time payment via Stripe. ScaleDojo account required.