Various embodiments enable versioning of data stored on a memory device, where the versioning allows the memory device to maintain different versions of data within a set of physical memory locations (e.g., a row) of the memory device. In particular, some embodiments provide for a memory device or a memory sub-system that uses versioning of stored data to facilitate a rollback operation/behavior, a checkpoint operation/behavior, or both. Additionally, some embodiments provide for a transactional memory device or a transactional memory sub-system that uses versioning of stored data to enable rollback of a memory transaction, commitment of a memory transaction, or handling of a read or write command associated with respect to a memory transaction.

An illustrative data storage management system comprises a management database that stores administrative preferences and system configurations, as well as results and/or statistics of completed secondary storage operations, i.e., information needed by the system to protect customers' data and to track and recover the protected data, including secondary copies such as backup copies, archive copies, etc. The disclosed data storage management system is configured to protect its own system data subject to a very aggressive (short) Recovery Point Objective (RPO), by using an innovative infrastructure that enables the system's storage manager to fail over to any number of other failover destination storage managers, each one comprising a destination management database. An illustrative database granularly tracks whether each and every transaction log file has been successfully applied to each and every destination management database to synchronize with the source management database.

A provisional page to be filled with data is allocated in an in-memory database system in which pages are loaded into memory and having associated physical disk storage a provisional page to be filled with data. Thereafter, the provisional page is filled with data. The provisional page is register after the provisional page has been filled with data such that consistent changes in the database are not required for the provisional page prior to the registering.

Disclosed are techniques for managing context information for data stored within a computing device. According to some embodiments, the method can include the steps of (1) loading, into a volatile memory of the computing device, the context information from a non-volatile memory of the computing device, where the context information is separated into a plurality of portions, and each portion of the plurality of portions is separated into a plurality of sub-portions, (2) writing transactions into a log stored within the non-volatile memory, and (3) each time a condition is satisfied: identifying a next sub-portion to be processed, where the next sub-portion is included in the plurality of sub-portions of a current portion being processed, identifying a portion of the context information that corresponds to the next sub-portion, converting the portion from a first format to a second format, and writing the portion into the non-volatile memory.

A memory system may include: a nonvolatile memory device comprising a plurality of memory blocks, each block having a plurality of pages, each page having a plurality of memory cells, wherein the plurality of memory block includes an SLC (Single Level Cell) block and an MLC (Multi-Level Cell) block; and a controller suitable for programming input data transmitted from a host to both the SLC block and the MLC block in response to a first program command, and invalidating the input data programmed in the SLC block at a time point when the program operation for the MLC block is completed, when the memory system is powered on after an SPO (Sudden Power-Off) occurred while the program operation was performed on both the SLC block and the MLC block, the controller may perform a recovery operation to the MLC block based on valid data programmed in the SLC block.

A transaction processing method includes: dividing a to-be-processed transaction obtained from a database into at least two subtransactions; dividing each subtransaction into N parts with an association relationship; processing the N parts of each subtransaction based on the association relationship, to obtain a processing result of a lastly executed part of the N parts; determining, upon detecting an abnormal subtransaction based on the processing result, a processing policy matching an abnormality reason of the abnormal subtransaction; and processing the abnormal subtransaction by using the processing policy, to obtain a final processing result of the to-be-processed transaction.

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.

An example operation may include one or more of receiving, from a blockchain peer node, a sequence of blocks stored in a hash-linked chain of blocks on a distributed ledger, where each block in the sequence of blocks includes a reduced-step hash of block content from a previous block in the sequence, performing an approximate hash verification on the reduced-step hashes stored among the sequence of blocks, and determining whether the sequence of blocks has been tampered with based on the approximate hash verification on the reduced-step hashes.

A data processing system comprising: a first information processing device and a second information processing device, the second information processing device including: a second memory; and a second processor coupled to the second memory and the second processor configured to: convert a first identifier included in a first processing request from the first information processing device into a reversibly convertible first conversion identifier in response to receiving the first processing request; transmit the first processing request including the converted first conversion identifier to another information processing system; reconvert, in response to receiving a first execution result of a process corresponding to the first processing request, the first conversion identifier included in the first execution result into the first identifier; and transmit the first execution result including the reconverted first identifier and the first conversion identifier to the first information processing device.

Embodiments of the present invention provide a system for calculating and executing data backup policies for a multi-tenant cluster storage. The system is configured for accessing one or more audit logs associated with one or more applications, where the one or more applications comprise one or more folders, accessing a footfall database to identify footfall data associated with the one or more applications, determining criticality of the one or more folders associated with the one or more applications based on the footfall data, determining a dynamic backup policy schedule for the one or more applications, storing the dynamic backup policy schedule in a backup policy database, based on the dynamic backup policy schedule, determining that at least one application of the one or more applications needs backup at a current time, and executing a backup policy and take a backup of the at least one application.