DOCSLIB.ORG

Transaction Processing: Basics - Transactions • Transaction Is Execution of Program That Accesses DB • Basic Operations: 1

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Transaction Processing: Basics - Transactions • Transaction Is Execution of Program That Accesses DB • Basic Operations: 1 Transaction Processing: Basics - Transactions • Transaction is execution of program that accesses DB • Basic operations: 1. read item(X): Read DB item X into program variable 2. write item(X): Write program variable into DB item X • Basic unit of transfer is disk block • Basic ops consist of lower-level atomic operations: { read item(X): 1. Find address of disk block containing X 2. Copy block into buffer if not in memory already 3. Copy data item from buffer to variable { write item(X): Write program variable into DB item X 1. Find address of disk block containing X 2. Copy block into buffer if not in memory already 3. Copy variable into appropriate location in buffer 4. Write buffer to disk • Sample transaction: read item(X) X = X + A write item(X) read item(Y) read item(X) Y = Y + X write item(Y) • Problems arise wrt concurrency and recovery 1 Transaction Processing: Basics - Concurrency Problems Lost Update T1 T2 r(X) X += A r(X) w(X) X += B w(X) Dirty Read T1 T2 r(X) X += A w(X) r(X) abort w(X) Incorrect Summary T1 T2 r(X) Sum = 0 X += A w(X) r(X) Sum += X r(Y) r(Y) Y += B w(Y) Sum += Y 2 Transaction Processing: Basics - Concurrency Problems 2 Non-repeatable Read T1 T2 r(X) r(Y) r(X) X += A w(X) r(Z) r(X) 3 Transaction Processing: Basics - Desirable Characteristics • ACID properties: 1. Atomicity { Transaction is atomic unit of DB processing { It executes in its entirety, or not at all 2. Consistency preservation Transaction takes DB from one consistent state to another 3. Isolation { Effects of transaction are invisible to other transactions until committed { Degrees of isolation: (a) 0: Does not overwrite dirty reads made by transactions of higher degree (b) 1: No lost updates (c) 2: No lost updates and no dirty reads (d) 3: (true isolation): Repeatable reads 4. Durability Once committed, changes cannot be lost 4 Transaction Processing: Basics - Recovery • To enforce consistency, system must insure that transactions either 1. Complete successfully, with all changes to DB permanently recorded 2. Have no effect on DB - any changes made are undone I.e., Either all of its actions have effect, or none of them have effect • Transaction (redefined): Atomic unit of DB work that is executed in its entirety or not at all • Types of transactions: { Read only { Read/write • Types of failure: { Local errors or exceptions detected by transaction - data not found, program condition not met { Transaction or system error - overflow, user-enforced abort, logical error { Concurrency error { System crash { Disk failure { Physical problems, catastrophes - disk not mounted, fire, theft • First 4 recoverable • Recovery Manager is module responsible for recovery • Following operations monitored by Recovery Manager: 1. Begin transaction 2. Read 3. Write 4. End transaction 5. Commit 6. Rollback (abort) 7. Undo 8. Redo 5 Transaction Processing: Basics - Recovery (2) • Execution of transaction can be represented by state diagram: • Partially committed state most interesting: { System checks whether transaction has interfered with other transactions { Checks if failure at this point would preclude recovery { If checks OK, commit • System log (journal) maintains record of transactions for recovery • Stored on disk, archived on tape • Types of entries: 1. [start trans; T ] 2. [write item; T; X; old; new] 3. [read item; T; X] 4. [commit; T ] 5. [abort; T ] • Commit point reached when 1. Transaction completed 2. Effects of all operations recorded in log • From a commit, assumed all transaction actions are permanent 6 Transaction Processing: Basics - Recovery (3) • On failure, { Only those transactions not yet committed need be rolled back { Committed transactions whose operations are not yet recorded in DB can be redone from log • Log written to disk when { Block is full { On commit (force-write) 7 Transaction Processing: Schedules - Intro • Schedule of transactions T1;T2; :::; Tn is an ordering of the operations of the Ti such that the order of the operations of Ti are relatively the same in the schedule. • Operations of interest: read (r), write (w), abort (a), commit (c) • Given 2 transactions 1. T1: r(x); x = x + a; w(x); 2. T2: r(X); x = x + b; w(x); 2 schedules would be 1. S1: r1(x); w1(x); c1; r2(x); w2(x); c2; 2. S2: r1(x); r2(x); w2(x); w1(x); c2; c1; • Conflicting operations are those that 1. Belong to different transactions 2. Access the same data item 3. One of which is a write In S1 (and S2), conflicting operations are r1(x) and w2(x), r2(x) and w1(x, and w1(x) and w2(x) • Complete schedule is one in which 1. Every transaction ends with an abort or commit 2. For any pair of conflicting operations, one must precede the other in the schedule • Complete schedule imposes no restrictions on order of non-conflicting opera- tions Imposes a partial ordering on operations • Since DB processing is dynamic, concept of complete schedule is an abstract ideal • Committed projection of schedule S (C(S)) is the set of operations belonging to committed transactions of S Is more practical concept than a complete schedule • Can classify schedules wrt to their recoverability and their serializability 8 Transaction Processing: Schedules - Recoverability • T2 reads from T1 if T2 reads data items written by T1 { T1 should not abort prior to T2's read { There is no T3 that writes the data item between T1's write and T2's read • Types of schedules wrt recoverability: 1. Recoverable schedule is one in which no transaction T2 commits until all the Ti that write data items that are read by T2 have committed (a) S1: r1(x); w1(x); c1; r2(x); w2(x); c2; (recoverable) (b) S2: r1(x); r2(x); w2(x); w1(x); c2; c1; (recoverable) (c) S3: r1(x); w1(x); r2(x); w2(x); c2; c1; (not recoverable) { For a recoverable schedule, no committed transaction will ever need to be rolled back 2. Schedule avoids cascading rollback if every one of its transactions reads only data items written by only committed transactions { Cascading rollback is situation in which T1 aborts, forcing T2 to rollback because it read a data item written by T1 (a) S3 above experiences cascading rollback if change c1 to a1 (b) S1 above avoids cascading rollback 3. Strict schedule is one in which transactions cannot read or write data items until the transaction that writes the data item has committed { Recovery is process of restoring 'before' images of data items (a) S1 above is strict 9 Transaction Processing: Schedules - Serializability • Serial schedule is one in which transactions are not interleaved { Is correct { Wastes CPU time • Non-serial schedule allows interleaving { Subject to concurrency problems • Serializable schedule of n transactions is equivalent to some serial schedule of those n transactions { n! possible serial schedules for n transactions { m! possible schedules for the m operations in those n transactions ∗ 2 disjoint sets of these m! schedules: 1. Those equivalent to at least one serial schedule 2. Those not equivalent to any serial schedule 10 Transaction Processing: Schedules - Types of Serializability Equivalence 1. Result equivalence • Schedules S1 and S2 are result equivalent if they produce the same result • Generally not meaningful • Example: { Transactions: (a) T1: r(x); x = x2; w(x); (b) T2: r(x); x− = 5; w(x); { Schedules (x = 3 initially): (a) S1: r1(x); x = x2; w1(x); r2(x); x− = 5; w2(x); (b) S2: r2(x); x− = 5; w2(x); r1(x); x = x2; w1(x); 2. Conflict equivalence • Schedules S1 and S2 are conflict equivalent if the order of any 2 conflicting operations is the same in each • If different orders, then they could produce different results { Transactions: (a) T1: r(x); (b) T2: r(x); w(x); { Schedules: (a) S1: r1(x); r2(x); w2(x); (b) S2: r2(x); w2(x); r1(x); (not conflict equiv to S1) (c) S3: r2(x); r1(x); w2(x); (conflict equiv to S1) • Schedule is conflict serializable if it is conflict equivalent to some serial schedule 11 Transaction Processing: Schedules - Types of Serializability Equivalence (2) • Conflict serializable schedule can have its operations reordered to obtain the equivalent serial schedule { Transactions: (a) T1: r(x); w(x); (b) T2: r(x); w(x); { Schedules: S1 S2 S3 T1 T2 T1 T2 T1 T2 r1(x) r2(x) r1(x) x += a x += b r2(x) w1(x) w2(x) x += a r2(x) r1(x) w1(x) x += b x += a x += b w2(x) w1(x) w2(x) { Transactions: (a) T1: r(x); w(x); r(y), w(y); (b) T2: r(x); r(z); w(x); (c) T3: r(x); r(z); w(y); { Schedules: S1 S2 T1 T2 T3 T1 T2 T3 r(x) r(x) w(x) r(x) r(x) r(x) r(y) w(x) r(z) r(z) w(x) r(z) r(x) r(y) r(z) w(y) w(y) w(y) w(y) w(x) 12 Transaction Processing: Schedules - Types of Serializability Equivalence (3) • To test for conflict serializability: (a) For each transaction Ti in S, create a graph node Ti (b) For each situation in S where Tj does a read(X) after Ti does a write(X), create an edge Ti ! Tj (c) For each situation in S where Tj does a write(X) after Ti does a read(X), create an edge Ti ! Tj (d) For each situation in S where Tj does a write(X) after Ti does a write(X), create an edge Ti ! Tj (e) S is serializable if the resulting graph contains no cycles • If S is serializable, equivalent serial schedule is one in which Ti precedes every Tj for which there is an edge Ti ! Tj in the graph 3.
Load more

Recommended publications
  • Let's Talk About Storage & Recovery Methods for Non-Volatile Memory
    Let’s Talk About Storage & Recovery Methods for Non-Volatile Memory Database Systems Joy Arulraj Andrew Pavlo Subramanya R. Dulloor [email protected] [email protected] [email protected] Carnegie Mellon University Carnegie Mellon University Intel Labs ABSTRACT of power, the DBMS must write that data to a non-volatile device, The advent of non-volatile memory (NVM) will fundamentally such as a SSD or HDD. Such devices only support slow, bulk data change the dichotomy between memory and durable storage in transfers as blocks. Contrast this with volatile DRAM, where a database management systems (DBMSs). These new NVM devices DBMS can quickly read and write a single byte from these devices, are almost as fast as DRAM, but all writes to it are potentially but all data is lost once power is lost. persistent even after power loss. Existing DBMSs are unable to take In addition, there are inherent physical limitations that prevent full advantage of this technology because their internal architectures DRAM from scaling to capacities beyond today’s levels [46]. Using are predicated on the assumption that memory is volatile. With a large amount of DRAM also consumes a lot of energy since it NVM, many of the components of legacy DBMSs are unnecessary requires periodic refreshing to preserve data even if it is not actively and will degrade the performance of data intensive applications. used. Studies have shown that DRAM consumes about 40% of the To better understand these issues, we implemented three engines overall power consumed by a server [42]. in a modular DBMS testbed that are based on different storage Although flash-based SSDs have better storage capacities and use management architectures: (1) in-place updates, (2) copy-on-write less energy than DRAM, they have other issues that make them less updates, and (3) log-structured updates.
    [Show full text]
  • Failures in DBMS
    Chapter 11 Database Recovery 1 Failures in DBMS Two common kinds of failures StSystem filfailure (t)(e.g. power outage) ‒ affects all transactions currently in progress but does not physically damage the data (soft crash) Media failures (e.g. Head crash on the disk) ‒ damagg()e to the database (hard crash) ‒ need backup data Recoveryyp scheme responsible for handling failures and restoring database to consistent state 2 Recovery Recovering the database itself Recovery algorithm has two parts ‒ Actions taken during normal operation to ensure system can recover from failure (e.g., backup, log file) ‒ Actions taken after a failure to restore database to consistent state We will discuss (briefly) ‒ Transactions/Transaction recovery ‒ System Recovery 3 Transactions A database is updated by processing transactions that result in changes to one or more records. A user’s program may carry out many operations on the data retrieved from the database, but the DBMS is only concerned with data read/written from/to the database. The DBMS’s abstract view of a user program is a sequence of transactions (reads and writes). To understand database recovery, we must first understand the concept of transaction integrity. 4 Transactions A transaction is considered a logical unit of work ‒ START Statement: BEGIN TRANSACTION ‒ END Statement: COMMIT ‒ Execution errors: ROLLBACK Assume we want to transfer $100 from one bank (A) account to another (B): UPDATE Account_A SET Balance= Balance -100; UPDATE Account_B SET Balance= Balance +100; We want these two operations to appear as a single atomic action 5 Transactions We want these two operations to appear as a single atomic action ‒ To avoid inconsistent states of the database in-between the two updates ‒ And obviously we cannot allow the first UPDATE to be executed and the second not or vice versa.
    [Show full text]
  • What Is Nosql? the Only Thing That All Nosql Solutions Providers Generally Agree on Is That the Term “Nosql” Isn’T Perfect, but It Is Catchy
    NoSQL GREG SYSADMINBURD Greg Burd is a Developer Choosing between databases used to boil down to examining the differences Advocate for Basho between the available commercial and open source relational databases . The term Technologies, makers of Riak. “database” had become synonymous with SQL, and for a while not much else came Before Basho, Greg spent close to being a viable solution for data storage . But recently there has been a shift nearly ten years as the product manager for in the database landscape . When considering options for data storage, there is a Berkeley DB at Sleepycat Software and then new game in town: NoSQL databases . In this article I’ll introduce this new cat- at Oracle. Previously, Greg worked for NeXT egory of databases, examine where they came from and what they are good for, and Computer, Sun Microsystems, and KnowNow. help you understand whether you, too, should be considering a NoSQL solution in Greg has long been an avid supporter of open place of, or in addition to, your RDBMS database . source software. [email protected] What Is NoSQL? The only thing that all NoSQL solutions providers generally agree on is that the term “NoSQL” isn’t perfect, but it is catchy . Most agree that the “no” stands for “not only”—an admission that the goal is not to reject SQL but, rather, to compensate for the technical limitations shared by the majority of relational database implemen- tations . In fact, NoSQL is more a rejection of a particular software and hardware architecture for databases than of any single technology, language, or product .
    [Show full text]
  • Oracle Nosql Database
    An Oracle White Paper November 2012 Oracle NoSQL Database Oracle NoSQL Database Table of Contents Introduction ........................................................................................ 2 Technical Overview ............................................................................ 4 Data Model ..................................................................................... 4 API ................................................................................................. 5 Create, Remove, Update, and Delete..................................................... 5 Iteration ................................................................................................... 6 Bulk Operation API ................................................................................. 7 Administration .................................................................................... 7 Architecture ........................................................................................ 8 Implementation ................................................................................... 9 Storage Nodes ............................................................................... 9 Client Driver ................................................................................. 10 Performance ..................................................................................... 11 Conclusion ....................................................................................... 12 1 Oracle NoSQL Database Introduction NoSQL databases
    [Show full text]
  • The Integration of Database Systems
    Purdue University Purdue e-Pubs Department of Computer Science Technical Reports Department of Computer Science 1993 The Integration of Database Systems Tony Schaller Omran A. Bukhres Ahmed K. Elmagarmid Purdue University, [email protected] Xiangning Liu Report Number: 93-046 Schaller, Tony; Bukhres, Omran A.; Elmagarmid, Ahmed K.; and Liu, Xiangning, "The Integration of Database Systems" (1993). Department of Computer Science Technical Reports. Paper 1061. https://docs.lib.purdue.edu/cstech/1061 This document has been made available through Purdue e-Pubs, a service of the Purdue University Libraries. Please contact [email protected] for additional information. The Integration of Database Systems Tony Schaller, Omran A. Bukhres, Ahmed K. Elmagarmid and Xiangning Liu CSD-TR-93-046 July 1993 I I The Integration of Database Systems Tony Schaller Molecular Design Ltd. 2132 Farallon Drive San Leandro, CA 94577 Omran A. Bukhres, Ahmed K. Elmagarmid and Xiangning Liu DeparLment of Computer Sciences Purdue University West Lafayette, IN 47907 eJIlail: {bukhres,ake,xl} .es.purdue.edu 1 Introduction A database system is composed of two elements: a software program, called a database management system, and a set of data, called a database. The data in a database is organized according to some data model, such as the relational model used in a DB2 database [DW88] or the hierarchical model found with IMS databases [Dat77] . Users access the data through an interface (the query language) provided by the database management system. A schema describes the actual data structures and organization within the system. During the decade ofthe nineteen-seventies, centralized databases were predominant, but recent innovations in communications and database technologies have engendered a revolution in data processing, giving rlse to a new generation of decentralized database systems.
    [Show full text]
  • High-Performance Transaction Processing in SAP HANA
    High-Performance Transaction Processing in SAP HANA Juchang Lee1, Michael Muehle1, Norman May1, Franz Faerber1, Vishal Sikka1, Hasso Plattner2, Jens Krueger2, Martin Grund3 1SAP AG 2Hasso Plattner Insitute, Potsdam, Germany, 3eXascale Infolab, University of Fribourg, Switzerland Abstract Modern enterprise applications are currently undergoing a complete paradigm shift away from tradi- tional transactional processing to combined analytical and transactional processing. This challenge of combining two opposing query types in a single database management system results in additional re- quirements for transaction management as well. In this paper, we discuss our approach to achieve high throughput for transactional query processing while allowing concurrent analytical queries. We present our approach to distributed snapshot isolation and optimized two-phase commit protocols. 1 Introduction An efficient and holistic data management infrastructure is one of the key requirements for making the right deci- sions at an operational, tactical, and strategic level and is core to support all kinds of enterprise applications[12]. In contrast to traditional architectures of database systems, the SAP HANA database takes a different approach to provide support for a wide range of data management tasks. The system is organized in a main-memory centric fashion to reflect the shift within the memory hierarchy[2] and to consistently provide high perfor- mance without prohibitively slow disk interactions. Completely transparent for the application, data is orga- nized along its life cycle either in column or row format, providing the best performance for different workload characteristics[11, 1]. Transactional workloads with a high update rate and point queries can be routed against a row store; analytical workloads with range scans over large datasets are supported by column oriented data struc- tures.
    [Show full text]
  • High Volume Transaction Processing Without Concurrency Control, Two Phase Commit, SQL Or
    High Volume Transaction Pro cessing Without Concurrency Control Two Phase Commit SQL or C Arthur Whitney Dennis Shasha Stevan Apter KX Systems Courant Institute NYU Union Bank of Switzerland Harker Avenue Mercer Street Park Avenue Palo Alto CA New York NY New York NY Abstract Imagine an application environment in which subsecond response to thousands of events gives the user a distinct competitive advantage yet transactional guarantees are important Imag ine also that the data ts comfortably into a few gigabytes of Random Access Memory These attributes characterize many nancial trading applications Which engine should one use in such a case IBM FastPath Sybase Oracle or Object Store We argue that an unconventional approach is cal led for we use a listbased language cal led K having optimized support for bulk array operators and that integrates networking and a graphical user interface Locking is unnecessary when singlethreading such applications because the data ts into memory obviating the need to go to disk except for logging purposes Multithreading can be hand led for OLTP applications by analyzing the arguments to transactions The result is a private sizereduced TPCB benchmark that achieves transactions per second with ful l recoverability and TCPIP overhead on an Megahertz UltraSparc I Further hot disaster recovery can be done with far less overhead than required by two phase commit by using a sequential state machine approach We show how to exploit multiple processors without complicating the language or our basic framework
    [Show full text]
  • A Transaction Processing Method for Distributed Database
    Advances in Computer Science Research, volume 87 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019) A Transaction Processing Method for Distributed Database Zhian Lin a, Chi Zhang b School of Computer and Cyberspace Security, Communication University of China, Beijing, China [email protected], [email protected] Abstract. This paper introduces the distributed transaction processing model and two-phase commit protocol, and analyses the shortcomings of the two-phase commit protocol. And then we proposed a new distributed transaction processing method which adds heartbeat mechanism into the two- phase commit protocol. Using the method can improve reliability and reduce blocking in distributed transaction processing. Keywords: distributed transaction, two-phase commit protocol, heartbeat mechanism. 1. Introduction Most database services of application systems will be distributed on several servers, especially in some large-scale systems. Distributed transaction processing will be involved in the execution of business logic. At present, two-phase commit protocol is one of the methods to distributed transaction processing in distributed database systems. The two-phase commit protocol includes coordinator (transaction manager) and several participants (databases). In the process of communication between the coordinator and the participants, if the participants without reply for fail, the coordinator can only wait all the time, which can easily cause system blocking. In this paper, heartbeat mechanism is introduced to monitor participants, which avoid the risk of blocking of two-phase commit protocol, and improve the reliability and efficiency of distributed database system. 2. Distributed Transactions 2.1 Distributed Transaction Processing Model In a distributed system, each node is physically independent and they communicates and coordinates each other through the network.
    [Show full text]
  • Transaction Management in the R* Distributed Database Management System
    Transaction Management in the R* Distributed Database Management System C. MOHAN, B. LINDSAY, and R. OBERMARCK IBM Almaden Research Center This paper deals with the transaction management aspects of the R* distributed database system. It concentrates primarily on the description of the R* commit protocols, Presumed Abort (PA) and Presumed Commit (PC). PA and PC are extensions of the well-known, two-phase (2P) commit protocol. PA is optimized for read-only transactions and a class of multisite update transactions, and PC is optimized for other classes of multisite update transactions. The optimizations result in reduced intersite message traffic and log writes, and, consequently, a better response time. The paper also discusses R*‘s approach toward distributed deadlock detection and resolution. Categories and Subject Descriptors: C.2.4 [Computer-Communication Networks]: Distributed Systems-distributed datahes; D.4.1 [Operating Systems]: Process Management-concurrency; deadlocks, syndvonization; D.4.7 [Operating Systems]: Organization and Design-distributed sys- tems; D.4.5 [Operating Systems]: Reliability--fault tolerance; H.2.0 [Database Management]: General-concurrency control; H.2.2 [Database Management]: ‘Physical Design-recouery and restart; H.2.4 [Database Management]: Systems-ditributed systems; transactionprocessing; H.2.7 [Database Management]: Database Administration-logging and recouery General Terms: Algorithms, Design, Reliability Additional Key Words and Phrases: Commit protocols, deadlock victim selection 1. INTRODUCTION R* is an experimental, distributed database management system (DDBMS) developed and operational at the IBM San Jose Research Laboratory (now renamed the IBM Almaden Research Center) 118, 201. In a distributed database system, the actions of a transaction (an atomic unit of consistency and recovery [13]) may occur at more than one site.
    [Show full text]
  • A Simple Guide to Transaction Processing
    @ WORK SERIES Hands-on OneWorld Documentation A Simple guide to Transaction Processing Technology Demographic Table Product OneWorld Version B733.x Platform/OS All Industry All Application All Database All Keywords Strategic, OneWorld, B9 Date July 2000 ? erpSourcing. All Rights Reserved October 2000 - A Simple Guide to Transaction Processing Disclaimer All information contained in this document should be treated as a hypothetical project plan. It is often the case that with upgrades to production and development objects, that there are issues that will be raised. This will therefore dramatically increase project timelines. None of the entries in this document are in any way a replacement for the JDEdwards OneWorld Xe Upgrade Guide – instead, this document should be treated as a complement. Overview This document is release independent - ie, I will attempt to describe Transaction Processing. The latter parts of this email are SAR posts directly affecting pre-B733 and post-B733 (including Xe) versions - and lastly I attach a list of applications in B7.3.3.1 that were Transaction Processing activated. Note that Transaction Processing is now called "Lock Manager" (since B7.3.3) and has absolutely NOTHING to do with row-level database locking ! Chapter 1 - What is it ? Definitions and Abbreviations used throughout this document ??TMS (Transaction Management Server) - the server that is used to serve as a central "checkpoint" for all database transactions. ??TP (Transaction Processing) Monitor - the process that runs on the TMS that is capable of timestamping database record changes and notifying the user if he/she has retrieved a record (and left it unchanged) that has since been changed by another user.
    [Show full text]
  • Implementing Distributed Transactions Distributed Transaction Distributed Database Systems ACID Properties Global Atomicity Atom
    Distributed Transaction • A distributed transaction accesses resource managers distributed across a network Implementing Distributed • When resource managers are DBMSs we refer to the Transactions system as a distributed database system Chapter 24 DBMS at Site 1 Application Program DBMS 1 at Site 2 2 Distributed Database Systems ACID Properties • Each local DBMS might export • Each local DBMS – stored procedures, or – supports ACID properties locally for each subtransaction – an SQL interface. • Just like any other transaction that executes there • In either case, operations at each site are grouped – eliminates local deadlocks together as a subtransaction and the site is referred • The additional issues are: to as a cohort of the distributed transaction – Global atomicity: all cohorts must abort or all commit – Each subtransaction is treated as a transaction at its site – Global deadlocks: there must be no deadlocks involving • Coordinator module (part of TP monitor) supports multiple sites ACID properties of distributed transaction – Global serialization: distributed transaction must be globally serializable – Transaction manager acts as coordinator 3 4 Atomic Commit Protocol Global Atomicity Transaction (3) xa_reg • All subtransactions of a distributed transaction Manager Resource must commit or all must abort (coordinator) Manager (1) tx_begin (cohort) • An atomic commit protocol, initiated by a (4) tx_commit (5) atomic coordinator (e.g., the transaction manager), commit protocol ensures this. (3) xa_reg Resource Application – Coordinator
    [Show full text]
  • Distributed Transaction Processing: Reference Model, Version 3
    Guide Distributed Transaction Processing: Reference Model, Version 3 HNICA C L E G T U I D E S [This page intentionally left blank] X/Open Guide Distributed Transaction Processing: Reference Model, Version 3 X/Open Company Ltd. February 1996, X/Open Company Limited All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, without the prior permission of the copyright owners. X/Open Guide Distributed Transaction Processing: Reference Model, Version 3 ISBN: 1-85912-170-5 X/Open Document Number: G504 Published by X/Open Company Ltd., U.K. Any comments relating to the material contained in this document may be submitted to X/Open at: X/Open Company Limited Apex Plaza Forbury Road Reading Berkshire, RG1 1AX United Kingdom or by Electronic Mail to: [email protected] ii X/Open Guide Contents Chapter 1 Introduction............................................................................................... 1 1.1 Overview ...................................................................................................... 1 1.2 Benefits of X/Open DTP ........................................................................... 1 1.3 Areas Not Addressed................................................................................. 2 1.4 Relationship to International Standards................................................ 2 Chapter 2 Definitions.................................................................................................
    [Show full text]