edited by
29,440 views
105 105 votes

A database of research articles in a journal uses the following schema.

$\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)}$

The primary key is '$\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE)}$

and the following functional dependencies exist in the schema.

$\begin{align*}&(\text{VOLUME , NUMBER, STARTPAGE, ENDPAGE}) & \rightarrow \text{TITLE} \\ &(\text{VOLUME, NUMBER}) & \rightarrow  \text{ YEAR} \\ &(\text{VOLUME, NUMBER, STARTPAGE, ENDPAGE})        &\rightarrow  \text{PRICE} \end{align*}$

The database is redesigned to use the following schemas

$(\text{VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, PRICE}) \\ \text{(VOLUME, NUMBER, YEAR})$

Which is the weakest normal form that the new database satisfies, but the old one does not?

  1. $\text{1NF}$
  2. $\text{2NF}$
  3. $\text{3NF}$
  4. $\text{BCNF}$

8 Answers

Best answer
92 92 votes
The actual design is in $\text{1NF}$ because there are partial dependencies in the given $\text{FD}$ set so the original $\text{DB}$ design is in $\text{1NF}$ but not $\text{2NF}$.

Now, the new design is removing all the partial dependencies so its in $\text{2NF}$

So, the weakest form that the new schema satisfies that the old one couldn't is $\text{2NF}$ answer is $B$.
edited by
87 87 votes
Original Database schema is not in 2NF, modified one is in BCNF.. so weakest form would be 2NF
Answer B
edited by
15 15 votes

i m using shortcut terms ...

RE-DESIGN database :

 (v,n,s,e,t,y,p)  breaks into (v,n,s,e,t,p) and (v,n,y)

 (v,n,s,e,t,p) satisfy (v,n,s,e) ------> t  and (v,n,s,e)-----> p     note : candidate keys are v,n,s,e  prime attributes are (v,n )and non prime attributes are(s,e,t,p) . satisfy 2nf condition i.e. no partial dependency also satisfy 3nf and bcnf condition but weaker is 2nf.

 (v,n,y ) satisfy (v,n) ------> y    note : candidate keys are v,n  prime attributes are (v,n )and non prime attribute is (y)

satisfy 2nf condition i.e. no partial dependency also satisfy 3nf and bcnf condition but weaker is 2nf.

ORIGINAL-database :

in this middle fd not satisfy 2nf condition i.e. (not partial dependency)

ANS is 2nf




8 8 votes

Answer
Option B

Solution

Conditions for Normalization

1NF - All tuples are  in atomic form

2NF - Every tuples is fully functionally depended on  Candidate Key

3NF -  Transitivity should be avoided . Or  Non Prime attributes must not determine non - prime attributes

BCNF - All values are to be depended on superkey . Dependancy May NOT be preserved .

 

Given Data

Key : $ V,N,S,E $

 

From the diagram it is clear that $ Year $  is not fully functionally depended on Primary Key . So It is not in 2NF . 

The schema has to be divided into two to be in 2NF 

  1.     V,N,Y
  2. V,N,S,E,T,P

 

Here , the two tables are in BCNF by the conditions given above . 

Hence the required answer is 2NF .

7 7 votes

Consider given relation in short form as R(V,N,S,E,T,Y,P).

FDs: { $VNSE\rightarrow T, VNSE\rightarrow P,VN\rightarrow Y$}

PK: VNSE

For relation R, $VN\rightarrow Y$ i.e $partofkey\rightarrow nonkey$ So, Partial Functional FD exist. Hence, R is not in 2NF.

R1(V,N,S,E,T,P) AND R2(V,N,Y)

R1 and R2 are in BCNF because for all FDs, $X\rightarrow Y$, X is a superkey in both R1 and R2.

But, they ask for weakest normal form that R1 and R2 satisfy but R does not, which is 2NF.

Correct Ans: (B)

0 0 votes

<!--[if gte mso 9]> 16.00 <![endif]--><!--[if gte mso 9]> Normal 0 false false false EN-IN X-NONE X-NONE <![endif]--><!--[if gte mso 9]> <![endif]--><!--[if gte mso 10]> /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin-top:0cm; mso-para-margin-right:0cm; mso-para-margin-bottom:8.0pt; mso-para-margin-left:0cm; line-height:107%; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri",sans-serif; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi; mso-font-kerning:1.0pt; mso-ligatures:standardcontextual; mso-fareast-language:EN-US;} <![endif]-->

 We can clearly understand the BCNF decomposition.

Process:

1)     First find the FD which doesn’t satisfy  the  condition of BCNF.  

     Lets say R(A,B,C) AàB then decomposition R1(A,B) and R(A,C) removing the RHS.If in the Question Asked about highest normal form then it is BCNF and here in the Question asking about weakest normal form therefore it is 2NF. (removing the partial dependencies).

1 flag:
✌ Edit necessary (Kushagr_Sharma “formatting and clarity needed”)
Answer:
Position:
Show:

Related questions

52 52 votes
3 answers 3 answers
12.5k
12.5k views
Sandeep Singh asked Feb 12, 2016
12,467 views
Which of the following is NOT a superkey in a relational schema with attributes $V,W,X,Y,Z$ and primary key $V\;Y$?$VXYZ$$VWXZ$$VWXY$$VWXYZ$
99 99 votes
11 answers 11 answers
36.5k
36.5k views
Sandeep Singh asked Feb 12, 2016
36,520 views
Consider the following two phase locking protocol. Suppose a transaction $T$ accesses (for read or write operations), a certain set of objects $\{O_1,\ldots,O_k \}$. This...
66 66 votes
6 answers 6 answers
27.7k
27.7k views
Sandeep Singh asked Feb 12, 2016
27,700 views
Consider the transition diagram of a PDA given below with input alphabet $\Sigma=\{a,b\}$ and stack alphabet $\Gamma = \{X,Z\}$. $Z$ is the initial stack symbol. Let $L$ ...
90 90 votes
10 answers 10 answers
38.2k
38.2k views
Sandeep Singh asked Feb 12, 2016
38,209 views
Consider the weighted undirected graph with $4$ vertices, where the weight of edge $\{i,j\}$ is given by the entry $W_{ij}$ in the matrix $W$. W=$\begin{bmatrix} 0&2 &8 &...