| |
| |
| |
| The Worlds of Database Systems | |
| |
| |
| |
| The Evolution of Database Systems | |
| |
| |
| |
| Early Database Management Systems | |
| |
| |
| |
| Relational Database Systems | |
| |
| |
| |
| Smaller and Smaller Systems | |
| |
| |
| |
| Bigger and Bigger Systems | |
| |
| |
| |
| Information Integration1.2 Overview of a Database Management System | |
| |
| |
| |
| Data-Definition Language Commands | |
| |
| |
| |
| Overview of Query Processing | |
| |
| |
| |
| Storage and Buffer Management | |
| |
| |
| |
| Transaction Processing | |
| |
| |
| |
| The Query Processor1.3 Outline of Database-System Studies1.4 References for Chapter 1I Relational Database Modeling2 The Relational Model of Data2.1 An Overview of Data Models | |
| |
| |
| |
| What is a Data Model? | |
| |
| |
| |
| Important Data Models | |
| |
| |
| |
| The Relational Model in Brief | |
| |
| |
| |
| The Semistructured Model in Brief | |
| |
| |
| |
| Other Data Models | |
| |
| |
| |
| Comparison of Modeling Approaches2.2 Basics of the Relational Model | |
| |
| |
| |
| Attributes | |
| |
| |
| |
| Schemas | |
| |
| |
| |
| Tuples | |
| |
| |
| |
| Domains2 CONTENTS | |
| |
| |
| |
| Equivalent Representations of a Relation | |
| |
| |
| |
| Relation Instances | |
| |
| |
| |
| Keys of Relations | |
| |
| |
| |
| An Example Database Schema | |
| |
| |
| |
| Exercises for Section | |
| |
| |
| |
| De ning a Relation Schema in SQL | |
| |
| |
| |
| Relations in SQL | |
| |
| |
| |
| Data Types | |
| |
| |
| |
| Simple Table Declarations | |
| |
| |
| |
| Modifying Relation Schemas | |
| |
| |
| |
| Default Values | |
| |
| |
| |
| Declaring Keys | |
| |
| |
| |
| Exercises for Section | |
| |
| |
| |
| An Algebraic Query Language | |
| |
| |
| |
| Why Do We Need a Special Query Language? | |
| |
| |
| |
| What is an Algebra? | |
| |
| |
| |
| Overview of Relational Algebra | |
| |
| |
| |
| Set Operations on Relations | |
| |
| |
| |
| Projection | |
| |
| |
| |
| Selection | |
| |
| |
| |
| Cartesian Product | |
| |
| |
| |
| Natural Joins | |
| |
| |
| |
| Theta-Joins | |
| |
| |
| |
| |
| |
| |
| Combining Operations to Form Queries | |
| |
| |
| |
| |
| |
| |
| Naming and Renaming | |
| |
| |
| |
| |
| |
| |
| Relationships Among Operations | |
| |
| |
| |
| |
| |
| |
| A Linear Notation for Algebraic Expressions | |
| |
| |
| |
| |
| |
| |
| Exercises for Section | |
| |
| |
| |
| Constraints on Relations | |
| |
| |
| |
| Relational Algebra as a Constraint Language | |
| |
| |
| |
| Referential Integrity Constraints | |
| |
| |
| |
| Key Constraints | |
| |
| |
| |
| Additional Constraint Examples | |
| |
| |
| |
| Exercises for Section | |
| |
| |
| |
| Summary of Chapter 22.7 References for Chapter | |
| |
| |
| |
| Design Theory for Relational Databases3.1 Functional Dependencies | |
| |
| |
| |
| De nition of Functional Dependency | |
| |
| |
| |
| Keys of Relations | |
| |
| |
| |
| Superkeys | |
| |
| |
| |
| Exercises for Section | |
| |
| |
| |
| Rules About Functional Dependencies | |
| |
| |
| |
| Reasoning About Functional Dependencies | |
| |
| |
| |
| The Splitting/Combining Rule | |
| |
| |
| |
| Trivial Functional Dependencies | |
| |
| |
| |
| Computing the Closure of Attributes | |
| |
| |
| |
| Why the Closure Algorithm Works | |
| |
| |
| |
| The Transitive Rule | |
| |
| |
| |
| Closing Sets of Functional Dependencies | |
| |
| |
| |
| Projecting Functional Dependencies | |
| |
| |
| |
| Exercises for Section | |
| |
| |
| |
| Design of Relational Database Schemas | |
| |
| |
| |
| Anomalies | |
| |
| |
| |
| Decomposing Relations | |
| |
| |
| |
| Boyce-Codd Normal Form | |
| |
| |
| |
| Decomposition into BCNF | |
| |
| |
| |
| Exercises for Section | |
| |
| |
| |
| Decomposition: The Good, Bad, and Ugly | |
| |
| |
| |
| Recovering Information from a Decomposition | |
| |
| |
| |
| The Chase Test for Lossless Join | |
| |
| |
| |
| Why the Chase Works | |
| |
| |
| |
| Dependency Preservation | |
| |
| |
| |
| Exercises for Section | |
| |
| |
| |
| Third Normal Form | |
| |
| |
| |
| Definition of Third Normal Form | |
| |
| |
| |
| The Synthesis Algorithm for 3NF Schemas | |
| |
| |
| |
| Why the 3NF Synthesis Algorithm Works | |
| |
| |
| |
| Exercises for Section | |
| |
| |
| |
| Multivalued Dependencies | |
| |
| |
| |
| Attribute Independence and Its ConsequentRedundancy | |
| |
| |
| |
| Definition of Multivalued Dependencies | |
| |
| |
| |
| Reas | |