Register

DBMS general

346 views
0 votes
0 votes
Decompose a relation into 3NF , BCNF, 2NF , How to get it?
User Avatar

1 Answer

0 votes
0 votes
Into 2nf: try to remove  the partial dependencies by decomposing the table.
Into 3nf: now remove the transitive dependency by decomposition

Into bcnf: now remove the overlapping candidate key by decomposition  from the 3nf table if any

If you say how to decompose then it's a long process in that case follow a standard book you will get the algorithms
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Prince Sindhiya asked Jan 18, 2019
365 views
Dbms general doubt
Is repetition allow in foreign key ? Give some reference
Is repetition allow in foreign key ?Give some reference
User Avatar
1 votes
1 votes
2 answers
2
Shivani gaikawad asked Sep 14, 2018
483 views
General doubt dbms
An instance of a relational schema R(A,B,C,D) has distinct values for attribute A then A can be 1) candidate key 2)non key 3)super key 4)none
An instance of a relational schema R(A,B,C,D) has distinct values for attribute A then A can be 1) candidate key2)non key 3)super key4)none
User Avatar
0 votes
0 votes
1 answer
3
Shukrayani asked Oct 30, 2018
360 views
General Doubt: Databases - Joins
A system where commutativity is considered different, in how many ways the join of n relations r1,r2, . . . ,rn can be taken?
A system where commutativity is considered different, in how many ways the join of n relations r1,r2, . . . ,rn canbe taken?
User Avatar
1 votes
1 votes
1 answer
4
Vikas Verma asked Oct 2, 2018
550 views
General doubt
W1(A) W2(A) Commit1 Commit2 Is a A) Concurrent Schedule B) Recoverable Schedule C) Cascadeless rollback Recoverable schedule D) Strictly recoverable schedule
W1(A) W2(A) Commit1 Commit2Is aA) Concurrent ScheduleB) Recoverable ScheduleC) Cascadeless rollback Recoverable scheduleD) Strictly recoverable schedule
User Avatar
Link Copied!