Patent US6101556A successfully refreshed from Google Patents.
US6101556A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for content-based dynamic formatting for interoperation of computing and EDI systems
Assignee: Sybase Inc
•
Filing: 1997-01-07
•
Granted: 2000-08-08
•
Expires: 2017-01-07
Abstract
Abstract A method and associated structures for dynamically reformatting messages in a distributed computing environment based upon message content as represented by a description of the input message format and the output message format. An input message received by the formatter of the present invention is decomposed into a canonical format stored by the formatter for further use in a rapidly searchable data structure (FGA). The input message data is decomposed in accordance with an input message format description which describes the content of the input message in terms of atomic data types and structures. An output message is then generated in response to a user request and in accordance with a user provided output message format description. The output message format description describes the content of the output format in terms of atomic data types and attributes as well as functional operations performed to derive the output field value. Related fields in an input message format, an output message format, and in the FGA are correlated by a common ID value associated with each field. The present invention thereby obviates the need, common to prior techniques, to construct a large number of procedures for conversion among any of a large number of input and output message formats. The present invention supports a rich set of atomic data types and attributes including complex, compound (e.g., repeating or recursively defined) message formats as well as mathematical, lookup, logical branching, and user callout functions applied to derive an output field value.
Inventors
- 👤 Harold Aron Piskiel
- 👤 John Arthur Carter
- 👤 Christopher Blair Preston
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 22:44
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/54; G06F9/546; H; H04; H04L; H04L12/00; H04L12/28; H04L12/40; H04L12/40169; H04L12/40176; H04L9/00; H04L9/40
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
174 words
A computer operable method for reformatting an input message to generate an output message comprising the steps of: providing an input message having an input message format description associated therewith, said input message format description including at least one input field description each having a field ID value associated therewith; providing an output message format description including at least one output field description each having a field ID value associated therewith; for each output field description in said output message format description, performing the steps of: locating an input field description in said input message format description of said input message, wherein said input field description has a field ID value equal to the field ID value associated with said each output field description of said output message format description; and transforming, in response to successfully locating said input field description, an input field value in said input message and described by said input field description into an output field value in accordance with said output field description of said output message format description.
Claim 2
Dependent Claim
174 words
A computer operable method for reformatting an input message to generate an output message comprising the steps of: providing an input message having an input message format description associated therewith, said input message format description including at least one input field description each having a field ID value associated therewith; providing an output message format description including at least one output field description each having a field ID value associated therewith; for each output field description in said output message format description, performing the steps of: locating an input field description in said input message format description of said input message, wherein said input field description has a field ID value equal to the field ID value associated with said each output field description of said output message format description; and transforming, in response to successfully locating said input field description, an input field value in said input message and described by said input field description into an output field value in accordance with said output field description of said output message format description.
Claim 3
Dependent Claim
67 words
The method of claim 1 further comprising the steps of: parsing said input message to identify at least one input field value in accordance with said at least one input field description of said input message format description; and associating, in an entry of a table, said at least one input field value with said field ID value associated with said at least one input field description.
Claim 4
Dependent Claim
200 words
The method of claim 1 wherein one of said at least one input field description is a compound input field description hierarchically comprised of zero or more branch nodes and at least one leaf node, wherein said branch nodes represent additional compound input field descriptions and wherein said at least one leaf node represents at least one non-compound input field description each associated with a field ID value, and wherein the method further comprises the steps of: recursing, until all of said at least one leaf node are parsed, the step of parsing for each of said zero or mode branch nodes to find all of said at least one leaf node in said compound input field description; and repeating, a number of times determined by the number of said at least one leaf node in said compound input field description, the steps of parsing and associating to identify a plurality of input field values in accordance with each of said at least one non-compound input field description of said input message format description and to associate each of said plurality of input field values with said field ID value associated with said at least one non-compound input field description.
Claim 5
Dependent Claim
74 words
The method of claim 1 wherein one of said at least one output field description is a repeating output field description and wherein the step of translating further comprises the step of: repeating the steps of locating and translating to generate a plurality of output field values in accordance with said one of said at least one output field description, wherein the number of repetitions is determined in accordance with the input field values.
Claim 6
Dependent Claim
38 words
The method of claim 2 wherein said input message comprises a plurality of input field values and wherein said input message format description includes a plurality of input field descriptions each having a field ID value associated therewith.
Claim 7
Dependent Claim
101 words
The method of claim 2 wherein one of said at least one input field description is a repeating input field description having a repetition limit associated therewith and wherein the method further comprises the step of: repeating, a number of times determined by said repetition limit, the steps of parsing and associating to identify a plurality of input field values in accordance with said at least one input field description of said input message format description and to associate each of said plurality of input field values with said field ID value associated with said at least one input field description.
Claim 8
Dependent Claim
153 words
The method of claim 1 wherein one of said at least one output field description is a compound output field description hierarchically comprised of zero or more branch nodes and at least one leaf node, wherein said branch nodes represent additional compound output field descriptions and wherein said at least one leaf node represents at least one non-compound output field description each associated with a field ID value, and wherein the step of translating further comprises the steps of: recursing the step of translating for each of said zero or more branch nodes to find all of said at least one leaf node in said compound output field description; and repeating the step of translating an input field value to an output field value for each of said at least one leaf node in said compound output field description, wherein the number of repetitions is determined in accordance with the input field values.
Claim 9
Dependent Claim
79 words
The method of claim 5 further comprising the step of: indexing a plurality of entries in said table wherein each of said plurality of entries associates one input field value of said plurality of input field values with a field ID value of one of said plurality of field descriptions of said input message format description, wherein said plurality of entries are indexed according to the value of said field ID value of each of said plurality of entries.
Claim 10
Dependent Claim
139 words
In a distributed computing environment with N computing processes which communicate with one another by exchanging messages, where N is an integer of at least 3 and the messages from different computing processes have different message formats, a method of reformatting the messages comprising the steps of: providing a format repository with a plurality of message format descriptions that are each associated with a message format of one of the computing processes; then receiving an input message from one of the computing processes; retrieving an input message format description from the format repository that is associated with the input message; parsing the input message in accordance with the input message format description; receiving a request for an output message from another one of the computing processes; and generating the output message using the parsed input message and the request.
Claim 11
Dependent Claim
139 words
In a distributed computing environment with N computing processes which communicate with one another by exchanging messages, where N is an integer of at least 3 and the messages from different computing processes have different message formats, a method of reformatting the messages comprising the steps of: providing a format repository with a plurality of message format descriptions that are each associated with a message format of one of the computing processes; then receiving an input message from one of the computing processes; retrieving an input message format description from the format repository that is associated with the input message; parsing the input message in accordance with the input message format description; receiving a request for an output message from another one of the computing processes; and generating the output message using the parsed input message and the request.
Claim 12
Dependent Claim
25 words
The method of claim 9 wherein the message format descriptions contain descriptive configuration and structural information regarding message format and are devoid of message data.
Claim 13
Dependent Claim
26 words
The method of claim 9 further comprising the step of: generating the output message using a portion of the parsed input message selected by the request.
Claim 14
Dependent Claim
21 words
The method of claim 9 further comprising the step of: generating the output message using all of the parsed input message.
Claim 15
Dependent Claim
32 words
The method of claim 9 further comprising the steps of: constructing an input format K-tree corresponding to the input message format description; and generating the output message using the input format K-tree.
Claim 16
Dependent Claim
38 words
The method of claim 9 further comprising the steps of: retrieving an output message format description from the format repository that is associated with the output message; and generating the output message using the output message format description.
Claim 17
Dependent Claim
32 words
The method of claim 14 further comprising the steps of: constructing an output format K-tree corresponding to the output message format description; and generating the output message using the output format K-tree.
Claim 18
Dependent Claim
69 words
The method of claim 14 further comprising the steps of: locating an input field ID value in the input message format description; locating an output field ID value in the output message format description; and transforming an input field value in the input message into an output field value in the output message in response to detecting a match between the input field ID and the output field ID.
Claim 19
Dependent Claim
289 words
In a distributed computing environment with N computing processes which communicate with one another by exchanging messages, where N is an integer of at least 3 and the messages from different computing processes have different message formats, a method of reformatting the messages so that the N computing processes are compatible with one another, the method comprising the steps of: providing a format repository that includes N message format descriptions, wherein each of the message format descriptions is associated with a message format of one of the computing processes, contains descriptive configuration and structural information regarding message format and is devoid of message data; then receiving an input message from one of the computing processes, wherein the input message includes message data; retrieving an input message format description from the format repository that is associated with the input message; constructing an input format K-tree corresponding to the input message format description, wherein the input format K-tree contains descriptive configuration and structural information regarding message format and is devoid of message data; parsing the input message in accordance with the input message format description to provide a parsed input message in canonical form; receiving a request for an output message from another of the computing processes; retrieving an output message format description from the format repository that is associated with the output message; constructing an output format K-tree corresponding to the output message format description, wherein the output format K-tree contains descriptive configuration and structural information regarding message format and is devoid of message data; and generating the output message using the parsed input message, the input format K-tree and the output format K-tree, wherein the output message contains at least some of the message data in the input message.
Claim 20
Dependent Claim
289 words
In a distributed computing environment with N computing processes which communicate with one another by exchanging messages, where N is an integer of at least 3 and the messages from different computing processes have different message formats, a method of reformatting the messages so that the N computing processes are compatible with one another, the method comprising the steps of: providing a format repository that includes N message format descriptions, wherein each of the message format descriptions is associated with a message format of one of the computing processes, contains descriptive configuration and structural information regarding message format and is devoid of message data; then receiving an input message from one of the computing processes, wherein the input message includes message data; retrieving an input message format description from the format repository that is associated with the input message; constructing an input format K-tree corresponding to the input message format description, wherein the input format K-tree contains descriptive configuration and structural information regarding message format and is devoid of message data; parsing the input message in accordance with the input message format description to provide a parsed input message in canonical form; receiving a request for an output message from another of the computing processes; retrieving an output message format description from the format repository that is associated with the output message; constructing an output format K-tree corresponding to the output message format description, wherein the output format K-tree contains descriptive configuration and structural information regarding message format and is devoid of message data; and generating the output message using the parsed input message, the input format K-tree and the output format K-tree, wherein the output message contains at least some of the message data in the input message.
Claim 21
Dependent Claim
27 words
The method of claim 17 further comprising the step of: generating the output message in accordance with a structure and sequence determined by the output format K-tree.
Claim 22
Dependent Claim
69 words
The method of claim 17 further comprising the steps of: locating an input field ID value in the input message format description; locating an output field ID value in the output message format description; and transforming an input field value in the input message into an output field value in the output message in response to detecting a match between the input field ID and the output field ID.
Claim 23
Dependent Claim
86 words
The method of claim 17 further comprising the steps of: adding an N+1 computing process to the distributing computing environment, wherein the N+1 computing process has a different message format than the other N computing processes; and adding an N+1 message format description to the format repository that is associated with the N+1 computing process, contains descriptive configuration and structural information regarding message format and is devoid of message data, thereby providing message exchange compatibility between the N+1 computing process and the other N computing processes.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-08-08 | 2004-02-07 | 2004-08-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-08-08 | 2008-02-07 | 2008-08-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-08-08 | 2012-02-07 | 2012-08-08 | $7700.00 | Window Closed / Lapsed |