数据库原理与系统ch7RelationalDatabaseDesignNorm.pptVIP

Use of Multivalued Dependencies We use multivalued dependencies in two ways: 1. To test relations to determine whether they are legal under a given set of functional and multivalued dependencies 2. To specify constraints on the set of legal relations. We shall thus concern ourselves only with relations that satisfy a given set of functional and multivalued dependencies. If a relation r fails to satisfy a given multivalued dependency, we can construct a relations r? that does satisfy the multivalued dependency by adding tuples to r. Theory of MVDs From the definition of multivalued dependency, we can derive the following rule: If ? ? ?, then ? ?? ? That is, every functional dependency is also a multivalued dependency The closure D+ of D is the set of all functional and multivalued dependencies logically implied by D. We can compute D+ from D, using the formal definitions of functional dependencies and multivalued dependencies. We can manage with such reasoning for very simple multivalued dependencies, which seem to be most common in practice For complex dependencies, it is better to reason about sets of dependencies using a system of inference rules (see Appendix C). Fourth Normal Form A relation schema R is in 4NF with respect to a set D of functional and multivalued dependencies if for all multivalued dependencies in D+ of the form ? ?? ?, where ? ? R and ? ? R, at least one of the following hold: ? ?? ? is trivial (i.e., ? ? ? or ? ? ? = R) ? is a superkey for schema R If a relation is in 4NF it is in BCNF Restriction of Multivalued Dependencies The restriction of D to Ri is the set Di consisting of All functional dependencies in D+ that include only attributes of Ri All multivalued dependencies of the form ? ?? (? ? Ri) where ? ? Ri and ? ?? ? is in D+ 4NF Decomposition Algorithm result: = {R};done := false;compute D+;Let Di denote the restriction of D+ to Ri while (not done)  if (there is a schema Ri in result that is not