Methods and systems for message translation and parsing of data structures in a distributed component architecture

• US 6,836,890 B1
• Filed: 11/01/2000
• Issued: 12/28/2004
• Est. Priority Date: 11/01/2000
• Status: Active Grant

• Current Assignee: Oracle America, Inc. (Oracle Corporation)
• Original Assignee: SeeBeyond Technology Corporation (Oracle Corporation)
• Inventors: Waldorf, Jerry A., Srihari, Rangaswamy, Domingo, Samuel N., Watts, Lealon E. Jr., Inada, Nathan K.
• Primary Examiner(s): COURTENAY III, ST JOHN
• Application Number:
  US09/704,275
• Time in Patent Office: 1,518 Days
• Field of Search: 719/310-320, 719/328, 709/206, 709/246, 710/52-57
• US Class Current: 719/313
• CPC Class Codes: G06F 2209/547 Messaging middleware
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues

Abstract

The present invention is related to systems and methods that parse and/or translate inbound messages into outbound messages such that disparate computer systems can communicate intelligibly. In one embodiment, a system recursively parses the inbound message such that relatively fewer outbound message structure definitions are required and advantageously decreases the usage of resources by the system. Further, one system in accordance with the present invention allows an operator to configure the identity of a delimiter in the inbound message. The delimiter can span multiple characters and includes the logical inverse of a set of delimiters. The outbound message can be accessed at nodes within a hierarchy, as well as at leaves. Thus, a user need not know the precise location of data within the outbound message. A set of updating rules further permits the updating of an outbound message without having to re-parse an entire inbound message.

Claims

1. A method of modifying a behavior of a message structure by definable parsing modifiers, the method comprising:

mapping fields of an event definition to the message structure;

relating at least one field in the event definition to an element of a modifier list;

examining the modifier list to determine whether a field in the event definition corresponds to any element of the modifier list;

parsing for the field in accordance with a default list if no element of the modifier list corresponds with the field; and

parsing for the field in accordance with the element of the modifier list when the element corresponds with the field.

2. The method as defined in claim 1, wherein the element comprises a substitute compound character delimiter for a delimiter in the field of the event definition.

3. The method as defined in claim 1, wherein the element comprises a scavenger modifier character, where the scavenger modifier character causes the parsing to eliminate characters corresponding to the scavenger modifier character while mapping to the corresponding fields of the message structure.

4. The method as defined in claim 1, wherein the element comprises a “

not tagged”

modifier, where the not tagged modifier causes the parsing to eliminate strings that correspond to the not tagged modifier while mapping to the corresponding fields of the message structure.

5. The method as defined in claim 1, wherein the element comprises an array repetition modifier, where the array repetition modifier specifies a range of repetitions that the field in the event definition can take when building the message structure.

6. The method as defined in claim 1, wherein the element comprises a group repetition modifier, where the group repetition modifier identifies groups of fields in the event definition that repeat a number of times specified by the group repetition modifier when building the message structure.

7. The method as defined in claim 1, further comprising:

displaying a graphical representation of the message structure, where fields of the message structure correspond to objects in the display; and

enabling a user to define parsing modifiers by drag and drop operation on the display.

8. A method of parsing a message to a hierarchical message structure where the message is parsed to both nodes and leaves of the hierarchical message structure such that a node of the hierarchical message structure contains the content of the -tree that branches from the node, the method comprising:

receiving an inbound message;

retrieving an event definition adapted to parse the inbound message;

determining whether a field is associated with the node or a leaf;

parsing the contents of the tree of the node when the field is associated with the node; and

parsing only the content of the field to the leaf when the field is associated with the leaf.

9. The method as defined in claim 8, wherein the field of the inbound message is separated from another field by a delimiter.

10. The method as defined in claim 8, further including mapping the contents of the hierarchical message structure to an outbound message structure upon completion of the parsing to the hierarchical message structure.

11. A method of updating a hierarchical message structure, wherein the message structure contains the contents of a first message in both nodes and leaves, and where the update is a second message, the method comprising:

receiving a pointer, where the pointer indicates a point within the second message where the second message contains updated content;

receiving at least a portion of the second message, where the portion includes the updated content;

parsing the second message to the message structure from the point indicated by the pointer;

deleting a first tree of nodes upon the placement of data into a first parent node of the first tree of nodes; and

invalidating data in a second parent node with a second tree upon the placement of data in a field within the second tree of the second parent node.

12. The method as defined in claim 11, further comprising replacing the contents of a parent node, wherein the parent node has a tree, in response to detection of the presence of invalid data in the parent node, and where the contents are replaced by the contents from the nodes that form the tree of the parent node.

13. The method as defined in claim 11, further comprising populating data to an empty node upon detection that the empty node is devoid of data, where the data populated is parsed from a parent node of the empty node.

14. The method as defined in claim 11, wherein the invalidating data comprises deleting data.

15. A method of mapping a message from a first format to a second format, the method comprising:

receiving an inbound message, where the inbound message is formatted in the first format;

receiving an inbound message structure and at least one recursive structure, where the recursive structure can append to the inbound message structure; and

recursively extracting the inbound message to an outbound message by formatting the inbound message from the first format to the second format in accordance with the inbound message structure and the recursive structure, where the parsing of the inbound message and the recursions of the recursive structure are indicated by a plurality of delimiters embedded within the inbound message.

16. The method as defined in claim 15, further comprising:

identifying whether a field in the inbound message structure is associated with a node or a leaf;

parsing the contents of multiple fields corresponding to a tree of the node when the field is associated with the node; and

parsing only the content of the field when the field is associated with the leaf.

17. The method as defined in claim 15, further comprising:

receiving a query for a node in the inbound message structure for a first content, where the node contains links to children nodes;

accessing the children nodes to collect the content therein; and

populating the node with the collected content such that the collected content is available to respond to the query.

18. The method as defined in claim 15, further comprising updating the inbound message structure without receiving all of a new inbound message.

19. The method as defined in claim 15, further comprising receiving a list at runtime, where the list modifies the characteristics of the delimiters such that the list alters the parsing of the inbound message to the inbound message structure.

20. A system that maps a message from a first format to a second format, the system comprising:

means for receiving an inbound message, where the inbound message is formatted in the first format;

means for receiving an inbound message structure and at least one recursive structure, where the recursive structure can append to the inbound message structure; and

means for recursively extracting the inbound message to an outbound message by formatting the inbound message from the first format to the second format in accordance with the inbound message structure and the recursive structure, where the parsing of the inbound message and the recursions of the recursive structure are indicated by a plurality of delimiters embedded within the inbound message.