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: 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: 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: 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: 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: 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: A data storage system non-disruptively transitions from using a ring-based write log to using a pool-based write log for buffering data being written to persistent secondary storage. The system initially creates the pool-based write log based on contents of the ring-based write log, and begins to mirror updates of the ring-based write log to the pool-based write log to establish synchronism. Subsequently, and based on an update flag indicating that an update process for the system has not yet completed, the system continues to mirror updates of the ring-based write log to the pool-based write log to maintain synchronism therebetween. Subsequently, and based on the update flag indicating that the update process for the system has completed, the system commences exclusive use of the pool-based write log and making the ring-based write log available for eventual removal.

Abstract: A method of labeling a dataset includes inputting a testing set comprising a plurality of input data samples into a plurality of pre-trained machine learning models to generate a set of embeddings output by the plurality of pre-trained machine learning models. The method further includes performing an iterative cluster labeling algorithm that includes generating a plurality of clusterings from the set of embeddings, analyzing the plurality of clusterings to identify a target embedding with a highest duster quality, analyzing the target embedding to determine a compactness for each of the plurality of clusterings of the target embedding, and identifying a target cluster among the plurality of clusterings of the target embedding based on the compactness. The method further includes assigning pseudo-labels to the subset of the plurality of input data samples that are members of the target duster.

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: 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: 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: 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: 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: 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: 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: 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: 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: 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 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, 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: 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: 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: 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: 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.