JPH06110742A - File system - Google Patents

Abstract

PURPOSE:To execute the request frequency control of a temporary storing part with a small amount of memory capacity. CONSTITUTION:A system is provided with a user terminal group 1 transmitting a request signal and receiving information, a basic file part 5 storing information, the temporary storing part 3 storing frequently requested information, a retrieving part 2 retrieving requested information, an information transmitting part 4 transmitting information to the user terminal group 1 and a counter part 7 counting the requested order of information. It is also provided with a comparison increment part 8 adding one increment to the counted value which is smaller than requested information, an increment part 9 adding one increment to all the counted values, a max. value detecting part 11 detecting the max. counted value of the counter part 7, an erasing part 6 erasing information corresponding to the max. counted value and a decrement part 10 erasing the contents of the counter part 7, which corresponds to information erased by the erasing part 6 and also subtracting one from the counted value which is larger than the erased information.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention is a file in which the efficiency of information transfer between a temporary storage unit and an external information supply means is improved by deleting the information requested at the oldest time from the temporary storage unit. It concerns the improvement of the system.

[0002]

2. Description of the Related Art Conventionally, as a file system for independently providing information having real-time and continuity such as music / video to a plurality of users, Japanese Patent Application Laid-Open No. 1-133156, which has been invented by the present applicant, and There is a Japanese Patent Application No. 3-89980.

The one described in JP-A-1-133156 is as shown in FIG. The information read request from the user terminal group 31 is accepted by the search unit 32 of the file system. The search unit 32 searches whether the information requested by the user terminal is stored in the temporary storage unit 33. If the information requested by the user terminal is not stored in the temporary storage unit 33, the retrieval unit 32 requests the external basic file unit 35 to read the information via the reading unit 34, and the basic file unit 35 requests the information. Information is read out and provided to the user terminals in the user terminal group 31 that has requested the information via the reading section 34, and at the same time, the information is temporarily stored in the storage section 33.
Accumulate in.

On the other hand, when the information requested by the user is stored in the temporary storage unit 33, the retrieval unit 32 operates as the reading unit 3.
An information read request to the temporary storage unit 33 via 4,
The desired information is provided from here via the reading unit 34 to the user terminal that has requested the reading.

While the series of operations are repeated, the information accumulated in the temporary accumulating section 33 overflows. Therefore, the erasing section 36 monitors whether or not the overflow occurs.
Of the access based on the request from the user terminal, which is stored in the temporary storage unit when the overflow comes near,
The oldest requested information is sequentially deleted, and the temporary storage section 33 always reserves a surplus portion for temporarily storing information based on a new request from the user terminal.

However, in the file system as described above, it is not easy to manage the order of requests for updating and registering request information at the time of erasing processing of the temporary storage unit 33.
In particular, when the number of pieces of information registered in the temporary storage unit 33 has increased, it has been difficult to update and register the latest information at high speed in response to a request. Therefore, in Japanese Patent Application No. 3-89980, we proposed a file system that makes it easy to manage the order of requests for updating and registering request information.

[0007]

However, this file system makes an old list and a new list of requests, each of which is
Since the identification numbers of the information and the addresses are associated with each other, a memory capacity for storing the identification numbers of all the information accumulated in the basic file section 35 is required for each list, and the basic file section is required. When the information stored in the memory 35 is increased, the memory capacity must be increased.

Therefore, according to the present invention, the amount of information stored in the basic file unit is managed by managing the temporary storage unit with a memory capacity enough to store the identification number of the information registered in the temporary storage unit and the count value thereof. An object of the present invention is to provide a file system that can manage request frequency with a small memory capacity regardless of the above.

[0009]

As means for achieving the above object, a file system for providing desired information in response to a request from a user terminal temporarily stores information read from an external information supplying means. A storage unit, a search unit that searches for whether the requested information is stored in the temporary storage unit, and if the requested information is not stored in the temporary storage unit, a retrieval unit that issues a read request to the information supply unit; Unit and an information sending unit for sending the requested information from the information supply unit to the user terminal, a counter unit for counting the requested order of the information stored in the temporary storage unit, and the temporary storage unit. A count smaller than the count value of the counter unit corresponding to the requested information when the requested information is accumulated A incrementing unit for incrementing by one, an incrementing unit for incrementing all count values of the counter unit by one when the requested information is not stored in the temporary storage unit, and a maximum count value of the counter unit A maximum value detecting unit for detecting the maximum value and an erasing unit for erasing the information corresponding to the maximum count value detected by the maximum value detecting unit, and the request is stored at the oldest time point stored in the temporary storage unit. It is intended to provide a file system characterized by sequentially erasing existing information.

[0010]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS First, the operation of the counter section used in the file system of the present invention will be described with reference to FIGS. The part numbers of the respective parts correspond to those in FIG. 1 described later. Assuming that six kinds of information can be accumulated in the temporary accumulation unit 3, a table in which the identification numbers of the six types of information and the count values corresponding to the respective identification numbers are accumulated is stored in the counter unit 7. It is provided. Figure 3
In (A), a, c, 2a, b, and f are identification numbers of information, for example, song numbers when the information is music information. Then, this identification number indicates that the corresponding information is stored in the temporary storage unit 3. Further, the larger count value indicates that the request is older, and in the figure, when the identification numbers are arranged in the new order of the requests, c, a, 2a,
e, b, f.

Here, the change of the count value when a request for the information stored in the temporary storage unit 3 occurs will be described. In this case, the contents of the table of the counter unit 7 are changed so that the requested information becomes the newest. Identification number 2a in the state of FIG.
If a request for information is issued, the count value smaller than the count value 2 of the identification number 2a is incremented by 1, and the count value of the identification number 2a is cleared to 0. As a result, the count value of the identification number a becomes 2 and the count value of the identification number c becomes 1 as shown in FIG. 7B, and when the identification numbers are arranged in the new order of the requests, 2a, c, a, e, b,
f.

Next, a case will be described in which an erase command for the information stored in the temporary storage unit 3 is input in this state. In this case, the identification number of the information to be erased registered in the counter unit 7 is also erased. When deleting the information of the identification number e, the count value 3 of the identification number e
The count value larger than is decreased by 1, and the identification number e and its count value are deleted. As a result, the count value is corrected so that it continues from 0 to 4 as shown in FIG.
Request frequency can be managed. Normally, when erasing the oldest request information in order to prevent the overflow of the temporary storage unit 3 (in FIG. 6B), it is only necessary to erase the identification number f having a count value of 5 and the count value. good.

Further, a case where information is newly stored in the temporary storage unit 3 will be described. Normally, when information that has not been stored in the temporary storage unit 3 is requested, the information is sent from the external basic file unit 5 to the requested user terminal and is also stored in the temporary storage unit 3. The identification number of this information is registered in the counter section 7. In the case of newly registering the information of the identification number k in the state of FIG. 7C, all the count values of the already registered identification numbers are incremented by 1 and the identification number k is set to 0.
Register as. As a result, when the identification numbers are arranged in the new order of requests as shown in FIG.
It becomes a, c, a, b, f, and is corrected so that the count value continues from 0 to 5. When there is no free space in the table as shown in FIG. 6B, the identification number f of the information whose count value is 5 (old request) is deleted, and then the count values of all other identification numbers are deleted. Is incremented by 1 and the identification number k may be registered as the count value 0.

A first embodiment of the file system of the present invention using the counter unit 7 as described above will be described with reference to FIG. The file system shown in the figure includes a user terminal group 1 composed of a plurality of user terminals for transmitting a request signal and receiving requested information, and a basic file section (information supply) for storing all information. Means 5), a temporary storage unit 3 such as a semiconductor memory that stores recently requested information, and whether the requested information is stored in the temporary storage unit 3 and stores it in the temporary storage unit 3. If not, a retrieval unit 2 that issues a read request to the basic file unit 5, an information transmission unit 4 that transmits the requested information from the temporary storage unit 3 and the basic file unit 5 to the user terminal group 1, and a temporary storage unit Three
The counter unit 7 that counts the requested order of the information stored in FIG. 3 is equivalent to that described above with reference to FIGS. 3A to 3D, and the requested information is stored in the temporary storage unit 3. The comparison increment unit 8 that increments the count value smaller than the count value of the counter unit 7 corresponding to the requested information when the requested information is stored, and the counter unit when the requested information is not stored in the temporary storage unit 3. The increment unit 9 that increases all the count values of 7 by one, the maximum value detection unit 11 that detects the maximum count value of the counter unit 7, and the information that is accumulated in the temporary accumulation unit 3 by monitoring the accumulation state. Before the overflow, the erasing unit 6 that erases the information corresponding to the maximum count value detected by the maximum value detecting unit 11, and the erasing unit 6 corresponding to the information erased by the erasing unit 6 The larger the count value than the count value corresponding to the erase information erases the contents of the counter portion 7 and a decrement unit 10 to one decrease.

When a request signal is supplied from any one user terminal of the user terminal group 1 to the search unit 2, first, it is searched whether the requested information is stored in the temporary storage unit 3. Here, when the requested information is stored in the temporary storage unit 3, the user terminal of the user terminal group 1 that has output the request signal is requested from the temporary storage unit 3 via the information transmission unit 4. Output information. At the same time, a signal is output from the search unit 2 to the comparison increment unit 8 and this comparison increment unit 8
Increases the count value smaller than the count value of the counter unit 7 corresponding to the requested information by 1, and clears the count value of the requested information to 0,
This information is the latest request information. The operation of the counter unit 7 is the operation when the request described above with reference to FIGS. 3 (A) and 3 (B) occurs.

If the requested information is not stored in the temporary storage unit 3, the basic file unit 5 is added to the user terminal of the user terminal group 1 that has output the request signal.
The requested information is output from the information transmission section 4 and stored in the temporary storage section 3. At the same time, search unit 2
A signal is output from the to the increment unit 9, and the increment unit 9 increments all the count values of the counter unit 1 by one and registers the count value of the requested information as 0. The operation of the counter unit 7 at this time is an operation in the case of newly registering the information described above with reference to FIGS. 3 (C) and 3 (D).

Then, when the requested information is stored in the temporary storage unit 3, the old information of the request is deleted in advance so as not to over-follow. To explain this operation, first, the maximum value detection unit 11 causes the counter unit 7
Of the maximum count value is detected and a signal is output to the erasing section 6 with the information having the maximum count value as the erasing target. The erasing unit 6 outputs a signal to the decrementing unit 10 to erase the information content having the maximum count value of the counter unit 7 and erases the corresponding information in the temporary storage unit 3. In addition,
At this time, if the temporary storage unit 3 is a hard disk or the like,
Even if the information itself in the temporary storage unit 3 is not erased, only the portion indicating the corresponding information in the index portion of the temporary storage unit 3 is erased, and the information may be overwritten when new information is stored. good.

When an erasing signal for the information accumulated in the temporary accumulating section 3 is supplied from the basic file section 5 or the like, the erasing section 6 outputs a signal to the decrementing section 10 to cause the counter section 7 to respond. The information content to be deleted is deleted and the corresponding information in the temporary storage unit 3 is deleted. Further, the counter unit 7 is operated as in the case of erasing the information described above with reference to FIGS. 3B and 3C, and is corrected so that the count value is continuous.

As described above, in the present embodiment, even if the counter section 7 is composed of a small memory, the temporary storage section 3 is appropriately managed such that the old information of the request is deleted in advance so as not to over-follow. It can be carried out. In the above embodiment, the increment unit 9 can be omitted by registering the count value of the counter unit 7 by the comparison increment unit 8 even when the requested information is not stored in the temporary storage unit 3. . That is, when the requested information is not stored in the temporary storage unit 3, the count value of the requested information is registered as 0 and the count value of 0 or more is incremented by one. Then, the operation is substantially the same as when the increment unit 9 is used. The first using the increment unit 9
In this embodiment, the processing can be performed earlier than this case because the comparison processing of the count values is not performed.

Next, a second embodiment of the file system of the present invention will be described with reference to FIG. The counter units 7a to 7n of this embodiment are also the counter unit 7 used in the first embodiment.
Similar to the above, it has the same configuration as that described in FIGS. The file system shown in the figure is an example of the configuration when a plurality of temporary storage units are used.
The configuration is the same as that of the first embodiment except that the counter units 7a to 7n each having a table corresponding to a to 3n are provided.
The description is omitted.

First, when a request signal is supplied to the search unit 2 from any one user terminal of the user terminal group 1,
It is searched whether the requested information is stored in any of the temporary storage units 3a to 3n. Here, when the search unit 2 detects that the requested information is stored in the temporary storage unit 3a, for example, the temporary storage unit 3a sends the request signal to the user terminal of the user terminal group 1. The requested information is output via the information sending unit 4. At the same time, a signal is output from the search unit 2 to the comparison increment unit 8 and this comparison increment unit 8
Increments the count value smaller than the count value corresponding to the identification number of the requested information of the counter section 7a corresponding to the temporary storage section 3a by one and clears the count value of the requested information to 0. Register the information as the latest request information. Then, even when the requested information is stored in any of the temporary storage units 3b to 3n, it is similarly registered in the counter units 7b to 7n.

If the requested information is not stored in any of the temporary storage units 3a to 3n, the basic file unit 5 sends the information to the user terminal of the user terminal group 1 that has output the request signal. The requested information is output via the temporary storage unit 3a to 3n.
Accumulate in any of. Now, when the data is accumulated in the temporary accumulation unit 3b, at the same time, a signal is output from the search unit 2 to the increment unit 9, and the increment unit 9 increments all the count values of the counter unit 7b by 1 and the requested information. The count value of is registered as 0. This also performs the same processing when accumulating in the other temporary accumulating units 3a to 3n.

The operation of deleting old information of a request in advance so as not to over-follow when the requested information is stored in the temporary storage units 3a to 3n will be described. The maximum count value of the target counter unit (for example, the counter unit 7a) of the units 7a to 7n is detected, and the signal having the maximum count value is targeted for erasing and a signal is output to the erasing unit 6. The erasing unit 6 outputs a signal to the decrementing unit 10 to erase the information content having the maximum count value of the counter unit 7a and erases the corresponding information in the temporary storage unit 3a. At this time, when the temporary storage unit 3a is a hard disk or the like, the information itself in the temporary storage unit 3a is not erased, but only the portion indicating the corresponding information in the index portion of the temporary storage unit 3a is erased. Similar to the first embodiment, the information may be overwritten when new information is stored.

When an erasing signal for the information accumulated in the temporary accumulating section 3a is supplied from the basic file section 5 or the like, the erasing section 6 outputs a signal to the decrementing section 10 and the counter section 7a receives the corresponding signal. The information content to be erased is erased and the corresponding information in the temporary storage unit 3a is erased. Further, the counter section 7a is operated as in the case of erasing the information described above with reference to FIGS. 3B and 3C, and is corrected so that the count value is continuous.

As described above, in the present embodiment, even in the file system having the plurality of temporary storage units 3a to 3n, the counter units 7a to 7n constituted by a small memory are used.
Thus, the temporary storage units 3a to 3n can be appropriately managed.

[0026]

According to the file system of the present invention, when the requested information is stored in the temporary storage unit,
The count value that is smaller than the count value of the counter unit corresponding to the information requested by the comparison increment unit is incremented by one, and when the requested information is not stored in the temporary storage unit, the counter unit is incremented by the increment unit. The count value of the counter section is always properly managed by increasing all the count values of 1.
Since the maximum value detection unit detects the maximum count value of the counter unit and the information corresponding to the maximum count value is erased by the erasing unit, only the same number as the information stored in the temporary storage unit is used. It suffices to have a memory that stores a table that associates the count values, and the temporary storage unit can be managed with a small memory capacity.

Further, since the requested information is sequentially deleted from the oldest point in time, the information with a large number of requests can always be stored in the temporary storage section, and at the same time, the temporary storage section overflows. Can be prevented. Further, even when a plurality of temporary storage units are used, the counter unit corresponding to the number of temporary storage units only needs to be prepared, and other components do not need to be increased. is there.

[Brief description of drawings]

FIG. 1 is a configuration diagram showing a first embodiment of a file system of the present invention.

FIG. 2 is a configuration diagram showing a second embodiment of the file system of the present invention.

FIGS. 3A to 3D are configuration diagrams showing tables stored in a counter unit used in the file system of the present invention.

FIG. 4 is a configuration diagram showing a conventional example.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 User terminal group 2,32 Search part 3,3a-3n, 33 Temporary storage part 4 Information transmission part 5,35 Basic file part (information supply means) 6,36 Erasing part 7,7a-7n Counter part 8 Comparison increment part 9 increment unit 10 decrement unit 11 maximum value detection unit 31 terminal group 34 reading unit

Claims (1)

[Claims] 1. In a file system for providing desired information in response to a request from a user terminal, a temporary storage unit for storing information read from an external information supply unit, and the requested information in the temporary storage unit. A search unit that searches whether or not it is stored, and if it is not stored in the temporary storage unit, makes a read request to the information supply unit; and a request from the temporary storage unit and the information supply unit to the user terminal. An information sending unit that sends information, a counter unit that counts the requested order of the information stored in the temporary storage unit, and a request when the requested information is stored in the temporary storage unit A comparison increment unit that increments a count value smaller than the count value of the counter unit corresponding to information by one; An increment unit that increments all the count values of the counter unit by one when the requested information is not stored in the storage unit, a maximum value detection unit that detects the maximum count value of the counter unit, and the maximum value And a deletion unit that deletes information corresponding to the maximum count value detected by the detection unit, and sequentially deletes the information requested at the oldest time stored in the temporary storage unit. Characteristic file system.