3 votes 3 votes Let R (A, B, C, D, E, P, G) be a relational schema in which the following functional dependencies are known to hold: AB → CD, DE → P, C → E, P → C and B → G. Convert the above schema in 3NF Databases database-normalization + – JPranavc asked Nov 14, 2017 JPranavc 1.9k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments joshi_nitish commented Nov 14, 2017 reply Follow Share @hs_yadav upto 3NF decomposition, we can always get lossless and dependecy preserving decomposition, but for BCNF, it is always not possible to get lossless and dependecy preserving decomposition 0 votes 0 votes hs_yadav commented Nov 14, 2017 reply Follow Share @joshi (A,B,C,D) (B,G) (C,E) (D,E,P) above decomposition is also in 3rd NF but not having Fds preserved...then is it would be correct answer according to question? 0 votes 0 votes saxena0612 commented Nov 14, 2017 reply Follow Share I also have this doubt ! How to make sure this decomposition is lossless? 0 votes 0 votes Please log in or register to add a comment.
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 gunjan79 answered Nov 14, 2017 gunjan79 comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes 5 table are required abhishekmehta4u answered Mar 24, 2018 abhishekmehta4u comment Share Follow See 1 comment See all 1 1 comment reply Varun Raj Akula commented Mar 8, 2022 reply Follow Share @abhishekmehta4u , @gunjan79 , @joshi_nitish : Can you please confirm. How this is lossless. I have tried with combinations, but eventually giving lossy decomposition. It would be helpful for us if you provide a detailed solution. on lossless decompostion and no. of relations needed to be in 3NF. 0 votes 0 votes Please log in or register to add a comment.