Identifying groups of related nodes in an integration flow

Patent metadata

Field	Value
Publication number	US-11140036-B2
Application number	US-201916249412-A
Country	US
Kind code	B2
Filing date	Jan 16, 2019
Priority date	Jan 16, 2019
Publication date	Oct 5, 2021
Grant date	Oct 5, 2021

Abstract

Methods and systems for identifying groups of related nodes in an integration flow are disclosed. A method includes: receiving, by a computing device, an integration flow document including information indicative of: (i) a plurality of nodes, with each node representing a processing step in an integration flow, (ii) a plurality of input parameters, and (iii) a plurality of input sources; determining, by the computing device, a plurality of mappings, with each mapping representing an association between an input parameter and an input source; determining, by the computing device, a plurality of grouped nodes of the plurality of nodes based upon the plurality of mappings; receiving, by the computing device, a request to perform a first operation on a first target node of the plurality of nodes; determining, by the computing device, that the first target node is included in the plurality of grouped nodes; and in response to determining that the first target node is included in the plurality of grouped nodes, performing, by the computing device, the first operation on each grouped node of the plurality of grouped nodes.

First claim

What is claimed is:

1. A method comprising:
receiving, by a computing device, an integration flow document describing a flow of data, including information indicative of: (i) a plurality of nodes, with each node representing a processing step in an integration flow, (ii) a plurality of input parameters utilized by one of the plurality of nodes, and (iii) a plurality of input sources that are sources of the plurality of input parameters;
determining, by the computing device, a plurality of mappings, with each mapping representing an association between an input parameter utilized by one of the plurality of nodes and another of the plurality of nodes that is an input source of the input parameter;
determining, by the computing device, a plurality of related grouped nodes of the plurality of nodes based upon the plurality of mappings, wherein the plurality of related grouped nodes comprises two or more nodes that each represent a processing step in a series of processing steps, and wherein the two or more nodes each depend only on an immediate predecessor node's output for its input parameters;
receiving, by the computing device, a request to perform a first editing operation on a first target node of the plurality of nodes;
determining, by the computing device, that the first target node is included in the plurality of related grouped nodes; and
in response to determining that the first target node is included in the plurality of related grouped nodes, performing, by the computing device, the first editing operation on each grouped node of the plurality of related grouped nodes.

2. The method according to claim 1 , further comprising:
receiving, by the computing device, a request to perform a second editing operation on a second target node;
determining, by the computing device, that the second target node is not included in the plurality of related grouped nodes; and
in response to determining that the second target node is not included in the plurality of related grouped nodes, performing, by the computing device, the second editing operation only on the second target node.

3. The method according to claim 1 , further comprising storing, by the computing device, information identifying the plurality of related grouped nodes in a persisted definition of each grouped node of the plurality of related grouped nodes.

4. The method according to claim 1 , further comprising storing, by the computing device, information about other nodes included in the plurality of related grouped nodes in a persisted definition of each grouped node of the plurality of related grouped nodes.

5. The method according to claim 1 , wherein the first editing operation is a delete operation.

6. The method according to claim 1 , wherein the first editing operation is a copy operation.

7. The method according to claim 1 , wherein the first editing operation is a move operation.

8. A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computing device to cause the computing device to:
receive an integration flow document describing a flow of data, including information indicative of: (i) a plurality of nodes, with each node representing a processing step in an integration flow, (ii) a plurality of input parameters utilized by one of the plurality of nodes, and (iii) a plurality of input sources that are sources of the plurality of input parameters;
determine a plurality of mappings, with each mapping representing an association between an input parameter utilized by one of the plurality of nodes and another of the plurality of nodes that is an input source of the input parameter;
determine a plurality of related grouped nodes of the plurality of nodes based upon the plurality of mappings;
receive a request to perform a first editing operation on a first target node of the plurality of nodes;
determine that the first target node is included in the plurality of related grouped nodes; and
in response to determining that the first target node is included in the plurality of related grouped nodes, perform the first editing operation on each grouped node of the plurality of related grouped nodes.

9. The computer program product according to claim 8 , wherein the plurality of related grouped nodes comprises two or more nodes that each represent a processing step in a series of processing steps, and wherein the two or more nodes each depend only on an immediate predecessor node's output for its input parameters.

10. The computer program product according to claim 8 , the program instructions further being executable by the computing device to cause the computing device to:
receive a request to perform a second editing operation on a second target node;
determine that the second target node is not included in the plurality of related grouped nodes; and
in response to determining that the second target node is not included in the plurality of related grouped nodes, perform the second editing operation only on the second target node.

11. The computer program product according to claim 8 , the program instructions further being executable by the computing device to cause the computing device to store information identifying the plurality of related grouped nodes in a persisted definition of each grouped node of the plurality of related grouped nodes.

12. The computer program product according to claim 8 , the program instructions further being executable by the computing device to cause the computing device to store information about other nodes included in the plurality of related grouped nodes in a persisted definition of each grouped node of the plurality of related grouped nodes.

13. The computer program product according to claim 8 , wherein the first editing operation is a delete operation.

14. The computer program product according to claim 8 , wherein the first editing operation is a copy operation.

15. The computer program product according to claim 8 , wherein the first editing operation is a move operation.

16. A system comprising:
a hardware processor, a computer readable memory, and a computer readable storage medium associated with a computing device;
program instructions to receive an integration flow document including information indicative of: (i) a plurality of nodes, with each node representing a processing step in an integration flow, (ii) a plurality of input parameters, and (iii) a plurality of input sources;
program instructions to determine a plurality of mappings, with each mapping representing an association between an input parameter and an input source;
program instructions to determine a plurality of grouped nodes of the plurality of nodes based upon the plurality of mappings;
program instructions to receive a request to perform a first operation on a first target node of the plurality of nodes;
program instructions to determine that the first target node is included in the plurality of grouped nodes; and
program instructions to, in response to determining that the first target node is included in the plurality of grouped nodes, perform the first operation on each grouped node of the plurality of grouped nodes,
wherein the program instructions are stored on the computer readable storage medium for execution by the hardware processor via the computer readable memory.

17. The system according to claim 16 , further comprising:
program instructions to receive a request to perform a second operation on a second target node;
program instructions to determine that

Assignees

• IBM

Inventors

• Klinger Doina L
• Reeve John A
• Harrison Ashley
• Balanescu Vlad

Classifications

• H04L41/0893 Primary

  Assignment of logical groups to network elements · CPC title

• H04L67/2871 Primary

  Implementation details of single intermediate entities · CPC title

• H04L67/566

  Grouping or aggregating service requests, e.g. for unified processing · CPC title

• G06F9/45558

  Hypervisor-specific management and integration aspects · CPC title

• H04L67/34

  involving the movement of software or configuration parameters  (network booting or remote initial program loading [RIPL] G06F9/4416) · CPC title