42 results about "Two-phase commit protocol" patented technology

A transaction processing system providing improved methodology for invoking two-phase commit protocol (2PC) is described. More particularly, a transaction is handled without use of 2PC until the system determines that the transaction does, in fact, involve changes to more than one database. The methodology improves overall system performance by looking at each transaction to determine whether the transaction actually requires use of 2PC before incurring the overhead associated with use of the two-phase commit protocol. Because only a small percentage of real world transactions result in updates to more than one database, the methodology improves the overall performance of transaction processing systems considerably.

A system, method, and apparatus for ensuring data integrity in a distributed object-oriented transaction processing environment, including support of single- and two-phased commit protocol transactions with a new protocol defined as a mixed-phase commit protocol. A root transaction manager on a server registers distributed object resources requested by a client application for a global transaction as being committable by either the single-phase, two-phase, or mixed-phase protocol. The root transaction manager commits the registered resources in accordance with the results of the registration step.

A distributed transaction security method for a memory data grid includes the steps that first, a service node is selected when a client sends a transaction request, and the memory data grid selects a corresponding service node for the transaction for the first time; second, the transaction request is created, and a transaction context and transaction ID (identification) are saved with the service node as a transaction coordinator and information of a client's source address, thread ID and the like as identification, so that the transaction is started; then comes data manipulation belonging to the first stage of a two-phase commit protocol of the memory data grid, and transaction commit or rollback belonging to the second stage of the two-phase commit protocol of the memory data grid succeeds. The distributed transaction security method for the memory data grid employs a plurality of transaction coordinators, and thus, bottleneck due to a single node is avoided, remote call of a third-party transaction manager is no need, additional communication costs are avoided, and costs of transaction coordination and maintenance of transaction state are reduced in the meantime.

Techniques are provided for handling distributed transactions in shared-nothing database systems where one or more of the nodes have access to a shared persistent storage. Rather than coordinate the distributed transaction using a two-phase commit protocol, the coordinator of the distributed transaction uses a one-phase commit protocol with those participants that have access to the transaction status information maintained by the coordinator. The transaction status information may reside, for example, in the redo log of the coordinator. In the case that the coordinator fails, those participants can determine the state of the distributed transaction based on information stored on the shared disk. In addition, the coordinator is able to determine whether it is possible to commit the distributed transaction based on information that is stored on the shared disk by the participants, without those participants entering a formal “prepared” state.

An optimization of the two-phase commit protocol employed in distributed systems. Each cohort component of the distributed system augments messages that are accessible to the coordinator component with state information indicating whether the cohort is read-only with regard to a transaction that the coordinator is coordinating. The coordinator retains the most recent state information. The coordinator reads the retained state information for the cohorts and when the transaction terminates, the coordinator reads the retained state information. Where the cohort's state is read-only, the coordinator simply sends an abort message instead of performing the full two-phase commit protocol with regard to the read-only cohort. In the trees of distributed system components that are defined by transactions, any cohort which has children in the tree is a local coordinator for its children. The general technique of cohorts augmenting messages accessible to a coordinator with state information that is relevant to an action to be performed by the coordinator and the coordinator acting in accordance with state retained from the messages has other uses as well.

A transaction processing system provides the capability to use one two-phase commit engine over multiple protocols and products, while being able to vary the log presumptions according to the requirements of each protocol and product. The transaction processing system comprises a coordinator operable to receive a commit or abort request from a transaction and to perform a two-phase commit protocol on behalf of the transaction and a recovery presumption mechanism operable to perform a recovery process on the transaction upon recovery of the transaction processing system from a failure.

An embodiment of the invention provides a distributed transaction committing failure handling method and device. The method includes the steps: recording the state of a distributed transaction as an unfinished state by a first node after committing the distributed transaction at a first stage; transmitting a transaction state query request including the sign of the distributed transaction to a second node according to the recorded unfinished state of the distributed transaction after the first node fails or network connection between the first node and the second node fails and failure recovers; repairing the distributed transaction at a second stage according to the state of the distributed transaction returned by the second node. By the method, the problem that the distributed transaction cannot be automatically repaired when second-stage committing failure of the distributed transaction occurs can be solved, and atomicity and uniformity of the distributed transaction are ensured.

The invention provides an enhanced two phase commit process to perform a transaction started by an application program and involving access to one or more resources managed by respective resource managers. The method comprises the steps of:

enlisting the resource managers participating in the transaction, said enlisting step including associating a priority rank with each identified resource manager based on predefined priority rules; sending a prepare signal to said enlisted resource managers to begin the process of committing the transaction; and if a ready signal is received from all resource managers in response to the prepare signal, committing the resource managers in the order defined from the priority ranks associated with the resource managers.

The invention relates to the technical field of micro-service development, in particular to a method for guaranteeing the data final consistency through a system based on a micro-service framework. Through the combination of a method using a message queue and the determination and retransmission mechanism of messages, final consistency can be achieved after automatic or manual compensation; modules related to the final data consistency include an upstream application for executing service and sending MQ messages, a reliable message service and message assembly for coordinating with the transmission of downstream messages and ensuring the consistency of upstream data and downstream data, and a downstream application for monitoring the MQ messages and executing service. The problems that traditional two-stage protocol submitting performance is poor and a processing chain is long are solved.

A method for using available server threads to process resources and reduce the overall time of performing XA interactions in two-phase commit protocol implemented by the transaction manager. A TM processing XA interactions dispatches interaction commands for multiple resources to a thread manager, which dispatches the commands to idle server threads. In one embodiment, the TM attempts to dispatch all but one of the interaction commands to separate threads. The primary thread then processes the remaining resource command. Any commands relating to dispatch requests that were unable to be dispatched to separate threads due to unavailability are processed by the primary thread. Once the primary server has processed its interaction commands and received a signal indicating the threads receiving dispatch requests have completed their respective processing of dispatched commands, the next group of commands is processed in a similar manner.

The invention discloses a distributed flash memory transaction processing method. The method comprises the following steps: S1, carrying out two-phase commit on a transaction, wherein state log records of the two-phase commit protocol are removed and internalized as flash memory metadata operations in interfaces of the transaction, and the end of the distributed transaction is marked with the final commit of a coordinator; S2, during the process of the transaction, storing a data temporary object as a shadow version, wherein a shadow mapping table is used for storing the address of the shadow version or the state of a page in the transaction processing, metadata of the page is used for recording information of the transaction, a transaction metadata page is used for recording the state of the transaction and a transaction state table is used for recording the address of the transaction metadata page; and S3, when the coordinator or a participant has a fault, scanning a part of the memory, reading the flash memory metadata and restoring an FTL mapping table, the shadow mapping table and the transaction state table so as to determine the state of the transaction during the two-phase commit. The distributed flash memory transaction processing method disclosed by the invention has the following advantages that the logs are decreased and the transaction processing efficiency under the distributed flash memory environment is improved.

Systems and methods are provided for semi-durable transaction log storage in a two-phase commit protocol transaction processing. An exemplary method includes receiving a distributed transaction comprising a plurality of processes for processing, wherein the processing uses a two-phase commit protocol and preparing, by a main coordinator, at least one participant comprising at least one of the plurality of processes to prepare for execution by the at least one participant. The method further includes receiving, by the main coordinator, information comprising prepared processes of the at least one of the plurality of processes and storing, by the main coordinator, a transaction log comprising the at least one participant and the information to a semi-durable storage. The semi-durable storage may comprise a crash-proof storage that survives system failure. Thus, the semi-durable storage may write the transaction log to the durable storage if there is a system failure.

The invention discloses a distributed transaction processing system which comprises a computing layer, a storage layer and a scheduling layer. The computing layer is used for receiving an SQL request of a client, converting the SQL request into a KV read-write request, transmitting the KV read-write request to the storage layer, and initiating two-stage transaction submission based on the SQL request, wherein the storage layer is used for providing a read-write interface for two-stage transaction submission initiated by the calculation layer and providing storage service; and the scheduling layer is used for maintaining meta-information of the whole cluster, including KV data distribution information and the like, providing global time service for the computing layer and the storage layer, and storing distributed information submitted in two stages of transactions. When the transaction is submitted, the transaction is submitted through a two-stage submission protocol, and a multi-version concurrency control mechanism is adopted, so that mutual blocking of reading and writing is avoided.

The invention discloses a method for processing distributed transactions in a distributed database system. The method is based on analysis of an existing strict two-stage blocking protocol and an existing two-stage submitting protocol. In order to overcome the influence of overlong lock holding time in a distributed transaction execution process, lock resources are released in advance in a transaction preparation stage in a two-stage submission protocol, and the sequence of submission and rollback of transactions is determined by maintaining submission dependency relationship information of the transactions, so that transaction exception is avoided, and the correctness of the transactions is ensured. According to the invention, the lock holding time of distributed transactions is effectively shortened, the conflict rate between the transactions is reduced, and the transaction processing performance is improved.

Systems and methods are provided for prepare list communication to participants in a two-phase commit protocol transaction processing. An exemplary method includes receiving a distributed transaction for processing, wherein the processing uses a two-phase commit protocol, receiving a distributed transaction comprising a plurality of processes for processing, wherein the processing uses a two-phase commit protocol and preparing, by a main coordinator, at least one participating processing node from the plurality of processes, wherein the at least one participating processing node comprises a first sub-coordinator and a first participant, and wherein the first participant executes a first process of the plurality of processes. The method further includes receiving, by the main coordinator, a first list comprising the first participant registered with the first sub-coordinator. The method may further include contacting, by the main coordinator, the first participant using the first list, in the event of system or first sub-coordinator failure.

The invention relates to the technical field of micro-service development, in particular to a method for ensuring the data consistency under a micro-service framework HTTP interaction mode. The methodincludes the steps of calling pre-operations of all auxiliary business service through a main business service, recording all the auxiliary business service in a movement manager, continuing the business if the pre-operations of all the auxiliary business service succeed or the pre-operation of a certain auxiliary business service fails, otherwise, stopping executing the execution business, if the pre-operations of all the auxiliary business service succeed, calling confirming operations of all the auxiliary business server through a collaborator, rolling back all the confirming operations and executing canceling operations of the auxiliary business service if the confirming operations fail, calling the canceling operations of all the auxiliary business service if the pre-operations of part of auxiliary business service fail till canceling succeeds. The problem that a traditional two-stage submitted protocol is poor in performance and not suitable for a micro-service framework is solved, and the three simple semantic operations on the business service can be achieved and called.

Techniques are disclosed for reducing the number of two-phase commits required to perform atomic transactions in a multi-node system. By monitoring atomic operations that require two-phase commit protocols, a system may identify when it would be beneficial to consolidate data onto single (or at least fewer) compute node(s). In doing so, a less compute intensive commit protocol, such as a one-phase commit protocol may be used. Moreover, in situations where data consolidation is not available, the data may be migrated to compute nodes having a closer proximity. Thus, in such cases, network response times for two-phase commits required for an atomic operation may be reduced, thereby increasing the performance of a multi-node system.