World Library  
Flag as Inappropriate
Email this Article
 

Edgar F. Codd

Edgar "Ted" Codd
Born Edgar Frank Codd
(1923-08-19)19 August 1923[1][2]
Isle of Portland, England
Died 18 April 2003(2003-04-18) (aged 79)
Williams Island, Aventura, Florida, USA
Fields Computer Science
Institutions University of Oxford
University of Michigan
IBM
Alma mater Exeter College, Oxford
University of Michigan
Thesis Propagation, Computation, and Construction in Two-dimensional cellular spaces (1965)
Doctoral advisor John Henry Holland[3]
Known for OLAP
Relational model[4]
Codd's cellular automaton
Codd's 12 rules
Boyce–Codd normal form
Notable awards Turing Award (1981)[5]

Edgar Frank "Ted" Codd (19 August 1923 – 18 April 2003) was an English computer scientist who, while working for IBM, invented the relational model for database management, the theoretical basis for relational databases. He made other valuable contributions to computer science, but the relational model, a very influential general theory of data management, remains his most mentioned achievement.[6][7]

Contents

  • Biography 1
  • Work 2
  • Publications 3
  • See also 4
  • References 5
  • Further reading 6
  • External links 7

Biography

Edgar Frank Codd was born on the Isle of Portland in England. After attending Poole Grammar School, he studied mathematics and chemistry at Exeter College, Oxford, before serving as a pilot in the RAF Coastal Command during the Second World War, flying Sunderlands.[8] In 1948, he moved to New York to work for IBM as a mathematical programmer. In 1953, angered by Senator Joseph McCarthy, Codd moved to Ottawa, Canada. A decade later he returned to the US and received his doctorate in computer science from the University of Michigan in Ann Arbor. Two years later he moved to San Jose, California, to work at IBM's San Jose Research Laboratory, where he continued to work until the 1980s.[1][9] He was appointed IBM Fellow in 1976. During the 1990s, his health deteriorated and he ceased work.[10]

Codd received the Turing Award in 1981,[1] and in 1994 he was inducted as a Fellow of the Association for Computing Machinery.[11]

Codd died of heart failure at his home in Williams Island, Florida, at the age of 79 on 18 April 2003.[12]

Work

Codd received a PhD in 1965 from the University of Michigan, Ann Arbor advised by John Henry Holland.[13][3][10] His thesis was about self-replication in cellular automata, extending on work of von Neumann and showing that a set of eight states was sufficient for universal computation and construction.[14] His design for a self-replicating computer was only implemented in 2010.

In the 1960s and 1970s he worked out his theories of data arrangement, issuing his paper "A Relational Model of Data for Large Shared Data Banks"[4] in 1970, after an internal IBM paper one year earlier.[15] To his disappointment, IBM proved slow to exploit his suggestions until commercial rivals started implementing them.

Initially, IBM refused to implement the relational model to preserve revenue from IMS/DB. Codd then showed IBM customers the potential of the implementation of its model, and they in turn pressured IBM. Then IBM included in its Future Systems project a System R subproject – but put in charge of it developers who were not thoroughly familiar with Codd's ideas, and isolated the team from Codd. As a result, they did not use Codd's own Alpha language but created a non-relational one, SEQUEL. Even so, SEQUEL was so superior to pre-relational systems that it was copied, in 1979, based on pre-launch papers presented at conferences, by Larry Ellison, of Relational software Inc, in his Oracle Database, which actually reached market before SQL/DS – because of the then-already proprietary status of the original name, SEQUEL had been renamed SQL.

Codd continued to develop and extend his relational model, sometimes in collaboration with Christopher J. Date. One of the normalised forms, the Boyce–Codd normal form, is named after him.

Codd's theorem, a result proven in his seminal work on the relational model, equates the expressive power of relational algebra and relational calculus (both of which, lacking recursion, are strictly less powerful than first-order logic).

As the relational model started to become fashionable in the early 1980s, Codd fought a sometimes bitter campaign to prevent the term being misused by database vendors who had merely added a relational veneer to older technology. As part of this campaign, he published his 12 rules to define what constituted a relational database. This made his position in IBM increasingly difficult, so he left to form his own consulting company with Chris Date and others.

Codd coined the term Online analytical processing (OLAP) and wrote the "twelve laws of online analytical processing".[16] Controversy erupted, however, after it was discovered that this paper had been sponsored by Arbor Software (subsequently Hyperion, now acquired by Oracle), a conflict of interest that had not been disclosed, and ComputerWorld withdrew the paper.[17]

In 2004, SIGMOD renamed its highest prize to the SIGMOD Edgar F. Codd Innovations Award, in his honour.

Publications

See also

References

  1. ^ a b c
  2. ^
  3. ^ a b Edgar F. Codd at the Mathematics Genealogy Project
  4. ^ a b
  5. ^
  6. ^ Edgar F. Codd's publications indexed by the DBLP Bibliography Server at the University of Trier
  7. ^ Edgar F. Codd from the Association for Computing Machinery (ACM) Digital Library
  8. ^
  9. ^ Rubenstein, Steve. "Edgar F. Codd – computer pioneer in databases." San Francisco Chronicle 24 April 2003: A21. Gale Biography in Context. Web. 1 December 2011.
  10. ^ a b
  11. ^ ACM Fellows
  12. ^ Edgar F Codd Passes Away, IBM Research, 2003 Apr 23.
  13. ^
  14. ^
  15. ^ Michael Owens. The Definitive Guide to SQLite, p.47. New York: Apress (Springer-Verlag) 2006. ISBN 978-1-59059-673-9.
  16. ^ Providing OLAP to User-Analysts: An IT Mandate by E F Codd, S B Codd and C T Salley, ComputerWorld, 26 July 1993.
  17. ^

Further reading

External links

  • Quotations related to E. F. Codd at Wikiquote
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.