Unformatted text preview: All binary relations are in BCNF (just an FYI). Part B – Not possible to get a BCNF decomposition which is both LLJ and fdpreserving. Homework 6 Question #5 Do an attribute closure on candidate key to see if it contains all the keys of the original relation. Similar example R(ABC); F = { AB C, A B, A C, B C } ( F is not minimal – duh!) F min = { A B, B C } Part 6 Chapter 15 Make sure you know the ACID properties and can explain each of them....
View
Full
Document
This note was uploaded on 01/25/2010 for the course CSC 4402 taught by Professor Staff during the Fall '08 term at LSU.
 Fall '08
 Staff
 Databases

Click to edit the document details