Table of Contents

(NOTE: Each chapter concludes with Summary and References sections.)

 1. The Worlds of Database Systems.
The Evolution of Database Systems. Overview of a Database Management System. Outline of Database-System Studies.

 2. The Entity-Relationship Data Model.
Elements of the E/R Model. Design Principles. The Modeling of Constraints. Weak Entity Sets.

 3. The Relational Data Model.
Basics of the Relational Model. From E/R Diagrams to Relational Designs. Converting Subclass Structures to Relations. Functional Dependencies. Rules About Functional Dependencies. Design of Relational Database Schemas. Multivalued Dependencies.

 4. Other Data Models.
Review of Object-Oriented Concepts. Introduction to ODL. Additional ODL Concepts. From ODL Designs to Relational Designs. The Object-Relational Model. Semistructured Data. XML and Its Data Model.

 5. Relational Algebra.
An Example Database Schema. An Algebra of Relational Operations. Relational Operations on Bags. Extended Operators of Relational Algebra. Constraints on Relations.

 6. The Database Language SQL.
Simple Queries in SQL. Queries Involving More Than One Relation. Subqueries. Full-Relation Operations. Database Modifications. Defining a Relation Schema in SQL. View Definitions.

 7. Constraints and Triggers.
Keys and Foreign Keys. Constraints on Attributes and Tuples. Modification of Constraints. Schema-Level Constraints and Triggers.

 8. System Aspects of SQL.
SQL in a Programming Environment. Procedures Stored in the Schema. The SQL Environment. Using a Call-Level Interface. Java Database Connectivity. Transactions in SQL. Security and User Authorization in SQL.

 9. Object-Orientation in Query Languages.
Introduction to OQL. Additional Forms of OQL Expressions. Object Assignment and Creation in OQL. User-Defined Types in SQL. Operations on Object-Relational Data.

10. Logical Query Languages.
A Logic for Relations. From Relational Algebra to Datalog. Recursive Programming in Datalog. Recursion in SQL.

11. Data Storage.
The “Megatron 2002” Database System. The Memory Hierarchy. Disks. Using Secondary Storage Effectively. Accelerating Access to Secondary Storage. Disk Failures. Recovery from Disk Crashes.

12. Representing Data Elements.
Data Elements and Fields. Records. Representing Block and Record Addresses. Variable-Length Data and Records. Record Modifications.

13. Index Structures.
Indexes on Sequential Files. Secondary Indexes. B-Trees. Hash Tables.

14. Multidimensional Indexes.
Applications Needing Multiple Dimensions. Hash-Like Structures for Multidimensional Data. Tree-Like Structures for Multidimensional Data. Bitmap Indexes.

15. Query Execution.
Introduction to Physical-Query-Plan Operators. One-Pass Algorithms for Database Operations. Nested-Loop Joins. Two-Pass Algorithms Based on Sorting. Two-Pass Algorithms Based on Hashing. Index-Based Algorithms. Buffer Management. Algorithms Using More Than Two Passes. Parallel Algorithms for Relational Operations.

16. The Query Compiler.
Parsing. Algebraic Laws for Improving Query Plans. From Parse Trees to Logical Query Plans. Estimating the Cost of Operations. Introduction to Cost-Based Plan Selection. Choosing an Order for Joins. Completing the Physical-Query-Plan.

17. Coping with System Failures.
Issues and Models for Resilient Operation. Undo Logging. Redo Logging. Undo/Redo Logging. Protecting Against Media Failures.

18. Concurrency Control.
Serial and Serializable Schedules. Conflict-Serializability. Enforcing Serializability by Locks. Locking Systems With Several Lock Modes. An Architecture for a Locking Scheduler. Managing Hierarchies of Database Elements. The Tree Protocol. Concurrency Control by Timestamps. Concurrency Control by Validation.

19. More about Transaction Management.
Serializability and Recoverability. View Serializability. Resolving Deadlocks. Distributed Databases. Distributed Commit. Distributed Locking. Long-Duration Transactions.

20. Information Integration.
Modes of Information Integration. Wrappers in Mediator-Based Systems. Capability-Based Optimization in Mediators. On-Line Analytic Processing. Data Cubes. Data Mining.

Index.

About the Author

JEFFREY D. ULLMAN is the Stanford W. Ascherman Professor of Computer Science at Stanford University. He is the author or co-author of 16 books, including Elements of ML Programming (Prentice Hall 1998). His research interests include data mining, information integration, and electronic education. He is a member of the National Academy of Engineering, and recipient of a Guggenheim Fellowship, the Karl V. Karlstrom Outstanding Educator Award, the SIGMOD Contributions Award, and the Knuth Prize.

JENNIFER WIDOM is Associate Professor of Computer Science and Electrical Engineering at Stanford University. Her research interests include query processing on data streams, data caching and replication, semistructured data and XML, and data warehousing. She is a former Guggenheim Fellow and has served on numerous program committees, advisory boards, and editorial boards.

HECTOR GARCIA-MOLINA is the L. Bosack and S. Lerner Professor of Computer Science and Electrical Engineering, and Chair of the Department of Computer Science at Stanford University. His research interests include digital libraries, information integration, and database application on the Internet. He was a recipient of the SIGMOD Innovations Award and is a member of PITAC (President's Information-Technology Advisory Council).