• edited by
4,314 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
3.9k
3.9k views
pC asked Jan 22, 2017
3,896 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...
5 5 votes
1 1 answer
1.6k
1.6k views
vk_9_1_9 asked Jan 26, 2019
1,637 views
Find minimum number of tables needed?Answer : (3)Can anyone please explain the answer and how to approach such complex er diagrams?
3 3 votes
0 0 answers
1.3k
1.3k views
MiNiPanda asked Jan 18, 2019
1,344 views
Consider the following ER diagram:How many number of relations are required for the above ER diagram?2351Solution:My doubt is:Since $E_2$ isn’t involved in total particip...
1 1 vote
0 0 answers
1.1k
1.1k views
Shivam Kasat asked Jan 13, 2019
1,059 views
NO. OF RELATIONS REQURIED FOR THIS ER-DIAGRAM:I am getting answer 1,Reference :https://gateoverflow.in/201404/er-diagram read out @raviyogi comment