內容簡介
《事務處理概念與技術(英文版)》重點放在事務處理的基本概念上，主要闡述事務概念是如何用於解決分散式系統問題的，以及利用這些概念如何能夠在有限的資金和風險範圍內建立高性能、高可用性的套用系統。全書重點講述了事務處理基礎、容錯基礎知識、面向事務的計算、並發控制、恢復、事務型檔案系統、系統概覽等7個主題，介紹了事務的ACID特性、並發的理論和實踐、事務管理和恢復技術等方面的內容，最後還介紹了一個非常重要的資源管理器的實現。
作者簡介
JimGray，（1944-2007）計算機科學大師，因在資料庫和事務處理研究和實現方面的開創性貢獻而獲得1998年圖靈獎。美國科學院、工程院兩院院士，ACM和IEEE兩會會士：他25歲成為加州大學伯克利分校計算機科學學院第一位博士。在IBM工作期間參與和主持了IMS、SystemR、SQUDS、DB2等項目的開發。後任職於微軟研究院．主要關注套用資料庫技術來處理各學科的海量信息。2007年1月獨自駕船出海後失蹤。
編輯推薦
事務處理廣泛套用於資料庫和作業系統等領域，對構建高性能、並發、分散式的可靠現代計算機系統至關重要。《事務處理概念與技術(英文版)》是被譽為“事務處理聖經”的經典名著，由圖靈獎得主JimGray和世界資料庫權威AndreasReuter合著，是兩位大師數十年學術研究和實踐經驗的結晶。
《事務處理概念與技術(英文版)》的組織和敘述方法獨樹一幟，作者將事務作為統一的概念框架．由此出發，筆鋒所至，縱橫開闔，引導讀者從系統實現者的角度．全面深入地審視了計算機系統的方方面面．不僅闡述理論，而且針對各種實際問題，詳細解釋出現的原因，講述大量已經在成功的商業和研究項目中經過驗證、行之有效的事務處理實現技術，並提供了豐富的C語言代碼。書中處處閃爍著作者對計算機系統的淵博學識和真知灼見，無論你是程式設計師、架構師、資料庫管理員，還是科研人員和高校師生，都將從《事務處理概念與技術(英文版)》中獲益匪淺。
目錄
Contents
PARTONE——TheBasicsofTransactionProcessing
1 INTRODUCTION 3
1.1 HistoricalPerspective 3
1.2 WhatIsaTransacUonProcessingSystem？ 5
1.2.1 TheEndUser'sViewofaTransactionProcessingSystem 8
1.2.2 TheAdministrator/Operator'sViewofaTPSystem 9
1.2.3 ApplicationDesigner'sViewofaTPSystem 12
1.2.4 TheResourceManager'sViewofaTPSystem 18
1.2.5 TPSystemCoreServices 21
1.3ATransactionProcessingSystemFeatureList 22
1.3.1 ApplicationDevelopmentFeatures 22
1.3.2 RepositoryFeatures 23
1.3.3 TPMonitorFeatures 26
1.3.4 DataCommunicationsFeatures 29
1.3.5 DatabaseFeatures 33
1.3.6 OperationsFeatures 39
1.3.7 EducationandTestingFeatures 40
1.3.8 FeatureSummary 41
1.4 Summary 42
1.5 HistoricalNotes 43
Exercises 44
Answers 46
2 BASICCOMPUTERSCIENCETERMINOLOGY 47
2.1 Introduction 47
2.1.1 Units 47
2.2 BasicHardware 48
2.2.1 Memories 49
2.2.2 Processors 57
2.2.3 CommunicationsHardware 58
2.2.4 HardwareArchitectures 59
2.3 BasicSoftware——AddressSpaces,Processes,Sessions 62
2.3.1 AddressSpaces 62
2.3.2 Processes,ProtectionDomains,andThreads 63
2.3.3 MessagesandSessions 66
2.4 GenericSystemIssues 67
2.4.1 ClientsandServers 67
2.4.2 Naming 69
2.4.3 Authentication 70
2.4.4 Authorization 71
2.4.5 SchedulingandPerformance 72
2.4.6 Summary 74
2.5 Files 74
2.5.1 FileOperations 74
2.5.2 FileOrganizations 75
2.5.3 DistributedFiles 77
2.5.4 SQL 78
2.6 SoftwarePerformance 78
2.7 TransactionProcessingStandards 80
2.7.1 PortabilityversusInteroperabilityStandards 80
2.7.2 APIsandFAPs 80
2.7.3 LU6.2,adefactoStandard 82
2.7.4 OSI-TPwithX/OpenDTP,adejureStandard 83
2.8 Summary 85
Exercises 86
Answers 88
PARTTWO——TheBasicsofFaultTolerance
3 FAULTTOLERANCE 93
3.1 Introduction 93
3.1.1 ACrashCourseinSimpleProbability 93
3.1.2 AnExternalViewofFaultTolerance 95
3.2 Definitions 98
3.2.1 Fault,Failure,Availability,Reliability 98
3.2.2 TaxonomyofFaultAvoidanceandFaultTolerance 99
3.2.3 Repair,Failfast,Modularity,RecursiveDesign 100
3.3 EmpiricalStudies 100
3.3.1 OutagesAreRareEvents 100
3.3.2 StudiesofConventionalSystems 101
3.3.3 AStudyofaFault-TolerantSystem 103
3.4 TypicalModuleFailureRates 105
3.5 HardwareApproachestoFaultTolerance 109
3.5.1 TheBasicN-PlexIdea:HowtoBuildFailfastModules 109
3.5.2 FailfastversusFailvoteVotersinanN-Plex 109
3.5.3 N-PlexplusRepairResultsinHighAvailability 112
3.5.4 TheVoter'sProblem 113
3.5.5 Summary 115
3.6 SoftwareIstheProblem 115
3.6.1 N-VersionProgrammingandSoftwareFaultTolerance 116
3.6.2 TransactionsandSoftwareFaultTolerance 117
3.6.3 Summary 119
3.7 FaultModelandSoftwareFaultMasking 119
3.7.1 AnOverviewoftheModel 120
3.7.2 BuildingHighlyAvailableStorage 122
3.7.3 HighlyAvailableProcesses 128
3.7.4 ReliableMessagesviaSessionsandProcessPairs 138
3.7.5 SummaryoftheProcess-Message-StorageModel 147
3.8 GeneralPrinciples 148
3.9 ACautionaryTale——SystemDelusion 149
3.10 Summary 150
3.11 HistoricalNotes 151
Exercises 152
Answers 155
PARTTHREE——Transaction-OrientedComputing
4 TRANSACTIONMODELS 159
4.1 Introduction 159
4.1.1 AboutthisChapter 160
4.2 AtomicActionsandFlatTransactions 160
4.2.1 DiskWritesasAtomicActions 161
4.2.2 AClassificationofActionTypes 163
4.2.3 FlatTransactions 165
4.2.4 LimitationsofFlatTransactions 171
4.3 SpheresofControl 174
4.3.1 DefinitionofSpheresofControl 174
4.3.2 DynamicBehaviorofSpheresofControl 176
4.3.3 Summary 180
4.4 ANotationforExplainingTransactionModels 180
4.4.1 WhatIsRequiredtoDescribeTransactionModels? 181
4.4.2 ElementsoftheNotation 183
4.4.3 DefiningTransactionModelsbyaSetofSimpleRules 184
4.5 FlatTransactionswithSavepoints 187
4.5.1 AboutSavepoints 187
4.5.2 DevelopingtheRulesfortheSavepointModel 189
4.5.3 PersistentSavepoints 190
4.6 ChainedTransactions 192
4.7 NestedTransactions 195
4.7.1 DefinitionoftheNestingStructure 195
4.7.2 UsingNestedTransactions 198
4.7.3 EmulatingNestedTransactionsbySavepoints 200
4.8 DistributedTransactions 202
4.9 Multi-LevelTransactions 203
4.9.1 TheRoleofaCompensatingTransaction 204
4.9.2 TheUseofMulti-LevelTransactions 206
4.10 OpenNestedTransactions 210
4.11 Long-LivedTransactions 210
4.11.1 TransactionProcessingContext 212
4.11.2 TheMini-Batch 215
4.11.3 Sagas 217
4.12 Exotics 219
4.13 Summary 221
4.14 HistoricalNotes 222
Exercises 225
5 TRANSACTIONPROCESSINGMONITORS——AnOverview 239
5.1 Introduction 239
5.2 TheRoleofTPMonitorsinTransactionSystems 239
5.2.1 TheTransaction-orientedComputingStyle 241
5.2.2 TheTransactionProcessingServices 249
5.2.3 TPSystemProcessStructure 252
5.2.4 Summary 258
5.3 TheStructureofaTPMonitor 259
5.3.1 TheTPMonitorComponents 260
5.3.2 ComponentsoftheTransactionServices 263
5.3.3 TPMonitorSupportfortheResourceManagerInterfaces 266
5.4 TransactionalRemoteProcedureCalls:TheBasicIdea 267
5.4.1 WhoParticipatesinRemoteProcedureCalls? 267
5.4.2 AddressSpaceStructureRequiredforRPCHandling 268
5.43 TheDynamicsofRemoteProcedureCalls 270
5.4.4 Summary 273
5.5 ExamplesoftheTransaction-OrientedProgrammingStyle 274
5.5.1 TheBasicProcessingLoop 275
5.5.2 AttachingResourceManagerstoTransactions:TheSimpleCases 276
5.5.3 AttachingResourceManagerstoTransactions:TheSophisticatedCase 282
5.5.4 UsingPersistentSavepoints 284
5.6 TerminologicalWrap-Up 285
5.7 HistoricalNotes 286
Exercises 288
Answers 289
6 TRANSACTIONPROCESSINGMONITORS 293
6.1 Introduction 293
6.2 TransactionalRemoteProcedureCalls 295
6.2.1 TheResourceManagerInterface 297
6.2.2 WhattheResourceManagerHastoDoinSupportofTransactions 299
6.2.3 InterfacesbetweenResourceManagersandtheTPMonitor 301
6.2.4 ResourceManagerCallsversusResourceManagerSessions 304
6.2.5 Summary 312
6.3 FunctionalPrinciplesoftheTPMonitor 312
6.3.1 TheCentralDataStructuresoftheTPOS 313
6.3.2 DataStructuresOwnedbytheTPMonitor 318
6.3.3 AGuidedTourAlongtheTRPCPath 324
6.3.4 AbortsRacingTRPCs 331
6.3.5 Summary 332
6.4 ManagingRequestandResponseQueues 333
6.4.1 Short-TermQueuesforMappingResourceManagerInvocations 335
6.4.2 DurableRequestQueuesforAsynchronousTransactionProcessing 336
6.4.3 Summary 347
6.5 OtherTasksoftheTPMonitor 347
6.5.1 LoadBalancing 347
6.5.2 AuthenticationandAuthorization 354
6.5.3 RestartProcessing 360
6.6 Summary 362
6.7 HistoricalNotes 364
Exercises 366
Answers 368
PARTFOUR——ConcurrencyControl
7 ISOLATIONCONCEPTS 375
7.1 Overview 375
7.2 IntroductiontoIsolation 375
7.3 TheDependencyModelofIsolation 378
7.3.1 StaticversusDynamicAllocation 378
7.3.2 TransactionDependencies 379
7.3.3 TheThreeBadDependencies 380
7.3.4 TheCaseforaFormalModelofIsolation 381
7.4 Isolation:TheApplicationProgrammer'sView 382
7.5 IsolationTheorems 383
7.5.1 ActionsandTransactions 383
7.5.2 Well-FormedandTwo-PhasedTransactions 385
7.5.3 TransactionHistories 385
7.5.4 LegalHistoriesandLockCompatibility 386
7.5.5 Versions,Dependencies,andtheDependencyGraph 387
7.5.6 EquivalentandIsolatedHistories:BEFORE,AFTER,andWormholes 388
7.5.7 WormholesAreNotIsolated 389
7.5.8 SummaryofDefinitions 390
7.5.9 SummaryoftheIsolationTheorems 396
7.6 DegreesofIsolation 397
7.6.1 DegreesofIsolationTheorem 398
7.6.2 SQLandDegreesofIsolation 398
7.6.3 ProsandConsofLowDegreesofIsolation 400
7.6.4 ExoticSQLIsolation——Read-PastandNotifyLocks 402
7.7 PhantomsandPredicateLocks 403
7.7.1 TheProblemwithPredicateLocks 405
7.8 GranularLocks 406
7.8.1 TreeLockingandIntentLockModes 406
7.8.2 UpdateModeLocks 409
7.8.3 GranularLockingSummary 410
7.8.4 Key-RangeLocking 411
7.8.5 DynamicKey-RangeLocks:Previous-KeyandNext-KeyLocking 412
7.8.6 Key-RangeLocksNeedDAGLocking 414
7.8.7 TheDAGLockingProtocol 415
7.8.8 FormalDefinitionofGranularLocksonaDAG 417
7.9 LockingHeuristics 419
7.10 NestedTransactionLocking 421
7.11 SchedulingandDeadlock 422
7.11.1 TheConvoyPhenomenon 423
7.11.2 DeadlockAvoidanceversusToleration 424
7.11.3 TheWait-forGraphandaDeadlockDetector 425
7.11.4 DistributedDeadlock 426
7.11.5 ProbabilityofDeadlock 428
7.12 Exotics 429
7.12.1 FieldCalls 430
7.12.2 EscrowLockingandOtherFieldCallRefinements 432
7.12.3 OptimisticandTimestampLocking 434
7.12.4 TimeDomainAddressing 435
7.13 Summary 437
7.14 HistoricalNotes 438
Exercises 440
Answers 442
8 LOCKIMPLEMENTATION 449
8.1 Introduction 449
8.1.1 AboutThisChapter 449
8.1.2 TheNeedforParallelismwithintheLockManager 449
8.1.3 TheResourceManagerandLockManagerAddressSpace 450
8.2 AtomicMachineInstructions 452
8.3 Semaphores 454
8.3.1 ExclusiveSemaphores 454
8.3.2 Crabbing:TraversingSharedDataStructures 456
8.3.3 SharedSemaphores 458
8.3.4 AllocatingSharedStorage 461
8.3.5 SemaphoresandExceptions 462
8.4 LockManager 464
8.4.1 LockNames 464
8.4.2 LockQueuesandScheduling 465
8.4.3 LockDurationandLockCounts 467
8.4.4 LockManagerInterfaceandDataStructures 469
8.4.5 LockManagerInternalLogic 471
8.4.6 LockEscalationandGenericUnlock,NotifyLocks 477
8.4.7 TransactionSavepoints,Commit,andRollback 478
8.4.8 LockingatSystemRestart 479
8.4.9 PhoenixTransactions 480
8.4.10 LockManagerConfigurationandComplexity 481
8.4.11 LockManagerSummary 481
8.5 DeadlockDetection 481
8.6 LockingforParallelandParallelNestedTransactions 483
8.7 Summary 484
8.8 HistoricalNotes 485
Exercises 485
Answers 488
PARTFIVE——Recovery
9 LOGMANAGER 493
9.1 Introduction 493
9.1.1 UsesoftheLog 493
9.1.2 LogManagerOverview 494
9.1.3 TheLogManager'sRelationshiptoOtherServices 495
9.1.4 WhyHaveaLogManager? 496
9.2 LogTables 496
9.2.1 MappingtheLogTableontoFiles 497
9.2.2 LogSequenceNumbers 499
9.3 PublicInterfacetotheLog 500
9.3.1 AuthorizationtoAccesstheLogTable 500
9.3.2 ReadingtheLogTable 500
9.3.3 WritingtheLogTable 502
9.3.4 Summary 503
9.4 ImplementationDetailsofLogReadsandWrites 504
9.4.1 ReadingtheLog 504
9.4.2 LogAnchor 505
9.4.3 TransactionRelatedAnchors 505
9.4.4 LogInsert 506
9.4.5 AllocateandFlushLogDaemons 507
9.4.6 CarefulWrites:SerialorPing-Pong 508
9.4.7 GroupCommit,Batching,Boxcarring 509
9.4.8 WADSWrites 510
9.4.9 MultipleLogsperTransactionManager 511
9.4.10 Summary 511
9.5 LogRestartLogic 511
9.5.1 SavingtheTransactionManagerAnchor 512
9.5.2 PreparingforRestart:CarefulWritesoftheLogAnchor 512
9.5.3 FindingtheAnchorandLogEndatRestart 513
9.6 ArchivingtheLog 514
9.6.1 HowMuchoftheLogTableShouldBeOnline? 514
9.6.2 Low-WaterMarksforRollback,Restart,Archive 515
9.6.3 DynamicLogs:CopyAsideversusCopyForward 516
9.6.4 ArchivingtheLogWithoutImpactingConcurrentTransactions 517
9.6.5 ElectronicVaultingandChangeAccumulation 518
9.6.6 DealingwithLogManager-ArchiveCircularity 519
9.7 LogginginaClient-ServerArchitecture 519
9.8 Summary 520
9.9 HistoricalNotes 521
Exercises 521
Answers 523
10 TRANSACTIONMANAGERCONCEPTS 529
10.1 Introduction 529
10.2 TransactionManagerInterfaces 529
10.2.1 TheApplicationInterfacetoTransactions 531
10.2.2 TheResourceManagerInterfacetoTransactions 534
10.2.3 TransactionManagerFunctions 536
10.3 TransactionalResourceManagerConcepts 538
10.3.1 TheDO-UNDO-REDOProtocol 538
10.3.2 TheLogTableandLogRecords 540
10.3.3 CommunicationSessionRecovery 541
10.3.4 ValueLogging 545
10.3.5 LogicalLogging 546
10.3.6 PhysiologicalLogging 548
10.3.7 PhysiologicalLoggingRules:FIX,WAL,andForce-Log-at-commit 550
10.3.8 CompensationLogRecords 558
10.3.9 IdempotenceofPhysiologicalREDO 560
10.3.10 Summary 561
10.4 Two-PhaseCommit:MakingComputationsAtomic 562
10.4.1 Two-PhaseCommitinaCentralizedSystem 563
10.4.2 DistributedTransactionsandTwo-PhaseCommit 567
10.5 Summary 573
10.6 HistoricalNotes 574
Exercises 576
Answers 578
11 TRANSACTIONMANAGERSTRUCTURE 585
11.1 Introduction 585
11.2 NormalProcessing 585
11.2.1 TransactionIdentifiers 586
11.2.2 TransactionManagerDataStructures 586
11.2.3 MyTrid(),Status_Transaction(),Leave_Transaction(),Resume_Transaction() 590
11.2.4 SavepointLogRecords 591
11.2.5 BeginWork()592
11.2.6 LocalCommiLWork(). 593
11.2.7 RemoteCommit_Work():Prepare()andCommit() 596
11.2.8 Save_Work()andRead_Context() 599
11.2.9 Rollback_Work() 601
11.3 Checkpoint 604
11.3.1 SharpCheckpoints 605
11.3.2 FuzzyCheckpoints 606
11.3.3 TransactionManagerCheckpoint 607
11.4 SystemRestart 609
11.4.1 TransactionStatesatRestart 610
11.4.2 TransactionManagerRestartLogic 610
11.4.3 ResourceManagerRestartLogic,Identify() 613
11.4.4 SummaryoftheRestartDesign 616
11.4.5 IndependentResourceManagers 616
11.4.6 TheTwo-CheckpointApproach:ADifferentStrategy 616
11.4.7 WhyRestartWorks 618
11.4.8 DistributedTransactionResolution:Two-PhaseCommitatRestart 620
11.4.9 AcceleratingRestart 620
11.4.10 OtherRestartIssues 621
11.5 ResourceManagerFailureandRestart 622
11.6 ArchiveRecovery 622
11.7 ConfiguringtheTransactionManager 624
11.7.1 TransactionManagerSizeandComplexity 624
11.8 Summary 624
Exercises 625
Answers 626
12 ADVANCEDTRANSACTIONMANAGERTOPICS 631
12.1 Introduction 631
12.2 HeterogeneousCommitCoordinators 631
12.2.1 ClosedversusOpenTransactionManagers 632
12.2.2 InteroperatingwithaClosedTransactionManager 632
12.2.3 WritingaGatewaytoanOpenTransactionManager 635
12.2.4 SummaryofTransactionGateways 638
12.3 HighlyAvailable(Non-Blocking)CommitCoordinators 638
12.3.1 HeuristicDecisionsResolveBlockedTransactionCommit 640
12.4 Transfer-of-Commit 641
12.5 0ptimizationsofTwo-PhaseCommit 643
12.5.1 Read-OnlyCommitOptimization 644
12.5.2 LazyCommitOptimization 645
12.5.3 LinearCommitOptimization 645
12.6 DisasterRecoveryataRemoteSite 646
12.6.1 SystemPairTakeover 648
12.6.2 SessionSwitchingatTakeover 649
12.6.3 ConfigurationOptions:1-Safe,2-Safe,andVerySafe 651
12.6.4 Catch-upAfterFailure 652
12.6.5 SummaryofSystemPairDesigns 653
12.7 Summary 654
12.8 HistoricalNotes 654
Exercises 655
Answers 656
PARTSIX——TransactionalFileSystem:ASampleResourceManager
13 FILEANDBUFFERMANAGEMENT 661
13.1 Introduction 661
13.2 TheFileSystemasaBasisforTransactionalDurableStorage 662
13.2.1 ExternalStorageversusMainMemory 662
13.2.2 TheExternalStorageModelUsedinthisBook 668
13.2.3 LevelsofAbstractioninaTransactionalFileandDatabaseManager 671
13.3 MediaandFileManagement 673
13.3.1 ObjectsandOperationsoftheBasicFileSystem 673
13.3.2 ManagingDiskSpace 677
13.3.3 CatalogManagementforLow-LevelFileSystems 686
13.4 BufferManagement 688
13.4.1 FunctionalPrinciplesoftheDatabaseBuffer 689
13.4.2 ImplementationIssuesofaBufferManager 697
13.4.3 LoggingandRecoveryfromtheBuffer'sPerspective 708
13.4.4 OptimizingBufferManagerPerformance 714
13.5 Exotics 723
13.5.1 SideFiles 724
13.5.2 Single-LevelStorage 732
13.6 Summary 738
13.7 HistoricalNotes 739
Exercises 741
Answers 744
14 THETUPLE-ORIENTEDFILESYSTEM 751
14.1 Introduction 751
14.2 MappingTuplesintoPages 752
14.2.1 InternalOrganizationofPages 752
14.2.2 FreeSpaceAdministrationinaFile 757
14.2.3 TupleIdentification 760
14.3 PhysicalTupleManagement 768
14.3.1 PhysicalRepresentationofAttributeValues 769
14.3.2 PhysicalRepresentationofShortTuples 772
14.3.3 SpecialAspectsofRepresentingAttributeValuesinTuples 784
14.3.4 PhysicalRepresentationofLongTuples 786
14.3.5 PhysicalRepresentationofComplexTuplesandVeryLongAttributes 791
14.4 FileOrganization 794
14.4.1 AdministrativeOperations 795
14.4.2 AnAbstractViewonDifferentFileOrganizationsviaScans 799
14.4.3 Entry-sequencedFiles 806
14.4.4System-SequencedFiles 811
14.4.5 RelativeFiles 814
14.4.6Key-SequencedFilesandHashFiles 817
14.4.7 Summary 818
14.5 Exotics 819
14.5.1ClusterFiles 819
14.5.2PartitionedFiles 820
14.5.3 UsingTransactionstoMaintaintheFileSystem 821
14.5.4 TheTuple-OrientedFileSysteminCurrentDatabaseSystems 822
14.6 Summary 823
Exercises 824
Answers 825
15 ACCESSPATHS831
15.1 Introduction 831
15.2 OverviewofTechniquestoImplementAssociativeAccessPaths 833
15.2.1 Summary 835
15.3 AssociativeAccessByHashing 835
15.3.1 FoldingtheKeyValueintoaNumericalDataType 836
15.3.2 CriteriaforaGoodHashFunction 838
15.3.3 OverflowHandlinginHashFiles 845
15.3.4 LocalAdministrationofPagesinaHashFile 848
15.3.5 SummaryofAssociativeAccessBasedonHashing 848
15.4 B-Trees 851
15.4.1 B-Trees:TheBasicIdea 851
15.4.2 PerformanceAspectsofB-Trees 861
15.4.3 SynchronizationonB-Trees:ThePage-OrientedView 867
15.4.4 SynchronizationonB-Trees:TheTuple-OrientedView 868
15.4.5 RecoveringOperationsonB-Trees 872
15.5 SampleImplementationofSomeOperationsonB-Trees 876
15.5.1 DeclarationsofDataStructuresAssumedinAllPrograms 876
15.52 ImplementationoftheroadkoyOperationonaB-Tree 878
15.5.3 Key-RangeLockinginaB-Tree 880
15.5.4 ImplementationoftheInsertOperationforaB-Tree:TheSimpleCase 882
15.5.5 ImplementingB-TreeInsert:TheSplitCase 884
15.5.6 Summary 886
15.6 Exotics 886
15.6.1 ExtendibleHashing 887
15.6.2 TheGridFile 892
15.6.3 HoleyBrickB-Trees 897
15.7 Summary 904
15.8 HistoricalNotes 905
Exercises 909
Answers 911
PARTSEVEN——SystemSurveys
16 SURVEYOFTPSYSTEMS 917
16.1 Introduction 917
16.2 IMS 917
16.2.1 HardwareandOperatingSystemEnvironment 918
16.2.2 WorkflowModel 920
16.2.3 ProgramIsolation 923
16.2.4 MainStorageDatabasesandFieldCalls 923
16.2.5 DataSharing 924
16.2.6 ImprovedAvailabilityandDuplexedSystems 925
16.2.7 DB2 927
16.2.8 RecentEvolutionofIMS 928
16.3 CICSandLU6.2 928
16.3.1 CICSOverview 928
16.3.2 CICSServices 930
16.3.3 CICSWorkflow 931
16.3.4 CICSDistributedTransactionProcessing 932
16.3.5 LU6.2 934
16.4 Guardian90 937
16.4.1 Guardian:TheOperatingSystemandHardware 938
16.4.2 Pathway,TerminalContext,andServerClassManagement 939
16.4.3 TransactionManagement 941
16.4.4 OtherInterestingFeatures 947
16.5 DECdta 947
16.5.1 ACMS'sThree-BallWorkflowModelofTransactionProcessing 948
16.5.2 ACMSServices 951
16.5.3 ACMSSummary 952
16.5.4 VMSTransactionManagementSupport 954
16.5.5 SummaryofDECdta 958
16.5.6 ReliableTransactionRouter(RTR) 959
16.6 X/OpenDTP,OSI-TP,CCR 960
16.6.1 TheLocalCase 962
16.6.2 TheDistributedCase:ServicesandServers 964
16.6.3 Summary 964
16.7 OtherSystems 965
16.7.1 UniversalTransactionManager(UTM) 965
16.7.2 ADABASTPF966
16.7.3 Encina 968
16.7.4 Tuxedo 970
16.8 Summary 972
PARTEIGHT——Addenda
17 REFERENCES 975
18 DATASTRUCTURESANDINTERFACES 993
19 GLOSSARY 1003
INDEX 1047
……
