database第3章 第1次课.pptVIP

Content 3.1 Functional Dependencies 函数依赖 3.2 Rules About Functional Dependencies 函数依赖的规则 Chapter 3 Design Theory for Relational Databases - First 3.1 Functional Dependencies There is a design theory for relations that lets us examine a design carefully and make improvements based on a few simple principles. The theory begins by having us state the constraints that apply to the relation. The most common constraint is the “functional dependency”, a statement of a type that generalizes the idea of a key for a relation, which we introduced in Section 2.5.3. Later in this chapter, we shall see how this theory gives up simple tools to improve our designs by the process of “decomposition” of relations : the replacement of one relation by several, whose sets of attributes together include all the attributes of the original. 关系的设计理论使人们可以根据少数简单原则来认真检验一个设计并做出改进。这一理论首先能够规定作用在关系上的约束。最常见的约束是“函数依赖”，它泛化了关系中“键”的概念。本章随后介绍如何使用关系设计理论给予的一些简单工具，通过关系的分解过程来改进设计，即用若干关系替代原关系，这些关系的属性集合包含了原关系的所有属性。 3.1 Functional Dependencies 1. Definition of Functional Dependency 函数依赖的定义 A functional dependency(FD) on a relation R is a statement of the form “If two tuples of R agree on all of the attributes A1,A2,…,An (i.e., the tuples has the same values in their respective components for each of these attributes), then they must also agree on all of another list of attributes B1,B2,…,Bm. We write this FD formally as A1,A2,…,An → B1,B2,…,Bm and say that “A1,A2,…,An functionally determine B1,B2,…,Bm” 关系R上的函数依赖是指如果R的两个元组在属性A1,A2,…,An上一致（即它们对应于这些属性的分量值都相等），那么它们必定在其他属性B1,B2,…,Bm上也一致。该函数依赖形式地记为A1,A2,…,An → B1,B2,…,Bm，并称为A1,A2,…,An函数决定B1,B2,…,Bm。 3.1 Functional Dependencies 1. Definition of Functional Dependency If we can be sure every instance of a relation R will be one in which a given FD is true, then we say that R satisfies the FD. It is important to remember that when we say that R satisfies an FD f, we are asserting a constraint on R, not just say