Patent US5371886A successfully refreshed from Google Patents.
US5371886A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System for managing unit-of-work identifiers when a chained, distributed, two phase commit transaction system is severed
Assignee: International Business Machines Corp
•
Filing: 1993-12-09
•
Granted: 1994-12-06
•
Expires: 2013-12-09
Abstract
Abstract A method of managing unit-of-work identifiers in a chained distributed database transaction system. The system has a plurality of processing nodes which are logically connected to form a tree. Normally, each node automatically increments its present identifier at the end of processing each transaction to derive the next transaction identifier. However, in response to a failure condition which results in a severed tree, the distributed database that now reside in the first and second subtrees that result from the severance are forced to consistent states. The transaction identifier is incremented in each of the nodes of the first subtree. Transaction work in the first subtree then proceeds with the incremented identifier. The second subtree is dismantled. In response to a nonfailure condition which results in a severed tree, the distributed database in the first and second subtrees that result from the nonfailure severance is committed to a permanent state. The transaction identifier in each of the nodes of the first subtree is incremented. Transaction work in the first subtree then proceeds with the incremented identifier. A new transaction identifier is generated and propagated to all nodes of the second subtree. Transaction work in the second subtree then proceeds with the new identifier.
Inventors
- 👤 Kathryn H. Britton
- 👤 Andrew P. Citron
- 👤 Bruce G. Lindsay
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 13:22
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/14; G06F11/1402; Y; Y10; Y10S; Y10S707/00; Y10S707/99951; Y10S707/99952; Y10S707/99953
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
140 words
A method of managing unit-of-work identifiers in a chained two-phase commit or backout distributed database transaction system having a plurality of processing nodes logically connected to form a tree, in which, under predetermined conditions, each node automatically derives the next transaction identifier from the present transaction identifier, comprising the steps of in response to a nonfailure condition resulting in a severed tree, committing to a permanent state any modifications made to the distributed database in both of the first and second subtrees resulting from the severance, deriving the transaction identifier for the next transaction in each of the nodes of the first subtree, proceeding with transaction work in the first subtree, generating a new transaction identifier for the second tree, propagating the new identifier to all nodes of the second subtree, and proceeding with transaction work in the second subtree.
Claim 2
Independent Claim
140 words
A method of managing unit-of-work identifiers in a chained two-phase commit or backout distributed database transaction system having a plurality of processing nodes logically connected to form a tree, in which, under predetermined conditions, each node automatically derives the next transaction identifier from the present transaction identifier, comprising the steps of in response to a nonfailure condition resulting in a severed tree, committing to a permanent state any modifications made to the distributed database in both of the first and second subtrees resulting from the severance, deriving the transaction identifier for the next transaction in each of the nodes of the first subtree, proceeding with transaction work in the first subtree, generating a new transaction identifier for the second tree, propagating the new identifier to all nodes of the second subtree, and proceeding with transaction work in the second subtree.
Claim 3
Dependent Claim
192 words
Apparatus for managing unit-of-work identifiers in a chained distributed database transaction system having a plurality of processing node logically connected to form a tree, in which, under predetermined conditions, each node automatically derives the next transaction identifier from the present transaction identifier, comprising in response to a nonfailure condition severing the system and resulting in a first subtree and a second subtree, means in both the first subtree and the second subtree for committing to a permanent state any modifications made to the distributed database in both of the first and second subtrees, means in each node of the first subtree for deriving a transaction identifier for the next transaction, means responsive to the deriving means for proceeding with transaction work in the first subtree using the newly derived transaction identifier, means in one of the nodes of the second subtree for generating a new transaction identifier for the second tree, means in said one node for propagating the new identifier to all nodes of the second subtree, and means in the nodes of the second subtree for proceeding with transaction work in the second subtree using the newly propagated transaction identifier.
Claim 4
Dependent Claim
192 words
Apparatus for managing unit-of-work identifiers in a chained distributed database transaction system having a plurality of processing node logically connected to form a tree, in which, under predetermined conditions, each node automatically derives the next transaction identifier from the present transaction identifier, comprising in response to a nonfailure condition severing the system and resulting in a first subtree and a second subtree, means in both the first subtree and the second subtree for committing to a permanent state any modifications made to the distributed database in both of the first and second subtrees, means in each node of the first subtree for deriving a transaction identifier for the next transaction, means responsive to the deriving means for proceeding with transaction work in the first subtree using the newly derived transaction identifier, means in one of the nodes of the second subtree for generating a new transaction identifier for the second tree, means in said one node for propagating the new identifier to all nodes of the second subtree, and means in the nodes of the second subtree for proceeding with transaction work in the second subtree using the newly propagated transaction identifier.
Claim 5
Independent Claim
152 words
A method of managing unit-of-work identifiers under failure condition in a chained two-phase commit or backout distributed database transaction processing system having a plurality of processing nodes logically connected to form a transaction tree, in which, under nonfailure conditions, each node automatically increments its present identifier at the end of processing a present transaction to derive the next transaction identifier, said method, in response to a communication failure between two nodes of the system, comprising the steps of backing-out all database changes which are part of the present transaction in a first one of the subtrees formed by the communication failure, incrementing the transaction identifier in each of the nodes of the first subtree, and proceeding with transaction work in the first subtree, and backing-out all database changes which are part of the present transaction in a second one of the subtrees formed by the communication failure, and dismantling the second subtree.
Claim 6
Independent Claim
152 words
A method of managing unit-of-work identifiers under failure condition in a chained two-phase commit or backout distributed database transaction processing system having a plurality of processing nodes logically connected to form a transaction tree, in which, under nonfailure conditions, each node automatically increments its present identifier at the end of processing a present transaction to derive the next transaction identifier, said method, in response to a communication failure between two nodes of the system, comprising the steps of backing-out all database changes which are part of the present transaction in a first one of the subtrees formed by the communication failure, incrementing the transaction identifier in each of the nodes of the first subtree, and proceeding with transaction work in the first subtree, and backing-out all database changes which are part of the present transaction in a second one of the subtrees formed by the communication failure, and dismantling the second subtree.
Claim 7
Dependent Claim
130 words
Apparatus for managing unit-of-work identifiers in a chained distributed database transaction system having a plurality of processing nodes logically connected to form a tree, in which, under predetermined conditions, each node automatically derives the next transaction identifier from the present transaction identifier, said apparatus, in response to a failure condition severing the system and thereby resulting in a first subtree and a second subtree, comprising means in each of the first and second subtrees for forcing the distributed database in the subtrees to consistent states, means in each node of the first subtree for deriving a transaction identifier for the next transaction, means responsive to the deriving means for proceeding with transaction work in the first subtree using the newly derived transaction identifier, and means for dismantling the second subtree.
Claim 8
Dependent Claim
130 words
Apparatus for managing unit-of-work identifiers in a chained distributed database transaction system having a plurality of processing nodes logically connected to form a tree, in which, under predetermined conditions, each node automatically derives the next transaction identifier from the present transaction identifier, said apparatus, in response to a failure condition severing the system and thereby resulting in a first subtree and a second subtree, comprising means in each of the first and second subtrees for forcing the distributed database in the subtrees to consistent states, means in each node of the first subtree for deriving a transaction identifier for the next transaction, means responsive to the deriving means for proceeding with transaction work in the first subtree using the newly derived transaction identifier, and means for dismantling the second subtree.
Claim 9
Dependent Claim
147 words
In chained distributed database transaction system having a plurality of processing nodes logically connected to form a tree, in which, under predetermined conditions, each node automatically derives the next transaction identifier from the present transaction identifier, apparatus in each node, responsive to a failure condition severing the system and thereby resulting in a first subtree and a second subtree, for managing unit-of-work identifiers, said apparatus in each node of the first subtree comprising means for committing or backing out modifications associated with the present transaction, means for deriving a transaction identifier for the next transaction to be processed by the node, and means responsive to the deriving means for proceeding with transaction work in the node using the newly derived transaction identifier, said apparatus in each node of the second subtree comprising means for dismantling connections between the node and other adjacent nodes of the second subtree.
Claim 10
Dependent Claim
147 words
In chained distributed database transaction system having a plurality of processing nodes logically connected to form a tree, in which, under predetermined conditions, each node automatically derives the next transaction identifier from the present transaction identifier, apparatus in each node, responsive to a failure condition severing the system and thereby resulting in a first subtree and a second subtree, for managing unit-of-work identifiers, said apparatus in each node of the first subtree comprising means for committing or backing out modifications associated with the present transaction, means for deriving a transaction identifier for the next transaction to be processed by the node, and means responsive to the deriving means for proceeding with transaction work in the node using the newly derived transaction identifier, said apparatus in each node of the second subtree comprising means for dismantling connections between the node and other adjacent nodes of the second subtree.
Claim 11
Independent Claim
112 words
A method of managing unit-of-work identifiers in a chained two-phase commit or backout distributed database transaction system having a plurality of processing nodes logically connected to form a tree, in which, under predetermined conditions, each node automatically derives the next transaction identifier from the present transaction identifier, said method in response to a failure condition resulting in a severed tree comprising the steps of forcing the distributed database in the first and second subtrees resulting from the severance to consistent states, and deriving the transaction identifier for the next transaction in each of the nodes of the first subtree, proceeding with transaction work in the first subtree, and dismantling the second subtree.
Claim 12
Independent Claim
112 words
A method of managing unit-of-work identifiers in a chained two-phase commit or backout distributed database transaction system having a plurality of processing nodes logically connected to form a tree, in which, under predetermined conditions, each node automatically derives the next transaction identifier from the present transaction identifier, said method in response to a failure condition resulting in a severed tree comprising the steps of forcing the distributed database in the first and second subtrees resulting from the severance to consistent states, and deriving the transaction identifier for the next transaction in each of the nodes of the first subtree, proceeding with transaction work in the first subtree, and dismantling the second subtree.
Claim 13
Dependent Claim
64 words
The method of claim 6 wherein the tree comprises a root node from which building of the tree initiates when the tree is first established, said method further comprising the steps of determining in each subtree if the subtree is further from the root node than the other subtree, and designating the subtree that is further from the root node as the second subtree.
Claim 14
Independent Claim
223 words
A method of managing unit-of-work identifiers in a chained two-phase commit or backout distributed database transaction system having a plurality of processing nodes logically connected to form a tree, in which, under predetermined conditions, each node automatically derives the next transaction identifier from the present transaction identifier, said tree having a root node from which building of the tree initiates when the tree is first established, comprising the steps of in response to a failure condition resulting in a severed tree, forcing the distributed database in the first and second subtrees resulting from the severance to consistent states, determining in each subtree if the subtree is further from the root node than the other subtree, designating the subtree that is further from the root node as the second subtree, deriving the transaction identifier for the next transaction in each of the nodes of the first subtree, and dismantling the second subtree, wherein said step of forcing all nodes in both subtrees to consistent states further comprises determining if the failure occurred during commit or backout synchronization operations of the present transaction, if the failure occurred during commit synchronization operations of the present transaction, allowing the commit operation to complete in both subtrees, and backing out the next transaction in any node of the system that has already started processing of the next transaction.
Claim 15
Independent Claim
223 words
A method of managing unit-of-work identifiers in a chained two-phase commit or backout distributed database transaction system having a plurality of processing nodes logically connected to form a tree, in which, under predetermined conditions, each node automatically derives the next transaction identifier from the present transaction identifier, said tree having a root node from which building of the tree initiates when the tree is first established, comprising the steps of in response to a failure condition resulting in a severed tree, forcing the distributed database in the first and second subtrees resulting from the severance to consistent states, determining in each subtree if the subtree is further from the root node than the other subtree, designating the subtree that is further from the root node as the second subtree, deriving the transaction identifier for the next transaction in each of the nodes of the first subtree, and dismantling the second subtree, wherein said step of forcing all nodes in both subtrees to consistent states further comprises determining if the failure occurred during commit or backout synchronization operations of the present transaction, if the failure occurred during commit synchronization operations of the present transaction, allowing the commit operation to complete in both subtrees, and backing out the next transaction in any node of the system that has already started processing of the next transaction.
Claim 16
Dependent Claim
39 words
The method of claim 8 wherein if the failure occurred during transaction processing of the present transaction and before the beginning of commit or backout synchronization operations of the present transaction, backing out the present transaction in both subtrees.
Claim 17
Dependent Claim
197 words
In chained distributed database transaction system having a plurality of processing nodes logically connected to form a tree, in which, under predetermined conditions, each node automatically derives the next transaction identifier from the present transaction identifier, apparatus in each node, responsive to a nonfailure condition severing the system and thereby resulting in a first subtree and a second subtree, for managing unit-of-work identifiers, said apparatus in each node of the first subtree comprising means for committing modifications associated with the present transaction in accordance with all other nodes of the system, means for deriving a transaction identifier for the next transaction to be processed by the node, and means responsive to the deriving means for proceeding with transaction work in the node using the newly derived transaction identifier, said apparatus in each node of the second subtree comprising means for committing modifications associated with the present transaction in accordance with all other nodes of the system, means for generating a new transaction identifier for the second tree, means for propagating the new identifier to all other nodes adjacent to this node in the second subtree, and means for proceeding with transaction work using the new transaction identifier.
Claim 18
Dependent Claim
197 words
In chained distributed database transaction system having a plurality of processing nodes logically connected to form a tree, in which, under predetermined conditions, each node automatically derives the next transaction identifier from the present transaction identifier, apparatus in each node, responsive to a nonfailure condition severing the system and thereby resulting in a first subtree and a second subtree, for managing unit-of-work identifiers, said apparatus in each node of the first subtree comprising means for committing modifications associated with the present transaction in accordance with all other nodes of the system, means for deriving a transaction identifier for the next transaction to be processed by the node, and means responsive to the deriving means for proceeding with transaction work in the node using the newly derived transaction identifier, said apparatus in each node of the second subtree comprising means for committing modifications associated with the present transaction in accordance with all other nodes of the system, means for generating a new transaction identifier for the second tree, means for propagating the new identifier to all other nodes adjacent to this node in the second subtree, and means for proceeding with transaction work using the new transaction identifier.
Claim 19
Dependent Claim
49 words
The apparatus of claim 10 further comprising means in each node of the second subtree responsive to a prescribed condition for determining if the node is designated to generate the new transaction identifier for the second subtree, and means responsive to the determining means for activating the propagating means.
References Cited (Backward Citations)
US4665520A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-12-05 | 1998-06-06 | 1998-12-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-12-05 | 2002-06-06 | 2002-12-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-12-05 | 2006-06-06 | 2006-12-06 | $7700.00 | Window Closed / Lapsed |