数据库系统基础教程A First Course in Database Systems,2nd Edition(英文原版进口)

.1.4 summary of chapter 1
1.5 references for chapter 1
the entity-relationship data model
2.1 elements of the e/r model
2.1.1 entity sets
2.1.2 attributes
2.1.3 relationships
2.1.4 entity-relationship diagrams
2.1.5 instances of an e/r diagram
2.1.6 multiplicity of binary e/r relationships
2.1.7 multiwav relationships
2.1.8 roles in relationships
2.1.9 attributes on relationships
2.1.10 converting multiway relationships to binary
2.1.11 subclasses in the e/r model
2.1.12 exercises for section 2.1
2.2 design principles
2.2.1 faithfulness
2.2.2 avoiding redundancy
2.2.3 simplicity counts
2.2.4 choosing the right relationships
2.2.,5 picking the right kind of element
2.2.6 exercises for section 2.2
2.3 the modeling of constraints
2.3.1 classification of constraints
2.3.2 keys in the e/r model
2.3.3 representing keys in the e/r model
2.3.4 single-value constraints
2.3..5 referential integrity
2.3.6 referential integrity in e/r diagrams
2.3.7 other kinds of constraints
2.3.8 exercises for section 2.3
2.4 weak entity sets
2.4.1 causes of weak entity sets
2.4.2 requirements for weak entity sets
2.4.3 weak entity set notation
2.4.4 exercises for section 2.4
2.5 summary of chapter 2
2.6 references for chapter 2
the relational data model
3.1 basics of the relational model
3.1.1 attributes
3.1.2 schemas
3.1.3 tuples
3.1.4 domains
3.1.5 equivalent representations of a relation
3.1.6 relation instances
3.1.7 exercises for section 3.1
3.2 from e/r diagrams to relational designs
3.2.1 from entity sets to relations
3.2.2 from e/r relationships to relations
3.2.3 combining relations
3.2.4 handling weak entity sets
3.2.5 exercises for section 3.2
3.3 converting subclass structures to relations
3.3.1 e/r-style conversion
3.3.2 an object-oriented approach
3.3.3 using null values to combine relations
3.3.4 comparison of approaches
3.3.5 exercises for section 3.3
3.4 functional dependencies
3.4.1 definition of functional dependency
3.4.2 keys of relations
3.4.3 superkeys
3.4.4 discovering keys for relations
3.4.5 exercises for section 3.4
3.5 rules about functional dependencies
3.5.1 the splitting/combining rule
3.5.2 trivial functional dependencies
3.5.3 computing the closure of attributes
3.5.4 why the closure algorithm works
3.5.5 the transitive rule
3.5.6 closing sets of functional dependencies
3..5.7 projecting functional dependencies
3..5.8 exercises for section 3..5
3.6 design of relational database schemas
3.6.1 anomalies
3.6.2 decomposing relations
3.6.3 boyce-codd normal form
3.6.4 decomposition into bcnf
3.6.5 recovering information from a decomposition
3.6.6 third normal form
3.6.7 exercises for section 3.6
3.7 multivalued dependencies
3.7.1 attribute independence and its consequent redundancy
3.7.2 definition of multivalued dependencies
3.7.3 reasoning about multivalued dependencies
3.7.4 fourth normal form
3.7.5 decomposition into fourth normal form
3.7.6 relationships among normal forms
3.7.7 exercises for section 3.7
3.8 summary of chapter 3
3.9 references for chapter 3
other data models
4.1 review of object-oriented concepts
4.1.1 the type system
4.1.2 classes and objects
4.1.3 object identity
4.1.4 _methods
4.1.5 class hierarchies
4.2 introduction to odl
4.2.1 object-oriented design
4.2.2 class declarations
4.2.3 attributes in odl
4.2.4 relationships in odl
4.2.5 inverse relationships
4.2.6 multiplicity of relationships
4.2.7 methods in odl
4.2.8 types in odl
4.2.9 exercises for section 4.2
4.3 additional odl concepts
4.3.1 multiway relationships in odl
4.3.2 subclasses in odl
4.3.3 multiple inheritance in odl
4.3.4 extents
4.3.5 declaring keys ii10dl
4.3.6 exercises for section 4.3
4.4 from odl designs to relational designs
4.4.1 from odl attributes to relational attributes
4.4.2 nonatomic attributes in classes
4.4.3 representing set-valued attributes
4.4.4 representing other type constructors
4.4.5 representing odl relationships
4.4.6 what if' there is no key?
4.4.7 exercises for section 4.4
4.5 the object-relational model
4.5.1 from relations to object-relations
4.5.2 nested relations
4.5.3 references
4.5.4 object-oriented versus object-relational
4.5.5 from odl designs to object-relational designs
4.5.6 exercises for section 4.5
4.6 semistructured data
4.6.1 motivation for the semistructured-data model
4.6.2 semistructured data representation
4.6.3 information integration via semistructured data
4.6.4 exercises for section 4.6
4.7 xml and its data model
4.7.1 semautic tags
4.7.2 well-formed xml
4.7.3 document type definitions
4.7.4 using a dtd
4.7.5 attribute lists
4.7.6 exercises ibr section 4.7
4.8 summary of chapter 4
4.9 references for chapter 4
5 relational algebra
5.1 an example database schema
5.2 an algebra of relational operations
5.2.1 basics of relational algebra
5.2.2 set operations on relations
5.2.3 projection
5.2.4 selection
5.2.5 cartesian product
5.2.6 natural joins
5.2.7 theta-joins
5.2.8 combining operations to form queries
5.2.9 renaming
5.2.10 dependent and independent operations
5.2.11 a linear notation for algebraic expressions
5.2.12 exercises for section 5.2
5.3 relational operations on bags
5.3.1 why bags?
5.3.2 union. intersection. and difference of bags
5.3.3 projection of bags
5.3.4 selection on bags
5.3.5 product of bags
5.3.6 joins of bags
5.3.7 exercises for section 5.3
5.4 extended operators of relational algebra
5.4.1 duplicate elimination
5.4.2 aggregation operators
5.4.3 grouping
5.4.4 the grouping operator
5.4.5 extending the projection operator
5.4.6 the sorting operator
5.4.7 outerjoins
5.4.8 exercises for section 5.4
5.5 constraints on relations
5.5.1 relational algebra as a constraint language
5.5.2 referential integrity constraints
5.5.3 additional constraint examples
5.5.4 exercises for section 5.5
5.6 summary of chapter 5
5.7 references for chapter 5
6 the database language sql
6.1 simple queries in sql
6.1.1 projection in sql
6.1.2 selection iii sql
6.1.3 comparison of strings
6.1.4 dates and times
6.1.5 null values and comparisons involving null
6.1.6 the truth-value unknown
6.1.7 ordering the output
6.1.8 exercises for section 6.1
6.2 queries involving more than one relation
6.2.1 products and joins in sql
6.2.2 disambiguating attributes
6.2.3 tuple variables
6.2.4 interpreting multirelation queries
6.2.5 union, intersection, and difference of queries
6.2.6 exercises for section 6.2
6.3 subqueries
6.3.1 subqueries that produce scalar values
6.3.2 conditions involving relations
6.3.3 conditions involving tuples
6.3.4 correlated subqueries
6.3.5 subqueries in from clauses
6.3.6 sql join expressions
6.3.7 natural joins
6.3.8 outerjoins
6.3.9 exercises for section 6.3
6.4 full-relation operations
6.4.1 eliminating duplicates
6.4.2 duplicates in unions. intersections. and differences
6.4.3 grouping and aggregation in sql
6.4.4 aggregation operators
6.4.5 grouping
6.4.6 having clauses
6.4.7 exercises for section 6.4
6.5 database modifications
6.5.1 insertion
6.5.2 deletion
6.5.3 updates
6.5.4 exercises for section 6.5
6.6 defining a relation schema in sql
6.6.1 data types
6.6.2 simple table declarations
6.6.3 modifying relation schemas
6.6.4 default values
6.6.5 indexes
6.6.6 introduction to selection of indexes
6.6.7 exercises for section 6.6
6.7 view definitions
6.7.1 declaring views
6.7.2 querying views
6.7.3 renaming attributes
6.7.4 modifying views
6.7.5 interpreting queries involving views
6.7.6 exercises for section 6.7
6.8 summary of chapter 6
6.9 references for chapter 6
7 constraints and triggers
7.1 keys and foreign keys
7.1.1 declaring primary keys
7.1.2 keys declared with unique
7.1.3 enforcing key constraints
7.1.4 declaring foreign-key constraints
7.1.5 maintaining referential integrity
7.1.6 deferring the checking of constraints
7.1.7 exercises for section 7.1
7.2 constraints on attributes and tuples
7.2.1 not-null constraints
7.2.2 attribute-based check constraints
7.2.3 tuple-based check constraints
7.2.4 exercises for section 7.2
7.3 modification of constraints
7.3.1 giving names to constraints
7.3.2 altering constraints on tables
7.3.3 exercises for section 7.3 .
7.4 schema-level constraints and triggers
7.4.1 assertions
7.4.2 event-condition-action rules
7.4.3 triggers in sql
7.4.4 instead-of triggers
7.4.5 exercises for section 7.4
7.5 smnmarv of chapter 7
7.6 references for chapter 7
system aspects of sql
8.1 sql in a programming environment
8.1.1 tile impedance mismatch problem
8.1.2 the sql/host language interface
8.1.3 the declare section
8.1.4 using shared variables
8.1.5 single-row select statements
8.1.6 cursors
8.1.7 modifications by cursor
8.1.8 protecting against concurrent updates
8.1.9 scrolling cursors
8.1.10 dynamic sql
8.1.11 exercises for section 8.1
8.2 procedures stored in the schema
8.2.1 creating psm functions and procedures
8.2.2 some simple statement forms in psm
8.2.3 branching statements
8.2.4 queries in psm
8.2.5 loops in psm
8.2.6 for-loops
8.2.7 exceptions in psm
8.2.8 using psm functions and procedures
8.2.9 exercises for section 8.2
8.3 the sql environment
8.3.1 environments
8.3.2 schemas
8.3.3 catalogs
8.3,4 clients and servers in tile sql environment
8.3..5 connections
8.3.6 sessions
8.3.7 modules
8.4 using a call-level interface
8.4.1 introduction to sql/cli
8.4.2 processing statements
8.4.3 fetdfing data from a query result
8.,4.4 passing parameters to queries
8.4.5 exercises for section 8.4
8.5 java database connectivity
8.5.1 introduction to jdbc
8.5.2 creating statements in jdbc
8.5.3 cursor operations in jdbc
8.5.4 parameter passing
8.5.5 exercises for section 8.5
8.6 transactions in sql
8.6.1 serializability
8.6.2 atomicity
8.6.3 transactions
8.6.4 read-only transactions
8.6.5 dirty reads
8.6.6 other isolation levels
8.6.7 exercises for section 8.6
8.7 security and user authorization in sql
8.7.1 prmleges
8.7.2 creating prmleges
8.7.3 the privilege-checking process
8.7.4 granting privileges
8.7.5 grant diagrams
8.7.6 revoking privileges
8.7.7 exercises for section 8.7
8.8 summary of chapter 8
8.9 references for chapter 8
object-orientation in query languages
9.1 introduction to oql
9.1.1 an object-oriented movie example
9.1.2 path expressions
9.1.3 select-from-where expressions in oql
9.1.4 modifying the type of the result
9.1.5 complex output types
9.1.6 subqueries
9.1.7 exercises for section 9.1
9.2 additional forms of oql expressions
9.2.1 quantifier expressions
9.2.2 aggregation expressions
9.2.3 group-by expressions
9.2.4 having clauses
9.2.5 union. intersection. and difference
9.2.6 exercises for section 9.2
9.3 object assignment and creation in oql
9.3.1 assigning values to host-language variables
9.3.2 extracting elements of collections
9.3.3 obtaining each member of a collection
9.3.4 constants in oql
9.3.5 creating new objects
9.3.6 exercises for section 9.3
9.4 user-defined types in sql
9.4.1 defining types in sql
9.4.2 methods in user-defined types
9.4.3 declaring relations with a udt
9.4.4 references
9.4..5 exercises for section 9.4
9.5 operations on object-relational data
9..5.1 following references
9.5.2 accessing attributes of tuples with a udt
9..5.3 generator and mutator functions
9.5.4 ordering relationships on udt's
9.5.5 exercises for section 9.5
9.6 summary of chapter 9
9.7 references for chapter 9
10 logical query languages
10.1 a logic for relations
10.1.1 predicates and atoms
10.1.2 arithmetic atoms
10.1.3 datalog rules and queries
10.1.4 meaning of datalog rules
10.1.5 extensional and intensional predicates
10.1.6 datalog rules applied to bags
10.1.7 exercises for section 10.1
10.2 from relational algebra to datalog
10,2.1 intersection
10.2.2 union
10.2.3 difference
10.2.4 projection
10.2.5 selection
10.2.6 product
10.2.7 joins
10.2.8 simulating multiple operations with datalog
10.2.9 exercises for section 10.2
10.3 recursive programming in datalog
10.3.1 gecursive rules
10.3.2 evaluating recursive datalog rules
10.3.3 negation in recursive rules
10.3.4 exercises for section 10.3
10.4 recursion in sql
10.4.1 defining idb relations in sql
10.4.2 stratified negation
10.4.3 problematic expressions ill recursive sql
10.4.4 exercises for section 10.4
10.5 summary of chapter 10
10.6 references for chapter 10
index

.　　 A large number of people have helped us. either with the initial vetting of the text for this book and its predecessors, or by contacting us with errata in the books and/or other Web-based materials. It is our pleasure to acknowledge them all here.
　　 Marc Abromowitz, Joseph H. Adamski, Brad Adelberg, Gleb Ashimov, Donald Aingworth, Jonathan Becker, Margaret Benitez. Larry Bonham, Phillip Bonnet. David Brokaw. Ed Burns. Karen Butler, Christopher Chan, Sudarshan Chawathe. Per Christensen. Ed Chang. Surajit Chaudhuri. Ken Chen, Rada Chirkova. Nitin Chopra. Bobbie Cochrane. Arturo Crespo, Linda DeMichiel, Tom Dienstbier. Pearl D'Souza, Oliver Duschka.
　　 Also Xavier Faz. Greg Fichtenholtz. Bart Fisher, Jarl Friis. John Fry, Chiping Fu, Tracy Fujieda, Manish Godara. Meredith Goldsmith. Luis Gravano, Gerard Guillemette. Rafael Hernandez. Antti Hjelt. Ben Holtzman, Steve Huntsberry. Leonard Jacobson. Thulasiraman Jeyaraman. Dwight Joe, Seth Katz, Yeong-Ping Koh, Gyorgy Kovacs, Phillip Koza. Brian Kulman, Sang Ho Lee,
　　Olivier Lobry. Lu Chao-Jun. Arun Marathe. Le-Wei Mo. Fabian Modoux. Peter Mork. Mark Mortensen.
　　 Also Ptamprakash Narayanaswami. Hankyung Na. Marie Nilsson, Torbjorn Norbye, Chang-Min Oh. Mehul Patel. Bert Porter. Limbek Reka, Prahash Ramanan. Ken Boss. Tim Roughgarten. Mema Roussopoulos. Richard Scherl. Catherine Tornabene. Anders Uhl. Jonathan Ullman, Mayank Upadhyay, Vassills Vassalos. Qiang Wang, Kristian Widjaja, Janet Wu. Sundar Yamunachari,Takeshi Yokukawa. Min-Sig Yun. Torben Zahle, Sandy Zhang. The remaining errors are ours. of course.
　　 J. D. U.
　　 J. W.
　　 Stanford. CA
　　 July. 2001