Scribd
Upload
4 views3 pages

Question Losslessjoin

The document consists of a series of questions and answers related to database normalization, functional dependencies, and relational schemas. It covers topics such as lossless decomposition, dependency preservation, candidate keys, and normal forms, specifically focusing on 3NF and BCNF. Each question is followed by an answer and a request for further explanation or justification of the concepts discussed.

Uploaded by

Rajni Sehgal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views3 pages

Question Losslessjoin

The document consists of a series of questions and answers related to database normalization, functional dependencies, and relational schemas. It covers topics such as lossless decomposition, dependency preservation, candidate keys, and normal forms, specifically focusing on 3NF and BCNF. Each question is followed by an answer and a request for further explanation or justification of the concepts discussed.

Uploaded by

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

Question1

A → B, B → C,
C → D and D → B.

The decomposition of R into


(A, B), (B, C), (B, D)
Solution
Note that A, B, C and D are all key attributes. We can derive all attributes from every
attribute.
Since Intersection of all relations is B and B derives all other attributes, relation is lossless.
The relation is dependency preserving as well as all functional dependencies are preserved
directly or indirectly. Note that C -> D is also preserved with following two C -> B and B ->
D.

Quetion2
Consider a schema R(A,B,C,D)R(A,B,C,D) and functional
dependencies A→BA→B and C→DC→D. Then the decomposition
of RR into R1(AB)R1(AB) and R2(CD)R2(CD) is

Check whether the dependency is preserving or check it is loss less decomposition or not?
Answer is yess, but you need to explain

Quetion3
Let R=(A,B,C,D,E,F)R=(A,B,C,D,E,F) be a relation scheme with the following
dependencies: C→F,E→A,EC→D,A→B.C→F,E→A,EC→D,A→B. Which of the following
is a key for R?
Answer is EC
But solve to find EC

Question4
Which normal form is considered adequate for normal relational database design?
Answer is 3NF
But explain why?

Question5
Consider a relation scheme R = (A, B, C, D, E, H) on which the following functional
dependencies hold: {A–>B, BC–>D, E–>C, D–>A}. What are the candidate keys of R?
Solution
AEH, BEH, DEH( but you need to solve to give the answer)

Question 6
The relation scheme Student Performance (name, courseNo, rollNo, grade) has the following
functional dependencies:
name, courseNo → grade
rollNo, courseNo → grade
name → rollNo
rollNo → name
The highest normal form of this relation scheme is
Answer is 3NF

You need to explain

Question 6
Relation R is decomposed using a set of functional dependencies, F and relation S is
decomposed using another set of functional dependencies G. One decomposition is definitely
BCNF, the other is definitely 3NF, but it is not known which is which. To make a guaranteed
identification, which one of the following tests should be used on the decompositions?
(Assume that the closures of F and G are available).

Answer is BCNF
Explain
Question 7
Which of the following is NOT a superkey in a relational schema with attributes V, W, X, Y,
Z and primary key V Y ?
Answer is V W X Z

Question 8
Let R (A, B, C, D, E, P, G) be a relational schema in which the following functional depen-
dencies are known to hold: AB → CD, DE → P, C → E, P → C and B → G. The relational
schema R is in not in which normal form?
Answer it is not in 2nf

You might also like