The sixth edition of this well-respected text/reference--which has been almost completely rewritten--continues to be the most comprehensive and up-to-date treatment of database technology currently available.
Readers will gain a strong working knowledge of the overall structure, concepts, and objectives of database systems and will become familiar with the theoretical principles underlying the construction of such systems.
|Edition description:||Older Edition|
|Product dimensions:||7.86(w) x 9.52(h) x 1.57(d)|
Table of Contents
(All chapters begin with an Introduction end with a Summary, Exercises, and Reference and Bibliography)
1. An Overview of Database Management.
What is a database system?
What is a database?
Relational systems and others.
2. Database System Architecture.
The three levels of the architecture.
The external level.
The conceptual level.
The internal level.
The database administrator.
The database management system.
3. An Introduction to Relational Databases.
An informal look at the relational model.
Relations and relvars.
What relations mean.
Base relvars and views.
The suppliers-and-parts database.
4. An Introduction to SQL.
Dynamic SQL and SQL/CLI.
SQL is not perfect.
II. THE RELATIONAL MODEL.
Values v Variables.
Types v Representations.
7. Relational Algebra.
The original algebra: Syntax.
The original algebra: Semantics.
What is the algebra for?
Grouping and ungrouping.
8. Relational Calculus.
Calculus vs. algebra.
A closer look.
Predicates and propositions.
Relvar predicates and database predicates.
Checking the constraints.
Internal v external constraints.
Correctness v consistency.
Integrity and views.
A constraint classification scheme.
Triggers (a digression).
What are views for?
Snapshots (a digression).
III. DATABASE DESIGN.
11. Functional Dependencies.
Trivial and nontrivial dependencies.
Closure of a set of dependencies.
Closure of a set of attributes.
Irreducible sets of dependencies.
12. Further Normalization I: 1NF, 2NF, 3NF, BCNF.
Nonloss decomposition and functional dependencies.
First, second, and third normal forms.
Boyce/Codd normal form.
A note on relation-valued attributes.
13. Further Normalization II: Higher Normal Forms.
Multi-valued dependencies and fourth normal form.
Join dependencies and fifth normal form.
The normalization procedure summarized.
A note on denormalization.
Orthogonal design (a digression).
Other normal forms.
14. Semantic Modeling.
The overall approach.
The E/R model.
Database design with the E/R model.
A brief analysis.
IV. TRANSACTION MANAGEMENT.
Savepoints (a digression).
Three concurrency problems.
The three concurrency problems revisited.
V. FURTHER TOPICS.
Discretionary access control.
Mandatory access control.
A motivating example.
An overview of query processing.
A divide-and-conquer strategy.
Implementing the relational operators.
19. Missing Information.
An overview of the 3VL approach.
Some consequences of the foregoing scheme.
Nulls and keys.
Outer join (a digression).
20. Type Inheritance.
Polymorphism and substitutability.
Variables and assignments.
Specialization by constraint.
Operators, versions, and signatures.
Is a circle an ellipse?
Specialization by constraint revisited.
21. Distributed Databases.
The twelve objectives.
Problems of distributed systems.
22. Decision Support.
Aspects of decision support.
Database design for decision support.
Data warehouses and data marts.
Online analytical processing.
23. Temporal Databases.
What is the problem?
Packing and unpacking relations.
Generalizing the relational operators.
Database work design.
24. Logic-Based Databases.
A proof-theoretic view of databases.
Deductive database systems.
Recursive query processing.
VI. OBJECTS, RELATIONS, AND
25. Object Databases.
Objects, classes, methods, and messages.
A closer look.
A cradle-to-grave example.
26. Object / Relational Databases.
The First Great Blunder.
The Second Great Blunder.
Benefits of true rapprochement.
27. The World Wide Web and
The Web and the Internet.
An overview of
Appendix A: The TransRelational™ Model.
Three levels of abstraction.
The basic idea.
Implementing the relational operators.
Appendix B: SQL Expressions, Table Expressions, and Boolean Expressions.
Appendix C: Abbreviations, Acronyms, and Symbol.
Appendix D: Online storage structures and access methods, database access: an overview, page sets and files, indexing, hashing, pointer chains, and compression techniques.
Most Helpful Customer Reviews
Our university just suggested us to use this text book (only read it till Chapter 20 in class but umm found it so easy and enjoy reading it (even in free periods)that I read it till 25 th chapter. I found it interesting , faced some problems in the start but in my opinion it is cool and easy to understand in addition to that it contains a wide variety of References and Bibilography's. I really liked it.
Date's treatment of database systems is heavily weighted toward the foundational principles of the relational model. If that is not what you are looking for, this text is not for you. If you want to learn SQL, get a good SQL book. If you want to play with MS-Access, by all means, do so. If you have a five-minute attention span, this book isn't for you. If, however, you wish to understand the foundational principles of database systems and what makes for a 'good' DBMS, this is the text for you. If you can't understand the theory in this book, you have no real business calling yourself a database professional. Prior to this time, I had avoided using DBMSs (as being one of the more boring aspects of computer science.) Spending six weeks wading through this book changed my mind on that. Date shows the beauty of the relational model clearly and precisely (I will grant that the emphasis is on precision rather than simplicity.) Date shows the flaws of SQL as well as its power. In this new 7th edition, more than in the earlier edition, he proclaims the way database sytems should be structured, rather than accepting the SQL status quo. He also points out clearly how the so-called object model really isn't a data model at all, and could lead us back to the 'bad old days' of ad-hoc DBMSs with no theoretical nderpinnings (and hence no verifiability.)