PROCESSING MODULE, A DEVICE, AND A METHOD FOR PROCESSING OF XML DATA
First Claim
1. A processing module, said processing module being configured for processing of 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; and
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.
1 Assignment
0 Petitions
Accused Products
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.
22 Citations
15 Claims
-
1. A processing module, said processing module being configured for processing of 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; and 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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A method for generating of a finite state automaton, said finite state automaton being configured for processing of XML data, wherein said XML data is based on a predetermined 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 EXI by use of said XML schema; generating of a second finite state automaton according to a binary XML format BiM by use of said XML schema; identifying of element and attribute transitions of the same elements and attributes in both automatons; 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;
orfrom 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 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 possible 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; andproviding of said first finite state automaton as said finite state automaton.
-
-
15. An automaton generating module, which is configured to generate said finite state automaton 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 the same elements and attributes in both automatons; 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;
orfrom 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 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; andproviding of said first finite state automaton as said finite state automaton.
-
Specification