0 votes 0 votes Consider the following relation: R (ABCDEF) F = {AB → C, BC → A, AC → B, B → D, C → E} The minimum number of relations required which satisfy BCNF, lossless join decomposition and dependency preserving decomposition are ________. pream sagar asked Jan 19, 2019 pream sagar 631 views answer comment Share Follow See all 11 Comments See all 11 11 Comments reply Show 8 previous comments pream sagar commented Jan 21, 2019 reply Follow Share i think this is correct 1 votes 1 votes pream sagar commented Jan 21, 2019 reply Follow Share http://fac.ksu.edu.sa/sites/default/files/E-%20Decomposition.pdf please go through this pdf then definitely clear all point 1 votes 1 votes balchandar reddy san commented Jan 21, 2019 reply Follow Share @muthu kumar R(ABCF) with 3 FD's will be in 3-NF but not in BCNF so that's why we have to decompose it into ABC and F 1 votes 1 votes Please log in or register to add a comment.