JP3429225B2 - Storage medium storing data search program - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data search device, and more particularly to updating a data storage unit.

[0002]

2. Description of the Related Art Today, a vast amount of information is stored in computers connected to the Internet. In order to obtain the information that the operator wants from such enormous amount of information, the applicant has discovered the information excavation program “Internet Boomerang.
^(TM) "was developed.

The operation of the computer in which such a program is installed will be briefly described. The operator
A specific URL (Uniform Resource Locatior) and information acquisition time are input as the information source in which the data desired to be acquired is stored. For example, the information source is "http: /
It is specified as "/www.justsystem.co.jp/news/taro/". By this, the specified URL "http: //www.jus
tsystem.co.jp/news/taro/ ”is stored as an information source. For the information acquisition time, for example, enter 03:00 every day. With this, the computer on which such a program is installed is set. When the information acquisition time "03:00" is reached, the file stored in this information source is read out and stored in the hard disk. If data is stored for each file in the hard disk, a search for search is performed. An area for storing the search terms and files is called an information box, and the source of information stored in the information box is U.
Not only the RL but also its own mailbox or folder can be specified.

The data search process will be described. The operator inputs an inquiry sentence to retrieve desired data from the data stored in his / her information box. A keyword for search is determined based on this inquiry sentence, the degree of similarity with the search term is calculated, and the search is performed. As shown in FIG. 11, the search results are displayed in the list display unit 1
Each document is displayed at 54 in the order of evaluation. Depending on the operator
When any document is specified, the content of the selected document is displayed in the view area 152.

In this way, the operator is interested in the U
The information existing in the URL is automatically stored in the own computer only by specifying the RL. Then, desired information can be searched and retrieved at a desired time.
Further, the information box can be automatically updated at a predetermined time by setting the information acquisition time. Therefore, the information box is a customized source of information for the operator.

[0006]

The data stored in the information box becomes more and more huge by the operator's designation or automatic patrol. As a result, data is accumulated in the hard disk regardless of whether the information is valuable as an information source or not. Therefore,
There is a problem that a huge storage area is required and that searching also takes time. In particular, when the hierarchy of the automatic patrol destination is a plurality of hierarchies and the files other than the same site are taken in, the above problem becomes serious.

In order to solve such a problem, the operator has
It is possible to check each information source with a browser and delete unnecessary ones. However, when there are many information sources, such work is very complicated.

The present invention solves the above problems and simplifies a data storage unit that collects files that are automatically updated based on information acquisition source data and schedule data, and
It is an object of the present invention to provide a data retrieving apparatus or method that can be updated accurately.

[0009]

Means for Solving the Problems and Effects of the Invention 1) In the recording medium storing the program according to the present invention, each file stored in the data storage unit has the original location where the file is acquired. Based on the information acquisition source data shown and schedule data for updating the file stored in the data storage unit,
The degree of non-use at the time of searching each of the files is calculated based on the hit history for the search condition, and the data in the data storage unit is refined. As described above, by refining the automatically updated data based on the degree of non-use with respect to a given search condition, the data in the data storage unit can be refined into data that matches the intention of the operator. it can. Therefore, the operator can refine the data without checking the contents of all the files. As a result, it is possible to prevent unnecessary data from being additionally stored one after another even in the data storage unit that is automatically updated.

In the recording medium storing the program according to the present invention, the refining process is executed in response to an instruction from the operator after notifying the operator of the degree of non-use. Therefore, the operator can confirm the details of the refinement processing.

In the recording medium storing the program according to the present invention, the refinement process is an automatic refinement process based on a predetermined rule. Therefore, the refinement processing is performed without the operator confirming the refinement content.

2) In the recording medium storing the program according to the present invention, the degree of non-use of each file is calculated based on the hit history of each file with respect to the search condition. Therefore, the refinement processing can be performed for each file.

3) In the recording medium storing the program according to the present invention, the degree of non-use of each file is calculated based on the hit history of each information acquisition source data.

Therefore, the refinement processing can be performed for each of the information acquisition source data.

4) In the recording medium storing the program according to the present invention, the refinement processing is deletion of a file specified by an operator's instruction or the automatic deletion file determination processing. In this way, by deleting the files that are not used for the search, the data in the data storage unit can be made the data that matches the search condition of the operator.

5) In the recording medium storing the program according to the present invention, the refining process does not update the file specified by the operator's instruction or the automatic deletion file determination process, and the information acquisition source data. Deleted. Therefore, the data of the information source that is not used for the search is not acquired, and the data that does not match the search condition of the operator is not updated from the data storage unit.

6) In the recording medium storing the program according to the present invention, together with the file to be deleted,
The information acquisition source data corresponding to this is also deleted. Therefore, the data is not acquired from the information source that is not used for the search, and the data that matches the search condition of the operator can be deleted from the data storage unit.

7) In the recording medium storing the program according to the present invention, together with the information acquisition source data,
Delete the corresponding file. This makes it possible to delete the data matching the operator's search condition from the data storage unit, and prevent the data from being acquired even from the information source not used for the search.

8) In the recording medium storing the program according to the present invention, the degree of non-use of each file is calculated based on the hit history of each file with respect to the search condition, and the file instructed by the operator is calculated. And the non-updatable information for not updating the file. Therefore, therefore, the data that does not match the operator's search condition is deleted from the data storage unit, and the data from the information source is not stored in the data storage unit.

9) In the data search device according to the present invention, 1) file storage means for storing a plurality of files,
2) Search condition input means for the operator to input search conditions, 3)
Retrieval means for retrieving a file containing a term that matches the retrieval condition among the files stored in the file storage means, 4) Obtaining information indicating the original location of the file stored in the file storage means Original data and update information storage means for storing schedule data for updating the file, 5) update means for updating the file based on the information acquisition source data and schedule data, 6) hit history for the search condition Based on the above, the search non-use degree calculating means for calculating the non-use degree at the time of searching each file, and 7) a refining means for refining the data in the file storage means based on the non-use degree. As described above, by refining the automatically updated data based on the hit history for a given search condition, the data in the file storage means can be refined into data that matches the intention of the operator. . Therefore, the operator can refine the data without checking the contents of all the files. This allows
Even when the data in the file storage means is automatically updated, useless data can be prevented from being stored one after another.

10) In the data search method according to the present invention, when a search condition is given, a file search method that specifies a file including a term that matches the search condition among the files stored in the data storage unit. Then, each file stored in the data storage unit, based on the information acquisition source data indicating the original location where the file was acquired, and the schedule data for updating the file stored in the data storage unit, It is automatically updated, and the degree of non-use at the time of searching each of the files is calculated based on the hit history for the search condition, and the data in the data storage unit is refined.

As described above, by refining the automatically updated data based on the hit history for the given search condition, the data in the data storage unit is refined into the data that matches the intention of the operator. be able to. Therefore, the operator can refine the data without checking the contents of all the files. As a result, useless data can be prevented from being stored one after another even in the data storage unit that is automatically updated.

11) In the data search method according to the present invention, when a search condition is given, the data search method specifies a file containing a term that matches the search condition among the files stored in the data storage unit. Then, the degree of non-use at the time of searching each of the files is calculated based on the hit history for the search condition, and the data in the data storage unit is refined. In this way, the data
By refining based on the hit history for a given search condition, the data in the data storage unit can be refined into data that matches the intention of the operator. Therefore, the operator can refine the data without checking the contents of all the files.

12) In the recording medium storing the program according to the present invention, the degree of non-use at the time of searching each of the files is calculated based on the hit history for the search condition, and the data in the data storage unit is refined. To be done. As described above, by refining the data based on the hit history for the given search condition, the data in the data storage unit can be refined into the data that matches the intention of the operator. Therefore, the operator can refine the data without checking the contents of all the files.

The correspondence between the terms used in the claims and the embodiments will be described below.

"File": This is a concept that includes not only so-called files that a computer grasps as one group when data is input and output, but also the smallest unit of the group that is displayed by extracting terms that match the search conditions. is there.

[Terms that match the search conditions]: In the case of keyword search, not only terms that match the directly input keyword but also terms that are related to the keyword may be used. Furthermore, in the case of a natural sentence search, for example, it may be an extracted keyword or a keyword specified by syntax or semantic analysis.

The term "refining" includes processing of deleting data, making data non-searchable, and the like, and further includes the case where the pre-refining data storage unit is left and the case where it is not left.

"File storage means": In the embodiment, the information box storage unit 26b corresponds to this.

"Data storage unit": In the embodiment,
The information box storage unit 26b corresponds to this.

"Information acquisition source data": In the embodiment, the information source specifying data of FIG. 5 is applicable.

"Schedule data": In the embodiment, the schedule data of FIG. 6 corresponds.

"Unupdateable information": In the embodiment,
Creation prohibition information is applicable.

[0034]

BEST MODE FOR CARRYING OUT THE INVENTION 1. Description of Functional Block Diagram One embodiment of the present invention will be described with reference to the drawings. The data search device 1 shown in FIG. 1 includes a file storage unit 3, a search condition input unit 5, a search unit 7, an update information storage unit 9, an update unit 11, a search disuse degree calculation unit 13, and a refinement unit 15. There is.

The file storage means 3 stores a plurality of files. The operator inputs the search condition to the search condition input means 5. The search unit 7 searches the files stored in the file storage unit 3 for a file including a term that matches the search condition. The update information storage means 9 stores information acquisition source data indicating the original location where the file stored in the file storage means 3 was acquired, and schedule data for updating the file. Update means 1
1 updates the file based on the information acquisition source data and the schedule data. The search disuse degree calculating means 13 calculates the degree of disuse at the time of searching each of the files based on the hit history for the search condition. The refining means 15 refines the data in the file storage means 3 based on the degree of non-use.

As described above, by refining the automatically updated data based on the hit history for the given search condition, the data in the file storage means 3 is refined into the data that matches the intention of the operator. be able to. Therefore, the operator can refine the data without checking the contents of all the files. Thereby, it is possible to prevent useless data from being stored one after another even when the data in the file storage means 3 is automatically updated.

As the information acquisition source data, TCP is used.
Although the URL in / IP is adopted, any URL may be used as long as it indicates a file arrangement position in a computer connected to the network.

Although the display means is adopted as the notification means, other notification means may be adopted.

2. Hardware Configuration The hardware configuration of the data search device 1 shown in FIG. 1 will be described. FIG. 2 shows the data search device 1 shown in FIG.
An example of the hardware configuration realized using PU is shown.

The data retrieval device 1 includes a CPU 23, a memory 27, a hard disk 26, a CRT 30, an FDD 25,
A keyboard 28, a mouse 31, and a bus line 29 are provided. The CPU 23 controls each unit via the bus line 29 according to the control program stored in the hard disk 26.

This control program is stored on the flexible disk (F
D) It is read from 25a and installed in the hard disk 26. In addition to the flexible disk, from a computer-readable recording medium in which programs such as a CD-ROM and an IC card are substantially integrated,
It may be installed on the hard disk. Furthermore, you may make it download using a communication line.

In this embodiment, the program is installed from the flexible disk to the hard disk 26 so that the program stored in the flexible disk is indirectly executed by the computer. However, the program stored in the flexible disk is not limited to this.
It may be directly executed from. Note that programs that can be executed by a computer include programs that can be directly executed simply by installing them as they are, and programs that need to be converted to another form (for example,
It also includes those that can be executed in combination with other module parts, such as decompressing data compressed data).

The hard disk 26 is a storage device having a program storage unit 26a, an information box storage unit 26b, and an information box creation data storage unit 26c. The program storage unit 26a stores a program to be described later.

The information box storage section 26b stores two information boxes: an information box "My hobby" and an information box "fishing information". Each information box is composed of a file storing data for data search and an extraction term generated from this file for search. Note that each information box is handled by the CPU 23 as one file. FIG. 3 shows the data structure of each file. For example, the file "http: //www.tur
"i.co.jp/news/A.html" stores the contents of "... fishing ... ayu ...", the term numbers extracted from this file, and the number of hits. There is. FIG. 4 shows the data structure of the extraction term. The first extraction term "fishing" stores the extraction file name and its extraction position. This makes it possible to specify in which file and in which position a certain term exists, and to specify which term was extracted from each file. The number of hits will be described later.

When a new file is stored, a term is extracted from the data of the file according to a predetermined extraction rule, and if it is a term already extracted from another file, the extraction file name and extraction position are added. However, if it is a new term, it is added to the extracted term table of FIG.
This facilitates the management of terms extracted from each document, and can reduce the total data volume as compared with the case where the extracted terms are stored for each file.

The information box creation data storage unit 26c stores information box creation data corresponding to each information box stored in the information box storage unit 26b. The information box creation data is composed of information source specifying data, which is information acquisition source data, and schedule data. The data structure of the information source specifying data of the information box "fishing information" is shown in FIG. In FIG. 5, a plurality of information sources forming the information box “fishing information” are stored.

The data structure of the information source will be described.
The “information source id” indicates the id of the information source. In FIG. 5, the No. 1 information source is “http://www.turi.co.jp/news”.
/index.html "and the URL of the website (hereinafter, URL
Abbreviated). The information source of No. 2 is the folder "D: \ DOCS / fishing" on the local disk. No3 information source is "Mail-OLX: /// Inbox /"
And the mailbox name. What is OLX?
Indicates the email software "Outlook Express (trademark)" manufactured by Microsoft Corporation. The information source of No. 4 indicates the bookmark of the browser. "NS4: // user / nishi"
Is "user / nishi" of browser "Netscape 4"
Shows the bookmark folder. The information sources of Nos. 5 and 6 are indicated by URLs like the information source of No. 1.

The "type" indicates the type of information source, and is one of "web", "file", and "mail". A web type is a bookmark (=
It indicates whether it is specified by 2) or URL (= 1). The “subfolder” indicates that when the information source is a folder, the subfolder in the lower hierarchy is targeted (= 1) or not targeted (= 0). For example, the No. 2 information source is the files stored in the folder “D: \ DOCS /” and all the files stored in all its subfolders. The “hierarchy” indicates up to which hierarchy the linked file is used as an information source. For example, the number 1 information source is "layer" = 1, so "http://www.turi.co.jp/news/index.html"
If the data is as shown in Fig. 6, the file linked from the file is http://www.turi.co.jp/
news / index.html / A.html, file http: //www.turi.c
o.jp/news/index.html/B.html, file http: //www.tu
Three files of ri.co.jp/news/index.html/C.html are targeted. “Only same site” indicates whether the link destination is limited to the same site (= 0) or not (= 1). For example, if the link destination is limited to the same site, even if the file in the temporarily specified hierarchy,
Files on other sites are not sources.

As described above, the information source id can directly specify the URL as well as indirectly specify the URL like a bookmark folder. Also, the file can be designated directly or indirectly by designating the folder to which the file belongs.

FIG. 7 shows schedule information. Figure 7A
Is schedule information in the information box "fishing information", the update type is "every Saturday", and the update time is "0".
3:00 ”, indicating that the updating method is“ addition ”. The update method "addition" is a method of adding the added data to the table shown in FIG. 3 and setting the deletion flag for the reduced data so that the updated data is not actually a search target. Say. As explained above,
In the information box creation data, the collection source and the collection method of the corresponding information box data are set, and when the information box creation data is newly set, a new information box is generated based on this. . The information box creation data has a function as stored data restoration information.

The information box "my hobby" and the information box creation data "my hobby" are also stored in the same data structure. The schedule information of the information box creation data “my hobby” will be described with reference to FIG. 7B. In this schedule information, the update method is “recreate”. The update method “re-creation” means that the existing tables in FIGS. 3 and 4 are discarded and re-created. In the case of re-creation, a wasteful area does not occur in the data amount, but the time until the end of updating becomes long. On the other hand, as shown in FIG. 7A, when data is added, a wasteful area is generated in the data amount, but the time until the end of the update becomes short.

The memory 27 also stores various calculation results and the like.

Recording of the number of hits shown in FIG. 3 will be described. The hit count indicates how well the file matches the operator's inquiry. At the time of search, the operator inputs, for example, an inquiry sentence “I want to know recommended points for surf fishing in June” in order to retrieve desired data from the data stored in the information box of the operator. Based on this inquiry sentence, the keyword "June, surf fishing, points" for search is determined, the similarity with the search term extracted from each file is calculated, and the search is performed. If the extracted terms extracted from each file match one or more of the search keywords, the hit count of the file is incremented by one.

3. Flowchart Next, the program storage unit 26a of the hard disk 26
The programs stored in will be described with reference to FIGS. Hereinafter, a case of refining the data of the information box “fishing information” will be described.

The operator operates the refinement start switch (not shown).
Click with the mouse. As a result, the CPU 23
The files are sorted in descending order of the number of hits shown in FIG. 3 and displayed on the CRT 30 (step S5 in FIG. 8). An example of the display is shown in FIG.

The CPU 23 determines whether or not a detailed display command is given to a certain file (step S
7). When the detailed display command is given, the CPU 23 displays the content of the specified file in the view area (not shown) (step S9). In the present embodiment, the detailed display command is given by double-clicking the left mouse button on the area where the file name is displayed.

Further, the CPU 23 determines whether or not a deletion instruction is given for a certain file (step S11). When the deletion instruction is given for a certain file, the CPU 23 deletes the designated file and Creation prohibition information indicating that the creation is prohibited is stored in the hard disk 26 (step S13). The creation prohibition information will be described later. The CPU 3 determines whether or not an end instruction is given (step S15), and when the end instruction is given, the manual deletion process ends. CP
If the end command is not given, U23 carries out step S7.
The following processing is repeated.

As described above, with respect to the file storing the data which does not meet the operator's search intention, the file can be easily deleted with reference to the file list sorted in the order of the number of hits. This allows the information box to be refined to match the user's search intention.
That is, it is possible to provide a refinement assisting tool for refining an information box that stores information that is in line with an individual's interest, according to the operator's intention.

Note that threshold values may be set in advance in the list display shown in FIG. 9, and those exceeding the threshold values may be excluded from the display target. In this way, by displaying only the files that are equal to or less than the threshold value, it is possible to quickly determine whether or not the files are to be deleted. For example, only files with a predetermined hit count or less may be displayed.
In the above embodiment, the case where the operator deletes unnecessary files while checking the contents has been described, but it is also possible to automatically delete the unnecessary files. FIG. 10 shows a flowchart for performing automatic deletion.

The CPU 23 sorts the files in descending order of the number of hits (step S21 in FIG. 10). The processed file number i is initialized (step S23), and it is determined whether the number of hits of the i-th file is smaller than a predetermined threshold value (step S25). The threshold value is, eg, 5 times. If the number of hits for the i-th file is less than or equal to a predetermined threshold,
The file is deleted and the creation is prohibited (step S27). Then, it is determined whether or not there is an undetermined file (step S29). On the other hand, if the hit count of the i-th file is not less than or equal to a predetermined threshold value, the process of step S27 is not performed. Then, it is determined whether or not there is an undetermined file (step S29). If there is a file that has not been determined, the processing file number i is incremented (step S31), and the processing from step S25 onward is repeated.

By thus setting the threshold value in advance, it is possible to automatically delete a file having a small number of hits from the information box.

The creation prohibition information regarding the deleted file will be described. The information box is updated at the set time based on the information source specifying data shown in FIG. 5 and the schedule information shown in FIG. 7. Here, if the URL or file is directly specified as the information source id, when deleting the file in the information box, if you delete this for the corresponding information source, the deleted file will be in the information box. It will not be recreated. However, when the information source id is indirectly specified by the bookmark folder or the folder on the local disk, it is not easy to change the information source specifying data so that only the deleted file is not updated. Therefore, in the present embodiment, once all the files are collected based on the information source specifying data and then stored in the information box, the file names that are prohibited to be created are selected as the filtering condition, and the files that match this are selected. Tries not to write in the info box. As a result, even if the information source id indirectly specifies the file, only the necessary file can be updated.

When a URL or a file is directly specified as the information source id, each information source in the information box may be deleted.

The operator may specify each of the above threshold values.

As described above, regarding an information box created by patrol a website by automatic patrol, even if a meaningless file is stored in the retrieval process of the person who searches the information box, all files are stored. The operator will consider the content and will be deleted.

In the above embodiment, the case where the number of hits is small is targeted for deletion, but the case where the number of hits is large may be targeted for deletion. For example, a table of contents page such as a link collection. Whenever it is displayed in the search result every time, this possibility may occur. Even in such a case, this can be displayed and the operator can be alerted. For example, "This file is always referenced, but is it an unnecessary file?" May be displayed. As a result, by setting that file as the creation-prohibited file, it is possible to store only the files in the lower hierarchy required by the operator in the information box.

In the present embodiment, at the time of search, it is judged whether or not there is a hit term for each file, and if there is, the hit count is added up. When a manual refinement command is given, the information box is displayed. The stored files are sorted and displayed in the order of the number of hits, and when the operator gives a deletion command, the files are deleted. As a result, it is possible to notify the operator of files that may be preferable to be deleted, and unnecessary files can be deleted without the operator having to check the contents of all files. Therefore, with respect to the automatically updated information box, the information box can be refined so that the information that matches the interest of the operator is collected.

5. Other Embodiments In the above embodiment, the degree of non-use at the time of searching each file is calculated based on the hit history of each file. However, for each information present specific data shown in FIG. The hit history may be obtained, and based on this, it may be determined whether or not the file is to be deleted.

Further, in the present embodiment, as the refining process, the file in the information box is directly deleted, but it may be deleted indirectly by deleting the information source specifying data. Especially as an update method,
When the data is recreated (see FIG. 7B), the old data is automatically deleted by the update, so it is not necessary to delete the data in the information box. When the re-creation is not performed, the corresponding file may be deleted together with the information source specifying data.

Further, not only the file in the information box but also the information source specifying data corresponding thereto may be deleted.

Although the number of hits is used as the hit history in this embodiment, any data may be used as long as it indicates whether or not it matches the search tendency of the operator. Alternatively, the total hit rate obtained by adding the hit rates may be adopted. Further, in the present embodiment, the number of hits is 1 for an inquiry regardless of the number of hit terms. However, in the case of a file in which a plurality of terms are hit, only one hit is made. The number of hits may be increased.

The hit history may indicate the information relevance of each file with respect to the operator's inquiry text.

It is also possible to adopt both the manual deletion process and the automatic deletion process to automatically determine the deletion candidate by a threshold value, and to delete the deletion candidate while the operator confirms it.

As already described, since each information box is handled as one file, deletion from the information box of a file with a small number of hits
You can delete unnecessary records in record units. In this embodiment, each information box is treated as one file, but each record is treated as one file.
The file may be a collection of a plurality of files.

Further, in this embodiment, when the mailbox is used as the information source, the following is done. Ordinary mail software does not manage each mail as a file, but handles an inbox (inbox), an outbox (outbox), a trash can, etc. as one file. Therefore, when storing in the information box, each mail is divided into files, and the files are named and stored. Then, the retrieved mails are displayed by displaying the text data of each file in a viewer program. That is, in the present embodiment, each file matches the file concept managed by the computer. However, the present invention is not limited to this, and it is also possible to grasp as a file a minimum unit of a group smaller than a file normally managed by a computer. For example, an inbox storing a plurality of emails may be stored in the information box as a single file, and the retrieval and display may be performed for each email when searching. As described above, in the present specification, a file also includes a unit of the minimum unit of a unit in which terms that match the search condition are extracted and displayed.

The same applies to the communication log.

In the present embodiment, regarding the HTML file, as shown in FIG. 11, when the document displayed in the list display section 154 is clicked, the corresponding browser is activated and the contents of the file are displayed in the view area 152. Is displayed. On the other hand, when the mailbox is set as the information source, each mail is stored as one file, and if there is a display command, the text data of the filed mail is displayed. Therefore, regarding the display format (for example, ruled lines, etc.) that is not supported at the time of text conversion, the content confirmation is performed as follows. Start the mail software, find the mail yourself, and open the mail. As described above, in the case of the mail software, the work is complicated unlike the normal HTML file. However, in the search device according to the present invention, since the mails to be checked by the operator are narrowed down based on the search result in advance, such complicated processing can be avoided.

Further, the search condition for refining is not a search result after a certain information source is added, but
It is also possible to store past inquiry texts up to the time of addition and use this for examination. Further, in the present embodiment, the case where the pre-refining data storage unit is not left as the refining process has been described, but another data box may be generated by leaving it.

In this embodiment, the case of a Japanese document has been described, but the present invention can be similarly applied to other languages such as English, German, Chinese, and Korean.

In this embodiment, in order to realize the function shown in FIG. 1, the CPU 23 is used and this is realized by software. However, some or all of them may be realized by hardware such as a logic circuit.

[Brief description of drawings]

FIG. 1 is a functional block diagram of a data search device 1 according to the present invention.

FIG. 2 is a diagram showing an example of a hardware configuration of the data search device shown in FIG.

FIG. 3 shows a data structure of a file stored in an information box.

FIG. 4 shows a data structure of an extraction term for search stored in an information box.

FIG. 5 shows a data structure of information source specifying data.

FIG. 6 shows the contents of an HTML file stored in an information box.

FIG. 7 is schedule information for updating an information box.

FIG. 8 is a flowchart of a manual deletion process.

FIG. 9 is a display example showing the number of hits of each file in the manual deletion process.

FIG. 10 is a flowchart of automatic deletion processing.

FIG. 11 is an example of a display screen of an information search tool “Internet boomerang”.

[Explanation of symbols]

23 ... CPU 27 ... Memory

─────────────────────────────────────────────────── ─── Continuation of front page (58) Fields surveyed (Int.Cl. ⁷ , DB name) G06F 17/30-17/30 419 G06F 12/00 546 JISST file (JOIS)

Claims (11)

(57) [Claims] 1. When a search condition is given, a program for realizing, using a computer, a data search device that specifies a file containing a term that matches the search condition among files stored in a data storage unit is stored. In the recording medium, each file stored in the data storage unit includes information acquisition source data indicating an original location from which the file is acquired, and schedule data for updating the file stored in the data storage unit. Based on the hit history for the search condition, the degree of nonuse of each file at the time of retrieval is calculated, and the information acquisition source data is refined based on the degree of nonuse. A recording medium storing a program to be executed by the computer. 2. A recording medium storing the program according to claim 1, wherein the degree of non-use of each file is calculated based on the hit history of each file with respect to the search condition. 3. A recording medium storing the program according to claim 1, wherein the degree of non-use of each file is calculated based on the hit history for each information acquisition source data. 4. A recording medium storing the program according to claim 1, wherein the process of refining the information acquisition source data notifies the operator of the degree of non-use and A file to be deleted is specified from the files stored in the data storage unit based on an instruction from the operator regarding the degree of use, and the information acquisition source data is deleted so as not to update the specified file. What to do. 5. A recording medium storing the program according to any one of claims 1 to 3, wherein the processing for refining the file stored in the data storage unit is based on the degree of non-use. The file to be deleted is specified from the files stored in, and the information acquisition source data is deleted so as not to update the specified file. 6. A recording medium storing the program according to claim 4, wherein the information acquisition source data to be deleted and the corresponding file are deleted. 7. A recording medium storing the program according to claim 1, wherein the processing for refining the information acquisition source data notifies the operator of the degree of non-use, and the operator responds to the notified degree of non-use. Based on the instruction, specify the file to be deleted from the files stored in the data storage unit, delete the specified file, and store the non-updatable information to prevent the file from being updated, and the automatic update after the next time. Is performed based on the non-updatable information, the information acquisition source data, and the schedule data. 8. A file storage unit for storing a plurality of files, a search condition input unit for an operator to input a search condition, and a term stored in the file storage unit that matches the search condition. Retrieval means for retrieving a file, information acquisition source data indicating the original location where the file stored in the file storage means was acquired, and update information storage means for storing schedule data for updating the file, the information acquisition source Based on data and schedule data
An update means for updating the file, a search disuse degree calculating means for calculating a degree of nonuse at the time of searching each of the files based on a hit history for the search condition, and the information acquisition based on the degree of nonuse. A data retrieval device equipped with a refining means for refining the original data. 9. A data search method using a computer, which specifies a file containing a term that matches the search condition among files stored in a data storage unit when the search condition is given. Each file stored in the storage unit is automatically updated based on information acquisition source data indicating the original location from which the file was acquired and schedule data for updating the file stored in the data storage unit, A data search using a computer, which calculates a degree of non-use at the time of searching each file based on a hit history for a search condition, and refines the information acquisition source data based on the degree of non-use. Method. 10. A data search method using a computer, which specifies a file containing a term that matches the search condition among files stored in a data storage unit when the search condition is given. Based on the hit history for the condition, the degree of non-use at the time of searching each of the files is calculated, and the file is updated based on the degree of non-use .
Information acquisition source data, and the file was acquired
A data retrieval method using a computer, characterized by refining information acquisition source data indicating the original location . 11. A program for realizing, using a computer, a data search device that specifies a file including a term that matches the search condition among files stored in a data storage unit when the search condition is given. A recording medium, which calculates a degree of non-use at the time of searching each of the files based on a hit history for the search condition, and updates the file based on the degree of non-use .
Information acquisition source data, and the file was acquired
A recording medium storing a program for causing the computer to execute a process of refining information acquisition source data indicating the original location .