International Business Machines Corporation

Andrew John Coleman

John Anthony Reeve

Trevor Clifford Dolby

Matthew E Golby-Kirk

Anthony John O'Dowd

Manish Sethi

A computer-implemented method, system and computer program product for identifying ancestor objects in hierarchical data configured for processing with a query, the query having an associated abstract syntax tree. The abstract syntax tree may be processed so as to generate an augmented abstract syntax tree which includes parent identifiers configured to identify the parent nodes of the query. In this way, a need to pre-parse the data may be alleviated. Instead, the identification of a parent node of a query may be encoded into the abstract syntax tree of the query.

Hierarchical data

A computer-implemented method, system and computer program product for safely processing integrated flows of messages in a multi-tenant container. Each step in the flows of messages to be processed by the applications in the multi-tenant container is monitored. If the monitored step is determined to run custom logic in a general-purpose programming language, then the flow of messages running such custom logic is suspended from being processed by the application in the container if there are other flows of messages being processed by other applications in the container. Furthermore, new flows of messages are prevented from being processed by the applications in the container. After processing the other flows of messages by the other applications in the container, the suspended flow of messages is now processed by the application in the container. In this manner, the risk of interference with other flows of messages in the container is avoided.

Safely processing integrated flows of messages in a multi-tenant container

Generating a target schema is provided. The method comprises receiving an input schema that defines an input structure and receiving a transformation map. The transformation map and the input schema are both parsed, and a first tree for the map and a second tree for the schema are traversed in a step fashion. According to the traversal of the first tree and second tree, a target schema is generated that is valid for all possible instance documents that the transformation map would generate.

Generating target schema based on source schema and query expression

A system receives an operation by a trusted node on a blockchain, simulates an execution of the operation, and captures endorsement policy information related to the execution of the operation.

Endorsement policy consolidation in blockchain networks

According to embodiments of the present disclosure, a method of debugging datacentric programming languages, a computer program product, and a computer system. The method may comprise receiving, by a processor, an expression to be evaluated against an input data structure; evaluating, by the processor, the expression to produce an output data structure, wherein the evaluating comprises automatically augmenting the input data structure with positional metadata; receiving a user selection of a data element from a datacentric programming element; and in response to the user selection, by the processor, using the positional metadata to display a providence of the selected data element.

Visual declarative debugger

Concepts for creating a mock for an integration flow are presented. One example comprises analyzing a response to each of a plurality of requests from an integration flow and determining whether or not an identifying property of each of the plurality of requests is present in the response. The method then comprises, responsive to determining that the identifying property is present in the response, generating a mock with an associated matcher based on the plurality of requests.

Creating a mock for an integration flow

A computer-implemented method for deploying an application between an on-premise server and an off-premise server includes identifying a plurality of nodes in a flow of an application deployed on the on-premise server. The computer-implemented method further includes splitting the flow at the plurality of nodes to form a plurality of sub-flows of the application. The computer-implemented method further includes routing a flow execution workload of the application to the plurality of sub-flows of the application.

Dynamic integration flows in hybrid cloud environments

An example operation may include one or more of constructing a transaction proposal and sending the constructed transaction proposal to a plurality of endorsing nodes, by a client application of a computing system, wherein inputs to the transaction proposal are named using a blockchain naming system (BNS), receiving a set of transaction responses from the plurality of endorsing nodes, by the client application of the computing system, the transaction responses each comprising a transaction validation function, assembling the received transaction responses into a transaction, by the client application of the computing system, and sending the transaction to an orderer node for distribution, by the client application of the computing system.

Distributed computing and storage network implementing high integrity, high bandwidth, low latency, secure processing

An example operation may include one or more of constructing a transaction proposal, by a computing system, wherein inputs to the transaction proposal are named using a blockchain naming system (BNS) that comprises ledger state addressing, oracles for addressing external data values, and user state addressing, the BNS providing a standard mechanism to name all blockchain resources using a universal resource indicator (URI).

A computer system performs decentralized collection and aggregation of data. A plurality of requests for data are transmitted, by a data collection server, to a corresponding plurality of remote servers, wherein the plurality of remote server submit responses to the plurality of requests for data to a distributed data structure. The distributed data structure is accessed, by the data collection server, to retrieve the plurality of responses to the plurality of requests. The plurality of responses are aggregated, by the data collection server, into a message and the message is transmitted to an entity requesting data collection. Embodiments of the present invention further include a method and program product for performing decentralized collection and aggregation of data in substantially the same manner described above.

Decentralized aggregation and collection of data from multiple sources

Disclosed embodiments provide improvements in integration template generation. In embodiments, existing customer integration flows already created by users are analyzed using computer-implemented methods, and from these customer integration flows, templates are created that encapsulate the general patterns that are seen in existing customer integration flows. The customer integration flows are anonymized by removing proprietary and/or identifying data. The result is customer integration templates based on actual real-world usage, which can more accurately resemble the needs of customers as compared to traditional templates that are authored by someone envisioning how he thinks the applications will be linked together, but not based on how they actually are used. Disclosed embodiments can generate integration templates based on general patterns encountered by multiple users that serve as a good starting point for any user that wants to do similar integrations.

Integration template generation

An approach is provided in which the approach generates a first set of sample documents based on a first schema and generates a second set of sample documents based on a second schema. The approach determines a set of validation results by comparing the first set of sample documents against the second schema and comparing the second set of sample documents against the first schema. The approach evaluates the set of validation results and declares a type of equivalence between the first schema and the second schema accordingly.

Comparing schema definitions using sampling

Concepts for controlling transaction requests delivered between applications and servers via a decentralized architecture. In such concepts, the delivery of transaction requests is controlled in consideration of information regarding groups of transaction requests that may cause transaction collisions if processed in parallel. Such groupings of transaction request may be defined, modified and updated at run-time, based on previous or current observed transaction collisions.

Controlling transaction requests between applications and servers

A method and system for mapping data elements between a source data structure and a target data structure. A source data element is mapped to a target data element by matching a source key and value pair to a target key and value pair. A parent source Soundex key for each parent element of the source data element is created. A parent target Soundex key for each parent element of a plurality of target data elements snatching the first Soundex key of the source data element is created. The parent source Soundex key for each parent element of the source data element is compared with each parent target Soundex key. The source data element is mapped to the target data element having the parent target Soundex key that matches the parent source Soundex key.

Growing community of inventors

Petersfield, United Kingdom

Andrew John Coleman