Method of executing a data transformation specification

• US 6,742,054 B1
• Filed: 04/07/2000
• Issued: 05/25/2004
• Est. Priority Date: 04/07/2000
• Status: Expired due to Term

• Current Assignee: Vitria Technology Incorporated (Innovation Technology Group Incorporated)
• Original Assignee: Vitria Technology Incorporated (Innovation Technology Group Incorporated)
• Inventors: Upton, Francis R. IV
• Primary Examiner(s): Gaffin, Jeffrey
• Assistant Examiner(s): CASIANO, ANGEL L
• Application Number:
  US09/544,973
• Time in Patent Office: 1,509 Days
• Field of Search: 707/10, 707/103, 707/104, 707/200, 707/201, 707/202, 707/203, 707/204, 395/500, 395/612, 710/5, 710/6, 710/29, 710/33
• US Class Current: 710/6
• CPC Class Codes: G06F 40/14 Tree-structured documents parsing G06F40/205; validation G06F40/226
• CPC Class Codes: G06F 40/154 Tree transformation for tree-structured or markup documents, e.g. XSLT, XSL-FO or stylesheets
• CPC Class Codes: G06Q 40/02 Banking, e.g. interest calculation or account maintenance credit or loans G06Q40/03

Abstract

A computer-implemented process for transforming an input message to an output message including reading transformation configuration information, reading an input message, creating output message data corresponding to each output schema node, calculating a number of reasons to continue for each schema node, performing the steps until the number of reasons to continue becomes zero, and writing the output message.

Claims

1. A computer-implemented process for transforming an input message to an output message comprising the steps of:

reading transformation configuration information;

reading an input message;

creating output message data corresponding to each output schema node;

calculating a reason count, wherein the reason count is the number of reasons to continue for each schema node;

performing the steps until the reason count becomes zero; and

writing the output message,

wherein said output message data is created using a tree-view by accessing an input tree on demand to satisfy output node computations and an input message.

2. A computer-implemented process as in claim 1, wherein said input tree is partially traversed and the traversal terminates when said reason count becomes zero.

3. A computer-implemented process for transforming an input message to an output message comprising the steps of:

preparing a database of input schema;

preparing a database of output schema;

selecting an input schema from said database of input schema;

adding transformation constructs to said input schema, wherein said transformation constructs define rules for building a particular output field;

selecting an output schema from said database of output schema;

adding transformation constructs to said output schema, wherein said transformation constructs define rules for building a particular output field;

selecting an application program as an input;

generating a tree representing an input schema;

generating a tree representing an output schema;

selecting an output field to receive an expression tree that defines the content of the output field;

building said output field; and

displaying said output field.

4. A computer-implemented process as in claim 3, wherein said transformation construct comprises at least one expression tree.

5. A computer-implemented process as in claim 4, wherein said at least one expression tree is a field reference.

6. A computer-implemented process as in claim 4, wherein said at least one expression tree is a function.

7. A computer-implemented process as in claim 4, wherein said at least one expression tree is a formal parameter.

8. A computer-implemented process as in claim 4, wherein said at least one expression tree is a constraint.

9. A computer-implemented process for transforming an input message to an output message comprising the steps of:

selecting an input node to feed a transformation rule for an output node;

adding transformation configuration constructs to an input schema;

adding transformation configuration constructs to an output schema, wherein said constructs added to said input schema and to said output schema provide execution control of the transformation;

calculating a reason count, wherein the reason count is the number of reasons to continue accumulating data for each schema node;

associating said reason count at a root output schema node;

accumulating data from said input schema by traversing an output tree until said reason count becomes zero;

producing an output message that is a final result from said accumulated data; and

writing said output message.