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.

Abstract: Systems and methods for streaming data in a legacy mainframe environment. In some embodiments, the method includes receiving, at a KAFKA streaming platform abstraction layer interface, production data from a first publisher application; selecting a producer instance to receive the production data; and configuring the selected producer instance with a first set of configuration parameters from at least one producer library. The method may further include communicating the first publication data to the selected producer instance; and forwarding the first publication data to a KAFKA streaming platform cluster in operable communication with a consumer instance.

Abstract: A system that uses one or more artificial intelligence models that predict an effect of a predicted event on a current state of the system. For example, the model may predict how a rate of change in time-series data may be altered throughout the first time period based on the predicted event.

Abstract: Methods and systems for managing, storing, and serving data within a virtualized environment are described. In some embodiments, a data management system may manage the extraction and storage of virtual machine snapshots, provide near instantaneous restoration of a virtual machine or one or more files located on the virtual machine, and enable secondary workloads to directly use the data management system as a primary storage target to read or modify past versions of data. The data management system may allow a virtual machine snapshot of a virtual machine stored within the system to be directly mounted to enable substantially instantaneous virtual machine recovery of the virtual machine.

Abstract: Systems and methods for authorizing a source for virtual certification number (VCN) use include receiving a VCN use request from an external entity, the VCN use request including the VCN and transaction data associated with the VCN use request, determining that a VCN binding for the VCN is a strict binding, mapping the transaction data to a transaction source having a transaction source identifier based on the VCN binding being the strict binding, determining a VCN source identifier for the source associated with the VCN, based on a registration authentication of the VCN with the source, comparing the VCN source identifier to the transaction source identifier, determining that the VCN source identifier corresponds to the transaction source identifier based on comparing the VCN source identifier to the transaction source identifier, outputting an approved authorization indicating that the VCN is associated with the source and the source is the transaction source.

Abstract: Computer-readable media, methods, and systems are disclosed for utilizing partition-based locking mechanisms to improve execution of overlapping data definition language (DDL) and data manipulation language (DML) operations on a partitioned database table. A first node receives a DML statement associated with a first transaction. The first node acquires a intent exclusive lock on table metadata. A second node receives a DDL statement associated with a second transaction and acquires an exclusive metadata lock on the partitioned table metadata. Next, an intent exclusive lock is acquired for the relevant partition table data on the second node and an exclusive lock on table metadata on the second node. The second transaction waits for the DML operation of the first transaction to complete. Then the first transaction is committed. Finally exclusive locks are acquired on table data and metadata and the second transaction is executed and committed.

Abstract: A method for the automatic generation of a data model from an SQL statement includes receiving a single SQL statement in a user interface to a data analytics application, parsing the single SQL statement and extracting from the SQL statement different table references. The method also includes, for each one of the table references, directing a selection of all fields available in a corresponding table and storing the available fields in a collection of fields implicated by each table referenced by the table references. Finally, the method includes generating a data model with the fields in the collection of fields and displaying a view of the data model in a user interface of the data analytics application.

Abstract: Various systems and methods of establishing and utilizing device management (DM) services in Internet of Things (IoT) networks and similar distributed network architectures, are described. In an example, RESTful messaging within IoT operational and resource models are used to establish, instantiate, and operate DM services having various roles within an IoT framework abstraction.

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: Various examples of the disclosure generally pertain to storing, in a distributed ledger and in association with one or more transactions, one or more identifiers of owners of respective smart contracts. Various examples of the disclosure relate to deleting transactions associated with a given party as owner upon receiving a withdrawal request of the given party.

Abstract: A method includes receiving a series of writes that each requests respective data to be stored at a database. For each respective write, the method includes storing the respective data in a first buffer associated with a first data streaming application and a second buffer associated with a second data streaming application. The method includes transmitting the respective data to the database. The method includes receiving, from the database, confirmation that the respective data of the respective write has been committed to the database. The confirmation includes an order indicator indicating an order the respective data of the respective write was committed to the database relative to other writes in the series of writes. In response to receiving the confirmation, the method includes sending the respective data from the first buffer to the first data streaming application and from the second buffer to the second data streaming application.

Abstract: The subject technology receives, at a first execution node, a first transaction, the first transaction to be executed on linearizable storage. The subject technology determines whether the first execution node corresponds to a rank indicating a leader worker. The subject technology, in response to the first execution node corresponding to the rank indicating the leader worker, performs, by the first execution node, an initialization process for executing the first transaction. The subject technology broadcasts a first read timestamp associated with the first transaction to a set of execution nodes, the set of execution nodes being different than the first execution node. The subject technology executes, by the first execution node, at least a first operation from the first transaction.

Abstract: Techniques for cloning, writing to, and reading from file system metadata. Cloning involves identifying a first set of pointers included h a first root node in a file system metadata tree structure that stores file system metadata n leaf nodes of the tree structure, creating a first copy of the first root node that includes the first set of pointers, creating a second copy of the first root node that includes the first set of pointers, associating the first copy with a first view, and associating the second copy with a second view. Reading generally involves traversing the tree structure towards a target leaf node that contains data to be read. Writing generally involves traversing the tree structure in the same manner, but also creating copies of any nodes to be modified if those nodes are deemed to have a different treeID than a particular root node.

Abstract: A blockchain based system for managing credentials in batch with selective attributes disclosing/hiding capability and auditable Merkle tree are disclosed with include a SmartCert unit coupled to a blockchain ecosystem and a public key infrastructure (PKI); the SmartCert unit further includes an issuer SmartCert and SmartCert verifier interface so that the holder can select to hide optional components completely from the verifier; and the verifier can check the certificate using the auditable Merkle tree.

Abstract: Devices, methods, and systems that provide transmitting of messages between different units of a multi-unit system in response to instantiated multi-unit transactions. For example, a method may include: identifying, by a first unit of a multi-unit system of computing devices, an event has occurred that triggers initiation of a transaction; generating, by the first unit, a transaction identifier associated with the transaction, the transaction identifier comprising a unit identifier of the first unit and an application identifier of an application associated with the event; and transmitting, from the first unit and to a second unit of the multi-unit system, the transaction identifier as part of an inter-unit message.

Abstract: A computing system obtains a first preconfigured feature set. The first preconfigured feature set defines: a first feature definition defining an input variable, and first computer instructions for locating first data. The first data is available for retrieval because it is stored, or set-up to arrive, in the feature storage according to the first preconfigured feature set. The computing system receives a requested data set for the input variable. The computing system generates an availability status indicating whether the request data set is available for retrieval according to the first preconfigured feature set. Based on the availability status, generating, by the computing system, the requested data set by: retrieving historical data for the first preconfigured feature set; retrieving a data definition associated with the historical data; and generating the requested data based on the historical data and the data definition.

Abstract: Systems and methods may use one or more artificial intelligence models that predict an effect of a predicted event on a current state of the system. The systems and methods may use one or more artificial intelligence models that predict an effect and/or occurrence of a predicted event based on the current state of the system. In order to generate responses that are both timely and pertinent (e.g., in a dynamic fashion), the system must determine, both quickly (i.e., in real-time or near real-time) and accurately, the predicted event.

Abstract: A method for a server to manage data in a peer-to-peer blockchain network is described herein. The method includes generating, by a multi-tenant web server, an exchange object for the peer-to-peer blockchain network, wherein the exchange object includes a set of exchange fields and a mapping between each exchange field in the set of exchange fields and a field of a physical object associated with each peer in the peer-to-peer blockchain network; generating, by the multi-tenant web server, a transaction object based on the exchange object, wherein the transaction object includes the set of exchange fields and proposes an alternation to a physical object; and making, by the multi-tenant web server, the transaction object available to the peers in the peer-to-peer blockchain network to attempt to obtain consensus for the alteration.

Abstract: Examples include a blockchain system associated with a distributed file system, Some examples include retrieval, from the blockchain system, a latest block corresponding to a block signature of a reference block that corresponds to a file stored in the distributed file system. The latest block includes information identifying at least one of a latest location of the file, a signature of metadata of the file, or a tag associated with the file.

Abstract: A method for resumeable snapshot deletion is provided. A method for deletion of nodes maintained in an ordered data structure for a first snapshot includes processing the nodes maintained in the ordered data structure according to a defined order, setting a node path cursor with a pointer to a node and an indication of the deletion of the node; storing the node path cursor in a persistent storage; and during processing of the nodes: detecting a failure; after the failure, checking the pointer of the node path cursor; and resuming processing of the nodes starting from the first node indicated by the pointer.

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 system can use non-volatile solid state drives (SSDs) to provide storage. The SSDs can implement internal log structured systems (LSSs). A reversible write operation can be serviced by an SSD to write first data to an SSD logical address. The reversible write operation can update the SSD logical address to store the first data rather than old data stored at the SSD logical address prior to servicing the reversible write operation. The old data can be stored at an SSD physical address and mapping information indicates the SSD logical address is mapped to the SSD physical address. Servicing the reversible write operation can include: retaining the mapping information and the old data; and adding second mapping information that maps the SSD logical address to a second SSD physical address storing the first data. A subsequent read operation can read the old data using the retained mapping information.

Abstract: Provided is a method of searching for an app name in a user terminal. The user terminal requests a download of an app from an app storage server. The user terminal transmits a language set in the user terminal and an app name of the app to an app name processing server. The app name processing server acquires a word in the set language corresponding to the app name through a machine learning technique, and stores the acquired word in an app search database (DB) connected in the user terminal.

Abstract: An example operation may include one or more of receiving an example in a blockchain network, distributing the example to a plurality of endorsing peers of the blockchain network, performing, by one or more of the endorsing peers, automated analysis of the example to determine an inference for the example, determining if there is a consensus of inference amongst the plurality of endorsing peers, and committing the example to a blockchain of the blockchain network when there is a consensus of inference.

Abstract: An example operation may include one or more of receiving, by a risk score module, a blockchain transaction proposal, obtaining transaction proposal data, obtaining external data, computing a risk score from the transaction proposal data and the external data, comparing the risk score to a risk score threshold, providing a commitment decision, based on the comparison, and one of committing or rejecting an endorsed transaction corresponding to the transaction proposal.

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: A method, an apparatus, a device and a medium for performing a review based on a blockchain are provided. When performed by a reviewing party, the method includes: determining a review conclusion and anonymous identity data of the reviewing party, in response to a review request of a to-be-reviewed party acquired from a review organization party; and generating a chaining transaction request including the review conclusion and the anonymous identity data, to write the review conclusion and the anonymous identity data into a blockchain.

Abstract: Systems, computer program products, and methods are described herein for dynamically propagating data from a database to a cache. The present invention may be configured to receive metadata associated with updates to data records of a database, obtain, from the database and based on the metadata, the data records that have been updated, and provide the data records that have been updated to a cache. The present invention may be configured to receive, from applications, calls for the data records, obtain, from the cache and based on receiving the calls, the data records, and provide, to the applications, the data records. In some embodiments, the present invention may be configured to monitor the database and generate the metadata associated with the updates to the data records.

Abstract: A B+ tree access method, apparatus, and a medium include: when a B+ tree creation instruction is acquired, determining whether there is an idle underlying tree file mapped to a Dynamic Random Access Memory (DRAM); if YES, storing underlying data of a B+ tree in the underlying tree file; if NO, creating a new target underlying tree file, and mapping the target underlying tree file to the DRAM, so as to store the underlying data of the B+ tree in the target underlying tree file; and when a number of layers of the B+ tree is greater than or equal to a preset threshold, storing, in a preset storage area, data of a layer numbered to be greater than or equal to the preset threshold in the B+ tree. Based on a data structure of the B+ tree, data needs to be accessed from the underlying data whenever read.

Abstract: The method of this disclosure includes identifying a hot area in an index tree where an index split of the index tree has occurred due to a previous data insertion into a database based on historical statistic information on the index split. The method of this disclosure may further include predicting boundary key values of one or more new index pages to be inserted into the index tree for a next data insertion into the database based on a distribution of the hot area in the index tree. The method of this disclosure may further include inserting the one or more new index pages into the index tree based on the predicted boundary key values prior to the next data insertion.

Abstract: A consistency verification system that verifies data consistency in a content item management system. The system maintains a plurality of verifiers for checking data consistency, each verifier comprising instructions for verifying consistency for a type of requests. The system may verify the original request by selecting a verifier from the plurality of verifiers based on a type of the original request. Using the selected verifier, the consistency verification system may send verification requests to the content item management system at a second timestamp that is a period of time after the original timestamp. The system may determine whether the second response is consistent with the first response. If the responses are not consistent, the system may output information describing data inconsistency. If the responses are consistent, the system may output results and perform further verifications to help ensure data accuracy.

Abstract: A processor may record one or more transaction proposals regardless of validity of the one or more transaction proposals. The processor may separate a transaction validation into a series of steps. The processor may validate, asynchronously, one or more transactions respectively associated with each of the one or more transaction proposals based on the transaction validation.

Abstract: A method for receiving an app-use contextual data set, applies artificial intelligence style machine logic to the app-use contextual data in order to generate a recommendation that the app should be subject to a recommended revision, in response to the generation of the recommended revision, makes the recommended revision in a dynamic manner, stores the app-use contextual data set in the form of a plurality of blockchain data structures, and operates around contextual reset/roll-back/restore scenarios in a hybrid cloud environment.

Abstract: Systems and methods for writing updates to and/or reading previously stored updates of assets that are implemented as smart contracts on a decentralized database are disclosed. Exemplary implementations may: receive a first request, from a first client computing device associated with a first user, to write a first update to an individual asset, or to read one or more previously stored updates; transfer the first request to the decentralized database; responsive to transferring the first request, receive the first reference from the decentralized database; generate a second file and a second reference; store the second file on the content-addressable file system; and record the second reference in the state of the individual asset on the decentralized database.

Abstract: Techniques are disclosed relating to improving the reliable of a computing network. A first computing device receives changing states of a data object to send to a second computing device via a network interface. The first computing device sends, to the second computing device, a baseline packet having a complete one of the states of the data object. The first computing device sends, to the second computing device, a sequence of update packets corresponding to the changing states of the data object. An update packet in the sequence includes sufficient information to update a stored state of the data object at the second computing device to a current state of the data object responsive to the stored state being one of two or more previous ones of the states.

Abstract: Techniques for determining a chronological order of transactions executed in relation to an object stored in a storage system are disclosed. A transaction history, stored in association with an object, includes information identifying transactions executed in relation to the object. A transaction history manager obtains information describing a state machine from a data repository. The state machine defines a finite set of states that may be assumed by objects stored in the storage system. The state machine specifies transaction types that may be executed from each state. Based on the state machine, the messaging service determines a sequence of states assumed by the object. The messaging service determines a particular transaction that is executable from each state assumed by the object. Hence, the messaging service determines a chronological order of the transactions stored in the transaction history.

Abstract: A new approach is proposed that contemplates systems and methods to support distributed electronic payment processing based on a hierarchical payment graph. Specifically, a distributed electronic payment system comprising a plurality of distributed payment engines/processors. Upon receiving an electronic payment request from a client device, each distributed payment engine of the distributed electronic payment system is configured to handle one stage of the electronic payment processing lifecycle by traversing states and edges in a portion of the hierarchical payment graph assigned to the distributed payment engine.

Abstract: Methods, systems, and apparatus, including computer-readable media, for a hierarchical multi-tenant data access platforms. In some implementations, the a server system stores data collected through a multi-tenant data access platform configured to collect data for each of multiple tenant organizations and to selectively make the collected data available according to policies associated with the respective tenant organizations. The server system receives a request associated with a user, and the server system generates and provides a response according to the organization hierarchy data and policy data for the unit of the organization that has data that would be used in generating the response to the request.

Abstract: The systems and methods may use one or more artificial intelligence models that predict an effect of a predicted event on a current state of the system. For example, the model may predict how a rate of change in time-series data may be altered throughout the first time period based on the predicted event.

Abstract: Techniques and methods are disclosed for providing improved and consistent navigation within a mobile shopping application. A default graphical user interface may be provided at a display of a user device. In response to a navigation request at the default graphical user interface, the application can enter a store mode for a separate specialty store within the application. While in the store mode, the application can present a subsequent graphical user interface that overlays the default graphical user interface. The subsequent graphical user interface can be configured using data conforming to a graphical interface specification. The graphical interface specification may also include rules for determining which navigation requests properly enter and leave the store mode.

Abstract: A reliable network function virtualization (rVNF) system includes a virtualized network function (VNF) application instance that includes a plurality of physical VNF instances. A load balancer provides an interface between a client and the VNF application instance. A load balancer interface facilitates delivery of packets related to a particular user context to the same physical VNF instance. A communication interface facilitates communication between the client and the VNF application instance. Application storage stores session data associated with the VNF application instance.

Abstract: A distributed database system executes transactions on a distributed database. A received transaction includes statements describing modifications of records stored in the distributed database. The distributed database system executes the transaction at a query server by obtaining copies of records corresponding to the statements of the transaction and performing the modifications specified by the statements of the transaction on the record copies. The distributed database system stores the modified record copies at the query server during execution of the transaction. After the transaction has successfully been executed at the query server, the distributed database system attempts to perform a commit process to update the records stored in the distributed database based on the modified record copies.

Abstract: A method may include responding to a transaction by sending, to a first data partition participating in the transaction, a first request to set a first transaction control block at the first data partition to a preparing state. In response to the transaction affecting multiple data partitions, a second request to set a second transaction control block at a second data partition to the preparing state may be sent to the second data partition. A third request to add the first data partition and the second data partition as participants of the transaction may be sent to the transaction coordinator. The transaction coordinator may determine, based on a first response of the first data partition and a second response of the second data partition, an outcome of the transaction. The transaction may be rolled back if the first response and/or the second response indicate an inability to commit the transaction.

Abstract: Aspects of the present disclosure provide for operations for a tree data structure that provides order-based node traversal. For some embodiments, the tree data structure stores one or more key-value pairs, implements at least one linked-list data structure, and enables traversal of nodes within the tree data structure based on a key order (e.g., forward or reverse key order).

Abstract: Embodiments for retention locking a deduplicated file stored in cloud storage by defining object metadata for each object of the file, and comprising a lock count and a retention time based on an expiry date of the lock, with each object having segments, the object metadata further having a respective expiry date and lock count for each segment, where at least some segments are shared among two or more files. Also updating the lock count and retention time for all segments of the file being locked; and if the object is not already locked, locking the object using a retention lock defining a retention time and updating the object metadata with a new lock count and the retention time, otherwise incrementing the lock count and updating the retention time for the expiry date if expiry date of a previous lock is older than a current expiry date.

Abstract: Log processing provides a status message of a storage node cluster is obtained by a first node. The status message marks a master storage node of the storage node cluster. The first node can send a first write operation request to the master storage node based on the status message so that the master storage node agrees on a first write operation after agreeing on a received log with a slave storage node in the storage node cluster. The first node receives a feedback message sent after the master storage node agrees on the first write operation with the slave storage node in the storage node cluster. The feedback message includes identification information and a response to the first write operation request. The first node can send to the master storage node a target message including a current iteration identifier, and the master storage node can use the current iteration identifier to determine whether the target message is from a latest master compute node.

Abstract: Methods for snapshot isolation query transactions in distributed systems are performed by systems and devices. Distributed executions of queries are performed in a processing system according to an isolation level protocol for data management and data versioning across one or more data sets, one or more compute pools, etc., within a logical server via a single transaction manager that oversees the isolation semantics and data versioning. Read transactions of queries are performed lock-free via the isolation semantics, and instant rollbacks, point-in-time queries, single-phase commits in the distributed systems are also provided. Abort and cleanup operations are performed based on a distributed abort protocol and a determined oldest active transaction for the system in which the single transaction manager does not track read-only transactions, and client nodes do not maintain commit tables for transactions.

Abstract: Data on entities and how they are associated with other entities may be aggregated from multiple sources and reconciled. The aggregated data may be presented in a dashboard with a graphical user interface (GUI) that represents entities (e.g., nodes) and associations (e.g., edges) as distinguishable graphical elements that are individually selectable. Different nodes/edges may have distinct graphical representations that correspond with certain characteristics of the nodes/edges. The dashboard may include multiple dynamically-updated panes that may be populated with different information depending on a user's interaction with the GUI and/or depending on information received from various sources. A first entity's connection to or involvement in certain activities may be more readily understood by interactively examining not just the first entity's relationship with a second entity, but also the second entity's relationship with a third entity which is not directly related to the first entity.

Abstract: A database query is received at a primary database in a query language of the primary database. A determination is made whether the database query is to be handled by a secondary database different from the primary database but storing synchronized records of at least a portion of the primary database. In response to determining that the database query is to be handled by the secondary database, the database query is translated to a query language of the secondary database, including by determining a tree data structure representation of the database query, translating one or more elements of the tree data structure representation, and synthesizing the tree data structure representation to automatically generate the database query in the query language of the secondary database. The automatically generated database query is provided in the query language of the secondary database to the secondary database.

Abstract: The present disclosure describes a system, method, and computer program for converting a natural language query to a structured database query. In response to receiving a natural language query for a database, an NLU model is applied to the query to identify an intent and entities associated with the query. The intent is mapped to a database object, and candidate query fields and operands are identified from the entities. The candidate query fields and operands are evaluated to identify any subject fields, conditional expressions, record count limit, and ordering/sorting criteria for the query. This including matching certain query fields and operands based on query parameters, operand types, and locations of operands relative to query fields. A query plan is created based on the evaluation of the candidate query fields and operands, and a database query is generated from the query plan.