Date C.J. [2012, PDF/EPUB, ENG]

Книги и журналы » Компьютерная литература » СУБД

Database Design and Relational Theory

Год: 2012
Автор: Date C.J. / Дейт К.Дж
Издательство: O’Reilly Media, Inc.
ISBN: 978-1-4493-2800-9
Язык: Английский
Формат: PDF/EPUB
Качество: Изначально компьютерное (eBook)
Количество страниц: 278
Описание: What makes this book different from others on database design? Many resources on design practice do little to explain the underlying theory, and books on design theory are aimed primarily at theoreticians. In this book, renowned expert Chris Date bridges the gap by introducing design theory in ways practitioners can understand—drawing on lessons learned over four decades of experience to demonstrate why proper database design is so critical in the first place.
Every chapter includes a set of exercises that show how to apply the theoretical ideas in practice, provide additional information, or ask you to prove some simple theoretical result. If you’re a database professional familiar with the relational model, and have more than a passing interest in database design, this book is for you.
Questions this book answers include: Why is Heath’s Theorem so important?
What is The Principle of Orthogonal Design?
What makes some JDs reducible and others irreducible?
Why does dependency preservation matter?
Should data redundancy always be avoided? Can it be? Databases often stay in production for decades, and careful design is critical for avoiding subtle errors and processing problems over time. If they’re badly designed, the negative impacts can be incredibly widespread. This gentle introduction shows you how to use important theoretical results to create good database designs.
[spoiler="Примеры страниц"]

[/spoiler]
[spoiler="Оглавление"]
SETTING THE SCENE Chapter 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 Chapter 2 Prerequisites OVERVIEW
RELATIONS AND RELVARS
PREDICATES AND PROPOSITIONS
MORE ON SUPPLIERS AND PARTS
EXERCISES FUNCTIONAL DEPENDENCIES, BOYCE/CODD NORMAL FORM, AND RELATED MATTERS Chapter 3 Normalization: Some Generalities NORMALIZATION SERVES TWO PURPOSES
UPDATE ANOMALIES
THE NORMAL FORM HIERARCHY
NORMALIZATION AND CONSTRAINTS
CONCLUDING REMARKS
EXERCISES Chapter 4 FDs and BCNF (Informal) FIRST NORMAL FORM
FUNCTIONAL DEPENDENCIES
KEYS REVISITED
SECOND NORMAL FORM
THIRD NORMAL FORM
BOYCE/CODD NORMAL FORM
EXERCISES Chapter 5 FDs and BCNF (Formal) PRELIMINARY DEFINITIONS
FUNCTIONAL DEPENDENCIES
BOYCE/CODD NORMAL FORM
HEATH’S THEOREM
EXERCISES Chapter 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 Chapter 7 FD Axiomatization ARMSTRONG’S AXIOMS
ADDITIONAL RULES
PROVING THE ADDITIONAL RULES
ANOTHER KIND OF CLOSURE
EXERCISES Chapter 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 JOIN DEPENDENCIES, FIFTH NORMAL FORM, AND RELATED MATTERS Chapter 9 JDs and 5NF (Informal) JOIN DEPENDENCIES—THE BASIC IDEA
A RELVAR IN BCNF AND NOT 5NF
CYCLIC RULES
CONCLUDING REMARKS
EXERCISES Chapter 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 Chapter 11 Implicit Dependencies IRRELEVANT COMPONENTS
COMBINING COMPONENTS
IRREDUCIBLE JDs
SUMMARY SO FAR
THE CHASE ALGORITHM
CONCLUDING REMARKS
EXERCISES Chapter 12 MVDs and 4NF AN INTRODUCTORY EXAMPLE
MULTIVALUED DEPENDENCIES (INFORMAL)
MULTIVALUED DEPENDENCIES (FORMAL)
FOURTH NORMAL FORM
AXIOMATIZATION
EMBEDDED DEPENDENCIES
EXERCISES Chapter 13 Additional Normal Forms EQUALITY DEPENDENCIES
SIXTH NORMAL FORM
SUPERKEY NORMAL FORM
REDUNDANCY FREE NORMAL FORM
DOMAIN-KEY NORMAL FORM
CONCLUDING REMARKS
EXERCISES ORTHOGONALITY Chapter 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 REDUNDANCY Chapter 15 We Need More Science A LITTLE HISTORY
DATABASE DESIGN IS PREDICATE DESIGN
MANAGING REDUNDANCY
REFINING THE DEFINITION
CONCLUDING REMARKS
EXERCISES APPENDIXES Appendix Primary Keys Are Nice but Not Essential
Appendix Redundancy Revisited
Appendix Historical Notes
Appendix Answers to Exercises
[/spoiler]