Relational Completeness of Data Base Sublanguages

  title={Relational Completeness of Data Base Sublanguages},
  author={E. F. Codd},
  journal={IBM Research Report},
In the near future, we can expect a great variety of languages to be proposed for interrogating and updating data bases. This paper attempts to provide a theoretical basis which may be used to determine how complete a selection capability is provided in a proposed data sublanguage independently of any host language in which the sublanguage may be embedded. A relational algebra and a relational calculus are defined. Then, an algorithm is presented for reducing an arbitrary relation-defining… CONTINUE READING
Highly Influential
This paper has highly influenced 52 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS


Publications citing this paper.


Publications referenced by this paper.

Similar Papers

Loading similar papers…