Scribd
Upload
79 views2 pages

Assignment - 3 - 1

This document contains 8 questions regarding database management systems and relational database normalization. The questions cover topics such as lossless decomposition, functional dependency closure, BCNF and 3NF decomposition algorithms, and determining attribute closure given a set of functional dependencies. Students are asked to decompose relations into BCNF, compute closures, identify normalization forms, and provide examples.

Uploaded by

kanika thakur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
79 views2 pages

Assignment - 3 - 1

This document contains 8 questions regarding database management systems and relational database normalization. The questions cover topics such as lossless decomposition, functional dependency closure, BCNF and 3NF decomposition algorithms, and determining attribute closure given a set of functional dependencies. Students are asked to decompose relations into BCNF, compute closures, identify normalization forms, and provide examples.

Uploaded by

kanika thakur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Database Management Systems

Assignment-3

(Functional Dependency & Normalization)


(Submit the assignment to the concerned faculty as per announced date in your class)

Q1.
Suppose that we decompose the schema R = (A, B, C, D, E) into:
(A, B, C)
(A, D, E).
Show that this decomposition is a lossless decomposition if the following set F of functional
dependencies holds:
ABC
CD  E
B D
EA
Q2.
Compute the closure of the following set F of functional dependencies for relation schema R =
(A, B, C, D, E).
ABC
CD  E
B D
EA
Q3.
In the BCNF decomposition algorithm, suppose you use a functional dependency α → β to
decompose a relation schema r(α, β, γ) into r1(α, β) and r2(α, γ).
a) What primary and foreign-key constraint do you expect to hold on the decomposed
relations?
b) Give an example of an inconsistency that can arise due to an erroneous update, if the
foreign-key constraint were not enforced on the decomposed relations above.
Q4
Give an example of a relation schema R and a set of dependencies such that R is in BCNF but is
not in 4NF.

Q5
Consider the following set F of functional dependencies on the relation schema (A, B, C, D, E,
G):
ABCD
BC  DE
B D
DA
a) Compute B+.
b) Prove (using Armstrong’s axioms) that AG is a superkey.
c) Compute a canonical cover for this set of functional dependencies F; give each step
of your derivation with an explanation.
d) Give a 3NF decomposition of the given schema based on a canonical cover.
e) Give a BCNF decomposition of the given schema using the original set F of
functional dependencies.
Q6.
Consider the schema R = (A, B, C, D, E, G) and the set F of functional dependencies:
ABCD
B D
DE  B
DEG  AB
AC  DE
R is not in BCNF for many reasons, one of which arises from the functional dependency AB →
CD. Explain why AB → CD shows that R is not in BCNF and then use the BCNF decomposition
algorithm starting with AB → CD to generate a BCNF decomposition of R. Once that is done,
determine whether your result is or is not dependency preserving, and explain your reasoning.

Q7.
Consider the following two relational schemas and sets of functional dependencies:

a) R(A,B,C,D,E) with functional dependencies D → B, CE → A.


b) S(A,B,C,D,E) with functional dependencies A → E, BC → A, DE → B.

For each of them, decompose it into BCNF. Show all of your work and explain, at each step,
which dependency violations you are correcting. You have to turn in a description of your
decomposition steps.

Q8
A set of attributes X is called closed (with respect to a given set of functional dependencies) if
X+=X. Consider a relation with schema R(A,B,C,D) and an unknown set of functional
dependencies. For each closed attribute set below, give a set of functional dependencies that is
consistent with it.

a. All sets of attributes are closed.


b. The only closed sets are {} and {A,B,C,D}.
c. The only closed sets are {}, {A,B}, and {A,B,C,D}.

You might also like