数据库原理 英文课件Chaptr3- The Relational Data Model.pptVIP

* Transitive(传递) Functional Dependencies Suppose we have a relation R with three attributes A, B, and C, the FDs A-B and B-C both hold for R. Then it is easy to see that the FD A-c also holds for R, So C is said to depend on A transitively, via B * Keys of Relations from FD’s view We say a set of one or more attributes {A1, A2, …, An} is a key for relation if: Those attributes functionally determine all other attributes of the relation. That is, it is impossible for two distinct tuples of R to agree on all of A1, A2, …, An. No proper subset of {A1, A2, …, An} functionally determines all other attributes of R; i.e., a key must be minimal * Example Attributes {title, year, starName} form a key for the Movie relation of Fig.above. Sometimes a relation has more than one key. If so, it is common to design one of the keys as the primary key. * SuperKeys Superkey satisfies the first condition of a key; However, a superkey need not satisfy the second condition; Example Attribute set {title, year, starName} form a key for the Movie. Any superset of this attribute set, such as {title, year, starName, length} is a superkey. * Rules for discovering Keys of Relation First rule: If the relation comes from an entity set then the key for the relation is the key attributes of this entity set. Second rule: If a relation R is comes from a relationship, then the multiplicity of the relationship affects the key for R. There are three cases: If the relationship is many-many, then the keys of both connected entity sets are the key attributes for R. If the relationship is many-one from entity set E1 to entity set E2, then the key attributes of E1 are key attributes of R, but those of E2 are not. If the relationship is one-one, then the key attributes for either of the connected entity sets are key attributes of R. Thus, there is not a unique key for R. * Example Owns: It is a many-one relation between Movies to Studios, Thus, the key for the relation Owns is the key attribut