Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider a schema R(A,B,C,D) and functional d...
Start Learning for Free
Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Then the decomposition of R into R1(AB) and R2(CD) is
- a)dependency preserving and lossless join
- b)lossless join but not dependency preserving
- c)dependency preserving but not lossless join
- d)not dependency preserving and not lossless join
Correct answer is option 'C'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
Consider a schema R(A,B,C,D) and functional dependencies A->B and ...
Dependency Preserving Decomposition:
Decomposition of R into R1 and R2 is a dependency preserving decomposition if closure of functional dependencies after decomposition is same as closure of of FDs before decomposition.
A simple way is to just check whether we can derive all the original FDs from the FDs present after decomposition.
Decomposition of R into R1 and R2 is a dependency preserving decomposition if closure of functional dependencies after decomposition is same as closure of of FDs before decomposition.
A simple way is to just check whether we can derive all the original FDs from the FDs present after decomposition.
In the above question R(A, B, C, D) is decomposed into R1 (A, B) and R2(C, D) and there are only two FDs A -> B and C -> D. So, the decomposition is dependency preserving
Lossless-Join Decomposition:
Decomposition of R into R1 and R2 is a lossless-join decomposition if at least one of the following functional dependencies are in F+ (Closure of functional dependencies)
Decomposition of R into R1 and R2 is a lossless-join decomposition if at least one of the following functional dependencies are in F+ (Closure of functional dependencies)
R1 ∩ R2 → R1
OR
R1 ∩ R2 → R2
OR
R1 ∩ R2 → R2
In the above question R(A, B, C, D) is decomposed into R1 (A, B) and R2(C, D), and R1 ∩ R2 is empty. So, the decomposition is not lossless.
Most Upvoted Answer
Consider a schema R(A,B,C,D) and functional dependencies A->B and ...
Explanation:
To decompose the schema R(A,B,C,D) into R1(AB) and R2(CD), we need to check if the decomposition is dependency preserving and lossless join.
Dependency Preservation:
A decomposition is said to preserve dependencies if every functional dependency in the original schema is also present in at least one of the decomposed schemas. In this case, the functional dependencies are A-B and C-D. Let's check if these dependencies hold in the decomposed schemas:
- R1(AB) has the attribute A and B, and A-B dependency holds in it.
- R2(CD) has the attribute C and D, and C-D dependency holds in it.
Therefore, the decomposition is dependency preserving.
Lossless Join:
A decomposition is said to be lossless join if we can join the decomposed schemas to get the original schema without losing any information. In this case, we need to check if the natural join of R1 and R2 gives us the original schema R.
The natural join of R1(AB) and R2(CD) will give us a schema with attributes ABCD. Since R has attributes ABCD, the decomposition is lossless join.
Conclusion:
Since the decomposition is both dependency preserving and lossless join, the correct answer is option 'C' - dependency preserving but not lossless join.
To decompose the schema R(A,B,C,D) into R1(AB) and R2(CD), we need to check if the decomposition is dependency preserving and lossless join.
Dependency Preservation:
A decomposition is said to preserve dependencies if every functional dependency in the original schema is also present in at least one of the decomposed schemas. In this case, the functional dependencies are A-B and C-D. Let's check if these dependencies hold in the decomposed schemas:
- R1(AB) has the attribute A and B, and A-B dependency holds in it.
- R2(CD) has the attribute C and D, and C-D dependency holds in it.
Therefore, the decomposition is dependency preserving.
Lossless Join:
A decomposition is said to be lossless join if we can join the decomposed schemas to get the original schema without losing any information. In this case, we need to check if the natural join of R1 and R2 gives us the original schema R.
The natural join of R1(AB) and R2(CD) will give us a schema with attributes ABCD. Since R has attributes ABCD, the decomposition is lossless join.
Conclusion:
Since the decomposition is both dependency preserving and lossless join, the correct answer is option 'C' - dependency preserving but not lossless join.
Free Test
FREE
| Start Free Test |
Community Answer
Consider a schema R(A,B,C,D) and functional dependencies A->B and ...
Answer c
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Then the decomposition of R into R1(AB) and R2(CD) isa)dependency preserving and lossless joinb)lossless join but not dependency preservingc)dependency preserving but not lossless joind)not dependency preserving and not lossless joinCorrect answer is option 'C'. Can you explain this answer?
Question Description
Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Then the decomposition of R into R1(AB) and R2(CD) isa)dependency preserving and lossless joinb)lossless join but not dependency preservingc)dependency preserving but not lossless joind)not dependency preserving and not lossless joinCorrect answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Then the decomposition of R into R1(AB) and R2(CD) isa)dependency preserving and lossless joinb)lossless join but not dependency preservingc)dependency preserving but not lossless joind)not dependency preserving and not lossless joinCorrect answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Then the decomposition of R into R1(AB) and R2(CD) isa)dependency preserving and lossless joinb)lossless join but not dependency preservingc)dependency preserving but not lossless joind)not dependency preserving and not lossless joinCorrect answer is option 'C'. Can you explain this answer?.
Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Then the decomposition of R into R1(AB) and R2(CD) isa)dependency preserving and lossless joinb)lossless join but not dependency preservingc)dependency preserving but not lossless joind)not dependency preserving and not lossless joinCorrect answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Then the decomposition of R into R1(AB) and R2(CD) isa)dependency preserving and lossless joinb)lossless join but not dependency preservingc)dependency preserving but not lossless joind)not dependency preserving and not lossless joinCorrect answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Then the decomposition of R into R1(AB) and R2(CD) isa)dependency preserving and lossless joinb)lossless join but not dependency preservingc)dependency preserving but not lossless joind)not dependency preserving and not lossless joinCorrect answer is option 'C'. Can you explain this answer?.
Solutions for Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Then the decomposition of R into R1(AB) and R2(CD) isa)dependency preserving and lossless joinb)lossless join but not dependency preservingc)dependency preserving but not lossless joind)not dependency preserving and not lossless joinCorrect answer is option 'C'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Then the decomposition of R into R1(AB) and R2(CD) isa)dependency preserving and lossless joinb)lossless join but not dependency preservingc)dependency preserving but not lossless joind)not dependency preserving and not lossless joinCorrect answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Then the decomposition of R into R1(AB) and R2(CD) isa)dependency preserving and lossless joinb)lossless join but not dependency preservingc)dependency preserving but not lossless joind)not dependency preserving and not lossless joinCorrect answer is option 'C'. Can you explain this answer?, a detailed solution for Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Then the decomposition of R into R1(AB) and R2(CD) isa)dependency preserving and lossless joinb)lossless join but not dependency preservingc)dependency preserving but not lossless joind)not dependency preserving and not lossless joinCorrect answer is option 'C'. Can you explain this answer? has been provided alongside types of Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Then the decomposition of R into R1(AB) and R2(CD) isa)dependency preserving and lossless joinb)lossless join but not dependency preservingc)dependency preserving but not lossless joind)not dependency preserving and not lossless joinCorrect answer is option 'C'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Then the decomposition of R into R1(AB) and R2(CD) isa)dependency preserving and lossless joinb)lossless join but not dependency preservingc)dependency preserving but not lossless joind)not dependency preserving and not lossless joinCorrect answer is option 'C'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup