METHOD AND SYSTEM FOR SCHEMA TRANSFORMATION

1 . A method comprising the steps of:

receiving, via an electronic input, a transaction having a serialized structure;

identifying, using a computer processor, a transaction type for the transaction;

identifying, using the computer processor, a schema for the transaction type, wherein the schema includes a schema definition for an in-memory tree structure;

retrieving, from a memory, a schema correlated transform process wherein the schema correlated transform process transforms the serialized structure to a hierarchical structure; and

parsing, using the computer processor, the transaction into a hierarchical format based on the schema, wherein the step of parsing comprises the step of generating the in-memory tree structure for the transaction based on the schema definition, wherein the in-memory tree structure comprises a tree of valid segment representations constructed based on a sequence instruction type, wherein the sequence instruction type represents a sequence rule as a guiding parser that sequences a state machine that receives data tree mapping node type outputs and in a designated order constructs the tree of valid segment representations.

2 . The method of claim 1 , wherein the serialized structure comprises a loop component, segment component and an element component.

3 . The method of claim 1 , wherein the serialized structure comprising sequences of elements in a delimiter line segment form.

4 . The method of claim 3 , further comprising the step of:

mapping, using the computer processor, the sequences of elements to a tree of key value pairs constructed in a hierarchical format.

5 . The method of claim 1 , further comprising the steps of:

transforming, using the computer processor, the serialized structure into a hierarchical structure based on a predetermined set of rules;

wherein the predetermined set of rules represent a schema for a transaction type and further comprises (i) a set of data value associations, (ii) one or more instruction hierarchies and (iii) a set of sequences.

6 . The method of claim 1 , wherein the hierarchical structure comprises mapping of request data into segments and outputs of the segments are combined into a rule set.

7 . The method of claim 1 , wherein element relationships between child and parent elements are preserved in the hierarchical format.

8 . The method of claim 1 , further comprising the step of:

applying, using the computer processor, a set of data mapping rules to the transaction to populate the hierarchical format with data associated with the transaction.

9 . The method of claim 1 , wherein the transaction comprises an electronic data interchange (EDI) transaction.

10 . The method of claim 9 , wherein the EDI transaction comprises X12 format.

11 . The method of claim 1 , wherein the serialized structure comprises sequences of elements wherein each string comprises at least a segment identifier, a plurality of elements and an element separator between at least two elements.

12 . The method of claim 1 , further comprising the step of: applying a flat-map algorithm to data in the hierarchical format.

13 . The method of claim 3 , wherein the delimiter line segment form comprises a segment identifier, an element and an element separator.

14 . The method of claim 5 , wherein each rule of the predetermined set of rules comprises a label so that a rule can be called in combination with one or more other rules in the form of labels for a subsequent rule function.

15 . The method of claim 5 , wherein the predetermined set of rules represent a user selected aggregation of rules that when arranged together by a user defined arrangement represents an electronic data interchange (EDI) data exchange set.

16 . The method of claim 1 , further comprising the step of:

serializing the hierarchical format to a second serialized structure.

17 . A system comprising:

an electronic input that receives transaction related data;

a memory that stores schema related data; and

a computer processor coupled to the electronic input and the memory and further configured to:

receive, via the electronic input, a transaction having a serialized structure;

identify a transaction type for the transaction;

identify a schema for the transaction type, wherein the schema includes a schema definition for an in-memory tree structure;

retrieve, from the memory, a schema correlated transform process wherein the schema correlated transform process transforms the serialized structure to a hierarchical structure; and

parse the transaction into a hierarchical format based the schema by generating the in-memory tree structure for the transaction based on the schema definition, wherein the in-memory tree structure comprises a tree of valid segment representations constructed based on a sequence instruction type, wherein the sequence instruction type represents a sequence rule as a guiding parser that sequences a state machine that receives data tree mapping node type outputs and in a designated order constructs the tree of valid segment representations.

18 . The system of claim 17 , wherein the serialized structure comprises a loop component, segment component and an element component.

19 . The system of claim 17 , wherein the serialized structure comprising sequences of elements in a delimiter line segment form.

20 . The system of claim 19 , wherein the computer processor is further configured to:

map the sequences of elements to a tree of key value pairs constructed in a hierarchical format.

21 . The method of claim 5 , wherein the step of transforming the serialized structure into a hierarchical structure comprises the step of populating the in-memory tree structure with request data according to the predetermined set for rules.

22 . The method of claim 21 , further comprising the step of executing an EDI Query Language (EQL) operation against the in-memory tree structure.

23 . The method of claim 22 , wherein the step of populating the in-memory tree structure comprises the step of enabling the EQL operation to insert the request data into the in-memory tree structure.

24 . The method of claim 1 , further comprising the step of transforming the in-memory tree structure into a transaction response object.