Enhanced messaging transaction performance with auto-selected dual-tag fields

US9619443B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9619443-B2
Application numberUS-201213411689-A
CountryUS
Kind codeB2
Filing dateMar 5, 2012
Priority dateMar 5, 2012
Publication dateApr 11, 2017
Grant dateApr 11, 2017

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A schema for a mark-up language provides a meaningful name and a short name, both of which are valid, for each of a plurality of data fields in messages coded in a mark-up language such as extensible mark-up language (XML). Code conversion of legacy data to use the short names reduces data volume for transmission, storage and processing while allowing the message to be automatically displayed for inspection, diagnostics and data synchronization during a transformation project such as an upgrade of a data processing system for verification of system operation. The ability to display meaningful names only for such purposes allows text editor arrangements to be used for data synchronization while use of short names improves virtually all aspects of system performance.

First claim

Opening claim text (preview).

We claim: 1. A method of synchronizing data coded in a mark-up language, said method comprising steps of reducing size of a message containing a tag delimiting a data field or table by substituting a short name in said tag for a meaningful name in said tag in said message, collecting an association of said short name and said meaningful name together with a table definition or field definition in a schema or extensible markup language schema definition (XSD) to establish two concurrently valid names for each data table or field in said message whereby said short name and said meaningful name can be used interchangeably in said tag delimiting said table or data field, accessing said schema or XSD with said meaningful name or said short name, respectively, in said message over separate processing paths, displaying and processing said message using said meaningful name accessed from said schema or XSD for facilitating detection and correction of errors, and transmitting, storing or processing said message using said short name, whereby said processing of said message, including accessing and processing of data in fields or tables delimited by said tags using either of said concurrently valid meaningful name or said concurrently valid short name concurrently and interchangeably for each respective table or data field is enabled. 2. The method as recited in claim 1 , wherein said mark-up language is extensible mark-up language. 3. The method as recited in claim 1 , comprising a further step of compressing said message. 4. The method as recited in claim 3 , wherein said step of compressing said message includes removing one of a start tag and an end tag from a field or table in said message. 5. The method as recited in claim 1 , including a further step of editing said message including said meaningful name as a tag. 6. The method as recited in claim 5 , including the further step of verifying changes made in said message by said editing step. 7. The method as recited in claim 6 , wherein said verifying step includes processing said message using said meaningful name as a tag. 8. The method as recited in claim 7 , including a further step of substituting said short name for said meaningful name. 9. The method as recited in claim 1 , wherein a plurality of said short names form an alphanumeric sequence. 10. A method for verification of a data processing system capable of processing data coded in a mark-up language during a transformation project, said method comprising steps of reducing size of a message containing a tag delimiting a table or data field or table by substituting a short name in said tag for a meaningful name in said tag in said message, collecting an association of said short name and said meaningful name together with a table or field definition in a schema or extensible markup language schema definition (XSD) to establish two concurrently valid names for each table or data field in said message whereby said short name and said meaningful name can be used interchangeably in said tag delimiting said table or data field, accessing said schema or XSD with said meaningful name or said short name, respectively, in said message over separate processing paths, displaying and processing said message using said meaningful name accessed from said schema or XSD for facilitating detection and correction of errors, and transmitting, storing or processing said message using said short name, whereby said processing of said message including accessing and processing of data in fields or tables delimited by said tags using either of said concurrently valid meaningful name or said concurrently valid short name concurrently and interchangeably for each respective data field is enabled. 11. The method as recited in claim 10 , wherein said mark-up language is extensible mark-up language. 12. The method as recited in claim 10 , comprising a further step of compressing said message. 13. The method as recited in claim 12 , wherein said step of compressing said message includes removing one of a start tag and an end tag from a field or table in said message. 14. The method as recited in claim 12 , including a further step of editing said message including said meaningful name as a tag. 15. The method as recited in claim 14 , including the further step of verifying changes made in said message by said editing step. 16. The method as recited in claim 15 , wherein said verifying step includes processing said message using said meaningful name as a tag. 17. The method as recited in claim 16 , including a further step of substituting said short name for said meaningful name. 18. The method as recited in claim 10 , wherein a plurality of said short names form an alphanumeric sequence. 19. A data processing system for processing data coded in a mark-up language, said data processing system comprising a data processor including two separate processing paths, and a memory, wherein a portion of said memory is configured as a schema of said mark-up language or an extensible markup language schema definition (XSD) and wherein said schema or XSD includes a table or field definition and provides two different concurrently valid names associated with and delimiting each of a plurality of fields or tables in messages coded in said mark-up language, said two different concurrently valid names including a short name and a meaningful name, whereby said short name and said meaningful name can be used interchangeably in said messages and respectively accessed from said schema or XSD in said memory through a respective one of said two separate processing paths such that a message can be processed and displayed using meaningful names to facilitate detection and correction of errors and validation of said message and said message can be transmitted, stored or processed using a short name, whereby said processing of said message using either of said concurrently valid meaningful name or said concurrently valid short name concurrently and interchangeably for each respective data field is enabled. 20. A data processing system as recited in claim 19 , wherein said mark-up language is extensible mark-up language.

Assignees

Inventors

Classifications

  • G06F40/157Primary

    using dictionaries or tables · CPC title

  • Physics · mapped topic

  • Physics · mapped topic

  • Markup, e.g. Standard Generalized Markup Language [SGML] or Document Type Definition [DTD] · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9619443B2 cover?
A schema for a mark-up language provides a meaningful name and a short name, both of which are valid, for each of a plurality of data fields in messages coded in a mark-up language such as extensible mark-up language (XML). Code conversion of legacy data to use the short names reduces data volume for transmission, storage and processing while allowing the message to be automatically displayed f…
Who is the assignee on this patent?
Bostick James Edward, Ganci Jr John Michael, Kaemmerer John Paul, and 2 more
What technology area does this patent fall under?
Primary CPC classification G06F40/157. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Apr 11 2017 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).