JPS63238622A - Relation retrieval system - Google Patents

Abstract

PURPOSE:To execute a many-version retrieval on a different data value and a data whose attribute is different, etc., by executing an information retrieval related to a key word, by a related key word which has been related and set in advance in accordance with the key word. CONSTITUTION:By a related key word which is read out of a related file 3 by designating a key word, and also, is related and set in advance in accordance with its key word, an information retrieval related to its key word is executed. Accordingly, without providing a common term, the key word can be related irrespective of an item and an attribute, and a many-version retrieval can be executed on different data value and a data whose attribute is different, etc.

Description

TECHNICAL FIELD The present invention relates to a related search method, and more particularly to a related search method for an information processing apparatus that searches for data related to a keyword by specifying the keyword.

Prior Art Conventionally, this type of r! In the A-linked search method, there are linked relationships between items that are logically created on the data, so it is important to check whether the keyword item and the associated item have the same logical structure, or , they had to have at least the same attributes (such as numeric items and Japanese language items).

Therefore, in the related search itself, only those items where the keyword value for the related search matches the data value of the associated item can be searched.

In such conventional related search methods, related relationships are defined between items that are logically created on the data, so the keyword item and the associated item have the same logical structure. This has the disadvantage that it is necessary to provide a common item because it is not possible to define an association between items with different attributes, or at least have the same attributes. In addition, since only data with matching data values can be searched, there is a drawback that it is not possible to perform multifaceted searches such as data with different data values or data with different attributes.

■First look The present invention was made in order to eliminate the drawbacks of the conventional ones as described above. The purpose is to provide a related search method that can perform multifaceted searches such as data with different objects and attributes.

1. A related search method according to the present invention is a related search method for an information processing device that searches for information by specifying a keyword, and includes:
A related keyword storage means for storing a related keyword set in advance in association with the keyword is provided, the related keyword is read from the related keyword storage means according to the specification of the keyword, and the information search is performed using the related keyword. It is characterized by the fact that it is made to do.

K disaster 1 Next, an embodiment of the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention. In the figure, one embodiment of the present invention includes an input unit 1 that specifies keywords to be searched and related searches, an information search system 2, and relationships 1 and 1 between the keywords. A related file 3 in which relationships are registered, a database 4 in which data to be searched is stored, a search result file 5 in which related search results are temporarily stored, and a search result output unit 6 that outputs the search results. It is made up of.

In addition, when a related search is specified, the information search system 2 searches and reads related relationships corresponding to the specified keyword from the related file 3, and provides a related relationship input control that generates a search condition expression for the related search. Part 21 and I! An information search unit 22 searches the database 4 according to the search condition expression generated by the 1M relationship input control unit 21, and temporarily stores the search results of the related search in the search result file 5, and re-executes the search result file 5 if necessary. The search result control section 23 extracts search results.

Now, when the information search system specifies a related search and inputs a keyword for a related search from the input section 1,
The related relationship input control unit 21 of the information search system 2 stores related relationships related to the input keyword in a related file 3.
If the l111m person related to this keyword is registered in the vAM file 3, the related relationship is read out and analyzed, a search condition expression for the related search is generated, and the search condition is sent to the information search unit 22. Send.

The information search section 22 searches the database 4 using the sent search condition expression for the related search, and sends the search results to the search result control section 23 . The search result control unit 23 temporarily stores the sent search results in the search result file 5 and at the same time sends the search results to the search result output unit 6.

For example, assume that the related relationship “CaO”□“NEC” “NEC”□“Computer” is defined in the related file 3, and a related search is performed using “C&C”.

First of all, as a first step, "C&C" and III"I!L
A search is performed using the tagged "NEC", and data with the item value "NEC" is retrieved. Then, if the related search is to proceed further, in the second step, a search is performed using "computer" associated with "NEC", and data whose item value is "computer" is retrieved.

Next, in the third step, when searching for related keywords associated with "computer", "ACO8" and "IT OS" are associated with "computer", so "'A COS" is found. ” and “I
A search for "ACO8" or "ITO8" is performed by specifying either "TO8".

During this time, all search results are 413111 part 23
Since the search results are stored in file 5, the third
Transition from a stage to a second stage, or from a second stage to a first stage, can be performed without re-searching.

In this way, information associated with the keyword is searched using the related keyword that is read from the related file 3 by specifying the keyword and is associated with the keyword in advance. Since associations can be defined for each piece of data, associations can be defined without being limited to items or attributes.

Furthermore, since it can be defined regardless of whether the data values match or do not match, there is no need for the 130M tag to be a common item. Furthermore, by performing a one-to-n association, it is possible to perform n types of related searches for one data, and as long as the association is established, related searches can be performed at any number of stages. You can perform multifaceted searches such as data values and data with different attributes. At the same time, since the search results can be held in the search result file 5, it is possible to easily return to the related search at the previous stage.

DETAILED DESCRIPTION OF THE INVENTION According to the present invention, as described in detail, 1!1 is read from the related keyword storage means by specifying a keyword, and is set in advance in association with the keyword.
By using linked keywords to search for information associated with keywords, it is possible to associate items without having to set common items and without being tied to items or attributes. This has the effect of allowing you to perform multifaceted searches such as.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention. Explanation of symbols of main parts

Claims (1)

[Claims] A related search method for an information processing device that performs information retrieval by specifying a keyword, the related keyword storage means for storing related keywords set in advance in association with the keyword; A related search method characterized in that the related keywords are read from a related keyword storage means and the information search is performed using the related keywords.