大学计算机教育国外著名教材·教参系列:分布式数据库系统原理(第2版影印版)(影印版)
出版时间:
2002-06
版次:
1
ISBN:
9787302054931
定价:
57.00
装帧:
平装
开本:
16开
纸张:
胶版纸
页数:
666页
正文语种:
简体中文,英语
-
本书是一本非常适合作研究生数据库教学用的教材。其内容包括了分布式数据库所用的基本原理、方法、重要的算法介绍及部分系统的实际实现技巧。第2版还增加了一些新的内容如:用整整两章来介绍并行数据库和分布式对象数据库管理系统。本书具有以下特点:1.内容较为全面,系统地覆盖了分布式数据库的主要方面;2.反映了目前的一些研究成果如:数据仓库,万维网和数据库,基于推理的技术以及移动DBMS;3.叙述清楚,容易阅读。本书在清华大学计算机系研究生教学中使用了6年,反映较好。
PREFACETOTHESECONDEDITION
PREFACETOTHEFIRSTEDITION
11NTRODUCTION
1.1DISTRIBUTEDDATAPROCESSING
l.2WHATISADISTRIBUTEDDATABASESYSTEM?
1.3PROMISESOFDDBSs
1.3.1TransparentManagementofDistributedandReplicatedData
1.3.2ReliabilityThroughDistributedTransactions
1.3.3ImprovedPerformance
1.3.4EasierSystemExpansion
1.4COMPLICATINGFACTORS
1.5PROBLEMAREAS
l.5.1DistributedDatabaseDesign
1.5.2DistributedQueryProcessing
l.5.3DistributedDirectoryManagement
1.5.4DistributedConcurrencyControl
1.5.5DistributedDeadlockManagement
1.5.6ReliabilityofDistributedDBMS
1.5.7OperatingSystemSupport
1.5.8HeterogeneousDatabases
1.5.9RelationshipamongProblems
1.6BIBLIOGRAPHICNOTES
2OVERVIEWOFRELATIONALDBMS
2.1RELATIONALDATABASECONCEPTS
2.2NORMALIZATION
2.2.1DependencyStructures
2.2.2NormalForms
2.3INTEGMTYRULES
2.4RELATIONALDATALANGUAGES
2.4.1RelationalAlgebra
2.4.2RelationalCalculus
2.4.3InterfacewithProgrammingLanguages
2.5RELATIONALDBMS
2.6BIBLJOCRAPHICNOTES
3REVIEWOFCOMPUTERNETWORKS
3.1DATACOMMUNICATIONCONCEPTS
3.2TYPESOFNETWORKS
3.2.1Topology
3.2.2CommunicationSchemes
3.2.3Scale
3.3PROTOCOLSTANDARDS
3.4BROADBANDNETWORKS
3.5WIRELESSNETWORKS
3.6INTERNET
3.7CONCLUDINGREMARKS
3.8BIBLIOGRAPHICNOTES
4DISTRIBUTEDDBMSARCHITECTURE
4.1DBMSSTANDARDIZATION
4.2ARCHITECTURALMODELSFORDISTRIBUTEDDBMSs
4.2.lAutonomy
4.2.2Distribution
4.2.3Heterogeneity
4.2.4ArchitecturalAlternatives
4.3DISTRIBUTEDDBMSARCHITECTURE
4.3.1Client/ServerSystems
4.3.2Peer-to-PeerDistributedSystems
4.3.3MDBSArchitecture
4.4GLOBALDIRECTORYISSUES
4.5CONCLUSION
4.6BIBLIOGRAPHICNOTES
5DISTRIBUTEDDATABASEDESIGN
5.lALTERNATIVEDESIGNSTRATEGIES
5.1.1Top-DownDesignProcess
5.1.2Bottom-UpDesignProcess
5.2DISTRIBUTIONDESIGNISSUES
5.2.lReasonsforFragmentation
5.2.2FragmentationAlternatives
5.2.3DegreeofFragmentation
5.2.4CorrectnessRulesofFragmentation
5.2.5AllocationAlternatives
5.2.6InformationRequirements
5.3FRAGMENTATION
5.3.1HorizontalFragmentation
5.3.2VerticalFragmentation
5.3.3HybridFragmentation
5.4ALLOCATION
5.4.1AllocationProblem
5.4.2InformationRequirements
5.4.3AllocationModel
5.4.4SolutionMethods
5.5CONCLUSION
5.6BIBLIOGRAPHICNOTES
5.7EXERCISES
6SEMANTICDATACONTROL
6.1VIEWMANAGEMENT
6.1.1ViewsinCentralizedDBMSs
6.1.2UpdatesthroughViews
6.1.3ViewsinDistributedDBMSs
6.2DATASECURITY
6.2.lCentralizedAuthorizationControl
6.2.2DistributedAuthorizationControl
6.3SEMANTICINTEGRITYCONTROL
6.3.lCelltra1izedSemanticIntegrityControl
6.3.2DistributedSemanticIntegrityControl
6.4CONCLUSION
6.5BIBLIOGRAPHICNOTES
6.6EXERCISES
7OVERVIEWOFQUERYPROCESSING
7.lQUERYPROCESSINGPROBLEM
7.2OBJECTIVESOFQUERYPROCESSING
7.3COMPLEXITYOFRELATIONALALGEBRAOPERATJONS
7.4CHARACTERIZATIONOFQUERYPROCESSORS
7.4.lLanguages
7.4.2TypesofOptimization
7.4.3OptimizationTiming
7.4.4Statistics
7.4.5DecisionSites
7.4.6Exploitationof-theNetworkTopology
7.4.7ExploitationofReplicatedFragments
7.4.8UseofSemijoins
7.5LAYERSOFQUERYPROCESSING
7.5.lQueryDecomposition
7.5.2DataLocalization
7.5.3GlobalQueryOptimization
7.5.4LocalQueryOpti1nization
7.6CONCLUSION
7.7BIBLIOGRAPHICNOTES
8QUERYDECOMPOSITIONANDDATALOCALIZATION
8.1.QUERYDECOMPOSITION
8.l.1Normalization
8.1.2Analysis
8.1.3EliminationofRedundancy
8.1.4Rewriting
8.2LOCALIZATIONOFDISTRIBUTEDDATA
8.2.1ReductionforPrimaryHorizolltalFragmentation
8.2.2ReductionforVerticalFragmentation
8.2.3ReductionforDerivedFragmentation
8.2.4ReductionforHybridFragmentation
8.3CONCLUSION
8.4BIBLIOGRAPHICNOTES
8.5EXERCISES
9OPTIMIZATIONOFDISTRIBUTEDQUERIES
9.1QUERYOPTIMIZATION
9.1.1SearchSpace
9.l.2SearchStrategy
9.1.3DistributedCostModel
9.2CENTRALIZEDQUERYOPTIMIZATION
9.2.lINGRESAlgorithm
9.2.2SystemRA1gorithm
9.3JOINORDERINGINFRAGMENTQUERIES
9.3.1JoinOrdering
9.3.2SemijoinBasedAlgorithms
9.3.3JoinversusSemijoin
9.4DISTRJBUTEDQUERYOPTIMIZATIONALGORITHMS
9.4.1DistributedINpRESAlgorithm
9.4.2R*Algorithm
9.4.3SDD-1Algorithm
9.5CONCLUSION
9.6BIBLIOGRAPHICNOTES
9.7EXERCISES
10INTRODUCTIONTOTRANSACTIONMANAGEMENT
10.1DEFINITIONOFATRANSACTION
10.1.1TerminationConditionsofThansactions
l0.1.2CharacterizationofTransactions
10.1.3FormalizationoftheTransactionConcept
10.2PROPERTIESOFTRANSACTIONS
10.2.1Atomicity
10.2.2Consistency
l0.2.3Isolation
l0.2.4Durabi1ity
l0.3TYPESOFTRANSACTIONS
l0.3.1FlatThansactions
l0.3.2NestedTransactions
10.3.3Workflows
l0.4ARCHITECTUREREVISITED
l0.5CONCLUSION
10.6BIBLIOGRAPHICNOTES
11DISTRIBUTEDCONCURRENCYCONTROL
11.1SERIALIZABILITYTHEORY
l1.2TAXONOMYOFCONCURRENCYCONTROLMECHANISMS
11.3LOCKING-BASEDCONCURRENCYCONTROLALGORITHMS
11.3.lCentralized2PL
11.3.2PrimaryCopy2PL
11.3.3Distributed2PL
11.4TIMESTAMP-BASEDCONCURRENCYCONTROLALGORITHMS
11.4.lBasicTOAlgorithm
11.4.2ConservativeTOAlgorithm
11.4.3MultiversionTOAlgorithm
1l.5OPTIMISTICCONCURRENCYCONTROLALGORITHMS
11.6DEADLOCKMANAGEMENT
11.6.1DeadlockPrefelltion
l1.6.2DeadlockAvoidance
11.6.3DeadlockDetectionandResolution
l1.7"RELAXED"CONCURRENCYCONTROL
11.7.1Non-SerializableSchedules
11.7.2NestedDistributednansactions
11.8CONCLUSION
11.9BIBLIOGRAPHICNOTES
11.10EXERCISES
12DISTRIBUTEDDBMSRELIABILITY
12.1RELIABlLITYCONCEPTSANDMEASURES
12.l.1System,State,andFailure
12.1.2ReliabilityandAvailability
12.1.3MeanTimebetweenFailures/MeanTimetoRepair
12.2FAILURESANDFAULTTOLERANCEINDISTRIBUTEDSYSTEMS
12.2.1ReasonsforFailures
l2.2.2BasicFaultToleranceApproachesandTechniques
12.3FAILURESINDISTRIBUTEDDBMS
12.3.lThansactionFailures
12.3.2Site(System)Failures
12.3.3MediaFailures
12.3.4CommunicationFailures
12.4LOCALRELIABILITYPROTOCOLS
l2.4.lArchitecturalConsiderations
12.4.2RecoveryInformation
12.4.3ExecutionofLRMCommands
12.4.4Checkpoillting
l2.4.5HandlingMediaFailures
12.5DISTRIBUTEDRELIABILITYPROTOCOLS
12.5.1ComponentsofDistributedReliabilityProtocols
12.5.2Two-PhaseCommitProtocol
12.5.3Variationsof2PC
12.6DEALINGWITHSITEFAILURES
12.6.1TerminationandRecoveryProtocolsfor2PC
12.6.2Three-PhaseCommitProtocol
12.7NETWORKPARTITIONING
12.7.1CentralizedProtocols
12.7.2Voting-basedProtocols
12.7.3ReplicationandReplicaContro1Protocols
l2.7.4StrictReplicaControlProtocols
l2.7.5LazyReplicationProtocols
12.8ARCHITECTURALCONSIDERATIONS
12.9CONCLUSION
12.10BIBLIOGRAPHICNOTES
12.11EXERCISES
13MRALLELDATABASESYSTEMS
13.1DATABASESERVERS
13.1.1DatabaseServerApproach
13.1.2DatabaseServersandDistributedDatabases
13.2PARALLELARCHITECTURES
13.2.lObjectives
13.2.2FunctionalAspects
13.2.3ParallelSystemArchitectures
13.3PARALLELDBMSTECHNIQUES
13.3.lDataPlacement
13.3.2QueryParallelism
13.3.3Para1lelDataProcessing
13.3.4ParallelQueryOptimization
13.4PARALLELEXECUTIONPROBLEMS
l3.4.1Initialization
l3.4.2IllterferencesandConvoyEffect
13.4.3LoadBalancing
13.5PARALLELEXECUTIONFORHIERARCHlCALARCHITECTURE
13.5.1ProblemFormulation
13.5.2BasicConcepts
13.5.3LoadBalancingStrategy
13.5.4PerformanceEvaluation
l3.6CONCLUSION
13.7BIBLIOGRAPHICNOTES
13.8EXERCISES
14DISTmBUTEDOBJECTDATABASEMANAGEMENTSYSTEMS
14.1FUNDAMENTALOBJECTCONCEPTSANDMODELS
14.l.1Object
14.1.2AbstractDataTypes
14.l.3Composition(Aggregation)
14.1.4Class
14.l.5Collection
l4.1.6SubtypingandInheritance
l4.2OBJECTDISTRIBUTIONDESIGN
l4.2.1HorizontalClassPartitioning
14.2.2VerticalClassPartitioning
14.2.3PathPartitioning
l4.2.4ClassPartitioningAlgorithms
14.2.5Allocation
14.2.6Replication
l4.3ARCHITECTURALISSUES
14.3.1AlternativeClient/ServerArchitectures
14.3.2CacheConsistency
14.4OBJECTMANAGEMENT
l4.4.1ObjectIdentifierManagement
14.4.2PointerSwizzling
l4.4.3ObjectMigration
14.5DISTRIBUTEDOBJECTSTORAGE
l4.6OBJECTQUERYPROCESSING
14.6.lObjectQueryProcessorArchitectures
14.6.2QueryProcessingIssues
l4.6.3QueryExecution
l4.7TRANSACTIONMANAGEMENT
l4.7.1CorrectnessCriteria
l4.7.2ThansactionModelsandObjectStructures
14.7.3ThansactionsManagemefltinObjectDBMSs
l4.7.4ThansaCtionsasObjects
14.8CONCLUSION
l4.9BIBLIOGRAPHICNOTES
14.l0EXERCISES
15DATABASEINTEROPERABILITY
15.1DATABASEINTEGRATION
15.1.1SchemaTrans1ation
15.1.2SchemaIntegration
15.2QUERYPROCESSING
15.2.1QueryProcessingLayersinDistributedMulti--DBMSs
15.2.2QueryOptimizationIssues
15.3TRANSACTIONMANAGEMENT
15.3.1ThansactionandComputationModel
15.3.2MultidatabaseConcurrencyControl
15.3.3MultidatabaseRecovery
15.4OBJECTORIENTATIONANDINTEROPERABILITY
15.4.1ObjectManagementArchitecture
15.4.2CORBAandDatabaseInteroperability
15.4.3DistributedComponentObjectModel
15.4.4COM/OLEandDatabaseInteroperability
15.5CONCLUSION
l5.6BIBLIOGRAPHICNOTES
15.7EXERCISES
16CURRENTISSUES
16.1DATADELIVERYALTERNATIVES
16.2DATAWAREHOUSING
16.2.lArchitectures
16.2.2OLAPDataModel
16.2.3OLAPServers
16.2.4ResearchIssues
l6.3WORLDWIDEWEB
16.3.1ArchitectureandProtocols
16.3.2DatabaseAccess
l6.3.3SemistructuredData
16.3.4ArchitecturesforInformationIntegration
16.3.5ResearchProjectsandOpenIssues
16.4PUSH-BASEDTECHNOLOGIES
16.4.1DeliveryScheduleGeneration
16.4.2ClientCacheManagement
16.4.3PropagatingUpdates
16.5MOBILEDATABASES
16.5.1DirectoryManagement
16.5.2Caching
16.5.3BroadcastData
16.5.4QueryProcessingandOptimization
16.5.5ThansactionManagement
16.6BIBLIOGRAPHICNOTES
BIBLIOGRAPHY
SUBJECTINDEX
-
内容简介:
本书是一本非常适合作研究生数据库教学用的教材。其内容包括了分布式数据库所用的基本原理、方法、重要的算法介绍及部分系统的实际实现技巧。第2版还增加了一些新的内容如:用整整两章来介绍并行数据库和分布式对象数据库管理系统。本书具有以下特点:1.内容较为全面,系统地覆盖了分布式数据库的主要方面;2.反映了目前的一些研究成果如:数据仓库,万维网和数据库,基于推理的技术以及移动DBMS;3.叙述清楚,容易阅读。本书在清华大学计算机系研究生教学中使用了6年,反映较好。
-
目录:
PREFACETOTHESECONDEDITION
PREFACETOTHEFIRSTEDITION
11NTRODUCTION
1.1DISTRIBUTEDDATAPROCESSING
l.2WHATISADISTRIBUTEDDATABASESYSTEM?
1.3PROMISESOFDDBSs
1.3.1TransparentManagementofDistributedandReplicatedData
1.3.2ReliabilityThroughDistributedTransactions
1.3.3ImprovedPerformance
1.3.4EasierSystemExpansion
1.4COMPLICATINGFACTORS
1.5PROBLEMAREAS
l.5.1DistributedDatabaseDesign
1.5.2DistributedQueryProcessing
l.5.3DistributedDirectoryManagement
1.5.4DistributedConcurrencyControl
1.5.5DistributedDeadlockManagement
1.5.6ReliabilityofDistributedDBMS
1.5.7OperatingSystemSupport
1.5.8HeterogeneousDatabases
1.5.9RelationshipamongProblems
1.6BIBLIOGRAPHICNOTES
2OVERVIEWOFRELATIONALDBMS
2.1RELATIONALDATABASECONCEPTS
2.2NORMALIZATION
2.2.1DependencyStructures
2.2.2NormalForms
2.3INTEGMTYRULES
2.4RELATIONALDATALANGUAGES
2.4.1RelationalAlgebra
2.4.2RelationalCalculus
2.4.3InterfacewithProgrammingLanguages
2.5RELATIONALDBMS
2.6BIBLJOCRAPHICNOTES
3REVIEWOFCOMPUTERNETWORKS
3.1DATACOMMUNICATIONCONCEPTS
3.2TYPESOFNETWORKS
3.2.1Topology
3.2.2CommunicationSchemes
3.2.3Scale
3.3PROTOCOLSTANDARDS
3.4BROADBANDNETWORKS
3.5WIRELESSNETWORKS
3.6INTERNET
3.7CONCLUDINGREMARKS
3.8BIBLIOGRAPHICNOTES
4DISTRIBUTEDDBMSARCHITECTURE
4.1DBMSSTANDARDIZATION
4.2ARCHITECTURALMODELSFORDISTRIBUTEDDBMSs
4.2.lAutonomy
4.2.2Distribution
4.2.3Heterogeneity
4.2.4ArchitecturalAlternatives
4.3DISTRIBUTEDDBMSARCHITECTURE
4.3.1Client/ServerSystems
4.3.2Peer-to-PeerDistributedSystems
4.3.3MDBSArchitecture
4.4GLOBALDIRECTORYISSUES
4.5CONCLUSION
4.6BIBLIOGRAPHICNOTES
5DISTRIBUTEDDATABASEDESIGN
5.lALTERNATIVEDESIGNSTRATEGIES
5.1.1Top-DownDesignProcess
5.1.2Bottom-UpDesignProcess
5.2DISTRIBUTIONDESIGNISSUES
5.2.lReasonsforFragmentation
5.2.2FragmentationAlternatives
5.2.3DegreeofFragmentation
5.2.4CorrectnessRulesofFragmentation
5.2.5AllocationAlternatives
5.2.6InformationRequirements
5.3FRAGMENTATION
5.3.1HorizontalFragmentation
5.3.2VerticalFragmentation
5.3.3HybridFragmentation
5.4ALLOCATION
5.4.1AllocationProblem
5.4.2InformationRequirements
5.4.3AllocationModel
5.4.4SolutionMethods
5.5CONCLUSION
5.6BIBLIOGRAPHICNOTES
5.7EXERCISES
6SEMANTICDATACONTROL
6.1VIEWMANAGEMENT
6.1.1ViewsinCentralizedDBMSs
6.1.2UpdatesthroughViews
6.1.3ViewsinDistributedDBMSs
6.2DATASECURITY
6.2.lCentralizedAuthorizationControl
6.2.2DistributedAuthorizationControl
6.3SEMANTICINTEGRITYCONTROL
6.3.lCelltra1izedSemanticIntegrityControl
6.3.2DistributedSemanticIntegrityControl
6.4CONCLUSION
6.5BIBLIOGRAPHICNOTES
6.6EXERCISES
7OVERVIEWOFQUERYPROCESSING
7.lQUERYPROCESSINGPROBLEM
7.2OBJECTIVESOFQUERYPROCESSING
7.3COMPLEXITYOFRELATIONALALGEBRAOPERATJONS
7.4CHARACTERIZATIONOFQUERYPROCESSORS
7.4.lLanguages
7.4.2TypesofOptimization
7.4.3OptimizationTiming
7.4.4Statistics
7.4.5DecisionSites
7.4.6Exploitationof-theNetworkTopology
7.4.7ExploitationofReplicatedFragments
7.4.8UseofSemijoins
7.5LAYERSOFQUERYPROCESSING
7.5.lQueryDecomposition
7.5.2DataLocalization
7.5.3GlobalQueryOptimization
7.5.4LocalQueryOpti1nization
7.6CONCLUSION
7.7BIBLIOGRAPHICNOTES
8QUERYDECOMPOSITIONANDDATALOCALIZATION
8.1.QUERYDECOMPOSITION
8.l.1Normalization
8.1.2Analysis
8.1.3EliminationofRedundancy
8.1.4Rewriting
8.2LOCALIZATIONOFDISTRIBUTEDDATA
8.2.1ReductionforPrimaryHorizolltalFragmentation
8.2.2ReductionforVerticalFragmentation
8.2.3ReductionforDerivedFragmentation
8.2.4ReductionforHybridFragmentation
8.3CONCLUSION
8.4BIBLIOGRAPHICNOTES
8.5EXERCISES
9OPTIMIZATIONOFDISTRIBUTEDQUERIES
9.1QUERYOPTIMIZATION
9.1.1SearchSpace
9.l.2SearchStrategy
9.1.3DistributedCostModel
9.2CENTRALIZEDQUERYOPTIMIZATION
9.2.lINGRESAlgorithm
9.2.2SystemRA1gorithm
9.3JOINORDERINGINFRAGMENTQUERIES
9.3.1JoinOrdering
9.3.2SemijoinBasedAlgorithms
9.3.3JoinversusSemijoin
9.4DISTRJBUTEDQUERYOPTIMIZATIONALGORITHMS
9.4.1DistributedINpRESAlgorithm
9.4.2R*Algorithm
9.4.3SDD-1Algorithm
9.5CONCLUSION
9.6BIBLIOGRAPHICNOTES
9.7EXERCISES
10INTRODUCTIONTOTRANSACTIONMANAGEMENT
10.1DEFINITIONOFATRANSACTION
10.1.1TerminationConditionsofThansactions
l0.1.2CharacterizationofTransactions
10.1.3FormalizationoftheTransactionConcept
10.2PROPERTIESOFTRANSACTIONS
10.2.1Atomicity
10.2.2Consistency
l0.2.3Isolation
l0.2.4Durabi1ity
l0.3TYPESOFTRANSACTIONS
l0.3.1FlatThansactions
l0.3.2NestedTransactions
10.3.3Workflows
l0.4ARCHITECTUREREVISITED
l0.5CONCLUSION
10.6BIBLIOGRAPHICNOTES
11DISTRIBUTEDCONCURRENCYCONTROL
11.1SERIALIZABILITYTHEORY
l1.2TAXONOMYOFCONCURRENCYCONTROLMECHANISMS
11.3LOCKING-BASEDCONCURRENCYCONTROLALGORITHMS
11.3.lCentralized2PL
11.3.2PrimaryCopy2PL
11.3.3Distributed2PL
11.4TIMESTAMP-BASEDCONCURRENCYCONTROLALGORITHMS
11.4.lBasicTOAlgorithm
11.4.2ConservativeTOAlgorithm
11.4.3MultiversionTOAlgorithm
1l.5OPTIMISTICCONCURRENCYCONTROLALGORITHMS
11.6DEADLOCKMANAGEMENT
11.6.1DeadlockPrefelltion
l1.6.2DeadlockAvoidance
11.6.3DeadlockDetectionandResolution
l1.7"RELAXED"CONCURRENCYCONTROL
11.7.1Non-SerializableSchedules
11.7.2NestedDistributednansactions
11.8CONCLUSION
11.9BIBLIOGRAPHICNOTES
11.10EXERCISES
12DISTRIBUTEDDBMSRELIABILITY
12.1RELIABlLITYCONCEPTSANDMEASURES
12.l.1System,State,andFailure
12.1.2ReliabilityandAvailability
12.1.3MeanTimebetweenFailures/MeanTimetoRepair
12.2FAILURESANDFAULTTOLERANCEINDISTRIBUTEDSYSTEMS
12.2.1ReasonsforFailures
l2.2.2BasicFaultToleranceApproachesandTechniques
12.3FAILURESINDISTRIBUTEDDBMS
12.3.lThansactionFailures
12.3.2Site(System)Failures
12.3.3MediaFailures
12.3.4CommunicationFailures
12.4LOCALRELIABILITYPROTOCOLS
l2.4.lArchitecturalConsiderations
12.4.2RecoveryInformation
12.4.3ExecutionofLRMCommands
12.4.4Checkpoillting
l2.4.5HandlingMediaFailures
12.5DISTRIBUTEDRELIABILITYPROTOCOLS
12.5.1ComponentsofDistributedReliabilityProtocols
12.5.2Two-PhaseCommitProtocol
12.5.3Variationsof2PC
12.6DEALINGWITHSITEFAILURES
12.6.1TerminationandRecoveryProtocolsfor2PC
12.6.2Three-PhaseCommitProtocol
12.7NETWORKPARTITIONING
12.7.1CentralizedProtocols
12.7.2Voting-basedProtocols
12.7.3ReplicationandReplicaContro1Protocols
l2.7.4StrictReplicaControlProtocols
l2.7.5LazyReplicationProtocols
12.8ARCHITECTURALCONSIDERATIONS
12.9CONCLUSION
12.10BIBLIOGRAPHICNOTES
12.11EXERCISES
13MRALLELDATABASESYSTEMS
13.1DATABASESERVERS
13.1.1DatabaseServerApproach
13.1.2DatabaseServersandDistributedDatabases
13.2PARALLELARCHITECTURES
13.2.lObjectives
13.2.2FunctionalAspects
13.2.3ParallelSystemArchitectures
13.3PARALLELDBMSTECHNIQUES
13.3.lDataPlacement
13.3.2QueryParallelism
13.3.3Para1lelDataProcessing
13.3.4ParallelQueryOptimization
13.4PARALLELEXECUTIONPROBLEMS
l3.4.1Initialization
l3.4.2IllterferencesandConvoyEffect
13.4.3LoadBalancing
13.5PARALLELEXECUTIONFORHIERARCHlCALARCHITECTURE
13.5.1ProblemFormulation
13.5.2BasicConcepts
13.5.3LoadBalancingStrategy
13.5.4PerformanceEvaluation
l3.6CONCLUSION
13.7BIBLIOGRAPHICNOTES
13.8EXERCISES
14DISTmBUTEDOBJECTDATABASEMANAGEMENTSYSTEMS
14.1FUNDAMENTALOBJECTCONCEPTSANDMODELS
14.l.1Object
14.1.2AbstractDataTypes
14.l.3Composition(Aggregation)
14.1.4Class
14.l.5Collection
l4.1.6SubtypingandInheritance
l4.2OBJECTDISTRIBUTIONDESIGN
l4.2.1HorizontalClassPartitioning
14.2.2VerticalClassPartitioning
14.2.3PathPartitioning
l4.2.4ClassPartitioningAlgorithms
14.2.5Allocation
14.2.6Replication
l4.3ARCHITECTURALISSUES
14.3.1AlternativeClient/ServerArchitectures
14.3.2CacheConsistency
14.4OBJECTMANAGEMENT
l4.4.1ObjectIdentifierManagement
14.4.2PointerSwizzling
l4.4.3ObjectMigration
14.5DISTRIBUTEDOBJECTSTORAGE
l4.6OBJECTQUERYPROCESSING
14.6.lObjectQueryProcessorArchitectures
14.6.2QueryProcessingIssues
l4.6.3QueryExecution
l4.7TRANSACTIONMANAGEMENT
l4.7.1CorrectnessCriteria
l4.7.2ThansactionModelsandObjectStructures
14.7.3ThansactionsManagemefltinObjectDBMSs
l4.7.4ThansaCtionsasObjects
14.8CONCLUSION
l4.9BIBLIOGRAPHICNOTES
14.l0EXERCISES
15DATABASEINTEROPERABILITY
15.1DATABASEINTEGRATION
15.1.1SchemaTrans1ation
15.1.2SchemaIntegration
15.2QUERYPROCESSING
15.2.1QueryProcessingLayersinDistributedMulti--DBMSs
15.2.2QueryOptimizationIssues
15.3TRANSACTIONMANAGEMENT
15.3.1ThansactionandComputationModel
15.3.2MultidatabaseConcurrencyControl
15.3.3MultidatabaseRecovery
15.4OBJECTORIENTATIONANDINTEROPERABILITY
15.4.1ObjectManagementArchitecture
15.4.2CORBAandDatabaseInteroperability
15.4.3DistributedComponentObjectModel
15.4.4COM/OLEandDatabaseInteroperability
15.5CONCLUSION
l5.6BIBLIOGRAPHICNOTES
15.7EXERCISES
16CURRENTISSUES
16.1DATADELIVERYALTERNATIVES
16.2DATAWAREHOUSING
16.2.lArchitectures
16.2.2OLAPDataModel
16.2.3OLAPServers
16.2.4ResearchIssues
l6.3WORLDWIDEWEB
16.3.1ArchitectureandProtocols
16.3.2DatabaseAccess
l6.3.3SemistructuredData
16.3.4ArchitecturesforInformationIntegration
16.3.5ResearchProjectsandOpenIssues
16.4PUSH-BASEDTECHNOLOGIES
16.4.1DeliveryScheduleGeneration
16.4.2ClientCacheManagement
16.4.3PropagatingUpdates
16.5MOBILEDATABASES
16.5.1DirectoryManagement
16.5.2Caching
16.5.3BroadcastData
16.5.4QueryProcessingandOptimization
16.5.5ThansactionManagement
16.6BIBLIOGRAPHICNOTES
BIBLIOGRAPHY
SUBJECTINDEX
查看详情