Database Design and Relational Theory by Date, C.J. -- Read -- Imperial Library of Trantor

Index

Database Design and Relational Theory SPECIAL OFFER: Upgrade this ebook with O’Reilly Preface

Prerequisites Logical vs. Physical Design Acknowledgments

I. SETTING THE SCENE

1. Preliminaries

SOME QUOTES FROM THE LITERATURE A NOTE ON TERMINOLOGY THE RUNNING EXAMPLE KEYS THE PLACE OF DESIGN THEORY AIMS OF THIS BOOK CONCLUDING REMARKS EXERCISES

2. Prerequisites

OVERVIEW RELATIONS AND RELVARS PREDICATES AND PROPOSITIONS MORE ON SUPPLIERS AND PARTS EXERCISES

II. FUNCTIONAL DEPENDENCIES, BOYCE/CODD NORMAL FORM, AND RELATED MATTERS

3. Normalization: Some Generalities

NORMALIZATION SERVES TWO PURPOSES UPDATE ANOMALIES THE NORMAL FORM HIERARCHY NORMALIZATION AND CONSTRAINTS CONCLUDING REMARKS EXERCISES

4. FDs and BCNF (Informal)

FIRST NORMAL FORM FUNCTIONAL DEPENDENCIES KEYS REVISITED SECOND NORMAL FORM THIRD NORMAL FORM BOYCE/CODD NORMAL FORM EXERCISES

5. FDs and BCNF (Formal)

PRELIMINARY DEFINITIONS FUNCTIONAL DEPENDENCIES BOYCE/CODD NORMAL FORM HEATH’S THEOREM EXERCISES

6. Preserving FDs

AN UNFORTUNATE CONFLICT ANOTHER EXAMPLE ... AND ANOTHER ... AND STILL ANOTHER A PROCEDURE THAT WORKS IDENTITY DECOMPOSITIONS MORE ON THE CONFLICT INDEPENDENT PROJECTIONS EXERCISES

7. FD Axiomatization

ARMSTRONG’S AXIOMS ADDITIONAL RULES PROVING THE ADDITIONAL RULES ANOTHER KIND OF CLOSURE EXERCISES

8. Denormalization

“DENORMALIZE FOR PERFORMANCE”? WHAT DOES DENORMALIZATION MEAN? WHAT DENORMALIZATION ISN’T (I) WHAT DENORMALIZATION ISN’T (II) DENORMALIZATION CONSIDERED HARMFUL (I) DENORMALIZATION CONSIDERED HARMFUL (II) A FINAL REMARK EXERCISES

III. JOIN DEPENDENCIES, FIFTH NORMAL FORM, AND RELATED MATTERS

9. JDs and 5NF (Informal)

JOIN DEPENDENCIES—THE BASIC IDEA A RELVAR IN BCNF AND NOT 5NF CYCLIC RULES CONCLUDING REMARKS EXERCISES

10. JDs and 5NF (Formal)

JOIN DEPENDENCIES FIFTH NORMAL FORM JDs IMPLIED BY KEYS A USEFUL THEOREM FDs AREN’T JDs UPDATE ANOMALIES REVISITED EXERCISES

11. Implicit Dependencies

IRRELEVANT COMPONENTS COMBINING COMPONENTS IRREDUCIBLE JDs SUMMARY SO FAR THE CHASE ALGORITHM CONCLUDING REMARKS EXERCISES

12. MVDs and 4NF

AN INTRODUCTORY EXAMPLE MULTIVALUED DEPENDENCIES (INFORMAL) MULTIVALUED DEPENDENCIES (FORMAL) FOURTH NORMAL FORM AXIOMATIZATION EMBEDDED DEPENDENCIES EXERCISES

13. Additional Normal Forms

EQUALITY DEPENDENCIES SIXTH NORMAL FORM SUPERKEY NORMAL FORM REDUNDANCY FREE NORMAL FORM DOMAIN-KEY NORMAL FORM CONCLUDING REMARKS

Elementary key normal form (EKNF) Overstrong PJ/NF “Restriction-union” normal form

EXERCISES

IV. ORTHOGONALITY

14. The Principle of Orthogonal Design

TWO CHEERS FOR NORMALIZATION A MOTIVATING EXAMPLE A SIMPLER EXAMPLE TUPLES vs. PROPOSITIONS THE FIRST EXAMPLE REVISITED THE SECOND EXAMPLE REVISITED THE FINAL VERSION A CLARIFICATION CONCLUDING REMARKS EXERCISES

V. REDUNDANCY

15. We Need More Science

A LITTLE HISTORY DATABASE DESIGN IS PREDICATE DESIGN EXAMPLE 1 EXAMPLE 2 EXAMPLE 3 EXAMPLE 4 EXAMPLE 5 EXAMPLE 6 EXAMPLE 7 EXAMPLE 8 EXAMPLE 9 EXAMPLE 10 EXAMPLE 11 EXAMPLE 12 MANAGING REDUNDANCY

1. Raw Design Only 2. Declare the Constraint 3. Use a View 4. Use a Snapshot

REFINING THE DEFINITION

Examples 1-2 Example 3 Example 4 Example 5 Example 6 Example 7 Example 8 Example 9 Example 10 Example 11 Example 12

CONCLUDING REMARKS EXERCISES

VI. APPENDIXES

A. Primary Keys Are Nice but Not Essential

ARGUMENTS IN DEFENSE OF THE PK:AK DISTINCTION RELVARS WITH MORE THAN ONE KEY THE INVOICES AND SHIPMENTS EXAMPLE ONE PRIMARY KEY PER ENTITY TYPE? THE APPLICANTS AND EMPLOYEES EXAMPLE CONCLUDING REMARKS

B. Redundancy Revisited C. Historical Notes D. Answers to Exercises

CHAPTER 1 CHAPTER 2 CHAPTER 3 CHAPTER 4 CHAPTER 5 CHAPTER 6 CHAPTER 7 CHAPTER 8 CHAPTER 9 CHAPTER 10 CHAPTER 11 CHAPTER 12 CHAPTER 13 CHAPTER 14 CHAPTER 15

Index About the Author SPECIAL OFFER: Upgrade this ebook with O’Reilly

← Prev
Back
Next →

← Prev
Back
Next →