Abstract: An efficient and scalable transaction processing using a consensus-based transaction model is disclosed. A transaction processor receives a transaction that includes a plurality of update subtransactions to be performed against a corresponding plurality of resources. A transaction identifier (ID) that corresponds to the transaction is determined. For each resource of the plurality of resources, the transaction ID is sent to a resource manager associated with the resource to determine a status of the corresponding update subtransaction as one of 1) a not seen status, 2) a prepared status, or 3) a committed status. Based on the status of the corresponding update subtransaction, any action against the resource via the resource manager that is necessary to bring the status of the corresponding update subtransaction to the committed status is performed. The transaction is marked as being completed.

Abstract: An efficient and scalable transaction processing using a consensus-based transaction model is disclosed. A transaction processor receives a transaction that includes a plurality of update subtransactions to be performed against a corresponding plurality of resources. A transaction identifier (ID) that corresponds to the transaction is determined. For each resource of the plurality of resources, the transaction ID is sent to a resource manager associated with the resource to determine a status of the corresponding update subtransaction as one of 1) a not seen status, 2) a prepared status, or 3) a committed status. Based on the status of the corresponding update subtransaction, any action against the resource via the resource manager that is necessary to bring the status of the corresponding update subtransaction to the committed status is performed. The transaction is marked as being completed.