### From TextbookRevolution

## Bibliographical Data

Title: | An Introduction to Relational Database Theory |

Author: | Hugh Darwen |

Subjects: | Computer Science, Other |

Key words: | database, design, microsoft |

Education Level: | Higher Education |

License: | All Rights Reserved - Standard Copyright |

Description: | This book introduces you to the theory of relational databases, focusing on the application of that theory to the design of computer languages that properly embrace it. The book is intended for those studying relational databases as a part of a degree course in Information Technology (IT).
1. Introduction 1.1 Introduction 1.2 What Is a Database? 1.3 “Organized Collection of Symbols” 1.4 “To Be Interpreted as a True Account” 1.5 “Collection of Variables” 1.6 What Is a Relational Database? 1.7 “Relation” Not Equal to “Table” 1.8 Anatomy of a Relation 1.9 What Is a DBMS? 1.10 What Is a Database Language? 1.11 What Does a DBMS Do? 1.12 Creating and Destroying Variables 1.13 Taking Note of Integrity Rules 1.14 Taking Note of Authorisations 1.15 Updating Variables 1.16 Providing Results of Queries EXERCISES 2. Values, Types, Variables, Operators 2.1 Introduction 2.2 Anatomy of A Command 2.3 Important Distinctions 2.4 A Closer Look at a Read-Only Operator (+) 2.5 Read-only Operators in Tutorial D 2.6 What Is a Type? 2.7 What Is a Type Used For? 2.8 The Type of a Relation 2.9 Relation Literals 2.10 Types and Representations 2.11 What Is a Variable? 2.12 Updating a Variable 2.13 Conclusion EXERCISES Getting Started with Rel 3. Predicates and Propositions 3.1 Introduction 3.2 What Is a Predicate? 3.3 Substitution and Instantiation 3.4 How a Relation Represents an Extension 3.5 Deriving Predicates from Predicates EXERCISES 4. Relational Algebra – The Foundation 4.1 Introduction 4.2 Relations and Predicates 4.3 Relational Operators and Logical Operators 4.4 JOIN and AND 4.5 RENAME 4.6 Projection and Existential Quantification 4.7 Restriction and AND 4.8 Extension and AND 4.9 UNION and OR 4.10 Semidifference and NOT 4.11 Concluding Remarks EXERCISES Working with a Database in Rel 5. Building on The Foundation 5.1 Introduction 5.2 Semijoin and Composition 5.3 Aggregate Operators 5.4 Relations within a Relation 5.5 Using Aggregate Operators with Nested Relations 5.6 SUMMARIZE 5.7 GROUP and UNGROUP 5.8 WRAP and UNWRAP 5.9 Relation Comparison 5.10 Other Operators on Relations and Tuples EXERCISES 6. Constraints and Updating 6.1 Introduction 6.2 A Closer Look at Constraints and Consistency 6.3 Expressing Constraint Conditions 6.4 Useful Shorthands for Expressing Constraints 6.5 Updating Relvars EXERCISES 7. Database Design I: Projection-Join Normalization 7.1 Introduction 7.2 Avoiding Redundancy 7.3 Join Dependencies 7.4 Fifth Normal Form 7.5 Functional Dependencies 7.6 Keys 7.7 The Role of FDs and Keys in Optimization 7.8 Boyce-Codd Normal Form (BCNF) 7.9 JDs Not Arising from FDs EXERCISES 8. Database Design II: Other Issues 8.1 Group-Ungroup and Wrap-Unwrap Normalization 8.2 Restriction-Union Normalization 8.3 Surrogate Keys 8.4 Representing “Entity Subtypes”-a free ebook from bookboon.com |

## Download

URL: | http://bookboon.com |

Download link: | http://bookboon.com/uk/student/it/an-introduction-to-relational-database-theory |

Flags: |

Duplicates: |