ISBN 9789350237298,Database Design and Relational Theory

Database Design and Relational Theory

Rs450 Rs500 10% OFF

Availability: Available

Usually ships in: 7-14 business days

(Free Delivery)

We Accept
ISBN 9789350237298
Check delivery information
 
ISBN 9789350237298
Publisher

Shroff Publishers & Distributors Pvt Ltd

Publication Year 2012
ISBN-13

ISBN 9789350237298

ISBN-10 9350237296
Binding

Paper Back

Number of Pages 294 Pages
Language (English)
Subject

Database programming

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.

About the Author
C.J. Date has a stature that is unique within the database industry. C.J. is a prolific writer, and is well-known for his best-selling textbook: An Introduction to Database Systems (Addison Wesley). C.J. is an exceptionally clear-thinking writer who can lay out principles and theory in a way easily understood by his audience.

Table Of Contents
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 De normalization

"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

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
Refining The Definition
Concluding Remarks
Exercises
Appendixes

Appendix 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
Appendix Redundancy Revisited
Appendix Historical Notes
Appendix 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
Scroll