proomt

Search

Search posts, papers, and topics

Hall of Fame

Hall of FameE. F. Codd197042 min readpaperadvanced

A Relational Model of Data for Large Shared Data Banks

Read on upenn.eduHN 53·13 comments

Summary

E. F. Codd introduces the relational model for large shared data banks, proposing the use of n-ary relations and a universal data sublanguage. This model aims to provide data independence, protecting application programs from changes in internal data representation and organization.

  • The relational model describes data with its natural structure, avoiding machine-representation specific overlays.
  • It ensures data independence, decoupling application programs from internal data representation and organization changes.
  • The model addresses and removes dependencies on data ordering, indexing, and specific access paths common in prior systems.
  • It provides a sound theoretical basis for managing data derivability, redundancy, and consistency.

This paper is foundational, introducing the relational model that became the basis for nearly all modern relational database systems, fundamentally changing data management.

10/10
architecturedatabasesdata modelingrelational modeldata independence

Related reading

  1. Architecture of a Database System

    The paper surveys the internal architecture of modern relational DBMSs, describing the main components—client communications, process management, query processing, storage, and transaction management—and how they interact during a query lifecycle. It highlights design decisions such as admission control, buffer management, and concurrency control that are critical for scalability and reliability.

    Hall of Fameberkeley.edu161 minpaperHN31

  3. Relation algebra is not relational algebra

    The post clarifies the long‑standing confusion between *relation algebra* (a mathematical logic framework equivalent to FOL³) and *relational algebra* (Codd’s query language foundation). It outlines their histories, theoretical differences, and recent CS applications such as Alloy and the Prela query language, urging the community to adopt the term “Tarski’s Algebra of Relations” (TAR) to avoid m…

    Lobstersremy.wang2 minHN9lobste.rs26

  4. Article: Your Next DSL Author Is a Language Model

    Typed Domain Grounding (TDG) embeds a DSL inside a mainstream language the LLM already knows (e.g., Kotlin) and uses the host compiler as an oracle. The author describes five building blocks—embedding, choosing a host language with high training‑data frequency, compiler‑driven type safety, a generate‑compile‑repair loop, and an on‑demand teaching tool—and shows measured results from kUML, a Kotli…

    InfoQinfoq.com18 min

  6. Database Branching: A Developer's Guide to Git-Style Workflows

    Database branching uses copy‑on‑write to give developers, CI jobs, and AI agents isolated database snapshots without full copies. Branches share unchanged data, store only deltas, and are disposable, enabling production‑like testing, per‑PR isolation, safe experimentation, and rapid cleanup. Safe operation requires protecting parent branches, using mock data, TTLs, and treating migrations as the…

    Databricksdatabricks.com9 min