The Gateway to Computer Science Excellence
0 votes

How to solve these type of questions

Copying the image for quick reference:

Minimum no of tables.

My approach was:

First allocate all the relationships to entities (i.e decide on relationships)

            So here R5 goes with E4 , R4 with E3, R2 with E2, R3 needs a separate table(relation) because of M:N, R1 for E2 as well.

Secondly see any tables can be merged.

           E1E2 can be merged (only this is possible)

So finally tables will be E1R1E2R2, E4R5, E3R4, R3.

Correct me if I’m wrong. Let me know if there is a better process.

in Databases by Loyal (6.7k points) | 98 views

No need to merge E1 and E2... why would u do that?

Approach : 

  • First of all, count the no. of strong entity sets
  • Count no. of multivalued attributes
  • Count no. of weak entity sets
  • Count no. of M : N relationship sets

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,314 answers
105,085 users