The Worlds of Database Systems1.1The Evolution of Database Systems1.1.1Early Database Management Systems1.1.2Relational Database Systems1.1.3Smaller and Smaller Systems1.1.4Bigger and Bigger Systems1.1.5Information Integration1.2Overview of a Database Management System1.2.1Data-Definition Language Commands 1.2.2Overview of Query Processing1.2.3Storage and Buffer Management1.2.4Transaction Processing1.2.5The Query Processor1.3Outline of Database-System Studies1.4References for Chapter 1IRelational Database Modeling2The Relational Model of Data2.1An Overview of Data Models2.1.1What is a Data Model��2.1.2Important Data Models2.1.3The Relational Model in Brief2.1.4The Semistructured Model in Brief2.1.5Other Data Models2.1.6Comparison of Modeling Approaches2.2Basics of the Relational Model2.2.1Attributes2.2.2Schemas2.2.3Tuples2.2.4Domains2.2.5Equivalent Representations of a Relation2.2.6Relation Instances2.2.7Keys of Relations2.2.8An Example Database Schema2.2.9Exercises for Section 2.22.3Defining a Relation Schema in SQL2.3.1Relations in SQL2.3.2Data Types2.3.3Simple Table Declarations2.3.4Modifying Relation Schemas2.3.5Default Values2.3.6Declaring Keys2.3.7Exercises for Section 2.32.4An Algebraic Query Language2.4.1Why Do We Need a Special Query Language��2.4.2 What is an Algebra��2.4.3Overview of Relational Algebra2.4.4Set Operations on Relations2.4.5Projection2.4.6Selection2.4.7Cartesian Product2.4.8Natural Joins2.4.9Theta-Joins2.4.10 Combining Operations to Form Queries2.4.11 Naming and Renaming2.4.12 Relationships Among Operations2.4.13 A Linear Notation for Algebraic Expressions2.4.14 Exercises for Section 2.42.5Constraints on Relations2.5.1Relational Algebra as a Constraint Language2.5.2Referential Integrity Constraints2.5.3Key Constraints2.5.4Additional Constraint Examples2.5.5Exercises for Section 2.52.6Summary of Chapter 22.7References for Chapter 2Design Theory for Relational Databases3.1Functional Dependencies3.1.1Definition of Functional Dependency3.1.2Keys of Relations3.1.3Superkeys3.1.4Exercises for Section 3.13.2Rules About Functional Dependencies3.2.1Reasoning About Functional Dependencies 3.2.2The Splitting/Combining Rule3.2.3 nivial Functional Dependencies3.2.4 Computing the Closure of Attributes3.2.5 Why the Closure Algorithm Works3.2.6 The Transitive Rule3.2.7 Closing Sets ofFunctional Dependencies3.2.8 Projecting Functional Dependencies3.2.9 Exercises for Section 3.23.3 Design of Relational Database Schema3.3.1Anomalies3.3.2 Decomposing Relations3.3.3 Boyce-Codd Normal Form3.3.4 Decomposition into BCNF3.3.5 Exercises for Section 3.33.4 Decomposition��The Good��Bad��and Ugly3.4.1Recovering Information from a Decomposition3.4.2 The Chase Test for Lossless Join3.4.3Why the Chase works3.4.4 Dependency Preservation3.4.5 Exercises for Section 3.43.5 Third Normal Form3.5.1 Definition of Third Normal Form3.5.2The Synthesis Algorithm for 3NF Schemas3.5.3 Why the 3NF Synthesis Algorithm Works3.5.4 Exercises for Section 3.53.6 Multivalued Dependencies3.6.1Attribute Independence and Its Consequent Redundancy3.6.2 Definition ofMultivalued Dependencies3.6.3Reasoning About Multivalued Dependencies3.6.4 F0urth Normal Form3.6.5 Decomposition into Fourth Normal Form3.6.6Relationships Among Normal Forms3.6.7 Exercises for Section 3.63.7 An Algorithm for Discovering MVD'S3.7.1 The Closure and the Chase3.7.2Extending the Chase to MVD's3.7.3Why the Chase W10rks for MVD'S3.7.4 Projecting MVD'S3.7.5 Exercises for Section 3.73.8 Summary of Chapter 33.9 References for Chapter 34 High-Level Database M0dels5 Algebraic and Logical Query Languages6 The Database Language SQL7 Constraints and Triggers 8 Views and Indexes9 SQL in a Server Environment 10 Advanced Topics in Relational Databases�� Modeling and Programming for semistructured Data