关系型数据库由哪三部分组成_关系数据库| 第2部分

关系型数据库由哪三部分组成

关系数据库理论 (Theory of relational databases)

The foundations of the theory of relational database were laid by Edgar F. Codd in the 1960s and 1970s and in his work A Relational Model of Data for Large Shared Data Banks [described one]. Theoretically, all operations are based on the relational algebra.

关系数据库理论的基础由埃德加·科德(Edgar F. Codd)在1960年代和1970年代及其著作《大型共享数据库的数据关系模型》 [已描述]中奠定。 从理论上讲，所有运算都基于关系代数。

了解关系代数 (Understanding the relational algebra)

The relational algebra is an algebraic model that describes how data can be stored, queried and manipulated. The main operations from which all other are derived, are the following:

关系代数是一个代数模型，描述了如何存储，查询和操纵数据。 其他所有派生的主要操作如下：

• Projection (English projection)
  投影(英文投影)
• Selection (English selection)
  选择(英文选择)
• Cross product or Cartesian Product (Data Sheet cross product, cross join or cartesian product)
  叉积或笛卡尔积(数据表叉积，叉联接或笛卡尔积)
• Changes (English rename)
  更改(英文重命名)
• Association (English union)
  协会(英国工会)
• Difference (English set difference or minus)
  差异(英文设置的差异或减号)

All requests that are made using SQL on a relational database, the database management system shown on these operators, that is translated. In practice, there are other operators, such as the join operator, but is also only a combination of cross product, selection and projection.

使用关系数据库上SQL进行的所有请求(这些运算符上显示的数据库管理系统)均已翻译。 实际上，还有其他运算符，例如join运算符，但也只是叉积，选择和投影的组合。

关系代数的限制 (Restrictions on the relational algebra)

The relational algebra does not provide support for calculation of recursive queries (Transitive Closure