1. 1 Lecture 8 Design Theory for Relational Databases (part 2) Slides from http://infolab.stanford.edu/~ullman/fcdb/aut07/index.html#lecturehttp://infolab.stanford.edu/~ullman/fcdb/aut07/index.html#lecture CS4416 Database Systems CS5122 Development of IS 2

2. 2 First Normal Form (1NF) uFirst Normal Form wthe intersection of each row and column contains one and only one value.

3. 3 clientNocNamepropert yNo rentrentStartownerNoownerName CR76John KayPG4 PG16 350 450 1-Jul-07 1-Sep-08 OW03 OW04 Tina Murphy Tony Shaw CR56Aline Stewart PG4 PG36 PG16 150 375 550 1-Sep-06 10-Oct-07 1-Nov-09 OW03 OW04 Tina Murphy Tony Shaw Not in 1NF clientNocNamepropertyNorentrentStartownerNoownerName CR76John KayPG43501-Jul-07OW03Tina Murphy CR76John KayPG164501-Sep-08OW04Tony Shaw CR56Aline StewartPG41501-Sep-06OW03Tina Murphy CR56Aline StewartPG3637510-Oct-07OW04Tony Shaw CR56Aline StewartPG165501-Nov-09OW04Tony Shaw 1NF

4. 4 Assume a property can be rented by only one client on a particular day and property owners don't change. FDs: propertyNo rentStart  clientNo rent clientNo  cName propertyNo rentStart  cName propertyNo  ownerNo propertyNo rentStart  ownerNo ownerNo  ownerName propertyNo rentStart  ownerName Key {properyNo, rentStart} Partial dependency clientNocNamepropertyNorentrentStartownerNoownerName CR76John KayPG43501-Jul-07OW03Tina Murphy CR76John KayPG164501-Sep-08OW04Tony Shaw CR56Aline StewartPG41501-Sep-06OW03Tina Murphy CR56Aline StewartPG3637510-Oct-07OW04Tony Shaw CR56Aline StewartPG165501-Nov-09OW04Tony Shaw Transitive dependency

5. 5 Second Normal Form (2NF) uSecond Normal form wA relation R is in 2NF if it is in 1NF and every non-key attribute of R is fully functionally dependent on every key of R. wTransitive FDs can still be present. An FD X  A in relation R is a transitive FD if there exist a set of attributes Z in R that is neither a key nor a subset of any key of R and both X  Z and Z  A hold.

6. 6 Not in 2NF clientNocNamepropertyNorentrentStartownerNoownerName CR76John KayPG43501-Jul-07OW03Tina Murphy CR76John KayPG164501-Sep-08OW04Tony Shaw CR56Aline StewartPG41501-Sep-06OW03Tina Murphy CR56Aline StewartPG3637510-Oct-07OW04Tony Shaw CR56Aline StewartPG165501-Nov-09OW04Tony Shaw propertyNoownerNoownerName PG4OW03Tina Murphy PG16OW04Tony Shaw PG4OW03Tina Murphy PG36OW04Tony Shaw PG16OW04Tony Shaw clientNocNamepropertyNorentrentStart CR76John KayPG43501-Jul-07 CR76John KayPG164501-Sep-08 CR56Aline StewartPG41501-Sep-06 CR56Aline StewartPG3637510-Oct-07 CR56Aline StewartPG165501-Nov-09 2NF

7. 7 Boyce-Codd Normal Form uIntroduced to define a relation in 2NF without transitive FDs. uWe say a relation R is in BCNF if whenever X  Y is a nontrivial FD that holds in R, X is a superkey. wRemember: nontrivial means Y is not contained in X. wRemember, a superkey is any superset of a key (not necessarily a proper superset).

8. 8 Example Drinkers(name, addr, beersLiked, manf, favBeer) FD’s: name  addr favBeer, beersLiked  manf uOnly key is {name, beersLiked}. uIn each FD, the left side is not a superkey. uAny one of these FD’s shows Drinkers is not in BCNF

9. 9 Another Example Beers(name, manf, manfAddr) FD’s: name  manf, manf  manfAddr uOnly key is {name}. uname  manf does not violate BCNF, but manf  manfAddr does.

10. 10 Decomposition into BCNF uGiven: relation R with FD’s F. uLook among the given FD’s for a BCNF violation X  Y. wIf any FD following from F violates BCNF, then there will surely be an FD in F itself that violates BCNF. uCompute X +. wNot all attributes, or else X is a superkey.

11. 11 Decompose R Using X  Y uReplace R by relations with schemas: 1. R 1 = X +. 2. R 2 = R – (X + – X ). uProject given FD’s F onto the two new relations.

12. 12 Decomposition Picture R-X +R-X + XX +-XX +-X R2R2 R1R1 R

13. 13 Example: BCNF Decomposition Drinkers(name, addr, beersLiked, manf, favBeer) F =name  addr, name  favBeer, beersLiked  manf uPick BCNF violation name  addr. uClose the left side: {name} + = {name, addr, favBeer}. uDecomposed relations: 1.Drinkers1(name, addr, favBeer) 2.Drinkers2(name, beersLiked, manf)

14. 14 Example -- Continued uWe are not done; we need to check Drinkers1 and Drinkers2 for BCNF. uProjecting FD’s is easy here. uFor Drinkers1(name, addr, favBeer), relevant FD’s are name  addr and name  favBeer. wThus, {name} is the only key and Drinkers1 is in BCNF.

15. 15 Example -- Continued uFor Drinkers2(name, beersLiked, manf), the only FD is beersLiked  manf, and the only key is {name, beersLiked}. wViolation of BCNF. ubeersLiked + = {beersLiked, manf}, so we decompose Drinkers2 into: 1.Drinkers3(beersLiked, manf) 2.Drinkers4(name, beersLiked)

16. 16 Example -- Concluded uThe resulting decomposition of Drinkers : 1.Drinkers1(name, addr, favBeer) 2.Drinkers3(beersLiked, manf) 3.Drinkers4(name, beersLiked) uNotice: Drinkers1 tells us about drinkers, Drinkers3 tells us about beers, and Drinkers4 tells us the relationship between drinkers and the beers they like.

17. 17 Third Normal Form -- Motivation uThere is one structure of FD’s that causes trouble when we decompose. uAB  C and C  B. wExample: A = street address, B = city, C = zip code. wAssuming there are no two streets with the same name in the same city. uThere are two keys, {A,B } and {A,C }. uC  B is a BCNF violation, so we must decompose into AC, BC.

18. 18 We Cannot Enforce FD’s uThe problem is that if we use AC and BC as our database schema, we cannot enforce the FD AB  C by checking FD’s in these decomposed relations. uExample with A = street, B = city, and C = zip on the next slide.

19. 19 An Unenforceable FD street (A)zip (C) 545 Tech Sq.02138 545 Tech Sq.02139 city (B)zip (C) Cambridge02138 Cambridge02139 Join tuples with equal zip codes. street (A) city (B)zip (C) 545 Tech Sq.Cambridge02138 545 Tech Sq.Cambridge02139 Although no FD’s were violated in the decomposed relations, FD street city  zip is violated by the database as a whole.

20. 20 3NF Let’s Us Avoid This Problem u3 rd Normal Form (3NF) modifies the BCNF condition so we do not have to decompose in this problem situation. uAn attribute is prime if it is a member of any key. uX  A violates 3NF if and only if X is not a superkey, and also A is not prime.

21. 21 3NF Definitions uWe say a relation R is in 3NF if for each nontrivial FD X  A that holds in R, either X is a superkey of R or A is prime. uAlternative definition: R is in 3NF if every non-prime attribute of R is both fully functionally dependent on every key of R and non-transitively dependent on every key of R.

22. 22 1NF > 2NF > 3NF > BCNF BCNF 1NF 2NF 3NF

23. 23 Example: 3NF uIn our problem situation with FD’s AB  C and C  B, we have keys AB and AC. uThus A, B, and C are each prime. uAlthough C  B violates BCNF, it does not violate 3NF.

24. 24 What 3NF and BCNF Give You uThere are two important properties of a decomposition: 1.Lossless Join : it should be possible to project the original relations onto the decomposed schema, and then reconstruct the original. 2.Dependency Preservation : it should be possible to check in the projected relations whether all the given FD’s are satisfied.

25. 25 3NF and BCNF -- Continued uWe can get (1) with a BCNF decomposition. uWe can get both (1) and (2) with a 3NF decomposition. uBut we can’t always get (1) and (2) with a BCNF decomposition. wstreet-city-zip is an example.

26. 26 3NF Synthesis Algorithm uWe can always construct a decomposition into 3NF relations with a lossless join and dependency preservation. uNeed minimal basis for the FD’s: 1.Right sides are single attributes. 2.No FD can be removed. 3.No attribute can be removed from a left side.

27. 27 Constructing a Minimal Basis 1.Repeatedly try to remove an FD and see if the remaining FD’s are equivalent to the original. 2.Repeatedly try to remove an attribute from a left side and see if the resulting FD’s are equivalent to the original.

28. 28 3NF Synthesis – (2) Step 1. Find a minimal basis G. Step 2. For each FD, say X  A in G, use XA as the schema of one of the relations in the decomposition. Step 3. If none of the attribute sets of relations from Step 2 is a superkey for R, add another relation whose schema is a key for R.

29. 29 Example: 3NF Synthesis uRelation R = ABCD. uFD’s A  B and A  C. uDecomposition: AB and AC from the FD’s, plus AD for a key.

30. 30 Why It Works uPreserves dependencies: each FD from a minimal basis is contained in a relation, thus preserved. uLossless Join: can be proved. u3NF: hard part – a property of minimal bases.