数据库系统_NF().ppt

Chapter 3  Design Theory for Relational Databases 第3章 关系数据库设计原则 3 Design Theory for Relational Database 3.1.1 Definition of Functional Dependency 3.1.1 Definition of Functional Dependency 3.1.1 Definition of Functional Dependency 3.1.1 Definition of Functional Dependency 3.1.1 Definition of Functional Dependency 3.1.1 Definition of Functional Dependency 3.1.1 Definition of Functional Dependency 3.14.2 Keys of Relations 3.1.2 Keys of Relations 3.1.2 Keys of Relations 3.1.3 Superkey 3.1 Functional Dependencies 3.2 Rules About Functional Dependencies 3.2 Rules About Functional Dependencies 3.2.1 Reasoning About Functional Dependencies 3.2.1 Reasoning About Functional Dependencies 3.2.2 The Splitting/Combining Rule 3.2.3 Trivial Dependencies 3.2.3 Trivial Dependencies 3.2.4 Computing the Closure of Attributes 3.2.4 Computing the Closure of Attributes 3.2.4 Computing the Closure of Attributes 3.2.4 Computing the Closure of Attributes 3.2.4 Computing the Closure of Attributes 3.2.5 Why the Closure Algorithm Works 3.2.6 The Transitive Rule 3.2.7 Closing Sets of Functional Dependencies 3.2.7 Closing Sets of Functional Dependencies 3.2.7 Closing Sets of Functional Dependencies 3.2.8 Projecting Functional Dependencies 3.2.8 Projecting Functional Dependencies 3.2.8 Projecting Functional Dependencies 3.2.8 Projecting Functional Dependencies Example 3.2 Rules About Functional Dependencies 3.3 Design of Relational Database Schemas 3.3 Design of Relational Database Schemas 3.3.1 Anomalies 3.3.1 Anomalies 3.3.2 Decomposing Relations 3.3.2 Decomposing Relations 3.3.2 Decomposing Relations 3.3.3 Boyce-Codd Normal Form 3.3.3 Boyce-Codd Normal Form 3.3.3 Boyce-Codd Normal Form 3.3.3 Boyce-Codd Normal Form 3.3.3 Boyce-Codd Normal Form 3.3.4 Decomposition into BCNF 3.3.4 Decomposition into BCNF 3.3.4 Decomposition into BCNF 3.3.4 Decomposition into BCNF 3.4 Decomposition: The Good, Bad, and Ugly 3.4.1 Recovering Information from a Decomposition 3.4.1 Recover