Scribd
Upload
59 views

Inference Rules - Problems

1) The document provides examples of inference rules problems involving functional dependencies. It shows the steps to prove different functional dependencies based on given dependencies. 2) It also explains the stages of database normalization including 1NF, 2NF, 3NF and BCNF and provides examples of converting a schema from one normal form to another by removing functional dependencies and moving attributes to new relations. 3) Finally, it gives an example of relations in 3NF form after normalization.

Uploaded by

Amish Shrivastava
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
59 views

Inference Rules - Problems

1) The document provides examples of inference rules problems involving functional dependencies. It shows the steps to prove different functional dependencies based on given dependencies. 2) It also explains the stages of database normalization including 1NF, 2NF, 3NF and BCNF and provides examples of converting a schema from one normal form to another by removing functional dependencies and moving attributes to new relations. 3) Finally, it gives an example of relations in 3NF form after normalization.

Uploaded by

Amish Shrivastava
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 22

Inference Rules - Problems

1) W -> Y, X -> Z , prove WX->Y

W->Y
WX->XY
….
2) X->Y , Z is a subset of Y then prove X->Z
3) X->Y, Z->W , prove XZ->YW

Z->W
XZ->XW
XZ->W---------(1)
X->Y
XZ->ZY
XZ->Y-----------(2)
4) Consider a relation schema R with attributes
A,B,C,D,E,F and FD
A->BC
B->E
CD->EF
prove that functional dependency
AD->F in R
A->BC
A->C
AD->CD------(1)
CD->EF-------(2)
AD->EF
AD->F
5) X->Y, Y->Z prove X->YZ

Y->Z
YY->YZ
Y->YZ----(1)
X->Y------(2)
6) X->Y, Z->W prove XZ->YW
X->Y
XZ->YZ----------(1)
Z->W
YZ->YW---------(2)
7) X->Y, XY->Z prove X->Z
i) X->Y, X->W, WY->Z prove X->Z
ii) XY->Z, Y->W prove XW->Z
iii) X->Z, Y->Z prove X->Y
iv) XY->Z, Z->X prove Z->Y
v) XY->Z, Z->W prove X->W
Is B->G in F+ where
R={ A,B,C,D,E,F,G} and
F={ B->CD,
E->F
D->E
B->A
AD->B
F->G } using the algorithm compute B+ and
check if it contains G.
B+= B
BCD
BCDE
BCDEF
BCDEFG
R={V,W,X,Y,Z}
F={ W->XY
Y->V
Z->V
X->V }
compute X+ then determine
a) X is a key of R?
b) X ->VZ holds in R
Stages of Normalisation
Unnormalised
(UDF)
Remove repeating groups
First normal form
(1NF)
Remove partial dependencies
Second normal form
(2NF)
Remove transitive dependencies
Third normal form
(3NF)
Remove remaining functional
dependency anomalies
Boyce-Codd normal
form (BCNF)
Remove multivalued dependencies
Fourth normal form
(4NF)
Remove remaining anomalies
Fifth normal form
(5NF)
Unnormalised Normal Form (UNF)
ORDER
Customer No: 001964 Order Number: 00012345
Name: Mark Campbell Order Date: 14-Feb-2002
Address: 1 The House
Leytonstone
E11 9ZZ

Product Product Unit Order Line


Number Description Price Quantity Total
T5060 Hook 5.00 5 25.00
PT42 Bolt 2.50 10 20.50
QZE48 Spanner 20.00 1 20.00

Order Total: 65.50

ORDER (order-no, order-date, cust-no, cust-name, cust-add,


(prod-no, prod-desc, unit-price, ord-qty, line-total)*, order-total
First Normal Form (1NF)
Definition: A relation is in 1NF if, and only if, all its underlying
attributes contain atomic values only.
Remove repeating groups into a new relation

A repeating group is shown by a pair of brackets within the relational schema.

ORDER (order-no, order-date, cust-no, cust-name, cust-add,


(prod-no, prod-desc, unit-price, ord-qty, line-total)*, order-total

Steps from UNF to 1NF:


 Remove the outermost repeating group (and any nested repeated
groups it may contain) and create a new relation to contain it.
 Add to this relation a copy of the PK of the relation immediately
enclosing it.
 Name the new entity (appending the number 1 to indicate 1NF)
 Determine the PK of the new entity
 Repeat steps until no more repeating groups.
Example - UNF to 1NF
ORDER (order-no, order-date, cust-no, cust-name, cust-add,
(prod-no, prod-desc, unit-price, ord-qty, line-total)*, order-total

1. Remove the outermost repeating group (and any nested repeated groups it may
contain) and create a new relation to contain it. (rename original to indicate 1NF)
ORDER-1 (order-no, order-date, cust-no, cust-name, cust-add, order-total
(prod-no, prod-desc, unit-price, ord-qty, line-total)
2. Add to this relation a copy of the PK of the relation immediately enclosing it.
ORDER-1 (order-no, order-date, cust-no, cust-name, cust-add, order-total
(order-no, prod-no, prod-desc, unit-price, ord-qty, line-total)
3. Name the new entity (appending the number 1 to indicate 1NF)
ORDER-LINE-1 (order-no, prod-no, prod-desc, unit-price, ord-qty, line-total)
4. Determine the PK of the new entity
ORDER-LINE-1 (order-no, prod-no, prod-desc, unit-price, ord-qty, line-total)
Second Normal Form (2NF)
Definition: A relation is in 2NF if, and only if, it is in 1NF and every
non-key attribute is fully dependent on the primary key.
Remove partial functional dependencies into a new relation

Steps from 1NF to 2NF:


 Remove the offending attributes that are only partially functionally
dependent on the composite key, and place them in a new relation.
 Add to this relation a copy of the attribute(s) which are the
determinants of these offending attributes. These will automatically
become the primary key of this new relation.
 Name the new entity (appending the number 2 to indicate 2NF)
 Rename the original entity (ending with a 2 to indicate 2NF)
Example - 1NF to 2NF
ORDER-LINE-1 (order-no, prod-no, prod-desc, unit-price, ord-qty, line-total)
1. Remove the offending attributes that are only partially functionally dependent
on the composite key, and place them in a new relation.
ORDER-LINE-1 (order-no, prod-no, ord-qty, line-total)

(prod-desc, unit-price)
2. Add to this relation a copy of the attribute(s) which determines these offending
attributes. These will automatically become the primary key of this new relation..
ORDER-LINE-1 (order-no, prod-no, ord-qty, line-total)
(prod-no, prod-desc, unit-price)
3. Name the new entity (appending the number 2 to indicate 2NF)
PRODUCT-2 (prod-no, prod-desc, unit-price)
4. Rename the original entity (ending with a 2 to indicate 2NF)
ORDER-LINE-2 (order-no, prod-no, ord-qty, line-total)
Third Normal Form (3NF)
Definition: A relation is in 3NF if, and only if, it is in 2NF and every
non-key attribute is non-transitively dependent on the primary key.
Remove transitive dependencies into a new relation

Steps from 2NF to 3NF:


 Remove the offending attributes that are transitively dependent on
non-key attribute(s), and place them in a new relation.
 Add to this relation a copy of the attribute(s) which are the
determinants of these offending attributes. These will automatically
become the primary key of this new relation.
 Name the new entity (appending the number 3 to indicate 3NF)
 Rename the original entity (ending with a 3 to indicate 3NF)
Example - 2NF to 3NF
ORDER-2 (order-no, order-date, cust-no, cust-name, cust-add, order-total
1. Remove the offending attributes that are transitively dependent on non-key
attributes, and place them in a new relation.
ORDER-2 (order-no, order-date, cust-no, order-total

(cust-name, cust-add )
2. Add to this relation a copy of the attribute(s) which determines these offending
attributes. These will automatically become the primary key of this new relation..
ORDER-2 (order-no, order-date, cust-no, order-total

(cust-no, cust-name, cust-add )


3. Name the new entity (appending the number 3 to indicate 3NF)
CUSTOMER-3 (cust-no, cust-name, cust-add )
4. Rename the original entity (ending with a 3 to indicate 3NF)
ORDER-3 (order-no, order-date, cust-no, order-total
Example - Relations in 3NF

ORDER-3 (order-no, order-date, cust-no, order-total

CUSTOMER-3 (cust-no, cust-name, cust-add )

PRODUCT-2 (prod-no, prod-desc, unit-price)

ORDER-LINE-2 (order-no, prod-no, ord-qty, line-total)

order-no prod-no
ORDER PRODUCT

places placed by contains shows


belongs to
cust-no part of order-no, prod-no
CUSTOMER ORDER-LINE

You might also like