| Preface | p. xi |
| Introduction | p. 1 |
| An Introductory Example | p. 3 |
| What is a Database? | p. 4 |
| Why do we Need Database Management Systems? | p. 4 |
| The Three Levels of Data Abstraction | p. 5 |
| What is a Database Management System? | p. 7 |
| The Concept of Data Independence | p. 8 |
| What is a Data Model? | p. 9 |
| The Relational Data Model | p. 10 |
| The Network Data Model | p. 12 |
| The Hierarchical Data Model | p. 16 |
| The Nested Relational Data Model | p. 19 |
| The Deductive Data Model | p. 22 |
| An Object-Oriented Data Model | p. 25 |
| Discussion | p. 28 |
| Background Material | p. 28 |
| Basic Concepts of Set Theory | p. 29 |
| Basic Concepts of Ordered Sets | p. 33 |
| Basic Concepts of Mathematical Logic | p. 35 |
| Basic Concepts of the Theory of Computing | p. 40 |
| Finite-Model Theory | p. 52 |
| Exercises | p. 59 |
| The Entity-Relationship Model | p. 61 |
| Graphs | p. 63 |
| The Building Blocks of an Entity-Relationship Diagram (ERD) | p. 65 |
| Entities | p. 66 |
| Relationships and their Functionality | p. 66 |
| Attributes and Domains | p. 71 |
| Keys | p. 73 |
| Recursive Relationships | p. 76 |
| Weak Entity Types | p. 76 |
| The Steps Needed for Constructing an ERD | p. 80 |
| Discussion | p. 81 |
| Exercises | p. 82 |
| The Relational Data Model | p. 85 |
| The Data Structure of the Relational Model | p. 86 |
| Query and Update Languages for the Relational Model | p. 91 |
| The Relational Algebra | p. 91 |
| The Domain Relational Calculus | p. 107 |
| Datalog | p. 115 |
| An Update Language for the Relational Model | p. 125 |
| The Equivalence of Query Languages for the Relational Model | p. 132 |
| Domain Independence | p. 133 |
| The Equivalence of the Algebra, the Calculus and Datalog | p. 139 |
| Integrity Constraints in Relational Databases | p. 145 |
| Inference of Integrity Constraints | p. 146 |
| Data Dependencies | p. 149 |
| Functional Dependencies and Keys | p. 150 |
| Armstrong Relations for Functional Dependencies | p. 158 |
| The Implication Problem for Functional Dependencies | p. 160 |
| Lossless Join Decompositions and the Chase Procedure | p. 160 |
| Minimal Covers for Sets of Functional Dependencies | p. 165 |
| Projection of Functional Dependencies | p. 167 |
| Inclusion Dependencies | p. 169 |
| The Chase Procedure for Inclusion Dependencies | p. 174 |
| Armstrong Databases for Inclusion Dependencies | p. 176 |
| The Implication Problem for Inclusion Dependencies | p. 178 |
| Interaction between Functional and Inclusion Dependencies | p. 179 |
| The Case of No Interaction Between Functional and Inclusion Dependencies | p. 186 |
| Multivalued Dependencies | p. 189 |
| Join Dependencies | p. 200 |
| Domain and Cardinality Constraints | p. 212 |
| The View Update Problem | p. 215 |
| Discussion | p. 226 |
| Exercises | p. 227 |
| Relational Database Design | p. 237 |
| Update Anomalies in Relational Databases | p. 238 |
| Desirable Properties of Database Decompositions | p. 245 |
| The Synthesis Versus Decomposition Approaches to Relational Database Design | p. 247 |
| Normal Forms | p. 249 |
| Second Normal Form (2NF) | p. 250 |
| Third Normal Form (3NF) | p. 250 |
| Boyce-Codd Normal Form (BCNF) | p. 253 |
| Inclusion Dependency Normal Form (IDNF) | p. 260 |
| Horizontal Decompositions | p. 264 |
| Algorithms for Converting a Relation Schema into Normal Form | p. 266 |
| A 3NF Synthesis Algorithm | p. 266 |
| BCNF Decompositions | p. 269 |
| How to Obtain a Decomposition in IDNF | p. 274 |
| Converting an ERD into a Relational Database Schema in IDNF | p. 278 |
| Discussion | p. 282 |
| Exercises | p. 282 |
| Incomplete Information in the Relational Data Model | p. 287 |
| Different Types of Null Value | p. 288 |
| The Open and Closed World Assumptions | p. 292 |
| Introducing Order into the Domain | p. 294 |
| Extending the Relational Algebra with Null Values | p. 299 |
| Extending Integrity Constraints with Null Values | p. 309 |
| The Or-sets Approach | p. 325 |
| The Fuzzy Sets Approach | p. 333 |
| The Rough Sets Approach | p. 342 |
| The Default Values Approach | p. 345 |
| Updating Incomplete Relations | p. 347 |
| Discussion | p. 351 |
| Exercises | p. 355 |
| Computable Database Queries and the Expressiveness of the Relational Algebra | p. 359 |
| What is a Computable Database Query? | p. 359 |
| Formalising Computable Database Queries | p. 360 |
| Encodings and Decodings | p. 362 |
| Definition of Computable Database Queries | p. 364 |
| Subclasses of Computable Database Queries | p. 366 |
| Order-Independent Computable Queries | p. 366 |
| Isomorphism-Independent Computable Queries | p. 366 |
| Encoding-Independent Computable Queries | p. 367 |
| An Equivalence Relation on Computable Queries | p. 369 |
| Computational Query Completeness | p. 370 |
| The Expressive Power of the Relational Algebra | p. 374 |
| Adding a Looping Mechanism to the Relational Algebra | p. 377 |
| Discussion | p. 383 |
| Exercises | p. 383 |
| Temporal Relational Databases | p. 385 |
| The Importance of Modelling Time | p. 385 |
| A Taxonomy of Time in Databases | p. 388 |
| Historical Relations | p. 391 |
| A Historical Relational Algebra | p. 393 |
| Historical Relational Completeness | p. 398 |
| TSQL2 | p. 400 |
| Historical Key Dependencies | p. 403 |
| Schema Evolution | p. 405 |
| Discussion | p. 407 |
| Exercises | p. 407 |
| Concurrency Control | p. 409 |
| Manifestations of Concurrency Control | p. 410 |
| Serialisability | p. 415 |
| Serialisability Theory | p. 417 |
| Locking | p. 423 |
| Two-Phase Locking Policy | p. 430 |
| Deadlock | p. 432 |
| Deadlock Detection | p. 434 |
| Deadlock Prevention | p. 436 |
| Lock Granularity and Lock Manager | p. 440 |
| Lock Manager Implementation | p. 443 |
| Timestamp Ordering | p. 445 |
| Timestamp Ordering Implementation | p. 448 |
| Serialisation Graph Testing | p. 451 |
| Discussion | p. 453 |
| Exercises | p. 454 |
| Deductive Databases | p. 459 |
| Model-theoretic Semantics of Datalog | p. 461 |
| Expressive Power of Datalog | p. 480 |
| Equivalence Between Datalog Programs | p. 483 |
| Datalog Not-Equal | p. 493 |
| Updates in Deductive Databases | p. 498 |
| Integrity Constraints in Deductive Databases | p. 502 |
| Discussion | p. 509 |
| Exercises | p. 510 |
| Extensions to the Relational Data Model and Recent Directions | p. 515 |
| Nested Relational Databases | p. 516 |
| Object-Oriented Databases | p. 524 |
| Graph-Based Databases | p. 533 |
| Active Databases | p. 542 |
| Hypertext Databases | p. 547 |
| Semistructured Databases | p. 556 |
| Knowledge Discovery and Data Mining | p. 560 |
| Other Areas | p. 566 |
| What Lies Beyond? | p. 568 |
| Exercises | p. 568 |
| Bibliography | p. 577 |
| Index | p. 609 |
| Table of Contents provided by Syndetics. All Rights Reserved. |
