A method, an apparatus, and an electronic device for processing a data transaction are disclosed. The method includes receiving an application request from a client to perform a data operation in a target data partition; creating a corresponding data transaction according to the application request, and assigning a transaction identifier to the data transaction; returning the transaction identifier that is assigned to the data transaction to the client; performing the data operation based on the target data partition according to the data operation carrying the transaction identifier and sent by the client; and processing the data transaction according to a transaction instruction sent by the client. The method enables a data operation to implement transactional attributes, and to satisfy a transactional nature of the data operation. Moreover, the service logic of data transactions implemented by the method is relatively simple, thus ensuring that data services have a good transactional nature.

A method for sorting a data table is provided. The method may include providing a plurality of attribute value information for each data block of the data table. The method may also include receiving a query requiring a sorting on the first attribute of the data table. The method may further include determining a plurality of sequences of a plurality of data blocks having disjoint value ranges of the first attribute based on the provided plurality of attribute value information. The method may also include, for each determined sequence of the plurality of data blocks, reading a plurality of data, sorting the read plurality of data from each data block, and concatenating the sorted plurality of data from the plurality of data blocks within the determined sequence, thereby providing a sorted plurality of sequences. The method may further include merging the sorted plurality of sequences.

The present disclosure describes transaction-enabling systems and methods. A system can include a controller and a fleet of machines, each having at least one of a compute task requirement, a networking task requirement, and an energy consumption task requirement. The controller may include a resource requirement circuit to determine an amount of a resource for each of the machines to service the task requirement for each machine, a forward resource market circuit to access a forward resource market, and a resource distribution circuit to execute an aggregated transaction of the resource on the forward resource market.

A technique for managing a datapath of a data storage system includes receiving a request to access target data and creating a transaction that includes multiple datapath elements in a cache, where the datapath elements are used for accessing the target data. In response to detecting that one of the datapath elements is invalid, the technique further includes processing the transaction in a rescue mode. The rescue mode attempts to replace each invalid datapath element of the transaction with a valid version thereof obtained from elsewhere in the data storage system. The technique further includes committing the transaction as processed in the rescue mode.

An electronic device includes: a memory storing a database, a journal file for the database, and instructions; and a processor electrically connected with the memory. The instructions are configured to, when executed by the processor, cause the electronic device to: record a result of processing a transaction in the journal file through a thread of a process associated with the database; identify a size of the journal file through the thread; perform a lock for the journal file during a reference time through the thread, based on the identified size of the journal file through the thread; and transfer the result of processing the transaction to the database through the thread, based on a success of the lock for the journal file, the result of processing the transaction being recorded in the journal file.

An Application Data Management System (ADMS) enables an application file system to be mounted at any selected reconstruction time (T.sub.R). If the reconstruction time T.sub.R falls intermediate snapshot creation timepoints, the ADMS creates a version of the application file system at the selected reconstruction time T.sub.R using a snapshot of the data file from a previous application file system snapshot creation timepoint, and a snapshot of the log file from a subsequent application file system snapshot creation timepoint. The ADMS uses the snapshot of the log file from the subsequent snapshot creation timepoint to replay transactions on the snapshot of the data file from the previous snapshot creation timepoint up to the selected reconstruction time T.sub.R. This enables the state of the application file system to be recreated and mounted at any arbitrary selected reconstruction time, even if the selected reconstruction time is not coincident with snapshot creation timepoints.

The described methods, systems, and other aspects can, by way of example, advantageously provide efficient metadata storage in a master-slave node-based metadata store of a distributed storage system. An example method may write a first transaction entry in a transaction log of a first node based on a first request for a first operation associated with a first storage object. The method may then request a second node write the first transaction entry in a transaction log of the second node based on the first request. While awaiting a first acknowledgment of a completion of a writing of the first transaction entry in the transaction log of the second node, the method may proceed to write one or more subsequent transaction entries in the transaction log of the first node based on one or more subsequent requests for one or more operations associated with one or more storage objects.

Embodiments described herein are generally directed to techniques for avoiding or mitigating shared-state damage during a split-brain condition in a distributed network of compute nodes. According to an example, a number, N, of nodes within the distributed computing system is determined. During normal operation of the distributed computing system, a unified state is maintained by synchronizing shared state information. The nodes are ordered by increasing importance to an application from 1 to N. A quora value, q.sub.n, is assigned to each of the nodes in accordance with the ordering, where q.sub.1=1 and each subsequent quora value, q.sub.n+1, is a sum of all prior quora values, q.sub.1 to q.sub.n, plus either 1 or a current value of n. These quora values may then be used to determine membership in the dominant or a yielding set to facilitate recovery from the split-brain condition by performing pessimistic or optimistic mitigation actions.

A database management system for controlling prioritized transactions, comprising: a processor adapted to: receive from a client module a request to write into a database item as part of a high-priority transaction; check a lock status and an injection status of the database item; when the lock status of the database item includes a lock owned by a low-priority transaction and the injection status is not-injected status: change the injection status of the database item to injected status; copy current content of the database item to an undo buffer of the low-priority transaction; and write into a storage engine of the database item.

A first data structure lock to access a first data structure of a first set of data structures to perform an operation associated with a transaction is acquired. The operation associated with the transaction is executed, wherein the operation is one of inserting the transaction into the first data structure or removing the transaction from the first data structure. An oldest active transaction of the first data structure is identified. A globally oldest active transaction of the set of the data structures in view of the oldest active transaction is determined. A second set of data structures is accessed, the second set of data structures including information associated with completed transactions to identify a set of data locks associated with completed transactions each having a transaction completion identifier that satisfies a condition when compared to a transaction start identifier associated with the globally oldest active transaction. The set of data locks are released.