数据库管理系统原理与设计 （目录）

2nd

PREFACE

PartI  BASICS

1  INTRODUCTION  TO  DATABASE  SYSTEMS
     1.1  Overview
     1.2  A Historical Perspective
     1.3  File Systems versus a DBMS
     1.4  Advantages of a DBMS
     1.5  Describing and Storing  Data ina DBMS
        1.5.1 The Relational Model
        1.5.2 Levels of Abstraction in a DBMS
        1.5.3 Data Independence
    1.6 Queries in a DBMS
    1.7 Transaction Management
       1.7.1 Concurrent Execution of Transactions
       1.7.2 Incomplete Transactions and System Crashes
       1.7.3 Points to Note
   1.8 Structure  of a DBMS
   1.9 People Who Deal with Databases
   1.10 Points to Review

 

2 THEENTITY-RELATIONSHIP MODEL
   2.1 Overview of Database Design
       2.1.1 Beyond the ER Model
  2.2 Entities, Attributes, and Entity Sets
  2.3 Relationships and Relationship Sets
  2.4 Additional Features of the ER Model
      2.4.1 Key Constraints
      2.4.2 Participation Constraints
      2.4.3 Weak Entities
      2.4.4 Class Hierarchies
      2.4.5 Aggregation

2.5ConceptualDatabaseDesignWiththeERModel
2.5.1EntityversusAttribute
2.5.2EntityversusRelationship
2.5.3BinaryversusTernaryRelationships*
2.5.4AggregationversusTernaryRelationships*
2.6ConceptualDesignforLargeEnterprises*
2.7PointstoReview

3THERELATIONALMODEL
3.1IntroductiontotheRelationalModel
3.1.1CreatingandModifyingRelationsUsingSQL-92
3.2IntegrityConstraintsoverRelations
3.2.1KeyConstraints
3.2.2ForeignKeyConstraints
3.2.3GeneralConstraints
3.3EnforcingIntegrityConstraints
3.4QueryingRelationalData
3.5LogicalDatabaseDesign:ERtoRelational
3.5.1EntitySetstoTables
3.5.2RelationshipSets(withoutConstraints)toTables
3.5.3TranslatingRelationshipSetswithKeyConstraints
3.5.4TranslatingRelationshipSetswithParticipationConstraints
3.5.5TranslatingWeakEntitySets
3.5.6TranslatingClassHierarchies
3.5.7TranslatingERDiagramswithAggregation
3.5.8ERtoRelational:AdditionalExamples*
3.6IntroductiontoViews
3.6.1Views,DataIndependence,Security
3.6.2UpdatesonViews
3.7Destroying/AlteringTablesandViews
3.8PointstoReview

 

PartIIRELATIONALQUERIES
4RELATIONALALGEBRAANDCALCULUS
4.1Preliminaries
4.2RelationalAlgebra
4.2.1SelectionandProjection
4.2.2SetOperations
4.2.3Renaming
4.2.4Joins
4.2.5Division
4.2.6MoreExamplesofRelationalAlgebraQueries

4.3RelationalCalculus
4.3.1TupleRelationalCalculus
4.3.2DomainRelationalCalculus
4.4ExpressivePowerofAlgebraandCalculus*
4.5PointstoReview

5SQL:QUERIES,PROGRAMMING,TRIGGERS
5.1AbouttheExamples
5.2TheFormofaBasicSQLQuery
5.2.1ExamplesofBasicSQLQueries
5.2.2ExpressionsandStringsintheSELECTCommand
5.3UNION,INTERSECT,andEXCEPT
5.4NestedQueries
5.4.1IntroductiontoNestedQueries
5.4.2CorrelatedNestedQueries
5.4.3Set-ComparisonOperators
5.4.4MoreExamplesofNestedQueries
5.5AggregateOperators
5.5.1TheGROUPBYandHAVINGClauses
5.5.2MoreExamplesofAggregateQueries
5.6NullValues*
5.6.1ComparisonsUsingNullValues
5.6.2LogicalConnectivesAND,OR,andNOT
5.6.3ImpactonSQLConstructs
5.6.4OuterJoins
5.6.5DisallowingNullValues
5.7EmbeddedSQL*
5.7.1DeclaringVariablesandExceptions
5.7.2EmbeddingSQLStatements
5.8Cursors*

5.8.1BasicCursorDe nitionandUsage
5.8.2PropertiesofCursors
5.9DynamicSQL*
5.10ODBCandJDBC*
5.10.1Architecture
5.10.2AnExampleUsingJDBC
5.11ComplexIntegrityConstraintsinSQL-92*
5.11.1ConstraintsoveraSingleTable
5.11.2DomainConstraints
5.11.3Assertions:ICsoverSeveralTables
5.12TriggersandActiveDatabases
5.12.1ExamplesofTriggersinSQL
5.13DesigningActiveDatabases
5.13.1WhyTriggersCanBeHardtoUnderstand

5.13.2ConstraintsversusTriggers
5.13.3OtherUsesofTriggers
5.14PointstoReview

6QUERY-BY-EXAMPLE(QBE)
6.1Introduction
6.2BasicQBEQueries
6.2.1OtherFeatures:Duplicates,Orderin
6.3QueriesoverMultipleRelations
6.4NegationintheRelation-NameColumn
6.5Aggregates
6.6TheConditionsBox
6.6.1And/OrQueries
6.7UnnamedColumns
6.8Updates
6.8.1RestrictionsonUpdateCommands
6.9DivisionandRelationalCompleteness*
6.10PointstoReview

PartIIIDATASTORAGEANDINDEXING
7STORINGDATA:DISKSANDFILES
7.1TheMemoryHierarchy
7.1.1MagneticDisks
7.1.2PerformanceImplicationsofDiskStructure
7.2RAID
7.2.1DataStriping
7.2.2Redundancy
7.2.3LevelsofRedundancy
7.2.4ChoiceofRAIDLevels
7.3DiskSpaceManagement
7.3.1KeepingTrackofFreeBlocks
7.3.2UsingOSFileSystemstoManageDiskSpace
7.4BuerManager
7.4.1BuerReplacementPolicies
7.4.2BuerManagementinDBMSversusOS

7.5FilesandIndexes
7.5.1HeapFiles
7.5.2IntroductiontoIndexes
7.6PageFormats*
7.6.1Fixed-LengthRecords
7.6.2Variable-LengthRecords
7.7RecordFormats*

7.7.1Fixed-LengthRecords
7.7.2Variable-LengthRecords
7.8PointstoReview

8FILEORGANIZATIONSANDINDEXES
8.1CostModel
8.2ComparisonofThreeFileOrganizations
8.2.1HeapFiles
8.2.2SortedFiles
8.2.3HashedFiles
8.2.4ChoosingaFileOrganization
8.3OverviewofIndexes
8.3.1AlternativesforDataEntriesinanIndex
8.4PropertiesofIndexes
8.4.1ClusteredversusUnclusteredIndexes
8.4.2DenseversusSparseIndexes
8.4.3PrimaryandSecondaryIndexes
8.4.4IndexesUsingCompositeSearchKeys
8.5IndexSpeci cationinSQL-92
8.6PointstoReview

9TREE-STRUCTUREDINDEXING
9.1IndexedSequentialAccessMethod(ISAM)
9.2B+Trees:ADynamicIndexStructure
9.3FormatofaNode
9.4Search
9.5Insert
9.6Delete*
9.7Duplicates*
9.8B+TreesinPractice*
9.8.1KeyCompression
9.8.2Bulk-LoadingaB+Tree
9.8.3TheOrderConcept
9.8.4TheEectofInsertsandDeletesonRids
9.9PointstoReview
10HASH-BASEDINDEXING
10.1StaticHashing
10.1.1NotationandConventions
10.2ExtendibleHashing*
10.3LinearHashing*
10.4ExtendibleHashingversusLinearHashing*
10.5PointstoReview

PartIVQUERYEVALUATION
11EXTERNALSORTING
11.1ASimpleTwo-WayMergeSort
11.2ExternalMergeSort
11.2.1MinimizingtheNumberofRuns*
11.3MinimizingI/OCostversusNumberofI/Os
11.3.1BlockedI/O
11.3.2DoubleBuering
11.4UsingB+TreesforSorting
11.4.1ClusteredIndex
11.4.2UnclusteredIndex
11.5PointstoReview
12EVALUATIONOFRELATIONALOPERATORS
12.1IntroductiontoQueryProcessing
12.1.1AccessPaths
12.1.2Preliminaries:ExamplesandCostCalculations
12.2TheSelectionOperation

12.2.1NoIndex,UnsortedData
12.2.2NoIndex,SortedData
12.2.3B+TreeIndex
12.2.4HashIndex,EqualitySelection
12.3GeneralSelectionConditions*
12.3.1CNFandIndexMatching
12.3.2EvaluatingSelectionswithoutDisjunction
12.3.3SelectionswithDisjunction
12.4TheProjectionOperation
12.4.1ProjectionBasedonSorting
12.4.2ProjectionBasedonHashing*
12.4.3SortingversusHashingforProjections*
12.4.4UseofIndexesforProjections*
12.5TheJoinOperation
12.5.1NestedLoopsJoin
12.5.2Sort-MergeJoin*
12.5.3HashJoin*
12.5.4GeneralJoinConditions*
12.6TheSetOperations*
12.6.1SortingforUnionandDierence
12.6.2HashingforUnionandDierence
12.7AggregateOperations*
12.7.1ImplementingAggregationbyUsinganIndex
12.8TheImpactofBuering*

12.9PointstoReview
13INTRODUCTIONTOQUERYOPTIMIZATION
13.1OverviewofRelationalQueryOptimization
13.1.1QueryEvaluationPlans
13.1.2PipelinedEvaluation
13.1.3TheIteratorInterfaceforOperatorsandAccessMethods
13.1.4TheSystemROptimizer
13.2SystemCataloginaRelationalDBMS
13.2.1InformationStoredintheSystemCatalog
13.3AlternativePlans:AMotivatingExample
13.3.1PushingSelections
13.3.2UsingIndexes
13.4PointstoReview
14ATYPICALRELATIONALQUERYOPTIMIZER
14.1TranslatingSQLQueriesintoAlgebra
14.1.1DecompositionofaQueryintoBlocks
14.1.2AQueryBlockasaRelationalAlgebraExpression
14.2EstimatingtheCostofaPlan
14.2.1EstimatingResultSizes
14.3RelationalAlgebraEquivalences
14.3.1Selections
14.3.2Projections

14.3.3Cross-ProductsandJoins
14.3.4Selects,Projects,andJoins
14.3.5OtherEquivalences
14.4EnumerationofAlternativePlans
14.4.1Single-RelationQueries
14.4.2Multiple-RelationQueries
14.5NestedSubqueries
14.6OtherApproachestoQueryOptimization
14.7PointstoReview
PartVDATABASEDESIGN
15SCHEMAREFINEMENTANDNORMALFORMS
15.1IntroductiontoSchemaRe nement
15.1.1ProblemsCausedbyRedundancy
15.1.2UseofDecompositions
15.1.3ProblemsRelatedtoDecomposition
15.2FunctionalDependencies
15.3ExamplesMotivatingSchemaRe nement

 

15.3.1ConstraintsonanEntitySet
15.3.2ConstraintsonaRelationshipSet
15.3.3IdentifyingAttributesofEntities
15.3.4IdentifyingEntitySets
15.4ReasoningaboutFunctionalDependencies
15.4.1ClosureofaSetofFDs
15.4.2AttributeClosure
15.5NormalForms
15.5.1Boyce-CoddNormalForm
15.5.2ThirdNormalForm
15.6Decompositions
15.6.1Lossless-JoinDecomposition
15.6.2Dependency-PreservingDecomposition
15.7Normalization
15.7.1DecompositionintoBCNF
15.7.2Decompositioninto3NF*
15.8OtherKindsofDependencies*
15.8.1MultivaluedDependencies
15.8.2FourthNormalForm
15.8.3JoinDependencies
15.8.4FifthNormalForm
15.8.5InclusionDependencies
15.9PointstoReview
16PHYSICALDATABASEDESIGNANDTUNING

16.1IntroductiontoPhysicalDatabaseDesign
16.1.1DatabaseWorkloads
16.1.2PhysicalDesignandTuningDecisions
16.1.3NeedforDatabaseTuning
16.2GuidelinesforIndexSelection
16.3BasicExamplesofIndexSelection
16.4ClusteringandIndexing*
16.4.1Co-clusteringTwoRelations
16.5IndexesonMultiple-AttributeSearchKeys*
16.6IndexesthatEnableIndex-OnlyPlans*
16.7OverviewofDatabaseTuning
16.7.1TuningIndexes
16.7.2TuningtheConceptualSchema
16.7.3TuningQueriesandViews
16.8ChoicesinTuningtheConceptualSchema*
16.8.1SettlingforaWeakerNormalForm
16.8.2Denormalization
16.8.3ChoiceofDecompositions
16.8.4VerticalDecomposition

16.8.5HorizontalDecomposition
16.9ChoicesinTuningQueriesandViews*
16.10ImpactofConcurrency*
16.11DBMSBenchmarking*
16.11.1Well-KnownDBMSBenchmarks
16.11.2UsingaBenchmark
16.12PointstoReview
17SECURITY
17.1IntroductiontoDatabaseSecurity
17.2AccessControl
17.3DiscretionaryAccessControl
17.3.1GrantandRevokeonViewsandIntegrityConstraints*
17.4MandatoryAccessControl*
17.4.1MultilevelRelationsandPolyinstantiation
17.4.2CovertChannels,DoDSecurityLevels
17.5AdditionalIssuesRelatedtoSecurity*
17.5.1RoleoftheDatabaseAdministrator
17.5.2SecurityinStatisticalDatabases
17.5.3Encryption
17.6PointstoReview
PartVITRANSACTIONMANAGEMENT

18TRANSACTIONMANAGEMENTOVERVIEW 18.1TheConceptofaTransaction
18.1.1ConsistencyandIsolation
18.1.2AtomicityandDurability
18.2TransactionsandSchedules
18.3ConcurrentExecutionofTransactions
18.3.1MotivationforConcurrentExecution
18.3.2Serializability
18.3.3SomeAnomaliesAssociatedwithInterleavedExecution
18.3.4SchedulesInvolvingAbortedTransactions
18.4Lock-BasedConcurrencyControl
18.4.1StrictTwo-PhaseLocking(Strict2PL)
18.5IntroductiontoCrashRecovery
18.5.1StealingFramesandForcingPages
18.5.2Recovery-RelatedStepsduringNormalExecution
18.5.3OverviewofARIES
18.6PointstoReview
19CONCURRENCYCONTROL

19.1Lock-BasedConcurrencyControlRevisited
19.1.12PL,Serializability,andRecoverability
19.1.2ViewSerializability
19.2LockManagement
19.2.1ImplementingLockandUnlockRequests
19.2.2Deadlocks
19.2.3PerformanceofLock-BasedConcurrencyControl
19.3SpecializedLockingTechniques
19.3.1DynamicDatabasesandthePhantomProblem
19.3.2ConcurrencyControlinB+Trees
19.3.3Multiple-GranularityLocking
19.4TransactionSupportinSQL-92*
19.4.1TransactionCharacteristics
19.4.2TransactionsandConstraints
19.5ConcurrencyControlwithoutLocking
19.5.1OptimisticConcurrencyControl
19.5.2Timestamp-BasedConcurrencyControl
19.5.3MultiversionConcurrencyControl
19.6PointstoReview
20CRASHRECOVERY
20.1IntroductiontoARIES
20.1.1TheLog
20.1.2OtherRecovery-RelatedDataStructures
20.1.3TheWrite-AheadLogProtocol

20.1.4Checkpointing
20.2RecoveringfromaSystemCrash
20.2.1AnalysisPhase
20.2.2RedoPhase
20.2.3UndoPhase
20.3MediaRecovery
20.4OtherAlgorithmsandInteractionwithConcurrencyControl
20.5PointstoReview
PartVIIADVANCEDTOPICS
21PARALLELANDDISTRIBUTEDDATABASES
21.1ArchitecturesforParallelDatabases
21.2ParallelQueryEvaluation
21.2.1DataPartitioning
21.2.2ParallelizingSequentialOperatorEvaluationCode
21.3ParallelizingIndividualOperations
21.3.1BulkLoadingandScanning

21.3.2Sorting
21.3.3Joins
21.4ParallelQueryOptimization
21.5IntroductiontoDistributedDatabases
21.5.1TypesofDistributedDatabases
21.6DistributedDBMSArchitectures
21.6.1Client-ServerSystems
21.6.2CollaboratingServerSystems
21.6.3MiddlewareSystems
21.7StoringDatainaDistributedDBMS
21.7.1Fragmentation
21.7.2Replication
21.8DistributedCatalogManagement
21.8.1NamingObjects
21.8.2CatalogStructure
21.8.3DistributedDataIndependence
21.9DistributedQueryProcessing
21.9.1NonjoinQueriesinaDistributedDBMS
21.9.2JoinsinaDistributedDBMS
21.9.3Cost-BasedQueryOptimization
21.10UpdatingDistributedData

21.10.1SynchronousReplication
21.10.2AsynchronousReplication
21.11IntroductiontoDistributedTransactions
21.12DistributedConcurrencyControl
21.12.1DistributedDeadlock
21.13DistributedRecovery
21.13.1NormalExecutionandCommitProtocols
21.13.2RestartafteraFailure
21.13.3Two-PhaseCommitRevisited
21.13.4Three-PhaseCommit
21.14PointstoReview
22INTERNETDATABASES
22.1TheWorldWideWeb
22.1.1IntroductiontoHTML
22.1.2DatabasesandtheWeb
22.2Architecture
22.2.1ApplicationServersandServer-SideJava
22.3BeyondHTML
22.3.1IntroductiontoXML
22.3.2XMLDTDs
22.3.3Domain-Speci cDTDs
22.3.4XML-QL:QueryingXMLData

22.3.5TheSemistructuredDataModel
22.3.6ImplementationIssuesforSemistructuredData
22.4IndexingforTextSearch
22.4.1InvertedFiles
22.4.2SignatureFiles
22.5RankedKeywordSearchesontheWeb
22.5.1AnAlgorithmforRankingWebPages
22.6PointstoReview
23DECISIONSUPPORT
23.1IntroductiontoDecisionSupport
23.2DataWarehousing
23.2.1CreatingandMaintainingaWarehouse
23.3OLAP
23.3.1MultidimensionalDataModel
23.3.2OLAPQueries
23.3.3DatabaseDesignforOLAP
23.4ImplementationTechniquesforOLAP
23.4.1BitmapIndexes
23.4.2JoinIndexes
23.4.3FileOrganizations
23.4.4AdditionalOLAPImplementationIssues
23.5ViewsandDecisionSupport

23.5.1Views,OLAP,andWarehousing
23.5.2QueryModi cation
23.5.3ViewMaterializationversusComputingonDemand
23.5.4IssuesinViewMaterialization
23.6FindingAnswersQuickly
23.6.1TopNQueries
23.6.2OnlineAggregation
23.7PointstoReview
24DATAMINING
24.1IntroductiontoDataMining
24.2CountingCo-occurrences
24.2.1FrequentItemsets
24.2.2IcebergQueries
24.3MiningforRules
24.3.1AssociationRules
24.3.2AnAlgorithmforFindingAssociationRules
24.3.3AssociationRulesandISAHierarchies
24.3.4GeneralizedAssociationRules
24.3.5SequentialPatterns

24.3.6TheUseofAssociationRulesforPrediction
24.3.7BayesianNetworks
24.3.8Classi cationandRegressionRules
24.4Tree-StructuredRules
24.4.1DecisionTrees
24.4.2AnAlgorithmtoBuildDecisionTrees
24.5Clustering
24.5.1AClusteringAlgorithm
24.6SimilaritySearchoverSequences
24.6.1AnAlgorithmtoFindSimilarSequences
24.7AdditionalDataMiningTasks
24.8PointstoReview
25OBJECT-DATABASESYSTEMS
25.1MotivatingExample
25.1.1NewDataTypes
25.1.2ManipulatingtheNewKindsofData
25.2User-De nedAbstractDataTypes
25.2.1De ningMethodsofanADT
25.3StructuredTypes
25.3.1ManipulatingDataofStructuredTypes
25.4Objects,ObjectIdentity,andReferenceTypes
25.4.1NotionsofEquality
25.4.2DereferencingReferenceTypes
25.5Inheritance
25.5.1De ningTypeswithInheritance

25.5.2BindingofMethods
25.5.3CollectionHierarchies,TypeExtents,andQueries
25.6DatabaseDesignforanORDBMS
25.6.1StructuredTypesandADTs
25.6.2ObjectIdentity
25.6.3ExtendingtheERModel
25.6.4UsingNestedCollections
25.7NewChallengesinImplementinganORDBMS
25.7.1StorageandAccessMethods
25.7.2QueryProcessing
25.7.3QueryOptimization
25.8OODBMS
25.8.1TheODMGDataModelandODL
25.8.2OQL
25.9ComparingRDBMSwithOODBMSandORDBMS
25.9.1RDBMSversusORDBMS
25.9.2OODBMSversusORDBMS:Similarities
25.9.3OODBMSversusORDBMS:Dierences

25.10PointstoReview
26SPATIALDATAMANAGEMENT
26.1TypesofSpatialDataandQueries
26.2ApplicationsInvolvingSpatialData
26.3IntroductiontoSpatialIndexes
26.3.1OverviewofProposedIndexStructures
26.4IndexingBasedonSpace-FillingCurves
26.4.1RegionQuadTreesandZ-Ordering:RegionData
26.4.2SpatialQueriesUsingZ-Ordering
26.5GridFiles
26.5.1AdaptingGridFilestoHandleRegions
26.6RTrees:PointandRegionData
26.6.1Queries
26.6.2InsertandDeleteOperations
26.6.3ConcurrencyControl
26.6.4GeneralizedSearchTrees
26.7IssuesinHigh-DimensionalIndexing
26.8PointstoReview

27DEDUCTIVEDATABASES
27.1IntroductiontoRecursiveQueries
27.1.1Datalog
27.2TheoreticalFoundations
27.2.1LeastModelSemantics
27.2.2SafeDatalogPrograms
27.2.3TheFixpointOperator
27.2.4LeastModel=LeastFixpoint
27.3RecursiveQuerieswithNegation
27.3.1Range-RestrictionandNegation
27.3.2Strati cation
27.3.3AggregateOperations
27.4EcientEvaluationofRecursiveQueries
27.4.1FixpointEvaluationwithoutRepeatedInferences
27.4.2PushingSelectionstoAvoidIrrelevantInferences
27.5PointstoReview

28ADDITIONALTOPICS
28.1AdvancedTransactionProcessing
28.1.1TransactionProcessingMonitors
28.1.2NewTransactionModels
28.1.3Real-TimeDBMSs
28.2IntegratedAccesstoMultipleDataSources

28.3MobileDatabases
28.4MainMemoryDatabases
28.5MultimediaDatabases
28.6GeographicInformationSystems
28.7TemporalandSequenceDatabases
28.8InformationVisualization
28.9Summary
ADATABASEDESIGNCASESTUDY:THEINTERNET
SHOP
A.1RequirementsAnalysis
A.2ConceptualDesign
A.3LogicalDatabaseDesign
A.4SchemaRe nement
A.5PhysicalDatabaseDesign
A.5.1TuningtheDatabase
A.6Security
A.7ApplicationLayers
BTHEMINIBASESOFTWARE
B.1What'sAvailable
B.2OverviewofMinibaseAssignments
B.2.1OverviewofProgrammingProjects
B.2.2OverviewofNonprogrammingAssignments
B.3Acknowledgments

REFERENCES
SUBJECTINDEX
AUTHORINDEX

 

第三版

 

目录

第一部分 数据库基础
第1章 数据库系统概述
1.1 管理数据
1.2 历史回顾
1.3 文件系统和数据库管理系统
1.4 数据库管理系统的优点
1.5 数据库管理系统中数据的描述和存储
1.5.1 关系模型
1.5.2 数据库管理系统的抽象级别
1.5.3 数据独立性
1.6 数据库管理系统中的查询
1.7 事务管理
1.7.1 事务的并发执行
1.7.2 未完成的事务和系统崩溃
1.7.3 注意要点
1.8 数据库管理系统的结构
1.9 与数据库打交道的人
1.10 复习题
第2章 实体联系模型
2.1 数据库设计与ER图
2.1.1 其他步骤
2.2 实体、属性和实体集
2.3 联系和联系集
2.4 ER模型的其他特征
2.4.1 码约束
2.4.2 参与约束
2.4.3 弱实体
2.4.4 类层次
2.4.5 聚合
2.5 用ER模型进行概念数据库设计
2.5.1 实体对属性
2.5.2 实体与联系
2.5.3 二元与三元联系
2.5.4 聚合与三元联系
2.6 大型企业的概念数据库设计
2.7 统一建模语言
2.8 案例研究：网上书店
2.8.1 需求分析
2.8.2 概念设计
2.9 复习题
第3章 关系模型
3.1 关系模型简介
3.1.1 使用SQL创建和修改关系
3.2 关系的完整性约束
3.2.1 码约束
3.2.2 外码约束
3.2.3 一般约束
3.3 完整性约束的强制执行
3.3.1 事务与约束
3.4 查询关系数据
3.5 逻辑数据库设计：从ER模型到关系模型
3.5.1 从实体集到关系表
3.5.2 从联系集（不包括约束）到关系表
3.5.3 转换带码约束的联系集
3.5.4 转换带有参与约束的联系集
3.5.5 转换弱实体集
3.5.6 转换类层次
3.5.7 转换带聚合的ER图
3.5.8 ER模型到关系模型：更多的示例
3.6 视图简介
3.6.1 视图、数据独立性和安全
3.6.2 视图的更新
3.7 删除/修改关系表和视图
3.8 案例研究：网上书店
3.9 复习题
第4章 关系代数和演算
4.1 预备知识
4.2 关系代数
4.2.1 选择和投影
4.2.2 集合操作
4.2.3 重命名
4.2.4 连接
4.2.5 除
4.2.6 关系代数查询的其他示例
4.3 关系演算
4.3.1 元组关系演算
4.3.2 域关系演算
4.4 代数与演算的表达能力
4.5 复习题
第5章 SQL：查询、约束与触发器
第二部分 应用程序开发
第6章 数据库应用开发
第7章 Internet应用
第三部分 存储与索引
第8章 存储与索引概述
第9章 存储数据：磁盘和文件
第10章 树结构索引
第11章 基于哈希的索引
第四部分 查询评估
第12章 查询求解概述
第13章 外排序
第14章 关系操作求解
第15章 典型的关系查询优化器
第五部分 事务管理
第16章 事务管理概述
第17章 并发控制
第18章 崩溃恢复
第六部分 数据库设计与调整
第19章 模式求精与范式
第20章 物理数据库设计和调整
第21章 安全与认证
第七部分 高级主题
第22章 并行与分布式数据库
第23章 对象数据库系统
第24章 演绎数据库
第25章 数据仓库与决策支持
第26章 数据挖掘
第27章 信息检索和XML数据
第28章 空间数据管理
第29章 其他专题
第30章 MINIBASE教学辅助软件
参考文献