Database Design and Relational Theory

by
Edition: 1st
Format: Paperback
Pub. Date: 2012-04-24
Publisher(s): Oreilly & Associates Inc
List Price: $44.99

Buy New

Usually Ships in 5-7 Business Days
$44.95

Rent Textbook

Select for Price
There was a problem. Please try again later.

Rent Digital

Rent Digital Options
Online:1825 Days access
Downloadable:Lifetime Access
$46.79
*To support the delivery of the digital material to you, a digital delivery fee of $3.99 will be charged on each digital item.
$46.79*

Used Textbook

We're Sorry
Sold Out

How Marketplace Works:

  • This item is offered by an independent seller and not shipped from our warehouse
  • Item details like edition and cover design may differ from our description; see seller's comments before ordering.
  • Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
  • Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
  • Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.

Summary

Because databases often stay in production for decades, careful design is critical to making the database serve the needs of your users over years, and to avoid subtle errors or performance problems. In this book, CJ Date, a leading exponent of relational databases, lays out the principles of good database design. Database Design and Relational Theory investigates denormalization, implicit dependencies, redundancy, and many other topics. DBAs will produce better designs and keep their data centers running better through the ideas conveyed in this book. Questions that this book answers include: What is Heath's Theorem, and why is it important? What is The Principle of Orthogonal Design? What makes some JDs reducible and others irreducible? What is dependency preservation, and why is it important? Should data redundancy always be avoided? Can it be?

Author Biography

C.J. Date has a stature that's unique in the database industry. Best known for his bestselling textbook, An Introduction to Database Systems (Addison-Wesley), he has been working with relational database theory since 1970. He enjoys a well-deserved reputation for his ability to explain complex technical issues in a clear and understandable fashion.

Table of Contents

Prefacep. xi
Setting the Scenep. 1
Preliminariesp. 3
Some quotes from the literaturep. 3
A note on terminologyp. 5
The running examplep. 6
Keysp. 7
The place of design theoryp. 8
Aims of this bookp. 11
Concluding remarksp. 12
Exercisesp. 12
Prerequisitesp. 15
Overviewp. 15
Relations and relvarsp. 16
Predicates and propositionsp. 18
More on suppliers and partsp. 20
Exercisesp. 22
Functional Dependencies, Boyce/Codd Normal Form, and Related Mattersp. 25
Normalization: Some Generalitiesp. 27
Normalization serves two purposesp. 29
Update anomaliesp. 31
The normal form hierarchyp. 32
Normalization and constraintsp. 34
Concluding remarksp. 35
Exercisesp. 36
FDs and BCNF (Informal)p. 37
First normal formp. 37
Functional dependenciesp. 40
Keys revisitedp. 42
Second normal formp. 43
Third normal formp. 45
Boyce/Codd normal formp. 45
Exercisesp. 47
FDs and BCNF (Formal)p. 49
Preliminary definitionsp. 49
Functional dependenciesp. 50
Boyce/Codd normal formp. 52
Heath's Theoremp. 54
Exercisesp. 56
Preserving FDsp. 59
An unfortunate conflictp. 60
Another examplep. 63
… And anotherp. 64
… And still anotherp. 66
A procedure that worksp. 67
Identity decompositionsp. 71
More on the conflictp. 72
Independent projectionsp. 73
Exercisesp. 74
FD Axiomatizationp. 75
Armstrong's axiomsp. 75
Additional rulesp. 76
Proving the additional rulesp. 78
Another kind of closurep. 79
Exercisesp. 80
Denormalizationp. 83
"Denormalize for performance"?p. 83
What does denormalization mean?p. 84
What denormalization isn't (I)p. 86
What denormalization isn't (II)p. 88
Denormalization considered harmful (I)p. 90
Denormalization considered harmful (II)p. 91
A final remarkp. 92
Exercisesp. 92
Join Dependencies, Fifth Normal Form, and Related Mattersp. 95
JDs and 5NF (Informal)p. 97
Join dependencies-the basic ideap. 98
A relvar in BCNF and not 5NFp. 100
Cyclic rulesp. 103
Concluding remarksp. 104
Exercisesp. 105
JDs and 5NF (Formal)p. 107
Join dependenciesp. 107
Fifth normal formp. 109
JDs implied by keysp. 110
A useful theoremp. 113
FDs aren't JDsp. 114
Update anomalies revisitedp. 114
Exercisesp. 116
Implicit Dependenciesp. 117
Irrelevant componentsp. 117
Combining componentsp. 118
Irreducible JDsp. 119
Summary so farp. 121
The chase algorithmp. 123
Concluding remarksp. 127
Exercisesp. 127
MVDs and 4NFp. 129
An introductory examplep. 129
Multivalued dependencies (informal)p. 131
Multivalued dependencies (formal)p. 132
Fourth normal formp. 133
Axiomatizationp. 134
Embedded dependenciesp. 135
Exercisesp. 136
Additional Normal Formsp. 139
Equality dependenciesp. 139
Sixth normal formp. 141
Superkey normal formp. 143
Redundancy free normal formp. 144
Domain-key normal formp. 149
Concluding remarksp. 150
Exercisesp. 152
Orthogonalityp. 155
The Principle of Orthogonal Designp. 157
Two cheers for normalizationp. 157
A motivating examplep. 159
A simpler examplep. 160
Tuples vs. propositionsp. 163
The first example revisitedp. 166
The second example revisitedp. 168
The final versionp. 168
A clarificationp. 168
Concluding remarksp. 170
Exercisesp. 171
Redundancyp. 173
We Need More Sciencep. 175
A little historyp. 177
Database design is predicate designp. 178
Example 1p. 180
Example 2p. 181
Example 3p. 181
Example 4p. 181
Example 5p. 182
Example 6p. 183
Example 7p. 185
Example 8p. 187
Example 9p. 188
Example 10p. 189
Example 11p. 190
Example 12p. 190
Managing redundancyp. 191
Refining the definitionp. 193
Concluding remarksp. 200
Exercisesp. 200
Appendixesp. 201
Primary Keys Are Nice but Not Essentialp. 203
Arguments in favor of the PK: AK distinctionp. 204
Relvars with more than one keyp. 206
The invoices and shipments examplep. 208
One primary key per entity type?p. 211
The applicants and employees examplep. 212
Concluding remarksp. 214
Redundancy Revisitedp. 215
Historical Notesp. 219
Answers to Exercisesp. 223
Chapter 1p. 223
Chapter 2p. 224
Chapter 3p. 227
Chapter 4p. 227
Chapter 5p. 232
Chapter 6p. 235
Chapter 7p. 237
Chapter 8p. 240
Chapter 9p. 242
Chapter 10p. 244
Chapter 11p. 245
Chapter 12p. 247
Chapter 13p. 250
Chapter 14p. 253
Chapter 15p. 253
Indexp. 255
Table of Contents provided by Ingram. All Rights Reserved.

An electronic version of this book is available through VitalSource.

This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.

By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.

Digital License

You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.

More details can be found here.

A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.

Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.

Please view the compatibility matrix prior to purchase.