The present invention relates to the transformation of message formats between components of a distributed data processing system and, in particular, to a tool for selecting message transformations.
Distributed data processing systems communicate by the exchange of messages. Various products are known which allow messages to be transmitted between heterogeneous platforms, such as IBM's MQSeries products (“IBM” and “MQSeries” are both trade marks of International Business Machines Corporation in the United States, other countries, or both). Such transmission is not intelligent in that neither the data content nor the internal format of the messages are transformed so as to be intelligible to applications on the receiving platform. This is because the format of these messages may be inherent to particular nodes of the system or the format may be determined by the specific different applications which are running on the system. In both cases, it is necessary to transform message formats originating from one system component (operating system or application) to formats compatible with other system components. Such transformations have long been known in the art, for example, conversion between different date conventions (DD/MM/YY to MM/DD/YYYY, say).
Although such conversion could be performed by the application programs themselves, in one recent development in the message processing art, so-called message brokers have been developed to route messages intelligently between nodes and to transform the message formats as required.
Two recent message broker products from IBM, MQSeries Integrator Versions 1 and 2, both include a so-called “formatter” which transforms messages from one application format into another. The formatter used in both the IBM products is based on one licensed from New Era of Networks, Inc (NEON) and is described in International Patent Application WO 98/30962 “Method for content based dynamic formatting for interoperation of computing and EDI systems”. As one example, these products can transform messages in fixed format, (where each message, and each field within the message, has a specified length in bytes) into standard XML BOD (Business Object Descriptor) messages (XML is the abbreviation for Extended Markup Language).
A general illustration of message transformation is shown in
However, in these systems, the transformations between different types of messages must be predetermined manually and loaded into the transformation engine (formatter and database). This can lead to a very large number of transformations having to be considered as the number of message formats and types of message, even in one system or application, can be very large, particularly if every conceivable transformation must be explicitly recorded. The NEON system reduces this problem somewhat by breaking down messages into basic named canonical (meta-data) components, common to different applications and formats and by using matching of canonical data to determine the appropriate output message conversion. Even this information about transformations at the canonical level, although cutting down the sheer volume of individual transformation pairs to be stored, must still be determined in advance and entered manually. This task is usually performed by a System Administrator using a graphical user interface to enter complete message definitions for different applications and the specific correspondence with format meta-data components into the formatter's database. Typical meta-data could include such terms as “floating point number”, “tag” or “delimiter”.
There is thus a need to reduce the burden on the system administrator of defining and manually entering permitted message transformations within the business application architecture.
Accordingly, the present invention provides a message transformation selection tool for use in a distributed message processing system, said system including message transformation means for transforming an input message in any of a plurality of formats recognised by one component of said system into an output message in one of a plurality of different formats recognised by another component of said system and a message log for storing representative samples of messages processed by the respective system components; said selection tool comprising: means for determining compatibility of each field of each of said plurality of input message formats with one or more fields of said plurality of output message formats; means for statistically analysing numerical values of message fields in messages stored in said message log; and selection means responsive to said compatibility determination and said statistical analysis to select the best fit output message field into which to transform a given input message field.
Preferably, the tool is implemented as a computer program.
Although the tool may be provided separately, the invention may also be incorporated within a message broker and the invention comprises message brokers including such a tool.
Alternatively, the present invention may be provided as a computer program product, a message broker, or a method of selecting a message transformation in a distributed message processing system.
Preferably, the tool and method of the invention statistically analyse the numerical distribution (i.e. rate of occurrence) of values in the message fields, equivalent to producing a histogram. The values can be anything which may be coded in the fields, such as colours or sizes of goods. Alternatively, they may be prices or other numerical ranges. Selection is on the basis of the best fit distribution for all compatible fields.
The tool may entirely determine the transformation to be used or it may simply rank the output message fields in accordance with the statistical analysis, leaving it to the system administrator to make the final selection.
Compatibility is most easily determined from meta-data, which may be stored for the various fields in a message repository manager which is part of the overall system. This meta-data may include the range of numerical values found in particular fields and may also include the full value distribution statistics for the field.
A basic check for compatibility, based on meta-data, can compare the types of field. Thus, “char”, “short”, “int” and “long” are all potentially compatible field types, “float” and “double” are compatible types, “char[32]”, “char[256]” and “string” are also examples of compatible character types.
Additionally, a looser compatibility selection could be made on the basis of field names being identical, synonymous or otherwise lexically similar.
The invention will now be described by way of example only, with reference to a preferred embodiment thereof, as illustrated in the accompanying drawings, in which:
In
Taking a concrete example, let us say that we wish to integrate an application running under the IBM CICS transaction processing environment, written in Cobol, running on System A, with one from another ERP (Enterprise Resource Planning) system supplier, running on System B (‘CICS’ is a registered trademark of International Business Machines Corporation in the United States, other countries, or both.) The Cobol application sends a message in a proprietary (fixed) format whereas the other supplier uses the self-defining XML (Extended Markup Language) message format, to represent a business transaction as a Business Object Descriptor (BOD), which is a standard of the Open Applications Group (openapplications.org) and which builds on XML.
Part of the task of the enterprise's system administrator is to define message transformations which map between the message formats used on one system and those used in the other system.
This person has to:
The invention assists the administrator in making the decision about which fields match each other in step 4 and thus acts as a productivity tool.
Returning to
The operation of the Message analyser 26 is as follows, as further illustrated in the flow diagram of
Augment the message meta-data in the message repository manager 25 for that field with the respective statistics and information about compatibility (step 37).
The metadata from MRM 25 is applied, together with an input message from System A, to a semi-automated message reformatter consisting of compatibility determination means 23, transformation selection means 24 and a conventional message format mapping component 29, which supplies the appropriate output message field. Although shown as part of the message broker 20, the compatibility determination means 23, transformation selection means 24 and message analyser 26 could be a tool, separate from the main message broker for assisting a manual selection by the system administrator.
The operation of the reformatter is described in the flow diagram of
In response to receipt of an input message from system 21 (step 51), a message format description for Message Format A is loaded (step 52);
Rank the fields in Message Format B with respect to Fa using the numerical score (step 57); in most cases only one field will have a high score; all the others will have a score close to zero: in that case the highest ranked Fa can safely be mapped to Fb.
There are a variety of ways of measuring the similarity of two sets of data values; they are usually based on the idea of comparing the statistical distributions of values in each of the datasets.
For example, if we characterise the statistics of the logs for:
One known approach would be to use Bayes theorem to define the sim(Ha1, Hb2) as the probability that Ha1 and Hb2 both come from the same source distribution.
In summary, in the example of the invention described with reference to the drawings, compatible fields are first selected. Then a similarity measure for each pair of fields is derived, based on the statistical analysis of the contents of the two logs. For each field in the input message log, the output message fields are then ranked in order of decreasing similarity. Finally, the transformation is either automatically made to the most similar field or the administrator is allowed to select from the most promising candidates.
Number | Date | Country | Kind |
---|---|---|---|
0013031.0 | May 2000 | GB | national |
This application is a continuation application of U.S. patent application Ser. No. 09/764,610, filed on Jan. 17, 2001, now U.S. Pat. No. 7,493,415 which is hereby incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
4791558 | Chaitin et al. | Dec 1988 | A |
5339434 | Rusis | Aug 1994 | A |
5608783 | Ichnowski et al. | Mar 1997 | A |
5608874 | Ogawa et al. | Mar 1997 | A |
5627972 | Shear | May 1997 | A |
5956688 | Kokubo et al. | Sep 1999 | A |
5999938 | Bliss et al. | Dec 1999 | A |
6032147 | Williams et al. | Feb 2000 | A |
6252946 | Glowny et al. | Jun 2001 | B1 |
6330617 | Bamforth et al. | Dec 2001 | B1 |
6356863 | Sayle | Mar 2002 | B1 |
6359901 | Todd et al. | Mar 2002 | B1 |
6493761 | Baker et al. | Dec 2002 | B1 |
6560608 | Tomm et al. | May 2003 | B1 |
6714979 | Brandt et al. | Mar 2004 | B1 |
6845507 | Kenton | Jan 2005 | B2 |
20010047311 | Singh | Nov 2001 | A1 |
20030041095 | Konda et al. | Feb 2003 | A1 |
Number | Date | Country |
---|---|---|
2304944 | Oct 2000 | GB |
9830962 | Jul 1998 | WO |
Number | Date | Country | |
---|---|---|---|
20090125638 A1 | May 2009 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09764610 | Jan 2001 | US |
Child | 12353720 | US |