【资料】decomposition.pptVIP

* Relational Database Design Functional Dependencies  Lossless Join Decomposition The decomposition is lossless (aka lossless join) if we can recover the initial table:SELECT first_name, last_name, address, department, T2.position, salaryFROM T2, T3 WHERE T2.position = T3.position In general a decomposition of R into R1 and R2 is lossless if and only if at least one of the following dependencies is in F+: R1 ? R2 ? R1 R1 ? R2 ? R2 In other words, the common attribute of R1 and R2 must be a candidate key for R1 or R2. In our example, the decomposition is lossless because position is a