简体   繁体   English

为BCNF分解添加最小密钥

[英]Adding a minimal key to a BCNF decomposition

If I will add a minimal key to a given BCNF decomposition can it be no more a BCNF decomposition? 如果我将给给定的BCNF分解添加一个最小的密钥,难道就不再是BCNF分解了吗?

Formally, say I have F (group of functional dependencies), schema R and it's BCNF decomposition {R1,R2,R3,R4} and I will add another group R5 to the decomposition which is a minimal key of schema R . 正式地说,我有F (功能依赖项组),模式R及其BCNF分解{R1,R2,R3,R4} ,我将向分解添加另一个组R5 ,这是模式R的最小键。

Will the new decomposition {R1,R2,R3,R4,R5} be still a BCNF decomposition of R ? 新的分解{R1,R2,R3,R4,R5}仍然是R的BCNF分解吗?

Every minimal key is in BCNF since projection of F+ on it contains only trivial functional dependencies. 每个最小键都在BCNF中,因为F +在其上的投影仅包含琐碎的功能依赖性。 As observed, eg, by Koehler, any dependency preserving BCNF decomposition can be made into lossless by adding a table representing a minimal key. 如Koehler所观察到的,通过添加代表最小密钥的表,可以将任何保留BCNF分解的依赖项变为无损。 The resulting decomposition is still dependency preserving. 最终的分解仍然是依赖关系保留。

Henning Köhler: Finding Faithful Boyce-Codd Normal Form Decompositions. HenningKöhler:查找忠实的Boyce-Codd范式分解。 AAIM 2006: 102-113 AAIM 2006:102-113

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM