2 votes 2 votes $R (A,B,C,D)$ is a relation. Which of the following does not have a lossless join dependency preserving BCNF decomposition $A \rightarrow B, \ B \rightarrow CD$ $A \rightarrow B, \ B \rightarrow C, \ C \rightarrow D$ $AB \rightarrow C,\ C \rightarrow AD$ $A \rightarrow BCD$ Databases tbb-dbms-1 + – Bikram asked Nov 26, 2016 • edited Aug 22, 2019 by go_editor Bikram 448 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Sheshang commented Dec 14, 2016 reply Follow Share without decomposed relations given, how can we assume that which decomposition will be preserving decompo? and even in blind case we can say that option D always preserves dependency as it is in original form, no more than one relation in decomposition than how it could not preserve lossless join dependency? 0 votes 0 votes Arjun commented Dec 15, 2016 reply Follow Share We have to see if a possible decomposition is there - and yes, answer is C and not D. https://gateoverflow.in/741/gate2001-2-23 3 votes 3 votes Please log in or register to add a comment.
0 votes 0 votes All are dependency preserving and lossless. But in Option C {A,B} is the only candidate key, hence A and B are prime attributes. $C\rightarrow AD$ would be illegal as C isn't a superkey. Hence Option C won't be BCNF. JashanArora answered Dec 26, 2019 JashanArora comment Share Follow See all 0 reply Please log in or register to add a comment.