JP2002202973A - Structured document management device - Google Patents

Abstract

(57) [Summary] [PROBLEMS] To provide a structured document device capable of performing a search specifying various logical structures. SOLUTION: In a document management system for handling structured documents, information for specifying a logical structure position includes a path name in which tag names are described in order from the highest hierarchy, and an appearance order of each hierarchy of the path name. Various structured document searches can be realized by managing in a path hierarchy described in succession.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to SGML and XML
The present invention relates to a structured document search method for performing a search specifying a logical structure in a document management system for managing a structured document having a logical structural element using a computer.

[0002]

2. Description of the Related Art With the increase in electronic documents, manuals,
There is an increasing interest in structured documents that handle documents having a logical structure, such as minutes and specifications. Therefore, not only the search based on the document content but also the function of performing the search specifying the logical structure by utilizing the features of the structured document is important. The logical structure of a structured document is DTD (Docum).
ent Type Definition: Document type definition)
Defined by

Conventionally, as a document retrieval apparatus in a structured document management system, an invention described in Japanese Patent Application Laid-Open No. 10-240752 (hereinafter referred to as a known example) is known.

The outline of the known example will be described below. The configuration diagram of the document registration system is as shown in FIG. In registration in the known example, first, the document structure analysis program 3301 analyzes the logical structure of the document to be registered, creates analyzed document data, and registers it in the analyzed document data storage area 3305.

Next, a structure index creation program 3
At 302, the logical structures of the documents to be registered are sequentially superimposed according to the registration order, and the elements having the same appearance position and type in the document are represented by a single meta element, and the appearance positions in the document are the same. Is represented by a single meta-character string data, thereby forming a meta-element group and a meta-character string data group (in a known example, these are collectively called a metanode). An index is generated, and an identifier (in a well-known example, this is called a context identifier) for uniquely identifying each of the metanodes constituting the structure index is assigned to the metanode and registered in the structure index storage area 3306. I do.

FIG. 34 is a diagram showing a process of creating the structure index. In FIG. 34, a document 1, a document 2, and a document 3 each represent analyzed document data of a registration target document. The structure index is formed by sequentially superimposing the structure of the analyzed document data on the existing structure index. First, when document 1 is input, since the structure index is in the initial state (empty) at the initial stage, a tree structure equivalent to the analyzed data is generated and registered as it is in the structure index. The state shown in FIG. The newly generated meta element has context identifiers from E1 to E5, and the newly generated meta character string data has C
Context identifiers from 1 to C3 are assigned. Next, when document 2 is input, the existing structure index (340
No action is taken for the part whose structure overlaps with 1), and 34
Only the partial structure (the shaded portion in the figure) in which no corresponding portion exists on 01 is newly registered. The context identifiers E6 and E7 are assigned to the newly generated meta element, and the context identifier C4 is assigned to the newly generated meta character string data. Next, when the document 3 is input, nothing is performed on a portion whose structure overlaps with the existing structure index (3402), and only the partial structure (shaded portion in the figure) having no corresponding portion on the 3402 Is newly registered. Context identifiers E8, E9 and E
10. Context identifiers C5 and C6 are assigned to the newly generated meta-character string data. In this way,
When three documents are registered, the structure index becomes 3
The state shown in 403 is obtained.

Next, a structured full-text data generating program 3
At 303, for each document to be registered, all the character strings included in the analyzed document data corresponding to the document,
Data composed of the definition of the correspondence between the character string and the context identifier indicated in the structure index (this is called structured full-text data in a known example) is generated and registered in the structured full-text data storage area 3307. .

Next, a character string index for performing a full-text search including the context identifier is created from the structured full-text data corresponding to each registration target document by a character string index creating program 3304, and the character string index is created. Register in the storage area 3308.

FIG. 35 shows an example of a character string index, in which the partial character string (3404) is made up of two characters. For each partial character string, a document identifier (3405) for identifying a document containing the partial character string, and a context identifier (340) for identifying the position in the document structure of the character string data containing the partial character string in the document
6), the character position of the partial character string in the document (34)
07). Note that "X" in the figure indicates a relative character position where the position of the character located immediately before the character string is "X".

In the search in the known example, first, a set of context identifiers satisfying a specified structure condition is determined by referring to the structure index.

Next, a document group that satisfies the designated condition is obtained by searching a character string using the context identifier as a key.

In addition, at the time of registration in a known example, non-structural elements such as highlighting (Mixed Content) are used.
ent: the details will be described in the third embodiment), and the character string index is created ignoring the structure.

[0013]

According to the above-mentioned prior art method, as shown in FIG. 35, a document identifier for identifying a registered document is stored in a character string index for performing full-text search.
Since it includes three-element data of a context identifier which is information on a logical structure and a character position indicating a position of a character chain, the size of the character string index increases,
Therefore, there is a problem that the amount of memory increases, which leads to an increase in the cost of the device.

Further, in the above-mentioned conventional method, as shown in FIG. 35, each character chain in the character string index includes a context identifier which is information on a logical structure. Is added or changed, a structure index formed by sequentially superimposing the logical structures of a plurality of registered documents (FIG. 34)
Has changed, the context identifier of the character string index needs to be updated. If the number of character chains of the element entity is enormous, the processing amount becomes enormous.

Hereinafter, this problem will be described in detail through specific examples.

FIG. 36 shows an example in which two documents are registered, in which one registered document is changed. In this example, since the logical structures of the document 1 and the document 2 are the same, the logical structure of the created structure index is also the same as that of the document 1 or 2. In this example, an example is shown in which a new chapter is added between the first and second chapters of the document 2 and the document is changed to a document including three chapters. That is, an example in which a block (4000 in FIG. 36) serving as a second chapter is newly added to the document 2 is shown. At this time, the block (4001 in FIG. 36), which was the second chapter before the change, becomes the third chapter. There is no context identifier corresponding to the third chapter of No. 2 (structure index before change in FIG. 36). Therefore, it is necessary to update the structure index as shown in FIG. 36 (changed structure index).

As shown in the structure index after the update in FIG. 36, the context identifier corresponding to the element entity which newly becomes the third chapter in the document 2 is 'C4'. However, since the context identifier corresponding to the element entity was “C3” before the change, the context identifier of each character chain held in the character string index of the element entity was changed from “C3” to “C4”.
Need to be changed to For example, assuming that the element entity corresponding to the third chapter of the document 2 is composed of 100 characters, when creating an index with a two-character chain, it is necessary to change the context identifier for 99 character chains. As described above, there is a problem that the processing amount increases in accordance with the number of character chains of the element entity.

It is to be noted that a new context identifier “C4” is given to the element entity that has become the second chapter after the change, and the context identifier “C3” has been added to the element entity that has become the third chapter after the change in the second chapter before the change. In this case, the context identifier is changed from “C3” to “C4” for the character chain of the character string index of the element entity corresponding to Chapter 2 of Document 1.
Need to be changed to In this example, since there are two registered documents, the processing amount required for updating is the same as that of the above method.
When the number of registered documents increases, the character string index of the element entity of all the registered documents having Chapter 2 needs to be changed from "C3" to "C4" in the context identifier, and the processing amount is rather reduced. The result is an increase.

Another problem is that the structure index of the prior art is formed by sequentially superposing the logical structures of a plurality of registered documents as shown in FIG. 34. Therefore, when the logical structures of the registered documents are substantially the same, Although there is little opportunity to add a new context identifier, if the logical structure of each registered document is significantly different, the overlapping of logical structures will be reduced.If a large number of registered documents with such different logical structures are registered, the context There was a problem that the number of identifiers would be enormous.

The structure index of the prior art is shown in FIG.
As shown in FIG. 4, the logical index is formed by sequentially overlapping the logical structures of a plurality of registered documents. Therefore, in the structure index formed by this method, a plurality of child nodes having the same tag name appear from one parent node. Structure may occur. At this time, when a certain tag name is specified as the search range, it is necessary to check whether the tag name of each node is the corresponding tag name. Even if a plurality of child nodes having a name appear, an OR search for checking whether each child node has a corresponding tag name is necessary, and the search becomes slow. Had.

In the above-mentioned conventional method, when a "keyword" element is included as a Mixed Content in a "paragraph" element which is an element entity, the "keyword"
To create a character string index ignoring the structure of the tag, "Documents containing" XX "in the" keyword "tag"
There is a problem that such search conditions cannot be met.

The present invention solves the above-mentioned problems of the prior art. In a full-text search for a structured document, the present invention supports various logical structure designation searches, further reduces the size of a search index, and reduces the size of a document. The purpose is to simplify the work of changing the search index at the time of part change / partial deletion, to perform high-speed search specifying intermediate nodes and below, to search across Mixed Content, and to perform search by specifying elements that are Mixed Content. And

[0023]

In order to solve the above problems, according to the present invention, a search unit identifier for identifying each element entity, an element entity position identifier expressing the position of each element entity in the tree structure, In order to specify the element entity position identifier from the search unit identifier, the registered document has a structure information creating unit that creates an element management table that associates at least the element entity position identifier related to the search unit identifier. Even if the structure of the document changes, it is possible to respond only by updating the element management table, and it is not necessary to change the context identifier in the character string index every time the document structure changes as in the related art.
Each time the logical structure of the registered document changes, a huge amount of processing for updating the character string index does not occur.

According to a second aspect of the present invention, a search unit identifier for identifying each element entity, a path name ID for identifying a path name in which tag names leading to each element entity are arranged in a hierarchical order, and the same name having the same parent node and the same name are used. A path hierarchy ID for identifying a path hierarchy in which the appearance order of the tags in the same hierarchy is arranged in the hierarchy, and at least the search unit identifier for specifying the path name ID and the path hierarchy ID from the search unit identifier By having the structure information creating means for creating an element management table in which the path name ID and the path hierarchy ID related to the above are associated, even if the structure of the registered document changes, the element management table is updated only by updating the element management table. This makes it possible to avoid an enormous amount of processing for updating a character string index every time the logical structure of a registered document changes as in the related art. In addition, by introducing the path name ID and the path hierarchy ID, the OR search for specifying the search range as in the related art becomes unnecessary. Further, even when many documents having different logical structures of registered documents are registered, since the element entities are specified by the path name ID and the path hierarchy ID, the logical structures of a plurality of registered documents are sequentially overlapped as in the related art. Less than the number of context identifiers needed to be formed.

In the third aspect, a name ID for identifying a tag name
Structure information for creating an element management table in which at least the name ID related to the search unit identifier is associated to identify the name ID from the search unit identifier and a search unit identifier for identifying each element entity With the creation means, it is possible to specify the tag name of the node of the registered document as the search range.

According to a fourth aspect of the present invention, there are provided a result creating means for creating a character string search result list and data for displaying each element entity, and a result displaying means for displaying the search result created by the result creating means on a terminal. As a result, the search result can be displayed to the user.

According to a fifth aspect of the present invention, a structured document input means for inputting a structured document on a network, and a structured document fetched by the structured document input means is analyzed to generate a tree structure of the structured document. A structure analysis unit, a search unit identifier for identifying each element entity in a structured document expressed in a tree structure by the structure analysis unit, and a path for identifying a path name in which tag names leading to each element entity are arranged in a hierarchical order. A path hierarchy ID for identifying a path hierarchy in which the appearance order of tags having the same parent node and the same name in the same hierarchy in the same hierarchy is arranged in a hierarchical order; In order to specify the path hierarchy ID, at least the path name I associated with the search unit identifier
By independently providing a structured document registration unit comprising a structure information creating unit for creating an element management table in which D and a path hierarchy ID are associated with each other, it is possible to remotely register a structured document via a network. It becomes possible to cope with the case where the structure of the registered document changes, only by updating the element management table. No processing volume is generated. In addition, by introducing the path name ID and the path hierarchy ID, the OR search for specifying the search range as in the related art is not required. Even when many documents having different logical structures of registered documents are registered, the element entities are identified by the path name ID and the path hierarchy ID. Therefore, the logical structure of a plurality of registered documents is sequentially superimposed as in the related art. It is less than the number of context identifiers required when formed.

According to the sixth and seventh aspects, when the tree structure of the structured document changes, the ID that needs to be changed is updated from the path name ID and the path hierarchy ID recorded in the element management table, thereby registering. Even if the structure of the document changes, it is possible to cope by updating the element management table, and a huge amount of processing for updating the character string index occurs every time the logical structure of the registered document changes as in the related art. I will not do it.

According to the present invention, a structured document input means for inputting a structured document on a network, and a structured document fetched by the structured document input means is analyzed to generate a tree structure of the structured document. A structure analysis unit, a name ID for identifying a tag name from the tree structure generated by the structure analysis unit, a search unit identifier for identifying each element entity, and specifying the name ID from the search unit identifier, By independently providing a structured document registration unit including a structure information creating unit for creating an element management table in which at least the search unit identifier is associated with the name ID related to the search unit identifier, a structured document can be remotely provided via a network. Can be registered.

In the ninth aspect, when a character string extracted with a predetermined number of characters from each element entity spans the tag, a unique search unit identifier for identifying the child element is obtained, and the character string and the character string A character string index creation unit for generating a search character string index including a search unit identifier for identifying an element entity to which each character belongs and a character position identifier indicating the position of the character string in the element entity with the tag removed , Mixed
Searching is possible even with a structured document including Content. In addition, since the character index to be created is composed of two elements, the search unit identifier and the character position identifier, the conventional technique can reduce the amount of memory as compared with a character string index composed of three elements, thereby realizing cost reduction of the apparatus. can do.

According to a tenth aspect of the present invention, a unique search unit identifier for identifying a character string surrounded by a tag defining a numeric value in advance is obtained, and the character string surrounded by the tag is converted into numerical data. By using a numerical index generating means for generating a numerical index in which the search unit identifier is associated with the numerical data, a search in which a specific numerical range is specified becomes possible.

In the eleventh aspect, the same parent node having the same parent node as the name ID for identifying the tag name, the path name ID for identifying the path name in which the tag names leading to each element entity are arranged in a hierarchical order, and the same on the network. To specify a path hierarchy ID for identifying a path hierarchy in which the appearance order of tags having names in the same hierarchy is linked in a hierarchical order, a search unit identifier for identifying each element entity, and for specifying the name ID from the search unit identifier An element management table in which the name ID related to at least the search unit identifier is associated, or at least the search unit identifier is related to specify the path name ID and the path hierarchy ID from the search unit identifier. A data storage unit for storing at least one of an element management table in which the path name ID and the path hierarchy ID are associated with each other; And at least one of the name ID, the path name ID, and the path hierarchical ID (ID1) corresponding to the search condition is specified from the search condition input means for performing the search and the search condition input by the search condition input means. Search condition analysis means, and a character string index search means for obtaining the search unit identifier having a character string corresponding to the search condition,
A corresponding name ID by referring to the element management table based on the search unit identifier specified by the character string index search means;
A character string provided with a structure matching unit for obtaining at least one (ID2) of a path name ID and a path hierarchy ID and extracting only a search unit identifier in which the ID2 matches the ID1 obtained by the search condition analysis unit By providing the search units independently, a character string search can be remotely performed via a network.

In the twelfth aspect, in a numerical range search of a structured document including a character string surrounded by a tag which defines a numerical value in advance, a unique search unit for identifying the character string surrounded by the tag A numerical index search unit that refers to a numerical index that associates an identifier with a numerical data obtained by converting a character string surrounded by the tag into a numerical value, and extracts the search unit identifier corresponding to a search condition. With the character string search unit according to the eleventh aspect, it is possible to remotely obtain a search unit identifier of an element entity having a numerical value in a specified range via a network.

According to a thirteenth aspect, a step of reading a structured document, a path name ID for identifying a path name in which tag names leading to each element entity are arranged in a hierarchical order, and a tag having the same parent node and the same name A step of generating a path hierarchy ID for identifying a path hierarchy in which the order of appearance in the same hierarchy is connected in a hierarchical order; a step of determining whether or not there is an element entity; and a search unit identifier for identifying each element entity Creating an element management table that associates at least the path name ID and the path hierarchy ID related to the search unit identifier in order to identify the path name ID and the path hierarchy ID from the search identifier By registering a structured document by installing the above program on a general-purpose computer using a portable medium storing a program having It is possible to provide the function of the structured document registration unit.

In the fourteenth aspect, a step of reading a structured document, a step of generating a name ID for identifying a tag name, a step of determining whether or not there is an element entity, and a search unit identifier for identifying each element entity And a program for generating an element management table in which at least the name ID related to the search unit identifier is associated to specify the name ID from the search unit identifier. By installing the above program on a general-purpose computer depending on the medium,
It is possible to have a function of a structured document registration unit for registering a structured document.

According to a fifteenth aspect, a method for generating a character index of a structured document having an element entity (child element) further surrounded by tags inside the element entity includes a step of reading structurally analyzed data, and an element entity. Checking, whether to obtain a search unit identifier for identifying an element entity, checking whether or not the child element is included, and obtaining a search unit identifier for identifying the child element Extracting a character string in units of at least one predetermined number of characters from an element entity; obtaining a search unit identifier to which each character of the character string belongs; and belonging to the character string and each character of the character string Generating a search string index having a character position identifier indicating the position of the character string in the element entity from which the search unit identifier and the tag have been removed; By installing the above program on a general-purpose computer by using a portable medium storing a program having a character string, a function of a character string index creating unit that creates a character string index that can be searched even in a structured document including Mixed Content is provided. It is possible to make it.

According to a sixteenth aspect of the present invention, in the index generating method for a numerical value search of a structured document, a step of reading the structured document and a step of determining whether or not the character string is enclosed by a tag defining a numerical value in advance. Determining, a step of obtaining a search unit identifier for identifying a character string surrounded by a tag defined to be a numerical value, a step of converting the character string into a numerical value, and the search unit identifier By installing the program on a general-purpose computer by using a portable medium storing a program having a step of generating a numerical index composed of the numerical values, a character that generates a character string index that can be searched with a numerical range specified The function of the column index creation unit can be provided.

According to a seventeenth aspect, in the structured document search method, a step of reading a search condition and a name ID for identifying a tag name corresponding to the search condition or a tag name leading to each element entity are arranged in a hierarchical order. Either a path name ID for identifying a path name or a path hierarchy ID for identifying a path hierarchy in which the appearance order of the tags having the same parent node and the same name in the same hierarchy is arranged in the hierarchy (hereinafter, referred to as “ID”). , I
D1), identifying a search unit identifier (hereinafter, ID2) for identifying each element entity having a character string corresponding to the search condition, and determining the name ID, the path name ID, In order to specify the path tier ID, at least the name ID, the path name ID, and the element management table in which the path tier ID is associated with the ID2 are referred to, and the name ID corresponding to the ID2, the path A portable type recording a program having a step of obtaining at least one ID (hereinafter, ID3) of a name ID and the path hierarchy ID, and a step of extracting only the search unit identifier in which the ID1 and the ID3 match. By installing the above program on a general-purpose computer using a medium, a function of a character string search unit is provided. Theft is possible.

In the method for determining a node included in a search range when an intermediate node or less is specified as a search range, a path name for identifying a path name in which tag names leading to each element entity are arranged in a hierarchical order Or, a path hierarchy in which the appearance order of tags having the same parent node and the same name in the same hierarchy is linked in the hierarchy order is moved up by one hierarchy, and the current position of the node matches the designated intermediate node, or Determine whether the node has already been determined to be included in the search range, if it is a node corresponding to any of the above conditions, determine that all the nodes that have been reached so far are included in the search range, It is determined whether the currently located node does not match the designated intermediate node, or whether the node is already determined to be out of the search range. In some cases, the process of determining that all the nodes that have been reached so far is out of the search range is executed every time one level is climbed from the lowest node as a starting point, and is repeatedly executed until the node of the highest layer is reached. Is specified, the nodes included in the search range can be specified when a certain intermediate node or less is specified as the search range.

According to a nineteenth aspect, the structured document management apparatus according to the second aspect can be realized by a general-purpose computer and a program.

According to a twentieth aspect of the present invention, the character string index creating device according to the ninth aspect can be realized by a general-purpose computer and a program.

According to a twenty-first aspect of the present invention, the character string index creating device according to the tenth aspect can be realized by a general-purpose computer and a program.

According to a twenty-second aspect of the present invention, in order to search for data having a tree structure, when a predetermined node or less is specified as a search range, a collation table indicating whether or not each node is included in the search range. The search range can be efficiently specified by the sequentially created program.

According to a twenty-third aspect of the present invention, there is provided an apparatus for managing a structured document represented by a tree structure, wherein structure information creating means for assigning a search unit identifier for identifying an element entity is provided separately from the search unit identifier. Means for storing a path hierarchy in which the order of appearance of tags having the same parent node and the same name in the tree structure are linked by hierarchy as means for specifying an element entity, and tag names are classified by hierarchy in the tree structure. Means for storing a series of path names, means for storing an element management table for associating the path hierarchy and path name with the search unit identifier, and a search unit for an element entity including a character string of search conditions Character string index search means for extracting an identifier, and referring to the element management table from the search unit identifier extracted by the character string index search means,
A structured collation unit that searches for a document that satisfies a path hierarchy or a path name specified as a search condition, thereby enabling efficient document search.

A twenty-fourth aspect of the present invention is a data management apparatus for managing data having a data structure that can be represented by a tree structure, wherein the identification of the entity of the data has the same parent node in the tree structure. A data management device characterized by using a means for storing a path hierarchy in which the appearance order of tags having various names is linked by hierarchy, wherein management of data that can be expressed by a tree structure is managed by a small number of IDs. Becomes possible.

According to a twenty-fifth aspect of the present invention, there is further provided a means for storing a path name in which tag names of data expressed in a tree structure are linked by hierarchy, in order to uniquely specify a substantial element of data in the tree structure. 25. The data management apparatus according to claim 24, wherein a unit that stores the path hierarchy and a unit that stores the path name are used to specify data that can be expressed in a tree structure by using a path hierarchy and a path name. By doing so, it is possible to manage with a small number of IDs.

According to a twenty-sixth aspect of the present invention, when there are a plurality of entity elements having the same parent node and the same tag name,
26. The data management apparatus according to claim 25, wherein the path name is expressed in the same manner, and a so-called OR search is not required in data search, and high-speed search can be performed. Become.

[0048]

Embodiments of the present invention will be described below. The present invention is not limited to these embodiments at all, and can be implemented in various modes without departing from the gist thereof.

(Embodiment 1) FIG. 1 is a configuration diagram of a structured document management apparatus according to Embodiment 1 of the present invention. FIG.
Is composed of a terminal 101, a structured document input unit 102, a search condition input unit 103, a result display unit 104, a search engine 105, and a data storage unit 106.

The terminal 101 is used to specify search conditions in document search and to display search results.

The structured document input means 102 stores a document to be registered, and sends data to the search engine 105 from this when registering the document. Search condition input means 1
03 sends the search condition input from the terminal 101 to the search engine 105.

The result display means 104 receives the search result from the search engine 105 and displays it on the terminal 101.

The search engine 105 actually registers a structured document, performs a search, and creates a search result. First, with respect to registration, 107 is a structure analyzing means for analyzing the logical structure of the document to be registered, 108 is structural information creating means for creating information on the logical structure of each element divided into logical structures by the structural analyzing means, 109 is This is character string index creation means for creating a character string index for performing a high-speed search for a character string. These 107, 108 and 109
Will be described in the description of the flow of the document registration process. Next, regarding search, 110 is search condition input means 1
03, the condition regarding the logical structure in the search condition received from
Search condition analysis means for converting into a structure condition expression method in the present search engine; 111, a character string index search means for performing a search process on a search character string in a search condition using the character string index; This is a structure collating means for extracting, from a group of character string search results obtained by the index search means, only those which match the structural conditions in the present search engine converted by the search condition analyzing means. 110, 11
Details of 1 and 112 will be described in the description of the document search flow. Next, regarding the result creation, reference numeral 113 denotes a result creation unit that creates a list of search results and data for entity display and transfers the data to the result display unit 104.

The data storage unit 106 stores the structure analysis means 10
7, a structure-analyzed data storage unit 114 for storing the structure-analyzed data, an element management table storage unit 115 for storing logical structure information for each search target element in the document, and tag names in order from the highest hierarchy Path name index storage means 116 for managing a character string described as follows (hereinafter, referred to as a path name) and storing a path name index in which an ID is assigned to each path name, the order of appearance of each layer of the path name (the same parent element A character string (hereinafter, referred to as a path hierarchy) in which elements having the same tag name having the same name are consecutively described, and an ID is assigned to each path hierarchy. Path hierarchy index storage means 117 for storing an index, name I for storing a name ID table in which IDs are assigned to tag names of respective elements
D table storage means 118, character string index creation means 1
09, a character string index storage means 119 for storing the character string index created in step 09, an entity data storage means 120 for storing the entity data of the registered document, and a list data storage means 121 for storing data for a search result list. It is used to search structured documents and store data used for displaying results.

Next, the document registration process according to the present embodiment will be described using a specific example of a structured document.

First, a document to be registered is read from the structured document input means 102. Next, the structure of the registration target document is converted into a form that can be understood by the structure analysis unit 107. The structure analysis unit 107 converts the structured document as a character sequence into a data structure that can be understood by the structure information creation unit 108 (hereinafter, referred to as “structure analyzed data”), and is stored in the structure analyzed data storage unit 114. You.

Next, the structure information creating means 108 creates information on the logical structure of each element divided into logical structures by the structure analyzing means.

FIG. 2 shows an example of a structured document. The tree structure obtained as a result of analyzing the structured document of FIG. 2 by the structure analysis unit 107 is as shown in FIG. Hereinafter, a description will be given mainly of a structured document having this logical structure. In FIG. 3, elements having an entity (text) (hereinafter, element entities) are shaded. These element entities are assigned codes (hereinafter, referred to as search unit identifiers) that uniquely indicate search units in the search engine. This search unit identifier is a code irrelevant to the logical position in the target document,
For example, it may be a numerical value.

In FIG. 3, the numerical value written in the lower part of the element entity is an example of the search unit identifier. The element entity can be specified by any one of the above-mentioned path name index, path hierarchy index, and name ID, or a combination of the above-mentioned indexes. Therefore, the three types of indexes are collectively referred to as “element entity position identifier”.

FIG. 4 shows the flow of the processing of the structure information creating means 108. First, the structure-analyzed data of the registration target document is read from the structure analyzed data storage unit 114, and a unique number (hereinafter, referred to as a document number) is assigned to each registration target document (step 401).

Next, the following process is repeated for each element of the document to be registered. First, the name ID of the currently referred element is obtained (step 402). FIG. 5 shows an example of a name ID table finally created when a structured document having a tree structure as shown in FIG. 3 is registered. Since the tag name of the element 301 in FIG. 3 is “paragraph”, the name ID is “T9” from FIG. In step 402, the tag ID and the name ID corresponding to the element currently being referred to in the name ID table
If a record exists, its name ID is obtained. If it does not exist, a new record of its tag name and name ID is created, stored in the name ID table storage means 118, and its name ID is obtained. . Next, the path name ID of the element currently being referred to is obtained (step 40).
3). FIG. 6 shows an example of a path name index finally created when a structured document having a tree structure as shown in FIG. 3 is registered. The path name index is obtained by assigning a unique ID (path name ID) to the path name of the document to be registered. Each path name ID is the name I of the tag name of the lowest layer.
D information. The path name of the element 301 in FIG.
The path name ID assigned to this path name is the value (N11) indicated by 601 in the example of FIG. In step 403, if a path name node corresponding to the element currently being referred to exists in this path name index, the path name ID is acquired. If not, the path name node and the path name ID are acquired. It is newly created and stored in the path name index storage means 116, and its path name ID is obtained. Note that when expressing the path name here, "/" (slash) was used as a delimiter for each layer.
This can be any character that is not used in tag names. Next, the path hierarchy I of the currently referenced element
D is obtained (step 404). FIG. 7 shows an example of a path hierarchy index finally created when a structured document having a tree structure as shown in FIG. 3 is registered. The path hierarchy index is a unique ID for the path hierarchy of the document to be registered.
(Path hierarchy ID). 301 in FIG.
Is a path hierarchy of "/ 1/1/1/1/2",
The path hierarchy ID assigned to this path hierarchy is the value (L5) indicated by 701 in the example of FIG. Step 404
Then, if a node of the path hierarchy corresponding to the element currently being referenced exists in this path hierarchy index, the path hierarchy ID is acquired. If not, the node of the path hierarchy and the path hierarchy ID are newly added. It is created, stored in the path hierarchy index storage means 117, and its path hierarchy ID is obtained. Here, when expressing the path hierarchy, "/" (slash) is used as a delimiter for each layer as in the case of the path name. Something like that is fine. Next, it is checked whether the element currently being referred to has an entity (step 405). If the element does not have an entity, the process proceeds to step 408. If you have an entity, step 4
Proceeding to 06, a search unit identifier is assigned to this element. Next, in step 407, a record of the element currently referred to is added to the element management table. FIG. 8 shows an example of the element management table. Reference numeral 801 corresponds to a record related to the element 301 in FIG. The element management table according to the first embodiment includes a document number and a path name I using a search unit identifier as a key.
D, path hierarchy ID, and name ID are managed. Next, in step 408, step 402 is performed for all elements of the registration target document.
It is checked whether the processing from step 407 to step 407 has been completed, and if there are any unprocessed elements, the processing after step 402 is repeated.

Next, the character string index creating means 109 creates a character string index for element content search for each element. The processing flow of the character string index creation means 109 will be described with reference to FIG.

First, the structurally analyzed data of the document to be registered is read from the structurally analyzed data storage means 114 (step 901). Next, it is checked whether or not the element currently being referred to has an entity (step 902). If the element does not have an entity, the process proceeds to step 807. If the element has an entity, the process proceeds to step 903, and the processing unit 406 of the structure information creating unit 108 acquires the search unit identifier assigned to this element. Next, a character chain having a predetermined number of characters is extracted from the character string of the element content (step 904).

With respect to this character chain, information of a corresponding search unit identifier and a number (hereinafter referred to as a character position number) representing the number of the first character of the character chain in its element content is added to the character string index. (Step 90
5). The processing of steps 904 and 905 is repeated for all character strings of the element (step 906). Next, in Step 907, Step 902 is performed for all the elements of the document to be registered.
It is checked whether or not the processing from step 906 has been completed, and if there are any unprocessed elements, the processing from step 902 is repeated.

Steps 902 to 906 for all elements
Is completed, the character string index created here is finally added to the character string index storage unit 119 (step 90).
8).

FIG. 10 shows an example of a character string index created by the character string index creating means 109 for the element “<title> structured document management </ title>” in the third line of the structured document of FIG. It is a figure showing a part. 1001 in FIG. 10 indicates that “a character chain“ structure ”exists from the position of the“ 1 ”character from the top in the character string of the element whose search unit identifier is“ 1 ””. FIG.
Although 0 indicates only a part of the character string index, a character string index is actually created for all character strings of all elements of the registration target document.

In this example, a character chain is extracted two characters at a time and a character string index is created for each character chain. However, the character chain does not have to be two characters. The above-described registration process is repeated each time a document to be registered is input, whereby structure information and a character string index are added.

In FIG. 5 and the like, the name ID, the path name ID, and the path hierarchy ID are “T9”, “N11”, “L”
These are represented by characters such as 5 ", which are IDs for uniquely specifying names (tag names), IDs for uniquely specifying path names, and IDs for uniquely specifying path hierarchies. Next, the flow of the document search process according to the present embodiment will be described with reference to a specific example.

In the following description of the document search processing according to the present embodiment, the name ID table, the path name index, the path hierarchy index, and the element management table are shown in FIGS. 5, 6, 7, and 10, respectively. The description will be made assuming that data such as 8 is stored.

First, from the terminal 101 via the search condition input means 103, the message "Path name is" / article / bibliography / title ""
It is assumed that a condition that “a document including a character string“ structured ”is included in an element” is given.

FIG. 11 is a diagram showing the flow of processing of the search condition analysis means 110. This example corresponds to Case 3 in FIG. 11 because only the path name is specified as the structure specification of the search condition. Step 110 in Case 3
In step 2, the path name of the search condition is converted into a path name ID by referring to the path name index stored in the path name index storage means 116. When the path name index is shown in FIG. 6, the path name “/ article / bibliography / title” of the search condition is converted into the path name ID “N2”.

Next, the character string index search means 111 performs a search process on the character string of the search condition. FIG. 12 shows the processing in the character string index search means 111.
In this example, the search condition string is "structured"
This is a "structure" and "formulation" as a character chain of two characters each.
Can be taken out. The number of characters in the character chain to be taken out here is the same as the number of characters in the character chain created by the character string index creation means 109. Regarding these two character chains, 12 in FIG.
Assuming that a character string index is created as shown in FIG.
Among them, those having the same search unit identifier and having consecutive character position numbers from the character chain of “structure” to the character chain of “formulation” are extracted as a result of the character string index search means 111. In the example of FIG. 12, 1221, 1222, and 1223 can be extracted as those having the same search unit identifier. Among them, the character position numbers are continuous at 1221 and 1223, and these search unit identifiers are extracted.

Next, the structure matching means 112 obtains a final search result satisfying the structure specification of the search condition from the search unit identifier group obtained by the character string index search means 111.
FIG. 13 is a diagram showing a flow of processing of the structure matching unit 112. Case 1 to Case 4 in FIG.
The structure specification patterns Case1 to C of the search condition in FIG.
Same as case4. In this example, since it is Case 3 (only the path name is specified), the path name is collated in step 1303. FIG. 14 is a diagram showing details of the structure matching process in this example. First, character string index search means 1
The element management table is referenced using the search unit identifier (1401) obtained in step 11 as a key. Therefore, only the path name ID of the search unit identifier that matches the path name ID (“N2” in this example) of the search condition obtained by the search condition analysis means 110 is determined as the final search result.

In this embodiment, as the structure specification of the search condition, a search specifying a tag name (Case 1), a search specifying a tag name and its appearance order (Case 2), a search specifying a path name and a path hierarchy are performed. (Case 4) is also possible. The processing in Case will be briefly described below.

In the case of a search (Case 1) in which a tag name is designated, first, the search condition analyzing means 110 converts the tag name of the search condition into a name ID from FIG. 11 (step 110).
1).

Next, similarly to Case 3, the character string index search means 111 performs a search process on the character string of the search condition, and obtains a corresponding search unit identifier group. Finally Figure 1
3, the character string index search means 1
11, only those whose name ID matches the name ID obtained in step 1101,
Extracted based on the element management table (step 1301),
Make it the final search result.

A search specifying a tag name and its appearance order (C
In case 2), after performing the same processing as in Case 1, finally, the appearance order collation processing (step 130 in FIG. 13)
Perform 2). In step 1302, the path hierarchy index is referred to using the path hierarchy ID of the search unit identifier as a key, and only those whose appearance order of the terminal hierarchy matches the appearance order of the search condition are extracted as a final search result.

A search specifying a path name and a path hierarchy (Ca
In case of se4), the search condition analyzing means 110 uses Case3.
After the processing of step 1102 is performed in the same manner as described above, the path hierarchy of the search condition is converted into the path hierarchy ID using the path hierarchy index (step 1103). Next, Ca
Similarly to se3, the character string index search means 111 performs a search process on the character string of the search condition, and obtains a corresponding search unit identifier group.

Finally, the structure matching means 112
Path name ID collation processing as in step 3 (step 1303)
Is performed, the path hierarchy ID collation processing (step 130)
Perform 4). In step 1304, only those whose path hierarchy ID of the search unit identifier matches the path hierarchy ID converted in step 1103 are extracted as the final search result.

Finally, the search result creation / display process will be described. The result creating unit 113 stores the bibliographic information (title, author, date, etc.) of the document obtained as a search result in the list data storage unit 121 as data for displaying the result list. This data is displayed on the terminal 101 through the result display means 104. Next, when one of the documents is selected from the search result list as the entity display request from the terminal 101, the result creating unit 111 acquires the entity of the specified document from the entity data storage unit 115, and displays the result. The information is displayed on the terminal 101 through the means 104. By registering the registration target document in the entity data storage unit 120 in units divided into elements by the structure analysis unit 107, it is possible to create a result list for each element in the search result creation / display processing, and It is also possible to obtain the entity.

As described above, in the present embodiment, the logical structure information of the structured document is stored in the element management table storage means 115,
Path name index storage means 116, path hierarchy index storage means 117, name ID table storage means 11
8 is stored separately, and information on these logical structures is not included in the character string index, thereby making it possible to reduce the size of the character string index. Further, when adding, changing, or deleting specific element contents of a document, it is only necessary to change the element management table for the record of the search unit identifier in which the logical structure has changed due to the addition, change, or deletion. Thus, the amount of processing can be significantly reduced as compared with the method of including information on the logical structure in the character string index. (In the case of the method of including information about the logical structure in the character string index, addition, change, and deletion require modification of the character string index of the entire character chain for the element in which the logical structure has changed.) Specific examples are shown below. FIG. 15 shows an example in which a node group 1501 is added between the first chapter and the first section of the document having the structure shown in FIG. In this case, the node 1502 must be changed from Chapter 1 Section 2 to Chapter 1 Section 3. At this time, in the method according to the present embodiment, for the registered data, it is only necessary to change the path name ID and the path hierarchy ID of the records of the search unit identifiers 10 and 11 in the element management table. On the other hand, in the case of including the information on the logical structure in the character string index, the logical structure information must be changed for the character string index of the entire character chain of the elements of the search unit identifiers 10 and 11. (Assuming that the content of the element of the search unit identifier 10 is 100 characters, 2
If the index is created by a character chain, the character string index of the 99 character chains needs to be changed).

In the present embodiment, the ID for specifying the logical structure position of an element is a path name ID and a path hierarchy ID.
Therefore, even if the logical structure is complicated and enormous, the total number of IDs can be compared with the method of specifying the logical structure position using one type of ID (context identifier) as in a known example. Can be reduced.

In the present embodiment, registration and retrieval of a structured document of one document have been described. However, the same processing can be realized for a plurality of documents. In this embodiment, a method of creating a path name ID in one type of DTD has been described. However, even when a request to register a plurality of different DTD documents occurs in the present system, individual path name IDs are assigned to each node. , A search specifying a logical structure can be realized. In addition, by having the element management table, the path name index, the path hierarchy index, and the name ID table on the primary storage, the speed of the structure matching unit 112 can be increased.

In this embodiment, an apparatus for managing structured documents has been described. However, the present invention is not limited to structured documents, and the above-described path is used for managing data that can be expressed in a tree structure. It is also possible to manage entity elements (entity of data) using the name index and the path hierarchy index.

Further, although the first embodiment has been described as an example in which the present invention is realized as an apparatus, the present invention may also be realized by installing a program which functions as a structured document management apparatus disclosed in this embodiment in a general-purpose computer. Is possible.

(Embodiment 2) Embodiment 2 of the present invention will be described below. FIG. 16 is a configuration diagram of the structured document management device according to the second embodiment. The difference from FIG. 1 which is the configuration diagram of the first embodiment is that the data storage unit 106 has a path name ID collation table storage unit 1601 and a path hierarchy I
The D collation table storage means 1602 is newly provided. In addition, the search condition analysis means 11
0 and the processing of the structure matching means 112 are different from those of the first embodiment.

Path name ID collation table storage means 160
1 stores information as to whether each path name ID is within the range of the structure specification of the search condition.

Path hierarchy ID collation table storage means 160
2 stores information on whether or not each path hierarchy ID is within the range of the structure specification of the search condition.

The purpose of the second embodiment is to cope with a structure specification other than the structure specification patterns Case 1 to Case 4 of the search condition in the first embodiment. Ca
From se1 to Case4, a search is performed on the terminal element itself specified by a tag name, a path name, or the like. The search realized in the second embodiment is a search in which an intermediate node having no entity is specified. For example, "Chapter"
The purpose of the present invention is to meet a search condition such as “search for a document including a character string“ management ”below”.

The registration processing in the second embodiment is the same as that in the first embodiment, and a description thereof will be omitted.

Next, the flow of the search processing in the second embodiment will be described with a specific example. In the following description of the document search process according to the present embodiment, the name ID
The description will be made assuming that the data shown in FIGS. 5, 6, 7, and 8 are stored in the table, the path name index, the path hierarchy index, and the element management table, respectively.

First, through the search condition input means 103,
It is assumed that a condition that “a document including a character string“ management ”in an element whose path name is equal to or lower than an intermediate node whose path name is“ / article / text / chapter ”” is given from the terminal 101.

FIG. 17 is a diagram showing a flow of processing of the search condition analyzing means 110 according to the second embodiment. In this example, since a path name or less is specified as the structure specification of the search condition, this corresponds to Case 7 in FIG. Cas
In e7, in step 1102, the path name of the search condition is converted into a path name ID as in the first embodiment. When the path name index is as shown in FIG. 6, the path name “/ article / text / chapter” of the search condition is converted into the path name ID “N6”.
Next, in step 1701, a path name ID collation table is created. FIG. 18 is a diagram showing the contents of the path name ID collation table in the example of the search condition here. This path name ID collation table is created for each search request, and for all path name IDs in the path name index, a path name ID within the range specified by the search condition and a path name I outside the range are specified.
Created to determine D immediately. In the case of this example, the path name IDs “N7, N8, N9, N10, N” that are below the path name ID “N6” from the path name index in FIG.
11 "is within the range, and the others are outside the range.

Next, the character string index search means 111 performs a search process on the character string of the search condition. Although the processing procedure is the same as that of the first embodiment, the description is omitted. However, as a result of the search using the character string “management” in this example, the search unit identifiers “1” and “9” are obtained. , Continue explanation.

Next, the structure matching means 112 obtains a final search result which satisfies the structure specification of the search condition from the search unit identifier group obtained by the character string index search means 111.
FIG. 19 is a diagram showing a flow of processing of the structure matching means 112 according to the second embodiment.

Case 5 to Case 8 in FIG.
This is because the search condition structure designation pattern Ca shown in FIG.
This is the same as from case 5 to case 8. In our example,
Since it is Case 7 (specify the path name or less), the path name ID collation processing in step 1303 is performed. However,
The path name ID collation processing in Case 7 performs collation using a path name ID collation table. FIG. 20 is a diagram showing details of the structure matching process in this example. First, the element management table is referenced using the search unit identifier group (2001) obtained by the character string index search means 111 as a key. Therefore, the path name ID collation table is referred to from the path name ID of the search unit identifier, and only those whose collation flag is “1” (within the range) are determined as the final search results.

In the present embodiment, as the structure specification of the search condition, the search for the intermediate node or less specified by the tag name (Case 5), and the search for the intermediate node or less specified by the tag name and its appearance order (Case 6) ), A search (Case 8) for intermediate nodes and below specified by a path name and a path hierarchy is also possible. The processing in Case will be briefly described below.

In the case of the search (Case 5) for the intermediate node and below specified by the tag name, the search condition analysis means 110
The processing in the character string index search means 111 is the same as in Case 1 of the first embodiment, and a description thereof will not be repeated. Finally, the structure designating means 112 checks the structure designation from FIG. Here, the path name ID creation and
The update / collation processing will be described. FIG. 21 shows the path name I
6 is a flowchart showing the flow of a D creation / update / collation process, and will be described with reference to this flowchart.

First, the collation flag of the path name ID collation table is initialized to “0” (undecided) (step 310).
1). Next, the following processing is repeated for each search unit identifier group obtained by the character string index search means 111. First, a search unit identifier is acquired (step 3102), and a collation flag of the path name ID (acquired from the element management table) of the retrieval unit identifier is referenced (step 3103). If the collation flag is "1" (within the range), If there is (Step 310
4), the search unit identifier is included in the final search result (step 3105). Matching flag is "2" (out of range)
If (Step 3106), the search unit identifier is not included in the final search range (Step 3107). If the collation flag is "0" (undecided), the path name index is referenced using the path name ID of the search unit identifier as a key (step 3108), and matches the name ID obtained in step 1101 of the search condition analysis means 110. Or, if the collation flag of the path name ID of the traced node is "1" (within the range) (step 3109), the path name ID of the search unit identifier and all the path name IDs traced therefrom are compared. Then, the collation flag in the path name ID collation table is set to 1 (step 3110), and the search unit identifier is included in the final search result.

Conversely, when the collation flag of the path name ID of the traced node is "2" (out of range) (step 311)
1) For the path name ID of the search unit identifier and all of the path name IDs that have been traced to it, the collation flag in the path name ID collation table is set to “2” (out of range) (step 3112). Do not include the search unit identifier in the final search results.

Further, if the collation flag of the path name ID of the traced node is “0” (undecided), it goes up one level (step 3113) and judges whether or not it is the root node (step 3114). If it is not the root node, the process returns to step 3108 again. If it is the root node, the collation flags of the path name ID of the search unit identifier and all the path name IDs that have been traced so far are set to 2 "out of range" (step 3112).

It is checked whether or not the next applicable search unit identifier exists (step 3115).
It returns to step 3102. If not, the process ends.

As described above, since the path name ID collation table for gradually determining whether each path name ID is within the range of the search condition is learned, the path name ID is collated with another search unit identifier. At this time, the path name I already determined to be within the range (the collation flag is “1”)
In the case of D, the search unit identifier can be immediately included in the final search result.

Note that steps 3101 through 3
The processing up to 115 can be realized by installing a program for realizing the processing of the above steps in a general-purpose computer.

In the above-described embodiment, an example has been described in which, when a search range below the intermediate node is specified in a structured document, nodes included in the search range are determined. The same applies to data that can be represented by a structure.

In the case of the search (Case 6) for the intermediate node or lower designated by the tag name and its appearance order, the search condition analysis means 110, the character string index search means 111, and the structure collation means 112 up to Step 1901 are in Case 5
The same processing as is performed. Next, only when the path name ID is within the range in step 1901, step 1902
Perform the path hierarchy ID creation / update / collation processing. FIG.
Is an example of a path hierarchy ID collation table. Step 19
In step 02, similarly to the processing related to the path name ID in step 1901, it is learned whether or not the path hierarchy ID is within the range of the structure specification, and the search unit identifier having the path hierarchy ID whose collation flag is "1" is finally determined. Search results.

In the case of a search (Case 8) for the intermediate node and below specified by the path name and the path hierarchy, the search condition analysis means 110 performs the same processing as in Case 7, and then executes the path hierarchy ID collation table in step 1702. Create In this path hierarchy ID collation table, in the path hierarchy index, the collation flag for the path hierarchy ID of the node corresponding to the path hierarchy ID obtained in step 1103 and all the nodes below it is set to "1" (within the range).
And the others are set to “2” (out of range). The processing in the character string index search means 111 is the same as in Case 7, and a description thereof will be omitted.

Next, in the structure collation means 112, Cas
After performing the same processing as in e7, the path hierarchy ID of the search unit identifier is collated using the path hierarchy ID collation table created in step 1702. Here, only the search unit identifier having the path hierarchy ID whose collation flag of the path hierarchy ID collation table is “1” is the final search result.

Since the search result creation / display processing in the second embodiment is the same as that in the first embodiment, the description is omitted.

As described above, in the present embodiment, when searching for an intermediate node by specifying the following, the path name in which information as to whether or not each path name ID falls within the structure specification range of the search condition is stored. Create an ID collation table and a path hierarchy ID collation table that stores information on whether each path hierarchy ID is within the range of the structure specification of the search condition, and specify the intermediate nodes and below by performing the structure collation processing Realized high-speed search.

Note that, in the configuration of the second embodiment shown in FIG.
1, and path hierarchy ID collation table storage means 1602
Is not used, it is possible to cope with the structure designations Case 1 to Case 4 of the search condition in the first embodiment. In the description of the present embodiment, the path name I
The value of the collation flag in the D collation table and the bus hierarchy ID collation table is “1” when the value is within the range, “2” when the value is out of the range, and “0” when the value is undecided. Any value may be assigned as long as the value can be used to determine whether the state is within, outside, or undetermined.

Further, although the second embodiment has been described as an example in which the present invention is realized as an apparatus, the present invention can also be realized by installing a program which functions as a structured document management apparatus disclosed in this embodiment in a general-purpose computer. Is possible.

Embodiment 3 Hereinafter, Embodiment 3 of the present invention will be described. The configuration diagram of the structured document management device in the third embodiment is the same as FIG. 1 in the first embodiment or FIG. 16 in the second embodiment. However, the method of creating a character string index in the character string index creating means 109 is slightly different from that in the first and second embodiments, and accordingly, the processing in the character string index searching means 111 and the structure matching means 112 is performed in the first embodiment. And is different from the second embodiment.

Here, the flow of the registration process in the third embodiment will be described. First, the structured document input means 102,
The processing of the structure analysis unit 107 and the structure information creation unit 108 is the same as in the first and second embodiments, and therefore, the description is omitted.

FIG. 23 shows the flow of processing of the character string index creation means 109 according to the third embodiment. Steps 901 to 903 are the same as those in the first and second embodiments, and a description thereof will be omitted. Next, the element is Mi
It is checked whether or not the content includes the xed content (step 2201).
The search unit identifier assigned to t is obtained (step 2202). This "Mixed Content"
Is an element entity that exists inside the element entity as a child element of the element. For example, 2310 in FIG.
, Among the elements representing the “paragraph”, the element further surrounded by the “keyword” tag is the MixedContent. Other examples include "emphasis" and "italics", and when searching, these "paragraphs" and "keywords"
It is desirable to search and hit even a character string that spans the elements. Therefore, when the character chain is extracted in step 2203, the character chain extending over the Mixed Content is also extracted. The search unit identifier of the second character in the chain and the character position number are stored (hereinafter, such a character string index of a character chain spanning Mixed Content is referred to as an extended character string index). In this case, the character position number is such that the leading character of the character chain is Mix.
It is a number indicating the number of the character in the element outside the ed Content. The processing from steps 906 to 908 is the same as in the first and second embodiments, and a description thereof will be omitted.

Next, an example of creating a character string index of an element including Mixed Content will be described with reference to FIG. As shown by reference numeral 2310 in FIG. 24, Mixed Content enclosed by “keyword” tags in “paragraph”
The description will be made on the assumption that the search unit identifier of the element of the “keyword” tag is “101” and the search unit identifier of the element of the “paragraph” tag is “102”.
2320 shows a character string index created in the case of this example. In the case of this example, “detect” (2321)
And the character chain of “find” (2323)
The first character string and the second character string of the character chain are stored in the character string index. Note that although 2320 in FIG. 24 shows only a part of the character string index, a character string index is actually created for all character strings of all elements of the registration target document.

Next, the flow of a document search process according to the third embodiment will be described. First, search condition input means 10
3. The processing in the search condition analysis unit 110 is the same as that in the first and second embodiments, and a description thereof will be omitted. Next, the processing in the character string index search means 111 is basically the same as in the first and second embodiments. However, in the third embodiment, in the character string index creation unit 109, in the case of a character chain spanning Mixed Content, the first character chain and the second character chain
Since the extended character string index including the two search unit identifiers of the characters is created, a new search process is required when the extended character string index is involved. Hereinafter, a specific example thereof will be described with reference to FIG. When the search character string is “search”, 2322, 2323, and 2324 are obtained as character string indexes of character chains corresponding to 2310 elements.
Here, the search unit identifier of 2322 and the character string first character search unit identifier of 2323 as the extended character string index are “1”.
01 ", and the character position numbers are" 4 "and" 5 ".
Is continuous. In addition, the second character search unit identifier of the character chain of the extended character string index 2323 matches the search unit identifier of 2324 with “102”, and the character position numbers continue with “5” and “6”. In such a case, the character chain 23
It means that the character string search was hit from 33 to 2324. At this time, a set of search unit identifiers corresponding to the first character and the last character of the search character string is returned as the search unit identifier of the character string search result. In the case of this example, a set of the first character search unit identifier “101” and the last character search unit identifier “102” is returned. Next, the processing of the structure matching means is basically the same as in the first and second embodiments. However, in the third embodiment, a set of the first character search unit identifier and the last character search unit identifier may be included in the character string search result group obtained from the character string index search unit 111. New processing is required.

In the example used in the description of the character string index search means 111 in the third embodiment, a set of a head character search unit identifier “101” and a tail character search unit identifier “102” is set as a character string search processing result. I returned. In this case, a structure matching process similar to that in the first and second embodiments is performed on both the search unit identifiers “101” and “102”, and both search unit identifiers are applicable to the structure specification of the search condition. Only the final search results.

Since the search result creation / display processing in the third embodiment is the same as in the first and second embodiments, the description is omitted.

As described above, in the present embodiment, when Mixed Content is included in the structured document to be registered, a character string index (the first character chain and the second character chain) is also used for a character chain spanning the Mixed Content. By creating an extended character string index that stores the two search unit identifiers of the characters,
It is possible to search for a character string spanning nt. In addition, a search that specifies an element that is a MixedContent (the “keyword” element in the above description) can be performed.

In the description of the third embodiment, 2
A character string is extracted for each character and a character string index is created for each character chain. However, the character chain does not have to be two characters. In this case, the “character chain first character search unit identifier” in the third embodiment is replaced with the “character chain first character search unit identifier” and the “character chain second character search unit identifier”.
Can be replaced by “the search unit identifier of the last character in the character chain” to achieve the same effect.

Although the third embodiment has been described as an example in which the present invention is realized as an apparatus, the present invention can also be realized by installing a program which functions as a structured document management apparatus disclosed in the present embodiment in a general-purpose computer. Is possible.

Embodiment 4 Hereinafter, Embodiment 4 of the present invention will be described. FIG. 25 is a configuration diagram of the structured document management device according to the fourth embodiment. The difference from FIG. 1, which is the configuration diagram of the first embodiment, is that the search engine 105 uses the numerical index creation unit 2401 and the numerical index search unit 240
2 is stored in the data storage unit 106 as a numeric setting storage unit 240
3 and a numerical index storage unit 2404 are newly provided.

The numerical type index creating means 2401 creates an index for numerical range search with respect to the element content of a preset tag name.

The numerical index search means 2402 performs a numerical range search process using the numerical index created by the numerical index creating means 2401.

The numerical type setting storage means 2403 stores a set of tag names of elements determined to create a numerical index in advance.

The numerical index storage means 2404 stores the numerical index created by the numerical index creating means 2401.

Here, the flow of the registration process in the fourth embodiment will be described using a specific example. First, in the fourth embodiment, before registering a document in the present system, it is assumed that a tag name “price” is set in the numerical value setting storage unit 2403 as a tag name of an element for which a numerical index is created in advance. . At this time, a case where a document as shown in FIG. 26 is registered will be described. Structured document input means 10
2. The processing of the structure analysis unit 107, the structure information creation unit 108, and the character string index creation unit 109 is performed in
The description is omitted because it is similar to that of the second embodiment.

FIG. 27 shows the flow of processing of the numerical index creating means 2401 in the fourth embodiment. First step 2
In step 601, the structurally analyzed data of the registered document is read. Next, it is checked whether the element currently being referred to is an element set to create a numerical index in the numerical type setting storage unit 2403 (step 2602). If the element is not set, the process proceeds to step 2606. If the element has been set, in step 406 of the structure analysis means 107, the retrieval unit identifier assigned to the element is obtained. Next, in step 2604, the entity (character string) of the element is converted into numerical data. At this time, if the character string contains not only numbers but also character data such as units, only the character string of the number part is extracted and converted to numerical data. Then, the search unit identifier of the element and the record of the numerical data are added to the numerical index. At this time, the numerical type index is stored in the numerical type setting storage unit 2403.
It is created for each name ID of the tag name of the element set in (2605). Next, in step 2606, all the elements of the document to be registered are processed in steps 2602 to 2605.
It is checked whether or not the process has been completed, and if there is an unprocessed element, the process from step 2602 is repeated. When the processing of steps 2602 to 2605 is completed for all elements, finally, the numerical index created here is added to the numerical index storage unit 2404 (step 2607).

In the case of this example, the element for creating the numerical index is the element indicated by 2501 in FIG. If the search unit identifier of the element is "201", the numerical index created is as shown by 2710 in FIG. In addition,
In FIG. 28, the numerical data is stored as a Long type integer, but may be stored as a Double type floating point number or the like. However, it is necessary to unify the type for each numerical type index created for each name ID.

Next, a description will be given of a document retrieval process according to the fourth embodiment. In the fourth embodiment, since the numeric index is created for the element of the tag name set in the numeric type setting storage unit 2403, the character specifying the structure described in the first and second embodiments is used. In addition to searching columns,
Numeric range search is possible.

As an example, first, it is assumed that a condition that “the content of the element whose tag name is“ price ”is“ 1500 to 1700 yen ”” is given from the terminal 101 through the search condition input means 103. At this time, search condition analysis means 1
The processing of Step 10 is the same as that of Case 1 of the first embodiment, and a description thereof will not be repeated.

Next, since the search condition is a search in which a numerical range is designated, the processing is performed not by the character string index search means 111 but by the numerical index search means 2402. In our example,
Assuming that data such as 2720 in FIG. 28 is stored in the numerical index created for the name ID of the “price” tag, it is assumed that numerical data of 1500 or more and 1700 or less are stored as 2721 (search unit identifier: 54 ), 27
22 (search unit identifier: 201) and 2723 (search unit identifier: 545) are extracted.

Next, the structure collating means 112 checks the structure designation of the search condition for the search unit identifier extracted in the processing of the numerical index search means 2402. The processing of the structure matching unit 112 in this example is the same as that of the first embodiment, and a description thereof will be omitted. In the fourth embodiment, not only Case 1 in the first embodiment but also Case 2 and
Se3 and Case4 can be supported. Each Ca
The processing in search condition analysis unit 110 and structure matching unit 112 in se is the same as in the first embodiment, and a description thereof will be omitted.

Since the search result creation / display processing in the fourth embodiment is the same as that in the first embodiment, the description is omitted.

As described above, in the present embodiment, a numeric index is created by the numeric index creating means 2401 with respect to the element of the tag name set in advance by the numeric setting storage means 2403, whereby the element contents Can be searched for a numerical range in which is treated as numerical data.

The numerical index according to Embodiment 4 is as follows.
Although described as having a structure like 2720 in FIG. 28, this numerical index may have any structure as long as it can extract a search unit identifier corresponding to a specified numerical range. Also, in the fourth embodiment, the description has been given assuming that the numerical index creating means 2401 is performed after the processing by the character string index creating means 109. However, step 405 in FIG. In step 406 and step 40 when the element entity is encountered.
Steps 2602 to 2 in FIG.
It is also possible to perform the process of 605.

Although the fourth embodiment has been described as an example in which the present invention is realized as an apparatus, the present invention can also be realized by installing a program which functions as a structured document management apparatus disclosed in this embodiment in a general-purpose computer. Is possible.

(Embodiment 5) Hereinafter, Embodiment 5 of the present invention will be described. FIG. 29 is a configuration diagram of the structured document management device according to the fifth embodiment.

The present embodiment is characterized in that the functions of the structured document management device are distributed on a network.

The structured document registration unit 3001 has a function of reading and analyzing a structured document and generating a tree structure of the structured document. The character string index creation unit 3002 converts the structured document analyzed by the structured document registration unit 3001
It has a function of generating a search index. The character string search unit 3003 has a function of reading a search condition and searching for an element entity having a character string corresponding to the search condition. The result display unit 3004 is the character string search unit 3003
Has a function of displaying on the terminal 101 the search result obtained in step (1). Note that the terminal 101 and the data storage unit 106 have the same functions as those described in Embodiment 1, and
The data storage unit 106 receives and stores the analyzed structured document, character string index, search result, and the like created by each of the functional blocks via a network. The terminal 101 transmits the search condition specified by the user to the character string search unit 30 via the network.
Send to 03. Further, it has a function of receiving and displaying the search results stored in the result display unit 3004 via the network. Hereinafter, each functional block will be described.

The structured document registration unit 3001 is composed of the structured document input means 102, the structure analysis means 107, and the structure information creation means 108, and these three means have the functions described in the first embodiment. It has the same function as. However, the element management table created by the structure information creating means 108 has the correspondence between the search unit identifier, the path name ID, and the path hierarchy ID as shown in FIG. A format indicating the relationship or a format indicating the correspondence between the search unit identifier and the name ID may be used.

The same functions as those of the structured document registration unit 3001 can be executed in the form of a program. By installing the program in a general-purpose computer using a portable medium storing the program, the structured document registration unit 3001 can be executed. Part 30
01 can realize the same function.

The structured document registration unit 3001 can also function as a device by itself.

The character string index creating section 3002 is composed of the character string index creating means 109 and the numerical type index creating means 2401. The character string index creation means 109 has the same function as the function described in the first embodiment. Numerical index creation means 2401 has the same function as the function described in the fourth embodiment. However, numerical index creation means 2
Reference numeral 401 denotes a component required when searching for a character string corresponding to a specific numerical range as a search condition. If the search condition does not include a numerical range, the numerical index creation unit 2401 is unnecessary. .

Note that the same function as that of the character string index creation unit 3002 can be executed in the form of a program. By installing this program on a general-purpose computer using a portable medium on which the program is recorded, the character string index creation unit 3002 can be created. Part 30
02 can realize the same function.

The character string index creation unit 3002 itself can also function as a device.

The character string search section 3003 comprises the search condition input means 103, the search condition analysis means 110, the character string index search means 111, the numerical index search means 2402, and the structure matching means 112. The search condition input unit 103, the search condition analysis unit 110, the character string index search unit 111, and the structure matching unit 112 have the same functions as those described in the first embodiment. However, when the element management table created by the structure information creating unit 108 is in the format shown in FIG. 31, a tag name cannot be specified as a search condition, and a path name or a path hierarchy can be specified. On the other hand, when the element management table is in the format of FIG. 32,
Only tag names can be specified as search conditions.

Note that the same function as that of the character string search unit 3003 can be executed in the form of a program. By installing the program in a general-purpose computer using a portable medium storing the program, the character string indexing unit 3403 can be executed. The same function can be realized.

The character string search section 3003 itself can also function as a device.

The numerical index search means 2402 has the same function as the function described in the fourth embodiment. However, the numerical index search means 2402 is a component necessary when searching for a character string corresponding to a specific numerical range as a search condition. If the search condition does not include a numerical range, the numerical index search means 2402 Search means 2402 is unnecessary.

The same function as that of the numerical index search means 2402 can be executed in a program format.
By installing this program on a general-purpose computer using a portable medium on which the program is recorded, the same function as that of the numerical index search means 2402 can be realized.

FIG. 30 is a flowchart showing the flow of the process of the character string search unit 3003.

First, a search condition specified by the user is read (step 3005), and then a name ID, a path name ID, or a path hierarchy I corresponding to the read search condition is read.
It is converted to any ID of D (hereinafter, ID1) (step 3006). Note that which of the three IDs is converted depends on the search condition of the user as shown in FIG. Also, what search conditions are possible are restricted by the format of the element management table shown in FIGS. 8, 31, and 32. Next, all search unit identifiers having a character string corresponding to the search condition (hereinafter, ID2)
(Step 3007), referring to the element management table based on the ID2, and corresponding ID of any of the name ID, the path name ID, or the path hierarchy ID
(Hereinafter, ID3) is specified (step 3008), and finally, a search unit identifier that matches the ID1 and ID3 is specified (step 3009).

The result display unit 3004 displays the result creating means 11
3 and result display means 104. The result creating unit 113 and the result displaying unit 104 have the same functions as those described in the first embodiment.

Although the fifth embodiment has been described as an example in which the present invention is realized as an apparatus, the present invention can also be realized by installing a program functioning as a structured document management apparatus disclosed in this embodiment in a general-purpose computer. Is possible.

[0157]

As described above, according to the present invention, in a structured document management apparatus capable of performing a search by designating various logical structures of a structured document, information relating to the logical structure is not included in the character string index. Thus, the size of the character string index can be reduced. Further, there is an effect that the processing amount is greatly reduced when adding, changing, or deleting specific element contents of a document.

Further, since the ID for specifying the logical structure position of a node is managed by being divided into two, a path name ID and a path hierarchy ID, even if the logical structure becomes complicated and enormous, the structure can be changed. This has the effect of enabling the total number of IDs to be specified to be kept low.

A path name ID collation table storing information as to whether or not each path name ID falls within the structure specification range of the search condition, and each path hierarchy ID falls within the structure specification range of the search condition. By creating a path hierarchy ID collation table in which information as to whether or not information is stored and performing the structure collation processing, there is an effect that a high-speed search that specifies intermediate nodes and below is realized.

As described above, according to the conventional technique, when a node below the intermediate node is designated as a search range, even if nodes having the same tag name and the same parent node have different context identifiers, different context identifiers are assigned. Although an OR search for checking whether or not to perform the search is required, there is a problem that the search time becomes long. However, according to the present invention, even if a plurality of nodes having the same tag name and the same parent node exist, However, since the same identifier is assigned, the OR search becomes unnecessary, and the search time can be shortened.

Further, by creating an extended character string index for a character chain extending over Mixed Content, a character string extending over Mixed Content can be searched, and
This has the effect of enabling a search specifying an element that is nt.

Further, by creating a numerical index for the element of the tag name set in advance, it is possible to search a numerical range in which the element contents are treated as numerical data.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of a structured document management device according to a first embodiment of the present invention.

FIG. 2 is a diagram showing an example of a structured document according to the first embodiment of the present invention.

FIG. 3 is a diagram illustrating an example of a tree structure obtained by analyzing the structure according to the first embodiment of the present invention;

FIG. 4 is a diagram showing a processing procedure of a structure information creating unit according to the first embodiment of the present invention.

FIG. 5 is a diagram showing an example in which a name ID is assigned according to the first embodiment of the present invention.

FIG. 6 is a diagram showing an example of a path name index according to the first embodiment of the present invention.

FIG. 7 is a diagram showing an example of a path hierarchy index according to the first embodiment of the present invention.

FIG. 8 is a diagram showing an example of an element management table according to the first embodiment of the present invention.

FIG. 9 is a diagram showing a processing procedure of a character string index creation unit according to the first embodiment of the present invention.

FIG. 10 is a diagram showing an example of a character string index according to the first embodiment of the present invention.

FIG. 11 is a diagram showing a processing procedure of a search condition analysis unit according to the first embodiment of the present invention.

FIG. 12 is a diagram showing details of a search process using a character string index according to the first embodiment of the present invention.

FIG. 13 is a diagram showing a processing procedure of a structure matching unit according to the first embodiment of the present invention.

FIG. 14 is a diagram showing details of a structure matching process according to the first embodiment of the present invention.

FIG. 15 is a diagram showing an example of a tree structure to which a node group is added according to the first embodiment of the present invention.

FIG. 16 is a configuration diagram of a structured document management device according to a second embodiment of the present invention.

FIG. 17 is a diagram showing a processing procedure of a structural condition analysis unit according to the second embodiment of the present invention.

FIG. 18 shows a path name ID according to the second embodiment of the present invention.
Diagram showing an example of a collation table

FIG. 19 is a diagram showing a processing procedure of a structure matching unit according to the second embodiment of the present invention.

FIG. 20 is a diagram showing details of a structure matching process according to the second embodiment of the present invention.

FIG. 21 is a diagram illustrating a processing procedure for specifying a node corresponding to a search range when an intermediate node is specified by the structure matching unit according to the second embodiment of the present invention;

FIG. 22 illustrates a path hierarchy ID according to the second embodiment of the present invention.
Diagram showing an example of a collation table

FIG. 23 is a diagram showing a processing procedure of a character string index creation unit according to the third embodiment of the present invention.

FIG. 24 is a diagram showing an example of an extended character string index according to the third embodiment of the present invention.

FIG. 25 is a configuration diagram of a structured document management device according to a fourth embodiment of the present invention.

FIG. 26 is a diagram showing an example of a structured document according to the fourth embodiment of the present invention.

FIG. 27 is a diagram showing a processing procedure of a numerical index creation unit according to the fourth embodiment of the present invention.

FIG. 28 is a diagram showing an example of a numerical index according to the fourth embodiment of the present invention.

FIG. 29 is a configuration diagram of a structured document management device according to a fifth embodiment of the present invention.

FIG. 30 is a diagram showing a processing procedure of a character string search unit according to the fifth embodiment of the present invention.

FIG. 31 is a diagram showing an example of an element management table according to the fifth embodiment of the present invention.

FIG. 32 is a diagram showing an example of an element management table according to the fifth embodiment of the present invention.

FIG. 33 is a diagram showing a configuration of a document registration system according to a conventional technique.

FIG. 34 is a diagram showing a process of generating a structure index in a conventional technique.

FIG. 35 is a diagram showing an example of a character string index in a conventional technique.

FIG. 36 is a diagram showing a method of updating a structure index in the related art.

[Explanation of symbols]

 101 Terminal 102 Structured Document Input Unit 103 Search Condition Input Unit 104 Result Display Unit 105 Search Engine 106 Data Storage Unit 107 Structure Analysis Unit 108 Structure Information Creation Unit 109 Character String Index Creation Unit 110 Search condition analysis means 111 Character string index search means 112 Structure comparison means 113 Result creation means 114 Structure analyzed data storage means 115 Element management table storage means 116 Path name index storage means 117 Path hierarchy index storage means 118 ... Name ID table storage means 119 ... Character string index storage means 120 ... Substantial data storage means 121 ... List data storage means 1601 ... Path name ID collation table storage means 1602 ... Path hierarchy ID collation table storage means 2401 ... Numeric index creation Means 2402 Numeric index search unit 2403 ... numeric setting storing unit 2404 ... numeric index storage unit 3001 ... structured document registration unit 3002 ... string index creation unit 3003 ... string searching unit 3004 ... result display unit

 ──────────────────────────────────────────────────の Continuing on the front page (72) Inventor Ken Tsurubayashi 1006 Kadoma Kadoma, Osaka Prefecture Matsushita Electric Industrial Co., Ltd. (72) Inventor Shinichi Nakai 1006 Kazuma Kadoma, Kadoma-shi, Osaka Matsushita Electric Industrial Co., Ltd. F-term (reference) 5B075 ND35 NK43

Claims (26)

[Claims] In a document management apparatus for handling a structured document, a structured document input means for inputting a structured document, a structured document fetched by the structured document input means is analyzed, and a tree of the structured document is analyzed. Structural analysis means for generating a structure;
In the structured document expressed in the tree structure by the structure analysis means, a search unit identifier for identifying each element entity, an element entity position identifier expressing the position of each element entity in the tree structure, and the search unit identifier A structure information creating means for creating an element management table in which the element entity position identifier associated with at least the search unit identifier is specified to identify the element entity position identifier; and a character string index for performing a character string search Character string index creation means for creating a search condition, search condition input means for inputting a search condition, search condition analysis means for specifying the element entity position identifier corresponding to the search condition input by the search condition input means, Using the character string index created by the character string index creation means, the search unit identifier of each element entity having a character string corresponding to the search condition is identified. Character string index searching means, and a corresponding element entity position identifier is obtained by referring to the element management table based on the search unit identifier specified by the character string index searching means, and the element entity position identifier and the search condition analysis are performed. A structured document management device comprising a structure matching unit for extracting only a search unit identifier that matches the element entity position identifier obtained by the unit. 2. A structured document input device for inputting a structured document, a structured document input device for inputting the structured document, and analyzing the structured document fetched by the structured document input device to obtain a tree of the structured document. Structural analysis means for generating a structure;
In the structured document expressed in a tree structure by the structure analysis means, the search unit identifier for identifying each element entity and the path name ID for identifying a path name in which tag names leading to each element entity are arranged in a hierarchical order are the same. A path layer ID for identifying a path layer in which the appearance order of tags having the same name and the same name in the same layer is linked in a layer order, and the path name ID and the path layer ID are specified from the search unit identifier. A structure information creating unit that creates an element management table in which the path name ID and the path hierarchy ID related to at least the search unit identifier are associated, and a character that creates a character string index for performing a character string search. Column index creation means,
Search condition input means for inputting a search condition, search condition analysis means for identifying at least one of the path name ID and the path hierarchy ID corresponding to the search condition input by the search condition input means, A character string index search means for specifying the search unit identifier of each element entity having a character string corresponding to a search condition using a character string index created by the character string index creation means; and a character string index search means. A corresponding path name ID or path hierarchy ID is obtained by referring to the element management table based on the specified search unit identifier,
A structured document management device comprising a structure collation unit that extracts only a search unit identifier in which the path name ID or the path hierarchy ID matches the path name ID or the path hierarchy ID obtained by the search condition analysis unit. 3. A structured document management apparatus for handling a structured document, comprising: a structured document input unit for inputting a structured document; analyzing the structured document fetched by the structured document input unit; Structure analysis means for generating a tree structure, a name ID for identifying a tag name from the tree structure generated by the structure analysis means, a search unit identifier for identifying each element entity, and the name ID from the search unit identifier. Structure information creating means for creating an element management table in which at least the name ID related to the search unit identifier is associated, and a character string index for creating a character string index for performing a character string search Means, search condition input means for inputting search conditions, search condition analysis means for specifying the name ID corresponding to the search conditions input by the search condition input means, A character string index search means for specifying the search unit identifier of each element entity having a character string corresponding to a search condition using a character string index created by the character string index creation means; and a character string index search means. Structural collation for obtaining a corresponding name ID by referring to the element management table based on the specified search unit identifier and extracting only a search unit identifier in which the name ID matches the name ID obtained by the search condition analysis means. Structured document management device provided with means. 4. It has a result creation means for creating a character string search result list and data for displaying each element entity, and a result display means for displaying a search result created by the result creation means on a terminal. 4. The structured document management device according to claim 1, wherein: 5. A structured document input means for inputting a structured document, a structure analyzing means for analyzing the structured document fetched by the structured document input means and generating a tree structure of the structured document, In a structured document expressed in a tree structure by the structural analysis means, the same search unit identifier as a search unit identifier for identifying each element entity and the same path name ID for identifying a path name in which tag names leading to each element entity are arranged in a hierarchical order. A path hierarchy ID for identifying a path hierarchy in which the appearance order of tags having the same name and having the same name in the same hierarchy is arranged in the hierarchy, and the path name ID and the path hierarchy I from the search unit identifier.
A structured document registration device comprising: a structure information creating unit that creates an element management table that associates at least the path name ID and the path hierarchy ID related to the search unit identifier to identify D. 6. When the tree structure of a structured document changes,
3. The structured document management apparatus according to claim 2, wherein an ID that needs to be changed is updated among the path name ID and the path hierarchy ID recorded in the element management table. 7. When the tree structure of a structured document changes,
6. The structured document registration device according to claim 5, wherein an ID that needs to be changed is updated among the path name ID and the path hierarchy ID recorded in the element management table. 8. A structured document input means for inputting a structured document, a structure analyzing means for analyzing the structured document fetched by the structured document input means and generating a tree structure of the structured document, A name ID for identifying a tag name from the tree structure generated by the structure analysis means, a search unit identifier for identifying each element entity, and the name I based on the search unit identifier
A structured document registration device comprising: a structure information creating unit that creates an element management table in which at least the name ID related to the search unit identifier is associated to identify D. 9. An index creation of a structured document including an element entity (child element) further surrounded by a tag inside each element entity, wherein a character string extracted with a predetermined number of characters from each element entity straddles the tag. Obtains a unique search unit identifier for identifying the child element, retrieves the character string, a search unit identifier for identifying an element entity to which each character of the character string belongs, and the character in the element entity from which the tag is removed. A character string index creation device for generating a search character string index including a character position identifier indicating a column position. 10. In creating an index of a structured document including a character string surrounded by a tag that is defined in advance as a numerical value, a unique search unit identifier for identifying the character string surrounded by the tag is obtained. And a numerical index creating means for converting a character string surrounded by the tag into numerical data and creating a numerical index in which the search unit identifier and the numerical data are associated with each other. The character string index creation device according to claim 9. 11. When searching for a character string corresponding to a predetermined condition, a name ID for identifying a tag name, a path name ID for identifying a path name in which tag names leading to each element entity are arranged in a hierarchical order, A path hierarchy ID for identifying a path hierarchy in which the appearance order of tags having the same parent node and the same name in the same hierarchy is arranged in the hierarchy, a search unit identifier for identifying each element entity, and the search unit identifier From the name I
In order to specify D, at least the element management table in which the name ID related to the search unit identifier is associated, or in order to specify the path name ID and the path hierarchy ID from the search unit identifier, at least the search The path name ID and the path hierarchy ID related to the unit identifier
A data storage unit that stores at least one of an element management table in which a search condition is associated, a search condition input unit that inputs a search condition, and a search condition corresponding to a search condition based on the search condition input by the search condition input unit. At least one of a name ID, the path name ID, and the path hierarchy ID
(ID1), a character string index search means for obtaining the search unit identifier having a character string corresponding to the search condition, and a search unit identifier specified by the character string index search means. With reference to the element management table, at least one of the corresponding name ID, path name ID, and path hierarchy ID (ID2) is obtained.
A character string search device comprising a structure matching means for extracting only a search unit identifier that matches with ID1 obtained by the search condition analysis means. 12. In a numerical range search of a structured document including a character string surrounded by a tag that is defined in advance as a numerical value, a unique search unit identifier for identifying the character string surrounded by the tag is provided. Numerical index search means for referring to a numerical index associated with numerical data obtained by converting a character string surrounded by the tags into numerical values and extracting the search unit identifier corresponding to a search condition, The character string search device according to claim 11, wherein 13. A method for registering a structured document represented by a tree structure, wherein a step of reading the structured document and a path name ID for identifying a path name in which tag names leading to each element entity are arranged in a hierarchical order are the same. A step of acquiring a path hierarchy ID for identifying a path hierarchy in which the appearance order of tags having the same name and having the same name in the same hierarchy is arranged in the hierarchy, and a step of determining whether or not the tag has an element entity; Obtaining a search unit identifier for identifying each element entity; and identifying the path name ID and the path hierarchy ID from the search unit identifier, at least the path name ID and the path hierarchy related to the search unit identifier. A portable medium storing a program having a step of creating an element management table associated with an ID. 14. A method for registering a structured document represented by a tree structure, a step of reading a structured document, a step of obtaining a name ID for identifying a tag name, and a step of determining whether or not an element entity is included. Acquiring a search unit identifier for identifying each element entity; and, in order to identify the name ID from the search unit identifier, an element management table in which at least the name ID related to the search unit identifier is associated. A portable medium storing a program having a step of creating. 15. A method for generating a character index of a structured document having an element entity (child element) further surrounded by tags inside the element entity, a step of reading structurally analyzed data, and a step of determining whether or not the element entity is included. Checking, and obtaining a search unit identifier for identifying an element entity; checking whether or not the child element is included; and obtaining a search unit identifier for identifying the child element, Extracting a character string in units of one or more predetermined characters from an element entity; obtaining a search unit identifier to which each character of the character string belongs; and searching for the search unit to which the character string and each character of the character string belong Generating a search string index having a character position identifier indicating the position of the character string within the element entity from which the identifier and the tag have been removed. A portable medium that stores programs. 16. A method for generating a numerical search index for a structured document, comprising: reading structurally analyzed data;
A step of determining whether or not the character string is enclosed by a tag that defines a numerical value in advance, and a search unit identifier for identifying the character string enclosed by the tag that is defined to be a numerical value , A step of converting the character string into a numerical value, and a step of generating a numerical index including the search unit identifier and the converted numerical value. 17. A method for retrieving a structured document, comprising: reading a search condition; and inputting a name ID for identifying a tag name corresponding to the search condition or a path name in which tag names leading to each element entity are arranged in a hierarchical order. At least one of a path name ID to be identified or a path hierarchy ID for identifying a path hierarchy in which the appearance order of tags having the same parent node and the same name in the same hierarchy is linked in the hierarchy order ID1), identifying a search unit identifier (hereinafter, ID2) for identifying each element entity having a character string corresponding to the search condition, and determining the name ID, the path name ID, Path hierarchy ID
To specify at least the name ID, the path name ID, and the element management table in which the path hierarchy ID is associated with the ID2, the name ID corresponding to the ID2, the path name ID, The path hierarchy I
A portable medium storing a program having a step of obtaining at least one ID of D (hereinafter, referred to as ID3) and a step of extracting only the search unit identifier in which the ID1 and the ID3 match. 18. A method for determining nodes included in a search range when an intermediate node or less is specified as a search range, wherein a path name for identifying a path name in which tag names leading to each element entity are arranged in a hierarchical order, or the same. The parent node and the tag with the same name appear in the same hierarchy in the same hierarchy and the path hierarchy is moved up by one hierarchy, and the node at the current position matches the specified intermediate node, or the search range has already been reached. Is determined to be included in the search range, if it is a node that meets any of the above conditions, it is determined that all the nodes that have been traced so far are included in the search range, the current position It is determined whether the node does not match the specified intermediate node or is a node that has already been determined to be out of the search range. The process of determining that all the nodes that have been traced are out of the search range is executed each time the user climbs one level from the lowest node, and the search range is specified by repeatedly executing the process up to the node of the highest layer. Method. 19. A general-purpose computer for managing a structured document, structured document input means for inputting the structured document,
In the structured document, which analyzes the structured document fetched by the structured document input means to generate a tree structure of the structured document, and in the structured document represented by the tree structure by the structure analyzing unit, each element entity is The search unit identifier for identification, the path name ID for identifying a path name in which tag names leading to each element entity are arranged in a hierarchical order, and the appearance order of tags having the same parent node and the same name in the same hierarchy A path hierarchy ID for identifying a path hierarchy connected in a hierarchical order, and the path name ID and the path hierarchy ID related to at least the search unit identifier for specifying the path name ID and the path hierarchy ID from the search unit identifier. Structure information creating means for creating an element management table in which character strings are associated, character string index creating means for creating a character string index for performing a character string search, and input of search conditions Search condition input means for performing, search condition analysis means for specifying at least one of the path name ID and the path hierarchy ID corresponding to the search condition input by the search condition input means, and the character string index creation Character string index search means for specifying the search unit identifier of each element entity having a character string corresponding to the search condition using the character string index created by the means, and the search unit identifier specified by the character string index search means The corresponding path name ID or path hierarchy ID is obtained by referring to the element management table based on the above, and the path name ID or the path hierarchy ID and the path name ID or the path hierarchy ID obtained by the search condition analysis means are obtained. A structured document management program for functioning as structure matching means for extracting only matching search unit identifiers. 20. A character string obtained by extracting a general-purpose computer with a predetermined number of characters from each element entity in order to create an index of a structured document including an element entity (child element) further surrounded by tags inside each element entity If the tag spans the tag, a unique search unit identifier for identifying the child element is obtained, and the character string, a search unit identifier for identifying an element entity to which each character of the character string belongs, and the element from which the tag is removed A character index creation program for functioning as a character string index creation means for creating a search character string index comprising a character position identifier indicating the position of the character string in the entity. 21. A general-purpose computer for creating an index of a structured document including a character string surrounded by a tag which defines in advance that the character string is a numeric value. Of the search unit identifier, converts the character string enclosed by the tag into numerical data, and functions as a numerical index creating means for creating a numerical index in which the search unit identifier is associated with the numerical data. String indexing program for 22. A program for specifying nodes included in a search range when data below a predetermined node is designated as a search range in data expressed by a tree structure, and determining whether each node is included in the search range. A first step of initializing a collation table storing a collation flag indicating whether or not the referenced node is within the search range or undecided, based on the collation table If the second step determines that the node is within the search range, the third step of setting a matching flag indicating the inside of the search range for the referencing node in the matching table, and the third step determines that the node is outside the search range. In the case where the fourth step and the second step of setting a collation flag indicating that the node being referred to is outside the search range in the collation table are determined to be undecided. Therefore, if the node referred to further matches the specified node or is already within the search range, a collation flag indicating within the search range is set in the collation table for all the nodes that have been reached so far. If it is determined in the fifth step and the second step that it is undecided, and if the referencing node is already out of the search range, the matching flag indicating the out of range is checked for all the nodes that have been reached so far. If none of the sixth step, fifth step or sixth step set in the table applies, the seventh step goes up one layer from the node currently being referred to, If the ascending node is the root node, a collation flag indicating out of the search range is set in the collation table for all the nodes that have been traced so far. The search range is specified by comprising an eighth step and an eighth step of returning to the fifth step if the node up one hierarchy in the seventh step is other than the root node. Program to do. 23. An apparatus for managing a structured document represented by a tree structure, comprising: structure information creating means for assigning a search unit identifier for identifying an element entity; and specifying an element entity separately from the search unit identifier. Means for storing a path hierarchy in which the appearance order of tags having the same parent node and the same name in the tree structure is linked by hierarchy, and a path name in which the tag names are linked by hierarchy in the tree structure. Means for storing an element management table for associating the path hierarchy and path name with the search unit identifier, and a character for extracting a search unit identifier of an element entity including a character string of a search condition A column index search means,
A structured matching means for referring to the element management table from the search unit identifier extracted by the character string index search means and searching for a document satisfying a path hierarchy or a path name specified as a search condition; . 24. A data management apparatus for managing data having a data structure that can be expressed by a tree structure, wherein the identification of a substance element of the data includes a tag having the same parent node and the same name in the tree structure. A data management device characterized by using a means for storing a path hierarchy in which the appearance order of each is linked by hierarchy. 25. The apparatus further comprises means for storing a path name in which tag names of data expressed in a tree structure are linked by hierarchy.
25. The data management apparatus according to claim 24, wherein a means for storing the path hierarchy and a means for storing the path name are used to uniquely specify a substantial element of the data in the tree structure. 26. The data management device according to claim 25, wherein, when there are a plurality of entity elements having the same parent node and the same tag name, the path name is expressed the same.