JPH0367343A - Data base device - Google Patents

Abstract

PURPOSE:To facilitate the early detection of undesired data and to back up the prevention of erasion of the important data by counting and recording the output frequency to the retrieved data by displaying the output frequency after rearranging it when the data is updated and registered. CONSTITUTION:When the number of registered items are inputted via a keyboard 12 of a retrieving operation part 1, a retrieving process part 2 checks an idle area of a data stored part 3. If no idle area is available, an importance detecting part 4 retrieves an access frequency storage part 5 and rearranges data in the order of older dates of registration and in the order of lower degrees of importance. Then the header parts of the corresponding data are extracted out of the part 3 and displayed on a display 11 of the part 1 via the part 2 in the form of a list. If the data has a high access frequency and cannot be deleted despite an old date of registration, the display screen is changed and the undesired data is retrieved. Thus it is possible to easily delete the undesired data after detecting early them and to prevent the deletion of important data.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a database device that supports early detection and deletion of unnecessary data by an operator when adding or updating a database.

[Prior art] In general, databases can be classified based on their purpose of use: those, such as patent databases, that require a complete search for patents that meet search conditions, and those that require searching for all patents that meet search conditions, and those that contain sales cases, failure cases, court precedents, etc. As typified by case databases, cases can be divided into cases that only require searching for a few cases that best match the search conditions.

In order to prevent an increase in search time and unsuitable search results due to the enormous amount of stored databases, it is necessary to delete unnecessary data when adding or updating a database. In the case of the former patent database, this method can be automatically deleted when the patent expiration date has expired. Furthermore, since all patents within their expiration date must be registered, the conditions for their deletion are clear and easy. On the other hand, in the case of the latter case database, there is no clear guideline for deleting unnecessary data, and it is common to delete the oldest registered data in order.

[Problem to be solved by the invention]

As in the above conventional technology, when adding or updating a database,
If the oldest registered data is deleted first, there is a risk that the data will be deleted as old data, even though the data is frequently cited and has high information value. the result,
The problem arises that a database containing a lot of unnecessary data that is rarely cited remains.

An object of the present invention is to provide a database device that supports an operator in early detection of unnecessary data and prevention of erasure of important data without worrying about whether the data is old or new.

[Means to solve the problem]

In order to achieve the above object, the present invention includes means for recording the number of searches and the number of outputs of each piece of data searched in the past together with the registration date of the data, and at the time of registration of new data or at the request of an operator. , means for sorting and displaying each piece of data searched in the past based on the recorded registration date, number of searches, and number of outputs is provided.

[Function] For each database search, the number of searches and number of outputs for each retrieved data are updated and recorded together with the registration date of the data. Also when registering new data, 4tl.

When requested by an operator, each of the previously searched data is
Based on the registration date, number of searches, and number of outputs, the information is sorted and displayed in descending order of registration date and least number of searches and outputs. The operator can easily recognize data to be deleted from this display result.

〔Example〕

An embodiment of the present invention will be described below with reference to the drawings.

FIG. 1 is a block diagram of an embodiment of a database apparatus according to the present invention. In the figure, numeral 1 denotes a search operation section for instructing a database search and displaying and printing search results; a display 11. It consists of a keyboard 12 and a printer 13. Reference numeral 2 denotes a search processing unit that performs search verification, 3 a data storage unit that stores a database, 4 an importance detection unit that evaluates the importance of each piece of search data, and 5 a number of times each search data is searched and printed ( This is an access frequency storage unit that records the number of outputs.

First, the processing procedure when searching the database will be explained according to the processing flow shown in FIG. 2.

Appropriate search conditions are input using the keyboard 12 of the search operation section 1 (step 101). Here, the input format of the search conditions varies depending on the database, but includes keyword logical expression input (AND, OR conditions, etc.), menu selection method, natural language literary skill method, etc. The search processing unit 2 compares the input search conditions with the database of the data storage unit 3 (step 102) and makes a determination (step 103). If the matching is successful, the search processing section 2 extracts the corresponding data and displays it on the display 11 of the search operation section 1.
(step 104), and at the same time the importance level detection unit 4
Then, the access frequency storage unit 5 is checked, and if the extracted data has already been recorded, the number of searches is updated (+
1) If L, the data is not recorded, the data is newly recorded and the number of searches is set to 1 (steps 105 and 106).

Note that the registration date is generally added to the data in the data storage unit 3, and when recording new search data in the access frequency storage unit 5, the access frequency storage unit 5 stores the registration date along with the number of searches = l. Also record the day.

The operator selects desired data from several pieces of search data displayed on the display 1 and prints it using the printer 13 (step 107). This selected data is notified to the importance detecting section 4 through the search processing section 2, and in response, the importance detecting section 4 updates the number of times the data has been printed (output number) in the access frequency storage section 5 ( Step 108).

Note that if the search processing unit 2 fails in the search, a message such as "No search data" is displayed on the display 11.

Next, the processing procedure when registering new data will be explained according to the processing flow shown in FIG. 3.

Select "New Registration" using the keyboard 12 of the search operation section 1 and enter the number of registrations (step 201).The search processing section 2 checks whether there is free space in the data storage section 3 (step 202) and registers. If it is possible to reproduce the data, data registration processing is performed as is (step 210). However, if there is no free space available for registration in the data storage section 3, the operator is asked in an interactive manner whether or not to delete data that has an old data registration date and is of low importance (step 203). If the deletion is not to be performed, the registration process is terminated. When the operator specifies "delete", the importance detection unit 4 searches the access frequency storage unit 5, and
The data registration date is old, the data is sorted in descending order of importance, the heading part of the corresponding data is extracted from the data storage section 3, it is made into a table, and it is displayed on the display 11 of the search operation section l via the search processing section 2. Display (step 104). The importance level is defined by the following formula.

Importance = mX number of searches + nX number of prints Here, m
” n is an appropriate constant whose importance can be changed depending on the total amount of data, the number of users, etc.

FIG. 4 shows an example of the display on the display 11 at this time.

Since data is displayed on the display 11 in chronological order of registration date, all the displayed data may not be deleted due to high access frequency. In such a case, the unnecessary data is searched for by directly inputting the registration date or by changing the display screen on the next screen, etc. (steps 106 and 105).

When the operator looks at the table displayed on the display and selects the number of the article that is considered to be of low importance and may be deleted, the search processing section 2 retrieves the corresponding article from the data storage section 3. Read out the content and display it on the display 11. Step 207) 1 Check with the operator to see if the article really can be deleted (Step 208). If it is an article that can be deleted, delete it, and the resulting data storage section 3 It is determined whether new data can be registered in the empty area (step 209). If the new data can be registered, the registration process is performed (step 210); if not, the process returns to displaying the table of deletion data candidates and repeats the deletion procedure.

It goes without saying that data deletion processing can be performed not only at the time of new registration, but also according to the operator's needs.

〔Effect of the invention〕

As explained above, in the present invention, when searching a database, the number of times the searched data is searched and the number of times it is printed (generally the number of outputs) is counted and recorded, and when the data is updated/registered, the registration date of the data is counted and recorded. By sorting and displaying data by number of searches and number of prints, it is easier for the operator to delete unnecessary data (older and less important articles), and at the same time, during subsequent database searches.

It has the advantage of greatly improving search efficiency, such as shortening search time and improving precision.

[Brief explanation of drawings]

FIG. 1 is a block diagram of an embodiment of the database device of the present invention, FIG. 2 is a processing flow diagram at the time of database search in FIG. 1, and FIG. 3 is a processing flow diagram at the time of new data registration in FIG. FIG. 4 is a diagram showing an example of displaying deletion data candidates. 1...Search operation section, 2...Search processing section, 3...
Data storage section, 4... Importance detection section, 5... Access frequency storage section. Figure 3

Claims (1)

[Claims] (1) In a database device that stores a database and searches and collates the database, means for recording the number of searches and the number of outputs of each piece of data searched in the past together with the registration date of the data; At the time of registration or at the request of the operator, each of the data retrieved in the past is updated with the recorded registration date,
A database device characterized by having means for sorting and displaying based on the number of searches and the number of outputs.