KR101974341B1 - Hierarchical data analyzing method and recording medium which records computer program thereof - Google Patents

Abstract

By recording the result of analysis of the tag hierarchy of the XML file, whenever the processing of the data recorded in the XML file is required, the tag hierarchy analysis of the XML file is not re-analyzed, A method of performing processing of data recorded in an XML file is provided. The hierarchical data analysis method according to the present invention includes loading a first analysis object file based on XML (eXtensible Markup Language), designating a hierarchical structure of tags included in the loaded first analysis object file And recording the list of tag path information of each tag included in the first analysis object file in the storage means using the analysis result.

Description

Technical Field [0001] The present invention relates to a hierarchical data analysis method and a recording medium on which the program is recorded,

The present invention relates to a hierarchical data analysis method and a recording medium on which the program is recorded. More specifically, in performing data processing using data having a hierarchical structure based on tags such as data based on XML (eXtensible Markup Language) structure, the amount of computation and computation time required for analyzing the tag hierarchy structure is reduced And a recording medium on which the program is recorded.

An XML file is a widely used file format for representing hierarchical data. The XML file has a strength in comparison with HTML (HyperText Markup Language) in that it has extensibility to allow a user to directly define a tag structure.

The information contained in the XML file is displayed using the tag, and the connection relation between each information is displayed. These tags have a tree-like hierarchy. Therefore, in order to analyze the information contained in the XML file, it is necessary to set up a tree structure which is a hierarchical structure of each tag. As is well known, when the number of nodes in the tree is N, the computation time O (log N) required to search the tree is O (log N). The tree structure of the XML file may be a well-distributed tree structure, but it may take more time to analyze an XML file with a high DEPTH. Therefore, analyzing the tag hierarchy structure of a large-capacity XML file having a high DEPTH every time is a waste of computation time and computation time.

Korean Patent Publication No. 2013-0101153 Korean Patent Publication No. 2008-0090647

SUMMARY OF THE INVENTION The present invention has been made to solve the above problems, and it is an object of the present invention to provide a tag hierarchical structure analysis result of a tag-based hierarchical structure such as an XML file, There is provided a method of processing data recorded in an XML file using a recorded tag hierarchy analysis result without re-analyzing the data, and a computer-readable recording medium on which a computer program for performing the method is recorded .

According to another aspect of the present invention, there is provided a method of analyzing a tag hierarchy structure of a file to be analyzed, wherein a path from a root tag to a corresponding tag of each tag included in an analysis object file is recorded as a result of the tag hierarchy analysis And a computer-readable recording medium on which a computer program for performing the method is recorded.

Another technical problem to be solved by the present invention is to provide a method and system for analyzing a syntax of a region located between a start tag (<tag>) and an end tag (</ tag> And a computer readable recording medium having recorded thereon a computer program for performing the method.

The technical objects of the present invention are not limited to the above-mentioned technical problems, and other technical subjects not mentioned can be clearly understood by those skilled in the art from the following description.

According to an aspect of the present invention, there is provided a hierarchical data analysis method comprising: loading a first analysis object file including data having a hierarchical structure based on a tag; 1 analyzing a hierarchical structure of tags included in a file to be analyzed, and recording a list of tag path information of each tag included in the first analysis object file in the storage means using the analysis result .

According to an embodiment, the tag path information of each tag may be a sequential arrangement of tags located on a path from a root tag of the first analysis object file to each of the tags.

According to another embodiment of the present invention, the step of recording includes: recording the tag path information for the first tag included in the first analysis object file in the storage means; String concatenation of delimiters of the data; And stringing the tag path information for the second tag included in the first analysis object file after the delimiter. In this case, the second tag may be a start tag located immediately after the first tag in the first analysis object file.

According to one embodiment, the step of recording includes, in a first analysis subject file, a list of the tag path information as a first axis, and in the first analysis subject file, in a tag area corresponding to each tag path information included in the list And displaying the two-dimensional data having the written syntax as a second axis.

According to one embodiment, the hierarchical data analysis method may further include storing the two-dimensional data in a storage means. In this case, the data having the two-dimensional data structure is preferably data that can be loaded by a SPREAD SHEET application.

According to an embodiment of the present invention, there is provided a method of analyzing a file to be analyzed, the method comprising: loading a second analysis object file having the same tag hierarchical structure as the first analysis object file; Loading a list of tag path information recorded in the storage means; And a list of the loaded tag path information as a first axis and a syntax written in a zone of a tag corresponding to each tag path information included in the loaded list in the second analysis object file as a second axis Dimensional data structure to be displayed on the display device.

According to the present invention, the XML file can be analyzed quickly.

The tag structure of the XML file is stored in the storage means. When data processing of another XML file having the same tag structure is required later, the tag structure stored in the storage means is LOADed to grasp the tag structure. The data processing of the other XML file can be processed quickly.

Also, the structure of the XML file can be grasped at a glance by displaying the analysis result of the XML file using the data structure in which the tags in the first axis and the second axis are arranged in the respective tag application areas. The data structure having the first axis and the second axis may be LOADed through a SPREAD SHEET application to increase the usability.

1 is a flowchart of a hierarchical data analysis method according to an embodiment of the present invention.
2 is an example of a tag structure of an XML file.
3 is a conceptual diagram in which the tag structure of the file shown in FIG. 2 is represented by a tree.
4 is a view showing a list of tag path information recorded according to the hierarchical data analysis method according to an embodiment of the present invention.
5 is a flowchart of a hierarchical data analysis method according to an embodiment of the present invention that can be executed subsequent to the flowchart shown in FIG.
FIG. 6 is a flowchart of a hierarchical data analysis method according to an embodiment of the present invention, which can be executed subsequent to the flowchart shown in FIG. 1. FIG.
7 is a diagram illustrating a two-axis based data structure that may be generated in accordance with an embodiment of the present invention.

Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS The advantages and features of the present invention and the manner of achieving them will become apparent with reference to the embodiments described in detail below with reference to the accompanying drawings. The present invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. Is provided to fully convey the scope of the invention to those skilled in the art, and the invention is only defined by the scope of the claims. Like reference numerals refer to like elements throughout the specification.

Unless defined otherwise, all terms (including technical and scientific terms) used herein may be used in a sense commonly understood by one of ordinary skill in the art to which this invention belongs. Also, commonly used predefined terms are not ideally or excessively interpreted unless explicitly defined otherwise. The terminology used herein is for the purpose of illustrating embodiments and is not intended to be limiting of the present invention. In the present specification, the singular form includes plural forms unless otherwise specified in the specification. It is noted that the terms "comprises" and / or "comprising" used in the specification are intended to be inclusive in a manner similar to the components, steps, operations, and / Or additions.

In the present specification, the first, second, etc. are used to describe various elements, components and / or sections, but it is needless to say that these elements, components and / or sections are not limited by these terms. These terms are only used to distinguish one element, element or section from another element, element or section. Therefore, it goes without saying that the first element, the first element or the first section mentioned below may be the second element, the second element or the second section within the technical spirit of the present invention.

First, a hierarchical data analysis method according to an embodiment of the present invention will be described with reference to FIG.

First, an XML-based file to be analyzed is loaded (S100). The meaning of the load may mean that the file stored in the storage means is read into the memory. The load will be performed when a user inputs a file load command through a computer program implementing the hierarchical data analysis method according to the present embodiment.

A file that can be loaded includes data having a hierarchical structure based on a tag. That is, the data in the file has a tree-like hierarchical structure expressed through tags. The file may be, for example, an XML-based file or an HTML-based file.

Next, the tag hierarchical structure in the loaded file is analyzed (S102). At this time, a recursive algorithm that reads data and creates a tree structure can be used. Referring to FIGS. 2 to 3, if an XML file such as that shown in FIG. 2 is loaded, a tree structure as shown in FIG. 3 can be generated. There is a start tag and an end tag in the tag, and it is preferable that only one of the tags is input into the tree structure. Sibling tags with the same parent tag are preferably placed from left to right according to the order listed in the loaded file. In FIG. 3, the <CadRotations> tag that appears first among the child tags of the <Part> tag is displayed as the first child tag of the <Part> tag on the leftmost side.

Next, a list of tag path information of each tag included in the loaded file is written to the storage means using the generated tree structure (S104). For example, the list may be recorded in the storage means in the form of a text file, the list may be converted into a database and recorded in the storage means, or the list may be stored in a file format readable by a spreadsheet program Or may be recorded in the storage means, or the list may be formed in a file format readable by the document creation program and recorded in the storage means.

The storage means may include an internal hard disk, an external hard disk, an optical disk, a nonvolatile memory, a USB memory, and the like.

The tag path information of each tag included in the loaded file can be obtained by preorder traversing each node (tag is recorded) included in the generated tree structure. In the preorder traversal, the root node is searched for first and the left node and the right node are traversed in this order. FIG. 4 shows a list of tag path information of each tag obtained by traversing the tree structure shown in FIG. 3 in a preorder.

4, the path "PartsList" of the PartsList tag which is the root node is displayed first, and the path "PartsList> Part" of the Part tag which is the child node of the root node is displayed next. On the other hand, the Part tag has two attributes "@xmlns: xsd" and "@xmlns: xsi". According to this embodiment, not only the syntax described in the tag section but also attribute values can be extracted and displayed Therefore, the path of the attribute in the tag can also be displayed in case of this case. That is, you can display "PartsList> Part> @xmlns: xsd" which is the path of @xmlns: xsd attribute in Part tag and "PartsList> Part> @xmlns: xsi" which is the path of @xmlns: xsi attribute in Part tag. Excepting the special rule regarding the attribute in the tag, the list can be constructed in the order of each tag included in the loaded file by traversing the tree structure in a preorder.

By recording the tag path information list of each tag as shown in FIG. 4, the computation time can be further saved as compared with finding a specific tag in the state where the XML file is analyzed in the tree structure. For example, when searching for the "BodyColorID" tag (shown in bold in FIG. 4), the hierarchical information of the "BodyColorID" tag can be immediately confirmed in the tag path information list. In the tree structure, It is necessary to confirm the path information from the root node to the retrieved tag.

Each tag path information in the tag path information list can be distinguished by a predetermined delimiter. The delimiter may be a newline character as shown in FIG. That is, the tag path information for the first tag included in the loaded file is recorded, string concatenation is performed to a predetermined delimiter at the end of the tag path information for the first tag, The list may be generated by string-linking the tag path information for the second tag included in one analysis object file. The second tag may be a start tag located immediately after the first tag in the loaded file.

According to one embodiment, as shown in FIG. 5, each syntax included in the loaded file may be displayed separately by tags (S106). The syntax refers to non-tagged data contained within the loaded file.

Dimensional data in which the first axis is a list of the tag path information and the second axis is a syntax written in a zone of a tag corresponding to each tag path information included in the list in the first analysis object file Lt; / RTI &gt; 5, the tag path information of the first tag, the tag path information of the second tag, the tag path information of the Nth tag are displayed along the first axis, and the tag path information of the first tag, The syntax described in the section of the tag (between the start tag and the end tag) may be displayed. When the loaded file is displayed in this manner, the data contained in the file can be more intuitively grasped.

The generated two-dimensional data can be recorded in the storage means so as not to be displayed once but to be opened again later. For example, the list may be recorded in the storage means in the form of a text file, the list may be converted into a database and recorded in the storage means, or the list may be stored in a file format readable by a spreadsheet program Or may be recorded in the storage means, or the list may be formed in a file format readable by the document creation program and recorded in the storage means.

Fig. 7 is a configuration example of the two-dimensional data.

According to one embodiment, the recorded tag path information list can be recycled for loading and analyzing other files having the same tag hierarchy. For example, when there is a large-capacity first XML file in which part information is recorded and a large-capacity second XML file having the same tag hierarchy as the first XML file, a tag path information list file for the first XML file It is possible to save the computation time required for analyzing the tag hierarchy structure of the XML file. This embodiment will be described in more detail with reference to FIG.

After performing the method described with reference to FIG. 1, the second analysis object file is loaded (S107). Also, the tag path information list recorded in the storage means is loaded (S109). As described above, since the first analysis object file and the second analysis object file have the same tag hierarchical structure and only the syntax is different, the second analysis object file is processed using the tag path information list of the first analysis object file It is possible to do. More specifically, the loaded second analysis target file is sequentially scanned, and a tag corresponding to each tag path information included in the tag path information list of the first analysis object file and a tag (S111). The matching result may include a list of the tag path information as a first axis and a syntax for describing, in the first analysis object file, a syntax written in a region of the tag corresponding to each tag path information included in the list as a second axis Dimensional data.

The two-dimensional data is not generated after one-time generation, but may be recorded in the storage means for later re-reading (S113). For example, the list may be recorded in the storage means in the form of a text file, the list may be converted into a database and recorded in the storage means, or the list may be stored in a file format readable by a spreadsheet program Or may be recorded in the storage means, or the list may be formed in a file format readable by the document creation program and recorded in the storage means.

The concepts of the present invention may be embodied in computer readable code on a computer readable medium. The computer-readable medium may include a computer-readable storage medium and a computer-readable transmission medium. The computer-readable storage medium may store data and the stored data may be a data storage device that is later read by a computer system. Examples of the storage medium include ROM, RAM, CD-ROM, magnetic tape, Floppy disk, or other optical storage device. The computer-readable storage medium may be distributed over a network-connected computer system so that each computer-readable code is stored and executed by a distributed processing method. The computer-readable transmission medium may be a carrier wave or carrier signal transmitted over a wired or wireless Internet connection.

1, 5, and 6 may be software or hardware such as a field-programmable gate array (FPGA) or an application-specific integrated circuit (ASIC). However, the components are not limited to software or hardware, and may be configured to be in an addressable storage medium and configured to execute one or more processors. The functions provided in the components may be implemented by a more detailed component or may be implemented by a single component that performs a specific function by combining a plurality of components.

While the present invention has been described in connection with what is presently considered to be practical exemplary embodiments, it is to be understood that the invention is not limited to the disclosed embodiments, but, on the contrary, You will understand. It is therefore to be understood that the above-described embodiments are illustrative in all aspects and not restrictive.

Bucket configuration data 100
Bucket configuration rules 102, 104, 106, 108
The buckets 302, 304, 306, 308
The time interval identifiers 310, 320 of the bucket

Claims (8)

Loading a first analysis target file including data having a hierarchical structure based on a tag;
Analyzing a hierarchical structure of tags included in the loaded first analysis object file;
Recording a list of tag path information for each tag included in the first analysis object file in the storage means using the analysis result;
Loading a second analysis object file having the same tag hierarchical structure as the first analysis object file;
Loading a list of tag path information recorded in the storage means; And
Wherein the tag list includes a list of the loaded tag path information as a first axis and a syntax written in a region of a tag corresponding to each tag path information included in the loaded list in the second analysis object file as a second axis Displaying a two-dimensional data structure,
The tag path information includes:
Wherein the tag is a sequential arrangement of tags located on a path from a root tag to a corresponding tag of the first analysis object file,
Hierarchical data analysis method. delete The method according to claim 1,
Wherein the recording step comprises:
Recording the tag path information for the first tag included in the first analysis object file in the storage means;
String concatenating a predetermined delimiter at the end of the tag path information for the first tag; And
And string-connecting the tag path information for a second tag included in the first analysis object file after the delimiter.
Hierarchical data analysis method. The method of claim 3,
Wherein the second tag is a start tag located immediately after the first tag in the first analysis object file,
Hierarchical data analysis method. The method according to claim 1,
Wherein the recording step comprises:
Dimensional data having a second axis in a syntax written in a region of a tag corresponding to each tag path information included in the list in the first analysis object file as a first axis, Comprising:
Hierarchical data analysis method. 6. The method of claim 5,
Further comprising storing the two-dimensional data in a storage means,
The data having the two-dimensional data structure is data that can be loaded by a SPREAD SHEET application,
Hierarchical data analysis method. delete delete

Images