Part III. Relational Databases and SQL

A relational database consists of a finite set of relational tables, which are finite set-theoretic relations over elementary data types, i.e. sets of corresponding uniform tuples forming the rows of the table.

The Relational Database Model was proposed by E.F. Codd in 1970[1] and proved to be the most viable model for databases. This is mainly due to the fact that it is based on the simple mathematical-logical concept of relations (or tables) and therefore particularly well supports the storage and processing of propositional information.

[1] E.F. Codd. 1970. A Relational Model of Data for Large Shared Data Banks. Communications of the ACM, Volume 13, Number 6 (June 1970), 377-387.