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 633 views answer comment Share Follow See all 11 Comments See all 11 11 Comments reply Deepanshu commented Jan 19, 2019 reply Follow Share i got 3 as ABC , BD,CE 0 votes 0 votes muthu kumar commented Jan 19, 2019 reply Follow Share Bro, Where is F? 0 votes 0 votes Deepanshu commented Jan 19, 2019 reply Follow Share f dont have anything here no function including so f inclusion or not dont matter 0 votes 0 votes muthu kumar commented Jan 19, 2019 reply Follow Share But lossless join property. 1 votes 1 votes Deepanshu commented Jan 19, 2019 reply Follow Share muthu kumar nice point but how we gonna derive f ? 0 votes 0 votes muthu kumar commented Jan 19, 2019 reply Follow Share I thought in this way. but confirmation needed. 0 votes 0 votes Deepanshu commented Jan 19, 2019 reply Follow Share still 3 relations na... only f added instatement nothing more na 0 votes 0 votes muthu kumar commented Jan 19, 2019 reply Follow Share Yes bro, that's what im thinking 0 votes 0 votes 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.