Question: Let R be decomposed into R1, R2, . . ., Rn. Let F be a set of FDs on R. 1. Define what it means

Let R be decomposed into R1, R2, . . ., Rn. Let F be a set of FDs on R.
1. Define what it means for F to be preserved in the set of decomposed relations.
2. Describe a polynomial-time algorithm to test dependency-preservation.
3. Projecting the FDs stated over a set of attributes X onto a subset of attributes Y requires that we consider the closure of the FDs. Give an example where considering the closure is important in testing dependency-preservation, that is, considering just the given FDs gives incorrect results.

Step by Step Solution

3.43 Rating (159 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

1 Let Fi denote the projection of F on Ri F is preserved if the ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

960-C-S-D (2507).docx

120 KBs Word File

Students Have Also Explored These Related Databases Questions!