JP2000029890A - Database retrieval method and device and storage medium storing database retrieval program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To reduce the procedures of searching a target retrieval candidate and to reduce stress given to a user by enlarging a retrieval condition inputted by the user in the case that the number of the retrieval candidates obtained by retrieval is counted and the retrieval candidate is not present and outputting the retrieval candidate to the user in the case that the retrieval candidate is present. SOLUTION: This database retrieval method is for retrieving information matched with the retrieval condition inputted or selected by the user from a database where the information to be the object of the retrieval request of the user and accessory information relating to the information are classified for respective items and stored. In the retrieval method, the candidates matched with the retrieval condition of the user are retrieved from the database (S1), the number of the retrieval candidates obtained by the retrieval is counted and succeeding processings are divided (S2). The retrieval condition inputted by the user is enlarged (S3) in the case that the retrieval candidate is not present and the retrieval candidate is outputted to the user in the case that the retrieval candidate is present (S4).

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a database search method and apparatus and a storage medium storing a database search program, and more particularly, to a search input by a user from a database storing information to be requested by a user. When searching for information that matches the conditions, if there is no search candidate that matches the search condition entered by the user, determine whether the search candidate can be found by expanding the search condition entered by the user The present invention relates to a database search method and apparatus for presenting a method for expanding search conditions to a user, and a storage medium storing a database search program.

[0002]

2. Description of the Related Art In a conventional database search apparatus and method, when there is no search candidate that matches a search condition input by a user, a search for a candidate desired by the user is mainly performed by the following method. (1) Inform the user that no search candidate was found, and make the user input another search condition again to perform a search. (2) The search condition is expanded to the user in a predetermined order, and the search is advanced.

[0003]

However, the above-mentioned prior art has the following problems. (1) Even when some of the search conditions input by the user are incorrect, all of the search conditions are re-input, which is stressing the user. (2) Even if the user re-enters the search condition or selects to expand the presented search condition, there is no guarantee that the search candidate will be found without fail, and the user is forced to perform a useless operation. Is stressing.

(3) When the user performs an input again, there is a case where the same input as the previous time is mistakenly performed and a useless search is caused, which gives stress to the user. The present invention has been made in view of the above points, and based on a result of performing a search by automatically expanding a search condition input by a user,
A database search method and apparatus capable of reducing the number of procedures for searching for a target search candidate and reducing stress given to a user by determining the condition and method of enlargement to be performed next, and storage storing a database search program The purpose is to provide a medium.

[0005]

FIG. 1 is a diagram for explaining the principle of the present invention. The present invention (Claim 1) provides a search input and selected by a user from a database in which information to be searched by a user and incidental information related to the information are classified and stored for each item. In a database search method for searching for information matching a condition,
The database searches for a candidate that matches the user's search condition (step 1), counts the number of search candidates obtained by the search, and divides the subsequent processing (step 2). Expands the input search condition (step 3), and outputs the search candidate to the user when the search candidate exists (step 4).

According to the present invention (claim 2), when the search condition is expanded (step 3), the upper limit to be expanded is set arbitrarily for each item, and when the search condition is expanded, the upper limit is not exceeded. I do. According to the present invention (claim 3), when a search condition is expanded (step 3), if the search condition item has only one hierarchical structure, the search condition is deleted to delete the search condition.

According to the present invention (claim 4), when the search condition is expanded (step 3), the search condition input by the user is expanded for each item, and it is checked whether a search candidate exists. Only items for which search candidates are found are presented to the user as a method for expanding the search conditions. According to the present invention (claim 5), when the search condition is expanded (step 3), the priority order of the items used for the expansion is arbitrarily set, and there are a plurality of items that can be presented to the user as a method of expanding the search condition. Then, according to the priority, which item is used for the enlargement is determined.

According to the present invention (claim 6), when the search condition is expanded (step 3), when the search condition expansion method is presented to the user, it is specified that any search candidate can be found if the search condition is expanded. And confirm. FIG. 2 is a diagram illustrating the principle of the present invention. According to the present invention (claim 7), information targeted for a user's search request and accompanying information related to the information are
A database search apparatus for searching information matching a search condition entered or selected by a user from a database 7 stored by classifying each item, and searching the database for candidates matching the search condition of the user. The database search means 2, a search candidate analysis means 3 for counting the number of search candidates acquired by the database search means 2 and dividing the subsequent processing, and a case where no search candidate exists in the search candidate analysis means 3, The system includes a condition expansion determining unit 4 for expanding the input search condition and a search candidate presenting unit 5 for outputting the search candidate to the user when the search candidate exists.

According to the present invention (claim 8), in the database 7, the supplementary information of the information to be requested by the user has one or more levels. The present invention (claim 9)
The condition expansion determining means 4 includes means for arbitrarily setting an upper limit for expansion for each item when the search condition is expanded, and for expanding the search condition so as not to exceed the set upper limit.

According to the present invention (claim 10), in the condition expansion determining means 4, when the search condition is expanded and the search condition item has only one hierarchical structure, the search condition is deleted. Includes the means to enlarge by doing. According to the present invention (claim 11), the condition expansion determining means 4 expands the search condition input by the user for each item, checks whether or not there is a search candidate, and determines only those items for which a search candidate is actually found. As means for expanding the search condition.

According to the present invention (claim 12), in the condition enlargement determining means 4, if there is a plurality of items which can be set as the priority of the items used for enlargement and presented to the user as a method of expanding the search condition, Means for determining which items to use for enlargement according to the priorities. According to the present invention (claim 13), when the search candidate presenting means 5 presents a search condition expansion method to a user, it is explicitly indicated that any search candidate can be found if the search condition is expanded, and confirmation is made to the user. Means for instructing the search candidate presenting means to perform the search.

According to the present invention (claim 14), the user inputs or receives information from a database in which information to be searched by the user and supplementary information related to the information are classified and stored for each item. A storage medium storing a database search program for searching for information that matches a selected search condition, wherein the database search process searches a database for candidates that match a user's search condition, and a search candidate obtained in the database search process. A search suggestion analysis process that counts the number of
In the search candidate analysis process, when there is no search candidate, the condition expansion determination process that expands the search condition input by the user, and in the search candidate analysis process, when the search candidate exists, the search candidate Is output.

According to the present invention (claim 15), in the database search process, a database is searched in which the incidental information of the information to be requested by the user has one or more levels. According to the present invention (claim 16), in the condition expansion determination process, when the search condition is expanded, an upper limit for expansion is set arbitrarily for each item, and when the search condition is expanded, the upper limit is set so as not to exceed the set upper limit. Including the process of doing.

According to the present invention (claim 17), in the condition expansion determining process, when the search condition is expanded and the search condition item has only one hierarchical structure, the search condition is deleted. Includes the process of scaling up. In the present invention (claim 18), in the condition expansion determination process,
A process of expanding a search condition input by a user for each item, checking whether or not a search candidate exists, and transferring only an item for which a search candidate is actually found to a search candidate presentation process as a search condition expansion method. including.

According to the present invention (claim 19), in the condition expansion judging process, when there is a plurality of items which can be set as a priority of the items used for expansion and presented to the user as a method of expanding the search condition, the present invention is applied to Includes the process of deciding which items to use for expansion according to priorities. In the present invention (claim 20), in the condition expansion determination process,
When presenting a search condition expansion method to a user, the method includes a process of explicitly indicating that any search candidate is found if the search condition is expanded, and instructing the search candidate presentation process to prompt the user to confirm.

As described above, according to the present invention, information to be searched by a user and supplementary information related to the information are stored in a database in which the information is classified and stored for each item.
When searching for information that matches the search conditions entered or selected by the user, the search conditions are automatically expanded even if there is no search candidate that completely matches the search conditions entered by the user. By presenting only the enlargement method in which the search candidate is found to the user, the number of procedures for expanding the search condition to find the search candidate is reduced, and the target candidate can be easily determined.

[0017]

FIG. 3 shows the configuration of a database search apparatus according to the present invention. A database search device 6 shown in FIG. 1 is a main body of a database search device for searching a database for search candidates matching a search condition input by a user, and is constituted by a CPU and a memory in hardware, and functionally performs a search. Condition input unit 1, database search unit 2, search candidate analysis unit 3, condition expansion determination unit 4, search candidate output unit 5
And a database body 7.

The search condition input unit 1 acquires a search condition input by the user, and transfers it to the database search unit 2. The database search unit 2 searches the database body 7 using the search condition input by the user as a key, and transfers a search candidate that matches the search condition to the search candidate analysis unit 3. The search candidate analysis unit 3 counts the number of search candidates, and if there is any search candidate, transfers the search candidates to the search candidate output unit 5 to confirm the candidates to the user. If no search suggestions exist, you can expand your search criteria to see if there is a possibility of finding one,
The search condition input by the user is transferred to the condition enlargement determination unit 4.

The condition expansion determining unit 4 expands the search condition transferred from the search candidate analysis unit 3 for each item, and if it is found that any candidate can be searched by actually expanding the search condition, Suggest search conditions to the user. Further, when the user selects expansion of search conditions in response to a proposal from the system, those search candidates are transferred to the search candidate output unit 5.

The search candidate output unit 5 presents the transferred search candidates to the user. Next, the operation of the above configuration will be described. FIG. 4 is a flowchart of the operation of the database search device of the present invention. Step 101) The search condition input unit 1 acquires the search condition input by the user, and transfers the information to the database search unit 2.

Step 102) Database search unit 2
Searches the database body 7 using the search condition sent from the search condition input unit 1 as a key, and transfers a search candidate that matches the search condition to the search candidate analysis unit 3. Step 103) The search candidate analysis unit 3 counts the number of search candidates sent from the database search unit 2 and divides the subsequent processing.

If any search candidates exist, the search candidates are transferred to the search candidate output unit 5 to confirm with the user, and the process proceeds to step 107. If there is no search candidate, the search condition is expanded, and the search condition input by the user is transferred to the condition expansion determination unit 4 to check whether there is a possibility that the search candidate is found. Transition.

Step 104) The condition enlargement determination section 4 enlarges the search condition input by the user for each item, checks whether a search candidate is actually found, and then determines which item is to be enlarged. . First, it is checked whether the search condition can be actually expanded. Items set as non-enlargeable items during the search are excluded from the items used for enlargement. Items for which the search conditions cannot be expanded any longer, that is, items whose search conditions have been expanded to a predetermined upper limit, are also excluded from the items used for expansion. As a result, if it is found that all the items cannot be used for enlargement any more, the user is informed that the search cannot be continued any more, and the process is terminated.

If any one of the items for which the search condition can be expanded still exists, it is checked whether or not a search candidate can be found when the expansion is actually performed. Step 105) The search condition is expanded for each item of the search condition input by the user, and the search is actually performed to check the search candidates. At this time, if the same item has already been expanded during the search, the search condition is further expanded to another level to check whether a search candidate exists.

If there is an item for which a search candidate can be found by enlarging any one of the items, the search candidate can be presented after actually expanding that item. Move to 106. If a search candidate is not found even if any item is expanded, there is a possibility that the search condition can be further expanded in one step.
Move to 04.

Step 106) First, when there are a plurality of items in which a search candidate can be found by enlarging, an item for which the user confirms the enlarging is determined according to a predetermined priority. Next, the enlargement of the search condition is confirmed after the enlargement is clearly shown to the user, indicating that some search item exists.

If the user selects to enlarge the displayed item, the search candidate found by the condition expansion is transferred to the search candidate output unit 5, and the process proceeds to step 107. If the user denies zooming in on the presented item, the user's memory is considered accurate,
The item is set as a non-enlargeable item. If there is an item for which a search candidate can be found by other enlargement, the enlargement of the search condition is confirmed in a repeated order according to a predetermined priority.

If there is no item in which a search candidate can be found by expanding the item or if the expansion of the search condition is denied in all items in which the search candidate is found, the condition expansion determining unit 4 returns to the condition expansion determining unit 4 again. Then, the enlargement method is determined, and the process proceeds to step 104. Step 107) The search candidate output unit 5 outputs search candidates to the user.

According to the above processing, even when there is no search candidate that completely matches the search condition input by the user, the number of procedures for expanding the search condition to find the search candidate is reduced, and the target candidate is reduced. It can be easily determined.

[0030]

Embodiments of the present invention will be described below with reference to the drawings. 5 to 8 show examples of the contents of the database body. The name information of the database body 7 shown in FIGS. 5 to 8 is a necessary search condition when searching the database body 7, and the address information and the occupation information are related information attached to the name information. In, when there is no search candidate, the search candidate may be enlarged. The telephone number is information requested by the user.

In this case, the user is named “Nihon Shoji”,
An embodiment in which the telephone number of a company registered at the address "Akasaka, Minato-ku, Tokyo" and the occupation "Toy wholesale" is to be checked will be described. The following prerequisites are specified for the search. 1. Names that partially include the input search conditions are set as search candidates, and addresses and occupations that completely match the input search conditions are set as search candidates.

2. The priority of items used for enlargement is
It is assumed that the address is set first, and then the occupation. 3. The address has a three-level hierarchical structure of "prefecture", "city", "town", and "upper". From the initial input condition to the next higher administrative division (for example, if the initial input is "Minato-ku, Tokyo" If it is "Akasaka", the upper limit of the expansion will be "To Minato-ku, Tokyo").

4. The occupation does not have a hierarchical structure and the upper limit of enlargement is until the condition that is initially input is deleted, that is, it is not used as a search condition. [First Embodiment] In this embodiment, a case will be described in which a search condition input by a user is correct and a search candidate is found.

FIG. 5 shows an example of the contents of the database body according to the first embodiment of the present invention. In the search condition input section 1, the user inputs a name of "Japan", an address of "Akasaka, Minato-ku, Tokyo" and an occupation of "toy wholesale", and the system obtains it as a search condition. And sends it to the database search unit 2 (step 101). The database search unit 2 searches the database body 7 using the name "Japan", the address "Akasaka, Minato-ku, Tokyo", and the occupation "toy wholesale" as search conditions (step 102).

Since the contents of the database body 7 are as shown in FIG. 5, two search candidates, "Nihon Shoji" and "Nihon Bussan" are obtained. Therefore, the search candidate analysis unit 3 transfers the search candidates to the search candidate output unit 5 in order to make the user confirm the search candidates (step 10).
3). The search candidate output unit 5 presents the user with two sent search candidates “Japan Shoji” and “Nippon Bussan” to make a selection (step 107).

Since the user is seeking "Japan Shoji", "Japan Shoji" among the candidates presented by the user is
If the answer is affirmative, the system presents information about "Japan Shoji" to the user and ends the process. [Second Embodiment] In this embodiment, some of the search conditions input by the user are incorrect, and by expanding the search conditions,
A case where a search candidate is found will be described.

In the search condition input unit 1, the user inputs the name of the place where the telephone number is to be checked, "Nihon Shoji", the address "Roppongi, Minato-ku, Tokyo" and the occupation "Toy wholesale". Is acquired as a search condition and sent to the database search unit 2 (step 101). The database search unit 2 searches the database body 7 using the name "Japan Shoji", the address "Roppongi, Minato-ku, Tokyo", and the occupation "toy wholesale" as search conditions (step 102). Since the contents of the database body 7 are as shown in FIG. 6, there are no search candidates.

Therefore, the search candidate analysis unit 3 checks whether or not a search candidate can be found by expanding the search condition (step 103). Since there is no item set as non-expandable during the search, and none of the items have reached the upper limit that can be expanded, the search condition can be expanded for both the address and the occupation (step 104).

When the address search condition is expanded from "Roppongi, Minato-ku, Tokyo" to "Minato-ku, Tokyo", one search candidate "Nihon Shoji" whose occupation is registered as "toy wholesale" is obtained. . On the other hand, even if "toy wholesale", which is the search condition of the occupation, is expanded, that is, deleted from the search condition, no search candidate is obtained (step 105). If the user expands the address search condition from "Roppongi, Minato-ku, Tokyo" to "Minato-ku, Tokyo", it is made clear that the occupation is "toy wholesale" and the search candidate "Japan Shoji" exists. To see if you want to enlarge it. What the user is seeking is "Japan Shoji" of "toy wholesale", and if the storage of the address is uncertain, the user selects to expand the search condition with the presented address.

Since the user has selected to expand the search conditions by address, the search candidates are output to the search candidate output unit 5 in order to expand the address search conditions and to confirm the search candidates to be found. Transfer (step 103).
The search candidate output unit 5 presents one of the sent search candidates "Japan Shoji" to the user to make a selection (step 107).

Since the user is requesting "Japan Shoji", among the candidates presented by the user, "Japan Shoji"
If the answer is affirmative, the system presents information about "Japan Shoji" to the user and ends the process. [Third Embodiment] In the present embodiment, some of the search conditions input by the user are incorrect, and by expanding the search conditions,
A case where a search candidate is found will be described.

In the search condition input section 1, the user inputs the name of the place where the telephone number is to be checked, "Nihon Shoji", the address "Akasaka, Minato-ku, Tokyo", and the occupation "Plastic". Is acquired as a search condition and sent to the database search unit 2 (step 101). The database search section 2 searches the database body 7 using the name "Japan Shoji", the address "Akasaka, Minato-ku, Tokyo" and the occupation "plastic" as search conditions (step 102). Since the contents of the database body 7 are as shown in FIG. 7, there are no search candidates.

Therefore, the search candidate analysis unit 3 checks whether or not a search candidate can be found by expanding the search condition (step 103). Since there is no item set as non-expandable during the search, and none of the items have reached the upper limit for expansion, the search conditions can be expanded for both the address and the occupation (step 104).

When the address search condition is expanded from "Akasaka, Minato-ku, Tokyo" to "Minato-ku, Tokyo", one search candidate "Japan Shoji" whose occupation is registered as "plastic" is obtained. On the other hand, if you expand "Plastic", which is the search condition of the occupation, that is, delete it from the search condition,
One search candidate "Nihon Shoji" whose occupation is registered as "toy wholesale" is obtained (step 105).

Since there are two items in which a search candidate can be found by the enlargement, that is, the address and the occupation, the enlargement of the address is first confirmed according to a predetermined priority.
Expanding the address search condition from "Akasaka, Minato-ku, Tokyo" to "Minato-ku, Tokyo" to the user, the search is expanded to clearly indicate that there is a search candidate "Plastic" and "Japan Shoji" Ask if you want to do. The information requested by the user regarding the address of "Nihon Shoji" is accurate,
If the occupation information is ambiguous, the user selects not to expand the search conditions at the presented address.

Therefore, after setting the address as a non-enlargeable item, it is confirmed that the search condition of the occupation which is the next priority is expanded. When the occupation search condition “Plastic” is deleted for the user, it is specified whether the occupation is “toy wholesale” and the search candidate “Japan Shoji” is present, and it is confirmed whether or not to enlarge. What the user wants is "Japan Shoji" located in "Akasaka, Minato-ku, Tokyo", and if the memory of the occupation is ambiguous, the user selects to expand the search condition in the presented occupation. .

Since the user has selected to expand the search conditions by occupation, the search conditions are expanded to the occupation, and the search candidates are checked and output to the search candidate output unit 5 in order to confirm the search candidates to be found. Transfer (step 103).
The search candidate output unit 5 presents one of the sent search candidates "Japan Shoji" to the user to make a selection (step 107).

Since the user is requesting "Japan Shoji", if "Japan Shoji" is affirmed among the candidates presented by the user, the system presents information on "Japan Shoji" to the user and executes the processing. finish. [Fourth Embodiment] In the present embodiment, a case will be described in which no search candidate is found under the search condition input by the user, and a desired search candidate is not found even when the search condition is expanded.

In the search condition input unit 1, the user inputs "Nihon Shoji", the address "Akasaka, Minato-ku, Tokyo" and the occupation "Toy wholesale" where the telephone number is to be checked, and the system searches for it. It is acquired as a condition and sent to the database search unit 2 (step 101). Database search unit 2
Then, the main body of the database 7 is searched using the name “Nihon Shoji”, the address “Akasaka, Minato-ku, Tokyo”, and the occupation “Toy wholesale”.
(Step 102). Since the contents of the database body 7 are as shown in FIG. 8, there are no search candidates.

Therefore, the search candidate analysis unit 3 checks whether a search candidate can be found by expanding the search condition (step 103). Since there are no items set as non-expandable during the search, and none of the items have reached the upper limit for expansion, the search conditions can be expanded for both the address and the occupation (step 104).

Even if the address search condition is expanded from "Akasaka, Minato-ku, Tokyo" to "Minato-ku, Tokyo", no search candidate is obtained.
On the other hand, if "Toy wholesale", which is a search condition of the occupation, is expanded, that is, if it is deleted from the search conditions, one of "Japan Shoji" registered with the occupation "Plastic" as a search candidate is searched.
A case is obtained (step 105). If the search condition of the occupation is "Toy wholesale", the user is clarified that the occupation is "Plastic" and there is a search candidate of "Japan Shoji", and it is confirmed whether or not to enlarge the search.
What the user is looking for is "Japan Shoji" of "Toy Wholesaler" in "Akasaka, Minato-ku, Tokyo". Assuming that the address and occupation are correct, the user can search for the presented occupation. Choose not to expand the condition.

Therefore, after setting the occupation as an item that cannot be expanded, by expanding the search conditions, there is no item in which a search candidate can be found.
The enlargement method is determined (step 106). Since the occupation was set as the non-expandable item during the search, the search condition is expanded only for the address (step 104).

"Akasaka, Minato-ku, Tokyo" which is an address search condition
If you expand to "Minato-ku, Tokyo", you will not get any search candidates. Since there is no other item that can expand the search condition, it is checked whether the one-step search condition can be further expanded by the address item (step 105). However, since the address is also expanded to the predetermined upper limit "from the initially input search condition to one step higher", the search condition cannot be further expanded.

Thus, the user is informed that no search candidate has been found, and the process is terminated (step 10).
4). Further, in the above-described embodiment, the description has been given based on the configuration of FIG. 3. However, the present invention is not limited to this example. The present invention can be easily realized by storing it in a portable storage medium such as a disk device to be connected, a floppy disk, a CD-ROM, or the like and installing it when implementing the present invention.

The present invention is not limited to the above embodiment, but can be variously modified and applied within the scope of the claims.

[0056]

As described above, according to the present invention, the following effects can be obtained. (1) When only some of the search conditions input by the user are incorrect, by presenting only the search condition expansion method for obtaining search candidates, it is not necessary to re-input all the search conditions, and the search conditions are given to the user. Stress can be reduced.

(2) Even when there is no search candidate that matches the user's search condition, it is possible to present to the user an expansion of the search condition such that any search candidate is found, and find the target search candidate. Processing can proceed appropriately. As a result, stress applied to the user can be reduced. (3) If it is found that a search candidate cannot be found even if the search condition is expanded any more, the expansion process can be terminated there, and the need to input useless search conditions can be eliminated. Thus, the stress applied to the user can be reduced.

[Brief description of the drawings]

FIG. 1 is a diagram for explaining the principle of the present invention.

FIG. 2 is a principle configuration diagram of the present invention.

FIG. 3 is a configuration diagram of a database search device of the present invention.

FIG. 4 is a flowchart of the operation of the database search device of the present invention.

FIG. 5 is an example of the contents of a database according to the first embodiment of this invention.

FIG. 6 is an example of the contents of a database according to the second embodiment of this invention.

FIG. 7 is an example of the contents of a database according to a third embodiment of the present invention.

FIG. 8 is an example of the contents of a database according to a fourth embodiment of the present invention.

[Explanation of symbols]

 1 search condition input unit 2 database search unit, database search unit 3 search candidate analysis unit, search candidate analysis unit 4 condition expansion determination unit, condition expansion determination unit 5 search candidate output unit, search candidate output unit 6 database search device 7 database, Database body

Claims (20)

[Claims] 1. Information targeted for a user's search request and information related to the information (hereinafter referred to as supplementary information)
In a database search method of searching for information that matches a search condition entered or selected by a user from a database stored by classifying each item, searching for a candidate that matches the search condition of the user from the database, The subsequent processing is divided by counting the number of search candidates obtained by the search, and if no search candidates exist, the search condition input by the user is expanded. And outputting the search candidate. 2. The database search method according to claim 1, wherein when the search condition is expanded, an upper limit for expansion is set arbitrarily for each item, and when the search condition is expanded, expansion is performed so as not to exceed the upper limit. 3. The method according to claim 1, wherein, when the search condition is expanded, if the search condition item has only one hierarchical structure, the search condition is deleted to perform the expansion. Database search method. 4. When expanding the search condition, the search condition input by the user is expanded for each item, and it is checked whether the search candidate exists. Only items for which a search candidate is actually found are checked. 4. The database search method according to claim 1, wherein the search condition is presented to the user as a method for expanding search conditions. 5. When the search condition is expanded, a priority order of items used for expansion is arbitrarily set, and when there are a plurality of items that can be presented to the user as a method of expanding the search condition, the priority order is set. 5. The database search method according to claim 1, wherein which item to use for enlargement is determined according to the following. 6. When expanding the search condition, when presenting the search condition expansion method to the user,
6. The database search method according to claim 1, further comprising the step of explicitly confirming that any search candidate is found when the search is enlarged. 7. Information targeted for a user's search request, and information related to the information (hereinafter referred to as supplementary information)
A database search device that searches for information that matches a search condition entered or selected by the user from a database in which the items are classified and stored for each item. A database search means for searching from; a search candidate analysis means for counting the number of search candidates obtained in the database search means and separating the subsequent processing; and if no search candidates exist in the search candidate analysis means, A database search device comprising: condition expansion determining means for expanding a search condition input by a user; and search candidate presenting means for outputting a search candidate to the user when a search candidate exists. 8. The database search device according to claim 7, wherein the database has one or more levels of supplementary information of information to be requested by a user. 9. The condition enlargement determining means arbitrarily sets an upper limit of enlargement for each item when the search condition is enlarged, and performs enlargement so as not to exceed the set upper limit in the case of enlargement. 9. The database search device according to claim 7, further comprising means. 10. The condition expansion determining means, when expanding the search condition, if the item of the search condition has only one hierarchical structure, deletes the search condition to perform expansion. 10. The database search device according to claim 7, further comprising means. 11. The condition expansion determining unit expands the search condition input by the user for each item, checks whether a search candidate exists, and searches only an item for which a search candidate is actually found. 11. The database search device according to claim 7, further comprising a unit for transferring the condition to the search candidate presenting unit. 12. The condition enlargement determining means arbitrarily sets the priority order of items used for enlargement, and when there are a plurality of items that can be presented to the user as the search condition enlargement method, according to the priority order, 12. The database search apparatus according to claim 7, further comprising a unit for determining which item is used for enlargement. 13. The search candidate presenting means, when presenting the search condition expanding method to the user,
13. A means for explicitly confirming that any search candidate can be found by enlarging, and prompting the user to confirm.
Database search device as described. 14. Information to be requested by a user,
And information related to the information (hereinafter referred to as supplementary information)
Is stored in a database that stores a database search program for searching for information that matches the search condition entered or selected by the user from a database that is stored by classifying each item. A database search process for searching for a candidate to be performed from the database, a search candidate analysis process for counting the number of search candidates acquired in the database search process and separating subsequent processes, and a search candidate does not exist in the search candidate analysis process. A search expansion process for expanding the search condition input by the user, a search candidate presentation process for outputting a search candidate to the user when a search candidate is present in the search candidate analysis process. Stores a database search program characterized by having Storage media. 15. The storage medium storing the database search program according to claim 14, wherein the database search process searches the database in which the supplementary information of the information to be requested by the user has one or more levels. 16. The condition enlargement determination process arbitrarily sets an upper limit of enlargement for each item when the search condition is enlarged, and performs enlargement so as not to exceed the set upper limit when the search condition is enlarged. A storage medium storing the database search program according to claim 14 or 15, including a process. 17. The condition expansion determination process, wherein, when the search condition is expanded, if the search condition item has only one hierarchical structure, the search condition is deleted to delete the search condition. 17. A process comprising a process.
A storage medium storing the described database search program. 18. The condition expansion determination process includes: expanding the search condition input by the user for each item, checking whether a search candidate exists, and searching only for an item for which a search candidate is actually found. 18. The storage medium storing the database search program according to claim 14, which includes a process of transferring to the search candidate presentation process as a method of expanding the condition. 19. The condition enlargement determination process includes: arbitrarily setting an order of items used for enlargement; and when there are a plurality of items that can be presented to the user as a method of expanding the search condition, according to the order of priority. 19. The storage medium storing the database search program according to claim 14, further comprising a process of determining which item is used for enlargement. 20. The condition enlarging determination process, when presenting the search condition enlarging method to the user,
20. A storage medium storing the database search program according to claim 14, further comprising a process of instructing the search candidate presentation process to prompt the user to confirm that any search candidate is found when the database search program is enlarged.