The Gateway to Computer Science Excellence
0 votes

Consider the following ER diagram:

How many number of relations are required for the above ER diagram?

  1. 2
  2. 3
  3. 5
  4. 1


My doubt is:

Since $E_2$ isn’t involved in total participation with $E_1$ so on merging we might get 2NF violation.


Let $E_1$ be:




$p \rightarrow q$

Let $E_2$ be:





$r \rightarrow s$

And p1 maps to r1, p2 maps to r2 and p3 maps to r3.

Merging with $E_2$ will give:





$pr \rightarrow sq$

$r \rightarrow s$

$p \rightarrow q$

2-NF violation.

So by default which case is to be considered when normalization form is not mentioned?? 1-NF?

in Databases by Boss (22.7k points)
edited by | 124 views
2 is correct. because

1:1  relation with total participation at atleast one side can be merged.


Please check my doubt and help if possible..


It is a 1:1 relationship with total participation on one side. As P is pkey of E1 and R is pkey of E2, so on merging E1, E2 and R1, the dependencies that are applicable are: P->Q, P->R, R->S. So P is the pkey of the merged relation. As it isnt a composite key, so there wont be any violation of 2NF right?

Where are you getting a violation?


@Somoshree Datta 5

Yes I don't know what was I thinking!! -_- pr is the superkey! :3

I marked 2 and then changed it to 3 thinking this !

So only Null values will be there right?

Thanks :)

Ya R will contain null values for some values of P since its partial participation on the side of E2..

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,666 questions
56,157 answers
93,749 users