Patent US6845384B2 successfully refreshed from Google Patents.
US6845384B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
One-phase commit in a shared-nothing database system
Assignee: Oracle International Corp
•
Filing: 2003-11-21
•
Granted: 2005-01-18
•
Expires: 2023-11-21
Abstract
Abstract 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.
Inventors
- 👤 Roger J. Bamford
- 👤 Sashikanth Chandrasekaran
- 👤 Angelo Pruscino
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 20:13
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/23; G06F16/2379; G06F16/27; Y; Y10; Y10S; Y10S707/00; Y10S707/99951; Y10S707/99956
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
118 words
A method for performing a distributed transaction in a shared-nothing database system, the method comprising: on a first shared-nothing node of said shared-nothing database system, causing a coordinator that is coordinating the distributed transaction to store information that indicates status of said distributed transaction on a persistent storage device; wherein the persistent storage device is accessible to a participant that is to perform one or more operations as part of said distributed transaction; wherein the participant resides on a second shared-nothing node of said shared-nothing database system; and on the second shared-nothing node of said shared-nothing database system, causing the participant to determine the status of said distributed transaction by reading the information from the persistent storage device.
Claim 2
Independent Claim
118 words
A method for performing a distributed transaction in a shared-nothing database system, the method comprising: on a first shared-nothing node of said shared-nothing database system, causing a coordinator that is coordinating the distributed transaction to store information that indicates status of said distributed transaction on a persistent storage device; wherein the persistent storage device is accessible to a participant that is to perform one or more operations as part of said distributed transaction; wherein the participant resides on a second shared-nothing node of said shared-nothing database system; and on the second shared-nothing node of said shared-nothing database system, causing the participant to determine the status of said distributed transaction by reading the information from the persistent storage device.
Claim 3
Dependent Claim
60 words
The method of claim 1 wherein: the participant is a first participant of a plurality of participants in said distributed transaction; the plurality of participants includes a second participant that does not have access to said persistent storage device; and the method further comprises the step of the coordinator interacting with the second participant according to a two-phase commit protocol.
Claim 4
Dependent Claim
33 words
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 .
Claim 5
Dependent Claim
76 words
The method of claim 1 further comprising the steps of: the coordinator committing the distributed transaction; after the coordinator commits the distributed transaction, the coordinator sending a commit message to the participant; and preventing the information that indicates the status of the distributed transaction from being overwritten or deleted until a set of conditions is satisfied, wherein one condition in said set of conditions is that the coordinator receives a commit acknowledge message from said participant.
Claim 6
Dependent Claim
33 words
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 .
Claim 7
Dependent Claim
82 words
The method of claim 1 further comprising the steps of: the participant sending a first piece of information to the coordinator, wherein the first piece of information is associated with work performed by said participant as part of said distributed transaction; and the coordinator performing a comparison between the first piece of information and information associated with a redo log of said second shared-nothing node; and the coordinator determining whether to commit the transaction based, at least in part, on said comparison.
Claim 8
Dependent Claim
26 words
The method of claim 6 wherein piece of information includes a log-sequence-number of the latest change made by the participant as part of the distributed transaction.
Claim 9
Dependent Claim
44 words
The method of claim 7 wherein the step of sending includes the steps of: the participant identifying a message that is being sent to said first shared-nothing node for a purpose unrelated to the distributed transaction; and piggybacking the log-sequence number on said message.
Claim 10
Dependent Claim
33 words
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 .
Claim 11
Dependent Claim
33 words
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 .
Claim 12
Dependent Claim
33 words
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 .
Claim 13
Dependent Claim
33 words
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 .
Claim 14
Independent Claim
181 words
A method for performing a distributed transaction in a shared-nothing database system, the method comprising: assigning a participant to perform one or more operations as part of said distributed transaction; wherein the participant resides on a first shared-nothing node of said shared-nothing system; causing said participant to store, on a persistent storage device, status information that indicates changes made by the participant during performance of said one or more operations; wherein the persistent storage device is accessible to a coordinator that is responsible for coordinating said distributed transaction; wherein the coordinator resides on a second shared-nothing node of said shared-nothing database system; on said second shared-nothing node of said shared-nothing database system, causing said coordinator to determine, based on the status information on said persistent storage device, whether the participant has written to persistent storage changes produced by performance of the one or more operations; and the coordinator process determining whether the distributed transaction can be committed based, at least in part, on whether the participant has written to persistent storage changes produced by performance of the one or more operations.
Claim 15
Independent Claim
181 words
A method for performing a distributed transaction in a shared-nothing database system, the method comprising: assigning a participant to perform one or more operations as part of said distributed transaction; wherein the participant resides on a first shared-nothing node of said shared-nothing system; causing said participant to store, on a persistent storage device, status information that indicates changes made by the participant during performance of said one or more operations; wherein the persistent storage device is accessible to a coordinator that is responsible for coordinating said distributed transaction; wherein the coordinator resides on a second shared-nothing node of said shared-nothing database system; on said second shared-nothing node of said shared-nothing database system, causing said coordinator to determine, based on the status information on said persistent storage device, whether the participant has written to persistent storage changes produced by performance of the one or more operations; and the coordinator process determining whether the distributed transaction can be committed based, at least in part, on whether the participant has written to persistent storage changes produced by performance of the one or more operations.
Claim 16
Dependent Claim
114 words
The method of claim 13 wherein: the step of causing said participant to store, on a persistent storage device, status information that indicates changes made by the participant during performance of said one or more operations includes causing said participant to store redo information in a redo log on said persistent storage device; and the step of causing said coordinator to determine, based on the status information on said persistent storage device, whether the participant has written to persistent storage changes produced by performance of the one or more operations includes inspecting the redo log of the participant to determine whether the redo information for said changes have been written to said persistent storage.
Claim 17
Dependent Claim
67 words
The method of claim 13 wherein: the participant is a first participant of a plurality of participants in said distributed transaction; the plurality of participants includes a second participant that stores status information on a second persistent storage device that is not accessible by said coordinator; and the method further comprises the step of the coordinator interacting with the second participant according to a two-phase commit protocol.
Claim 18
Dependent Claim
33 words
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 14 .
Claim 19
Dependent Claim
33 words
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 15 .
Claim 20
Dependent Claim
68 words
The method of claim 13 wherein: the information on said persistent storage device indicates that the participant has not written to persistent storage changes produced by performance of the one or more operations; and the method further comprises the coordinator sending a force redo message to the participant to cause the participant to write to persistent storage the changes produced by performance of the one or more operations.
Claim 21
Dependent Claim
47 words
The method of claim 18 wherein the step of sending a force redo message includes the steps of: identifying a message that is being sent to said first shared-nothing node for a purpose unrelated to the distributed transaction; and piggybacking the force redo message on said message.
Claim 22
Dependent Claim
33 words
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 19 .
Claim 23
Dependent Claim
33 words
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 18 .
Claim 24
Dependent Claim
33 words
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 .
References Cited (Backward Citations)
US4827411A
Cited
US4914571A
Cited
US5109483A
Cited
US4873517A
Cited
US5101348A
Cited
US4972437A
Cited
US5613060A
Cited
US5319773A
Cited
US5313051A
Cited
US5432926A
Cited
US5740362A
Cited
US6311265B1
Cited
US5892754A
Cited
US6253229B1
Cited
US6011918A
Cited
US6480895B1
Cited
US6370619B1
Cited
US6321238B1
Cited
US6341340B1
Cited
US6711571B2
Cited
US20040172422A1
Cited
US6438714B1
Cited
US6567811B1
Cited
US6567509B1
Cited
US6636248B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2008-01-18 | 2008-07-19 | 2009-01-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2012-01-18 | 2012-07-19 | 2013-01-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2016-01-18 | 2016-07-19 | 2017-01-18 | $7700.00 | Window Closed / Lapsed |