← Back to Patent Explorer
US5202977A Expired / Lapsed US ⏱️ 0.0 years remaining

Edi translation system using plurality of communication processes and de-enveloping procedure corresponding to transmitted communication process

Assignee: GXS Inc
•
Filing: 1990-07-13
•
Granted: 1993-04-13
•
Expires: 2010-07-13
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A language-based electronic data interchange ("EDI") translation system provides the capability to receive data in a first format from a source, execute a script to translate the data into a second format, and transmit the data in the second format to a destination. The system employs a data tree structure to enable flexible translation between EDI documents and application documents with differing data structures.

Inventors

  • 👤 Emmanuel K. Pasetes, Jr.
  • 👤 Lew Jenkins

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 12:47
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/10; G06F40/12; G06F40/14; G06F40/151; H; H04; H04L; H04L9/00; H04L9/40; H04L69/00; H04L69/06; H04L69/08; H04L69/18

Claims Analysis

Total Claims: 20
Claim 1
Independent Claim 204 words
A computer implemented method for translating electronic data in a computer system in a computer system from a first format to a second format, comprising the steps of: (a) determining which one of a plurality of communication protocols to utilize to receive data as a function of a communication process used to transmit the data to the computer system; (b) receiving input data as a unit of work in a first format, the data comprises a plurality of data components; (c) assigning a script name to the unit of work to identify a de-enveloping procedure that will be used to separate the plurality of data components of the received data into individual data components, the de-enveloping procedure identified being dependent on the communication process used to transmit the data to the computer system; (d) dividing the received data into individual data components by executing the identified de-enveloping procedure; (e) translating the individual data components from the first format into a second format which is chosen to be compatible with a desired destination for the data; and (f) arranging the individual data components into a package so that the package is available for transmission at any time by the computer system to the desired destination.
Claim 2
Dependent Claim 204 words
A computer implemented method for translating electronic data in a computer system in a computer system from a first format to a second format, comprising the steps of: (a) determining which one of a plurality of communication protocols to utilize to receive data as a function of a communication process used to transmit the data to the computer system; (b) receiving input data as a unit of work in a first format, the data comprises a plurality of data components; (c) assigning a script name to the unit of work to identify a de-enveloping procedure that will be used to separate the plurality of data components of the received data into individual data components, the de-enveloping procedure identified being dependent on the communication process used to transmit the data to the computer system; (d) dividing the received data into individual data components by executing the identified de-enveloping procedure; (e) translating the individual data components from the first format into a second format which is chosen to be compatible with a desired destination for the data; and (f) arranging the individual data components into a package so that the package is available for transmission at any time by the computer system to the desired destination.
Claim 3
Dependent Claim 59 words
The method of claim 1 wherein said translating step comprises the steps of: a. executing a first script to identify, classify, organize, route, and determine the translation requirements of said plurality of data components in said first format; and b. executing a second script to transform said plurality of data components in said first format to said second format.
Claim 4
Dependent Claim 13 words
The method of claim 2 wherein said scripts are executed by an interpreter.
Claim 5
Dependent Claim 13 words
The method of claim 2 wherein said scripts are executed by a compiler.
Claim 6
Dependent Claim 71 words
The method of claim 2 wherein said transforming step comprises the steps of: a. constructing a data tree structure having a plurality of branches and a plurality of nodes to represent a document or transaction; b. mapping one of said plurality of data components in said first format onto said data tree structure; c. mapping data in said data tree structure into said plurality of data components in said second format.
Claim 7
Dependent Claim 21 words
The method of claim 5 wherein said data tree structure is defined by specifications of an electronic data interchange document standard.
Claim 8
Dependent Claim 57 words
The method of claim 6 wherein said specifications comprise segment definitions and element definitions and wherein said step of constructing a data tree structure comprises the steps of: a. identifying a specification; b. defining a plurality of nodes, said nodes corresponding to said segment and element definitions; and c. developing a path specification for accessing said nodes.
Claim 9
Dependent Claim 51 words
The method of claim 7 wherein said step of identifying a specification comprises the steps of: a. identifying a specification identifier number; b. identifying an EDI standard; c. identifying an EDI standard version number; and d. using a hunt sequence associated with said version to resolve said segment and element definitions.
Claim 10
Dependent Claim 33 words
The method of claim 7 wherein said element definitions have associated data types, said data types being defined by a regular expression, said regular expression being computed when said element definition is read.
Claim 11
Dependent Claim 72 words
The method of claim 5 wherein said step of mapping to said data tree comprises the steps of: a. defining a plurality of data records, each of said records having one or more fields; b. parsing said one of said plurality of data components; c. matching data in said one of said plurality of data components to said fields in said record definitions; and d. binding said fields to said matching data.
Claim 12
Dependent Claim 52 words
The method of claim 5 wherein said step of mapping from said tree structure comprises the steps of: a. determining the identity of delimiters to be used to delimit said data; b. traversing said data tree in a depth first order; and c. formatting each of said nodes and placing said delimiters.
Claim 13
Dependent Claim 26 words
The method of claim 1 wherein said individual data components in said second format are maintained in a depository until they are transmitted to said destination.
Claim 14
Dependent Claim 73 words
The method of claim 1 wherein said script is defined in a programming language, said programming language incorporating a group of translating instructions corresponding to several translating steps in the flow of translating, including a pattern matching procedure for extracting data from a data stream, a data tree structure creation procedure, and a mapping procedure for mapping extracted data to a tree structure and mapping a data tree structure to an output stream.
Claim 15
Dependent Claim 24 words
The method of claim 13 wherein said programming language uses a relational model to represent data to facilitate processing by structured query language commands.
Claim 16
Dependent Claim 14 words
The method of claim 13 wherein said programming language is executed through an interpreter.
Claim 17
Dependent Claim 88 words
The method of claim 1 wherein said unit of work is divided into pages, said data components comprise application data components, and said dividing step comprises the steps of: a. marking a beginning of a data component; b. parsing through said unit of work; c. pattern matching data in said pages and extracting an identifier from each of said pages; d. marking an end of a data component when said identifier changes; and e. dividing out as a data component the data between said marked beginning and end.
Claim 18
Independent Claim 249 words
A system for translating electronic data from a first format to a second format, comprising: a network; and a computer coupled to the network for receiving data transmitted from the network, said computer including: a communication interface including a driver to accept data in a first format as a unit of work, the data comprises a plurality of data components, and a script which determines a communication protocol to utilize to accept the data as a function of a communication process used to transmit the data to the communication interface, a de-enveloper coupled to the communications interface, said de-enveloper includes means for receiving the data from the communication interface, means for assigning a script name to the unit of work to identify a de-enveloping procedure that will be used to separate the received data into individual data components, the identified de-enveloping procedure being dependent on the communication process used to transmit the data to the communication interface, and means for dividing the received data into individual data components by executing the identified de-enveloping procedure, a translator coupled to the de-enveloper, said translator manipulates the individual data components from the first format into a second format which is chosen to be compatible with a desired destination for the data, and an enveloper coupled to the translator and the communication interface, said enveloper groups the translated individual data components into a package so that the package is available for transmission at any time by the communication interface to the desired destination.
Claim 19
Independent Claim 249 words
A system for translating electronic data from a first format to a second format, comprising: a network; and a computer coupled to the network for receiving data transmitted from the network, said computer including: a communication interface including a driver to accept data in a first format as a unit of work, the data comprises a plurality of data components, and a script which determines a communication protocol to utilize to accept the data as a function of a communication process used to transmit the data to the communication interface, a de-enveloper coupled to the communications interface, said de-enveloper includes means for receiving the data from the communication interface, means for assigning a script name to the unit of work to identify a de-enveloping procedure that will be used to separate the received data into individual data components, the identified de-enveloping procedure being dependent on the communication process used to transmit the data to the communication interface, and means for dividing the received data into individual data components by executing the identified de-enveloping procedure, a translator coupled to the de-enveloper, said translator manipulates the individual data components from the first format into a second format which is chosen to be compatible with a desired destination for the data, and an enveloper coupled to the translator and the communication interface, said enveloper groups the translated individual data components into a package so that the package is available for transmission at any time by the communication interface to the desired destination.
Claim 20
Dependent Claim 51 words
The system according to claim 17 wherein said means for assigning a script name, further includes: means for dividing the received data into individual data components; means for identifying sender, receiver and transaction type; and means for determining the type of transformation needed and destination of the transformed individual data components.

References Cited (Backward Citations)

US4667290A Cited
US4729096A Cited
US4787035A Cited
US4860203A Cited
US4951196A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-04-12 1996-10-12 1997-04-13 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-04-12 2000-10-12 2001-04-13 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-04-12 2004-10-12 2005-04-13 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag