Maintaining global state of distributed transaction managed by an external transaction manager for clustered database systems

• US 20080243865A1
• Filed: 03/28/2007
• Published: 10/02/2008
• Est. Priority Date: 03/28/2007
• Status: Abandoned Application

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Sinha, Bipul, Ganesh, Amit, Loaiza, Juan, Raja, Vivekanandhan, Hu, Yong
• Application Number:
  US11/729,473
• Publication Number:
  US 20080243865A1
• Time in Patent Office: Days
• US Class Current: 707/10
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor

Abstract

In accordance with an embodiment of the present invention, a transaction tracking mechanism is provided by a database server cluster to keep track of a global state of a distributed transaction. The global state of the distributed transaction comprises one or more statuses that are associated with one or more transaction branches that are part of the distributed transaction. The global state may be associated with a global lock. Through using the global state in association with the global lock, problems such as partial commits, data inconsistency, access contentions and deadlocks may be avoided when the database server cluster processes the distributed transaction.

Claims

1. A method, comprising:

a computer system, comprising two or more server instances, executing one or more transaction branches of a distributed transaction that is managed by a transaction manager executing on a node different from said two or more server instances; and

storing, within said computer system, information in association with said distributed transaction that indicates a status of said distributed transaction.

2. The method as recited in claim 1, wherein said information in association with said distributed transaction is stored in association with a global lock.

3. The method as recited in claim 1, wherein said status of said distributed transaction comprises one or more statuses, each being associated with one of said one or more transaction branches.

4. The method as recited in claim 1, further comprising using said information in association with said distributed transaction to detect an attempt to create a transaction branch that is duplicative to an existing transaction branch in the distributed transaction.

5. The method as recited in claim 1, further comprising associating a global transaction identifier with said distributed transaction and using said information in association with said distributed transaction to detect an attempt to create another distributed transaction associated with said global transaction identifier.

6. The method as recited in claim 2, wherein said information in association with said distributed transaction is stored in one or more lock value structures in association with said global lock.

7. The method as recited in claim 6, wherein at least one of said one or more lock value structures is associated with a unit of work performed by a server process.

8. The method as recited in claim 7, wherein said unit of work comprises preparing for committing said distributed transaction.

9. The method as recited in claim 6, wherein said information in association with said distributed transaction is stored in a variable-sized data structure that comprises said one or more lock value structures in association with said global lock.

10. The method as recited in claim 1, wherein said information comprises a branch status for one of the transaction branches, wherein said branch status comprises an indication of a success or a failure relating to performing a two-phase transaction commitment for the one of the transaction branches.

11. The method as recited in claim 6, wherein one of said one or more lock value structures comprises an address of undo records and a system change number that is associated with a unit of work of the associated transaction branch of said distributed transaction.

12. The method as recited in claim 1, wherein said two or more server instances form a server cluster for a single database source.

13. The method as recited in claim 1, further comprising:

receiving a request to prepare for committing a transaction branch;

determining said status of said distributed transaction using said information in association with said distributed transaction, wherein said status of said distributed transaction comprises one or more statuses for one or more transaction branches that includes said transaction branch; and

managing preparation for committing said transaction branch based on said status of said distributed transaction.

14. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 1.

15. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 2.

16. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 3.

17. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 4.

18. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 5.

19. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 6.

20. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 7.

21. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 8.

22. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 9.

23. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 10.

24. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 11.

25. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 12.

26. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 13.