KR101714270B1 - Xml schema transformation method and device - Google Patents

Abstract

Disclosed are a method and an apparatus for XML schema transformation which transform a normalized regular hedge grammar (NRHG) expression into a relax NG schema. The XML schema transformation method comprises the steps of: generating at least one automata by using the NRHG expression; generating a regular expression on the automata by using a state transition condition of the automata; and transforming the regular expression into a relax NG schema by using a schema language corresponding to the regular expression.

Description

TECHNICAL FIELD [0001] The present invention relates to an XML Schema conversion method and apparatus,

The present invention relates to an XML schema conversion method and apparatus, and more particularly, to an XML schema conversion method and apparatus for converting a normalized regular hedge grammar expression into a Relax NG schema.

Regular hedge grammar (RHG) is one of the expression grammars for expressing regular tree language which is a tree type language. In particular, the normalized RHG (Normalized RHG) has a similar ability to express the regular hedge grammar, even though it uses a more limited grammar compared to the regular hedge grammar. It is a form mentioned.

A typical application example of the regular tree language is an XML schema language called Relax NG (REGULAR LAnguage for XML Next Generation). The Relax NG schema language is one of the international standards (ISO / IEC 19757-2), relatively simple compared to other schema languages, and supports XML syntax.

1 is a diagram for explaining a normalized normalized hedging grammar.

The three tree structure data shown in FIG. 1 can be expressed by a normalized regular hedge grammar expression as in Equation (1).

과 4개의 생성 규칙으로 정의될 수 있다.

는 단말(terminal)의 집합이며,

는 트리 변수의 집합이다.

는 포레스트 변수(forest variable)의 집합이며, P는 생성 규칙의 집합이다. 마지막으로 s는 스타팅 심볼(starting symbo)로 트리 변수 집합에 속한다.The normalized normalized hedging grammar consists of five tuples

And four production rules.

Is a set of terminals,

Is a set of tree variables.

Is a set of forest variables, and P is a set of production rules. Finally, s belongs to a set of tree variables as the starting symbol (starting symbo).

The four generation rules are shown in [Table 1]. The nodes in [Table 1] correspond to nodes in the tree. Forest variables serve to connect nodes.

Tree variable (

Form a terminal node x.

The tree variable forms the non-end node (a), the forest variable (

).

A forest variable creates a tree variable.

If the forest variable is a forest variable that differs from the tree variable

).

)한다. 그리고 포레스트 변수(F₀)는 트리 변수(T₁)을 생성(

)하고, 트리 변수(T₁)이 car 노드와 포레스트 변수(F₁)을 형성(

)한다. 그리고 포레스트 변수(F₁)는 트리 변수(T₂)를 생성하고, 포레스트 변수(F₂)를 생성(

)한다. 그리고 포레스트 변수(F₂)는 트리 변수(T₃)를 생성(

)한다.Referring back to FIG. 1, the relationship between the first tree (Tree 1) and the NRHG in [Equation 1] is described. A records node in which the tree variable T ₀ is a non-end node is formed and a forest variable F ₀ )

)do. And the forest variable (F ₀ ) generates the tree variable (T ₁ )

), And the tree variable (T ₁ ) forms the car node and the forest variable (F ₁ )

)do. And the forest variable F ₁ generates the tree variable T ₂ and generates the forest variable F ₂

)do. And the forest variable (F ₂ ) generates the tree variable (T ₃ )

)do.

,

)하고, 따라서 비단말 노드인 records 노드에 비단말 노드 car 노드가 연결되고, car 노드에 단말 노드인 country 노드 및 record 노드가 연결되는 제1트리의 구조가 [수학식 1]의 표현식에 의해 생성됨을 알 수 있다.The tree variables (T ₂ , T ₃ ) form the terminal node record and country

,

), So that the structure of the first tree in which the non-end node car node is connected to the non-end node record node, and the country node and the record node which are the end node are connected to the car node is generated by the expression of [Equation 1] .

In terms of data structure, various studies related to schema conversion are underway, and the above normalized normalized hedge grammar expressions can also be converted into other schemas.

Related publications are disclosed in Korean Patent Laid-Open Publication No. 2011-0081945, Non-Patent Document "Classifying XML Documents Based on Structure / Content Similarity, Guangming Xing, Zhonghang Xia, INEX 2006 Workshop Pre-Proceedings".

The present invention is to provide an XML schema conversion method and apparatus for converting a normalized regular hedge grammar expression into a Relax NG schema.

According to an embodiment of the present invention, there is provided a method for generating a plurality of automata, the method comprising: generating at least one automata using normalized normalized hedge grammar (NRHG) expressions; Generating a regular expression for the automata using the state transition condition of the automata; And transforming the regular expression into a Relax NG schema using a schema language corresponding to the regular expression.

According to another embodiment of the present invention, there is provided an automata generating unit for generating at least one automata using a normalized regular hedge grammar expression. A regular expression generating unit for generating a regular expression for the automata using the state transition condition of the automata; And a schema conversion unit for converting the regular expression into a Relax NG schema using a schema language corresponding to the regular expression.

According to the present invention, a normalized regular hedge grammar expression can be converted to a Relax NG schema.

1 is a diagram for explaining a normalized normalized hedging grammar.
Fig. 2 is a diagram for explaining a regular expression and an automata.
3 is a diagram for explaining an XML schema conversion apparatus according to an embodiment of the present invention.
FIG. 4 shows a flowchart of an XML schema conversion method according to an embodiment of the present invention.
FIG. 5 illustrates an automaton generated from a normalized normalized hedge grammar expression.
Figure 6 shows the transformed Relax NG schema.
Figure 7 shows a simplified Relax NG schema compared to Figure 6.

While the invention is susceptible to various modifications and alternative forms, specific embodiments thereof are shown by way of example in the drawings and will herein be described in detail. It is to be understood, however, that the invention is not to be limited to the specific embodiments, but includes all modifications, equivalents, and alternatives falling within the spirit and scope of the invention. Like reference numerals are used for like elements in describing each drawing.

The present invention provides a method and apparatus for converting a normalized normalized hedge grammar expression to a Relax NG schema, one of the XML schemas. The present invention converts a normalized regular hedge grammar expression into an automata and regular expression, and finally generates a Relax NG schema.

First, regular expressions and automata will be described and embodiments according to the present invention will be described in more detail with reference to the accompanying drawings.

Fig. 2 is a diagram for explaining a regular expression and an automata.

Regular expressions are used mainly in text pattern matching such as various search engines, bioinformatics, operating system commands, text editors, network security, etc., and express expressions describing patterns to be searched. Most applications use regular expressions, and academically, they use regular expressions in almost every area of computer science.

A regular expression is a set of strings defined by a combination of grammar like [Table 2]. As an example, the regular expression "(fa | mo | b? O) ther" can be expressed as "father", "mother", "bother", "other"

Regular expressions are very powerful tools for searching because they can improve the efficiency of pattern searching by performing efficient pattern matching on multiple search terms of various patterns rather than specific keywords.

expression function Explanation . text Matches one character. Single-line mode excludes newline characters. | Selection Select one of several expressions. For example, "abc | adc" contains both abc and adc strings. ^ denial Select the rest of the characters except for the characters in the character class. For example, [^ abc] d does not include ad, bd, or cd, but includes ed, fd, and so on. [^ a-z] means any character that does not begin with a lowercase alphabet. [] Character classes Select one of the characters between "[" and "]". It is synonymous with the use of multiple "?" S. For example, [abc] d means ad, bd, cd. You can also specify a range with the "-" sign. "[a-z]" means one of a to z, and "[1-9]" means one of 1 to 9. () Sub-expression Multiple expressions can be grouped together. "abc | adc" and "a (b | d) c" have the same meaning. * 0 times or more Repeat the character marked with * 0 or more times. "a * b" includes "b", "ab", "aab", and "aaab". + More than once Repeat the character marked with ⁺ one or more times. "a ⁺ b" includes "ab", "aab", "aaab" but not "b" ? 0 or 1 time "a? b" includes "b" and "ab". {m} m times "a {3} b" contains only "aaab". {m,} More than m times "a {2,} b" includes "aab", "aaab", and "aaaab". "ab" is not included. {m, n} m times or more and n times or less "a {1,3} b" includes "ab", "aab", "aaab" but not "b" or "aaaab" \ Backreference Matches the string of sub-expressions enclosed by subexpressions in a regular expression

When regular expressions are used in an application, they are usually converted to Nondeterministic Finite Automata (NFA). 2 is a diagram showing an NFA for the regular expression "[ab] {3} | bad ".

In FIG. 2, a circle containing a number indicates a state of the NFA, and a character indicated by an arrow indicates a state transition condition. If the input character satisfies the state transition condition, the state transitions in the arrow direction. A circle with zero indicates the starting state, and a circle with two concentric circles indicates the final state. Starting from the start state, when the state reaches the end state as a result of a transition, it means that the character string to be searched has been searched.

More specifically, starting from state 0, which is the starting state, the input character string is read one character at a time, and it is checked whether a state changes to another state. If the input string is "gjekf3jmbab0d1f ", the first character is" g ", but there is no transition to move state 0 to another state corresponding to input of "g " The second character, "j," will also stay in state 0 and read the next character because there is no corresponding transition. Therefore, in such a case, a state in which the state transition check is required, that is, the active state is a state 0, that is, a total of one.

In this state, when "gjekf3jm" is input, the next character input is "b". In the NFA of FIG. 2, "b" moves state 0 from state 1 to state 2 State 0 is moved to state 1 and state 2, respectively. The next character to be entered is "a "," a "is a state transition condition that moves the active state 0 to state 1, a state transition condition that moves the active state 1 to state 3, 2 is changed to state 4, state 0, state 1 and state 2 are moved to state 1, state 3 and state 4, respectively.

Thus, when the input string meets the state transition condition, the state transitions, and since "bab" is input and transition to the final state, it can be regarded as finding the desired string "bab" in the input string.

3 is a diagram for explaining an XML schema conversion apparatus according to an embodiment of the present invention.

3, the XML schema conversion apparatus according to the present invention may be a computer including a processor or a separate terminal apparatus, and may include an automata generating unit 310, a regular expression generating unit 320, and a schema converting unit 330).

The automata generating unit 310 generates at least one automata using the regularized regular hedge grammar expression. One or more automata may be generated according to a normalized regular hedge grammar expression, where the automata may be nondeterministic finite automata.

The automata generation unit 310 may use the forest variable of the normalized regular hedge grammar expression as a state and use the tree variable for the forest variable as the state transition condition to generate the automata.

The regular expression generating unit 320 generates a regular expression for the automata using the state transition condition of the automata. The automata generating unit 310 may reduce the state of the automata by removing a state located between the start state and the final state in the generated automata. The regular expression generating unit 320 generates a regular expression Using the state transition condition, a regular expression can be generated.

The schema conversion unit 330 converts the regular expression into a Relax NG schema using a schema language corresponding to the regular expression. More specifically, the schema conversion unit 330 may convert the regular expression into the Relax NG schema while converting the tree variable of the normalized regular hedge grammar expression into the Relax NG schema.

In one embodiment, the schema conversion unit 330 determines whether the character before or after the character indicated by the kleene star operator (*) in the regular expression is equal to the character indicated by the clinician You can use the kleene plus operator ( ⁺ ) to modify the regular expression and convert the modified regular expression to the Relax NG schema.

FIGS. 4 to 7 are diagrams for explaining an XML schema conversion method according to an embodiment of the present invention, and FIG. 4 shows a flowchart of an XML schema conversion method according to an embodiment of the present invention. Figure 5 shows the automata generated from the normalized normalized hedge grammar expression, and Figure 6 shows the translated Relax NG schema. Figure 7 shows a simplified Relax NG schema compared to Figure 6.

4 to 7, a method for converting an XML schema conversion apparatus according to the present invention to a Relax NG schema, which is a normalized normalized hedge grammar expression described in FIG. 1, is described as one embodiment.

The XML schema conversion apparatus according to the present invention generates at least one automata using the normalized regular hedge grammar expression (S410), and may generate an automata (NFA) as shown in FIG. 5 as an example. The forest variable in the normalized regular hedge grammar expression corresponds to the state of the automata, and the tree variable for the forest variable corresponds to the state transition condition.

및

규칙에 의해 도 5(a)와 같은 오토마타가 생성될 수 있으며,

및

에 의해 도 5(b)와 같은 오토마타가 생성될 수 있다. 즉, 포레스트 변수의 개수가 3개이므로 3개의 상태가 생성되는데, 포레스트 변수 간 관계에 따라서 상태는 연결되거나 연결되지 않을 수 있다. For example, in the generation rule set P of [Equation 1], two automata may be generated,

And

The automata as shown in FIG. 5 (a) can be generated by the rule,

And

The automata shown in Fig. 5 (b) can be generated. That is, since there are three forest variables, three states are created. Depending on the relationship between the forest variables, the states may or may not be connected.

Then, the XML schema conversion apparatus generates a regular expression for the automata using the state transition condition of the automata (S420). Using the state transition condition set from the start state to the final state of the automata, the regular expression Can be generated.

The regular expression T ₁ * T ₁ is generated by the automata of FIG. 5 (a), and the regular expression T ₂ T ₃ is generated by the automata of FIG. 5 (b). In this case, the XML schema transformation apparatus can generate a regular expression by reducing the state of the automata. In the case of the automata of FIG. 5 (b), the state for the state variable F ₂ is removed and represented by only the start state and the final state .

Then, the XML schema conversion apparatus converts the regular expression into a Relax NG schema (S430) using a schema language corresponding to the regular expression. A Relax NG schema for the regular expression generated in step S420 shown in FIG. 6 (b) can be generated together with the Relax NG schema for the tree variable of the normalized regular hedge grammar expression shown in FIG. 6 (a) have.

Box 610 in FIG. 6 represents the Relax NG schema for the regular expression T ₁ * T ₁ , and zeroOrMore represents the schema language corresponding to the clinician operator. And box 620 in FIG. 6 shows the Relax NG schema for the regular expression T ₂ T ₃ .

On the other hand, as described above, the clinician operator repeats zero or more times. If the character before or after the character (A) marked with the clinician operator is the same as the character displayed by the clinician, that is, A In case of duplication, it is repeated more than once, so it can be replaced by the clinic plus operator. For example, the regular expression T ₁ * T ₁ described above can be replaced by T ₁ ⁺ , since the same T ₁ is located after the character T ₁ marked with the clinician operator.

The schema language corresponding to the Clini-Plus operator is oneOrMore, so the Relax NG schema displayed in box 610 can be transformed again as shown in FIG.

In other words, if the character before or after the character marked with the cleanest operator is the same as the character marked with the clinician, in the regular expression, the XML schema conversion device modifies the regular expression using the cleanup plus operator, Can be converted into the Relax NG schema.

The above-described technical features may be implemented in the form of program instructions that can be executed through various computer means and recorded in a computer-readable medium. The computer-readable medium may include program instructions, data files, data structures, and the like, alone or in combination. The program instructions recorded on the medium may be those specially designed and constructed for the embodiments or may be available to those skilled in the art of computer software. Examples of computer-readable media include magnetic media such as hard disks, floppy disks and magnetic tape; optical media such as CD-ROMs and DVDs; magnetic media such as floppy disks; Magneto-optical media, and hardware devices specifically configured to store and execute program instructions such as ROM, RAM, flash memory, and the like. Examples of program instructions include machine language code such as those produced by a compiler, as well as high-level language code that can be executed by a computer using an interpreter or the like. The hardware device may be configured to operate as one or more software modules to perform the operations of the embodiments, and vice versa.

As described above, the present invention has been described with reference to particular embodiments, such as specific constituent elements, and limited embodiments and drawings. However, it should be understood that the present invention is not limited to the above- And various modifications and changes may be made thereto by those skilled in the art to which the present invention pertains. Accordingly, the spirit of the present invention should not be construed as being limited to the embodiments described, and all of the equivalents or equivalents of the claims, as well as the following claims, belong to the scope of the present invention .

Claims (7)

Generating at least one non-deterministic finite automata using a normalized normalized hedge grammar (NRHG) expression;
Generating a regular expression for the automata using the state transition condition of the automata; And
Converting the regular expression into a Relax NG schema using a schema language corresponding to the regular expression;
≪ / RTI >
The method according to claim 1,
The step of generating the automata
Using the forest variable of the normalized regular hedge grammar expression as a state and using the tree variable for the forest variable as the state transition condition to generate the automata
XML Schema conversion method.
3. The method of claim 2,
The step of generating a regular expression for the automata
The regular expression is generated using the state transition condition set from the start state of the automata until reaching the final state
XML Schema conversion method.
The method of claim 3,
The step of transforming the regular expression into a Relax NG schema
In the above regular expression, if the character before or after the character marked with the kleene star operator is the same as the character indicated by the clinician, the regular expression is calculated using the kleene plus operator Correcting; And
Converting the modified regular expression into the Relax NG schema
≪ / RTI >
An automata generating unit that generates at least one non-deterministic finite automata using the normalized regular hedge grammar expression;
A regular expression generating unit for generating a regular expression for the automata using the state transition condition of the automata; And
A schema conversion unit for converting the regular expression into a Relax NG schema using a schema language corresponding to the regular expression,
The XML schema conversion apparatus comprising:
6. The method of claim 5,
The automata generation unit
In the automata, a state located between a start state and a final state is removed to reduce the state of the automata,
The regular expression generating unit
And generates the regular expression using the state transition condition of the reduced automata
An XML schema conversion device.
The method according to claim 6,
The schema conversion unit
In the above regular expression, if the character before or after the character marked with the kleene star operator is the same as the character indicated by the clinician, the regular expression is calculated using the kleene plus operator Modify, and generate the Relax NG schema
An XML schema conversion device.

Images