299 views
0 votes
0 votes
Given R (ABCDE)

A-->BC,CD->E B->D E->A

CONVERT GIVEN INTO 1NF 2NF 3NF AND THEN BCNF PLEASE VERIFY :)

1 Answer

1 votes
1 votes

R(ABCDE)
A-->BC,CD->E B->D E->A
candidate keys are {A,E,CD,CB}
so partial dependency in B->D....first decomposition will be BD and ABCE
now BD is fine but in ABCE candiate key is E...so due to A->BC there is again partial dependency...
second decomposition will be of ABCE...it will be into ABC and AE..now everything is in BCNF also

final answer :- 3 decompositions are requires...BD,ABC,AE 

Related questions

0 votes
0 votes
0 answers
1
peter09 asked Apr 16
48 views
Give an appropriate tree-structure diagram for the following relational database:Employee (person_name, street, city)Works (person_name, company_name, salary)Company (com...
0 votes
0 votes
1 answer
3
phaniphani asked Nov 16, 2023
201 views
is it allowed in a B+ tree, while deletion to leave behind a key in internal nodes while deleting it from the leaf ?