Computer Science · Database Management Systems
What is the required mathematical condition to verify that a decomposed relation preserves all original functional dependencies, assuming F is the original set of dependencies and F1, F2, ..., Fn are the dependencies preserved in the decomposed tables?
- 1Calculating if the complete closure of the original set is strictly greater than the union of the preserved dependencies without closure, denoted as F+ > (F1 ∪ F2 ∪ ... ∪ Fn)
- 2Calculating if the union of the preserved dependencies is a proper subset of the original dependencies without applying closure, denoted as (F1 ∪ F2 ∪ ... ∪ Fn) ⊂ F
- 3Calculating if the intersection of the closures of all preserved dependencies equals the original dependencies without closure, denoted as (F1 ∩ F2 ∩ ... ∩ Fn)+ = F
- 4Calculating if the combined closure of all functionally preserved dependencies across all decomposed tables exactly equals the complete closure of the original set of functional dependencies, denoted as (F1 ∪ F2 ∪ ... ∪ Fn)+ = F+✓
Correct answer
Calculating if the combined closure of all functionally preserved dependencies across all decomposed tables exactly equals the complete closure of the original set of functional dependencies, denoted as (F1 ∪ F2 ∪ ... ∪ Fn)+ = F+
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!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
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