JP2008003721A - Information retrieval system, information retrieval method, program, and recording medium - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a mechanism which increases the possibility that a user can obtain a retrieval expression to obtain a desired retrieval result without reconsidering retrieval expressions. <P>SOLUTION: A retrieval result list display part 102 acquires a retrieval result based on a first retrieval expression input from a retrieval keyword input part 101, and an operation-based weight setting part 103 causes an operation history file 110 to hold a user operation with respect to the retrieval result of the first retrieval expression, and a keyword combination generation part 104 removes words from the first retrieval expression one by one to generate second retrieval expressions having no duplicate combinations, and a weight calculation processing part 105 acquires retrieval results of respective second retrieval expressions, and degrees of importance of respective second retrieval expressions are calculated and evaluated respectively on the basis of the stored user operation and the retrieval results of respective second retrieval expressions. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to an information search system, an information search method, a program, and a recording medium that perform a search process on information stored in a storage medium using a search expression.

  When a user performs an information search, it can be said that it is difficult to create an optimal search expression and obtain a result that matches the purpose. Therefore, the user creates a new search expression several times and repeats the search until a search result suitable for the purpose is obtained.

  In Patent Document 1, a search history of a search expression manually entered by a user is stored, and the conformity / nonconformity rate of a search result is calculated as a conformance rate based on a conformance button set by the user. A method for referring to a simple search has been proposed.

  Note that there may be a case where there is no corresponding data because the search formula input by the user is not appropriate. In this case, the user needs to correct the search expression.

  Therefore, in Patent Document 2, when the number of search results is intended or falls below a lower limit value, a method is proposed that can automatically relax the search formula so as to exceed the lower limit value.

Specifically, for a search expression that falls below a certain lower limit value, a search expression set excluding an arbitrary word is generated, and a search expression in which the search terms of each search expression are connected by "AND" is generated. . Further, the search expressions are connected by “OR” and searched again to generate a search result. If this is used, the search results can be increased step by step by gradually relaxing the search formula.
JP 10-055369 A Japanese Patent Laid-Open No. 11-161659

  However, in the method described in Patent Document 1, in order to find an optimal search expression, the user himself has to create and input a plurality of search expressions. Furthermore, the user himself / herself has to determine whether the search result is appropriate or not, and the burden on the user when searching is not greatly reduced. Moreover, since there was only choice of conformity / non-conformity, step-by-step detailed evaluation could not be performed.

  In Patent Document 2, if the keyword group included in the search formula is a keyword group appropriate for obtaining the search result requested by the user, the search result is increased step by step as described in Patent Document 2. Therefore, it is effective for obtaining a search result desired by the user.

  However, since the search expression set excluding any one word is further combined by "OR" and the result is output, it is not possible to know which keyword has narrowed the search result too much, and a new search for the user There is a disadvantage that it cannot be used as a reference.

  The present invention has been made to solve the above-described problems, and an object of the present invention is to obtain a search expression that allows a user to obtain a search result that the user desires without re-thinking the search expression. It is to provide a mechanism to improve the possibility.

  The present invention relates to an information search system for performing a search process on information stored in a storage medium using a search formula, an input means for inputting a first search formula composed of a plurality of keywords, and the first A first acquisition unit that acquires a search result based on the search formula, an operation history storage unit that holds a user operation for the search result acquired by the first acquisition unit, and one keyword from the first search formula A creation unit that creates a plurality of second search formulas that do not overlap each other, a second acquisition unit that acquires each search result based on each second search formula, and an operation history storage unit that holds the second search formulas Weight calculating means for calculating the importance of each second search expression based on the user operation performed and each search result acquired by the second acquisition means.

  According to the present invention, as in the prior art, weights are added step by step according to the importance of the user's operation without evaluating the search result consciously by the user, and the search expression is evaluated. It is possible to perform detailed and realistic evaluation of the search formula and natural evaluation that the user is not conscious of. For this reason, it is possible to determine an accurate search formula for the user.

  Furthermore, in the present invention, since the number of keywords is reduced one by one and the search expression is automatically generated by the keyword combination so that the combinations do not overlap, the user only has to input the search keyword once. Therefore, the burden on the user is reduced, the number of searches can be gradually increased, and search omissions can be reduced.

  In addition, when the user enters a misplaced word, the word can be found by the difference in the weight of the displayed search results. As a result, the user's search formula creation skill is improved and the user searches for a document. There are effects such as shortening the labor.

  Therefore, there is an effect that the user can improve the possibility of obtaining a search expression that can obtain the search result that the user wants without re-thinking the search expression.

[First Embodiment]
FIG. 1 is a block diagram showing an example of the configuration of the information search system of the present invention.

  In FIG. 1, reference numeral 10 denotes a client device (hereinafter referred to as a client), which is realized by an information processing device such as a personal computer. The client 10 is communicably connected to a database holding server (hereinafter referred to as a server) via a communication medium such as a network.

  In the client 10, reference numeral 1 denotes a CPU, which realizes various functions by executing a client program stored in a ROM or a hard disk (not shown) on the RAM 3.

  Reference numeral 2 denotes a display, which displays and outputs various information under the control of the CPU 1. Reference numeral 5 denotes an input device, for example, a keyboard, a pointing device such as a mouse, and the like, which can input various information.

  A network interface card (NIC) 6 controls communication with the network.

  Similarly to the client, the server 20 includes a CPU, a ROM, a RAM, a hard disk, a NIC, and the like. When the CPU executes a server program stored in the hard disk on the RAM, various services (searches described later) are performed. Service).

  FIG. 2 is a block diagram illustrating an example of a functional configuration of the information search system illustrated in FIG.

  The search keyword input unit 101, search result list display unit 102, operation-specific weight setting unit 103, keyword combination creation unit 104, weight calculation processing unit 105, hit order weight setting unit 106, and post-combination keyword display unit 107 shown in FIG. This is a function realized by the CPU 1 of the client 10 executing the client program stored in the hard disk 4 on the RAM 3. The client program may be downloaded from the server 20 to the client 10 and executed on the client 10 as necessary.

  Further, the search keyword storage file 108, the operation-specific weight setting file 109, the operation history file 110, the hit order weight setting file 111, and the search identification weight holding file 112 are stored in the hard disk 4 of the client 10.

  Further, the search unit 201 is a function realized when the CPU of the server 20 executes a server program stored in the hard disk on the RAM.

  The data holding unit 202 is realized on a hard disk or the like of the server 20.

  The detailed configuration of each unit described above will be described in the description of the flowchart described later.

  Hereinafter, the information search procedure in the information search system of the present invention will be described in detail with reference to FIGS.

  FIG. 3 is a flowchart showing an example of a first control processing procedure in the present invention, and corresponds to the information search processing of the present invention. Note that the processing of this flowchart is realized by the CPU 1 of the client 10 shown in FIG. 1 executing a program stored in the hard disk 4 on the RAM 3.

  First, in step S1, the search keyword input unit 101 receives an input of a search expression (first search expression) composed of a plurality of keywords from the search keyword input screen shown in FIG. Here, the search keyword input screen will be described with reference to FIG.

  FIG. 4 is a schematic diagram showing an example of a search keyword input screen displayed on the display 2 shown in FIG. 1 by the search keyword input unit 101 shown in FIG.

  In FIG. 4, reference numeral 1501 denotes a search keyword input field, in which a search keyword (a search expression composed of a plurality of keywords) can be input by the input device 5. For example, as shown in 1501, a plurality of words such as “system software development test implementation” can be input.

  Reference numeral 1502 denotes a search button. When this button is pressed by the input device 5, the search keyword input unit 101 acquires the search keyword input in the search keyword input field 1501 as a first search expression, and FIG. The process proceeds to step S2.

  In step S <b> 2, the search keyword input unit 101 transmits the first search formula received in step S <b> 1 to the search unit 201 of the server 20. As a result, the server 20 receives the first search expression transmitted from the search unit 201, searches the data holding unit 202 based on the received first search expression, and returns the search result to the client 10. .

  Next, in step S <b> 3, the search result list display unit 102 receives the search result returned from the search unit 201 of the server 20 as the first search result.

  Next, in step S4, the search keyword input unit 101 stores the first search expression transmitted to the server 20 and the search results received by the search result list display unit 102 in the search keyword storage file 108 (FIG. 5). . Here, the search keyword storage file 108 will be described with reference to FIG.

  FIG. 5 is a schematic diagram showing an example of the search keyword storage file 108 shown in FIG.

  As shown in FIG. 5, the search keyword storage file 108 includes a search expression number 1101, a search expression 1102, a search number 1103, a search result 1104, and the like. The search expression number 1101 is sequentially added by the search keyword input unit 101 or the like when storing data. At the time of step S4 in FIG. 3, only the search formula 1 (the first search formula described above) is stored. The search result 1104 stores an address where the corresponding search result information is stored.

  The description returns to the flowchart of FIG.

  Next, in step S5, the search result list display unit 102 displays the search results received in step S3 on the display 2 as shown in FIG. 6, for example.

  FIG. 6 is a schematic diagram illustrating an example of a search result list display screen by the search result list display unit 102 illustrated in FIG.

  In FIG. 6, reference numeral 301 denotes a search result list display screen. Reference numeral 302 denotes a search expression corresponding to the search result list display screen 301 (the above-described first search expression).

  Reference numeral 303 denotes a search result, in which the title of each data is displayed, and the title is linked to each data. That is, by instructing the title of each data with the input device 5, the search result list display unit 102 can display the corresponding data as a link. In addition, the search result list display unit 102 can print out the data displayed as a link by a printing apparatus (not shown). Further, the search result list display unit 102 can add a bookmark to the linked data. The search result list display unit 102 can copy the linked data. Further, the search result list display unit 102 can store data linked to the hard disk 4. The function of the search result list display unit 102 is not limited to the above-described process, and various processes can be executed on each data corresponding to the search result.

  The search result 303 includes a plurality of pages, and the search result page can be switched by designating the page number with the input device 5.

  Reference numeral 306 denotes a search expression change button. When this button is designated, a search expression for a combination of keywords equal to or greater than the number of keywords entered in the minimum keyword number input field 305 is displayed in the search expression 302. Created based on an expression.

  The description returns to the flowchart of FIG.

  In step S6 of FIG. 3, the search result list display unit 102 and the operation-specific weight setting unit 103 execute processing for recording user operations. Here, with reference to FIG. 7, the process which records operation of the user of step S6 is demonstrated in detail.

  FIG. 7 is a flowchart showing an example of the second control processing procedure according to the present invention, and corresponds to the process of recording the user operation shown in step S6 of FIG. Note that the processing of this flowchart is realized by the CPU 1 of the client 10 shown in FIG. 1 executing a program stored in the hard disk 4 on the RAM 3.

  In step S101, when the search result list display unit 102 confirms a user operation executed on the search result list display screen 301, the process proceeds to step S102.

  In step S102, the operation-specific weight setting unit 103 determines whether or not the currently operated link destination item already exists in the operation history file 110 (FIG. 8).

  For example, in step S101, the user opens the link display of “Information XX mechanism: Information processing engineer testing center: Information processing engineer testing system” displayed on the search result list display screen shown in FIG. When the user's operation is confirmed, for example, the item of the link destination currently being operated (information XX mechanism: information processing engineer testing center: information processing engineer testing system) is operated in step S102. It is determined whether it already exists in the history file 110 (FIG. 8).

  Here, the operation history file 110 shown in FIG. 2 will be described with reference to FIG.

  FIG. 8 is a schematic diagram showing an example of the operation history file 110 shown in FIG.

  In FIG. 8, reference numeral 801 denotes a link destination operated by the user, and a character string corresponding to the title displayed in the search result 303 is stored.

  Reference numeral 802 denotes a user operation, and one or a plurality of operations (for example, “link display”, “print”, “bookmark”, “copy”, “save”) performed on the link destination 801 operated by the user. ... Are stored.

  Reference numeral 803 denotes a point to which a weight (A) is added (hereinafter referred to as a user operation weight 803), in which a weight corresponding to the user operation 802 is stored. Details of the user operation weight 803 will be described later.

  Returning to the flowchart of FIG.

  In step S102 of FIG. 7, the operation-specific weight setting unit 103 operates the item of the link destination address currently being operated (for example, “Information XX mechanism: Information processing engineer testing center: Information processing engineer testing system”). If it is determined that it does not yet exist in the history file 110 (FIG. 8) 801, the process proceeds to step S103.

  In step S103, the operation-specific weight setting unit 103 creates a new item in the operation history file 110 (FIG. 8), and sets the user operation weight 803 to “0” as an initial point. Then, the process proceeds to step S104.

  On the other hand, in step S102, the operation-specific weight setting unit 103 indicates that the item of the link destination address currently being operated (for example, “Information XX mechanism: Information processing engineer testing center: Information processing engineer testing system”) If it is determined that it already exists in the file 801 (FIG. 8) 801, the process proceeds directly to step S104.

  In step S104, the operation-specific weight setting unit 103 acquires the weight (A) corresponding to the operation confirmed in step S101 based on the operation-specific weight file 109 shown in FIG. 9, and the corresponding operation, weight (A). Are added to the user operation 802 and user operation weight 803 of the corresponding item in the operation history file 110 (FIG. 8). Here, the operation-specific weight file 109 will be described with reference to FIG.

  FIG. 9 is a schematic diagram showing an example of the operation-specific weight file 109 shown in FIG.

  As shown in FIG. 9, the operation-specific weight file 109 includes a user operation 901 and a weight (A) 902 corresponding to the link destination 801 that performed the user operation. That is, in the operation-specific weight file 109, points corresponding to operations performed such as print = 30 points, save = 30 points, bookmark = 25 points, copy = 10 points, link display = 5 points are set. Yes.

  In step S104 of FIG. 7 described above, for example, when the link display of “Information XX mechanism: Information processing engineer test center: Information processing engineer test system” is opened and printed, the operation-specific weight setting file 109 is displayed. Since “link display” is set to “5 points” and “printing” is set to “30 points”, the user corresponding to “Information XX mechanism: Information processing engineer testing center: Information processing engineer testing system” “Link display” and “print” are added to the operation 802, and “5 points” and “30 points” are added to the weight 803 of the user operation.

  Returning to the flowchart of FIG.

  Next, in step S <b> 105, the search result list display unit 102 determines whether or not there has been an instruction to press the “change search expression” button 304 with the minimum number of keywords 305 being input on the search result list display screen 301. If it is determined that there is no instruction to press, the process returns to step S101.

  On the other hand, if it is determined in step S105 that there is an instruction to press the “change search expression” button 304 while the minimum number of keywords 305 is input, the process of this flowchart is terminated, and the process shown in the flowchart of FIG. return.

  The description returns to the flowchart of FIG.

  When the process of step S6 is completed, in step S7, the keyword combination creating unit 104 determines the first search keyword group (in the example shown in FIG. 5, “system software development test implementation” of search expression 1 (first search expression)). Are read from the search keyword storage file 108.

  Next, in step S8, the keyword combination creating unit 104 uses the first search keyword group acquired in step S7, and is a combination in which the keywords do not overlap with the minimum number of keywords input in the minimum keyword number input field 305 in FIG. A second search keyword group (second search expression) is generated.

  If the first search keyword group is “System Software Development Test Implementation” and the minimum number of keywords is “4”, “4” from “System”, “Software”, “Development”, “Test”, “Implementation” By combining two or more keywords, the five search formulas “system software development test”, “system software development implementation”, “system software test implementation”, “system development test implementation”, “software development test implementation” It is generated as a search keyword group (second search expression group).

  Next, in step S <b> 9, the weight calculation processing unit 105 transmits the second search keyword group created by the keyword combination creation unit 104 in step S <b> 8 to the search unit 201 of the server 20. Thereby, in the server 20, the search unit 201 receives the transmitted second search formula group, and searches the data holding unit 202 based on the received second search formula group (each second search formula). , Each search result corresponding to each second search expression is returned to the client 10.

  Next, in step S <b> 10, the weight calculation processing unit 105 receives the search result returned from the search unit 201 of the server 20 as the second search result. Here, a search result as shown in FIG. 10 is received for each second search expression.

  FIG. 10 is a schematic diagram illustrating an example of a search result acquired for each second search expression.

  Here, in a step (not shown), the keyword combination creating unit 104 stores the second search keyword group created in step S8 and the second search result received by the weight calculation processing unit 105 in the search keyword storage file 108 (FIG. 5). Remember me.

  Next, in step S <b> 11, the weight calculation processing unit 105 executes processing for calculating importance from all search expressions. Here, the process of calculating the importance from all the search formulas will be described in detail with reference to FIG.

  FIG. 11 is a flowchart showing an example of a third control processing procedure according to the present invention, which corresponds to the processing for calculating the importance from all the search expressions shown in step S11 of FIG. Note that the processing of this flowchart is realized by the CPU 1 of the client 10 shown in FIG. 1 executing a program stored in the hard disk 4 on the RAM 3.

  In step S201, the weight calculation processing unit 105 selects a search formula to be calculated from the second search formula group created by the keyword combination creation unit 104 in step S8, and sets the importance point corresponding to the search formula to “0”. "

  Next, in step S202, the weight calculation processing unit 105 acquires the user operation history stored in the operation history file 110, selects one link destination included therein, and selects the selected link destination. The user operation weight 803 is taken out (when there are a plurality of user operations, a total value thereof is calculated) (weight (A) acquisition).

  For example, when the link destination of “Information XX mechanism:...” Described in the number 1 of the operation history file 110 in FIG. 8 is selected, the weight (A) “5 points” is acquired.

  Next, in step S203, the weight calculation processing unit 105 determines the position in the second search result (search result corresponding to the search expression selected in step S201) received in step S10 of the link destination selected in step S202. To get.

  For example, the search result corresponding to the search expression selected in step S201 by the link destination of “information XX mechanism:...” Described in the first of the operation history file 110 in FIG. The position information displayed in the search result list is acquired. In the example illustrated in FIG. 10, information that “information XX mechanism:...” Is located at the “24th” case is acquired.

  Next, in step S204, the hit order weight setting unit 106 searches the hit order weight setting file 111 (FIG. 12) based on the position information acquired by the weight calculation processing unit 105 in step S203, and determines the hit order weight. (Weight (B) acquisition).

  FIG. 12 is a schematic diagram showing an example of the hit order weight setting file 111 shown in FIG.

  As shown in FIG. 12, the hit order weight setting file 111 includes a link destination display position 1201 to which importance is added, and a weight (B) 1202.

  For example, in the above-described step S203, when information on the position of the link destination of “information XX mechanism:...” Shown in FIG. (21 to 30)), the weight (B) “10” points can be acquired.

  Returning to the flowchart of FIG.

  Next, in step S205, the weight calculation processing unit 105 performs the link destination user operation weight 803 (weight (A)) acquired in step S202 and the weight (B) obtained by the hit order weight setting unit 106 in step S204. ) To calculate (A * B), and in step S205, it is stored as the importance in the search-specific weight holding file 112 (FIG. 13). At this time, a value obtained by adding the calculated A * B to the “total” of the search formula is stored in the “total” 1301 (FIG. 13). Here, with reference to FIG. 13, the retrieval formula-specific weight holding file 112 will be described.

  FIG. 13 is a schematic diagram showing an example of the search expression-specific weight holding file 112 shown in FIG.

  As shown in FIG. 13, in the weight retention file 112 by search expression, the weight (weight (A)), weight (B), and importance (A) of the user operation corresponding to each operated link destination for each search expression. * B) is stored. For each retrieval formula, A * B “total” 1301 is also stored.

  In the above example (in the case of “search formula 2” and “information XX mechanism:...”), The weight (A) acquired from the operation history file 110 shown in FIG. 8 is “5”, and shown in FIG. Since the weight (B) acquired from the hit order weight setting file 111 is “10”, the total weight “50” is calculated.

  Returning to the flowchart of FIG.

  Next, in step S207 of FIG. 11, the weight calculation processing unit 105 determines whether there is an unprocessed link destination operated by the user from the operation history file 110 (there are items to be processed). Determine.

  If it is determined in step S207 that there is an unprocessed link destination operated by the user from the operation history file 110 (items to be processed remain), the weight calculation processing unit 105 The process returns to step S202, and the process proceeds to the next link destination.

  On the other hand, if it is determined in step S207 that the link destination operated by the user from the operation history file 110 has not yet been processed (there are no items to be processed), the weight calculation processing unit 105 proceeds to step S208. Proceed with the process.

  In step S208, the weight calculation processing unit 105 determines whether all the search expressions created by the keyword combination creating unit 104 have been processed, and determines that all the search expressions have not been processed yet. In step S201, the process returns to step S201, and the process proceeds to the next search expression.

  On the other hand, if it is determined in step S208 that all the search expressions created by the keyword combination creation unit 104 have been processed, the process of this flowchart is terminated, and the process returns to the flowchart of FIG.

  The description returns to the flowchart of FIG.

  In FIG. 3, when the process of step S <b> 11 ends, in step S <b> 12, the post-combination keyword display unit 107 receives weight information (“total” 1301 for each search expression) from the search expression-specific weight holding file 112 shown in FIG. Further, the number of search result hits is read from the number of searches 1103 in the search keyword storage file 108, and these two are displayed as importance A03 and search result number A04 for each search formula A02 as shown in FIG.

  FIG. 14 is a schematic diagram illustrating an example of the display of the post-combination search expression result displayed on the display 2 by the post-combination keyword display unit 107 illustrated in FIG. 2.

  As shown in FIG. 14, the post-combination keyword display unit 107 first displays the first search keyword group (first search expression) A06 and the number of search results, and the second search search keyword group (second search expression) input by the user. Group) A02, its importance A03, and the number of search results A04 are displayed for each second search expression. In FIG. 14, the second search keywords (second search formulas) are displayed in descending order of importance. It should be noted that the items may be displayed in ascending order of importance (ascending order), or may be configured to be switchable in descending order / ascending order according to user settings.

  In the case of the example shown in FIG. 14, the number of hits of the search formula 2 “system software development test” is 975 points, which is the highest score, so it is displayed at the top.

  Also, as shown in FIG. 14, the display of the post-recombination search formula result has a “list display” button A05.

  When the “display list” button A05 is instructed to be pressed by the input device 5, the post-combination keyword display unit 107 displays the search result corresponding to the search expression corresponding to the pressed button, as shown in FIG. Obtained from the address stored in the search result 1104 of the keyword storage file 108, a search result list is displayed on the display 2 as indicated by 303 in FIG.

  The description returns to the flowchart of FIG.

  The post-combination keyword display unit 107 ends the processing of this flowchart when the post-combination search result display screen shown in FIG. 14 is ended.

  1 and 2 show the configuration in which the client 10 and the server 20 are connected via a network, the configuration is such that the function of the client 10 and the function of the server 20 are realized on the same computer. May be.

  Furthermore, the present invention is not limited to the above-described embodiment, and various modifications and applications are possible.

  Further, in the present embodiment, the configuration in which everything except the search unit 201 and the data holding unit 202 is provided on the client 10 has been described. However, only the web browser is provided in the client 10, and all the screens processed and generated on the server 20 are received and displayed by the web browser of the client 10 from the server 20, and data input from the display screen is displayed in the client 10. A web browser may be configured to transmit to the server 20.

  Further, only a part of the above functions may be provided on the server 20 and the remaining functions may be provided on the client 10.

  As described above, which functions are provided in the client 10 and the server 20 is merely a design matter, and the entire information search system according to the present invention having the above-described functions is included in the present invention. .

  Further, the configuration and contents of the various data described above are not limited to this, and it goes without saying that the various data and configurations are configured according to the application and purpose.

  Although one embodiment has been described above, the present invention can take an embodiment as, for example, a system, apparatus, method, program, or recording medium, and specifically includes a plurality of devices. The present invention may be applied to a system including a single device.

  As described above, in the present invention, when searching for information, an operation performed by the user is evaluated for each link destination of the first search result obtained from the plurality of input keywords (first search formula). The evaluation weight (weight (A)) is added to each link destination. Further, the second search keyword group is generated from a combination of non-overlapping keywords by reducing the number of keywords one by one, such as (n-1) (n-2) (n-3)... To do. If the second search result includes a link destination operated by the user, the weight (weight (B)) attached to the link destination is added to each second search keyword group, and the second keyword The weight (importance) of the group is calculated, and the second search keyword group and its weight (importance) are displayed. From the weight of the search expression in this display, the user can know a more optimal search expression and can refer to the new search.

  In addition, as in the past, the search results are evaluated by adding weights step by step according to the type of user's operation without evaluating the search results consciously by the user. Realistic evaluation and natural evaluation that the user is not aware of can be performed. For this reason, it is possible to determine an accurate search formula for the user.

  Furthermore, in the present invention, since the number of keywords is reduced one by one and the search expression is automatically generated with a combination of keywords that do not overlap, the user only has to input the search keyword once, so the burden on the user is reduced and the search omission is omitted. Can be reduced, and the number of searches can be gradually increased.

  In addition, when the user enters a misplaced word, the word can be found by the difference in the weight of the displayed search results. As a result, the user's search formula creation skill is improved and the user searches for a document. There are effects such as shortening the labor.

  Hereinafter, the configuration of a data processing program that can be read by the computer device that constitutes the information search system according to the present invention will be described with reference to the memory map shown in FIG.

  FIG. 15 is a diagram for explaining a memory map of a recording medium (storage medium) that stores various data processing programs that can be read by a computer device constituting the information search system according to the present invention.

  Although not specifically shown, information for managing a program group stored in the recording medium, for example, version information, creator, etc. is also stored, and information depending on the OS on the program reading side, for example, a program is identified and displayed. Icons may also be stored.

  Further, data depending on various programs is also managed in the directory. In addition, when a program or data to be installed is compressed, a program to be decompressed may be stored.

  The functions shown in FIGS. 3, 7, and 11 in the present embodiment may be performed by a host computer by a program installed from the outside. In this case, the present invention is applied even when an information group including a program is supplied to the output device from a recording medium such as a CD-ROM, a flash memory, or an FD, or from an external recording medium via a network. Is.

  As described above, a recording medium in which a program code of software for realizing the functions of the above-described embodiments is recorded is supplied to the system or apparatus, and the computer (or CPU or MPU) of the system or apparatus is stored in the recording medium. It goes without saying that the object of the present invention can also be achieved by reading and executing the program code.

  In this case, the program code itself read from the recording medium realizes the novel function of the present invention, and the recording medium storing the program code constitutes the present invention.

  As a recording medium for supplying the program code, for example, a flexible disk, hard disk, optical disk, magneto-optical disk, CD-ROM, CD-R, DVD-ROM, magnetic tape, nonvolatile memory card, ROM, EEPROM, A silicon disk or the like can be used.

  Further, by executing the program code read by the computer, not only the functions of the above-described embodiments are realized, but also an OS (operating system) or the like running on the computer based on the instruction of the program code. It goes without saying that a case where the function of the above-described embodiment is realized by performing part or all of the actual processing and the processing is included.

  Furthermore, after the program code read from the recording medium is written in a memory provided in a function expansion board inserted in the computer or a function expansion unit connected to the computer, the function expansion is performed based on the instruction of the program code. It goes without saying that the case where the CPU or the like provided in the board or the function expansion unit performs part or all of the actual processing and the functions of the above-described embodiments are realized by the processing.

  Further, the present invention may be applied to a system composed of a plurality of devices or an apparatus composed of a single device. Needless to say, the present invention can be applied to a case where the present invention is achieved by supplying a program to a system or apparatus. In this case, by reading a recording medium storing a program represented by software for achieving the present invention into the system or apparatus, the system or apparatus can enjoy the effects of the present invention.

  Furthermore, by downloading and reading out a program represented by software for achieving the present invention from a server, database, etc. on a network using a communication program, the system or apparatus can enjoy the effects of the present invention. It becomes.

  In addition, all the structures which combined embodiment mentioned above and its modification are also included in this invention.

It is a block diagram which shows an example of a structure of the information search system of this invention. It is a block diagram which shows an example of a function structure of the information search system shown in FIG. It is a flowchart which shows an example of the 1st control processing procedure in this invention. It is a schematic diagram which shows an example of the search keyword input screen displayed on the display 2 shown in FIG. 1 by the search keyword input part 101 shown in FIG. FIG. 3 is a schematic diagram illustrating an example of a search keyword storage file 108 illustrated in FIG. 2. FIG. 3 is a schematic diagram illustrating an example of a search result list display screen by a search result list display unit 102 illustrated in FIG. 2. It is a flowchart which shows an example of the 2nd control processing procedure in this invention. It is a schematic diagram which shows an example of the operation history file 110 shown in FIG. FIG. 3 is a schematic diagram illustrating an example of an operation-specific weight file 109 illustrated in FIG. 2. It is a schematic diagram which shows an example of the search result acquired for every 2nd search formula. It is a flowchart which shows an example of the 3rd control processing procedure in this invention. It is a schematic diagram which shows an example of the hit order weight setting file 111 shown in FIG. FIG. 3 is a schematic diagram illustrating an example of a weight retention file 112 by search expression illustrated in FIG. 2. FIG. 4 is a schematic diagram illustrating an example of a display of a result of a post-combination search expression displayed on the display 2 by the post-combination keyword display unit 107 illustrated in FIG. 2. It is a figure explaining the memory map of the recording medium (storage medium) which stores the various data processing program which can be read by the computer apparatus which comprises the information search system which concerns on this invention.

Explanation of symbols

1 CPU
DESCRIPTION OF SYMBOLS 2 Display 4 Hard disk 5 Input device 10 Client 20 Server 101 Search keyword input part 102 Search result list display part 103 Operation-specific weight setting part 104 Keyword combination preparation part 105 Weight calculation process part 106 Hit order weight setting part 107 Post-combination keyword display part 108 search keyword storage file 109 operation-specific weight setting file 110 operation history file 111 hit order weight setting file 112 search expression-specific weight holding file 201 search unit 202 data holding unit

Claims (11)

In an information search system that performs a search process using a search formula for information stored in a storage medium,
An input means for inputting a first search expression composed of a plurality of keywords;
First acquisition means for acquiring a search result based on the first search expression;
An operation history storage means for holding a user operation for the search result acquired by the first acquisition means;
Creating means for creating a plurality of second search formulas that are not duplicated by removing one keyword from the first search formula;
Second acquisition means for acquiring each search result based on each second search expression;
Weight calculation means for calculating the importance of each second search expression based on the user operation held in the operation history storage means and each search result acquired by the second acquisition means;
An information retrieval system comprising:   The information search system displays display control means for displaying the number of search results based on each second search expression and the importance of each second search expression in association with each second search expression. The information search system according to claim 1, further comprising:   The weight calculation unit evaluates each item in the search result acquired by the first acquisition unit according to a point assigned in advance for each user operation on the item, and calculates the first for each item. Based on the rank in each search result acquired by the second acquisition means of the item in the search result corresponding to the user operation stored in the operation history storage means, Evaluating each second search expression, adding a second weight, and calculating the importance of each second search expression based on the first weight and the second weight, respectively. The information search system according to claim 1 or 2, characterized in that   The weight calculation means calculates importance of each of the second search expressions based on a multiplication result of the first weight and the second weight, respectively. Information retrieval system.   5. The information search system according to claim 1, wherein the creation unit creates a search expression of a combination that includes keywords that are equal to or more than a specified number of keywords and that does not overlap.   The user operation includes a print operation, a copy operation, a bookmark creation operation, a save operation, or a link display operation for an item in the search result acquired by the first acquisition unit. 6. The information search system according to any one of 5 above. The first acquisition means is configured to transmit the first search formula to a server device and acquire a search result from the server device,
The said 2nd acquisition means transmits each said 2nd search formula to a server apparatus, respectively, and acquires each search result from the said server apparatus, The any one of Claim 1 thru | or 6 characterized by the above-mentioned. Information retrieval system described. The first acquisition means acquires search results by performing search processing on information stored in the storage medium based on the first search formula,
7. The method according to claim 1, wherein the second acquisition unit acquires each search result by performing a search process on information stored in the storage medium based on each second search expression. The information search system according to claim 1. In an information search method for performing a search process using a search formula for information stored in a storage medium,
An input step of inputting a first search expression composed of a plurality of keywords;
A first acquisition step of acquiring a search result based on the first search expression;
An operation history storage step of causing a storage unit to hold a user operation for the search result acquired in the first acquisition step;
A creation step of creating a plurality of second search formulas that are not duplicated by removing one keyword from the first search formula;
A second acquisition step of acquiring each search result based on each second search expression;
A weight calculation step of calculating the importance of each second search expression based on the user operation held in the operation history storage means and each search result acquired by the second acquisition step;
A method for retrieving information, comprising:   A program for causing a computer to implement the information search system according to any one of claims 1 to 8, or for causing a computer to execute the information search method according to claim 9. A computer can read a program for causing a computer to implement the information search system according to any one of claims 1 to 8, or for causing a computer to execute the information search method according to claim 9. Recording medium stored in

Images