Computer Science · Database Management Systems
An analytical evaluation applies Heath's Theorem to the relation R(A, B, C) governed by the functional dependency A → B. The relation is decomposed into two separate models: Model I: Decomposed into R1(A, B) and R2(A, C) Model II: Decomposed into R1(A, B) and R2(B, C) Determine the exact number of LOSSLESS decompositions among these models, and identify the specific intersection attribute that satisfies the super key condition for the lossless model(s).
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Exactly 2 models are lossless; the satisfying intersection attributes are {A} and {B}.
- 2Exactly 1 model is lossless; the satisfying intersection attribute is {B}.
- 3Exactly 1 model is lossless; the satisfying intersection attribute is {A}.✓
- 4Exactly 0 models are lossless; no intersection attribute satisfies the condition.
Correct answer
Exactly 1 model is lossless; the satisfying intersection attribute is {A}.
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Database Management Systems MCQs →Want more practice questions on Database Management Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Database Management Systems