Differencing of executable dataflow graphs

Patent metadata

Field	Value
Publication number	US-11455229-B2
Application number	US-202017067020-A
Country	US
Kind code	B2
Filing date	Oct 9, 2020
Priority date	Dec 7, 2016
Publication date	Sep 27, 2022
Grant date	Sep 27, 2022

Abstract

A method for displaying differences between a first executable dataflow graph and a second executable dataflow graph includes comparing a specification of the first executable dataflow graph and a specification of the second executable dataflow graph, including at least one of identifying a particular node or link of the first dataflow graph that does not correspond to any node or link of the second dataflow graph; and identifying a first node or link of the first dataflow graph that corresponds to a second node or link of the second dataflow graph, and identifying a difference between the first node or link and the second node or link. The method includes formulating and displaying a graphical representation of at least some of the nodes or links of the first dataflow graph or the second dataflow graph, the graphical representation including a graphical indicator of at least one of the identified particular node or link the identified difference between the first node or link and the second node or link.

First claim

What is claimed is:

1. A method for displaying differences between a first executable dataflow graph and a second executable dataflow graph, each dataflow graph executable to process data records received by the dataflow graph, each dataflow graph including one or more nodes representing data processing components and one or more links representing flows of data records between components, the method including:
by a computer, comparing at least a portion of a specification of the first executable dataflow graph and at least a portion of a specification of the second executable dataflow graph to identify one or more differences between the at least a portion of the first dataflow graph and the at least a portion of the second dataflow graph,
wherein the specification of a given executable dataflow graph defines one or more nodes each representing a data processing component configurable to define an operation to be performed to process data records, wherein the dataflow graph is configured to, when executed, (1) receive and process data records from a data source and (2) provide processed data records to a data sink;

the comparing of at least a portion of the specification of the first dataflow graph and the at least a portion of the specification of second dataflow graph including at least one of:
(1) identifying a particular node of the first dataflow graph that does not correspond to any node defined by the specification of the at least a portion of the second dataflow graph, the identified particular node representing a data processing component configurable to define an operation to be performed to process data records,
(2) identifying a particular link of the first dataflow graph that does not correspond to any link defined by the specification of the at least a portion of the second dataflow graph, the identified particular link representing a flow of data records between components represented by nodes of the first dataflow graph,
3 identifying a first node of the first dataflow graph that corresponds to a second node defined by the specification of the at least a portion of the second dataflow graph, the identified first node representing a data processing component configurable to define an operation to be performed to process data records, and identifying a difference between the first node and the second node,
(4) identifying a first link of the first dataflow graph that corresponds to a second link defined by the specification of the at least a portion of the second dataflow graph, the identified first link representing a flow of data records between components represented by nodes of the first dataflow graph, and identifying a difference between the first link and the second link; and

displaying, in a graph editing interface, a graphical representation of at least some of the nodes or links of the first dataflow graph or the second dataflow graph, the graphical representation including a graphical indicator of at least one of (1) the identified particular node or link (1) the identified difference between the first node or link and the second node or link.

2. The method of claim 1 , in which identifying a difference between the first node or link and the second node or link includes identifying a difference between a resolved parameter of the first node or link and a resolved parameter of the second node or link.

3. The method of claim 1 , in which identifying a difference between the first node or link and the second node or link includes identifying a difference between an expression for a parameter of the first node or link and an expression for a parameter of the second node or link.

4. The method of claim 1 , in which the graphical indicator is a shading, fill, or color of the first, second, or particular node or link in the graphical representation.

5. The method of claim 1 , in which the graphical indicator includes a symbol positioned near the first, second, or particular node or link.

6. The method of claim 1 , including enabling access to information indicative of the identified difference responsive to user interaction with the graphical indicator.

7. The method of claim 1 , in which the first dataflow graph contains a first dataflow subgraph and in which the second dataflow graph contains a second dataflow subgraph, and including:
comparing a specification of the first dataflow subgraph and a specification of the second dataflow subgraph to identify one or more differences between the first dataflow subgraph and the second dataflow subgraph.

8. The method of claim 7 , in which the graphical representation includes a hierarchical representation of at least one of the identified differences between the first dataflow graph and the second dataflow graph and at least one of the identified differences between the first dataflow subgraph and the second dataflow subgraph.

9. The method of claim 1 , in which identifying a first node or link that corresponds to a second node or link includes identifying the first node based on one or more of (1) a name of the first node or link and second node or link and (2) an identifier of the first node or link and second node or link.

10. The method of claim 1 , in which identifying a first node or link that corresponds to a second node or link includes identifying the first node based on information associated with a flow of data records into or out of the first node and second node.

11. The method of claim 1 , in which identifying a first node or link that corresponds to a second node or link includes identifying the first node or link based on nodes or links that are upstream or downstream of the first node or link and second node or link.

12. The method of claim 1 , including:
preparing the first dataflow graph and the second dataflow graph for execution; and
comparing the specifications of the prepared first and second dataflow graph.

13. A non-transitory computer readable medium storing instructions for causing a computer to display differences between a first executable dataflow graph and a second executable dataflow graph, each dataflow graph executable to process data records received by the dataflow graph, each dataflow graph including one or more nodes representing data processing components and one or more links representing flows of data records between components, the instructions causing the computer to:
compare at least a portion of a specification of the first executable dataflow graph and at least a portion of a specification of the second executable dataflow graph to identify one or more differences between the at least a portion of the first dataflow graph and the at least a portion of the second dataflow graph,
wherein the specification of a given executable dataflow graph defines one or more nodes each representing a data processing component configurable to define an operation to be performed to process data records, wherein the dataflow graph is configured to, when executed, (1) receive and process data records from a data source and (2) provide processed data records to a data sink;

the comparing of at least a portion of the specification of the first dataflow graph and the at least a portion of the specification of second dataflow graph including at least one of:
(1) identifying a particular node of the first dataflow graph that does not correspond to any node defined by the specification of the at least a portion of the second dataflow graph, the identified particular node representing a data processing component configurable to define an operation to be performed to process data records,
(2) identifying a particular link of the first dataflow graph that does not correspon

Assignees

• Ab Initio Technology Llc

Inventors

• Rozenberg Ilya
• Weiss Adam

Classifications

• G06F8/34 Primary

  Graphical or visual programming · CPC title

• G06F9/4494

  data driven · CPC title

• G06F11/3608

  using formal methods, e.g. model checking, abstract interpretation (theorem proving G06N5/013) · CPC title

• G06F8/10

  Requirements analysis; Specification techniques · CPC title

• G06F8/71

  Version control (security arrangements therefor G06F21/57); Configuration management · CPC title