JPS6148035A - Information retrieval system and storage medium used therefor - Google Patents

Abstract

PURPOSE:To enhance a retrieval efficiency by storing different dictionaries for retrieval every operator or every sorting format of an object to be retrieved to each of a pair of interchangeable storage mediums, and selecting these storage mediums during a retrieval and using it as a retrieval dictionary. CONSTITUTION:In case of retrieving an object, at first, an operator imputs a command meaning ''retrieval'' and a retrieval condition (logical expression) from an operating section 1. Receiving it, an operating section 2, based upon the retrieval condition, searches sequentially key work index numbers 8.2.2.1, 8.2.2.2 of a key word index number group storing section 8.2.2 in a retrieval object key word coordinating table 8.2 and discriminate whether an retrieval object ID satisfying the retrieval condition exists or not. Herein, when the operator confirms the contents of the retrieval object specified by a retrieval object number, a data of the retrieval object is outputted on a retrieval object display section 7 to display.

Description

[Detailed Description of the Invention] [Technical Field of the Invention] The present invention provides keywords specified by an operator (hereinafter referred to as registered keywords) and keywords that are entered in a search dictionary corresponding to the search target. An information search method J5 that compares keywords (hereinafter referred to as registered keywords) according to a predetermined logical formula and searches for a search target that matches the registered keyword such that the registered keyword equal to the input keyword does not satisfy the predetermined logical formula; Regarding the storage medium used.

[Technical background of the invention and its problems j Conventionally, when searching for objects such as expenditures and drawings, information for determining the FI of the search object 1.2.3, as shown in FIG. . . . Ω$, ★Gee words A, B, C1, . . . corresponding to each search target by 3.1 are captured.

this'! With AFMI, for example, when performing a search for a logical expression that has the keyword D and ``has'', a pattern of keywords that satisfies the above logical expression as shown in Figure 4 is entered in the search dictionary. The information that identifies the relevant search target is extracted by comparing with the registered keywords.

Generally, when the same search target group is classified using different classification styles, different keywords are associated with the same parsimony pair ℃ depending on the classification style.

For example, when S exists as a search target, S is viewed from the viewpoint IJ
If you classify from , keywords A and B will be associated, but
When S is classified from viewpoint Q, keywords C and D are often associated with each other.

Furthermore, even if the person who created the search n8 belongs to a different field, different keywords are associated with the same search target.

For example, when search dictionary creator There are many cases.

However, conventional information retrieval methods have the following limitations.

First, since the capacity of a search dictionary is limited, the number of registered keywords associated with each search target must be kept as small as possible.

Second, since the search term 8 is fixedly provided within the search device, registered keywords that correspond to the same search target must be uniformly limited.

As described above, in conventional information retrieval systems, it is difficult to create a search dictionary for each classification style or for each search dictionary creator.

Therefore, when searching, it is necessary to search and repeat according to standard registered keywords set for each search target, and each operator searches for each search target according to the search purpose. On the other hand, if the assumed keyword is different from the registered keyword actually written in the search dictionary, there is a problem in that the efficiency of the search is significantly reduced.

Additionally, although it is generally physically possible to change the contents of a search dictionary, there is a problem in that changes to the contents are considerably restricted in order to avoid confusion during operation.

It is conceivable to equip the search device with multiple search dictionaries that differ depending on the search purpose, but this would require a large storage capacity, which would significantly increase the cost of the device. In addition, as the search dictionary becomes larger, the search range at the time of search also expands, causing the problem that the search time increases.

[Purpose of the Invention] The present invention has been made to solve the problems of the conventional information retrieval methods as described above, and it is possible to achieve the most efficient method for each retrieval purpose without increasing the storage capacity of the retrieval device. The purpose of this paper is to promote an information retrieval method that allows searching and a storage medium for use in this method.

[Summary of the Invention] That is, the present invention compares an input keyword specified by an operator with a registered keyword written in a search dictionary corresponding to the search target according to a predetermined logical formula, and compares the input keyword with the input keyword. In an information retrieval method for searching for the search targets in which equal registered keywords do not satisfy the predetermined logical formula, a plurality of search dictionaries are created in which the search targets and registered keywords are associated from different viewpoints. , an information retrieval method characterized in that each of the retrieval dictionaries is stored in a plurality of exchangeable storage media, and the comparison is performed by selecting one of these memories according to the purpose of the search, and a storage means. A memory used in the information retrieval method, characterized in that the memory means is configured such that a search dictionary consisting of information specifying each of the search targets and a registered keyword corresponding to this information is used. It consists of a medium.

[Embodiments of the Invention] Details of the present invention will be described below based on embodiments shown in the drawings.

FIG. 1 is a block diagram, not showing the configuration, of a search device to which the present invention is applied, as an embodiment of the present invention.

In the same figure, reference numeral 1 denotes an operation unit which has an input means such as a keyboard operated by an operator and outputs a signal according to the operation;
Reference numeral 2 denotes a processing unit that processes each signal sent to a search, 3 a temporary search dictionary storage unit to be described later, and 4 a data input unit that reads and stores information from and to an exchangeable storage medium M, which will be described later. 5 is a search information display unit such as a CRT display device 2 for displaying search results; 6 is a search target data storage unit such as a magnetic disk, optical disk, or microfiche that stores the search target itself; 7 is a search target data storage unit such as a magnetic disk, an optical disk, or a microfiche; A search target display unit such as a CRT display device that displays search targets is shown.

FIG. 2 is a diagram conceptually showing the contents of the search dictionary written in the storage medium M.

This search article B8 is composed of a keyword catalog 8.1 and a search target keyword correspondence table 8.2.

Furthermore, the keyword catalog 8.1 has a keyword index Wj@storage 8Is (in the figure, number 1 storage section L1.
1 and a keyword storage section 8.1.2, and the keyword index number storage section 8,1.1 has a keyword index number 8.1.1.1.8.1.2.2.
, . . . are stored in the keyword storage units 8, 1 .
2 has registered keywords 8, 1, 2.1.8.1, 2.2 specified by these keyword index numbers,
... is stored.

On the other hand, the search target keyword correspondence table 8.2 shows the search target [D
A number storage section 8.2.1 and a keyword index number group storage section 8.2.2 corresponding thereto (b are formed,
Furthermore, keyword index number group storage section 8.2.2
is the keyword index number storage section 8.2.2.1.
8.2.2,2,...

The search target ID number storage section 8.2.1 contains IOM@8.2.1.1.8. corresponding to each search target.
2.1.2, . . . are stored in the keyword index number storage section 8.2.2.1.8, 2.2, 2, .
Each has a keyword index number 8.2.2
．． 1.1.8.2.2.1.2, 8.2
．． 2, 2, 1.8, 2.2.2, 2, . . . are stored.

Next, the operation of the above-mentioned search device will be explained.

Furthermore, II! IJ's works include "Start", "Create a search dictionary,"
The cases of "Change", "Search J" and "End" will be explained separately.

(1) In the case of starting, the operator first hits the storage medium M in which the search 7.9 pattern 18 is stored at a predetermined position on the data person output unit 4. When the first author inputs a command meaning [Start J'2] from the operation unit 1, the processing unit 2 decodes this command and instructs the data input/output unit 4 to read the search article @8 in the storage medium M. Instruct. As a result, the search dictionary 8 in the storage medium M is written into the search dictionary temporary storage section 3.

(2) When creating or changing a search dictionary When adding registered keywords, the operator must
The command that means "add registered keyword" from
Enter the character string that will be the registered keyword itself. Processing section 2
decodes this command J3 and the character string, and then registers the keyword storage sections 8 and 1.2 of the keyword catalog 8.1 in the search dictionary 8 fixed in section 3. Keyword 8.1.2.1.8.1.2,2. ,・
... and the input character string to check whether the input keyword input by the operator overlaps with an already stored registered keyword. If there are duplicates, a message is displayed on the search information display section 5 informing the operator that the input keyword is already a stored keyword.

If the keywords are not duplicated, the processing unit 2 writes the keyword index number in the keyword index number storage section 8, 1.1 of the keyword catalog 8, 1, and stores the keyword index number in the keyword storage section 8, 1.1. ? ', 2, write the input character string, that is, the input keyword.

Note that the keyword index number is a code number corresponding to each registered keyword.

When adding a search target, the operator first inputs a command meaning "add search target" from the operation panel 1, ID number J3 that specifies the search target, and keywords corresponding to the search target as many times as necessary. do.

The processing unit 2 decodes this command and creates a search target keyword correspondence table 8. of the search dictionary 8 in the search dictionary temporary storage unit 3.
The search target ID number storage section 8.2.1 of 2 is sequentially searched,
IDfi where the input ID number is already stored
Check whether it is a duplicate of the number. If there is a duplicate, a message is displayed on the search information display section 5 informing the operator that the input ID number has already been stored.

Next, the processing unit 2 sequentially searches the keyword storage units 8 and 1.2 in the keyword catalog 8.1 to determine whether all the keywords input by the operator exist among the stored registered keywords. confirm. If the keyword entered here does not exist among the registered keywords, a message will be displayed on the search information display section 5 informing the operator that the specified keyword does not exist among the registered keywords.
to be displayed.

If the input keyword exists in the registered keywords, the processing unit 2 writes the input ID number into the free space of the search target IO number storage section 8.2.1 in the search target keyword correspondence table 8.2. keyword index number storage units 8.2.2, 1.8.2.2.2, . . .
・Write the keyword index number corresponding to the dented keyword in the empty area.

Note that the keyword index number storage section 8.2, 2.
1.8.2.2.2, . . . are filled with keyword index numbers as many as the number specified by the operator, so the keyword index number storage units 8.2, 2.1
．． The other storage areas of 8.2.2.2, . . . become empty.

Next, a case will be described in which the correspondence between search targets and registered keywords in the search dictionary 8 is changed.

The types of changes include adding, deleting keywords,
Although there are replacements, etc., deletion will be explained here as a representative case. In this case, the operator first inputs a command meaning "delete keyword" from the operation unit 1, the ID number of the target whose keyword is to be deleted, and the character string of the keyword to be deleted.

Then, the processing unit 2 decodes the command from the operation unit 1 and reads the search target IO number storage unit 8.2.
1 is sequentially searched and a search target ID number that matches the ID number input by the operator is extracted.

Here, if there is no matching search target ID number, the processing unit 2 searches for a message informing the operator that there is no search target stored that matches the input search target ID number. The information is displayed on the information display section 5.

Furthermore, the processing unit 2 sequentially searches the keyword storage unit 8.1.2 in the keyword catalog 8.1, finds a registered keyword that matches the character string of the keyword that the operator wants to delete, and searches the corresponding keyword index. The keyword index number stored in the number storage section 8, 1.1 is extracted. If there is no matching registered keyword, the processing section 2 causes the search information display section 5 to display a message informing the operator that the inputted keyword to be deleted is not stored.

If there is a registered keyword that matches the input character string, the processing unit 2 searches the search target ro number storage unit 8.2, 1, 1, L2.1.2 of the search target keyword correspondence table 8.2.
, . . . keyword index number group storage unit 8.2 corresponding to the previously specified search target ID number.
The keyword index number storage section of 2 is sequentially searched,
Find the keyword index number that matches the keyword index number extracted first. If it is not found, a message is displayed on the search information display section 5 informing the operator that the specified search target does not have the specified keyword. If a keyword index number that matches 1 is found, that keyword index number is deleted, and the keyword index numbers from the keyword index number next to the deleted keyword index number to the last keyword index number are rounded up.

(3) When searching for a target, first, the operator enters a command meaning "search" from the operation unit 1 and a search condition, for example, a logical expression such as "keywords A1B, or keywords A and D." Enter.

The processing unit 2 decodes this command and further sequentially searches the keyword catalogs 8 and 1 to find the keyword index number corresponding to the registered keyword that matches one or more input keywords included in the search conditions input by the operator. Extract. The processing unit 2 repeats this operation for all keywords input by the operator.

Further, based on the search conditions, the processing unit 2 searches the keyword index number storage unit 8 of the keyword index number @group storage unit 8.2.2 in the search target keyword correspondence table 8.2.
．． 2.2.1.8.2.2.2,... are sequentially searched,
This determines whether there is a search target ID number that satisfies the search conditions specified by the operator.

If a corresponding ID number with search pair f exists, the search target ID numbers are sequentially extracted and displayed on the search information display section 5.

Here, if the operator wishes to confirm the content of the search target specified by the extracted search target ID number, from the operation unit 1, issue a command meaning "if confirmation of search target content" and the corresponding When the search target ID number is input, the processing unit 2 outputs the search target ID number to the search target data storage unit 6, and the search target data storage unit 6 performs the search corresponding to the specified search target ■D number. The target data is output to the search target display section 7 and displayed.

(4) When terminating the operation, the operator inputs a command meaning "end" from the operation unit 1.

Then, the processing unit 2 decodes this command and writes the search dictionary 8 in the search dictionary storage unit 3 to the storage medium M via the data input/output unit 4.

Thereby, when the operator changes the search dictionary as described above during the search execution, the changed contents are reflected on the storage medium M.

However, according to the information retrieval method of this embodiment, since the retrieval dictionary is written in the replaceable storage medium M, the retrieval dictionary J)
can be created for each operator (search - dictionary creator) or for each classification style of the search target. In addition, storage medium M
Although existing storage media such as floppy disks and memory packs can be considered, the most suitable is the recently developed IC card. An IC card has a CPU chip and a memory chip mounted inside a plate-shaped body made of resin such as vinyl chloride, and is equipped with terminals for external connections. It is. I like this
Use C cards to store search dictionaries for each operator or search target classification (and expressions).
The method of the present invention can be realized by setting υ and selecting the most suitable one at the time of search.

Note that in the above embodiment, each keyword is associated with an index number, and a keyword search is performed using this keyword index number, but this is for the purpose of improving search efficiency and is not an essential requirement.

Further, in the above embodiment, the search information display section 5 and the search target display section 7 are provided independently, but both display sections are unified so that the respective display contents are displayed on one display section. may be configured.

[Effects of the Invention] As explained above, in the information retrieval method of the present invention, each of a set of exchangeable storage media can be used to perform different searches depending on the operator (search dictionary creator) or the classification format of the search target. Since the search dictionary is stored and the search dictionary is used by selecting one of these storage media at the time of search, the most efficient search can be performed for each search purpose without increasing the storage capacity of the search device. I can do it.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of an embodiment of a search device to which the information search method of the present invention is applied, and FIG. 2 is a diagram showing the contents of a search dictionary incorporated into the storage medium of the present invention. , 3rd
4 and 4 are diagrams showing a conventional information retrieval method. 1.........Operation section 2......Process I11!81S3...
......Search IY' C:: i"f notation 10 part 4......Data input/output part 5.
......Search information display section 6...
...Search target data storage section 7...
...Search target display section 8...Search dictionary M...Storage media agent Patent attorney Sasu Suyama - Figure 1

Claims (5)

[Claims] (1) The input keyword specified by the operator is compared with the registered keyword written in the search dictionary corresponding to the search target according to a predetermined logical formula, and the registered keyword that is equal to the input keyword is In an information retrieval method that searches for the search target that corresponds to satisfy a predetermined logical formula, a plurality of search dictionaries are created in which the search target and registered keywords are associated from different viewpoints, and each search dictionary is An information retrieval method characterized in that the information is stored in a plurality of exchangeable storage media, and the comparison is performed by selecting these storage media according to a search purpose. (2) The information search method according to claim 1, wherein the association between search targets and registered keywords is performed for each search dictionary creator. (3) The first claim in which the search target and the registered keyword are associated according to the classification format of the search target.
Information retrieval method described in section. (4) A storage medium characterized in that it has a storage means, and a search dictionary consisting of information specifying each search target and a registered keyword corresponding to this information is written in the storage means. (5) The storage medium according to claim 4, which is an IC card having an integrated circuit chip for storing information mounted inside a resin plate-like body and provided with external connection terminals.