This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Conversion to BCNF To convert this table to BCNF, first change the primary key to (A,C). So the new table is TABLE (A,C ,B,D) At this point the table is in 1NF but not in 2NF (partial dependency exists C B). We will now follow the algorithm to decompose the offending dependency. TABLE 1(A, C , D) TABLE2 (C, B) These two tables are now in BCNF! Now consider the example in Lecture 3, Slide 3-13. The table ITEM (ItemNumber , Type, AcquisitionCost) has the functional dependency – Type (ItemNumber, AcquisitionCost) In other words, we have two candidate keys in that table ItemNumber and Type. Therefore, all determinants are candidate keys. Hence, this table is in BCNF and needs no further decomposition. Had we not made the assumption that Type (ItemNumber, AcquisitionCost), then the table would be in 3NF....
View Full Document
This note was uploaded on 04/06/2008 for the course ACCT 410x taught by Professor Bonner during the Spring '06 term at USC.
- Spring '06