3 3 votes Consider the following relational schema $R(ABCDEFG)$ with $FD$ set $\{AB → C, BC → A, AC → B, B → D, D → E\}$. The minimum relations required to decompose $R$ into $BCNF$ which satisfy lossless join and dependency preserving decomposition is ________. Databases databases database-normalization + – Na462 954 views answer comment Share Follow Print See all 5 Comments 5 5 Comments reply Show 2 previous comments Shubhanshu commented May 27, 2018 reply Follow flag I did a mistake, the answer should be 4 only, and their explanation is correct. In my previous comment relation R1(ABCFG) isn't in BCNF. because the keys are {ABFG, BCFG, ACFG} and FDs doesn't satisfy the BCNF condition. So as per the FDs a new relation is required that could be either (ABFG) or (BCFG) or (ACFG). So, the relations are ABC, ABFG, BD, DE. 3 3 replyShare Na462 commented May 27, 2018 reply Follow flag Ohh yes got it 1 1 replyShare rajatmyname commented Mar 7, 2019 reply Follow flag Can you please post the solution explaining in a detailed manner? I am not getting it 0 0 replyShare Please log in or register to add a comment.
