事务处理概念与技术(英文版)
版权信息书 名: 事务处理概念与技术
作者：(美国)JimGray
出版社：人民邮电出版社
出版时间： 2009
ISBN: 9787115195869
开本： 16
定价: 138.00 元
内容简介《事务处理概念与技术(英文版)》从系统的角度全面阐述事务处理的概念和技术，其中涉及终端上的表示管理、通信子系统、操作系统、数据库、程序设计语言的运行时系统以及应用开发环境等。《事务处理概念与技术(英文版)》重点放在事务处理的基本概念上，主要阐述事务概念是如何用于解决分布式系统问题的，以及利用这些概念如何能够在有限的资金和风险范围内建立高性能、高可用性的应用系统。全书重点讲述了事务处理基础、容错基础知识、面向事务的计算、并发控制、恢复、事务型文件系统、系统概览等7个主题，介绍了事务的ACID特性、并发的理论和实践、事务管理和恢复技术等方面的内容，最后还介绍了一个非常重要的资源管理器的实现。《事务处理概念与技术(英文版)》主要面向计算机及相关专业的高年级本科生和研究生，适合作为事务处理导论、数据库系统、分布式系统、操作系统等课程的辅助教材，需要了解事务处理系统的开发人员也可将其作为基本参考书。
作者简介JimGray，（1944-2007）计算机科学大师，因在数据库和事务处理研究和实现方面的开创性贡献而获得1998年图灵奖。美国科学院、工程院两院院士，ACM和IEEE两会会士：他25岁成为加州大学伯克利分校计算机科学学院第一位博士。在IBM工作期间参与和主持了IMS、SystemR、SQUDS、DB2等项目的开发。后任职于微软研究院．主要关注应用数据库技术来处理各学科的海量信息。2007年1月独自驾船出海后失踪。
编辑推荐事务处理广泛应用于数据库和操作系统等领域，对构建高性能、并发、分布式的可靠现代计算机系统至关重要。《事务处理概念与技术(英文版)》是被誉为“事务处理圣经”的经典名著，由图灵奖得主JimGray和世界数据库权威AndreasReuter合著，是两位大师数十年学术研究和实践经验的结晶。
《事务处理概念与技术(英文版)》的组织和叙述方法独树一帜，作者将事务作为统一的概念框架．由此出发，笔锋所至，纵横开阖，引导读者从系统实现者的角度．全面深入地审视了计算机系统的方方面面．不仅阐述理论，而且针对各种实际问题，详细解释出现的原因，讲述大量已经在成功的商业和研究项目中经过验证、行之有效的事务处理实现技术，并提供了丰富的C语言代码。书中处处闪烁着作者对计算机系统的渊博学识和真知灼见，无论你是程序员、架构师、数据库管理员，还是科研人员和高校师生，都将从《事务处理概念与技术(英文版)》中获益匪浅。
目录Contents
PARTONE——TheBasicsofTransactionProcessing
1INTRODUCTION3
1.1HistoricalPerspective3
1.2WhatIsaTransacUonProcessingSystem？5
1.2.1TheEndUser'sViewofaTransactionProcessingSystem8
1.2.2TheAdministrator/Operator'sViewofaTPSystem9
1.2.3ApplicationDesigner'sViewofaTPSystem12
1.2.4TheResourceManager'sViewofaTPSystem18
1.2.5TPSystemCoreServices21
1.3ATransactionProcessingSystemFeatureList22
1.3.1ApplicationDevelopmentFeatures22
1.3.2RepositoryFeatures23
1.3.3TPMonitorFeatures26
1.3.4DataCommunicationsFeatures29
1.3.5DatabaseFeatures33
1.3.6OperationsFeatures39
1.3.7EducationandTestingFeatures40
1.3.8FeatureSummary41
1.4Summary42
1.5HistoricalNotes43
Exercises44
Answers46
2BASICCOMPUTERSCIENCETERMINOLOGY47
2.1Introduction47
2.1.1Units47
2.2BasicHardware48
2.2.1Memories49
2.2.2Processors57
2.2.3CommunicationsHardware58
2.2.4HardwareArchitectures59
2.3BasicSoftware——AddressSpaces,Processes,Sessions62
2.3.1AddressSpaces62
2.3.2Processes,ProtectionDomains,andThreads63
2.3.3MessagesandSessions66
2.4GenericSystemIssues67
2.4.1ClientsandServers67
2.4.2Naming69
2.4.3Authentication70
2.4.4Authorization71
2.4.5SchedulingandPerformance72
2.4.6Summary74
2.5Files74
2.5.1FileOperations74
2.5.2FileOrganizations75
2.5.3DistributedFiles77
2.5.4SQL78
2.6SoftwarePerformance78
2.7TransactionProcessingStandards80
2.7.1PortabilityversusInteroperabilityStandards80
2.7.2APIsandFAPs80
2.7.3LU6.2,adefactoStandard82
2.7.4OSI-TPwithX/OpenDTP,adejureStandard83
2.8Summary85
Exercises86
Answers88
PARTTWO——TheBasicsofFaultTolerance
3FAULTTOLERANCE93
3.1Introduction93
3.1.1ACrashCourseinSimpleProbability93
3.1.2AnExternalViewofFaultTolerance95
3.2Definitions98
3.2.1Fault,Failure,Availability,Reliability98
3.2.2TaxonomyofFaultAvoidanceandFaultTolerance99
3.2.3Repair,Failfast,Modularity,RecursiveDesign100
3.3EmpiricalStudies100
3.3.1OutagesAreRareEvents100
3.3.2StudiesofConventionalSystems101
3.3.3AStudyofaFault-TolerantSystem103
3.4TypicalModuleFailureRates105
3.5HardwareApproachestoFaultTolerance109
3.5.1TheBasicN-PlexIdea:HowtoBuildFailfastModules109
3.5.2FailfastversusFailvoteVotersinanN-Plex109
3.5.3N-PlexplusRepairResultsinHighAvailability112
3.5.4TheVoter'sProblem113
3.5.5Summary115
3.6SoftwareIstheProblem115
3.6.1N-VersionProgrammingandSoftwareFaultTolerance116
3.6.2TransactionsandSoftwareFaultTolerance117
3.6.3Summary119
3.7FaultModelandSoftwareFaultMasking119
3.7.1AnOverviewoftheModel120
3.7.2BuildingHighlyAvailableStorage122
3.7.3HighlyAvailableProcesses128
3.7.4ReliableMessagesviaSessionsandProcessPairs138
3.7.5SummaryoftheProcess-Message-StorageModel147
3.8GeneralPrinciples148
3.9ACautionaryTale——SystemDelusion149
3.10Summary150
3.11HistoricalNotes151
Exercises152
Answers155
PARTTHREE——Transaction-OrientedComputing
4TRANSACTIONMODELS159
4.1Introduction159
4.1.1AboutthisChapter160
4.2AtomicActionsandFlatTransactions160
4.2.1DiskWritesasAtomicActions161
4.2.2AClassificationofActionTypes163
4.2.3FlatTransactions165
4.2.4LimitationsofFlatTransactions171
4.3SpheresofControl174
4.3.1DefinitionofSpheresofControl174
4.3.2DynamicBehaviorofSpheresofControl176
4.3.3Summary180
4.4ANotationforExplainingTransactionModels180
4.4.1WhatIsRequiredtoDescribeTransactionModels?181
4.4.2ElementsoftheNotation183
4.4.3DefiningTransactionModelsbyaSetofSimpleRules184
4.5FlatTransactionswithSavepoints187
4.5.1AboutSavepoints187
4.5.2DevelopingtheRulesfortheSavepointModel189
4.5.3PersistentSavepoints190
4.6ChainedTransactions192
4.7NestedTransactions195
4.7.1DefinitionoftheNestingStructure195
4.7.2UsingNestedTransactions198
4.7.3EmulatingNestedTransactionsbySavepoints200
4.8DistributedTransactions202
4.9Multi-LevelTransactions203
4.9.1TheRoleofaCompensatingTransaction204
4.9.2TheUseofMulti-LevelTransactions206
4.10OpenNestedTransactions210
4.11Long-LivedTransactions210
4.11.1TransactionProcessingContext212
4.11.2TheMini-Batch215
4.11.3Sagas217
4.12Exotics219
4.13Summary221
4.14HistoricalNotes222
Exercises225
5TRANSACTIONPROCESSINGMONITORS——AnOverview239
5.1Introduction239
5.2TheRoleofTPMonitorsinTransactionSystems239
5.2.1TheTransaction-orientedComputingStyle241
5.2.2TheTransactionProcessingServices249
5.2.3TPSystemProcessStructure252
5.2.4Summary258
5.3TheStructureofaTPMonitor259
5.3.1TheTPMonitorComponents260
5.3.2ComponentsoftheTransactionServices263
5.3.3TPMonitorSupportfortheResourceManagerInterfaces266
5.4TransactionalRemoteProcedureCalls:TheBasicIdea267
5.4.1WhoParticipatesinRemoteProcedureCalls?267
5.4.2AddressSpaceStructureRequiredforRPCHandling268
5.43TheDynamicsofRemoteProcedureCalls270
5.4.4Summary273
5.5ExamplesoftheTransaction-OrientedProgrammingStyle274
5.5.1TheBasicProcessingLoop275
5.5.2AttachingResourceManagerstoTransactions:TheSimpleCases276
5.5.3AttachingResourceManagerstoTransactions:TheSophisticatedCase282
5.5.4UsingPersistentSavepoints284
5.6TerminologicalWrap-Up285
5.7HistoricalNotes286
Exercises288
Answers289
6TRANSACTIONPROCESSINGMONITORS293
6.1Introduction293
6.2TransactionalRemoteProcedureCalls295
6.2.1TheResourceManagerInterface297
6.2.2WhattheResourceManagerHastoDoinSupportofTransactions299
6.2.3InterfacesbetweenResourceManagersandtheTPMonitor301
6.2.4ResourceManagerCallsversusResourceManagerSessions304
6.2.5Summary312
6.3FunctionalPrinciplesoftheTPMonitor312
6.3.1TheCentralDataStructuresoftheTPOS313
6.3.2DataStructuresOwnedbytheTPMonitor318
6.3.3AGuidedTourAlongtheTRPCPath324
6.3.4AbortsRacingTRPCs331
6.3.5Summary332
6.4ManagingRequestandResponseQueues333
6.4.1Short-TermQueuesforMappingResourceManagerInvocations335
6.4.2DurableRequestQueuesforAsynchronousTransactionProcessing336
6.4.3Summary347
6.5OtherTasksoftheTPMonitor347
6.5.1LoadBalancing347
6.5.2AuthenticationandAuthorization354
6.5.3RestartProcessing360
6.6Summary362
6.7HistoricalNotes364
Exercises366
Answers368
PARTFOUR——ConcurrencyControl
7ISOLATIONCONCEPTS375
7.1Overview375
7.2IntroductiontoIsolation375
7.3TheDependencyModelofIsolation378
7.3.1StaticversusDynamicAllocation378
7.3.2TransactionDependencies379
7.3.3TheThreeBadDependencies380
7.3.4TheCaseforaFormalModelofIsolation381
7.4Isolation:TheApplicationProgrammer'sView382
7.5IsolationTheorems383
7.5.1ActionsandTransactions383
7.5.2Well-FormedandTwo-PhasedTransactions385
7.5.3TransactionHistories385
7.5.4LegalHistoriesandLockCompatibility386
7.5.5Versions,Dependencies,andtheDependencyGraph387
7.5.6EquivalentandIsolatedHistories:BEFORE,AFTER,andWormholes388
7.5.7WormholesAreNotIsolated389
7.5.8SummaryofDefinitions390
7.5.9SummaryoftheIsolationTheorems396
7.6DegreesofIsolation397
7.6.1DegreesofIsolationTheorem398
7.6.2SQLandDegreesofIsolation398
7.6.3ProsandConsofLowDegreesofIsolation400
7.6.4ExoticSQLIsolation——Read-PastandNotifyLocks402
7.7PhantomsandPredicateLocks403
7.7.1TheProblemwithPredicateLocks405
7.8GranularLocks406
7.8.1TreeLockingandIntentLockModes406
7.8.2UpdateModeLocks409
7.8.3GranularLockingSummary410
7.8.4Key-RangeLocking411
7.8.5DynamicKey-RangeLocks:Previous-KeyandNext-KeyLocking412
7.8.6Key-RangeLocksNeedDAGLocking414
7.8.7TheDAGLockingProtocol415
7.8.8FormalDefinitionofGranularLocksonaDAG417
7.9LockingHeuristics419
7.10NestedTransactionLocking421
7.11SchedulingandDeadlock422
7.11.1TheConvoyPhenomenon423
7.11.2DeadlockAvoidanceversusToleration424
7.11.3TheWait-forGraphandaDeadlockDetector425
7.11.4DistributedDeadlock426
7.11.5ProbabilityofDeadlock428
7.12Exotics429
7.12.1FieldCalls430
7.12.2EscrowLockingandOtherFieldCallRefinements432
7.12.3OptimisticandTimestampLocking434
7.12.4TimeDomainAddressing435
7.13Summary437
7.14HistoricalNotes438
Exercises440
Answers442
8LOCKIMPLEMENTATION449
8.1Introduction449
8.1.1AboutThisChapter449
8.1.2TheNeedforParallelismwithintheLockManager449
8.1.3TheResourceManagerandLockManagerAddressSpace450
8.2AtomicMachineInstructions452
8.3Semaphores454
8.3.1ExclusiveSemaphores454
8.3.2Crabbing:TraversingSharedDataStructures456
8.3.3SharedSemaphores458
8.3.4AllocatingSharedStorage461
8.3.5SemaphoresandExceptions462
8.4LockManager464
8.4.1LockNames464
8.4.2LockQueuesandScheduling465
8.4.3LockDurationandLockCounts467
8.4.4LockManagerInterfaceandDataStructures469
8.4.5LockManagerInternalLogic471
8.4.6LockEscalationandGenericUnlock,NotifyLocks477
8.4.7TransactionSavepoints,Commit,andRollback478
8.4.8LockingatSystemRestart479
8.4.9PhoenixTransactions480
8.4.10LockManagerConfigurationandComplexity481
8.4.11LockManagerSummary481
8.5DeadlockDetection481
8.6LockingforParallelandParallelNestedTransactions483
8.7Summary484
8.8HistoricalNotes485
Exercises485
Answers488
PARTFIVE——Recovery
9LOGMANAGER493
9.1Introduction493
9.1.1UsesoftheLog493
9.1.2LogManagerOverview494
9.1.3TheLogManager'sRelationshiptoOtherServices495
9.1.4WhyHaveaLogManager?496
9.2LogTables496
9.2.1MappingtheLogTableontoFiles497
9.2.2LogSequenceNumbers499
9.3PublicInterfacetotheLog500
9.3.1AuthorizationtoAccesstheLogTable500
9.3.2ReadingtheLogTable500
9.3.3WritingtheLogTable502
9.3.4Summary503
9.4ImplementationDetailsofLogReadsandWrites504
9.4.1ReadingtheLog504
9.4.2LogAnchor505
9.4.3TransactionRelatedAnchors505
9.4.4LogInsert506
9.4.5AllocateandFlushLogDaemons507
9.4.6CarefulWrites:SerialorPing-Pong508
9.4.7GroupCommit,Batching,Boxcarring509
9.4.8WADSWrites510
9.4.9MultipleLogsperTransactionManager511
9.4.10Summary511
9.5LogRestartLogic511
9.5.1SavingtheTransactionManagerAnchor512
9.5.2PreparingforRestart:CarefulWritesoftheLogAnchor512
9.5.3FindingtheAnchorandLogEndatRestart513
9.6ArchivingtheLog514
9.6.1HowMuchoftheLogTableShouldBeOnline?514
9.6.2Low-WaterMarksforRollback,Restart,Archive515
9.6.3DynamicLogs:CopyAsideversusCopyForward516
9.6.4ArchivingtheLogWithoutImpactingConcurrentTransactions517
9.6.5ElectronicVaultingandChangeAccumulation518
9.6.6DealingwithLogManager-ArchiveCircularity519
9.7LogginginaClient-ServerArchitecture519
9.8Summary520
9.9HistoricalNotes521
Exercises521
Answers523
10TRANSACTIONMANAGERCONCEPTS529
10.1Introduction529
10.2TransactionManagerInterfaces529
10.2.1TheApplicationInterfacetoTransactions531
10.2.2TheResourceManagerInterfacetoTransactions534
10.2.3TransactionManagerFunctions536
10.3TransactionalResourceManagerConcepts538
10.3.1TheDO-UNDO-REDOProtocol538
10.3.2TheLogTableandLogRecords540
10.3.3CommunicationSessionRecovery541
10.3.4ValueLogging545
10.3.5LogicalLogging546
10.3.6PhysiologicalLogging548
10.3.7PhysiologicalLoggingRules:FIX,WAL,andForce-Log-at-commit550
10.3.8CompensationLogRecords558
10.3.9IdempotenceofPhysiologicalREDO560
10.3.10Summary561
10.4Two-PhaseCommit:MakingComputationsAtomic562
10.4.1Two-PhaseCommitinaCentralizedSystem563
10.4.2DistributedTransactionsandTwo-PhaseCommit567
10.5Summary573
10.6HistoricalNotes574
Exercises576
Answers578
11TRANSACTIONMANAGERSTRUCTURE585
11.1Introduction585
11.2NormalProcessing585
11.2.1TransactionIdentifiers586
11.2.2TransactionManagerDataStructures586
11.2.3MyTrid(),Status_Transaction(),Leave_Transaction(),Resume_Transaction()590
11.2.4SavepointLogRecords591
11.2.5BeginWork()592
11.2.6LocalCommiLWork().593
11.2.7RemoteCommit_Work():Prepare()andCommit()596
11.2.8Save_Work()andRead_Context()599
11.2.9Rollback_Work()601
11.3Checkpoint604
11.3.1SharpCheckpoints605
11.3.2FuzzyCheckpoints606
11.3.3TransactionManagerCheckpoint607
11.4SystemRestart609
11.4.1TransactionStatesatRestart610
11.4.2TransactionManagerRestartLogic610
11.4.3ResourceManagerRestartLogic,Identify()613
11.4.4SummaryoftheRestartDesign616
11.4.5IndependentResourceManagers616
11.4.6TheTwo-CheckpointApproach:ADifferentStrategy616
11.4.7WhyRestartWorks618
11.4.8DistributedTransactionResolution:Two-PhaseCommitatRestart620
11.4.9AcceleratingRestart620
11.4.10OtherRestartIssues621
11.5ResourceManagerFailureandRestart622
11.6ArchiveRecovery622
11.7ConfiguringtheTransactionManager624
11.7.1TransactionManagerSizeandComplexity624
11.8Summary624
Exercises625
Answers626
12ADVANCEDTRANSACTIONMANAGERTOPICS631
12.1Introduction631
12.2HeterogeneousCommitCoordinators631
12.2.1ClosedversusOpenTransactionManagers632
12.2.2InteroperatingwithaClosedTransactionManager632
12.2.3WritingaGatewaytoanOpenTransactionManager635
12.2.4SummaryofTransactionGateways638
12.3HighlyAvailable(Non-Blocking)CommitCoordinators638
12.3.1HeuristicDecisionsResolveBlockedTransactionCommit640
12.4Transfer-of-Commit641
12.50ptimizationsofTwo-PhaseCommit643
12.5.1Read-OnlyCommitOptimization644
12.5.2LazyCommitOptimization645
12.5.3LinearCommitOptimization645
12.6DisasterRecoveryataRemoteSite646
12.6.1SystemPairTakeover648
12.6.2SessionSwitchingatTakeover649
12.6.3ConfigurationOptions:1-Safe,2-Safe,andVerySafe651
12.6.4Catch-upAfterFailure652
12.6.5SummaryofSystemPairDesigns653
12.7Summary654
12.8HistoricalNotes654
Exercises655
Answers656
PARTSIX——TransactionalFileSystem:ASampleResourceManager
13FILEANDBUFFERMANAGEMENT661
13.1Introduction661
13.2TheFileSystemasaBasisforTransactionalDurableStorage662
13.2.1ExternalStorageversusMainMemory662
13.2.2TheExternalStorageModelUsedinthisBook668
13.2.3LevelsofAbstractioninaTransactionalFileandDatabaseManager671
13.3MediaandFileManagement673
13.3.1ObjectsandOperationsoftheBasicFileSystem673
13.3.2ManagingDiskSpace677
13.3.3CatalogManagementforLow-LevelFileSystems686
13.4BufferManagement688
13.4.1FunctionalPrinciplesoftheDatabaseBuffer689
13.4.2ImplementationIssuesofaBufferManager697
13.4.3LoggingandRecoveryfromtheBuffer'sPerspective708
13.4.4OptimizingBufferManagerPerformance714
13.5Exotics723
13.5.1SideFiles724
13.5.2Single-LevelStorage732
13.6Summary738
13.7HistoricalNotes739
Exercises741
Answers744
14THETUPLE-ORIENTEDFILESYSTEM751
14.1Introduction751
14.2MappingTuplesintoPages752
14.2.1InternalOrganizationofPages752
14.2.2FreeSpaceAdministrationinaFile757
14.2.3TupleIdentification760
14.3PhysicalTupleManagement768
14.3.1PhysicalRepresentationofAttributeValues769
14.3.2PhysicalRepresentationofShortTuples772
14.3.3SpecialAspectsofRepresentingAttributeValuesinTuples784
14.3.4PhysicalRepresentationofLongTuples786
14.3.5PhysicalRepresentationofComplexTuplesandVeryLongAttributes791
14.4FileOrganization794
14.4.1AdministrativeOperations795
14.4.2AnAbstractViewonDifferentFileOrganizationsviaScans799
14.4.3Entry-sequencedFiles806
14.4.4System-SequencedFiles811
14.4.5RelativeFiles814
14.4.6Key-SequencedFilesandHashFiles817
14.4.7Summary818
14.5Exotics819
14.5.1ClusterFiles819
14.5.2PartitionedFiles820
14.5.3UsingTransactionstoMaintaintheFileSystem821
14.5.4TheTuple-OrientedFileSysteminCurrentDatabaseSystems822
14.6Summary823
Exercises824
Answers825
15ACCESSPATHS831
15.1Introduction831
15.2OverviewofTechniquestoImplementAssociativeAccessPaths833
15.2.1Summary835
15.3AssociativeAccessByHashing835
15.3.1FoldingtheKeyValueintoaNumericalDataType836
15.3.2CriteriaforaGoodHashFunction838
15.3.3OverflowHandlinginHashFiles845
15.3.4LocalAdministrationofPagesinaHashFile848
15.3.5SummaryofAssociativeAccessBasedonHashing848
15.4B-Trees851
15.4.1B-Trees:TheBasicIdea851
15.4.2PerformanceAspectsofB-Trees861
15.4.3SynchronizationonB-Trees:ThePage-OrientedView867
15.4.4SynchronizationonB-Trees:TheTuple-OrientedView868
15.4.5RecoveringOperationsonB-Trees872
15.5SampleImplementationofSomeOperationsonB-Trees876
15.5.1DeclarationsofDataStructuresAssumedinAllPrograms876
15.52ImplementationoftheroadkoyOperationonaB-Tree878
15.5.3Key-RangeLockinginaB-Tree880
15.5.4ImplementationoftheInsertOperationforaB-Tree:TheSimpleCase882
15.5.5ImplementingB-TreeInsert:TheSplitCase884
15.5.6Summary886
15.6Exotics886
15.6.1ExtendibleHashing887
15.6.2TheGridFile892
15.6.3HoleyBrickB-Trees897
15.7Summary904
15.8HistoricalNotes905
Exercises909
Answers911
PARTSEVEN——SystemSurveys
16SURVEYOFTPSYSTEMS917
16.1Introduction917
16.2IMS917
16.2.1HardwareandOperatingSystemEnvironment918
16.2.2WorkflowModel920
16.2.3ProgramIsolation923
16.2.4MainStorageDatabasesandFieldCalls923
16.2.5DataSharing924
16.2.6ImprovedAvailabilityandDuplexedSystems925
16.2.7DB2927
16.2.8RecentEvolutionofIMS928
16.3CICSandLU6.2928
16.3.1CICSOverview928
16.3.2CICSServices930
16.3.3CICSWorkflow931
16.3.4CICSDistributedTransactionProcessing932
16.3.5LU6.2934
16.4Guardian90937
16.4.1Guardian:TheOperatingSystemandHardware938
16.4.2Pathway,TerminalContext,andServerClassManagement939
16.4.3TransactionManagement941
16.4.4OtherInterestingFeatures947
16.5DECdta947
16.5.1ACMS'sThree-BallWorkflowModelofTransactionProcessing948
16.5.2ACMSServices951
16.5.3ACMSSummary952
16.5.4VMSTransactionManagementSupport954
16.5.5SummaryofDECdta958
16.5.6ReliableTransactionRouter(RTR)959
16.6X/OpenDTP,OSI-TP,CCR960
16.6.1TheLocalCase962
16.6.2TheDistributedCase:ServicesandServers964
16.6.3Summary964
16.7OtherSystems965
16.7.1UniversalTransactionManager(UTM)965
16.7.2ADABASTPF966
16.7.3Encina968
16.7.4Tuxedo970
16.8Summary972
PARTEIGHT——Addenda
17REFERENCES975
18DATASTRUCTURESANDINTERFACES993
19GLOSSARY1003
INDEX1047
……