Processing module, a device, and a method for processing of XML data

• US 8,683,320 B2
• Filed: 02/15/2010
• Issued: 03/25/2014
• Est. Priority Date: 02/13/2009
• Status: Expired due to Fees

• Current Assignee: Siemens AG
• Original Assignee: Siemens AG
• Inventors: Heuer, Jrg, Kbisch, Sebastian
• Primary Examiner(s): HUYNH, THU V
• Application Number:
  US12/705,658
• Publication Number:
  US 20100211867A1
• Time in Patent Office: 1,499 Days
• Field of Search: 715234-237, 715/239, 715/242, 715/254, 717/143
• US Class Current: 715/234
• CPC Class Codes: G06F 40/143 Markup, e.g. Standard Generalized Markup Language [SGML] or Document Type Definition [DTD]
• CPC Class Codes: G06F 40/205 Parsing

Abstract

For processing of XML data by use of a finite state automaton, the XML data is based on a predetermined XML schema and the finite state automaton has states and transitions being arranged based on the predetermined XML schema. In the finite state automaton, at least one of the transitions of the finite state automaton, which refers to an element or attribute of the XML schema, has a variable length binary code, the variable length binary code being arranged to code the element or attribute of the XML schema. An improved handling of XML data in several systems or devices of several technical areas is provided, wherein saving of memory resources and processing resources or costs in the systems and devices is enabled.

Claims

1. A processing module, embodied as one or more computer program products stored in non-transitory machine-readable media, said processing module being configured for processing of extensible markup language (XML) data by use of a finite state automaton, wherein:

said XML data is based on a predetermined XML schema;

said finite state automaton comprises states and transitions, said states and transitions being arranged based on said predetermined XML schema;

at least one transition of said transitions, which refers to an element or attribute of said XML schema comprises a variable length binary code, said variable length binary code being arranged to code said element or attribute of said XML schema;

at least one transition comprises a fixed length binary code as a further binary code, said fixed length binary code being arranged to code said element or attribute of said XML schema; and

wherein said fixed length binary code represents a code according to a first binary XML format;

wherein said variable length binary code represents a code according to a second binary XML format and wherein said finite state automaton is generated by;

generating a first finite state automaton according to said first binary XML format by use of said XML schema;

generating a second finite state automaton according to said second binary XML format by use of said XML schema;

identifying element and attribute transitions of same elements and attributes in both the first finite state automaton and the second finite state automaton; and

concatenating the fixed length binary codes in said second finite state automaton assigned to code transitions or said second finite state automaton;

wherein the variable length binary code results from a concatenation of the fixed length binary codes.

2. The processing module according to claim 1, wherein, if said XML data is textual XML data, said processing module is configured to encode said textual XML data into XML data in a binary XML format, wherein said states and transitions of said finite state automaton are configured to encode said textual XML data into said XML data in said binary XML format by use of said fixed length binary code or by use of said variable length binary code assigned to said at least one code transition of said transitions.

3. The processing module according to claim 1, wherein, if said XML data is XML data in a binary XML format, said processing module is configured to decode said XML data in said binary XML format into textual XML data, wherein said states and transitions of said finite state automaton are configured to decode said XML data in said binary XML format into said textual XML data by use of said fixed length binary code or by use of said variable length binary code assigned to each of said code transitions.

4. The processing module according to claim 1, wherein said fixed length binary code represents a code according to binary XML format World Wide Web Consortium (W3C) Efficient XML Interchange (EXI).

5. The processing module according to claim 1, wherein said variable length binary code represents a code according to binary XML format Binary MPEG Format (BiM).

6. A processing module, embodied as one or more computer program products stored in non-transitory machine-readable media, said processing module being configured for processing of extensible markup language (XML) data by use of a finite state automaton, wherein:

said XML data is based on a predetermined XML schema;

said finite state automaton comprises states and transitions, said states and transitions being arranged based on said predetermined XML schema;

at least one transition of said transitions, which refers to an element or attribute of said XML schema comprises a variable length binary code, said variable length binary code being arranged to code said element or attribute of said XML schema;

wherein said at least one transition comprises a fixed length binary code as a further binary code, said fixed length binary code being arranged to code said element or attribute of said XML schema;

wherein said fixed length binary code represents a code according to binary XML format World Wide Web Consortium (W3C) Efficient XML Interchange (EXI);

wherein said variable length binary code represents a code according to binary XML format Binary MPEG Format (BiM) and wherein said finite state automaton is generated by;

generating of a first finite state automaton according to said binary XML format EXI by use of said XML schema;

generating of a second finite state automaton according to said binary XML format BiM by use of said XML schema;

identifying of element and attribute transitions of same elements and attributes in both the first finite state automaton and the second finite state automaton;

concatenating of the fixed length binary codes in said second finite state automaton assigned to code transitions or said second finite state automaton, which lead;

from a start state in said second finite state automaton to a simple state prior to an element or attribute transition in said second finite state automaton, said simple state being a state subsequent to said start state;

from a type state in said second finite state automaton to a further or subsequent simple state prior to an element or attribute transition in said second finite state automaton;

from a type state in said second finite state automaton to an end state in said second finite state automaton, if no further type state is provided between said type state and said end state;

or

from a start state in said second finite state automaton to an end state in said second finite state automaton, if no further type state is provided between said start state and said end state;

the concatenating of the fixed length binary codes resulting in the variable length binary codes;

amending of said first finite state automaton by one of the following;

adding of each of said variable length binary codes as an additional binary code to a corresponding code of said first finite state automaton or replacing of each code of said first finite state automaton by a corresponding variable length binary code from said variable length binary codes; and

providing of said first finite state automaton as said finite state automaton.

7. A device, comprising a processing module embodied as one or more computer program products stored in non-transitory machine-readable media, said processing module being configured for processing of extensible markup language (XML) data by use of a finite state automaton, wherein:

said XML data is based on a predetermined XML schema;

said finite state automaton comprises states and transitions, said states and transitions being arranged based on said predetermined XML schema;

at least one transition of said transitions, which refers to an element or attribute of said XML schema comprises a variable length binary code, said variable length binary code being arranged to code said element or attribute of said XML schema;

at least one transition comprises a fixed length binary code as a further binary code, said fixed length binary code being arranged to code said element or attribute of said XML schema;

wherein said fixed length binary code represents a code according to a first binary XML format;

wherein said variable length binary code represents a code according to a second binary XML format and wherein said finite state automaton is generated by;

generating a first finite state automaton according to said first binary XML format by use of said XML schema;

generating a second finite state automaton according to said second binary XML format by use of said XML schema;

identifying element and attribute transitions of same elements and attributes in both the first finite state automaton and the second finite state automaton;

concatenating the fixed length binary codes in said second finite state automaton assigned to code transitions or said second finite state automaton; and

wherein the variable length binary code results from a concatenation of the fixed length binary codes.

8. The device according to claim 7, said device comprising a transmitting module, said transmitting module being operable to transmit XML data processed by said processing module.

9. The device according to claim 8, wherein said XML data processed by said processing module is XML data in a binary XML format.

10. The device according to claim 7, said device comprising a receiving module, said processing module being configured to process XML data received by said receiving module.

11. The device according to claim 10, wherein said XML data received by said receiving module is XML data in a binary XML format.

12. A device, comprising a processing module embodied as one or more computer program products stored in non-transitory machine-readable media, said processing module being configured for processing of extensible markup language (XML) data by use of a finite state automaton, wherein:

said XML data is based on a predetermined XML schema;

said finite state automaton comprises states and transitions, said states and transitions being arranged based on said predetermined XML schema;

at least one transition of said transitions, which refers to an element or attribute of said XML schema comprises a variable length binary code, said variable length binary code being arranged to code said element or attribute of said XML schema;

wherein said device comprises an automaton generating module, embodied as one or more computer program products stored in non-transitory machine-readable media, which is configured to generate said finite state automaton by;

generating of a first finite state automaton according to said binary XML format Efficient XML Interchange (EXI) by use of said XML schema;

generating of a second finite state automaton according to binary XML format Binary MPEG Format (BiM) by use of said XML schema;

identifying of element and attribute transitions of same elements and attributes in both the first finite state automaton and the second finite state automaton;

concatenating of fixed length binary codes in said second finite state automaton assigned to code transitions or said second finite state automaton, which lead;

from a start state in said second finite state automaton to a simple state prior to an element or attribute transition in said second finite state automaton, said simple state being a state subsequent to said start state;

from a type state in said second finite state automaton to a further or subsequent simple state prior to an element or attribute transition in said second finite state automaton;

from a type state in said second finite state automaton to an end state in said second finite state automaton, if no further type state is provided between said type state and said end state;

or

from a start state in said second finite state automaton to an end state in said second finite state automaton, if no further type state is provided between said start state and said end state;

the concatenating of the fixed length binary codes resulting in the variable length binary codes;

amending of said first finite state automaton by one of the following;

adding of each of said variable length binary codes as an additional binary code to a corresponding code of said first finite state automaton or replacing of each code of said first state automaton by a corresponding variable length binary code from said variable length binary codes; and

providing of said first finite state automaton as said finite state automaton.

13. A method for generating of a finite state, automaton, embodied as one or more computer program products stored in non-transitory machine-readable media, said finite state automaton being configured for processing of extensible markup language (XML) data, wherein said XML data is based on a pre-determined XML schema and wherein said finite state automaton comprises states and transitions being arranged based on said predetermined XML schema, said method comprising the steps of:

generating of a first finite state automaton according to a binary XML format Efficient XML Interchange (EXI) by use of said XML schema;

generating of a second finite state automaton according to a binary XML format Binary MPEG Format (BiM) by use of said XML schema;

identifying of element and attribute transitions of same elements and attributes in both the first finite state automaton and the second finite state automaton;

concatenating of fixed length codes in said second finite state automaton assigned to code transitions or said second finite state automaton, which lead;

from a start state in said second finite state automaton to a simple state prior to an element or attribute transition in said second finite state automaton, said simple state being a state subsequent to said start state;

from a type state in said second finite state automaton to a further or subsequent simple state prior to an element or attribute transition in said second finite state automaton;

from a type state in said second finite state automaton to an end state in said second finite state automaton, if no further type state is provided between said type state and said end state;

or

from a start state in said second finite state automaton to an end state in said second finite state automaton, if no further type state is provided between said start state and said end state;

the concatenating of the fixed length codes resulting in the variable length codes;

amending of said first finite state automaton by one of the following;

adding of each of said variable length codes as additional binary code to a corresponding code of said first finite state automaton or replacing of each code of said first finite state automaton by a corresponding variable length code from said variable length codes; and

providing of said first finite state automaton as said finite state automaton.

14. An automaton generating module, embodied in one or more computer program products stored in non-transitory machine-readable media, which is configured to generate a finite state automaton by:

generating of a first finite state automaton according to a binary extensible markup language (XML) format Efficient XML Interchange (EXI) by use of an XML schema;

generating of a second finite state automaton according to said binary XML format Binary MPEG Format (BiM) by use of said XML schema;

identifying of element and attribute transitions of same elements and attributes in both the first finite state automaton and the second finite state automaton;

concatenating of fixed length codes in said second finite state automaton assigned to code transitions or said second finite state automaton, which lead;

from a start state in said second finite state automaton to a simple state prior to an element or attribute transition in said second finite state automaton, said simple state being a state subsequent to said start state;

from a type state in said second finite state automaton to a further or subsequent simple state prior to an element or attribute transition in said second finite state automaton;

from a type state in said second finite state automaton to an end state in said second finite state automaton, if no further type state is provided between said type state and said end state;

or

from a start state in said second finite state automaton to an end state in said second finite state automaton, if no further type state is provided between said start state and said end state;

the concatenating of the fixed length codes resulting in variable length codes;

amending of said first finite state automaton by one of the following;

adding of each of said variable length codes as an additional binary code to a corresponding code of said first finite state automaton or replacing of each code of said first state automaton by a corresponding variable length code from said variable length codes; and

providing of said first finite state automaton as said finite state automaton.