Warning: file_get_contents(/data/phpspider/zhask/data//catemap/5/fortran/2.json): failed to open stream: No such file or directory in /data/phpspider/zhask/libs/function.php on line 167

Warning: Invalid argument supplied for foreach() in /data/phpspider/zhask/libs/tag.function.php on line 1116

Notice: Undefined index: in /data/phpspider/zhask/libs/function.php on line 180

Warning: array_chunk() expects parameter 1 to be array, null given in /data/phpspider/zhask/libs/function.php on line 181
Database 函数依赖关系和标准形式-数据库_Database_Functional Dependencies - Fatal编程技术网

Database 函数依赖关系和标准形式-数据库

Database 函数依赖关系和标准形式-数据库,database,functional-dependencies,Database,Functional Dependencies,在这里,我问了两个关于函数关系和范式的问题,还有一些后续问题,我找不到答案 1. On the relation scheme R(A, B, C, D, E, F) on which following functional dependencies are being applied: F = {ABC →D, CE→B, E→C, BF→AC, E→F, F→E}. • Find (AB)+, (CD)+,(EF)+ • Find all candidate keys. • Fin

在这里,我问了两个关于函数关系和范式的问题,还有一些后续问题,我找不到答案

1. On the relation scheme R(A, B, C, D, E, F) on which following 
functional dependencies are being applied:
F = {ABC →D, CE→B, E→C, BF→AC, E→F, F→E}. 
• Find (AB)+, (CD)+,(EF)+ 
• Find all candidate keys. 
• Find all function dependencies which cause this relation not to be at BCNF. 
(AB)+=AB | (CD)+=CD | (EF)+=EFCBAD

Find all candidate keys
(AB)+=AB     | (BF)+=BFECAD
(AC)+=AC     | (CE)+=CEBFAD
(AE)+=AECFBD | (CF)+=CFEBAD
(AF)+=AFECBD | (EF)+=EFCBAD
(BC)+=BC     | **(E)+=EFCBAD**
(BE)+=BECFAD | **(F)+=FECBAD**
Candidate keys are: E and F
Prime attributes are: E and F
Non-prime attributes are: A, B, C, D
Other Keys that functionally determines relation scheme R are not 
candidate keys because they don’t fulfill "minimality" rule!
第二

问题: 1) 我写的这些都对吗

2) 在第一个问题中,有许多键由两个元素组成,但它们不是候选键,因为“最小”规则不适用于它们。我说的对吗

3) 如果键的一部分是非素数,而另一部分是素数元素,并且该键在功能上决定了其他一些非素数元素,该怎么办。这个关系是第三范式吗

4) 若键(素元素)的候选部分在功能上决定了另一个素元素,那个么该关系是否处于第二范式

5) 如果有许多具有“最小化”特征的密钥,并且它们是候选密钥,那么它们是否都作为候选密钥应用(例如10个候选密钥)


6) 在这里的第二个问题中,F元素并没有用于任何函数依赖项,但它是关系模式的一部分。我是否遗漏了元素F,或者元素F必须是候选键(也是prime属性/元素)的一部分?

1。请解释您在“查找所有候选密钥”中的操作。2.您的3)和4)无法理解,请编辑以清楚显示。3.请每个问题只发布一个问题。你已经得到了定义和算法。跟着他们。不要担心你看到的任何其他财产或东西。定义和算法已经考虑了一切。根据定义,CK是一个不包含较小(超级)键的(超级)键。时期这个定义是不是说有多少?第6)CK的定义是什么?你是怎么被告知要找到他们的?照我说的做就行了。
2. On the relation scheme R = (A, B, C, D, E, F G, H) on which following 
functional dependencies are being applied:

F= {A →E, GH → C, DB → H, BG → A, C → D, G → H, H → B, AE → G} 
• Find (A)+ and (DBG)+ 
• Does G →B applies from fd F 
• Find all candidate keys. 
• In which normal form is following relations scheme? 
(AB)+=AB| (CD)+=CD | (EF)+=EFCBAD

Find all candidate keys:

**(A)+=AEGHBCD** | (B)+=B | (C)+=CD | (D)+=D | (E)+=E | (F)+=F | **(G)+=GHBCDAE** | 
(H)+=HB

Candidate keys are: A and G
Other Keys that functionally determines relation scheme R are not
candidate keys because they don’t fulfil minimality rule!
Prime elements are: A and G
Non prime elements are: B, C, D, E, H
1NF – yes
2NF – yes, because there are no partial key dependencies
3NF – no, because ABC ->D (functional dependency between 2 non-prime elements).
BCNF – no, because it is not in 3NF