International Business Machines Corporation

Ibm Canada Limited - Ibm Canada Limitee

Srinivas Chari

Crystal J Su

Dirk Alexander Seelemann, Ii

Dirk A Seelemann

Milorad Stefanovic

The present invention provides a methodology for truncating a logical structure having data matching a predefined pattern. For example, the present invention truncates a logical structure so that branches of the structure are automatically ceased at a recursive ancestor instead of at a descendant. By using the methodology of the present invention, the total number of nodes of the logical structure that will be automatically displayed for a user is represented by the formula N*N+1. Thus, when N=10, the total number of nodes that are automatically displayed for the user is 101. This quantity is far more user friendly than the 9,864,101 nodes that would be displayed when N=10 under previous approaches.

System and program product for displaying a logical structure

A method deploys a set of coupled data transformation modules describing a data transformation, the data transformation for transforming a data structure from a first format to a second format. The method includes receiving an instruction for selecting the set of transformation modules from a memory; converting each of the set of transformation modules to a common model format, the set of modules having at least one transformation module being of a module type of a type set including language constructed modules and visually constructed modules; and generating an executable version of the converted transformation modules suitable for execution by a data transformation engine. The executable version, when executed, transforms the data structure from the first format to the second format.

Integrated visual and language-based method for reusable data transformations

The present invention provides a methodology for truncating a logical structure having data matching a predefined pattern. For example, the present invention truncates a logical structure so that branches of the structure are automatically ceased at a recursive ancestor instead of at a descendant. By using the methodology of the present invention, the total number of nodes of the logical structure that is automatically displayed for a user is represented by the formula N*N+1. Thus, when N=10, the total number of nodes that are automatically displayed for the user is 101. This quantity is far more user friendly than the 9,864,101 nodes that would be displayed when N=10 under previous approaches.

Growing community of inventors

Toronto, Canada

Srinivas Chari