Abstract: Distributed computing systems and methods therefore may include one or more processors which maintain a propagatable partition tree, the propagatable partition tree including a plurality of nodes corresponding to a group of one or more processes, the propagatable partition tree determining the commit order between each of the plurality of nodes. A first processor may receive a plurality of write requests for a data item, store a timestamp for each write request of the plurality of write requests and metadata associated with each write request, determine a global order for the plurality of write requests, based on an index assigned to respective write requests of the plurality of write requests, and execute the plurality of write requests, according to the propagatable partition tree, based on the global order.

Abstract: A data migration method includes: obtaining, by a first node, a first route assignment table; receiving, by the first node, a first instruction; obtaining, by the first node by using the first route assignment table, a first partition identity (ID) based on a first primary key ID carried in the first instruction; determining, by the first node, a second node based on the first partition ID; and transmitting, by the first node, first data uniquely identified by the first primary key ID to the second node.

Abstract: Columnar storage provides many performance and space saving benefits for analytic workloads, but previous mechanisms for handling single row update transactions in column stores suffer from poor performance. A columnar data layout facilitates both low-latency random access capabilities together with high-throughput analytical access capabilities, simplifying Hadoop architectures for use cases involving real-time data. In disclosed embodiments, systems may perform read and scan features through which users may have consistent reads of the columnar storage at any given point in time. These scans (e.g., snapshots) allow for analytics to be performed on the data, consistent backups of the data, for incremental backups, perform cross-cluster synchronization, and/or for offline audit analysis.

Abstract: Embodiments of the invention are directed to a computer system comprising a memory communicatively coupled to a processor system. The processor system is operable to perform processor system operations that include accessing query information associated with a to-be-augmented information set (TBAIS) having a TBAIS format. Query information sequence vectors (QISV) are generated that represent the query information and the TBAIS. Unannotated data repository information sequence vectors (UDRSV) are accessed that represent unannotated data repository information having a plurality of information formats. Matching UDRSV are identified, where the matching UDRSV include the UDRSV that match the QISV. A response to the query information is generated based at least in part on the matching UDRSV.

Abstract: A computer implemented method includes identifying a query view of a target database system enabling access to a first source table stored in a first target table, executing a load program for a current version of a first source partition of the first source table, wherein executing the load program includes loading the first source partition in a second load target partition of the first target table, changing the query view to select records of the first target table, executing an update program for assigning records of the first replication target partition to the first load target partition, selecting a mode of operation for a replication program based on determining whether the execution of the update program is finished, executing the replication program in accordance with the selected mode of operation, and changing the query view to further select the records of the first replication target partition.

Abstract: A token transaction comprising a first token output, the first token output comprising a first token locking script and a first token amount, wherein the first token locking script comprises a variable component and a constant component, wherein the variable component comprises a first payment address, embedded in a payment template, and wherein the constant component comprises a token mechanics sub-component.

Abstract: The decentralized processing system can identify zero or more cryptographic commitments to update a state of the blockchain recorded on the blockchain. The system can receive an indication to update the state of the blockchain. In response, the system can transmit to a decentralized consensus network (DCN) instructions for the DCN to compute a subsequent state. The system can receive, from the DCN, a first cryptographic hash associated with a data structure which is determined based on the computed subsequent state. The system can receive, form an implementation keeper a series of data entries associated with the data structure. A second cryptographic hash can be computed for each of the series of data entries and the system can determine whether each second cryptographic hash matches the first cryptographic hash. The system can execute instructions contained within each of the series of data entries to evolve the state of the blockchain.

Abstract: An access service is positioned between a set of container groups and a SQL database service. Upon receipt, at the access service, of a REST request from any container group indicating that a SQL transaction should be started, an entry is created in a staging database, separate from the SQL database service, to track the SQL transaction. Multiple connections are allowed to be established from the container groups to the access service over which other REST requests from any container group are sent. The other REST requests include details of SQL operations to be performed as part of the SQL transaction. The details are cached in the staging database. Upon receiving a REST request from any container group indicating that the SQL transaction should be committed, a single connection is established between the access service and SQL database service to commit the transaction, including the details, as an atomic transaction.

Abstract: A computing system can initially receive client data of a client of the financial health service. Using the client data, the system generates an individualized action plan and a financial health score for the client. The system further receives, in real-time, financial update data indicating changes to a financial situation of the client. In response to receiving the financial update data, the system updates the individualized action plan and the financial health score for the client. Thereafter, the system may receive a financial health request from a transaction entity with which the client transacts, and based at least in part on the financial health request, the system can transmit the updated financial health score to the computing device of the transaction entity.

Abstract: A computer-implemented method may include a generating a semantic label based on a frequency of similar values in a data field; and profiling a data source; identifying, based on the profiling, critical data elements (CDEs) and non-CDEs within the data source; auto-persisting the CDEs; matching the CDEs together under the semantic label; establishing virtual objects for the non-CDEs; and joining the CDEs and the virtual objects.

Abstract: The subject technology initializes a statement for execution. The subject technology determines that the statement has been executing for longer than a minimum statement timeout. The subject technology periodically updates a read timestamp table with a new update timestamp for an entry corresponding to the statement. The subject technology determines whether the entry corresponding to the statement has been removed from the read timestamp table. The subject technology, in response to determining that the entry has not been removed from the read timestamp table, removes the entry from the read timestamp table. The subject technology provides a set of results from completing execution of the statement.

Abstract: Systems and methods for managing indexing and tagging datasets using a plurality of nodes are disclosed. For example, the system may include one or more memory units storing instructions and one or more processors configured to execute the instructions to perform operations. The operations may include receiving a dataset comprising a plurality of columns and applying a series of nodes to the dataset. Applying the series of nodes may compose applying a first node comprising a machine learning model to generate a first probability, appending a first tag based on the first probability, and selecting second nodes subsequent in the series based on the first probability. Applying the series may include iteratively applying the selected second nodes to generate second probabilities and second tags. The operations may include generating a data structure comprising the first and second probabilities and first and second tags. The operations may include outputting metadata.

Abstract: Actions are performed on data in databases of a multi-node system. Each node includes an indicia engine and each node has access to a respectively associated database. Each of the databases has a first subset of data that match each other and which are kept in synchronization with each other. At least one of the databases has a second subset of data that intentionally does not match a subset of data in at least one of the other databases and which is not kept in synchronization with the at least one of the other databases. In operation, each node receives a plurality of matching requests to perform an action on data in the database associated with each node. The indicia engine at each node computes, for each of the matching requests, indicia of results of the action performed on data in the database associated with each node.

Abstract: Distributed execution of transactions may be performed across shards of a scalable database table. Instructions to perform as part of a transaction with respect to one or more database tables may be received. The instructions may be evaluated with respect to metadata obtained for the database tables to determine an assignment distribution of computing resources of the database system to data that can satisfy the access request. The commit protocol for the transaction may be determined according to the assignment distribution of the computing resources. After a request to commit the transaction is received, the transaction may be committed according to the determined commit protocol.

Abstract: Various methods, systems, and use cases for a stable and automated transformation of a networked computing system are provided, to enable a transformation to the configuration of the computing system (e.g., software or firmware upgrade, hardware change, etc.). In an example, automated operations include: identifying a transformation to apply to a configuration of the computing system, for a transformation that affects a network service provided by the computing system; identifying operational conditions used to evaluate results of the transformation; attempting to apply the transformation, using a series of stages that have rollback positions when the identified operational conditions are not satisfied; and determining a successful or unsuccessful result of the attempt to apply the transformation. For an unsuccessful result, remediation may be performed to the configuration, with use of one or more rollback positions; for a successful result, a new restore state is established from the completion state.

Abstract: A data processing system for artificial intelligence-based setting of controls in an evaluation interface comprising a data store storing: a plurality of transactions; a plurality of completed evaluations, each completed evaluation including an indication of a transcript portion associated with an evaluation answer. The system determines a word or phrase common to a first set of transcript portions associated with the evaluation answer; creates a first set of auto answer parameters that includes the word or phrase; auto answers the question for a set of test transactions to generate an auto answer for each test transaction; and based on a determination that the first set of auto answer parameters auto answered the question with a threshold level of accuracy, configures an evaluation system to use the first set of auto answer parameters to preset an answer control in an evaluation operator interface.

Abstract: A system and method for inspecting encrypted disks for a cybersecurity object using a custom key are disclosed. The method includes detecting an encrypted disk in a cloud computing environment, the cloud computing environment including a security policy service; authorizing a key policy on the security policy service for a custom key of an inspector account, wherein the key policy is a policy authorized to decrypt the encrypted disk; generating a second encrypted disk based on the encrypted disk; inspecting the second encrypted disk for a cybersecurity object with the custom key; and releasing a resource allocated to the second encrypted disk in response to completing the inspection.

Abstract: Arrangements for an intelligent client copy tool are provided. In a client copy procedure, access to a target client may be locked and all target data associated with the target client may be deleted. A before trigger for execution before a modifying operation on a database table may be defined. The trigger may be executed and, based on the trigger identifying a query associated with the modifying operation, access to the database table may be locked and an insert operation may be executed. Then, the trigger may be deleted. Thereafter, the modifying operation on the target client may be performed and access to the database table unlocked. A database view of the database table, including pointers to the source client, may be generated. Nonstatic data may be copied from the source client to the target client using the insert operation. After the copying, the target client may be unlocked.

Abstract: A system and method for managing an electronic contract for hybrid runtime execution, which includes a contract execution service that comprises an internal runtime environment and a set of integrations to external resources with at least one integration to an on-chain runtime, wherein the contract execution service comprises configuration to: establish the electronic contract, wherein the electronic contract comprises a set of executable programmable components and a set of natural language components; change the state of the electronic contract and generate a contract event; and in response to the contract event: extend execution of the electronic contract to an on-chain environment, when the contract event includes an associated on-chain integration; and extend execution of the electronic contract to an external application resource, when the contract event includes an associated external service integration.

Abstract: Methods, computer systems, and memory media for preparing instructions for printing a plurality of postage items. A graphical user interface (GUI) receives first user input. Responsive to the user input, an addressee data file is uploaded, features are extracted from a plurality of columns of the addressee data file, and the plurality of columns are associated with respective address field types based on the extracted features. The GUI displays an indication of the association between columns and address field types. User input may modify or correct the association. Responsive to second user input, instructions are prepared for printing entries from the columns of the addressee data file on respective postage items of the plurality of postage items as respective address fields, and the instructions are stored in a non-transitory computer-readable memory medium.

Abstract: Systems and methods for monitoring and adapting an edge network is provided. The system can include a plurality of user devices connected to a communications network and configured to capture input data and/or generate device data which can be transmitted to a data lake for storage and processing. A network monitoring station can leverage the data in the data lake to generate business intelligence to determine whether there is an issue within the system, for instance with respect to a user device or any other component of the network. Subsequently, an adaptive action can be triggered in response to a determination that an issue exists within the system.

Abstract: This invention is a system and method for allocating and monetizing resources on a 5G infrastructure. A service manager module receiving a slice request from a client. A real-time analytics engine gauges the optimum resource path which then then requested from a resource manager. A slice offer for the resource is made to the client which is accepted. The service manager module sends a post to a distributed ledger, the post comprising a client identification, a slice identification, a provider identification, a service request, a QOS parameter, a transaction identification, a cost of service and a timestamp. Scripting software running on top of the ledger platform automatically transacts payment for the resource from the client to the provider.

Abstract: A method for accessing a database that is stored in a storage system, the method includes: (a) receiving a request to obtain a database entity (DE) of a requested version line out of multiple version lines that differ from each other by one or more transactions; (b) obtaining, for each DE portion out of multiple DE portions of the DE, content of the DE portion as written during a transaction of the requested version line that was a last transaction of the requested version line that wrote the DE portion to the database; wherein the obtaining includes (i) using first metadata that is indicative of transactions of the requested version line, and (ii) using second metadata that is indicative of which transactions were involved in writing to a logical address range that is associated with the DE portion; and (d) sending a response to the request, wherein the response comprises, for each DE portion of the DE portions, the obtained content.

Abstract: Embodiments of the present disclosure provide a method, apparatus, device and storage medium for data processing. If a kernel module sends a data calling request to a userspace process, first modification time information and second modification time information of data corresponding to the data calling request are obtained by the userspace process. The first and second modification time information are used to indicate modification time information of the data in the kernel module and in a file service end, respectively. The first and second modification time information are compared by the userspace process. If the first and second modification time information are inconsistent, a verification invalidation result is returned to the kernel module. The data in the kernel module is invalidated by the kernel module according to the verification invalidation result. The data in the file service is synchronized by the userspace process to the kernel module.

Abstract: Disclosed are systems, methods, and non-transitory computer-readable media for an improved database management system that provides database transactions on a non-transactional database. The database management system executes garbage collection on data stored in a database to remove data values written to the database as part of uncommitted transactions. Each uncommitted transaction is associated with a respective transaction identifier that is not included in a list of committed transaction identifiers. The list of committed transaction identifiers lists, in sequential order, transaction identifiers for committed transaction. After removing each data value written to the database as part of an uncommitted transaction, the database management system modifies the list of committed transaction identifiers to include the transaction identifier for the uncommitted transaction.

Abstract: The present disclosure relates to systems, methods, and computer-readable media for utilizing a content access authorization system to determine user access control efficiently and flexibly for digital documents that are stored in different geographic regions. For instance, the content access authorization system can convert sensitive user information for digital documents stored in a first geographic region into a probabilistic data structure that does not include user information and share the probabilistic data structure with a second geographic region. The content access authorization system can then utilize the probabilistic data structure to efficiently pre-filter user document access control for digital documents requested by a user in the second geographic region that are stored in the first geographic region, which significantly saves on latency and computing resource usage by reducing the number of document control access queries needed to be made to the first geographic region.

Abstract: Techniques are described herein that are capable of updating a state of a client device using a limited event size protocol. An initial state of the client device is stored. The initial state is defined by first records that identify first respective binaries associated with the client device at a first time. A first event of multiple events, which are configured in accordance with the limited event size protocol, is received from the client device. Each event includes a respective subset of second records, which identify respective second binaries associated with the client device at a second time. The first event is parsed to identify a first subset of the second records that is included in the first event. An updated state of the client device is generated by replacing a first portion of the first records with the first subset of the second records.

Abstract: Methods, systems, and computer-readable media for delivery of log records to stateless clients are disclosed. A record delivery system receives, from a client, a first request to read from a persistent log comprising an ordered sequence of records. The first request is associated with a receiver session. The system sends a first set of records to the client and stores a data structure indicating that the first set of records was sent to the client in the receiver session. The system receives, from the client, a second request to read from the persistent log in the receiver session. Based at least in part on the data structure, the system determines a second set of one or more records in the persistent log. The system sends the second set of records to the client.

Abstract: Sequential consistency across a distributed cloud computing network is described. A database includes a primary database and multiple read replica databases. Write queries are transmitted to the primary database, and commit tokens are provided to the read replica databases and the clients. Commit tokens are included in requests from clients. If a request for a read operation received at a read replica database does not include a token that is later than a commit token of the most recent update to the read replica database, the read replica database performs the read operation. If a request for a read operation received at a read replica database includes a token that is later than a commit token of the most recent update to the read replica database, the read replica database delays servicing the read update until it receives an update from the primary database with an updated commit token.

Abstract: This application discloses a method. A database access scheduling module (331 to 333) establishes a communication connection to a database access service engine (121 to 123) using an identifier of the database access service engine (121 to 123). The database access scheduling module (331 to 333) receives an access request sent by the database access service engine (121 to 123), where the access request carries an identifier of a database instance (371 to 375). The database access scheduling module (331 to 333) sends the access request to the database instance (371 to 375). In this way, the database access service engine (121 to 123) may send the access request to the database instance through the database access scheduling module (331 to 333) based on the communication connection actively established by the database access scheduling module (331 to 333) to the database access service engine (121 to 123).

Abstract: A method for extending a blockchain comprises, at a space server: allocating an amount of drive storage for generating proofs-of-space; or accessing a first challenge based on a prior block of the blockchain, the prior block comprising a first proof-of-space and a first proof-of-time; in response to accessing the first challenge, generating a second proof-of-space based on the first challenge and the amount of drive storage, the second proof-of-space indicating allocation of the amount of drive storage; accessing a second proof-of-time based on the prior block and indicating a first time delay elapsed after extension of the blockchain with the prior block; generating a new block comprising the second proof-of-space and the second proof-of-time; and broadcasting the new block over a distributed network.

Abstract: Systems and methods are described herein for novel uses and/or improvements to data aggregation related to artificial intelligence applications, specifically applications related to aggregating time-series data. As one example, systems and methods are described herein for predicting effects when aggregating time-series data and modifying the one or more data streams used to populate a model profile and/or feed an artificial intelligence application with the time-series data.

Abstract: System and method for managing different classes of storage input/output (I/O) requests for a two-phase commit operation in a distributed storage system assigns reserved log sequence values to each of storage I/O requests of a first class, which are added to a two-phase commit queue. The reserved log sequence values of the storage I/O requests of the first class in the two-phase commit queue are assigned to some of the storage I/O requests of the second class, which are added to the two-phase commit queue.

Abstract: The platforms, systems and methods provided herein may provide a data-driven workflow platform. The method comprises: mapping selected data objects to a data storage model of the data-driven workflow platform, where the selected data objects are stored in a data cloud configuration that is operatively coupled to the data-driven workflow platform; and displaying, on a graphical user interface (GUI), a flow for building a cloud application utilizing or managing the selected data objects. The interactive flow comprises at least one graphical element corresponding to a rule for automating an action triggered by a triggering event of the selected data objects.

Abstract: An example operation may include one or more of detecting, by a blockchain (BC) node, a contract update on a blockchain, determining, by the BC node, at least one charge affected by the contract update, executing, by the BC node, a smart contract to re-generate an invoice based on the at least one charge, and recording the invoice on a ledger of the blockchain.

Abstract: A method comprises receiving at one or more cloud storage nodes a data block to be validated in connection with adding the data block to a digital ledger. The data block is received from a party storage node corresponding to a party of a plurality of parties that are members of a blockchain computing environment. The party storage node executes a first portion of a validation operation for the data block. The one or more cloud storage nodes execute a second portion of the validation operation for the data block. In the method, the data block is added to the digital ledger responsive to validating the data block, and at least a portion of the digital ledger is stored in the one or more cloud storage nodes.

Abstract: Computer-readable media, methods, and systems are disclosed for copying tenant data within a cloud-based microservice architecture including a Kubernetes cluster. Copy tasks are generated for a plurality of microservices and progress of the copy tasks is monitored by updating one or more statuses associated with the copy tasks. One or more job files may be generated for each microservice including executable code for copying the tenant data within the microservice or within a data store associated with the respective microservice.

Abstract: Techniques are disclosed for tuning external invocations utilizing weight-based parameter resampling. In one example, a computer system determines a plurality of samples, each sample being associated with a parameter value of a plurality of potential parameter values of a particular parameter. The computer system assigns weights to each of the parameter values, and then selects a first sample for processing via a first external invocation based on a weight of the parameter value of the first sample. The computer system then determines feedback data associated with a level of performance of the first external invocation. The computer system adjusts the weights of the parameter values of the particular parameter based on the feedback data. The computer system then selects a second sample of the plurality of samples to be processed via execution of a second external invocation based on the adjustment of weights of the parameter values.

Abstract: A method is described. The method includes queuing an entry in a queue that identifies an inode that has been changed in an active storage system. The entry further describes a time in the future. The method includes processing the entry upon the time in the future being reached. The processing of the entry includes comparing respective content values maintained for different regions of the inode within the active storage system and a replicate storage system. The method further includes comparing content of those of the regions having different content values as between the active storage system and the replicate storage system. The method further includes updating those regions in the replicate storage system to reflect those regions within the active storage system based on the comparing, and, updating the respective content values of those regions in the replicate storage system.

Abstract: Techniques are disclosed relating to a database system includes worker nodes operable to perform transactions and director nodes operable to ensure transactional consistency for the transactions. A worker node may receive a request to perform a transaction involving writing a record. The worker node may then issue, to director nodes of the database system, a request for information that facilitates performance of an operation for the transaction. A director node may determine whether to approve the request based on whether the operation could cause transactional inconsistency in the database system. The worker node may proceed to perform the operation for the transaction in response to receiving approval responses from a majority of the director nodes, with none of the received responses indicating a disapproval of the transaction.

Abstract: A method and apparatus for block propagation in a blockchain platform. Where multiple nodes establish a peer through a peer-to-peer network and maintain the same blockchain, a node stores information of a first peer transmitted a first forwarding message in a first storage when receiving, from the first peer, which is a node on the network, the first forwarding message including a first portion associated with a block. The node transmits a second forwarding message including the first portion to a second peer that is a node on the network. The node transmits a first request message to the first peer based on information in the first storage, the first request message requesting a second portion associated with the block and corresponding to the first portion. The node receives a third forwarding message including the second portion corresponding to the first request message from the first peer.

Abstract: Blockchain systems operate over a network of computing devices. Proof-of-space blockchain consensus systems utilize data (called plots) stored in storage devices across the computing devices within the network. These storage devices are utilized to generate and store proof-of-space consensus data. This data is then accessed at a later time to respond to challenges issued across the blockchain network. The owner of a plot may wish to sell a plot to another miner. If the seller is a bad-faith actor, they may retain copies of the secret key(s) and use them to continue mining the plot along with the buyer. To prevent these attacks, it may be desirable to submit a challenge response block where the proof-of-space is not visible as part of the challenge response. This may be done by replacing the proof-of-space with a proof-of-knowledge.

Abstract: This disclosure relates to techniques for performing conditional handovers and cell re-selections along known routes. A cellular base station may select a conditional handover set for a wireless device. The conditional handover set may include information for multiple conditional handovers. The wireless device may receive the conditional handover set. The wireless device may perform conditional handover to at least a first cell indicated in the conditional handover set based at least in part on the conditional handover set.

Abstract: Herein are multitenant database security techniques for fine-grained and dynamic access control of protected resources according to phases and roles. In an embodiment, a computer associates a process with a particular pluggable database of many pluggable databases in a container database in a database management system (DBMS). From the process, a request is received to access a protected resource that the particular pluggable database does not contain. Based on the protected resource and the particular pluggable database, the DBMS dynamically decides, in response to receiving the request, whether to permit access to the protected resource. Based on authorization by the DBMS, the protected resource is accessed to fulfil the request. In an embodiment, centrally managed policy decisions for restricted access are dynamically employed across a fleet of databases through a global policy manager.

Abstract: Example aspects include techniques for anomaly detection via sparse judgmental samples. These techniques may include generating a qualified timestamp corresponding to execution of a first operation of a first transaction over a database and determining, based on the qualified timestamp, that a row of a table is not locked by a second operation of a second transaction over the database. In addition, the techniques may include determining that the row meets a condition of the first operation. Further, the techniques may include updating, based on the qualified timestamp, the row in response to the row meeting the condition, the updating including acquiring a lock on the row of the table.

Abstract: Methods, systems, and computer-readable media are described in which WAL records are replayed serially at the database sub-object level, thereby enabling parallelism for processes affecting a single database object without interfering with the consistency required to maintain ROS capability. WAL records are replayed serially at the B-Tree branch level, instead of existing approaches which serialize WAL record replay at the object or block level. Described examples may thereby enable multi-block operations (e.g., SPLIT) within the same B-Tree branch to be replayed in the correct sequence, thereby maintaining consistent reads during ROS. Multi-level dispatching at the object and sub-object levels may be used to minimize delays caused by operations affecting multiple branches of a database object.

Abstract: There is provided a semiconductor apparatus including a first high-speed communication controller and a second high-speed communication controller that perform high-speed communication; a first high-speed communication terminal group that includes a first high-speed communication terminal for inputting a first signal; a second high-speed communication terminal group that includes a second high-speed communication terminal for inputting a second signal; and a terminal mounting surface, in which the terminal mounting surface includes a first side and a second side, a shortest distance from the first high-speed communication terminal group to the first side is shorter than a shortest distance from the second high-speed communication terminal group to the first side, and a shortest distance from the second high-speed communication terminal group to the second side is shorter than a shortest distance from the first high-speed communication terminal group to the second side.

Abstract: A system and its methods are described for implementing meta-transactional interactions across one or more decentralized computing networks (“blockchains”) with a managed (“custodial”) wallet, satisfying an important need of lowering the barrier of entry for interacting with smart contracts across multiple blockchain networks. First, the method of encoding and storing a transactional request created by a user's managed account, representing an intention to broadcast the invocation of a specific function of a specific smart contract on one or more peer nodes of a specific blockchain. Then, calculating a cost for processing the encoded transaction within the specific blockchain via analysis including the value and type of cryptocurrency, complexity of transaction, historical trend of transaction fees, and analyses to eliminate the chance of loss due to insufficient transaction fees. Next, obtaining a payment from the user for the transfer of the amount to successfully process their queued transaction.

Abstract: A distributed database system receives and executes a transaction including a first modification statement describing a first modification operation on a subset of records, a second modification statement describing a second modification operation on the subset of records, and a commit statement. Responsive to executing the first and second modification statements, the system receives a copy of the subset of records from data servers; performs the first modification operation to generate a first modified subset of records; and performs the second modification operation on the first modified subset of records. Responsive to executing the commit statement, the system stores the second modified subset of records in a commit table and causes the subset of records to be updated at the data servers.

Abstract: With a forever incremental snapshot configuration and a typical caching policy (e.g., least recently used), a storage appliance may evict stable data blocks of an older snapshot, perhaps unchanged data blocks of the snapshot baseline. If stable data blocks have been evicted, restore of a recent snapshot will suffer the time penalty of downloading the stable blocks for restoring the recent snapshot. Creating synthetic baseline snapshots and refreshing eviction data of stable data blocks can avoid eviction of stable data blocks and reduce the risk of violating a recovery time objective.