oracle中dbms_DBMS中的无损分解

oracle中dbms

Lossless decomposition occurs when the natural join of the decomposition of relation R gives exactly the same result as R. Let us consider the decomposition of relation R as A, B, and C.

当关系R的分解的自然结合给出与R完全相同的结果时,就会发生无损分解 。 让我们考虑将关系R分解为ABC。

Lossless Decomposition in DBMS

Here, if R'= R, it is Lossless Decomposition.

在此, 如果R'= R,则为无损分解

无损分解规则 (Rule for Lossless Decomposition)

  1. There must be functional dependency relationship in between the attributes of the relation, i.e., if A, B, and C are the attributes of the relation R and we decompose the relation into R (A, B) and R (A, C), then A → B(B attribute depends on A attribute) and A → C(C attribute depend on A attribute). This means that the relationship is having lossless decomposition.

    关系的属性之间必须存在功能依赖关系,即,如果ABC是关系R的属性,我们将关系分解为R(A,B)和R(A,C) ,那么A→B ( B属性取决于A属性)和A→C ( C属性取决于A属性)。 这意味着该关系具有无损分解

  2. Only if the above condition holds, then after the natural join of decomposed relations of R, R (A, B) and R(A, C), the new relation obtained, R' will be equal to R. This shows that the relationship is having lossless decomposition.

    只有满足上述条件,然后在RR(A,B)和R(A,C)分解关系自然结合之后,获得的新关系R'将等于R。 这表明该关系具有无损分解

无损分解的性质 (Properties of Lossless Decomposition)

Let us consider relation as R and set of Functional Dependency on R as F.
A, B: Attributes of R.
The, decomposition is lossless if,

让我们将关系视为R并将对R的功能依赖集设为F。
A,BR的属性。
如果,分解是无损的,

  1. A ∩ B → A, which means all the attributes that are common on both A & B functionally determines all the attributes in A.

    A→B→A ,这意味着在A和B上都相同所有属性从功能上决定了A中的所有属性。

  2. A ∩ B → B, which means all the attributes that are common on both A & B functionally determine all the attributes in B.

    A→B→B ,这意味着在A和B上都相同所有属性在功能上决定了B中的所有属性。

  3. A ∩ B forms on the super key of either A or B, then also the decomposition of R is lossless.

    A∩BAB的超键上形成,那么R的分解也是无损的。

For e.g. – Table R:

例如–表R:

Lossless Decomposition in DBMS (1)

Decomposition of Relation into R (A, B) and R (A, C), we get -

将关系分解为R(A,B)和R(A,C),我们得到-

R (A, B) -

R(A,B)-

Lossless Decomposition in DBMS (2)

R (A, C) -

R(A,C)-

Lossless Decomposition in DBMS (3)

Now, Doing Natural Join of R (A, B) and R (A, C), we get -

现在,进行R(A,B)和R(A,C)的自然连接,我们得到-

Lossless Decomposition in DBMS (4)

= R'

= R'

Lossless Decomposition in DBMS (5)

Here, R' = R, this shows that relation R is Lossless Decomposition.

在这里, R'= R ,这表明关系R是无损分解

翻译自: https://www.includehelp.com/dbms/lossless-decomposition-in-dbms.aspx

oracle中dbms

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值