5 votes 5 votes Determine the highest normal for relation R(A,B,C,D) AB →C BC→D Databases database-normalization partial-dependency + – Ankush Kundaliya asked Jan 17, 2017 Ankush Kundaliya 766 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply vishwa ratna commented Jan 17, 2017 i edited by vishwa ratna Jan 17, 2017 reply Follow Share 2 NF 0 votes 0 votes Ankush Kundaliya commented Jan 17, 2017 reply Follow Share BC→D is not in 3NF form as BC is not a Superkey, neither D is a prime attribute –1 votes –1 votes Devshree Dubey commented Jan 17, 2017 reply Follow Share Please can you support your answer with an explanation. It'll indeed be helpful. :) 0 votes 0 votes Please log in or register to add a comment.
Best answer 7 votes 7 votes R(A,B,C,D) {AB →C BC→D} candidate keys are={AB} AB->C..no problem here BC->D..yes problem BC is nt a superkey...so not in BCNF its a transitive dependency means non prime attribute deriving non prime attribute..hence not in 3NF also for 3NF there shouldnt be any partial dependency...which is obviously nt there..hence highest normal form possible is 2NF (please crooss verify once i have done it a bit fast) sudsho answered Jan 17, 2017 selected Jan 20, 2017 by santhoshdevulapally sudsho comment Share Follow See all 2 Comments See all 2 2 Comments reply target2017 commented Jan 25, 2017 reply Follow Share is BC partial key of Candidate Key AB? 0 votes 0 votes sudsho commented Jan 25, 2017 reply Follow Share no...A-> or B-> would have been partial keys 0 votes 0 votes Please log in or register to add a comment.