• edited by
4,454 views
4 4 votes

Please explain how they merged.(Modified)

2 Answers

Best answer
4 4 votes

1 table for E2
1 table for E3
1 table for (E1R E4 )
E1 has total participation with R, it needs no seperate table.
1:1 with only single side total participation we always take 1 table.


so in total 3 tables require here.

• edited by
1 1 vote
Plz check my answer:
E2{ C,D,A,B }
E3{ E,F, A, B}
E4{ G,H,A,B}

Explanation:
A has total participation in R.
So no need of seprate table.
And R has 1:M relationship with all other tables so no need to maintain seprate table for R.

Correct me if I'm wrong!
Answer:
Position:
Show:

Related questions

4 4 votes
3 answers 3 answers
4.0k
4.0k views
pC asked Jan 22, 2017
3,977 views
Consider the following Node definitions of B Tree and B+ TreeOrder P for root node between 1 to 2P keys for other nodes between P to 2P keys If disk block size is of 2048...
3 3 votes
1 answers 1 answer
1.9k
1.9k views
6 6 votes
2 answers 2 answers
3.3k
3.3k views
4 4 votes
1 answers 1 answer
1.3k
1.3k views