EP0992901B1 - Protocole d'engagement à deux phases amélioré - Google Patents

Protocole d'engagement à deux phases amélioré Download PDF

Info

Publication number
EP0992901B1
EP0992901B1 EP99307770A EP99307770A EP0992901B1 EP 0992901 B1 EP0992901 B1 EP 0992901B1 EP 99307770 A EP99307770 A EP 99307770A EP 99307770 A EP99307770 A EP 99307770A EP 0992901 B1 EP0992901 B1 EP 0992901B1
Authority
EP
European Patent Office
Prior art keywords
transaction
data sources
status
data
unavailable
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
EP99307770A
Other languages
German (de)
English (en)
Other versions
EP0992901A3 (fr
EP0992901A2 (fr
Inventor
Muhammad Yahya
Devin Lyle Barnhart
Jerry C. Lee
Thomas J. Jorgensen
Richard G. Stellwagen Jr.
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Teradata US Inc
Original Assignee
NCR International Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NCR International Inc filed Critical NCR International Inc
Publication of EP0992901A2 publication Critical patent/EP0992901A2/fr
Publication of EP0992901A3 publication Critical patent/EP0992901A3/fr
Application granted granted Critical
Publication of EP0992901B1 publication Critical patent/EP0992901B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/466—Transaction processing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23—Updating
    • G06F16/2308—Concurrency control
    • G06F16/2336—Pessimistic concurrency control approaches, e.g. locking or multiple versions without time stamps
    • G06F16/2343—Locking methods, e.g. distributed locking or locking implementation details
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99931—Database or file accessing
    • Y10S707/99938—Concurrency, e.g. lock management in shared database
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99951—File or database maintenance
    • Y10S707/99952—Coherency, e.g. same view to multiple users
    • Y10S707/99953—Recoverability

Definitions

  • the invention relates in general to computer systems, and more particularly, to an enhanced two-phase commit protocol for distributed data processing environments.
  • two-phase commit protocols are used to coordinate transactions against one or more data sources. Transactions must be coordinated with other data sources in the network or system to ensure that the data sources have current information.
  • These data sources may include multiple databases distributed at several locations.
  • the system first checks to see if all data sources are available, and, if so, proceeds to complete the transaction. However, if one or more of the data sources are unavailable or unable to complete the transaction, the transaction is canceled or "undone" until the data source (also known as a participant) is able to complete the transaction, or is queued until all participants are available to complete the transaction.
  • the two-phase commit protocol is necessary for data environments that require high degrees of accuracy across large numbers of distributed computing systems, e.g. banking systems, credit card verification systems, databases for vital statistics, etc.
  • the two-phase commit protocol is useful to ensure data integrity, the limitation of requiring all participants are available to complete the transaction.
  • the two-phase commit protocol is necessary for data environments that require high degrees of accuracy across large numbers of distributed computing systems, e.g., banking systems, credit card verification systems, databases for vital statistics, etc.
  • the two-phase commit protocol is useful to ensure data integrity, the limitation of requiring all participants to be able to process the transaction makes the two-phase commit protocol's usefulness limited. Further, since there are many times that a data source or other participant may be unable to accept or process the transaction due to hardware or software malfunctions, preventative maintenance, system reconfigurations, etc., the two-phase commit protocol has even less usefulness.
  • the approach used in the present invention allows for a wider application of the two-phase commit protocol for networks that require the accuracy and precision that the two-phase commit protocol delivers.
  • US-A-5095 421 discloses a method of performing two-phase commit protocol in s system having a plurality of data sources as detailed in the preamble to the independent claims herein.
  • the present invention resides in a method of performing a two-phase commit protocol for a transaction as detailed in claim 1.
  • the present invention resides in a computer controlled device as detailed in claim 8.
  • the present invention resides in a program storage device, readable by a computer, as claimed in claim 9.
  • a two-phase commit protocol is used to coordinate transactions between many data sources.
  • the coordination is between databases, and the coordination is performed by a Transaction Manager.
  • the two-phase commit protocol operates on an "all-or-nothing" approach; if one of the databases (data sources) is unavailable to complete the transaction, the transaction is not performed or is stored for completion at a later time.
  • the two-phase commit protocol's usefulness is limited because, typically, one or more of the data sources is not available at any given time. Thus, any transaction that is scheduled to take place at a time when one of the data sources is unavailable cannot take place using a two-phase commit protocol until the unavailable data source becomes available.
  • the present invention enhances the two-phase commit protocol approach by allowing those data sources (also known as participants) that are available to complete the transaction, and storing the transaction for completion by the unavailable participants when they become available.
  • the Transaction Manager uses the logical equivalent of a First-In-First-Out (FIFO) queue to ensure that all transactions are performed in the same order on all data sources within the computer system.
  • FIFO First-In-First-Out
  • the present invention allows the data sources to be synchronized in terms of transaction order by use of the logical FIFO construct.
  • FIG. 1 is an exemplary hardware environment used to implement the preferred embodiment of the invention.
  • the present invention is typically implemented using a computer 100, which generally includes, inter alia, a processor, random access memory (RAM), data storage devices 102, 104, and 106 (e.g., hard, floppy, and/or CD-ROM disk drives, etc.).
  • Computer 100 is coupled to other computers and/or data sources via network 108, using data communications devices (e.g., modems, network interfaces, etc.).
  • data communications devices e.g., modems, network interfaces, etc.
  • computer 100 is connected to and can communicate with computers 110, 112, 114, 116, and 118, and data sources 120, 122, 124, 126, and 128.
  • the present invention is not limited to five data sources; there may be a larger or smaller number of data sources within the system.
  • Computer 100 executes transaction coordinator 130 and data manager 132.
  • Transaction coordinator 130 and data manager 132 generally comprise data and/or instructions which, when read and executed by the computer 100, causes the computer 100 to perform the steps for performing and/or using the present invention.
  • the data and/or instructions are embodied in and/or readable from a device, carrier, and/or media.
  • the data and/or instructions can be embodied in and/or readable from a memory, data storage device, remote devices coupled to the computer via a data communications device for downloading a file from a network to the computer as is done in client-server architectures and on the Internet, floppy diskettes, CD-ROM disks, or other magnetic, optical, electronic, or other storage media or devices that can be connected to and interpreted by the computer.
  • the present invention may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques to produce software, firmware, hardware, or any combination thereof.
  • article of manufacture (or alternatively, “computer program product”) as used herein is intended to encompass a computer program accessible from any computer-readable device, carrier, or media. Many modifications may be made to this configuration without departing from the scope of the present invention.
  • the present invention also teaches that any combination of the above components, or any number of different components, including computer programs, peripherals, and other devices, may be used to implement the present invention, so long as similar functions are performed thereby.
  • the presentation of the computer system as described in FIG. 1 is not meant to limit the scope of the present invention, but to illustrate one possible embodiment of the present invention.
  • data sources 120-128 are connected to network 108.
  • data sources 120-128 can share data and can synchronize databases for uniformity.
  • data sources 120-128 can be local databases for a banking system.
  • a transaction in the banking system e.g., a withdrawal of funds from an account, must be stored not only on the database closest to the geographical point of withdrawal; it must be stored on all databases within the banking system to ensure that the account is not overdrawn at some other location.
  • the present invention allows for some of the data sources 120-128, whether it is the local data source or not, to be unavailable for update.
  • This situation can occur, for example, when there is a power failure in a certain geographical area, one of the data sources 120-128 needs to be maintained, or for other reasons.
  • the unavailability of one data source, data source 120 is shown as a dashed line in FIG. 1.
  • the discussion herein refers to one data source 120 being unavailable; however, the present invention envisions one or more data sources 120-128 being unavailable for any given transaction.
  • the discussion herein is extendable to encompass any number of data sources 120-128 being unavailable within the system.
  • the two-phased commit protocol of the present invention is performed by the transaction coordinator 130 and the data manager 132.
  • Transaction coordinator 130 checks to see the availability of data sources 120-128. In the example of FIG. 1, data source 120 is unavailable. The transaction coordinator 130 allows the transaction to be performed on data sources 122, 124, 126, and 128, and the data manager 132 stores the transaction on storage device 102. The data manager 132, in conjunction with the transaction coordinator 130, also identifies which of the data sources 120-128 were unavailable. In the example illustrated in FIG. 1, only data source 120 is unavailable, but data manager 132 can log any number of transactions and any number data sources that are unavailable to data storage device 102, which is called the data log. Storage device 102 then stores the transaction in a manner consistent with a FIFO queue, to allow the transaction to be time-ordered properly.
  • transaction coordinator 130 sends a signal to data manager 132, which checks data storage device 102 to see if there are any transactions that need to be logged to data source 120. If there are, data manager 132 routes those transactions stored in data storage device 102 in time-ordered fashion to data source 120. This action of sending the logged transactions synchronizes data source 120 with data sources 122-128.
  • FIGS. 2A-2C are flowcharts that illustrate exemplary logic performed by the transaction coordinator 130 and data manager 132 according to the present invention.
  • Block 200 represents the computer 100 waiting for an event. If the event is a transaction, computer 100 uses the exemplary logic of FIGS. 2A-2C; otherwise, other functions and/or logic is performed by the computer 100.
  • Block 202 represents the transaction coordinator 130 receiving a "begin transaction" request from a data source 120-128. Control then transfers to block 204, which represents the transaction coordinator 130 marking the transaction as beginning. Control then transfers to block 206, which represents the transaction coordinator 130 verifying the status of all participants in the system. The status of all participants is noted and recorded by the transaction coordinator. The remainder of the flowcharts of FIGS. 2A-2C are dependent on the status recorded for each data source 120-128. The discussion relating to the remainder of FIGS. 2A-2C is a tree structure to enable transaction coordinator 130 to mark all data sources 120-128 and traverse the flowchart in a parallel and/or serial fashion.
  • Block 212 represents the transaction coordinator 130 marking the status of non-active data source 120-128 as "logged". In the example of FIG. 1, data source 120 would be marked as having a logged status. Control then passes to point A 216.
  • Block 214 is a decision block representing transaction coordinator 130 determining whether data sources 120-128 failed during the begin transaction sequence initiated in block 210. If the data sources 120-128 report to the transaction coordinator 130 that they have failed, then control transfers to block 218 for those data sources 120-128 that failed, and transaction coordinator 130 marks those data sources 120-128 as having a "failed" status. Control then transfers to point A 216.
  • Block 224 is a decision block that represents the transaction coordinator 130 determining whether any of the data sources 120-128 failed during the data transmission sequence of blocks 220 and 222. If any of the data sources 120-128 did fail, control transfers to block 218, where the failed data sources 120-128 are marked as failed. If none of the data sources 120-128 failed, control transfers to point B 226.
  • Decision block 230 is a decision block representing the computer determining whether any of the participants 120-128 have become unavailable during the prepare parcel processing. If so, the participants 120-128 that have become unavailable are marked as failed in block 232, and control passes to point A 216. If not, the transaction coordinator receives a prepare acknowledge parcels from the active participants. Control then transfers to decision block 236.
  • Decision block 236 is a decision block representing the transaction coordinator 130 determining whether any of the participants have sent a fail status during the prepare transaction parcel processing. If so, control transfers to block 238, where the transaction coordinator 130 aborts the transaction. Control then transfers to block 240, where the transaction coordinator 130 sends a failure status to the source system 100. Control then transfers to block 242, where the transaction coordinator 130 waits for additional input.
  • point A 216 transfers control to block 250, which represents the data manager 132 logging transaction data for the participants 120-128 that are unavailable. Control then transfers to block 252, where data manager 132 stores the transaction data in a data log for those participants 120-128 that are unavailable. Control then transfers to block 254, which represents data manager 132 determining whether a participant 120-128 that was previously unavailable is now available to send transaction data to. If there are no new participants 120-128, control loops around block 254. If there is a new participant 120-128, control transfers to block 256, where data manager 132 determines if the state of the new participant 120-128 is marked as logged. If so, control passes to block 258, where the data manager 132 ships the data log to the participant 120-128. Control then passes to block 242, where data manager 132 waits for additional input.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Communication Control (AREA)

Claims (9)

  1. Procédé de mise en oeuvre d'un protocole d'engagement à deux phases pour une transaction dans un système ayant une pluralité de sources de données (120 à 128), comprenant les étapes consistant à :
    vérifier un état des sources de données au début de la transaction (204, 206) ;
    poursuivre le protocole d'engagement à deux phases pour la transaction avec une unité (130) de commande de transactions pour des sources de données qui répondent par un état de disponibilité au moment de la vérification (208) ; et
    enregistrer la transaction pour des sources de données qui ne sont pas actives au moment de la vérification (250), caractérisé en ce que le protocole d'engagement à deux phases est poursuivi pour achever la transaction pour des sources de données qui répondent par un état de disponibilité (228) et en ce que le coordinateur de transactions répond par un état de réussite au système de source (248), et en ce que la transaction est achevée pour des sources de données indisponibles lorsque les sources de données qui ont un état indisponible passent ultérieurement dans un état disponible.
  2. Procédé suivant la revendication 1, dans lequel la source de données est une base de données.
  3. Procédé suivant la revendication 1, comprenant en outre l'étape consistant à mener à bien la transaction pour des sources de données indisponibles lorsque les sources de données indisponibles deviennent des sources de données disponibles.
  4. Procédé suivant la revendication 3, dans lequel l'étape d'achèvement comprend en outre l'étape consistant à achever la transaction selon une séquence ordonnée dans le temps.
  5. Procédé suivant la revendication 1, comprenant en outre les étapes consistant à vérifier de nouveau l'état d'une source de données ayant précédemment répondu comme ayant l'état de disponibilité mais répondant par un état d'indisponibilité au moment de la nouvelle vérification ; et
    enregistrer un reste de la transaction pour la source de données qui répond par un état d'indisponibilité au moment de la nouvelle vérification.
  6. Procédé suivant la revendication 1, dans lequel l'étape d'enregistrement est effectuée par un gestionnaire de données.
  7. Procédé suivant la revendication 1, dans lequel l'étape d'enregistrement comprend en outre l'étape consistant à mémoriser la transaction dans un journal de données.
  8. Dispositif (100) commandé par ordinateur pour un accès continu à une base de données reliée à une pluralité de sources (120 à 128) de données connectées en réseau, comprenant :
    (a) un moyen, exécuté par l'ordinateur, pour vérifier un état des sources de données au début de la transaction (204, 206) ;
    (b) un moyen, exécuté par l'ordinateur, pour achever le protocole d'engagement à deux phases pour la transaction avec les sources de données ayant un état de disponibilité au moment de la vérification (208) ; et
    (c) un moyen, exécuté par l'ordinateur, pour enregistrer la transaction pour des sources de données qui ne sont pas actives au moment de la vérification (250), caractérisé en ce que le protocole d'engagement à deux phases pour la transaction est conçu pour s'achever pour des sources de données qui répondent par un état de disponibilité (228), en ce que le coordinateur de transactions est conçu pour répondre par un état de réussite au système de source (248), et en ce que la transaction est conçue pour s'achever pour des sources de données indisponibles lorsque les sources de données qui ont un état d'indisponibilité passent ultérieurement dans un état de disponibilité.
  9. Dispositif de mémorisation de programme lisible par ordinateur, mettant en oeuvre concrètement un ou plusieurs programmes d'instructions, les instructions, lorsqu'elles sont exécutées par l'ordinateur, étant aptes à mettre en oeuvre les étapes du procédé suivant l'une quelconque des revendications 1 à 7.
EP99307770A 1998-10-05 1999-10-01 Protocole d'engagement à deux phases amélioré Expired - Lifetime EP0992901B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US09/166,690 US6363401B2 (en) 1998-10-05 1998-10-05 Enhanced two-phase commit protocol
US166690 1998-10-05

Publications (3)

Publication Number Publication Date
EP0992901A2 EP0992901A2 (fr) 2000-04-12
EP0992901A3 EP0992901A3 (fr) 2003-11-12
EP0992901B1 true EP0992901B1 (fr) 2007-12-12

Family

ID=22604317

Family Applications (1)

Application Number Title Priority Date Filing Date
EP99307770A Expired - Lifetime EP0992901B1 (fr) 1998-10-05 1999-10-01 Protocole d'engagement à deux phases amélioré

Country Status (3)

Country Link
US (1) US6363401B2 (fr)
EP (1) EP0992901B1 (fr)
DE (1) DE69937715T2 (fr)

Families Citing this family (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7177866B2 (en) 2001-03-16 2007-02-13 Gravic, Inc. Asynchronous coordinated commit replication and dual write with replication transmission and locking of target database on updates only
US7103586B2 (en) * 2001-03-16 2006-09-05 Gravic, Inc. Collision avoidance in database replication systems
US20020138790A1 (en) * 2001-03-26 2002-09-26 Satyanarayana Nishtala Apparatus and method for managing errors on a point-to-point interconnect
US20030014441A1 (en) * 2001-06-29 2003-01-16 Akira Suzuki Document data structure, information recording medium, information processing apparatus, information processing system and information processing method
US7028219B2 (en) * 2002-04-25 2006-04-11 Hewlett-Packard Development Company, L.P. Hybrid method for flushing transaction state in a fault-tolerant clustered database
US7640535B2 (en) * 2003-01-24 2009-12-29 Bea Systems, Inc. Method for transaction processing with parallel execution
US7346905B2 (en) * 2003-06-10 2008-03-18 International Business Machines Corporation Apparatus and method for maintaining resource integrity without a unified transaction manager in a software environment
TWI416901B (zh) * 2005-11-30 2013-11-21 Ibm 故障容忍之異動處理系統
US7475117B1 (en) * 2005-12-15 2009-01-06 Teradata Us, Inc. Two-phase commit electronic mail delivery
US7631057B2 (en) * 2006-04-21 2009-12-08 Bea Systems, Inc. Two-phase deployment framework
US7617421B2 (en) * 2006-07-27 2009-11-10 Sun Microsystems, Inc. Method and apparatus for reporting failure conditions during transactional execution
US9401957B2 (en) * 2007-09-14 2016-07-26 International Business Machines Corporation System and method for synchronization between servers
US8892558B2 (en) 2007-09-26 2014-11-18 International Business Machines Corporation Inserting data into an in-memory distributed nodal database
US8027996B2 (en) * 2007-11-29 2011-09-27 International Business Machines Corporation Commitment control for less than an entire record in an in-memory database in a parallel computer system
US8301593B2 (en) * 2008-06-12 2012-10-30 Gravic, Inc. Mixed mode synchronous and asynchronous replication system
US7962458B2 (en) * 2008-06-12 2011-06-14 Gravic, Inc. Method for replicating explicit locks in a data replication engine
TW201032535A (en) 2008-10-14 2010-09-01 Ibm A method of handling a message
US8629646B2 (en) * 2009-01-09 2014-01-14 Solar Components Llc Generation of renewable energy certificates from distributed procedures
US20100176760A1 (en) * 2009-01-09 2010-07-15 Bullen M James System for photovoltaic power and charge management
US8995260B2 (en) 2012-08-09 2015-03-31 Blackberry Limited Method and apparatus for managing load in a communication network
US8976648B2 (en) * 2012-08-09 2015-03-10 Blackberry Limited Method and apparatus for managing load on service devices in a communication network
US20140214886A1 (en) 2013-01-29 2014-07-31 ParElastic Corporation Adaptive multi-client saas database
US20140222698A1 (en) * 2013-01-31 2014-08-07 EM Biofuels, LLC Systems and Methods for Tracking Renewable Energy Credits
US20160063029A1 (en) 2014-08-29 2016-03-03 Netapp, Inc. Clustered storage system synchronization
CN104462497B (zh) * 2014-12-19 2018-07-10 深圳中兴网信科技有限公司 基于关系型数据库的跨库事务处理方法和系统

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4412287A (en) 1975-05-29 1983-10-25 Braddock Iii Walter D Automated stock exchange
US5095421A (en) 1989-08-17 1992-03-10 International Business Machines Corporation Transaction processing facility within an operating system environment
US5301320A (en) 1991-06-28 1994-04-05 Digital Equipment Corporation Workflow management and control system
US5452445A (en) 1992-04-30 1995-09-19 Oracle Corporation Two-pass multi-version read consistency
US5530848A (en) 1992-10-15 1996-06-25 The Dow Chemical Company System and method for implementing an interface between an external process and transaction processing system
US5455952A (en) 1993-11-03 1995-10-03 Cardinal Vision, Inc. Method of computing based on networks of dependent objects
US5850507A (en) 1996-03-19 1998-12-15 Oracle Corporation Method and apparatus for improved transaction recovery
US6105147A (en) 1997-04-16 2000-08-15 Compaq Computer Corporation Using process pairs as transaction-coordinated resource managers
US6154849A (en) * 1998-06-30 2000-11-28 Sun Microsystems, Inc. Method and apparatus for resource dependency relaxation

Also Published As

Publication number Publication date
US20010042072A1 (en) 2001-11-15
DE69937715T2 (de) 2008-12-11
US6363401B2 (en) 2002-03-26
EP0992901A3 (fr) 2003-11-12
DE69937715D1 (de) 2008-01-24
EP0992901A2 (fr) 2000-04-12

Similar Documents

Publication Publication Date Title
EP0992901B1 (fr) Protocole d'engagement à deux phases amélioré
US20230100223A1 (en) Transaction processing method and apparatus, computer device, and storage medium
US20060195487A1 (en) Systems and Methods for Managing the Synchronization of Replicated Version-Managed Databases
US5455932A (en) Fault tolerant computer system
US7593989B2 (en) Symbiotic computing system and method of operation therefor
US7177866B2 (en) Asynchronous coordinated commit replication and dual write with replication transmission and locking of target database on updates only
US7103586B2 (en) Collision avoidance in database replication systems
JP3762846B2 (ja) サーバのグループに関する作業負荷管理を行うデータ処理装置および方法
US7693882B2 (en) Replicating data across the nodes in a cluster environment
US7580979B2 (en) Message ordering in a messaging system
EP1704480B1 (fr) Base de donnees en grappe a miroitage de donnees a distance
EP2521037A2 (fr) Groupes répartis géographiquement
US20050283658A1 (en) Method, apparatus and program storage device for providing failover for high availability in an N-way shared-nothing cluster system
US20030187927A1 (en) Clustering infrastructure system and method
US20130110781A1 (en) Server replication and transaction commitment
EP0420425A2 (fr) Système de traitement de données et méthode de mise à jour d'une base de données incorporée
US7203863B2 (en) Distributed transaction state management through application server clustering
WO2008040621A1 (fr) Système de traitement de données et procédé permettant de traiter des demandes
KR20040074627A (ko) 복제 명령 분배 시스템 및 방법
US7072912B1 (en) Identifying a common point in time across multiple logs
CN109347906B (zh) 一种数据传输方法、装置、与服务器
US11522966B2 (en) Methods, devices and systems for non-disruptive upgrades to a replicated state machine in a distributed computing environment
US7228455B2 (en) Transaction branch management to ensure maximum branch completion in the face of failure
US7089265B1 (en) Database management system for implementing independent database actions in response to events of interest
CN112069160B (zh) 一种基于cap数据清洗同步方法

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE

AX Request for extension of the european patent

Free format text: AL;LT;LV;MK;RO;SI

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE

AX Request for extension of the european patent

Extension state: AL LT LV MK RO SI

RIC1 Information provided on ipc code assigned before grant

Ipc: 7G 06F 17/30 B

Ipc: 7G 06F 11/14 B

Ipc: 7G 06F 9/46 A

17P Request for examination filed

Effective date: 20040512

AKX Designation fees paid

Designated state(s): DE FR GB

17Q First examination report despatched

Effective date: 20050429

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REF Corresponds to:

Ref document number: 69937715

Country of ref document: DE

Date of ref document: 20080124

Kind code of ref document: P

ET Fr: translation filed
RAP2 Party data changed (patent owner data changed or rights of a patent transferred)

Owner name: TERADATA US, INC.

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20080915

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

REG Reference to a national code

Ref country code: FR

Ref legal event code: TP

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20100920

Year of fee payment: 12

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20111014

Year of fee payment: 13

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20120917

Year of fee payment: 14

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20130628

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20130501

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 69937715

Country of ref document: DE

Effective date: 20130501

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20121031

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20131001

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20131001