Abstract: The present teaching relates to request management and data recovery in a data system. In one example, a failure in connection with first data is detected at a first node in a data system. Information associated with a most recent transaction related to the first node is obtained from the persistent storage. Each of other nodes in the data system is requested to transmit one or more transaction requests previously sent to the first node after the most recent transaction. The one or more transaction requests are received from at least one of the other nodes. A sequence of one or more transactions associated with the one or more transaction requests is determined. The one or more transactions are executed according to the sequence in order to recover the first data at the first node.

Abstract: The present teaching relates to scheduling transactions at a node in a data system. In one example, a request is obtained for performing a first transaction at the node. A mixing condition associated with the first transaction is determined. The first transaction is initiated. The first transaction is suspended when the mixing condition is met. A second transaction is carried out at the node. The first transaction and the second transaction are directed to a same portion of data at the node.

Abstract: The present teaching relates to request management and data recovery in a data system. In one example, a request is received for a transaction of data by a first node in the data system. A second node in the data system is determined based on the request. The second node is to carry out the transaction. The request is stored into a first request queue at the first node. The request is sent to the second node. A notice is obtained indicating that information associated with the transaction has been persistently stored. The request is removed from the first request queue in response to the notice.

Abstract: The present teaching relates to managing a request in a data system of a plurality of nodes in a network. In one example, a request is received for a transaction of data by a first node in the data system. A second node in the data system is determined based on the request, where the second node is to carry out the transaction. The request is stored into a first request queue at the first node. The request is sent to the second node. A notice is obtained by the first node indicating that information associated with the transaction has been persistently stored. The request is removed from the first request queue in response to the notice being obtained.

Abstract: The present teaching relates to scheduling transactions at a node in a data system. In one example, a request is obtained for performing a first transaction at the node. A mixing condition associated with the first transaction is determined. The first transaction is initiated. The first transaction is suspended when the mixing condition is met. A second transaction is carried out at the node. The first transaction and the second transaction are directed to a same portion of data at the node.

Abstract: The present teaching relates to scheduling transactions at a node in a data system. In one example, a request is obtained for performing a first transaction at the node. A mixing condition associated with the first transaction is determined. The first transaction is initiated. The first transaction is suspended when the mixing condition is met. A second transaction is carried out at the node. The first transaction and the second transaction are directed to a same portion of data at the node.

Abstract: The present teaching relates to scheduling transactions at a node in a data system. In one example, a request is obtained for performing a first transaction at the node. A mixing condition associated with the first transaction is determined. The first transaction is initiated. The first transaction is suspended when the mixing condition is met. A second transaction is carried out at the node. The first transaction and the second transaction are directed to a same portion of data at the node.

Abstract: The present teaching relates to request management and data recovery in a data system. In one example, a request is received for a transaction of data by a first node in the data system. A second node in the data system is determined based on the request. The second node is to carry out the transaction. The request is stored into a first request queue at the first node. The request is sent to the second node. A notice is obtained indicating that information associated with the transaction has been persistently stored. The request is removed from the first request queue in response to the notice.