1,866 views
3 votes
3 votes
Let R (A, B, C, D, E, P, G) be a relational schema in which the following functional depen­dencies are known to hold: AB → CD, DE → P, C → E, P → C and B → G.

Convert the above schema in 3NF

2 Answers

2 votes
2 votes

This DATA is from GATE 2006

And

The minimal cover is { A,B-->C; A,B-->D; D,E-->P; C-->E; P-->C; B-->G }

We can decompose into 3NF Schemas in 5 relations as below:

  • Relation 1 is C,E
  • Relation 2 is P,C
  • Relation 3 is B,G
  • Relation 4 is A,B,C,D
  • Relation 5 is D,E,P
1 votes
1 votes

5 table are required

Related questions

2 votes
2 votes
1 answer
2
0 votes
0 votes
0 answers
3
Varun Raj Akula asked Mar 12, 2022
388 views
Can anyone please explain about Statement 4 ? I know that transitive dependencies are allowed in 3NF as long as RHS is Prime Attribute. But, what is intransitive dependen...