Abstract: A system for automating a process using robotic process automation code includes a memory device for storing program code, and at least one processor device operatively coupled to the memory device. The at least one processor device is configured to execute program code stored on the memory device to process, based on a contextual dictionary, a process description document associated with a process to be automated by a robotic process automation system, automatically generate robotic process automation code based on the processing, and execute the robotic process automation code for automating the process.

Abstract: A transaction request compliant with a first version of a journal schema of a multi-data-store storage system is received at a journal manager. The journal schema indicates attributes of data objects which may be materialized at various data stores of the system. The journal manager stores an entry in the system's journal if the transaction meets acceptance criteria. Writes indicated in the entry are materialized at the data stores after verifying that the entry is compliant with the journal schema. After verifying that member data stores have approved a proposed change to the journal schema, another entry indicating a different version of the journal schema is added to the journal. Client-side components of the system obtain the current version of the journal schema to prepare the transaction requests.

Abstract: Techniques are described that enable client computer systems to request an attestation provider server to execute a given algorithm as identified by a decentralized algorithm identifier on the blockchain, using a specific data set. In some embodiments, the owners of the algorithms, data schemas, and data sets use their private key to sign/register each of these decentralized identifier structures, which includes a copy of the owner's public key. Ownership of these decentralized identifiers can be validated by verifying the digital signatures on the blockchain. In some embodiments, only the owner can replace or delete (retire) these identifiers by creating a cancellation transaction on the blockchain for each of these identifiers. In some scenarios, the decentralized identifier structures may include payment options for requesting the execution of an algorithm upon a given appropriate data set.

Abstract: A method and system for managing searches of a data set that is partitioned based on a plurality of events. A structure of a search query may be analyzed to determine if logical computational actions performed on the data set is reducible. Data in each partition is analyzed to determine if at least a portion of the data in the partition is reducible. In response to a subsequent or reoccurring search request, intermediate summaries of reducible data and reducible search computations may be aggregated for each partition. Next, a search result may be generated based on at least one of the aggregated intermediate summaries, the aggregated reducible search computations, and a query of adhoc non-reducible data arranged in at least one of the plurality of partitions for the data set.

Abstract: Techniques for implementing systems using transactional version sets are described. Transactional version sets or t-sets include a collection of elements, each having a collection of metadata. A t-set is transactional in that a sequence of updates to one or more t-sets are made within an atomic transaction. A t-set is versioned since each committed transaction that updates it produces a new timestamped version that can be accessed via time-travel queries.

Abstract: A query restriction descriptor indicating one or more attributes of a data object of a multi-data-store storage system is determined at a client-side component of the system. The query restrictions descriptor is used to prepare at least a read set descriptor of a proposed transaction. The read set of the proposed transaction includes a query with a predicate directed to the one or more attributes. A transformation function is applied to the predicate, and the result of the transformation is included in the read set descriptor. The proposed transaction is sent to a journal manager of the system, which performs read-write conflict detection using the read set descriptor and write set descriptors of one or more previously-committed transactions.

Abstract: Methods and systems for cross cluster replication are provided. Exemplary methods include: periodically requesting by a follower cluster history from a leader cluster, the history including at least one operation and sequence number pair, the operation having changed data in a primary shard of the leader cluster; receiving history and a first global checkpoint from the leader cluster; when a difference between the first global checkpoint and a second global checkpoint exceeds a user-defined value, concurrently making multiple additional requests for history from the leader cluster; and when a difference between the first global checkpoint and the second global checkpoint is less than a user-defined value, executing the at least one operation, the at least one operation changing data in a primary shard of the follower cluster, such that an index of the follower cluster replicates an index of the leader cluster.

Abstract: In some embodiments, a real-time event is detected and context is determined based on the real-time event. An application model is fetched based on the context and meta-data associated with the real-time event, the application model referencing a micro-function and including pre-condition and post-condition descriptors. A graph is constructed based on the micro-function. The micro-function is transformed into micro-capabilities by determining a computing resource for execution of a micro-capability by matching pre-conditions and post-conditions of the micro-capability, and enabling execution and configuration of the micro-capability on the computing resource by providing access in a target environment to an API capable of calling the micro-capability to configure and execute the micro-capability. A request is received from the target environment to execute and configure the micro-capability on the computing resource.

Abstract: The present disclosure relates to a computer implemented method for loading data in a target database system. The method comprises: determining that a load of a source table is expected to occur in the target database system. A future target table may be provided in advance in accordance with a defined table schema, and thereafter a load request for loading the source table may be received. Data of the source table may be loaded into the future target table.

Abstract: A system, method, and computer-readable storage medium is provided for creating first and second blockchain instances, each comprising representative blocks corresponding to steps in first and second multistep processes, respectively; performing a linking operation to link a block in the first blockchain instance to a block in the second blockchain instance; receiving change evidence data pertaining to steps in one of the first and second multi-step processes; and performing an update operation comprising updating one of the first and second blockchain instances based on said change evidence data.

Abstract: A method, computer system, and a computer program product for ensuring integrity of records in a NoSQL database including a first table and a second table is provided. The present invention may include the first table having first records representing respective first entities and the second table having second records representing respective second entities. The present invention may include using a hash table associating each second entity of the second table with the respective hash or summary hash values of first records for reading the second records of the second table.

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: An example operation may include one or more of identifying a new entry, receiving one or more new entry signatures to approve the new entry to, such that the one or more new entry signatures each include a signature of the new entry and hashes of previously signed entries for a common block, verifying the one or more new entry signatures for commit by performing a signature verification of the new entry, determining the common block has more than one entry with a hash signed by a same member, and responsive to the signature check being performed on the new entry and determining the common block has more than one entry with a hash signed by a same member, designating one or more previously received entries as verified for commit without performing a signature verification of the one or more previously received entries.

Abstract: In a production environment, an entry is logged in a log journal to represent a read operation on a record of a file. A problematic transaction in a batch job is selected and set of operations performed by the problematic transaction is intercepted. The set includes a combination of read, write, update, delete operations, and operations that use external resources. A window of entries is determined in the log journal where the entry is a beginning entry in the window and an ending entry is a last entry captured in the log journal before detecting the error. From the window, those entries are filtered that correspond to the record. A final value of the record is copied from the production environment to a development environment and rolled back in the development environment to an initial value stored in the beginning entry. The problematic transaction is performed in the development environment.

Abstract: The presently-disclosed solution provides cross-ledger transfers between distributed ledgers to achieve highly-scalable transaction throughput. Disclosed are methods and instruction code for writing a cross-ledger transfer in a way that effectively transfers value from a source distributed ledger to a target distributed ledger while preventing double spending of the value. This results in the transformation of the ledgers in that the total value in the source ledger is decreased by the transferred value while the total value in the target ledger is increased by the same amount. Also disclosed are system architectures that utilize cross-ledger transfers between multiple distributed ledgers to achieve highly-scalable transaction throughput. Also disclosed are computer apparatus configured to implement cross-ledger transfers between distributed ledgers. Other embodiments and features are also disclosed.

Abstract: Brokering log records so as to prevent log records that are not yet persisted in a persistent log from being disseminated. The log records may be generated as a primary compute system performs operations. Upon receiving a request for a log record, the broker component determines whether the requested log record has been persisted in a persistent log. If the broker component determines that the log record has been persisted in the persistent log, the broker component responds to the request by causing the requested log record to be provided to the requesting entity (e.g., a secondary compute system). On the other hand, if the log record cannot yet determine that the log record has been persisted in the persistent log, the broker component prevents the log record from being provided to the requesting entity. This prevents data from being inconsistent during recovery.

Abstract: An active transaction list synchronization method and apparatus comprising a first node that records, in a transaction list incremental log buffer, a transaction list incremental log that is obtained after last active transaction list synchronization, where the transaction list incremental log indicates a change of a transaction recorded in an active transaction list of the first node and includes an added-transaction log and a committed-transaction log, wherein the added-transaction log indicates a transaction is added to the active transaction list, wherein the committed-transaction log indicates a transaction is deleted from the active transaction list. When performing group commit on transactions recorded in the committed-transaction log, the first node sends the transaction list incremental log to at least one second node.

Abstract: Example distributed storage systems, replication managers, and methods provide barriers for dependent data operations among sharded data stores. Shard operation logs may be associated with different shards and storage nodes. Dependent data operations may be identified in each shard and data operation entries corresponding to dependency sets for those dependent data operations may be determined. Log-based operations may be executed by delaying execution of the dependent data operations in all shards until the dependency set data operations in all shards are completed.

Abstract: A processor-implemented method imposes trust at the edge of a blockchain. A hardware interrogator in a terminal interrogates an Internet of Things Smart Device (IoTSD). The IoTSD is an off-line device that is associated with a physical product. The IoTSD includes a cryptographic processor and one or more state sensors that monitor a state of the physical product. The hardware interrogator detects an event that is described by an encrypted entry in the IoTSD. The terminal transmits, to a blockchain, a transaction that describes the event that is detected by the hardware interrogator, such that the blockchain adds the transaction to a blockchain that is dedicated to the physical product, and the blockchain establishes a state of the physical product.

Abstract: Data item deltas are generated for each of M updates of a plurality of updates, wherein M is greater than or equal to one, and a first first-level combined delta is generated representing N updates of the plurality of updates, wherein N is greater than M, and the N updates comprise the M updates and O=N?M other updates. A first second-level combined delta is generated representing J updates of the plurality of updates, wherein J is greater than N, and the J updates comprise the N updates and K other updates of the plurality of updates, wherein K=J?N. The deltas, the first first-level combined delta and the first second-level combined delta are stored for enabling subsequent reading of at least part of the data by accessing the data item, the first first-level combined delta and the first second-level combined delta.

Abstract: Techniques for processing operations may include: receiving, at a data storage system from a host, an operation requesting to perform an offload copy operation internally within the data storage system, wherein the operation indicates that the offload copy operation copies data from a source interval to a destination interval; inserting a record in a log file logging the offload copy operation; inserting a source node representing the source interval in a source interval tree, wherein each node in the source interval tree represents a source interval of an offload copy operation having a corresponding record in the log file; inserting a destination node representing the destination interval in a destination interval tree, wherein each node in the destination interval tree represents a destination interval of an offload copy operation having a corresponding record in the log file; and returning an acknowledgement to the host regarding the offload copy operation.

Abstract: Exemplary systems and methods associated with generating conversations of electronic data exchanges. In particular, in one embodiment, a conversation generator determines whether records are related based on EDI data associated with a transaction, integrates the records based on associations within the EDI data, and generates a conversation that depicts the integrated EDI data associated with the transaction in a conversational format for viewing by a user. In other embodiments, an alert engine determines that there are errors in the conversation, such as missing or inconsistent data, and alerts a user accordingly.

Abstract: Techniques for automatically scheduling builds of derived datasets in a distributed database system that supports pipelined data transformations are described herein.

Abstract: The various embodiments described herein include methods, devices, and systems for reading and writing data from a database table. In one aspect, a method of reading and writing data from a database table, includes: (1) initiating a write transaction to write data to a first non-key column of a row of the database table, the database table having a plurality of rows, each row comprising a primary key and a plurality of non-key columns; (2) locking the first non-key column; and (3) in accordance with a determination that the second non-key column is not locked, initiating a read transaction to read data from the second non-key column, where initiation of the read transaction occurs prior to completion of the write transaction.

Abstract: Systems and methods include reception of a request for changed data of an object from a subscriber, determination of a logging table associated with the object and comprising a plurality of logging table entries, determination of a pointer to a last-processed entry of the logging table based on the object and the subscriber, definition of a plurality of sub-portions of logging table entries subsequent to the last-processed entry, and reconstruction and transfer of first data associated with a first one of the plurality of sub-portions to the subscriber using a first process, and reconstruction and transfer, in parallel with the first process, second data associated with a second one of the plurality of sub-portions to the subscriber using a second process.

Abstract: A method for updating a non-current data model using a current data model. The update exports a first data set which includes a file with a model object for the current data model, another with option group (“OG”) objects, another with rule objects, and another with junction objects that relate a rule to an OG. The update exports a second data set that includes a file with model-to-OG junction objects, and a file with model-to-rule junction objects. The update transports the first, and second data sets from a first data repository to a second data repository. The update imports, to the non-current data model, the first, and second data sets. The update recreates, in the non-current data model, the model-to-option-group junctions and the model-to-rule junctions.

Abstract: Efficient rolling transactions for a data storage system is described herein. A method as described herein can include structuring, by a device operatively coupled to a processor, a data stream according to a first structure, the first structure comprising respective stream segments that are associated with respective first key ranges; writing, by the device, a transaction to the data stream, wherein the transaction comprises events arranged in a second structure that is distinct from the first structure, and wherein the second structure comprises respective transaction segments that are associated with respective second key ranges; and merging, by the device, respective ones of the transaction segments into respective ones of the stream segments, resulting in merged transaction segments, in response to the second key ranges of the respective merged transaction segments at least partially matching the first key ranges of the respective ones of the stream segments.

Abstract: At a logging service, a representation of a transaction requested by a client is received. The transaction includes at least a first write operation directed to a data object at a first data store. Based at least in part on the contents of the representation and contents of a persistent log of the logging service, a determination is made that the requested transaction is to be committed. A log record corresponding to the first write operation is inserted into the persistent log. The first write is propagated to the first data store after the record has been inserted in the persistent log.

Abstract: A system and method for time synchronization. The method includes incrementing at least one instance of a snap value, wherein the at least one instance is stored in at least one storage node of a distributed storage system, wherein each of the at least one instance is incremented using a single-phase commit operation, wherein each of the plurality of storage nodes includes at least one timestamp, wherein each timestamp indicates a corresponding snap time, wherein each snap time is determined by reading one of the at least one instance at a time of creation of the corresponding timestamp.

Abstract: Computer program products, methods, systems, apparatus, and computing entities are provided for creating and using heterogeneous pools of validators to implement blockchain consensus. The specialized validators can be segmented and pooled based on their roles and functionalities in the consensus mechanism.

Abstract: In one aspect, a computerized method for building a secondary index used to access index keys in a distributed database includes the step of providing a distributed database. The computerized method includes the step of providing a database file of the distributed database or on a cluster. The computerized method includes the step of building a first database index of index keys of the database file. The computerized method includes the step of organizing the first database index. The computerized method includes the step of, based on the organization of the first database index, building a second database index.

Abstract: A multi-version database includes user-defined blockchain containers, where each of the user-defined blockchain containers is configured based on a type of data to be stored in a corresponding user-defined blockchain container. Each of the user-defined blockchain containers includes a set of one or more fields defined by a user. A command to write data to the multi-version database is received, where the command includes an identification of a first blockchain container of the user-defined blockchain containers, an identification of at least one of the set of one or more fields of the first blockchain container, and a value to write for at least one field of the set of one or more fields. A record is generated for the first blockchain container, the record including the value to write for the at least one field. A current state of the first blockchain container is then updated to include the record.

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: Systems and methods are described to correlate different types of data obtained from a distributed ledger system. The distributed ledger system can generate transaction notifications, log data, and/or metrics data. At least some of the data generated by the distributed ledger system can be obtained by a data intake and query system via a distributed ledger system monitor. The data from the distributed ledger system can be stored in the data intake and query system and correlated. Based on the correlation, the data intake and query system can determine a history of a transaction in the distributed ledger system, relationships between components of the distributed ledger system, and/or an architecture of the distributed ledger system.

Abstract: Users requesting a report are given the option of generating a live report or viewing a previous generated “report snapshot”, which may be a version of the report that was previously generated and stored. The report snapshot may have been generated in response to a previous request for the report, or it may have been generated automatically in response to some trigger event or on a period basis. In response to the user's selection of a live report, the report is generated from data stored in a database, and provided to the user when ready. In addition, the live report is stored as a report snapshot in a storage device. In response to the user's selection of a snapshot, the previously generated report snapshot is retrieved from the storage device and provided to the user. Multiple snapshots for the same report can be made available.

Abstract: Databases may enforce foreign key constraints for efficient materialized view updates. A materialized view may be created for a database. Updates to the database may be received and performed according to a foreign key constraint enforced with respect to the updates. An update to the materialized view may be performed to make the materialized view consistent with the updates to the database. Performance of a join operation to update the materialized view that would return a result violating the foreign key constraint may be excluded from the update to the materialized view.

Abstract: Orchestrated Hybrid Cloud system comprises in a heterogenous computer network environment having a plurality of resources loosely coupled to each other, the resources including memory devices and computer processors executing different operating system programs, each different operating system program having a set of kernel programs unique to that operating system program and a unique file space to constitute on one side: a SAP HANA virtual server and a SAP HANA physical server for creating on request several server instances constituting a server farm and managing an in-memory, column-oriented, relational database management system for storing data in main electronic memory of the resources, and on other side: a SAP application server using a row-oriented relational database management systems for storing data in disk memory, and subordinate programs operating together with the computer processors, at least some of the resources being available to perform remote execution services for application server farm

Abstract: A method includes identifying a database install script to be executed for a given database and parsing the database install script prior to execution to determine an object type, object name and object operation for database objects affected by the database install script. The method also includes connecting to the given database to read a definition of the database install script based at least in part on the object type, object name and object operation for the database objects affected by the database install script and generating a rollback script based at least in part on the definition of the database install script. The method further includes executing the database install script on the given database and, responsive to detecting one or more designated conditions, utilizing the rollback script to revert one or more changes to the database objects affected by the database install script.

Abstract: One or more embodiments of the present specification provide data retrieving and recording methods and apparatuses, and electronic devices. One method comprises: identifying, by a blockchain node in a blockchain network, a data retrieving and recording request for a smart contract, wherein the data retrieving and recording request is configured to trigger a data retrieving and recording operation on a target object in a data set comprised in the smart contract; and parsing, by the blockchain node and to generate a parsing result, metadata comprised in the smart contract, wherein the parsing performs instructions comprised in the smart contract, and wherein the parsing result indicates a storage field corresponding to the target object in the data set for implementing the data retrieving and recording operation on the storage field.

Abstract: Systems and methods for high availability computing systems. Systems and methods include disaster recovery of two-node computing clusters. A method embodiment commences upon identifying a computing cluster having two nodes, the two nodes corresponding to a first node and a second node that each send and receive heartbeat indications periodically while performing storage I/O operations. One or both of the two nodes detect a heartbeat failure between the two nodes, and in response to detecting the heartbeat failure, one or both of the nodes temporarily cease storage I/O operations. A witness node is accessed in an on-demand basis as a result of detecting the heartbeat failure. The witness performs a leadership election operation to provide a leadership lock to only one requestor. The leader then resumes storage I/O operations and performs one or more disaster remediation operations. After remediation, the computing cluster is restored to a configuration having two nodes.

Abstract: Techniques for streamlined commit procedures between synchronized nodes are provided. A request to commit a transaction is transmitted from a first node, where the request instructs a second node to retain any locks related to the transaction. A response is received, from the second node, indicating that the transaction was successfully committed. Upon receiving the response, the transaction is committed on the first node. Upon successfully committing the transaction on the first node, first cleanup request is transmitted to the second node, where the cleanup request instructs the second node to release any locks related to the transaction.

Abstract: Altering a database structure based on software updates in a distributed computing system can include identifying a plurality of software updates that include alterations to structural elements in the database structure and identifying, for the plurality of software updates, a plurality of alterations corresponding to a first structural element of the structural elements. A combined alteration can be generated by combining the plurality of alterations. A database statement can be generated for altering the first structural element according to the combined alteration. The database structure can then be updated using the database statement. The structural elements can define logical relationships between data stored in the database structure. The alterations can be expressed using a markup language and the database statement can be expressed using a query language.

Abstract: Disclosed techniques relate to enforcing table dependencies for a database schema when tables are maintained by separate database instances. In some embodiments, a database system generates configuration data based on foreign key constraints for multiple database tables. In some embodiments, in response to a request from an application server to access data, the database system accesses the configuration data (where the configuration data specifies a relationship between a field of a child table and a field of a parent table and at least a portion of the parent table is stored in a different database instance than the child table) and determines whether the request satisfies the specified relationship. In some embodiments, enforcing dependencies at an intermediate orchestration layer maintained by the database systems allows applications to submit requests without considering table dependencies.

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 comprise 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: A method for a multi-tenant server to manage data in a peer-to-peer blockchain network is described. The method includes monitoring one or more fields of a first physical object of a first tenant in the peer-to-peer blockchain network to determine when one or more conditions of a smart contract have been fulfilled; determining that one or more conditions of the smart contract have been met by the first physical object of the first tenant; and performing one or more operations of the smart contract, which are associated with the one or more conditions, in response to determining that the one or more conditions of the smart contract have been met by the first physical object of the first tenant, wherein the one or more operations are performed in relation to a second physical object of a second tenant in the peer-to-peer blockchain network.

Abstract: An example operation may include one or more of obtaining a machine-readable code from a first document among a set of documents, extracting a probabilistic data structure from the machine-readable code which includes probabilistic hashes accumulated from the set of documents, determining whether a document hash of a second document is included within the probabilistic data structure, and in response to a determination that the document hash is included within the probabilistic data structure, outputting a notification indicating the second document is included in the set of documents.

Abstract: A database system stores both compressed and uncompressed data in a row-based database system. The database system converts a representation of data involving a set of rows of a source database table, each row comprising multiple values, into a representation involving a single row stored in a target database table, each column of the row comprising arrays of values from the set. The database system may perform type-specific compression of data when storing in the target database table. Accordingly, the database system may apply different compression schemes for different columns or sets of values obtained from the source database table and may group or order selected rows or store additional summary information to improve query performance to the target database table. The database system allows users to query data stored in compressed form. The database system combines compressed and uncompressed data at query time for efficient database analytics.

Abstract: A method, computer system, and a computer program product for object notifications is provided. The present invention may include receiving a requestor's operation. The present invention may then include determining that a notification describing the requestor's operation should be sent. The present invention may then include determining whether the requestor's operation is successful or unsuccessful, and the present invention may lastly include deleting an in-memory object.

Abstract: A system and method for transaction management. The system includes a processing circuitry; and a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to: assign a transaction identifier (ID) to a transaction, wherein the transaction includes at least one modification to at least one object stored in a storage system, each object having a persistent state, wherein the transaction ID indicates a state of the transaction, wherein the state of the transaction initially indicates that the transaction is in progress; modify the at least one object, wherein the modifying further comprises adding at least one conditional entry to each object, wherein each conditional entry includes one of the at least one modification that is conditional on the state of the transaction; and update the transaction ID when a termination event occurs, wherein the updating further includes changing the state of the transaction.

Abstract: Disclosed herein are methods, devices, and apparatuses, including computer programs stored on computer-readable media, for performing an off-chain testing on a smart contract. One of the methods includes: generating execution environment information for the smart contract, the execution environment information including at least one of transaction context information, blockchain information, or state information; providing an interface between the generated execution environment information and the smart contract; executing the smart contract based on the generated execution environment information and the provided interface; and storing an execution result of the smart contract.