JPH11316771A - Database retrieval system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To present which retrieval item needs to be entered preferentially for effective retrieval when new data is registered in a database. SOLUTION: This system which retrieves data from the database stored with pieces of data and displays the data is constituted of a retrieval means 4 which performs retrieval from the database and temporarily store the retrieval result, a counting means 7 which counts numerical properties of respective values of data items included in the retrieval result to the data stored in the database, and a result integrating means 8 which displays the results calculated by the counting means 7 together with the retrieval results, side by side. The numerical attributes to the data stored in the database are displayed together on a retrieval result output means 6 with respect to the respective values included in the retrieval results so that the importance, etc., of the values included in the retrieval results can easily be judged.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a database search system, and more particularly to a database search system excellent in registering new data in a database and searching a database.

[0002]

2. Description of the Related Art As a conventional technique of such a database search system, for example, there is JP-A-6-324933. In the described search system, a conditional search can be performed on elements of an array, and for the purpose of performing a search at high speed, when a key field is added to an index file, the array is decomposed into elements, and each element is decomposed. An array index formed to store the same record identifier as a key in the value part is added to a conventional index file.

As a conventional technique, Japanese Patent Application Laid-Open No. 1-12
No. 8128. The example described in this publication relates to a search menu method for selecting data as a hierarchical structure. If the number of layers is small, it is difficult to narrow down the data.If the number of layers is large, the search menu screen data will be large, and if the target data is ambiguous and the target data cannot be obtained, the search must be repeated from the beginning. In addition, there is a problem that the search takes time. In order to solve this problem, a similarity is calculated for an input keyword, and similar item data is extracted and edited to dynamically create a search menu screen.

Further, as a conventional technique, Japanese Patent Application Laid-Open No.
No. 68925. In this gazette, in order to enable qualitative condition search and search in which the data range is not strict, a function that gives the degree of establishment of semantic data is defined. It describes a database search system that can search for similar records only by showing it.

In a database search, a search target and a search condition are specified as a search request, and for data satisfying the search condition, only an item specified as a search target in the search request and its value are displayed in the search result. Generally, in a relational database, a search result is supplemented with a key item for identifying displayed data. In the case of a card-type database, it is also common to display all items of each data satisfying the search condition without specifying the item to be searched.

As a prior art relating to such a method of displaying a database search result, Japanese Patent Laid-Open No. 02-04560 is disclosed.
No. 9 is known. This publication has a database in which the degree of belonging is added to keywords in advance, conducts a search by giving the degree of necessity to the keyword in the search request, and determines the priority of data based on the degree of belonging and the degree of necessity. A technique has been disclosed that outputs search result data in the order of ranks, thereby facilitating determination of whether the data has high priority.

[0007]

In these conventional techniques described above, it is not clear which search item should be preferentially entered for effective data retrieval when newly registering data in a database. For example, in case databases etc., there are many search items that can be registered for one data, and it is not necessary to fill out all search items completely, so if it is indicated which search item should be entered with priority, Time and effort when registering data can be reduced.

In the example of Japanese Patent Application Laid-Open No. 1-128128, in order to easily narrow down data, item data similar to an input keyword is extracted to generate a search menu screen. Since the search menu is generated after the input, the user must determine what to input in order to further narrow down the data.

In a situation where a database is used for decision making, etc., it is necessary to check whether each value in a search result is a rare value or a large number of values in the database. Is an important factor in making decisions. However, since such a relative value dynamically changes by updating data registered in the database, if the relative value is registered as an item in the database, the amount of calculation at the time of updating is significantly increased, so that it is practical. is not. on the other hand,
If it does not exist as a database item, it cannot be specified as a search request.

According to the technique disclosed in Japanese Patent Application Laid-Open No. 2-45609, data can be displayed in the order of priority. However, it is necessary to construct a database in which the degree of belonging is added to a keyword in advance. Each time it is performed, it is necessary to update the database to which the degree of belonging is added, and the maintenance labor increases. In addition, it is inevitable that search effort for giving a necessary degree to a search request increases.

As described above, in the prior art, it is not easy to list at a glance the position of each item included in the search result in the database, and a great deal of labor is required for search and maintenance. There is a problem.

It is an object of the present invention to provide a database search system which can indicate which search item should be preferentially entered at the time of data registration and which is effective at the time of search.

Another object of the present invention is to provide a database search system capable of presenting to a user what to input in order to narrow down data at the time of data search.

[0014]

According to a first aspect of the present invention, for each value of a database field included in a search result, a frequency at which the same value appears in the same database field, and a ratio among all data are set. Counting means for counting the number of appearances,
There is a result integrating means for displaying the ratio and the like together with the search result and displaying the result.

[0015]

Embodiments of the present invention will be described in detail with reference to the drawings. There are three embodiments in total, the first embodiment is a first embodiment of the technology related to the present invention, the second embodiment is a second embodiment of the technology related to the present invention, The third mode corresponds to claims 1 to 3.

(First Embodiment) First, a first embodiment of the technology related to the present invention will be described.

FIG. 1 is a block diagram showing an example of the configuration of a first embodiment of the technology relating to the present invention. Referring to FIG. 1, a first embodiment of the technology related to the present invention includes a database 2 for recording data, a data registration unit 1 for registering data in the database, and a search item to be preferentially registered. And a search item determining means 3 for determining.

FIG. 2 shows an example of the database 2.

As shown in FIG. 2, the database 2 can register a plurality of search items for one data, and the search items are divided into a main search item and a sub search item.

Next, the operation of this embodiment will be described with reference to FIGS.

When registering data in the database 2, data and a search item to be added to the data and its value are input from the data registration means 1 (step A1).

The data registration means 1 registers the input data, the search item and its value in the database 2 (10
2) At the same time, it is passed to the search item determining means 3 (103).

The search item determining means 3 searches the database 2 (302), and counts the number of data to which each of the input search items is added among all registered data (step A2).

By registering the data, the number of data to which a certain search item is added becomes a certain ratio or more to the total number of data (for example, the number of data to which a certain search item is added is 60% of the total number of data). % Or more) (step A3).

If the ratio is equal to or more than a certain ratio (for example, 60% or more), the search item is set as a main search item (step A4). Item as a sub-search item (step A
5) The search item is divided into a main search item and a sub search item and registered in the database 2 (302).

By doing so, it is possible to indicate to the user which search items are registered with respect to the data recorded in the database. The search item can be indicated.

Also, while the database is used for a long period of time, the registered data may change. In such a case, the type and number of search items effective for the search can be automatically changed.

Next, the operation of this embodiment will be described in detail.

For example, as shown in FIG.
It is assumed that data and some search items added to the data and their values are configured.

For example, in data 1, the value of search item A is a1
And the value of the search item D is d1, and the value of the search item E is e1. The value of the search item is not registered for all data, and there is data that is unknown or has no such item.

In this example, in the search item determining means 3,
The criteria for dividing search items into primary search items and secondary search items are as follows:
It is assumed that the determination is made based on whether or not the ratio of the number of data to which the search item is added to the total number of data is 60% or more.

In the current state of the database 2, the total number of data is 6, and the ratio of the number of data to which search items A, B, C, D, and E are added is 100% (6/6).
6), 67% (4/6), 67% (4/6), 50%
(3/6), 50% (3/6), and the search items A, B,
C is the main search item, and search item D, which is less than 60%,
E is a sub search item.

Consider a case where data 7 and data 8 as shown in FIG. 4 are registered as new registration data in the database 2.

First, the data 7 is registered in the database 2 from the data registration means 1 (102) (step A).
1) The data registration means 1 informs the search item judgment means 3 that data has been added (103), and the search item judgment means 3 checks the database 2 (302) and adds the data to the data of each search item. Calculate the percentage you have.

By registering the data 7, the total number of data becomes seven, and the ratio of the data to which the search items A, B, C, D, and E are added is 86% (6/7), 5
7% (4/7), 71% (5/7), 57% (4 /
7), which is 43% (3/7) (step A2). The search item determining means 3 classifies the search items based on the calculation result (302). Search items A and C remain main search items (step A4), search items D and E remain sub search items and remain unchanged (step A5), and search item B ranges from 67% to 57% (less than 60%). Is changed from the main search item to the sub search item (step A5). As a result, the database 2 is in a state as shown in FIG.

Next, the case of registering the data 8 will be described.

When the data registration means 1 registers the data 8 in the database 2 (step A1) (step A1), the data registration means 1 informs the retrieval item judgment means 3 that data has been added (103). Search item determination means 3
Checks the database 2 (302) and calculates the ratio added to the data of each search item (step A2).

By registering the data 8, the total number of data becomes eight, and the ratio of the data to which the search items A, B, C, D, and E are added is 88% (7/8), 5
0% (4/8), 75% (6/8), 62% (5 /
8), which is 38% (3/8) (step A3). The search item determining means 3 classifies the search items based on the calculation result (302). The search items A and C remain the main search items (step A4), the search items B and E remain the sub search items and do not change (step A5), and the search item D ranges from 57% to 62% (60% or more). Is changed from the sub search item to the main search item (step A4). As a result, the database 2 is in a state as shown in FIG.

Further, when newly registering data, a case where a new search item not included as a search item in the database 2 and its value are added and the data is registered is treated similarly.

As described above, when constructing a database for the first time, it is possible to start without worrying about what and how many main search items are to be made, and to add new data. As a result, the types and number of effective main search items for search are gradually optimized.

As a modification of the first embodiment, there is a method in which the number of main search items is determined in advance, and the number of main search items is determined as the number of main search items in descending order of the percentage of the search items included in all data. . For example, 10 of search items
Assuming that the main search item is% (rounded up to the decimal point), when there are 55 search items, the search items with a high ratio in which the search item is added to all the data by paying attention to each search item The six main search items in this order are:

There is also a method of determining the number of main search items according to which value range includes the total number of search items.
For example, when the number of search items is less than 20 or less, five items are set as main search items in ascending order of the ratio of the search items added to all the data, and the number of search items is 10 or less. When the number is more than 100 and less than 100, the main search item is 1
There is a method of gradually increasing the number of main search items as the number of search items increases, such as setting the number to zero and setting the number of main search items to 20 when the number of search items is 100 or more.

(Second Embodiment) Next, a second embodiment of the technology related to the present invention will be described.

FIG. 7 is a block diagram showing an example of the configuration of the second embodiment of the technology relating to the present invention. Referring to FIG. 7, a second embodiment of the technology related to the present invention displays an input request on a display device or the like in order to search for target data, in addition to the configuration in the first embodiment shown in FIG. Search item input means 5 for inputting a search item using a keyboard or the like; search means 4 for searching a database using the search item input from the search item input means 5; The difference is that a search result output means 6 for displaying search results and a counting means 7 for counting the number of search items added to the data searched by the search means 4 are provided.

The operation of the second embodiment of the technology related to the present invention will be described with reference to FIGS. At the same time that data is newly registered in the database 2 from the data registration means 1 (102), the new data, the search item added to the data, and the value thereof are passed from the data registration means 1 to the search item determination means 3 ( 103).

The search item determination means 3 divides the search items into main search items and sub search items in the same manner as in the first embodiment, registers them in the database 2 (302), and at the same time, searches the search item input means 5 Register search items and sub search items (3
05).

At the time of data search, search item input means 5
Prompts the user to enter a search item. The main search item and the sub search item are separately presented to the user, and the user inputs a search item having a known value (step B).
1). By prioritizing your search terms for input,
Make it easier for users to search for data.

The search item input means 5 passes the input search item and its value to the search means 4 (504), and the search means 4 searches the database 2 for data corresponding to the value of the search item input from the database 2. (402, 20
4) (Step B2).

At the same time as the search, the search means 4 passes the searched data to the counting means 7 (407), and the counting means 7 checks the search items added to the searched data. The number of entered data is counted (step B3).

The number of data entered for each search item is returned from the counting means 7 to the search means 4 (704) and passed to the search item input means 5 (405).

At the same time, the retrieved data is passed to the retrieval result output means 6 (406) and presented to the user (step B4), and the user is asked whether to narrow down the retrieval data (step B4). Step B5).

If the data is to be further narrowed down, the search item input means 5 inquires the user in order from the search item having the largest number of entered data, for which the value has not been input yet (step B6). Then, the answer input by the user is passed to the search means 4 (504), and the search is continued in the same manner.

If the user replies that the search results are not to be narrowed down, the search is terminated (step B7).

Next, the operation of this embodiment will be described in more detail.

For example, assume that data as shown in FIG.

The data entered by the data registration means 1 at the time of data registration and the search items added to the data and their values are registered in the database 2 (102) and are also passed to the search item determination means 3 (103). The search items are classified into main search items and sub search items by the search item determining means 3 (302).

The classification result of the search item is registered in the database 2 (302), and is also registered in the search item input means 5 (305).

When the user searches for data, the search item input means 5 prompts the user to input search items. At this time, search items A, B, and C, which are main search items,
By separately presenting the search items D and E, which are the sub search items, the user can know that the search items A, B, and C have values recorded at a high rate, and the user searches the data. It will be easier.

For example, it is assumed that the user has requested the search for "data having a search item A value of a1" in the search item input means 5 (step B1).

The search condition input means displays a search item and a value input field on a window using a display device or the like, and inputs a value using a device such as a keyboard, a mouse, or a pen.

In the search condition input, only the main search item can be directly input, and the sub search item can be input only when the user performs an operation such as menu selection. , There is a method of arranging in descending order of the percentage described in all data.

There is also a method of inquiring the user of a value in order from the main search item using a pop-up window or the like.

The search item input means 5 passes the input search condition “the value of the search item A is a1” to the search means 4 (50
4) The search means 4 searches for data that satisfies the search condition input from the database 2 (204, 40).
2).

In this case, as shown in FIG.
Four data of 2, 4, and 5 are searched (step B)
2).

The search means 4 passes the searched data to the counting means 7 at the same time as the search (407). The counting means 7 checks the search items added to the searched data, and searches the search results for each search item. Count the number of data entered in the data. In this case, when the search is completed, “2 search items B”, “2 search items C”, and “3 search items D”
This means that there is data in which "item" and "two search items E" are entered (step B3), and the number of entered data for each search item is returned from the counting means 7 to the searching means 4 (704). ) And passed to the search item input means 5 (40
5).

The searched data is passed to the search result output means 6 (406) and presented to the user using an output device such as a display or a printer (step B4).

After the search result is presented to the user, the search item input means 5 asks the user whether to further narrow down the search data (step B5). As a method of inquiring, for example, a pop-up window displayed on a display device or the like can be used.

If the answer from the user does not indicate that the search is to be continued, the search is terminated (step B7).

If the user's answer is that the search is to be continued, the search item input means 5 sequentially searches the search items having the largest number of data items, for which no value has been input, from the search items having the largest number of data. Ask the user a question. In this case,
From among the search items B, C, D, and E for which no value has been input, select the search item D with the largest number of data entered in the search data, and ask the user for the value (step B6). If no search value is entered and there are a plurality of search items with the same number of data entered, any of them may be asked to the user. For example, questions may be asked in alphabetical order or alphabetical order.

When a new value of the search item is inputted by the user, the search item and the value are passed to the search means 4 (50).
4) The search is continued in the same manner.

As a modification of the second embodiment, the counting means 7 checks a search item added to the searched data.
When counting the number of data items entered in the search result data for each search item, the number of data items for each search item should also be counted. There is a method in which the number of each value is returned from the counting means 7 to the search means 4 (704) and passed to the search item input means 5 (405).

If the number of search items for each value is known, when asking the user for the value of the search item in order to narrow down the searched data, when the user asks for the value of the search item, the order of the value of the recorded search item is large. You can ask questions by displaying a menu.

Since the search item and its recorded value are presented in descending order of the number of recorded data, the user can easily narrow down the searched data.

A modification of the second embodiment will be described in detail with reference to FIG.

For example, it is assumed that data is searched from the database 2 in which data is recorded as shown in FIG. 2 under a search condition of “the value of the search item A is a1”.

First, the search condition “the value of the search item A is a1” is input to the search item input means 5 (step B).
1), is passed to the search means 4 (504). The search means 4 searches for data that satisfies the search condition input from the database 2 (402, 204), and four data 1, 2, 4, and 5 are searched as shown in FIG. 9 (step B2).

At the same time as the search, the search means 4 passes the searched data to the counting means 7 (407). The counting means 7 checks the search items added to the searched data, and searches for each search item. The number of entered data in the result data is counted (step B3). At the same time, the number of search items for each value is counted (step B3 ').
In this case, the number of data entered at the time of completion of the search is "2 search items B" and "2 search items C"
"Search item D is three" and "Search item E is two" (step B3), and the number of search items for each value is "one value b2 of search item B""value b3 of search item B""1value""2 values c1 for search item C""2 values d1 for search item D""1 value d2 for search item D""1 value e1 for search item E""Search The value e2 of the item E is one "(step B3 ').

The number of data entered for each search item and the number of each search item for each value are returned from the counting means 7 to the search means 4 (407) and passed to the search item input means 5. (405). The searched data is passed to the search result output means 6 (406) and presented to the user (Step B4).

After the search result is presented to the user, the search item input means 5 asks the user whether to further narrow down the search data (step B5).

If the answer from the user does not indicate that the search is to be continued, the search is terminated (step B7).

If the answer of the user is that the search is to be continued, the search item input means 5 sequentially searches the search items having the largest number of entered data, from those for which no value has been input yet. Ask the user a question. From among the search items B, C, D, and E for which no value has been input, select the search item D with the largest number of data entered in the search data, and ask the user for the value (step B7).

At this time, “the value d1 of the search item D is two”
Since the information that "the value d2 of the search item D is one" is passed to the search item input means 5, a menu is displayed in ascending order of the recorded search item values, and the user is asked about the value of the search item. can do. In addition, the user can be asked a question such as “Is the value of the search item D d1 or d2?”.

Since the search items and their recorded values are presented in descending order of the number of recorded data, the user can easily narrow down the searched data.

When a new value of the search item is inputted by the user, the search item and the value are passed to the search means 4 (50).
4) The search is continued in the same manner.

(Third Embodiment) Next, an embodiment of the present invention will be described with reference to FIGS.

FIG. 11 is a block diagram showing a configuration example of an embodiment of the database search system of the present invention. According to FIG. 11, a search means 4 for searching the database 2 and temporarily storing the search result, and for each value of the data item included in the search result, a quantitative attribute corresponding to the data stored in the database Counting means 7 for calculating
And a result integration means 8 for displaying the result calculated by the counting means together with the search result, and displaying the result together with the search result. The result integration means 8 includes the result in the search result so that the importance of the value included in the search result can be easily determined. For each value to be output, the value is output to the search result output means 6 together with a numerical attribute for the data stored in the database. The output of the result integrating means 8 may be stored in a data file in addition to being displayed by the search result output means 6.

FIG. 12 is a flowchart showing an operation example of the present invention.

In the embodiment of the present invention, a search result is first received from a database (step S10).
Subsequently, it is checked whether the calculation of the quantitative attribute has been performed for the value included in the search result (step S20). If any value has not been calculated, the value is extracted (step S30). (Step S4)
0). When the numerical attributes are calculated for all the values included in the search results, the respective numerical attributes are described together with the values included in the search results (step S50).
Output (step S60) and the process ends.

The operation of the present embodiment will be described below in more detail with reference to the drawings.

For example, a database 2 containing the data shown in FIG. 13 and receiving a search request and outputting a search result;
Search result output means 6 such as a CRT and search item input means 5 for inputting using an input device such as a keyboard or a mouse
The search means 4 receives a search result by inputting a signal input from the search item input means 5 to the database 2 as a search request, and stores the value of each data item included in the search result in the database. The data search system includes a counting means 7 for calculating a quantitative attribute for the data obtained, and a result integrating means 8 for displaying the result calculated by the counting means together with the search result and displaying the result.

A search request to “search for the company name, location and rank of data whose manufacturing item is an electronic component” is input to the search means 4 via the search item input means 5. The search means 4 inputs the search request into the database 2. The input to the search means 4 and the database 2 may both be expressed in a database search language such as SQL. No. 102413 (JP-A-7-31773)
Publication), the input to the search means 4 is a natural language sentence,
The input to the database 2 may be in a database search language such as SQL.

Upon receiving the above-mentioned search request, the search means 4 searches the database 2, receives and stores the search results shown in FIG. 14 (step S10), and notifies the counting means 7. The counting unit 7 refers to the search results stored in the search unit 4 and checks whether the calculation of the quantitative attribute has been performed for each of the values included in the search results (step S20). If there is a value, the value is extracted (step S30), and a numerical attribute is calculated (step S40).

When the frequency at which the value appears in the same data item is counted as a quantitative attribute as a quantitative attribute of each value included in the search result, the location frequency and rank of the location of the search result shown in FIG. Calculate manufactured item frequency for rank frequency and manufactured item. This calculation can be performed, for example, by automatically re-searching the database. In order to obtain the frequency of "Osaka City" which is the location value of the search result shown in FIG. 14, the number of "Osaka City" appearing as the item value of the location in the database shown in FIG. 13 may be counted. If the value "Osaka City" appears 123 times in the location item of the database,
The frequency of the value “Osaka City” is 123. The frequency is similarly obtained for other values included in the search result. At this time, the frequency calculation may be omitted for a key item whose appearance frequency of all data is 1, such as a company name item.

When the counting means 7 finishes calculating the frequency for the value included in the search result, the result integrating means 8 integrates the search result stored in the search means 4 with the calculation result of the counting means 7 and calculates the value of each item. An output shown in FIG. 15 is created by providing an item for describing the frequency next to the item (step S50), and is output to the search result output means 6 (step S60). A location frequency item is provided next to the location item, and the value of the location frequency item is set to 1 for data whose location value is “Osaka City”.
23. Similarly, the frequency of each of the other items and values is also described.

When the appearance ratio of each value included in the search result to all the values included in the same data item is counted as a quantitative attribute, the location attribute of the search result shown in FIG. Calculate the location ratio of the product, the rank ratio of the rank, and the production item ratio for the production item. This calculation can be performed, for example, by automatically re-searching the database. In order to obtain the ratio of “Osaka City”, which is the value of the location in the search result shown in FIG. 14, the number of “Osaka City” appearing as the item value of the location in the database shown in FIG. The ratio may be obtained. The number of "Osaka City" is 123,
Assuming that the total number of location values is 500, the ratio of “Osaka City” to the total number of location values is 24.6%.

When the counting means 7 finishes calculating the ratio for the value included in the search result, the result integrating means 8 integrates the search result stored in the search means 4 and the calculation result of the counting means 7 to obtain the value of each item. Next, an item for describing the ratio is provided, and an output shown in FIG. 16 is created (step S50), and output to the search result output means 6 (step S60). A location ratio item is provided next to the location item, and the value of the location ratio item is set to 2 for data whose location value is “Osaka City”.
It shall be 4.6%. Similarly, the ratios of other items and values are also described.

[0097]

A first effect of the present invention is that, when asking a user for the value of a search item during data search, the possible values of the search item can be presented as options.

The reason is that the counting means counts the number of search items for each value.

The second effect is that it is easy to grasp the position occupied by the value included in the search result in the database without increasing the labor of the search, and to easily determine whether the data has high priority. That is.

The reason is that, for each value of a database search result, the frequency of occurrence of the same value in the same database field, the ratio among all data, and the like are automatically determined without giving additional information to the search request. This is because the search, counting, and display are performed together with the search result.

[Brief description of the drawings]

FIG. 1 is a block diagram illustrating an example of a configuration according to a first embodiment.

FIG. 2 is a diagram showing an example of a database in the description of the embodiment.

FIG. 3 is a flowchart illustrating an example of an operation according to the first embodiment.

FIG. 4 is a diagram showing an example of newly registered data in a database in the description of the embodiment.

FIG. 5 is a diagram showing an example of a database in the description of the embodiment.

FIG. 6 is a diagram showing one database in the description of the embodiment.

FIG. 7 is a block diagram illustrating an example of a configuration according to a second embodiment.

FIG. 8 is a flowchart illustrating an example of the operation of the second mode.

FIG. 9 is a diagram showing an example of data retrieved from a database in the description of the embodiment.

FIG. 10 is a flowchart illustrating another example of the operation of the second mode.

FIG. 11 is a block diagram illustrating an example of a configuration according to an embodiment of the present invention.

FIG. 12 is a flowchart illustrating an example of an operation according to the exemplary embodiment of the present invention.

FIG. 13 is a diagram showing an example of a database according to the present invention.

FIG. 14 is a diagram showing an example of a database search result of the present invention.

FIG. 15 is a diagram showing an example of a search result according to the present invention in which an item with frequency information is added.

FIG. 16 is a diagram illustrating an example of a search result in which an item in which ratio information is described is added according to the present invention.

Claims (3)

[Claims] 1. A system for retrieving and displaying data from a database storing a plurality of data, a retrieval unit for retrieving the database and temporarily storing a retrieval result, and data included in the retrieval result For each value of the item, counting means for calculating a quantitative attribute of the value of the value stored in the database, and result integrating means for displaying the result calculated by the counting means together with the search result and displaying the result. For each value included in the search result, the value is displayed together with a quantitative attribute for the data stored in the database so that the importance of the value included in the search result can be easily determined. Database search system. 2. The method according to claim 1, further comprising: counting means for counting, as a quantitative attribute, a frequency of occurrence of the value in the same data item for each value of the data item included in the search result. 2. The database search system according to claim 1, wherein the frequency of occurrence of the value is displayed together with the value. And a counting means for counting, for each value of the data item included in the search result, the appearance ratio of the value to all the values included in the same data item as a quantitative attribute. For each value included,
2. The database search system according to claim 1, wherein an appearance ratio of the value is displayed together.