JP2012194950A - Structured document management device, method, and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a structured document management device capable of performing structure collation processing at high speed, a method, and a program.SOLUTION: In an inventive structured document management device, when inputted query data includes a first condition designating a hierarchical relation of layers of the logical structure of structured document data and a second condition designating an order relation of elements specified by element IDs, query data decomposition means decomposes the query data into first partial query data including only the first condition and second partial query data including means for performing joint operation of a collation result by the first partial query data according to the second condition. Structure collation processing means collates a data set of the structured document data with the first partial query data and outputs a collation result. Joint operation processing means performs joint operation processing of the collation result outputted from the structure collation processing means according to a procedure of joint operation included in the second partial query data.

Description

  Embodiments described herein relate generally to a structured document management apparatus, method, and program.

  Conventionally, a structured document management apparatus for storing / retrieving structured document data described in XML (Extensible Markup Language) or the like is known. In order to search for structured document data in the structured document management apparatus, a query language XQuery (XML Query Language) for XML data has been formulated, such as the query language SQL in RDBMS (Relational Database Management System). Supported by structured document management devices.

  XQuery is a language for handling an XML data set like a database, and provides means for extracting, summing up, and analyzing a data set that matches a condition. Since XML data has a hierarchical logical structure (hierarchical structure) in which elements such as parents and siblings are combined, a condition (structural condition) relating to this hierarchical structure can be specified as a condition.

  In the process of the structure condition, it is necessary to perform a structure matching process for checking whether the structured document data stored in the structured document management apparatus has a structure that matches the condition. This structure matching process can be processed at relatively high speed if the structure condition is only a condition that specifies the hierarchical relationship of the hierarchy, but the order relation of the elements included in the XML data is specified in the structure condition. If the conditions to be included are included, it is difficult to process at high speed.

JP 2007-226452 A

  The problem to be solved by the present invention is to provide a structured document management apparatus, method, and program capable of performing structure collation processing at high speed.

  The structured document management apparatus according to the embodiment includes a structured document data receiving unit, an identifier assigning unit, a structured document data storage unit, a query data receiving unit, a query data decomposing unit, a structure matching processing unit, Arithmetic processing means. The structured document data accepting unit accepts input of structured document data having a hierarchical logical structure. The identifier assigning means assigns an identifier whose appearance order in the structured document data can be compared between the elements to the element appearing in the input structured document data. The structured document data storage unit stores the structured document data in which the identifier is assigned to the element. The query data accepting unit accepts input of query data. The query data decomposing means has a second condition in which the input query data specifies a first condition specifying the hierarchical relationship in the logical structure of the structured document data and an order relationship of the elements specified by the identifier. Including a condition, the query data is combined with the first partial query data including only the first condition and the collation result of the first partial query data according to the second condition. It decomposes | disassembles into the 2nd partial query data containing. The structure matching processing means performs matching with the first partial query data against the data set of the structured document data stored in the structured document data storage means, and outputs a matching result. The join operation processing means performs a join operation process on the collation result according to a join operation procedure included in the second partial query data.

The schematic diagram which shows the system construction example of a structured document management system. The module block diagram of a server and a client terminal. The block diagram which shows schematic structure of the server and client terminal in 1st Embodiment. Explanatory drawing which shows an example of structured document data. FIG. 5 is an explanatory diagram illustrating an example of structured document data with an element ID assigned to the structured document data illustrated in FIG. 4. Explanatory drawing which shows an example of query data. The flowchart which shows the flow of the search process by a search process part. The flowchart which shows the flow of a query data analysis process. Explanatory drawing which shows an example of the 1st partial query data and 2nd partial query data which are the result of having performed the query data analysis process about the query data illustrated in FIG. Explanatory drawing which shows the outline of a structure collation process. FIG. 10 is an explanatory diagram illustrating an example of structure matching processing result data that is a result of performing structure matching processing on the structured document data with element IDs exemplified in FIG. 5 using the first partial query data illustrated in FIG. 9; Explanatory drawing in the case of performing a joint calculation process about the structure collation process result data illustrated in FIG. 11 using the 2nd partial query data illustrated in FIG. Explanatory drawing which shows the result data of the query data illustrated in FIG. The block diagram which shows schematic structure of the server and client terminal in 2nd Embodiment. Explanatory drawing which shows an example of structure guide data. Explanatory drawing which shows an example of query data. The flowchart which shows the flow of the query data analysis process in 2nd Embodiment. Explanatory drawing which shows an example of the 1st partial query data and 2nd partial query data which are the result of having performed the process to step S215 of FIG. 17 about the query data illustrated in FIG. The flowchart which shows the flow of a structural condition rewriting process. FIG. 19 is an explanatory diagram illustrating a result of the structural condition rewriting process performed on the first partial query data illustrated in FIG. 18. An example of structure matching process result data that is a result of performing structure matching processing on the structured document data with element IDs exemplified in FIG. 5 using the first partial query data after the structure condition rewriting process exemplified in FIG. FIG. FIG. 22 is an explanatory diagram in a case where a join operation process is performed on the structure matching process result data illustrated in FIG. 21 using the second partial query data illustrated in FIG. 20. Explanatory drawing which shows the result data of the query data illustrated in FIG. Explanatory drawing which shows an example of query data. The flowchart which shows the flow of the query data analysis process in 3rd Embodiment. FIG. 25 is an explanatory diagram illustrating an example of first partial query data and second partial query data, which is a result of performing query data analysis processing on query data including the position function illustrated in FIG. 24. FIG. 25 is an explanatory diagram illustrating an example of first partial query data and second partial query data, which is a result of query data analysis processing performed on query data including the last function illustrated in FIG. 24. FIG. 27 is an explanatory diagram illustrating an example of structure matching processing result data that is a result of performing a structure matching process on the structured document data with element IDs exemplified in FIG. 5 using the first query data exemplified in FIG. 26; FIG. 28 is an explanatory diagram in a case where a join operation process is performed on the structure matching process result data illustrated in FIG. 28 using the second partial query data illustrated in FIG. FIG. 28 is an explanatory diagram illustrating an example of structure matching processing result data that is a result of performing structure matching processing on the structured document data with element IDs exemplified in FIG. 5 using the first query data illustrated in FIG. 27; FIG. 28 is an explanatory diagram in a case where a join operation process is performed on the structure matching process result data illustrated in FIG. 30 using the second partial query data illustrated in FIG. 27; FIG. 25 is an explanatory diagram illustrating result data of query data including the position function illustrated in FIG. 24. FIG. 25 is an explanatory diagram illustrating result data of query data including the last function illustrated in FIG. 24. The block diagram which shows schematic structure of the server and client terminal in 4th Embodiment. Explanatory drawing which shows an example of query data. The flowchart which shows the flow of the search process in 4th Embodiment. The flowchart which shows the flow of the query data analysis process in 4th Embodiment. Explanatory drawing which shows an example of the 1st partial query data which are the results of having performed the query data analysis process about the query data illustrated in FIG. FIG. 40 is an explanatory diagram illustrating an example of structure matching processing result data that is a result of performing structure matching processing on the structured document data with element IDs illustrated in FIG. 5 using the first partial query data illustrated in FIG. 38; Explanatory drawing which shows the result data of the query data illustrated in FIG.

  Hereinafter, a structured document management apparatus, method, and program according to embodiments will be described with reference to the drawings.

[First Embodiment]
First, a first embodiment will be described with reference to FIGS. FIG. 1 is a schematic diagram illustrating a system construction example of the structured document management system according to the first embodiment. Here, as a structured document management system of the embodiment, as shown in FIG. 1, a network 2 such as a LAN (Local Area Network) is connected to a server computer (hereinafter referred to as a server) 1 which is a structured document management apparatus. A server client system to which a plurality of client computers (hereinafter referred to as client terminals) 3 are connected is assumed.

  FIG. 2 is a module configuration diagram of the server 1 and the client terminal 3. The server 1 and the client terminal 3 have a hardware configuration using, for example, a normal computer. That is, the server 1 and the client terminal 3 include a CPU (Central Processing Unit) 101 that performs information processing, a ROM (Read Only Memory) 102 that is a read-only memory storing BIOS, and a RAM (RAM) that stores various data in a rewritable manner. Random Access Memory (103), HDD (Hard Disc Drive) 104 that functions as various databases and stores various programs, and storage medium 110 for storing information, distributing information outside, and obtaining information from outside Medium drive device 105 such as a CD-ROM drive for communication, communication control device 106 for communicating information with other external computers via network 2, processing progress and results, etc. A display unit 107 such as a CRT (Cathode Ray Tube) or LCD (Liquid Crystal Display) to be displayed to a user, and an input unit 108 such as a keyboard and a mouse for an operator to input commands and information to the CPU 101 In this configuration, the bus controller 109 operates by arbitrating data transmitted and received between these units.

  In the server 1 and the client terminal 3, when the user turns on the power, the CPU 101 activates a program called a loader in the ROM 102, and a program for managing the hardware and software of the computer called OS (Operating System) from the HDD 104 is stored in the RAM 103. To start this OS. Such an OS activates a program, reads information, and stores information in accordance with a user operation. As typical OSes, Windows (registered trademark), UNIX (registered trademark), and the like are known. Programs that run on these OSs are called application programs. The application program is not limited to one that runs on a predetermined OS, and may be one that causes the OS to execute some of the various processes described below, or constitutes predetermined application software, an OS, or the like. It may be included as part of a group of program files.

  Here, the server 1 stores a structured document management program in the HDD 104 as an application program. In this sense, the HDD 104 functions as a storage medium that stores the structured document management program. In general, application programs installed in the HDD 104 of the server 1 are various systems such as various optical disks such as CD-ROM and DVD, various magnetic disks such as various magneto-optical disks and flexible disks, and semiconductor memories. It is recorded on a storage medium 110 such as a medium and provided. Therefore, the portable storage medium 110 such as an optical information recording medium such as a CD-ROM or a magnetic medium such as an FD can also be a storage medium that stores the structured document management program. Further, the structured document management program may be imported from the outside via the communication control device 106 and installed in the HDD 104, for example.

  In the server 1, when a structured document management program operating on the OS is started, the CPU 101 executes various arithmetic processes according to the structured document management program and centrally controls each unit. On the other hand, in the client terminal 3, when an application program operating on the OS is activated, the CPU 101 executes various arithmetic processes according to the application program, and controls each unit intensively. Of various types of arithmetic processing executed by the CPU 101 of the server 1 and the client terminal 3, processing characteristic in the structured document management system of the embodiment will be described below.

  FIG. 3 is a block diagram showing a schematic configuration of the server 1 and the client terminal 3 in the first embodiment. As illustrated in FIG. 3, the client terminal 3 includes a structured document registration unit 11 and a search unit 12 as a functional configuration realized by an application program.

  The structured document registration unit 11 stores the structured document data input from the input unit 108 and the structured document data stored in advance in the HDD 104 of the client terminal 3 into a structured document database (structured document DB) of the server 1 described later. ) 21 for registration. The structured document registration unit 11 transmits a storage request to the server 1 together with the structured document data to be registered.

  FIG. 4 shows an example of structured document data. XML (Extensible Markup Language) is a typical language for describing structured document data. The structured document data shown in FIG. 4 is described in XML. In XML, individual parts constituting a document structure are called “elements” (elements), and elements are described using tags. Specifically, one element is expressed by sandwiching data between two tags, a tag indicating the start of an element (start tag) and a tag indicating the end (end tag). Note that the text data sandwiched between the start tag and the end tag is a text element included in one element represented by the start tag and the end tag.

  In the example shown in FIG. 4, there is a root element surrounded by a tag <books>. The <books> element includes three child elements surrounded by <book> tags. The <book> element includes a plurality of child elements surrounded by <title> and <author> tags. The <title> element has a text element such as “XML database”.

  The first <book> element has two <author> elements, and these two <author> elements are in the order in which they appear after the <title> element, but the second and third <book> elements are: It has only one <author> element, and a <title> element appears after the <author> element.

  The search unit 12 creates query data describing a search condition for searching for desired data from the structured document DB 21 according to an instruction input from the input unit 108 by the user, and a search request including the query data. Is transmitted to the server 1. In addition, the search unit 12 receives result data corresponding to the search request transmitted from the server 1 and displays the result data on the display unit 107.

  On the other hand, the server 1 includes a storage processing unit 22 and a search processing unit 23 as functional configurations realized by the structured document management program. The server 1 also includes a structured document DB 21 that uses a storage device such as the HDD 104.

  Upon receiving a storage request from the client terminal 3, the storage processing unit 22 performs a process of storing the structured document data transmitted from the client terminal 3 in the structured document DB 21. The storage processing unit 22 includes a storage interface unit 24 and an element ID assigning unit 25.

  The storage interface unit 24 receives the input of structured document data (structured document data receiving unit) and calls the element ID adding unit 25 to store the structured document data in the structured document DB 21.

  The element ID assigning unit 25 functions as an identifier assigning unit, and parses the structured document data transmitted from the client terminal 3 and can compare the appearance order between the elements appearing there. (Hereinafter referred to as element ID), and the structured document data to which the element ID has been assigned (hereinafter referred to as element ID-added structured document data) is designated as the structured document DB 21 (structured document data storage means). ).

  Here, the element ID is assigned so that the appearance order of the elements in the structured document data can be determined based on the size of the element ID. FIG. 5 shows an example of structured document data with an element ID assigned to the structured document data illustrated in FIG. In FIG. 5, as an example of a method for assigning element IDs, E1, E2, E3,... If given in this way, the appearance order between elements can be determined by comparing element IDs.

  For example, the first <book> element of <books> in the structured document data illustrated in FIG. 4 has two <author> elements therein, and the appearance order of these two <author> elements is a child. The <author> element having the <first> element appears first, and the <author> element having the <last> element as a child appears later. Here, when comparing the element IDs assigned to each in FIG. 5, an <author> element having a <last> element as a child, which is an element to which E5 <E8 and E8 is assigned as an element ID, It can be determined that the element appears after the <author> element having a <first> element as a child, which is an element assigned E8 as an ID. In FIG. 5, the format of the structured document data with element IDs assigned is almost the same as the structured document data of FIG. 4, but as described above, the appearance order of the elements can be determined based on the size. If the element ID is assigned, the format of the structured document data with the element ID assigned is not particularly limited.

  Upon receiving a search request from the client terminal 3, the search processing unit 23 searches the structured document DB 21 for data that matches the condition specified by the query data, and returns the found data as result data. The search processing unit 23 includes a search interface unit 26, a query data decomposition unit 27, a structure matching processing unit 28, and a join operation processing unit 29.

  The search interface unit 26 receives input of query data (query data receiving unit) and calls the query data decomposition unit 27 to obtain result data that satisfies the conditions specified by the received query data.

  The query data decomposition unit 27 functions as query data decomposition means, and parses query data (hereinafter referred to as input query data) transmitted from the client terminal 3 and input via the search interface unit 26. The input query data includes a condition (first condition) for specifying the hierarchical relationship in the logical structure of the structured document data (first condition) and a condition (second condition) for specifying the order relation of the elements specified by the element ID. Including a procedure of combining the input query data with the first partial query data including only the first condition and the collation result based on the first partial query data according to the second condition. Break it down into partial query data.

  The structure collation processing unit 28 functions as a structure collation processing unit, and uses the first partial query data for the data set of the structured document data with element IDs stored in the structured document DB 21. A structure condition matching process is performed, and the matching result is output as structure matching process result data.

  The join operation processing unit 29 functions as a join operation processing means, and applies a second to the structure matching processing result data that is the matching result by the first partial query data output from the structure matching processing unit 28. The join operation is performed according to the join operation procedure included in the query data, and the join operation result data is output. If the second partial query data is empty, the join operation processing unit 29 outputs the structure matching processing result data output from the structure matching processing unit 28 as it is or omits its own processing.

  The search interface unit 26 returns the join operation processing result data output from the join operation processing unit 29 to the client terminal 3 as search result data.

FIG. 6 is an explanatory diagram illustrating an example of query data. In XML, there is a query language called XQuery proposed by W3C, and the query data shown in FIG. 6 conforms to a query description method based on this XQuery. FIG. 6 shows query data Q1 including conditions (structure conditions) regarding a complex hierarchical structure having the following meanings.
Q1: For each structured document data in the structured document DB 21, there is an element “book” somewhere in the hierarchy, the element “book” has an element “author” in the element, and this “author” Is a “book” element that has two elements “first” and “last”, and a “book” element that appears after the “book” element. Returns a list of “titles”.

  FIG. 7 is a flowchart showing the flow of search processing by the search processing unit 23 of the server 1. First, the search interface unit 26 accepts input of query data transmitted from the client terminal 3 via the network 2 (step S1).

  Next, the query data analysis unit 27 performs query data analysis processing on the input query data (step S2). An example of the query data analysis process by the query data decomposition unit 27 will be described with reference to FIG.

  FIG. 8 is a flowchart showing the flow of the query data analysis process. The query data decomposing unit 27 first sets all of the input query data as first partial query data for convenience (step S201). At this time, the second partial query data is left empty.

  Next, the query data decomposing unit 27 checks the first partial query data, and the first partial query data (here, the same as the input query data) has a structural condition relating to the order relationship between elements having a certain structure. That is, it is determined whether or not a condition for specifying the order relationship of the elements specified by the element ID is included (step S202). Then, if such a structural condition is included (step S202: Yes), the query data decomposition unit 27 converts the first partial query data into a structural condition that includes only a condition that specifies the hierarchical relationship of the hierarchy, that is, Then, it is decomposed into structural conditions that specify each of the structures to be collated with the structural conditions related to the order relationship (step S203), and all the decomposed structural conditions are set as the first partial query data (step S204). Then, the query data decomposing unit 27 sets, as the second partial query data, the contents instructing the join operation of the element IDs included in the structure matching processing results of the decomposed structural conditions (step S205). Terminates the query data analysis process.

  On the other hand, if it is determined in step S202 that the first partial query data (here, the same as the input query data) does not include the structural condition related to the order relationship described above (step S202: No), the query data decomposition unit 27 The query data analysis process is terminated without performing the processes from step S203 to step S205.

  FIG. 9 is a diagram illustrating an example of the first partial query data Q1_A and the second partial query data Q1_B, which are the results of the query data analysis process for the query data Q1 illustrated in FIG. In FIG. 9, the first partial query data Q1_A includes structural conditions PP1 and PP2. Further, the second partial query data Q1_B includes a procedure for performing a join operation on the collation result of the structure collation processing by Q1_A according to the structural condition related to the order relation described above. Since the query data Q1 illustrated in FIG. 6 includes a structural condition “following-sibling” related to the order relationship, the query data Q1 includes a structural condition PP1, which specifies a structure to be collated with the structural condition. The procedure of decomposing into PP2 and performing a join operation on the collation result of the structure collation processing by PP1 and PP2 according to “following-sibling” is the second partial query data Q1_B. Note that T1 and T2 in Q1_B in the figure are symbols for identifying the results of the structure matching processing for PP1 and PP2, respectively. [1], [2], and [3] in Q1_A and Q1_B in the figure are symbols for identifying element ID groups included in T1 and T2.

  When the query data analysis process by the query data decomposing unit 27 is completed, the structure matching process unit 28 performs a structure matching process for the structure condition included in the first partial query data (step S3). Here, the structure matching process refers to structured document data or structured document data that conforms to the structure condition as a result of interpreting and collating the specified structure condition with the specification defined by XQuery. The process to get the elements inside.

  Here, using the structured document data with element IDs exemplified in FIG. 5 and the structural conditions PP1 and PP2 included in the first partial query data Q1_A exemplified in FIG. 9, a general structure matching process is performed. An outline of the processing when it is performed will be described with reference to FIG. Hereinafter, the part delimited by / in the structural condition is simply referred to as a path.

  Regarding the collation of the structural condition PP1 included in the first partial query data Q1_A, the head path // book (/ descendant-or-self :: book) is collated first when the structural condition PP1 is viewed from the left. This means that, in the XQuery specification, “the element in the hierarchical structure somewhere below the root element and having the name“ book ”is selected”. In accordance with this, when the structure of the element in the structured document data with element ID given as an example in FIG. 5 is collated, three <book> elements, E2, E13, and E21 below the root element <books> are selected (1). .1).

  The next [author [first and last]] is: “With respect to the element obtained in the previous structure matching, its child has an element called author, and the author element contains both first and last elements as its children. Means to select only such elements. " If the <book> element is selected by collating the structure of elements below each <book> element in accordance with this, a book element having element IDs E13 and E21 is obtained as a result (1.2).

  Similarly, with respect to the collation of the structural condition PP2 included in the first partial query data Q1_A, the first path // book has the same meaning as the previous PP1, and three <book> elements, E2, E13, E21 is selected (2.1). The next path / title (/ child :: title) is “select an element at the position of the child's hierarchical structure with respect to the element obtained in the previous path collation and whose name is title”. Means that. Accordingly, when the element at the child structure position is compared with each <book> element obtained by the previous structure matching, the <title> element with an element ID of E3 starts from the <book> element with an element ID of E2. The <title> element with the element ID E19 is obtained from the <book> element with the element ID E13, and the <title> element with the element ID E27 is obtained from the <book> element with the element ID E21. (2.2).

  Note that the structure condition and the path structure matching method outlined here are merely examples, and the structure condition and the path structure matching method include various methods including those described in Patent Document 1. There is something. As long as the structure matching processing unit 28 in the present embodiment acquires an element in structured document data having a structure that matches the input structure condition, a specific internal processing method is particularly limited. It is not a thing.

  The structure collation processing result data, which is the result of performing the structure collation processing of the structural conditions PP1 and PP2 included in the first partial query data Q1_A illustrated in FIG. 9 for the structured document data with element IDs illustrated in FIG. R1_A is shown in FIG. T1 and T2 in the figure are the results of the structure matching processing of the structural conditions PP1 and PP2, respectively. As T1, an element ID group [1] of elements having a structure matching the structural condition PP1 is obtained. Element ID groups [2] and [3] of elements having a structure that matches the structure condition PP2 are obtained. In FIG. 11, T1 and T2 are shown in a table, but the specific data structure of the structure matching process result data is not particularly limited.

  When the structure matching processing by the structure matching processing unit 28 is completed, the procedure included in the second partial query data is next performed on the structure matching processing result data, which is the processing result of the structure matching processing unit 28, by the join operation processing unit 29. In step S4, a join operation process is performed.

  FIG. 12 is a diagram for explaining an overview of processing when the join operation processing is performed on the structure matching processing result data R1_A illustrated in FIG. 11 using the second partial query data Q1_B illustrated in FIG. The join operation process is the same as the join operation (JOIN) performed in the conventional RDB (Relational Database).

  In the example of FIG. 12, the join operation of T1 and T2 is performed according to the condition relating to the order relationship of T1 [1] <T2 [2], and T3 is obtained. Then, by extracting only [3] for T3, an intermediate result R1_B as shown in FIG. 12 is obtained as a result of the join operation process. This intermediate result R1_B matches the result of processing the query data Q1 illustrated in FIG. 6 as it is without performing the query data analysis process as described above.

  When the join operation processing by the join operation processing unit 29 is finished, finally, the element ID obtained as a result (intermediate result) of the join operation processing by the join operation processing unit 29 by the search interface unit 26 is the corresponding structured document. It is converted into a character string as data and returned to the client terminal 3 as result data (step S5). When the intermediate result R1_B shown in FIG. 12 is obtained, the structured document data corresponding to the element ID E27 included in the intermediate result R1_B is converted into a character string, and as the result data R1 of the query data Q1, Data shown in FIG. 13 is returned to the client terminal 3.

  As described above with reference to specific examples, according to this embodiment, when the structured document data is registered, the server 1 has the appearance order between the elements appearing in the structured document data. A comparable element ID is assigned, and the structured document data with the element ID assigned is stored in the structured document DB 21. Further, the server 1 parses the input query data from the client terminal 3 when searching for the structured document data, and the input query data designates the first hierarchical relationship in the logical structure of the structured document data. In the case of including a condition and a second condition that specifies the order relationship of the elements specified by the element ID, the input query data includes the first partial query data including only the first condition, and the first partial query. The collation result based on the data is processed by being decomposed into second partial query data including a procedure for performing a join operation in accordance with the second condition. Therefore, even if the input query data includes complex structural conditions, the input query data is processed by the simple structure condition structure matching process and the join operation process, thereby speeding up the structure matching process. Search by query data including various structural conditions can be executed at high speed.

  In the above specific example, the case where “following-sibling” is included in the input query data as a condition (structural condition related to the order relation) for specifying the order relation of the elements specified by the element ID has been described. However, even when other conditions for specifying the order relation of elements, for example, “following”, “preceding”, “presenting-sibling”, and the like are included, the processing can be performed in the same manner as the above specific example.

[Second Embodiment]
Next, a second embodiment will be described with reference to FIGS. 5, 7, and 14 to 23. In the present embodiment, when the first partial query data includes a condition for tracing the hierarchy in the logical structure of the structured document data from the lower level to the upper level, the condition is set to the lower level in the logical structure of the structured document data. In this example, the condition is rewritten to the condition of tracing from top to bottom. In the following description, the same reference numerals are given to the same components as those in the first embodiment described above, and duplicate descriptions are omitted.

  FIG. 14 is a block diagram showing a schematic configuration of the server 1 ′ and the client terminal 3 in the present embodiment. In the present embodiment, the structure analysis unit 30 is provided in the storage processing unit 22 ′ of the server 1 ′. In addition, the structured document DB 21 ′ of the server 1 ′ includes the structured logical document data with the element IDs and the hierarchical logical structures of the structured document data with the element IDs stored in the structured document DB 21 ′. Structure guide data that is aggregated information is stored (structure guide data storage means). Further, a structural condition rewriting unit 31 is provided in the search processing unit 23 ′ of the server 1 ′. The configuration of the client terminal 3 is the same as that in the first embodiment.

  The structure analysis unit 30 functions as a structure guide data update unit, analyzes the hierarchical logical structure of the structured document data transmitted from the client terminal 3, and reflects the logical structure in the structure guide data. Thus, the structure guide data stored in the structured document DB 21 ′ is updated.

  The structure guide data is information obtained by aggregating the hierarchical logical structures of each of the structured document data with element IDs stored in the structured document DB 21 ′, and is unique in the structured document data with element IDs. It holds information related to a hierarchical structure. Structure guide data corresponding to the structured document data illustrated in FIG. 4 is, for example, as shown in FIG. First, the structure analysis unit 30 analyzes the hierarchical logical structure of the structured document data transmitted from the client terminal 3, and newly generates structure guide data as shown in FIG. Then, the structure analysis unit 30 creates the structure guide data newly generated from the structure guide data stored in the structured document DB 21 ′ (that is, the structured document data with element IDs stored in the structured document DB 21 ′. When the newly generated structure guide data includes information on a new hierarchical structure that is not included in the structure guide data stored in the structured document DB 21 ′. The structure guide data stored in the structured document DB 21 ′ is updated in such a manner that information on the new hierarchical structure is added to the structure guide data stored in the structured document DB 21 ′.

  The structural condition rewriting unit 31 functions as a condition rewriting unit, and the first partial query data obtained by decomposing the input query data by the query data decomposing unit 27 is in the logical structure of the structured document data. When a condition for tracing the hierarchy from lower to higher, that is, a condition for collating the structure from the leaf element (leaf) to the root element (root) of the structured document data, the condition is designated as the structured document DB 21 ′. Based on the structure guide data stored in the, the condition to follow the hierarchy in the logical structure of the structured document data from the top to the bottom, that is, the structure from the root element (root) of the structured document data to the leaf element (leaf) direction To a condition that matches.

FIG. 16 is an explanatory diagram illustrating an example of query data assumed in the present embodiment. The query data Q2 shown in FIG. 16 is described in XQuery similarly to the query data Q1 described in the first embodiment, and includes conditions (structural conditions) regarding a complicated hierarchical structure having the following meanings. .
Q2: For each structured document data in the structured document DB 21 ′, there is an element “book” somewhere in the hierarchy, the element “book” has an element “author” in the element, and this “author” "Book" element having two elements "first" and "last", and "title" which is a child of the "book" element appearing after the "book" element Returns a list of “author” elements that are children of the parent element.

  In the query data Q2, a path “/ parent” appears in addition to the query data Q1. In XQuery, / descendant, / descendant-or-self, and / (child) are paths that collate structures from the root element (root) to the leaf element (leaf) direction of the structured document. “/ Ancestor” is a path for collating the parent and ancestor elements in the hierarchical structure from the leaf element (leaf) to the root element (root) of the structured document data.

  The flow of search processing by the search processing unit 23 'in this embodiment is the same as that in the first embodiment shown in FIG. However, in the present embodiment, the structural condition rewriting process by the structural condition rewriting unit 31 is performed in the query data analysis process in step S2.

  FIG. 17 is a flowchart showing the flow of query data analysis processing in this embodiment. In the flowchart of FIG. 17, the processing from step S211 to step S215 is the same as step S201 to step S205 of FIG. 8 described in the first embodiment, and thus the description thereof is omitted.

  In the query data analysis processing in the present embodiment, after the processing in step S215, the structural condition rewriting unit 31 leaves the hierarchical structure of the structured document data in the first partial query data created by the processing so far. It is determined whether or not a structural condition that matches in the root direction is included (step S216). If the first partial query data includes a structural condition such that the hierarchical structure of the structured document data is collated from the leaves to the root direction (step S216: Yes), the structural condition rewriting unit 31 Condition rewriting processing is performed to rewrite the structural condition for collating the hierarchical structure of the structured document data from the leaf to the root direction to the structural condition for collating from the root to the leaf direction (step S217).

  On the other hand, if it is determined in step S216 that the first partial query data does not include a structural condition for collating the hierarchical structure of the structured document data from the leaf to the root direction (step S216: No), the process proceeds to step S217. The query data analysis process is terminated without performing the structural condition rewriting process.

  18 is a diagram illustrating an example of the first partial query data Q2_A and the second partial query data Q2_B, which are the results of performing the processing up to step S215 in FIG. 17 for the query data Q2 illustrated in FIG. . In FIG. 18, the first partial query data Q2_A includes structural conditions PP1 and PP2. Further, the second partial query data Q2_B includes a procedure for performing a join operation on the collation result of the structure collation processing by Q2_A according to the structural condition related to the order relation described above. In the example of FIG. 18, the structure condition PP2 of the first partial query data Q2_A includes the path / parent. For this reason, the structural condition rewriting process by the structural condition rewriting unit 31 is performed.

  FIG. 19 is a flowchart showing the structural condition rewriting process performed in step S217 of FIG. First, the structural condition rewriting unit 31 in the first partial query data includes a structural condition (hereinafter referred to as an input structural condition) including a path for collating the hierarchical structure of the structured document data from the leaf to the root direction. The path portion to be collated from the leaf to the root direction is identified (step S2171). Next, the structural condition rewriting unit 31 refers to the input structural condition from the leaf to the root direction with reference to the path before the identified path part, the path after the identified path part, and the structure guide data. To a path having the same meaning that does not include the path portion to be performed (step S2172).

  Here, an example of rewriting the structural condition PP2 in the first partial query data Q2_A illustrated in FIG. 18 with reference to the structural guide data illustrated in FIG. 15 will be given as an overview of the processing in step S2172. explain. In order to simplify the description here, the structure guide data illustrated in FIG. 15 is referred to. However, the structure guide data stored in the structured document DB 21 ′ is actually referred to.

  For the / parent :: node () part of the structural condition PP2 in the first partial query data Q2_A, the path immediately before is / title. Referring to the structure guide data illustrated in FIG. 15, the structure having a title at the end is / books / book / title. Since / parent :: node () designates a parent element, the structure designated by / parent :: node () is known as / books / book. Furthermore, regarding / author, which is the next path of / parent :: node (), since the structure specified so far is / books / book, is there any structure in which / books / book is followed by / author? Is confirmed by the structure guide data, and / books / book / author is obtained as a rewrite result of the structure condition PP2.

  FIG. 20 is a diagram illustrating a result of the structural condition rewriting process performed on the first partial query data Q2_A illustrated in FIG. Note that the second partial query data Q2_B in the figure is the same as that illustrated in FIG.

  In the present embodiment, after the structural condition rewriting process by the structural condition rewriting unit 31, the structural verification process by the structural verification process unit 28 is performed (step S3). At this time, since the structural condition included in the first partial query data has been rewritten so as not to include the path portion to be collated from the leaf to the root direction, all the structural collation processing by the structural collation processing unit 28 is performed from the root. This can be realized only by collation in the leaf direction, and extremely high-speed processing is possible.

  As a result of performing the structure matching process using the structural conditions PP1 and PP2 included in the first partial query data Q2_A after the structural condition rewriting process illustrated in FIG. Certain structure matching processing result data R2_A is shown in FIG. T1 and T2 in the figure are the results of the structure matching processing of the structural conditions PP1 and PP2, respectively. As T1, an element ID group [1] of elements having a structure matching the structural condition PP1 is obtained. Element ID groups [2] and [3] of elements having a structure that matches the structure condition PP2 are obtained.

  Also in this embodiment, when the structure matching processing by the structure matching processing unit 28 is completed, the join operation processing unit 29 converts the structure matching processing result data, which is the processing result of the structure matching processing unit 28, into the second partial query data. A join calculation process is performed according to the included procedure (step S4).

  FIG. 22 is a diagram for explaining the outline of the process when the join operation process is performed on the structure matching process result data R2_A illustrated in FIG. 21 using the second partial query data Q2_B illustrated in FIG. In the example of FIG. 22, a join operation between T1 and T2 is performed according to a condition relating to the order relationship of T1 [1] <T2 [2], and T3 is obtained. Then, by extracting only [3] for T3, an intermediate result R2_B as shown in FIG. 22 is obtained as a result of the join operation process. This intermediate result R2_B matches the result when the query data Q2 illustrated in FIG. 16 is directly processed without performing the query data analysis process as described above.

  Finally, the search interface unit 26 converts the element ID obtained as a result (intermediate result) of the join operation processing by the join operation processing unit 29 into a character string as the corresponding structured document data, and the client terminal 3 as the result data (Step S5). When the intermediate result R2_B shown in FIG. 22 is obtained, the structured document data corresponding to the element ID E22 included in the intermediate result R2_B is converted into a character string, and as the result data R2 of the query data Q2, Data shown in FIG. 23 is returned to the client terminal 3.

  As described above with reference to specific examples, according to the present embodiment, the condition that the first partial query data follows the hierarchy in the logical structure of the structured document data from the lower level to the higher level, that is, the structured document. When a condition for collating the structure from the leaf element (leaf) to the root element (root) is included, the condition is structured based on the structure guide data stored in the structured document DB 21 ′. The conditions are rewritten so that the structure is collated from the root element (root) to the leaf element (leaf) direction of the document data. Then, the input query data is processed by a simple structure condition structure matching process and a join operation process. Therefore, even if the input query data is complex including conditions that match the structure from the leaf element (leaf) to the root element (root) of the structured document data, the structure matching process can be accelerated. Thus, it is possible to execute a search using query data including complicated structural conditions at high speed.

  In the above specific example, the first partial query data includes a condition for tracing the hierarchy in the logical structure of the structured document data from lower to higher (from the leaf element (leaf) to the root element (root) of the structured document data). As an example, a case where “parent” is included as a condition for checking the structure in the direction) has been described, but other conditions for tracing the hierarchy in the logical structure of structured document data from the lower to the higher, for example, “ancestor” Even when “ancestor-or-self” is included, it can be processed in the same manner as in the above specific example.

[Third Embodiment]
Next, a third embodiment will be described with reference to FIGS. 3, 5, 7, and 24 to 33. FIG. This embodiment is an example when the condition for specifying the order relation of elements included in input query data is a position function or a last function. The configurations of the server 1 and the client terminal 3 in this embodiment are the same as those in the first embodiment shown in FIG. In the following description, the same reference numerals are given to the same components as those in the first embodiment described above, and duplicate descriptions are omitted.

FIG. 24 is an explanatory diagram illustrating an example of query data assumed in the present embodiment. The query data Q3_1 and Q3_2 shown in FIG. 24 are described in XQuery like the query data Q1 described in the first embodiment and the query data Q2 described in the second embodiment, and have the following meanings: It includes conditions (structure conditions) related to complex hierarchical structures.
Q3_1: For each structured document data in the structured document DB 21, there is an element “book” somewhere in the hierarchy, and among the “author” elements in the element “book”, the element that appears first Returns a list.
Q3_2: For each structured document data in the structured document DB 21, there is an element “book” somewhere in the hierarchy, and among the “author” elements in the element “book”, a list of the last appearing elements return it.

  The query data Q3_1 has an expression [position () = 1]. This is an instruction to select only the first node among the nodes corresponding to the path to which [position () = 1] is assigned in XQuery. On the other hand, the query data Q3_2 has an expression [last ()]. This is a specification for selecting the last node among the nodes corresponding to the path to which [last ()] is assigned.

  The flow of search processing by the search processing unit 23 in this embodiment is the same as that of the first embodiment shown in FIG. However, in the present embodiment, the contents of the query data analysis process in step S2 are different from those in the first embodiment.

  FIG. 25 is a flowchart showing the flow of query data analysis processing in this embodiment. As in the first embodiment, the query data decomposing unit 27 first sets all input query data as first partial query data for convenience (step S221). At this time, the second partial query data is left empty.

  Next, the query data decomposition unit 27 checks the first partial query data, and adds [position () = n] or [last () to the first partial query data (here, the same as the input query data). ] Is included (step S222). Then, if such a structural condition is included (step S222: Yes), the query data decomposition unit 27 starts from the first partial query data (here, the same as the input query data) [position () = n]. The data obtained by removing the conditions such as [last ()] is used as the first partial query data (step S223). Then, if the condition removed in step S223 is [position () = n], the query data decomposing unit 27 selects the nth element that appears from the result of the structure matching process using the first partial query data. Is the second partial query data, and if the condition removed in step S223 is [last ()], the operation instruction for selecting the element that appears last from the structure matching processing result by the first partial query data is the second. As the partial query data (step S224), the query data analysis process is terminated.

  On the other hand, if it is determined in step S222 that the first partial query data (here, the same as the input query data) does not include a condition such as [position () = n] or [last ()] (step S222: No) The query data decomposition unit 27 ends the query data analysis process without performing the processes of steps S223 and S224.

  FIG. 26 is a diagram illustrating an example of the first partial query data Q3_1_A and the second partial query data Q3_1_B, which are results of the query data analysis process for the query data Q3_1 illustrated in FIG. FIG. 27 is a diagram illustrating an example of the first partial query data Q3_2_A and the second partial query data Q3_2_B, which are results of the query data analysis process for the query data Q3_2 illustrated in FIG. Here, the operation instruction “GROUP BY (X)” is an operation instruction for grouping elements having the same element ID in the part specified in (X). In addition, the calculation instruction “FILTER (X) (Y) (Z)” is only for those in which the element ID of the portion specified by (Y) is in the order of (Z) for the group specified by (X). The calculation instruction is to leave. As shown in the second partial query data Q3_1_B illustrated in FIG. 26, when (Z) is 1, the calculation instruction is to leave the element ID of the portion specified by (Y) being the smallest, and is illustrated in FIG. As shown in the second partial query data Q3_2_B, when (Z) is LAST, the calculation instruction is to leave the element with the largest element ID specified by (Y).

  When the query data analysis processing by the query data decomposing unit 27 is completed, the structure matching processing unit 28 performs the structure matching processing of the structural condition included in the first partial query data, as in the first embodiment (steps). S3).

  For the structured document data with element IDs given as an example in FIG. 5, the structure matching process result data R3_1_A, which is the result of performing the structure matching process according to the structure condition PP1 included in the first partial query data Q3_1_A exemplified in FIG. As shown in FIG. In addition, with respect to the structured document data with element ID given as an example in FIG. 5, the structure matching process result data that is the result of performing the structure matching process according to the structure condition PP1 included in the first partial query data Q3_2_A exemplified in FIG. R3_2_A is shown in FIG. T1 in the figure is the result of the structure matching process of the structure condition PP1, and in both the structure matching process result data R3_1_A of FIG. 28 and the structure matching process result data R3_2_A of FIG. Element ID groups [1] and [2] of the possessed elements are obtained.

  When the structure matching processing by the structure matching processing unit 28 is completed, the second operation is performed on the structure matching processing result data, which is the processing result of the structure matching processing unit 28, by the join operation processing unit 29, as in the first embodiment. A join operation process is performed according to the procedure included in the query data (step S4).

  FIG. 29 is a diagram for explaining an outline of processing when the join operation processing is performed on the structure matching processing result data R3_1_A illustrated in FIG. 28 using the second partial query data Q3_1_B illustrated in FIG. FIG. 31 is a diagram for explaining an overview of processing when the join operation processing is performed on the structure matching processing result data R3_2_A illustrated in FIG. 30 using the second partial query data Q3_2_B illustrated in FIG.

  In the example of FIG. 29 and the example of FIG. 31, the same element IDs are grouped in the element ID group of T1 according to the calculation instruction “GROUP BY T1 [1]”, and T2 is obtained. In the example of FIG. 29, T3 is obtained by the arithmetic processing that leaves the smallest element ID of T2 [2] for T2 [1] according to the arithmetic instruction “FILTER T2 [1] T2 [2] 1”. Then, by extracting only [2] for T3, an intermediate result R3_1_B as shown in FIG. 29 is obtained as a result of the join operation processing. In the example of FIG. 31, T3 is obtained by the calculation process that leaves the element with the largest element ID of T2 [2] for T2 [1] according to the calculation instruction “FILTER T2 [1] T2 [2] LAST”. Then, by extracting only [2] for T3, an intermediate result R3_2_B as shown in FIG. 31 is obtained as a result of the join operation processing. These intermediate results R3_1_B and R3_2_B coincide with the results of processing the query data Q3_1 and Q3_2 illustrated in FIG. 24 as they are without performing the query data analysis process as described above.

  Finally, the search interface unit 26 converts the element ID obtained as a result (intermediate result) of the join operation processing by the join operation processing unit 29 into a character string as the corresponding structured document data, and the client terminal 3 as the result data (Step S5). When the intermediate result R3_1_B shown in FIG. 29 is obtained, the structured document data corresponding to the element IDs E5, E14, and E22 included in the intermediate result R3_1_B is converted into a character string, and the result of the query data Q3_1 is obtained. The data shown in FIG. 32 is returned to the client terminal 3 as the data R3_1. When the intermediate result R3_2_B shown in FIG. 31 is obtained, the structured document data corresponding to the element IDs E8, E14, and E22 included in the intermediate result R3_2_B is converted into a character string, and the query data Q3_2 is obtained. As the result data R3_2, data shown in FIG. 33 is returned to the client terminal 3.

  As described above with reference to a specific example, according to the present embodiment, when the input query data includes the position function or the last function as a condition for specifying the order relation of elements, the input query data is A second step including a step of performing a join operation on the first partial query data including only a condition specifying the hierarchical relationship of the hierarchy and a matching result based on the first partial query data according to the condition indicated by the position function or the last function. The data is broken down into partial query data. Therefore, even if the input query data is complicated including the position function and the last function, the input query data is processed by the simple structure condition structure matching process and the join operation process, thereby speeding up the structure matching process. The search using query data including complicated structural conditions can be executed at high speed.

[Fourth Embodiment]
Next, a fourth embodiment will be described with reference to FIGS. 5, 19, and 34 to 40. FIG. In the present embodiment, the same structural condition as in the second embodiment is rewritten, but the input query data does not include a condition (second condition) for specifying the order relation of elements, and the second query data This is an example in which the join operation processing based on is not performed. In the following description, the same reference numerals are given to the same components as those in the above-described second embodiment, and a duplicate description is omitted.

  FIG. 34 is a block diagram showing a schematic configuration of the server 1 ″ and the client terminal 3 in the present embodiment. In the present embodiment, the query data decomposition unit 27 is not provided in the search processing unit 23 ″ of the server 1 ″, and the input query data transmitted from the client terminal 3 is input to the structural condition rewriting unit 31 ′. The Further, the search processing unit 23 ″ of the server 1 ″ is not provided with the join operation processing unit 29, and the structure matching process result data, which is the result of the structure matching processing by the structure matching processing unit 28, is directly used as the search interface unit. 26. The configuration of the client terminal 3 is the same as that in the second embodiment.

FIG. 35 is an explanatory diagram showing an example of query data assumed in the present embodiment. The query data Q4 shown in FIG. 35 is described in XQuery similarly to the query data described in the first to third embodiments, and includes conditions (structure conditions) relating to a complicated hierarchical structure having the following meanings. It is out.
Q4: For each structured document data in the structured document DB 21 ′, there is an element “title” somewhere in the hierarchy, and a list of elements “publisher” which is a child element of the element “book” of the ancestor is returned. .

  The query data Q4 includes a path for collating ancestor elements in the hierarchical structure from the leaf element (leaf) to the root element (root) of the structured document data called / ancestor described in the second embodiment. However, a path for collating a structure related to an order relationship between elements having a certain structure, such as / following-sibling included in the query data Q1 described in the first embodiment, is not included.

  FIG. 36 is a flowchart showing the flow of search processing by the search processing unit 23 ″ of the server 1 ″ in this embodiment. First, the search interface unit 26 accepts input of query data transmitted from the client terminal 3 via the network 2 (step S1). This query data is input to the structural condition rewriting unit 31 '.

  Next, the query data analysis process for the input query data is performed by the structural condition rewriting unit 31 '(step S2). An example of the query data analysis process by the structural condition rewriting unit 31 'will be described with reference to FIG.

  FIG. 37 is a flowchart showing the flow of query data analysis processing by the structural condition rewriting unit 31 ′. The structural condition rewriting unit 31 ′ first sets the input query data as first partial query data (step S <b> 231). Next, the structural condition rewriting unit 31 ′ checks the first partial query data, and the first partial query data has a structural condition such that the hierarchical structure of the structured document data is collated from the leaf to the root direction. It is determined whether it is included (step S232). If the first partial query data includes a structural condition that collates the hierarchical structure of the structured document data from the leaf to the root direction (step S232: Yes), A structural condition rewriting process is performed to rewrite the structural condition for collating the hierarchical structure of the structured document data from the leaf to the root direction to the structural condition for collating from the root to the leaf direction (step S233).

  On the other hand, if it is determined in step S232 that the first partial query data does not include a structural condition for collating the hierarchical structure of the structured document data from the leaf to the root direction (step S232: No), the process proceeds to step S233. The query data analysis process is terminated without performing the structural condition rewriting process.

  The structural condition rewriting process performed in step S233 is the same as that of the second embodiment, and the processing content is as shown in the flowchart of FIG. Here, an outline of processing for rewriting the query data Q4 illustrated in FIG. 35 with reference to the structure guide data illustrated in FIG. 15 will be described. In order to simplify the description here, the structure guide data illustrated in FIG. 15 is referred to. However, the structure guide data stored in the structured document DB 21 ′ is actually referred to.

  For the / ancestor :: book part of the query data Q4, the path immediately before is / title. Here, referring to the structure guide data illustrated in FIG. 15, the structure having the title at the end is / books / book / title. Since / ancestor specifies an ancestor element, the structure specified by / ancestor is / books / book, / books, but because :: book and book elements are specified, the structure specified by / ancestor :: book Becomes / books / book. Furthermore, for / publisher, which is the next path of / ancestor :: book, since the structure specified so far is / books / book, whether there is a structure that follows / books / book or / publisher Since it exists when confirmed by the guide data, / books / book / publisher is obtained as a result of the structural condition rewriting process for the query data Q4.

  FIG. 38 is a diagram illustrating first partial query data Q4_A obtained as a result of performing the structural condition rewriting process on the query data Q4 illustrated in FIG. The query data Q4 illustrated in FIG. 35 is rewritten by a structural condition rewriting process into a structural condition such as / books / book / publisher that collates the hierarchical structure of structured document data from the root to the leaf direction.

  When the query data analysis processing by the structural condition rewriting unit 31 ′ is finished, the structural verification processing of the structural condition included in the first partial query data is performed by the structural verification processing unit 28, as in the first to third embodiments. Performed (step S3).

  FIG. 39 shows structure matching process result data R4_A, which is the result of performing the structure matching process using the first partial query data Q4_A exemplified in FIG. 38 for the structured document data with element ID given in FIG. T1 in the figure is the result of the structure matching process under the structure condition of / books / book / publisher, and an element ID group [1] of elements having such a structure is obtained.

  In the present embodiment, the result of the structure matching process by the structure matching processing unit 28 is directly passed to the search interface unit 26 as an intermediate result. Finally, the element ID obtained as a result (intermediate result) of the structure matching processing by the structure matching processing unit 28 is converted into a character string as the corresponding structured document data by the search interface unit 26, and the result data is the client. Returned to the terminal 3 (step S5). When the intermediate result R4_A shown in FIG. 39 is obtained, the structured document data corresponding to the element IDs E11 and E29 included in the intermediate result R4_A is converted into a character string, and the result data R4 of the query data Q4 As shown in FIG. 40, the data shown in FIG.

  As described above, as described with specific examples, according to the present embodiment, the input query data does not include a condition (second condition) that specifies the order relationship of elements specified by the element ID, and the structure If there is a condition for tracing the hierarchy in the logical structure of structured document data from lower to higher, that is, a condition for collating the structure from the leaf element (leaf) to the root element (root) of the structured document data Is rewritten to a condition such that the structure is collated from the root element (root) of the structured document data to the leaf element (leaf) direction based on the structure guide data stored in the structured document DB 21 ′. Then, the input query data is processed only by the structure matching process with a simple structure condition. Therefore, even if the input query data is complex including conditions that match the structure from the leaf element (leaf) to the root element (root) of the structured document data, the structure matching process can be accelerated. Thus, it is possible to execute a search using query data including complicated structural conditions at high speed.

  In the above specific example, the condition for following the hierarchy in the logical structure of the structured document data included in the input query data from the lower order to the higher order (from the leaf element (leaf) to the root element (root) direction of the structured document data) “Ancestor” is exemplified as a condition for checking the structure in FIG. 5. However, other conditions for tracing the hierarchy in the logical structure of structured document data from the lower to the higher, such as “parent” and “ancestor-or-self”, are exemplified. Can be processed in the same manner as in the above specific example.

  The functions of the server 1, server 1 ′, and server 1 ″ in the first to fourth embodiments described above are, for example, structured document management programs implemented as application programs by the CPU 101 that is a computing device of a computer. It is realized by executing.

  The structured document management program executed by the server 1, the server 1 ′, and the server 1 ″ in the first to fourth embodiments is, for example, a CD-ROM, a flexible file in an installable format or an executable format file. The program is recorded on a computer-readable storage medium 110 such as a disc (FD), CD-R, or DVD (Digital Versatile Disc).

  Further, the structured document management program executed by the server 1, the server 1 ′, and the server 1 ″ in the first to fourth embodiments is stored on a computer connected to the network 2 such as the Internet, and the network 2 You may comprise so that it may provide by making it download via. In addition, the structured document management program executed by the server 1, the server 1 ′, and the server 1 ″ in the first to fourth embodiments may be configured to be provided or distributed via the network 2 such as the Internet. Good. Further, the structured document management program executed by the server 1, the server 1 ′, and the server 1 ″ in the first to fourth embodiments may be provided by being incorporated in the ROM 102 in advance.

  The structured document management program executed by the server 1, the server 1 ′, and the server 1 ″ in the first to fourth embodiments includes a storage interface unit 24, an element ID assigning unit 25, a search interface unit 26, and query data decomposition. Unit 27, structure collation processing unit 28, join operation processing unit 29, structure analysis unit 30, structural condition rewriting units 31, 31 ′, etc., and the actual hardware includes CPU (processor) 101. By reading and executing the structured document management program from the HDD 104 or the like, the above units are loaded onto the main storage device (for example, the RAM 103), and the storage interface unit 24, the element ID adding unit 25, the search interface unit 26, and the query data decomposing unit. 27, structure verification processing unit 28, join operation processing unit 29, structure analysis unit 30, structure Such matter rewriter 31, 31 'is adapted to be generated on the main memory.

  According to the structured document management system according to at least one embodiment described above, the input query data is changed to a simple structure condition and the structure matching process is executed. Even in the case of including, it is possible to speed up the structure matching process, and to execute the search by the query data including the complicated structure condition at high speed.

  In addition, although some embodiment of this invention was described, these embodiment is shown as an example and is not intending limiting the range of invention. These novel embodiments can be implemented in various other forms, and various omissions, replacements, and changes can be made without departing from the scope of the invention. These embodiments and modifications thereof are included in the scope and gist of the invention, and are included in the invention described in the claims and the equivalents thereof.

1, 1 ′, 1 ″ server 24 Storage interface unit 25 Element ID assigning unit 26 Search interface unit 27 Query data decomposition unit 28 Structure collation processing unit 29 Join operation processing unit 30 Structure analysis unit 31, 31 ′ structure condition rewriting unit

Claims (5)

Structured document data receiving means for receiving input of structured document data having a hierarchical logical structure;
Identifier assigning means for assigning to the element appearing in the structured document data input an identifier whose appearance order in the structured document data can be compared between the elements;
Structured document data storage means for storing the structured document data in which the identifier is assigned to the element;
Query data receiving means for receiving input of query data;
When the input query data includes a first condition that specifies the hierarchical relationship of the hierarchy in the logical structure of the structured document data, and a second condition that specifies the order relationship of the elements specified by the identifier , A second partial query including a procedure for combining the query data with the first partial query data including only the first condition and a matching result based on the first partial query data according to the second condition Query data decomposition means for decomposing data,
Structure collation processing means for performing collation with the first partial query data for the data set of the structured document data stored in the structured document data storage means, and outputting a collation result;
A join operation processing means for performing a join operation processing on the collation result according to a join operation procedure included in the second partial query data;
A structured document management apparatus comprising: Structure guide data storage means for storing structure guide data that is information obtained by aggregating the hierarchical logical structures of the structured document data stored in the structured document data storage means;
Structure guide data updating means for updating the structure guide data so that the hierarchical logical structure of the input structured document data is reflected in the structure guide data;
Condition rewriting means for rewriting the condition to a condition for tracing the hierarchy from the top to the bottom based on the structure guide data when the first partial query data includes a condition for tracing the hierarchy from the bottom to the top. The structured document management apparatus according to claim 1, further comprising: Structured document data receiving means for receiving input of structured document data having a hierarchical logical structure;
Identifier assigning means for assigning to the element appearing in the structured document data input an identifier whose appearance order in the structured document data can be compared between the elements;
Structured document data storage means for storing the structured document data in which the identifier is assigned to the element;
Structure guide data storage means for storing structure guide data that is information obtained by aggregating the hierarchical logical structures of the structured document data stored in the structured document data storage means;
Structure guide data updating means for updating the structure guide data so that the hierarchical logical structure of the input structured document data is reflected in the structure guide data;
Query data receiving means for receiving input of query data;
When the input query data includes a condition for tracing the hierarchy in the logical structure of the structured document data from the lower level to the upper level, the condition is traced from the upper level to the lower level based on the structure guide data. Condition rewriting means for rewriting conditions,
A structural collation processing unit that collates the data set of the structured document data stored in the structured document data storage unit according to the condition rewritten by the condition rewriting unit and outputs a collation result. A featured structured document management device. Receiving input of structured document data having a hierarchical logical structure;
A step of assigning to an element appearing in the input structured document data an identifier whose appearance order in the structured document data is comparable between the elements and storing the identifier in a storage device;
Accepting query data input,
When the input query data includes a first condition that specifies the hierarchical relationship of the hierarchy in the logical structure of the structured document data, and a second condition that specifies the order relationship of the elements specified by the identifier , A second partial query including a procedure for combining the query data with the first partial query data including only the first condition and a matching result based on the first partial query data according to the second condition Breaking it into data,
Collating the first partial query data with respect to the data set of the structured document data stored in the storage device, and outputting a collation result;
A structured document management method comprising: performing a join operation process on the collation result according to a join operation procedure included in the second partial query data. On the computer,
A function for receiving input of structured document data having a hierarchical logical structure;
A function of assigning to an element appearing in the input structured document data an identifier in which the order of appearance in the structured document data can be compared between the elements and storing it in a storage device;
A function that accepts input of query data,
When the input query data includes a first condition that specifies the hierarchical relationship of the hierarchy in the logical structure of the structured document data, and a second condition that specifies the order relationship of the elements specified by the identifier , A second partial query including a procedure for combining the query data with the first partial query data including only the first condition and a matching result based on the first partial query data according to the second condition The ability to break it down into data,
A function of collating the first partial query data against the data set of the structured document data stored in the storage device and outputting a collation result;
A structured document management program that realizes a function of processing the collation result in accordance with a join operation procedure included in the second partial query data.

Images