1 / 30

Chapter 7: Relational Database Design

Chapter 7: Relational Database Design. First Normal Form Functional Dependencies Decomposition Boyce-Codd Normal Form Third Normal Form. Goals of Normalization. Decide whether a particular relation R is in “good” form.

roddy
Download Presentation

Chapter 7: Relational Database Design

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Chapter 7: Relational Database Design • First Normal Form • Functional Dependencies • Decomposition • Boyce-Codd Normal Form • Third Normal Form

  2. Goals of Normalization • Decide whether a particular relation R is in “good” form. • In the case that a relation R is not in “good” form, decompose it into a set of relations {R1, R2, ..., Rn} such that • the decomposition is a lossless-join decomposition • each relation is in good form

  3. Decomposition • Decompose the relation schema Lending-schema into: Branch-schema = (branch-name, branch-city,assets) Loan-info-schema = (customer-name, loan-number, branch-name, amount) • All attributes of an original schema (R) must appear in the decomposition (R1, R2): R = R1  R2 • Lossless-join decomposition.For all possible relations r on schema R r = R1 (r) R2 (r)

  4. Example of Lossy-Join Decomposition • Lossy-join decompositions result in information loss. • Example: Decomposition of R = (A, B) R1 = (A) R2 = (B) A B A B    1 2 1   1 2 B(r) A(r) r A B A (r) B (r)     1 2 1 2

  5. A decomposition of R into R1 and R2 is lossless join if and only if at least one of the following dependencies is in F+: • R1 R2R1 or • R1 R2R2

  6. Relation is in good form • If the relations Ripreferably should be in either Boyce-Codd Normal Form (BCNF) or Third (3NF) Normal Form • BCNF and 3NF eliminate redundancy • What is BCNF? • What is 3NF?

  7. Boyce-Codd Normal Form A relation schema R is in BCNF with respect to a set F of functional dependencies if for all functional dependencies in F+ of the form , where  R and  R,at least one of the following holds: •  is trivial (i.e.,  ) •  is a superkey for R

  8. Example • R = (A, B, C)F = {AB, B  C}Key = {A} • R is not in BCNF • Decomposition R1 = (A, B), R2 = (B, C) • R1and R2 in BCNF • Lossless-join decomposition

  9. Testing for BCNF • To check if a non-trivial dependency causes a violation of BCNF 1. compute + (the attribute closure of ), and 2. verify that it includes all attributes of R, that is, it is a superkey of R. • Simplified test: To check if a relation schema R is in BCNF, it suffices to check only the dependencies in the given set F for violation of BCNF, rather than checking all dependencies in F+. • If none of the dependencies in F causes a violation of BCNF, then none of the dependencies in F+ will cause a violation of BCNF either.

  10. However, using only F is incorrect when testing a relation in a decomposition of R • E.g. Consider R (A, B, C, D), with F = { A B, B C} • Decompose R into R1(A,B) and R2(A,C,D) • Neither of the dependencies in F contain only attributes from (A,C,D) so we might be mislead into thinking R2 satisfies BCNF. • In fact, dependency AC in F+ shows R2 is not in BCNF.

  11. BCNF Decomposition Algorithm result := {R};done := false;compute F+;while (not done) do if (there is a schema Riin result that is not in BCNF)then beginlet   be a nontrivial functional dependency that holds on Risuch that  Riis not in F+, and   = ;result := (result – Ri )  (Ri – )  (,  );end else done := true;

  12. Testing if Ri is in BCNF • To check if a relation Ri in a decomposition of R is in BCNF • Use the original set of dependencies F that hold on R, but with the following test: • for every set of attributes   Ri, check that + (the attribute closure of ) either includes no attribute of Ri- , or includes all attributes of Ri. • If the condition is violated by some   in F, the dependency (+ - )  Rican be shown to hold on Ri, and Ri violates BCNF. • We use above dependency to decompose Ri

  13. Example of BCNF Decomposition • R = (branch-name, branch-city, assets, customer-name, loan-number, amount) F = {branch-name assets, branch-city loan-number amount, branch-name} Key = {loan-number, customer-name} • Decomposition • R1 = (branch-name, branch-city, assets) • R2 = (branch-name, customer-name, loan-number, amount) • R3 = (branch-name, loan-number, amount) • R4 = (customer-name, loan-number) • Final decomposition R1, R3, R4

  14. Additional Constraint of Decomposition • Dependency preservation: Let Fibe the set of dependencies F+ that include only attributes in Ri. • Preferably the decomposition should be dependency preserving, that is, (F1 F2  …  Fn)+ = F+ • Otherwise, checking updates for violation of functional dependencies may require computing joins, which is expensive.

  15. Example • R = (A, B, C), F = {A B, B C) • Can be decomposed in two different ways • R1 = (A, B), R2 = (B, C) • Lossless-join decomposition: R1  R2 = {B} and B BC • Dependency preserving • R1 = (A, B), R2 = (A, C) • Lossless-join decomposition: R1  R2 = {A} and A  AB • Not dependency preserving (cannot check B C without computing R1 R2)

  16. To check if a dependency  is preserved in a decomposition of R into R1, R2, …, Rn we apply the following simplified test (with attribute closure done w.r.t. F) result = while (changes to result) dofor eachRiin the decompositiont = (result  Ri)+  Riresult = result  t If result contains all attributes in , then the functional dependency    is preserved. Testing for Dependency Preservation

  17. BCNF and Dependency Preservation It is not always possible to get a BCNF decomposition that is dependency preserving • R = (J, K, L)F = {JK L, L K}Two candidate keys = JK and JL • R is not in BCNF • Any decomposition of R will fail to preserve JK L

  18. Third Normal Form: Motivation • There are some situations where • BCNF is not dependency preserving, and • efficient checking for FD violation on updates is important • Solution: define a weaker normal form, called Third Normal Form. • Allows some redundancy (with resultant problems; we will see examples later) • But FDs can be checked on individual relations without computing a join. • There is always a lossless-join, dependency-preserving decomposition into 3NF.

  19. Third Normal Form • A relation schema R is in third normal form (3NF) if for all:  in F+at least one of the following holds: • is trivial (i.e.,  ) •  is a superkey for R • Each attribute A in  –  is contained in a candidate key for R. (NOTE: each attribute may be in a different candidate key)

  20. If a relation is in BCNF it is in 3NF (since in BCNF one of the first two conditions above must hold). • Third condition is a minimal relaxation of BCNF to ensure dependency preservation (will see why later).

  21. Example • R = (J, K, L)F = {JK L, L K} • Two candidate keys: JK and JL • R is in 3NF JK L JK is a superkeyL K K is contained in a candidate key • BCNF decomposition has (JL) and (LK) • Testing for JK L requires a join • There is some redundancy in this schema

  22. Testing for 3NF • Optimization: Need to check only FDs in F, need not check all FDs in F+. • Use attribute closure to check for each dependency   , if  is a superkey. • If  is not a superkey, we have to verify if each attribute in  is contained in a candidate key of R • testing for 3NF has been shown to be NP-hard • Interestingly, decomposition into third normal form (described shortly) can be done in polynomial time

  23. 3NF Decomposition Algorithm Let Fcbe a canonical cover for F;i := 0;for each functional dependency in Fcdo if none of the schemas Rj, 1  j  i contains then begini := i + 1; Ri := end if none of the schemas Rj, 1  j  i contains a candidate key for Rthen begini := i + 1; Ri := any candidate key for R;end return (R1, R2, ..., Ri)

  24. 3NF Decomposition Algorithm • Above algorithm ensures: • each relation schema Riis in 3NF • decomposition is dependency preserving and lossless-join • We skip the proof of correctness

  25. Example • Relation schema: Banker-info-schema = (branch-name, customer-name, banker-name, office-number) • The functional dependencies for this relation schema are:banker-name branch-name ,office-number customer-name, branch-name banker-name • The key is: {customer-name, branch-name}

  26. Applying 3NF to Banker-info-schema • The for loop in the algorithm causes us to include the following schemas in our decomposition: Banker-office-schema = (banker-name, branch-name, office-number) Banker-schema = (customer-name, branch-name, banker-name) • Since Banker-schema contains a candidate key for Banker-info-schema, we are done

  27. Comparison of BCNF and 3NF • It is always possible to decompose a relation into relations in 3NF and • the decomposition is lossless • the dependencies are preserved • It is always possible to decompose a relation into relations in BCNF and • the decomposition is lossless • it may not be possible to preserve dependencies.

  28. Comparison of BCNF and 3NF • Example of problems due to redundancy in 3NF • R = (J, K, L)F = {JK L, L K} J L K j1 j2 j3 null l1 l1 l1 l2 k1 k1 k1 k2 A schema that is in 3NF but not in BCNF has the problems of • repetition of information (e.g., the relationship l1, k1) • need to use null values (e.g., to represent the relationshipl2, k2 where there is no corresponding value for J).

  29. Design Goals • Goal for a relational database design is: • BCNF. • Lossless join. • Dependency preservation. • If we cannot achieve this, we accept one of • Lack of dependency preservation • Redundancy due to use of 3NF

  30. Testing for FDs Across Relations • If decomposition is not dependency preserving, we can have an extra materialized view for each dependency   in Fc that is not preserved in the decomposition • The materialized view is defined as a projection on   of the join of the relations in the decomposition • The functional dependency    is expressed by declaring  as a candidate key on the materialized view. • Checking for candidate key cheaper than checking    • Disadvantages?

More Related