最新版 《A First Course in Database Systems》3ed (2008)
本书中国售价： ￥45
美国amazon售价：$77.96
http://www.amazon.com/First-Course-Database-Systems-3rd/dp/013600637X/ref=sr_1_1?ie=UTF8&s=books&qid=1262327848&sr=1-1

*名称：A First Course in Database Systems, (3rd Edition) by Jeffrey D. Ullman and Jennifer Widom
*大小：592页(7.4M)
*格式： DJVU
*目录:
        FIRST COURSE IN DATABASE SYSTEMS -- Third Edition

             Jeffrey D. Ullman
             Jennifer Widom

             TABLE OF CONTENTS

1 The Worlds of Database Systems
    1.1 The Evolution of Database Systems
        1.1.1 Early Database Management Systems
        1.1.2 Relational Database Systems
        1.1.3 Smaller and Smaller Systems
        1.1.4 Bigger and Bigger Systems
        1.1.5 Information Integration
    1.2 Overview of a Database Management System
        1.2.1 Data-Definition Language Commands
        1.2.2 Overview of Query Processing
        1.2.3 Storage and Buffer Management
        1.2.4 Transaction Processing
        1.2.5 The Query Processor
    1.3 Outline of Database-System Studies
    1.4 References for Chapter 1

PART I: Relational Database Modeling

2 The Relational Model of Data
    2.1 An Overview of Data Models
        2.1.1 What is a Data Model?
        2.1.2 Important Data Models
        2.1.3 The Relational Model in Brief
        2.1.4 The Semistructured Model in Brief
        2.1.5 Other Data Models
        2.1.6 Comparison of Modeling Approaches
    2.2 Basics of the Relational Model
        2.2.1 Attributes
        2.2.2 Schemas
        2.2.3 Tuples
        2.2.4 Domains
        2.2.5 Equivalent Representations of a Relation
        2.2.6 Relation Instances
        2.2.7 Keys of Relations
        2.2.8 An Example Database Schema
        2.2.9 Exercises for Section 2.2
    2.3 Defining a Relation Schema in SQL
        2.3.1 Relations in SQL
        2.3.2 Data Types
        2.3.3 Simple Table Declarations
        2.3.4 Modifying Relation Schemas
        2.3.5 Default Values
        2.3.6 Declaring Keys
        2.3.7 Exercises for Section 2.3
    2.4 An Algebraic Query Language
        2.4.1 Why Do We Need a Special Query Language?
        2.4.2 What is an Algebra?
        2.4.3 Overview of Relational Algebra
        2.4.4 Set Operations on Relations
        2.4.5 Projection
        2.4.6 Selection
        2.4.7 Cartesian Product
        2.4.8 Natural Joins
        2.4.9 Theta-Joins
        2.4.10 Combining Operations to Form Queries
        2.4.11 Naming and Renaming
        2.4.12 Relationships Among Operations
        2.4.13 A Linear Notation for Algebraic Expressions
        2.4.14 Exercises for Section 2.4
    2.5 Constraints on Relations
        2.5.1 Relational Algebra as a Constraint Language
        2.5.2 Referential Integrity Constraints
        2.5.3 Key Constraints
        2.5.4 Additional Constraint Examples
        2.5.5 Exercises for Section 2.5
    2.6 Summary of Chapter 2
    2.7 References for Chapter 2
3 Design Theory for Relational Databases
    3.1 Functional Dependencies
        3.1.1 Definition of Functional Dependency
        3.1.2 Keys of Relations
        3.1.3 Superkeys
        3.1.4 Exercises for Section 3.1
    3.2 Rules About Functional Dependencies
        3.2.1 Reasoning About Functional Dependencies
        3.2.2 The Splitting/Combining Rule
        3.2.3 Trivial Functional Dependencies
        3.2.4 Computing the Closure of Attributes
        3.2.5 Why the Closure Algorithm Works
        3.2.6 The Transitive Rule
        3.2.7 Closing Sets of Functional Dependencies
        3.2.8 Projecting Functional Dependencies
        3.2.9 Exercises for Section 3.2
    3.3 Design of Relational Database Schemas
        3.3.1 Anomalies
        3.3.2 Decomposing Relations
        3.3.3 Boyce-Codd Normal Form
        3.3.4 Decomposition into BCNF
        3.3.5 Exercises for Section 3.3
    3.4 Decomposition: The Good, Bad, and Ugly
        3.4.1 Recovering Information from a Decomposition
        3.4.2 The Chase Test for Lossless Join
        3.4.3 Why the Chase Works
        3.4.4 Dependency Preservation
        3.4.5 Exercises for Section 3.4
    3.5 Third Normal Form
        3.5.1 Definition of Third Normal Form
        3.5.2 The Synthesis Algorithm for 3NF Schemas
        3.5.3 Why the 3NF Synthesis Algorithm Works
        3.5.4 Exercises for Section 3.5
    3.6 Multivalued Dependencies
        3.6.1 Attribute Independence and Its Consequent Redundancy
        3.6.2 Definition of Multivalued Dependencies
        3.6.3 Reasoning About Multivalued Dependencies
        3.6.4 Fourth Normal Form
        3.6.5 Decomposition into Fourth Normal Form
        3.6.6 Relationships Among Normal Forms
        3.6.7 Exercises for Section 3.6
    3.7 An Algorithm for Discovering MVD's
        3.7.1 The Closure and the Chase
        3.7.2 Extending the Chase to MVD's
        3.7.3 Why the Chase Works for MVD's
        3.7.4 Projecting MVD's
        3.7.5 Exercises for Section 3.7
    3.8 Summary of Chapter 3
    3.9 References for Chapter 3
4 High-Level Database Models
    4.1 The Entity/Relationship Model
        4.1.1 Entity Sets
        4.1.2 Attributes
        4.1.3 Relationships
        4.1.4 Entity-Relationship Diagrams
        4.1.5 Instances of an E/R Diagram
        4.1.6 Multiplicity of Binary E/R Relationships
        4.1.7 Multiway Relationships
        4.1.8 Roles in Relationships
        4.1.9 Attributes on Relationships
        4.1.10 Converting Multiway Relationships to Binary
        4.1.11 Subclasses in the E/R Model
        4.1.12 Exercises for Section 4.1
    4.2 Design Principles
        4.2.1 Faithfulness
        4.2.2 Avoiding Redundancy
        4.2.3 Simplicity Counts
        4.2.4 Choosing the Right Relationships
        4.2.5 Picking the Right Kind of Element
        4.2.6 Exercises for Section 4.2
    4.3 Constraints in the E/R Model
        4.3.1 Keys in the E/R Model
        4.3.2 Representing Keys in the E/R Model
        4.3.3 Referential Integrity
        4.3.4 Degree Constraints
        4.3.5 Exercises for Section 4.3
    4.4 Weak Entity Sets
        4.4.1 Causes of Weak Entity Sets
        4.4.2 Requirements for Weak Entity Sets
        4.4.3 Weak Entity Set Notation
        4.4.4 Exercises for Section 4.4
    4.5 From E/R Diagrams to Relational Designs
        4.5.1 From Entity Sets to Relations
        4.5.2 From E/R Relationships to Relations
        4.5.3 Combining Relations
        4.5.4 Handling Weak Entity Sets
        4.5.5 Exercises for Section 4.5
    4.6 Converting Subclass Structures to Relations
        4.6.1 E/R-Style Conversion
        4.6.2 An Object-Oriented Approach
        4.6.3 Using Null Values to Combine Relations
        4.6.4 Comparison of Approaches
        4.6.5 Exercises for Section 4.6
    4.7 Unified Modeling Language
        4.7.1 UML Classes
        4.7.2 Keys for UML classes
        4.7.3 Associations
        4.7.4 Self-Associations
        4.7.5 Association Classes
        4.7.6 Subclasses in UML
        4.7.7 Aggregations and Compositions
        4.7.8 Exercises for Section 4.7
    4.8 From UML Diagrams to Relations
        4.8.1 UML-to-Relations Basics
        4.8.2 From UML Subclasses to Relations
        4.8.3 From Aggregations and Compositions to Relations
        4.8.4 The UML Analog of Weak Entity Sets
        4.8.5 Exercises for Section 4.8
    4.9 Object Definition Language
        4.9.1 Class Declarations
        4.9.2 Attributes in ODL
        4.9.3 Relationships in ODL
        4.9.4 Inverse Relationships
        4.9.5 Multiplicity of Relationships
        4.9.6 Types in ODL
        4.9.7 Subclasses in ODL
        4.9.8 Declaring Keys in ODL
        4.9.9 Exercises for Section 4.9
    4.10 From ODL Designs to Relational Designs
        4.10.1 From ODL Classes to Relations
        4.10.2 Complex Attributes in Classes
        4.10.3 Representing Set-Valued Attributes
        4.10.4 Representing Other Type Constructors
        4.10.5 Representing ODL Relationships
        4.10.6 Exercises for Section 4.10
    4.11 Summary of Chapter 4
    4.12 References for Chapter 4