Edgar Frank Codd (1923-2003), known as “Ted” Codd, was a British-born computer scientist who spent most of his career at IBM. In 1970, while working at the IBM San Jose Research Laboratory, he published the paper that introduced the relational model of data, a way of organizing information as relations, or tables of rows and columns, that could be queried without the user knowing how the data was physically stored.
Codd’s central insight was that databases of the time forced programmers to navigate data through pointers and physical access paths that were tied to storage layout. He argued that data should instead be presented to users in a simple, regular structure grounded in mathematics, so that programs would not break every time the storage arrangement changed. This separation of the logical view of data from its physical storage became one of the most influential ideas in computing.
Over the following years Codd extended the model with further contributions to relational algebra, relational calculus, and the normalization of relations, the process of structuring tables to reduce redundancy and avoid update problems. His work shaped a generation of database research at IBM and elsewhere and led directly to the systems and query languages that dominate data management today.
In 1981 Codd received the ACM Turing Award, computing’s highest honor. His Turing Award lecture, “Relational Database: A Practical Foundation for Productivity,” argued that the relational approach was not only mathematically clean but also a practical foundation for improving the productivity of people who build and use data systems.