US 10,706,037 B2 · Non-blocking processing of federated transactions for distributed data partitions

Abstract

Non-blocking processing of federated transactions may be implemented for distributed data partitions. A transaction may be received that specifies keys at data nodes to lock in order to perform the transaction. Lock requests are generated and sent to the data nodes which identify sibling keys to be locked at other data nodes for the transaction. In response to receiving the lock requests, data nodes may send to lock queues indicating other lock requests for the keys at the data node. An evaluation of the lock queues based, at least in part, on an ordering of the lock requests in the lock queues may be performed to identify a particular transaction to commit. Once identified, a request to commit the identified transaction may be sent to the particular data nodes indicated by the sibling keys in a lock request for the identified transaction.

Claims20

Dependent claims

A method, comprising:

sending to a plurality of data nodes respective lock requests that identify for each respective data node one or more keys to lock at the respective data node and respective sibling keys to lock at data nodes other than the respective data node to perform a first transaction;
receiving, responsive to the respective lock requests, respective lock queues from the data nodes sent the respective lock requests, wherein at least one of the respective lock queues includes a lock request for another transaction in addition to the first transaction;
evaluating the respective lock queues from the data nodes to identify a transaction to commit based, at least in part, on an ordering of the one or more lock requests within the respective lock queues;
and
sending a request to commit the identified transaction to the data nodes identified according to sibling keys included in a lock request for the identified transaction.

2 more elements

A system, comprising:

a plurality of data nodes;
and
a transaction manager, configured to:
send to the plurality of data nodes respective lock requests that identify for each respective data node one or more keys to lock at the respective data node and respective sibling keys to lock at data nodes other than the respective data node to perform a first transaction;
receive, responsive to the respective lock requests, respective lock queues from the data nodes sent the respective lock requests, wherein at least one of the respective lock queues includes a lock request for another transaction in addition to the first transaction;
evaluate the respective lock queues from the data nodes to identify a transaction to commit based, at least in part, on an ordering of the one or more lock requests within the respective lock queues;
and
send a request to commit the identified transaction to the data nodes identified according to sibling keys included in a lock request for the identified transaction.

5 more elements

A non-transitory, computer-readable storage medium, storing program instructions that when executed by one or more computing devices cause the one or more computing devices to implement:

sending to a plurality of data nodes respective lock requests that identify for each respective data node one or more keys to lock at the respective data node and respective sibling keys to lock at data nodes other than the respective data node to perform a first transaction;
receiving, responsive to the respective lock requests, respective lock queues from the data nodes sent the respective lock requests, wherein at least one of the respective lock queues includes a lock request for another transaction in addition to the first transaction;
evaluating the respective lock queues from the data nodes to identify a transaction to commit based, at least in part, on an ordering of the one or more lock requests within the respective lock queues;
and
sending a request to commit the identified transaction to the data nodes identified according to sibling keys included in a lock request for the identified transaction.

2 more elements

Dependencies are inferred from the claim text.

Non-blocking processing of federated transactions for distributed data partitions

Life of this patent

Non-blocking processing of federated transactions for distributed data partitions

Life of this patent

Abstract

Claims20