Patent ID: 8224980

Claim:
A method for adaptively parsing and compressing messages, comprising: composing an outgoing message in a marked up language; identifying one or more unique keys associated with respective one or more tag elements in the outgoing message using a dictionary; replacing said one or more tag elements in the outgoing message with respective said one or more unique keys identified in the dictionary; parsing an incoming message formatted in the marked up language having a plurality of tag elements; associating the plurality of tag elements in the incoming message with a plurality of unique keys respectively; building the dictionary including at least the tag element to the unique key associations, the dictionary being built incrementally from existing traffic, each entry in the dictionary representing a tag that was sent in the outgoing message or received in the incoming message or combinations thereof, wherein the dictionary that is built adaptively is used to compress the outgoing message, said unique keys being indices of corresponding nodes of a tree data structure built associated with parsing of the marked up language; constructing a message pattern of the outgoing message upon its first usage and filling in additional elements dynamically for each new instantiation, wherein the message pattern enables accelerated message composition, the constructing further including deriving a code path for building the tree data structure representing the outgoing message, generating the tag elements associated with the outgoing message corresponding to newly added nodes as the tree data structure is built, saving the generated tag elements in an ordered list data structure; and parsing a second incoming message using one or more associations in the dictionary.