JP2001318813A - Method for managing data - Google Patents

Abstract

PROBLEM TO BE SOLVED: To efficiently output data, and to reduce the capacity consumption of a storage device. SOLUTION: In the case of data which can be made pertinent to a retrieval condition for the first time, the address information on the data is stored in a storage device, and the data are fetched, and the registering period is stored. Then, the storage device is retrieved, and the pertinent address information is displayed, and the number of times of access of the selected data is counted. When any data are not present in the storage device, the data are fetched from the web site of an Internet based on the address information, and when the data are present in the storage device, the data are read.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention stores data in accordance with the access frequency and deletes the data in accordance with the access frequency as necessary, thereby efficiently outputting data of Internet websites. The present invention relates to a data management method capable of reducing the capacity consumption of a storage device.

[0002]

2. Description of the Related Art Internet services include:
A typical example is a search service for an Internet website (hereinafter, referred to as a website). This search service is performed by a program called a search robot that extracts a website having a specific search word in a database.

[0003] When a search service traverses websites on a database by a search robot and extracts websites having specific search terms, the addresses of the websites and predetermined summary information (for example, search keywords are entered). And text information including the information of the web site, and outputs the extracted website address and predetermined summary information.

[0004] Apart from the above, in such a search method, Japanese Patent Application Laid-Open No. 11-328
No. 203 proposes a method of performing a search using kansei information as a specific search word. According to this method, a specific search word, that is, an image other than text described in a website, for example, an image on a website It is possible to collect image data based on the appearance (sensitivity) information of the user and construct a database.

Japanese Patent Laid-Open Publication No. Hei 7-306802 discloses a technique for judging the necessity or unnecessary of data stored as a predetermined database based on the frequency of access to the predetermined database, and storing data having a high access frequency in a secondary storage medium. According to this method, the backup time can be reduced, the secondary storage medium can be effectively used, the database area can be effectively used, and the recovery time for data comparison can be reduced and the evacuation work can be performed. Simplification is possible.

[0006]

By the way, various kinds of image data are recorded on a website. Generally, a large amount of image data is collected and all the data is stored in a predetermined storage device (server) or a user's own. Storing in the storage device of the (used) terminal requires a large cost in order to increase the capacity of the storage device and the hardware configuration of the storage device and the like.

[0007] Accordingly, Japanese Patent Application Laid-Open No. 11-328203 describes the above.
No matter how efficiently the desired data can be extracted, as in the case of (1), it is not desirable to be restricted by hardware in the subsequent management. Also, as described in Japanese Patent Application Laid-Open No.
No. 6802 solves the problem that a large-capacity storage device is required because the unnecessary data stored in the storage device is stored without being deleted even though the backup device decides what is deemed necessary based on the access frequency. I can't say it was done.

The present invention solves the above problem, and stores data according to the access frequency and deletes the data according to the access frequency, thereby efficiently outputting the data of the Internet website. It is an object of the present invention to provide a data management method which can perform the data management and can reduce the capacity consumption of the storage device.

[0009]

In order to achieve the above object, the data management method of the present invention counts the number of accesses to data, and performs subsequent processing based on the frequency of access to the data, for example, The data was stored and the data was deleted. By doing so, data can be output efficiently and the capacity consumption of the storage device can be suppressed.

[0010]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention performs a search, retrieves data from a website on a network such as the Internet, reads data from a storage device, and stores necessary data in a storage device. A data management method for deleting important data, if the search range is not only in the storage device, search on the Internet,
Determine whether the website has data,
If the data is on the website, store the address information in the storage device, fetch the data, store the registration time, and then, or if the search range is only in the storage device, search the storage device and The address information to be accessed is displayed, the number of accesses to data selected from the address information is counted, and if the data is in the storage device, the data is read out. If the data is not in the storage device, the Internet is read based on the address information. It takes in data from websites.

In the present invention, "data" refers to information itself taken from a website on the Internet or read from a server ("storage device" described below) connected to a network such as the Internet. means.

"Address information" means the location of data on a website on the Internet for data. Since the address information is a character string in appearance, it may not be clear what data is included in the address information when displaying the screen.

In this case, for example, a state in which the outline of the information is known in the address information, such as, for example, a brief description of the contents, search information, or a reduced coarse image (hereinafter, referred to as a thumbnail) of the data. By displaying the "summary information", associating (linking) the summary information with the address information, and selecting and operating the summary information, it is possible to directly access the data on the Internet (or in the storage device). You should be able to do it.

The "storage device" refers to a general hard disk (including a removable medium) in a server connected to the Internet. Then, the “database” is, for example, in advance, collects data from the website by some search method including a known technique, and, for the collected data, address information, information described in a text portion of the website, an image attached to the website. This means a record in which items such as information are registered in a predetermined order.

According to the present invention described above, when data is accessed by performing a search, the data corresponds to the search condition for the first time, and the address information is not stored in the storage device. If you want to display and output data from the search result instead of the relevant one, read the data from the storage device, retrieve the data from a website on the Internet, and store or delete the data in the storage device And is characterized by the following points.

That is, in the case of data that first satisfies the search condition, the address information of the data is stored in the storage device, the data is fetched, the registration time is stored, and then the search is performed in the storage device. , Displaying the corresponding address information, counting the number of accesses for the data selected from among them, and when the data is not in the storage device, fetching the data from the Internet website based on the address information, If the data is in the storage device, the data is read.

As described above, data that first meets the search condition is taken in and the address information and the registration time are stored. On the other hand, the data is not the first data that matches the search condition but is stored in the storage device. The number of accesses to data or data not in the storage device (that is, data for which address information has already been stored) is counted at the time of access by display operation such as output. The access frequency and transition of data based on time can be grasped, and detailed and appropriate data management can be performed. Note that “access” in the present application does not mean that the search condition is satisfied.
For example, this means that an operation such as screen display has been performed.

Further, according to the present invention, in the above method, when the number of times of accessing data reaches a predetermined number, the data is stored in the storage device in addition to the address information.

Here, in the present invention, when the search condition is satisfied for the first time, the registration time is stored together with the address information as described above, so that the data can be accessed thereafter based on this address information. Then, when access to the data is repeated, only the count is updated (increased).

The frequency of access to the data can be determined from the number of accesses in a predetermined period from the registration time. Therefore, according to the above method, the number of accesses to the data fetched from the website is determined in the predetermined period. When the number of times has reached, if the data is stored in the storage device as frequent data, the data can be instantly read from the storage device without connecting to the Internet each time.

On the other hand, when the number of accesses to the data taken from the website has not reached the predetermined number, the data is not stored in the storage device as ad hoc infrequent data. The consumption of the capacity of the device can be suppressed.

Further, according to the present invention, in any of the above methods, when data not stored in the storage device is fetched from a website on the Internet, if it is determined that the fetching time requires a predetermined time or more, the address information In addition, the data is stored in a storage device.

When collecting data, if the transfer capacity of the data taken from the website is large, the access time may be long. Such a prolonged access time causes inconvenience in outputting data efficiently in addition to the communication cost of the metered system simply caused by the Internet connection.

Therefore, in the present invention, in addition to storing data in the storage device based on the access frequency described above, data that is determined to require a predetermined time to be taken in for the first access is added to the address information. In this way, the data is stored in the storage device to solve the above-mentioned problem, and the efficiency is further improved.

By the way, if the data collection and the data search for the database are repeated as described above, for example, when the database is viewed for a predetermined period, the new data stored exceeding the predetermined number of accesses during the period is stored in the database. There is data that is not accessed at all even though the data is stored in the storage device outside the period, and the storage capacity gradually decreases due to continued storage of the data.

Therefore, according to the present invention, in any one of the above methods, when the number of accesses to the data read from the storage device is smaller than the predetermined number in a predetermined period,
The address information and the data are deleted from the storage device.

In the above-described method, the number of accesses is biased, that is, data having a high access frequency and data having a low access frequency within a predetermined period are determined. The data and the address information, that is, the corresponding record in the database are deleted from the storage device by determining that the data is not infrequent.

In this manner, only data (records) that are frequently accessed at all times are stored in the storage device, and frequently accessed data is immediately stored in the storage device without being connected to the Internet. Can be read and output, but by not storing low-frequency data in the storage device, it is possible to suppress consumption of capacity in the storage device.

That is, according to the method of the present invention, the access frequency is continuously monitored, and only the data that is truly necessary (frequent) is stored in the storage device and newly stored. (Low) is not stored in the storage device, and even if it is stored, data that is less than the predetermined number of times in the predetermined period is deleted based on the number of accesses, so that the data can be read with high efficiency and stored. It is possible to suppress an increase in the capacity of the device.

Further, according to the present invention, in any one of the above methods, when the number of accesses in a predetermined period is smaller than the predetermined number of steps, the data and the address information are sequentially stored in the storage device according to the step. It is to be deleted.

As described above, according to the present invention, the data to be deleted is given a certain period of time, and the items to be deleted are made different according to the predetermined number of times set in stages. Even if data is deleted due to low address, if there is access in the next period, it is possible to access the data immediately because address information remains compared to when all data is deleted at once. become able to.

When "summary information" is added together with the address information and the data is deleted step by step, and the address information and the summary information are left, the content of the data is confirmed from the remaining summary information. This makes it possible to determine whether or not access to the data is necessary.

Further, according to the present invention, in any one of the above-mentioned methods, the data stored in the storage device is stored in a compressed state and decompressed when read out, so that frequently accessed data is stored. Can be stored in the capacity of a predetermined storage device even if the volume of the storage device becomes enormous, and the storage device can be used efficiently.

According to the present invention, in any one of the above-mentioned methods, if the period during which data is stored or deleted in the storage device and the number of accesses can be changed according to the capacity of the storage device, data having a high access frequency can be obtained. When it increases or conversely decreases, it can be adjusted optimally according to the capacity of the storage device, and the storage device can be used more efficiently.

[0035]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of a data management method according to the present invention will be described below with reference to FIGS. FIG. 1 shows a hardware configuration employing the data management method of the present invention.
FIG. 2 shows a data storage state (hereinafter, referred to as a data storage state) in a database stored in a storage device of the database management method of the present invention.
The line is called a record). 3 to 6 show a data management procedure in the database management method of the present invention.

In FIG. 1, the data management method of the present invention is adopted in the following hardware configuration in the present embodiment, and in the present embodiment, data will be described as an image file. Internet 1 has
An innumerable web server 2 which stores web sites for supplying various information is connected, and a server 3 is connected to a side which takes in an image file as data.

The server 3 has, for example, a LAN (Local Ar
An intranet is constructed by connecting a plurality of client personal computers P (hereinafter, referred to as personal computers P) each having a main body, an input device, a display device, and the like, which are output terminals, by an ea Network). Server 3
An image file that is frequently accessed and an image file that takes time to capture (corresponding to “data” of the present invention) are stored by the procedure described below.

The server 3 has monitoring means for changing the period for storing or deleting an image file and the number of accesses according to the remaining storage capacity of the server 3 in a procedure described later. In other words, by doing this, when the number of frequently accessed image files increases or decreases, the number of image files frequently accessed can be adjusted optimally according to the remaining storage capacity of the server 3. It can be used efficiently.

Further, the server 3 is set so as to compress the stored image file and decompress it when reading out the compressed image file. By doing so, even if the number of frequently accessed image files becomes enormous, the image files can be stored in a predetermined capacity of the server 3, and the server 3 can be used efficiently.

The server 3 stores a database 4 in which records classified into items as shown in FIG. 2 are stored. One record of this database 4 is an ID indicating an identification number of the record in order from the left in the figure. Item 4a;
URL (Universal) indicating the address of the website
Resource Locator) item 4b, a registration period item 4c in which an address is registered, a thumbnail name item 4d, an image file name item 4e, and an image file name item 4e, for example, in a unit of a predetermined period because image data is used as data as summary information in this embodiment. In this term including the current time item 4f, the previous term access number item 4g, and the last two term access number item 4
h is registered. Although not shown, search information is also stored in association with the search information.

In the database 4, the registration term item 4c
In this embodiment, a flag indicating whether the address of the website is registered is registered in the present embodiment, the previous period, or the period before the previous period. The flag is automatically registered when the address is registered. This is used for determining whether or not to delete an image file described later.

For example, in the database 4 in this embodiment, “1” is registered as the registration term item 4c in the case of this term registration. Then, when the record of the database 4 is checked at the beginning of the next period, the registration period item 4c becomes “1” →
It is changed to “2”. Note that "2" indicates registration in the previous term. Registrations before the second or earlier period are regarded as old registrations, and at the time of the above check, the registration period item 4c is changed from “2” to →
Change to “0”. Therefore, the registration term item 4c is changed from “1” →
"2" changes to "0".

Then, as described above, the registration term item 4c
Is used to set and determine when to delete an image file. For example, in FIG. 5 and FIG. 6 to be described later, an image file whose access count is less than a predetermined count is deleted for a record whose registration term item 4c is “0”, that is, a record registered before or before the last term. The procedure is as follows.

In the thumbnail name item 4d, the name of a thumbnail image (including a storage location) obtained by reducing the image file as the summary information into a coarse image is registered, and is stored in the server 3 in the database 4 together with the address together with the address. Is done. Then, the thumbnail image is output to the personal computer P according to the search result of the database 4. By operating (for example, clicking) the thumbnail image output to the server 3 on the personal computer P, the image file stored in the server 3 is read out, and the image file not stored in the server 3 is read from the Internet. Websites.

In the image file name item 4e, the storage location and file name of the full image which is not reduced to a coarse image in the present embodiment is stored when the image on the website is stored in the server 3. The stored image file is used for displaying a search result, and an image file of the server 3 is output by operating an address or a thumbnail image at the time of access.

The number of accesses of the current term item 4f is counted up when an image file is accessed during the period, and the number of times is input to this item. In the previous term access count item 4g, the value of the current term access count item 4f is copied at the beginning of a new term. Similarly, the value of the previous access count item 4g is copied into the second last access count item 4h at the beginning of a new period.

That is, “this term” of the current term access count item 4 f means that the latest period is in progress, and “previous term” of the previous term access count item 4 g means the unit period immediately before this term.
The “previous period” of the number of access times item 2h before the last period means the unit period immediately before the previous period (two units before the current period).

The access count item 4h before last period is left if there is a situation in which it is desired to see the transition of the number of accesses, and the number of items may be increased so that data for a previous period may be left. In the records of the database 4, the unit access period 4f, the previous period access number 4g, and the access unit 4h before the last period can be changed in unit period as needed. unit,
It can be set flexibly according to needs, such as every 10 days.

In the above configuration, a search and display output procedure will be described with reference to FIGS. In the flowchart of FIG. 3, collection of image files is performed by using any search method including a known technique. As another method, an item in which additional information for search is registered may be prepared in a record of the database 4. The items of the search information may be based on known keywords, sensibility, etc., and are associated with the items of the record so that they can be referred to each other.

In the search, a search condition is input from the personal computer P, the search is executed by the server 3 through the network, and the result is received. When the search result is other than “not applicable”, one or more applicable conditions are obtained. By displaying the thumbnail image and operating the thumbnail image, the location of the associated image file (the image file name, or the address if there is no image file name) is accessed, and the image file is displayed on the screen of the personal computer P. . Hereinafter, this procedure will be described in detail.

In FIG. 3, when various search conditions are input (# 1) and subsequently a search range is input (# 2), if the search range is only server 3 (YES in # 3), it will be described later. Proceed to # 21 in FIG. On the other hand, if the search range is not limited to the server 3 (NO in # 3), the web site on the Internet is searched (# 4).

Then, it is determined whether there is an image file corresponding to a website on the Internet (#
5) If the image file is on the website (YES at # 5), then it is determined whether the address and the thumbnail image are on the server 3 (# 6), and if the address and the thumbnail image are not on the server 3 (NO in # 6), the image file on the website is accessed (# 7).

Here, if there is no image file on the web site in # 5 (NO in # 5), and if the address and thumbnail image are in the server 3 in # 6 (Y in # 6)
ES) proceeds to # 12 described later.

On the other hand, when the image file reaches # 7 in the procedure up to this point, it means that the image file satisfies the search condition for the first time. Is calculated (# 8), an address and a thumbnail image are registered, and a registration period flag is set (# 9).

In step # 9, in the database 4, the number of records is increased and an ID number 4a is assigned an identification number, and a URL item 4b and a thumbnail name item 4d are registered in the increased record. And “0” are registered in the current access count item 4f. That is,
In the case of # 9, since the image file was merely registered as a "candidate" in the database 4 because the search condition was satisfied, and the image file was not actually accessed,
0 is registered in the access count item 4f for the current term.

Subsequently, in # 10, it is determined whether or not the capturing time calculated in # 8 is longer than a predetermined time.
If it is longer than the predetermined time (YES in # 10), the image file is stored in the server 3. On the other hand, if it is not the predetermined time in # 10 (NO in # 10), the process proceeds to # 12 described later.

In steps # 10 and # 11, if an image file that requires a predetermined time or more to be taken in is taken in from the website one by one, the time required to display the image file becomes longer and the efficiency is poor. The image files are stored in the server 3. By doing so, the efficiency can be improved, and the communication cost of the pay-as-you-go system can be suppressed.

As described above, in the processing from # 1 to # 11,
If there is no image file corresponding to the search condition on the server 3 instead of the server 3, as described later, the image file is fetched by accessing the image file (if the number of times is less than the predetermined number, the server 3 stores the image file). Of course, the address and the thumbnail image are registered and the registration period is set, so that the database 4 is enriched, and subsequent access to the image file can be stopped by searching the server 3. Thus, it is possible to determine the necessity of access by looking at the thumbnail images displayed in a list or the thumbnail images with the related link parts.

The thumbnail image can be recognized by the function of recognizing the designated position by the input means (for example, a pointing device such as a mouse) by the input means. Therefore, a specified address and an image file can be accessed from the database 4 based on the specified thumbnail image. Thereafter, as described later, each time a thumbnail image registered in the database 4 is specified, The number of accesses is counted up.

The registration period and the number of accesses are based on the criteria for storing an image file described later in the server 3 and the image file (or address and thumbnail image) described later.
Is used as a reference when deleting the image file, and the image file can be properly managed.

Next, in # 12, it is determined whether or not to end the search, and the search is continued (N in # 12).
O) returns to # 4 and continues the subsequent processing, while ending the search (YES in # 12) and when it is determined in # 3 that the search range is only the server 3 (YE in # 3).
S) proceeds to # 21 in FIG.

In the procedure of FIG. 4, the address and the thumbnail image relating to the image file are stored in the server 4 after the processing of FIG. Note that the image file whose capture time is long is already stored in the server 3 in the procedure of FIG.

In FIG. 4, in # 21, the server 3 is searched, and thumbnail images are displayed according to the search conditions (# 22). Subsequently, when the thumbnail image of the image file to be displayed is specified, the record of the database that stores the thumbnail image is checked (# 2).
3) It is determined whether or not the image file name is registered in the database 4, that is, whether or not the image file exists in the server 3 (# 24), and the image file is read from the server 3 based on a procedure described later. .

In step # 24, the image file name is changed to database 4
If the image file does not exist in the server 3, that is, if the image file is not stored in the server 3 (NO in # 24), an Internet connection is made and the image file of a predetermined website is accessed (# 25).

In step # 25, after accessing the image file of the website, the count is incremented (# 26). Now, there is no image file (name) in the database 4, and the image file is imported from the website. Then, it is checked whether or not the number of accesses of the record in this term is equal to or more than a predetermined value (# 27).

If NO in # 27, that is, if the number of accesses is smaller than the predetermined number of times, the fetch time of the image file is calculated (# 28), and it is determined that the fetching takes more than the predetermined time (YES in # 29), and YE in # 27
S, that is, when the number of accesses is equal to or greater than a predetermined value, #
The process proceeds to 30 to # 32.

In # 30, it is determined that it is not efficient to take in the image files one by one via the Internet, and the image file taken in this time is given a file name.
The image file name is registered in the image file name item 4e of the record, the image file is displayed (# 31), and the image file is stored in the server 3 (# 32). Read from

If it is determined in steps # 27 to # 29 that the number of accesses is less than the predetermined number and that the image file is not taken for a predetermined time (NO in # 29),
Capture image file for display (# 33), then
The image file is displayed (# 34).

The calculation of the import time uses a known technique. For example, when an image file is imported from the web server 2 by designating an address, the computer P
, Information including time information (time stamp) is transmitted to the web server 2, the required time is calculated by the web server 2, and the information including the time is returned to the personal computer P.

On the other hand, if the image file name exists in the server 3 in # 24, that is, if the image file is stored in the server 3 (YES in # 24), the server 3 is accessed to read the image file (# 35), the number of accesses 4f in this term is counted up in the record of the image file (# 36), the image file is read (# 37), and the image file is displayed (# 3).
8).

As described above, by repeating the search,
An image file that has been accessed a predetermined number of times or more during a predetermined period and an image file that is determined to require a predetermined time to capture are stored in the server 3. Then, a situation where the capacity of the server 3 becomes insufficient eventually occurs. Therefore, after a predetermined period, in order to save the storage capacity of the server 3, the image file under the predetermined condition is deleted by referring to the access count. There is a method shown in FIG.

In the following, the timing of the deletion judgment is as follows.
A case will be described in which the deletion is determined after the registration period and the access number change operation at the beginning of the unit period. That is, the flag of the registration period in the record of the database 4 is set to “1”.
→ Change to “2”, “2” → “0”, “Access number in the previous term” → “Access number in the previous term”, “Access number in the current term”
→ This is the explanation after moving the access count to each item column, such as “previous access count”. Here,
It is assumed that the number of accesses in the previous term of the record (registration term “0”) registered before the last term is a target of the deletion judgment.

In FIG. 5, at the beginning of a new unit period (YES at # 41), the registration period is checked in the record of the database 4, and the previous period, that is, the registration period item 4c
Is "2" (NO in # 42), it is determined that the record is to be left.

On the other hand, in # 42, the registration term item 4c is "0",
That is, if it is before the last two periods (YES in # 42), the number of accesses is subsequently determined (# 43). In the case of the present embodiment, “2” entered in the registration period item 4c, that is, the first half (in some cases, “3” and “4” may be provided) means a grace period.

Subsequently, referring to the previous access count item 4g in the record of the database 4, if the predetermined count is less than, for example, 50 (NO in # 43), all the records including the address, the thumbnail image, and the image file are deleted. (# 44), and then the database 4
It is determined whether all records have been checked (# 45), and when all records have been checked (YES in # 45), the process is terminated; otherwise (NO in # 45), the process proceeds to # 42. Continue the return process.

On the other hand, in # 42, when the registration period item 4c is "2", that is, when the image file is the previous image file (# 42)
NO), and the registration was made before the last two years (# 4
2 is YES), for example, if the period is one month and there are 50 or more access times (YES in # 43),
As records to be saved, all records including addresses, thumbnail images, and image files are held and stored (# 25).

In FIG. 5 described above, focusing only on the number of times of access, a record whose number of accesses is less than 50 in the registration before the last two years is deleted. Next, refer to FIG. 6 for the procedure of stepwise deletion. I will explain.

In FIG. 6, as in FIG. 5 described above, at the beginning of a new unit period (YES in # 51), the registration period is checked in the record of the database 4, and the previous period, that is, the registration period item 4c is "2". If there is (NO in # 52), it is determined that the record is left. On the other hand, in # 52, it is a record of the database 4 registered before the last two periods (YES in # 52), and the first predetermined number of times (for example, 50 times)
The image file accessed above is (YE in # 53)
S), it is determined that the record is left.

If the number of accesses is smaller than the first predetermined number in # 53 (NO in # 53), it is determined whether or not the image file is stored in the server 3 (# 54). Is not stored in the server 3 (NO in # 54), it is determined whether it is equal to or more than the second predetermined number (for example, 5 times) (# 55), and if less than the second predetermined number (NO in # 55). It is determined that access to the image file is extremely small, and no image file is currently stored in the server 3 (based on # 54).
Deletes the record including the image file (# 5)
6). In the case of # 55 or more than the second predetermined number (# 5
5 (YES), it is determined that the record itself is left.

On the other hand, if the image file exists in the server 3 at # 54 (YES at # 54), the image file (name) is deleted leaving the record itself (# 57). Then, after # 56 or # 57, it is determined whether or not all the records of the database 4 have been checked (# 58). If the determination has been made (YES in # 58), the processing is terminated, otherwise (# 58). NO), and returns to # 52 to continue the subsequent processing.

In the procedure of FIG. 6, it is presumed that the number of accesses was temporarily small in the previous period, and only the image file having a large file size was deleted. They were kept for when they increased again.

If the record before the last two years or before has extremely low access, the record is deleted. Therefore, the database 4 retains a high frequency record, so that the search efficiency does not decrease and the access frequency does not decrease. Since the image files having a low image length are deleted one by one every period, the consumption of the capacity of the server 3 can be suppressed.

In the structure of the database 4 shown in FIG. 2, although not shown, "time" is provided as an item.
An image file that requires time to take in an image file may be set so that a flag is set in the column and deleted only when the number of accesses in the deletion determination is “0”.

[0084]

As described above, according to the data management method of the present invention, in the case of data that first meets the search condition, the address information of the data is stored in the storage device, and the data is fetched and registered. Remember the time, then
Alternatively, search the storage device, display the corresponding address information, count the number of accesses for the selected data, and, if the data is not in the storage device, use the Internet website based on the address information. Data, and when the data is stored in the storage device, the data is read out, so that the frequency and transition of data access based on the number of accesses and the registration time can be grasped, and detailed information can be obtained. Appropriate data management can be performed.

In the data management method of the present invention, in the above method, when the number of times of accessing data reaches a predetermined number, the data is stored in the storage device in addition to the address information. When the number of accesses to the data acquired from the website reaches the predetermined number of times in the predetermined period, the data is stored in the storage device as frequent data, and the data is instantly read from the storage device without connecting to the Internet each time. On the other hand, if the number of accesses to the data acquired from the website has not reached the predetermined number of times, the data is not stored in the storage device as ad hoc and infrequent data. Consumption can be suppressed.

Further, the data management method of the present invention is characterized in that, in any one of the above-described methods, when data not stored in the storage device is taken from a website on the Internet, it is determined that the taking time requires a predetermined time or more. Since the data is stored in the storage device in addition to the address information, the communication cost of the metered system can be suppressed, and the data that takes a long time to capture can be efficiently output. Further higher efficiency can be achieved.

Further, according to the data management method of the present invention, in any one of the above methods, when the number of accesses to the data read from the storage device is less than the predetermined number in a predetermined period, the address information and the data are stored in the storage device. , The address information and data other than those that are really necessary, that is, high-frequency information, are deleted as unnecessary, so that the consumption of storage device capacity can be further suppressed as compared with the above. It is possible to continuously use the storage device having a large capacity for a long period of time.

The data management method of the present invention may be arranged such that, in any one of the above-mentioned methods, when the number of accesses in a predetermined period is smaller than the predetermined number of steps provided in a stepwise manner, data and address information are arranged in that order. Since the data is deleted from the storage device, unnecessary data and address information can be deleted to suppress the capacity consumption of the storage device, and data can be output more efficiently than the above.

Further, according to the data management method of the present invention, in any one of the above-described methods, the data stored in the storage device is stored in a compressed state and decompressed when read. Even if the amount of high data becomes enormous, it can be stored in a predetermined storage device capacity, and the storage device can be used efficiently.

Further, according to the data management method of the present invention, in any one of the above methods, the period for storing or deleting data in the storage device and the number of accesses can be changed according to the capacity of the storage device. When high data increases or conversely decreases, it is possible to appropriately adjust the data appropriately according to the capacity of the storage device, and the storage device can be used more efficiently.

[Brief description of the drawings]

FIG. 1 shows a schematic configuration of hardware for implementing a database management method of the present invention.

FIG. 2 is a diagram for explaining the concept of a database in the database management method of the present invention.

FIG. 3 is a diagram for explaining a procedure when data meets a search condition for the first time in the database management method of the present invention.

FIG. 4 is a diagram for explaining a procedure for accessing data in the database management method of the present invention.

FIG. 5 is a diagram showing a data deletion procedure in the database management method of the present invention and explaining a case of collectively deleting data.

FIG. 6 is a diagram showing a data deletion procedure in the database management method of the present invention and explaining a case of deleting data step by step.

[Explanation of symbols]

DESCRIPTION OF SYMBOLS 1 Internet 3 Server 4 Database 4b URL item 4c Registration term item 4d Thumbnail name item (summary information name item) 4e Image file name item (Image file name item) 4f Current term access count item 4g Previous term access count item 4h Last second term access count Item P Personal computer (client personal computer)

Claims (7)

[Claims] A search is performed to retrieve data from a website on a network such as the Internet,
A data management method for reading data from a storage device, storing necessary data in the storage device, or deleting unnecessary data. If the search range is not limited to the storage device, search on the Internet, and It is determined whether there is data on the website to be stored. If the data is on the website, the address information is stored in the storage device, the data is fetched, the registration time is stored, and the search range is changed to the storage device. If it is only in the storage device, search the storage device, display the corresponding address information, count the number of times of access of the data selected from it, read out the data if the data is in the storage device, Data is retrieved from a website on the Internet based on the address information if the data is not in the storage device. Management method. 2. The data management method according to claim 1, wherein when the number of counts when accessing the data reaches a predetermined number, the data is stored in the storage device in addition to the address information. 3. When fetching data not stored in the storage device from a website on the Internet, if it is determined that the fetching time requires a predetermined time or more, the data is stored in the storage device in addition to the address information. The data management method according to claim 1 or 2, wherein: 4. The storage device according to claim 1, wherein the address information and data are deleted from the storage device when the number of accesses to the data read from the storage device is less than the predetermined number in a predetermined period. Data management method described in. 5. The method according to claim 1, wherein when the number of accesses in a predetermined period is less than the predetermined number of steps, the data and the address information are deleted from the storage device in that order. The data management method according to any of the above. 6. The data management method according to claim 1, wherein the data stored in the storage device is stored in a compressed state and decompressed when read. 7. The data management method according to claim 1, wherein a period during which data is stored or deleted in the storage device and the number of accesses are changeable according to the capacity of the storage device.