JPH04302038A - File system - Google Patents

Abstract

PURPOSE:To improve an information transferring efficiency between a temporary storage part and an information supplying means by updating a new sequence by mutually referring to the list information in an old order, and the list information in a new order. at the time of the generation of a request, and the elimination of the information of the temporary storage part. CONSTITUTION:When the information requested from a user is stored in a temporary storage part 23, a retrieving part 22 makes an information reading request to the temporary storage part 23, and offers the information to a user terminal group 1 making the request for the desired information. At that time, list information 26 in the old order is updated, and at the same time list information 27 in the new order is updated. At that time, an eliminating part 25 eliminates the oldest request information from the temporary storage part 23, before operating an overflow by referring to the list information 26 in the old order from the head. After the elimination, the reading request is transferred from a reading part 24 to an information supplying means group 3, and the information transferred from the temporary storage part 23 to a higher rank is newly registered. Thus, the information transferring efficiency between the temporary storage part 23 and the outside information supplying means 3 can be improved.

Description

[Detailed description of the invention]

0001

[Industrial Application Field] The present invention improves the efficiency of information transfer between the temporary storage unit and external information supply means by protecting the most recently requested information from the temporary storage unit without erasing it from the temporary storage unit. It concerns improvements to the file system.

0002

[Prior Art] Conventionally, a file system for independently providing real-time and continuous information such as music and video to multiple users is described in Japanese Patent Application Laid-Open No. 1-133156, which was already invented by the present applicant. There is something.

[0003] This is as shown in FIG. Information read requests from the user terminal group 31 are accepted by the search unit 32 of the file system. The search section 32 searches whether the information requested by the user terminal is stored in the temporary storage section 33 or not. If the information requested by the user terminal is not stored in the temporary storage section 33, the search section 32 issues an information read request to the external basic file section 35 via the reading section 34, and retrieves the desired information from the basic file section 35. The user who requested the information via the reading unit 34
In parallel with providing the information to the user terminals in the user terminal group 31, the information is stored in the temporary storage section 33.

On the other hand, when the information requested by the user is stored in the temporary storage section 33, the search section 32 stores the information requested by the user.
4 makes an information read request to the temporary storage unit 33,
From here, the desired information is provided via the reading section 34 to the user terminal that has requested reading.

As these series of operations are repeated, the information stored in the temporary storage section 33 overflows, so the erasing section 36 monitors whether or not the information overflows.
Among the accesses based on requests from user terminals stored in the temporary storage section when overflow approaches,
Information requested at the oldest time is sequentially deleted, and a surplus portion is always secured in the temporary storage unit 33 to temporarily store information based on new requests from user terminals.

[0006]

SUMMARY OF THE INVENTION In the above-described file system, it is not easy to manage the order of requests in which request information is updated and registered when the temporary storage section 33 is deleted. Particularly when the number of information registered in the temporary storage unit 33 increases, it is difficult to update and register the latest information at high speed in response to a request.

[0007]

[Means for Solving the Problems] In order to solve the above-mentioned problems, the present invention provides a file system that provides desired information in response to a request from a user 1, as shown in FIGS. 1 to 3, for example. A temporary storage unit 23 that stores information read from the external information supply means 3; a search unit 22 that searches whether the requested information is stored in the temporary storage unit; and a search unit 22 that searches whether the requested information is stored in the temporary storage unit. a reading unit 24 that requests the information supplying means to read if the information is not stored in the temporary storage unit; an information sending unit 21 that sends out the information in response to the request if the information is stored in the temporary storage unit; an erasing section 25 that monitors the state and sequentially erases the information requested at the oldest time before the information stored in the temporary storage section overflows;
The memory is configured such that the data content value of the address number value corresponding to the identification number of the information becomes the identification number of consecutive information, and the list information 26 in the order of the oldest consecutive requests at the time of generation, and the identification of the information. The memory is configured such that the data content value of the address number value corresponding to the number becomes the identification number of consecutive information, and has list information 27 in the order of the latest at the time of request generation. When erasing information in the temporary storage section, a file system is provided in which the oldest list information 26 and the newest list information 27 are referred to each other and updated to a new order.

[0008]

DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the file system according to the present invention will be described below with reference to the drawings. Note that this embodiment uses a file system that provides music information as an example, and the number of songs is 1000, and the requested song number (information identification number) is used.
Assume that 5001 to 6000 are assigned. Note that the number of songs stored in the temporary storage section is approximately 5 songs.

First, list information will be explained. Figure 4
(B) and FIG. 5(B) show an example of list information (26) arranged from oldest to newest at the time of request generation and list information (27) arranged from newest to oldest. In this example, the latest requested song number is 5600, the oldest requested song number is 5709, and the latest requested song number is 5600, 5450, 5211, 5900, 5709,
The oldest requests are 5709, 5900, 5211.
, 5450, 5600.

[0010] As shown in FIGS. 4(A) and 5(A), these list information are such that the data content values of the address number values corresponding to the requested song numbers (identification numbers) of the songs (information) are continuous. Each memory is configured to have the requested song number (identification number) of the song (information) to be played. That is, the song number written in the list information means an address on a table that is continuous in the order of the song number, and the contents are configured as list information that stores the song number in the next order and is connected by a pointer. The song number in the square in each figure (B) means the data content value of the address number value, and in FIG. 4 (A), for example, the address value 56 corresponding to the song number
The data content of 00 stores a value 5450 corresponding to the next song number 5450.

[0011] Since the points are connected by pointers in this manner, even if the number of information registered in the list information increases, the designated number in the list information can be immediately searched and updated. In other words, in order to know the song number to be deleted from the temporary storage section, as will be described later, it is sufficient to refer to the list information arranged in chronological order starting from the beginning.

Next, list information (2
7) Update (registration) will be explained. The update rewrites the latest requested music number as the data content of the absolute address value (5000), and rewrites the data content with the latest requested music number as the address to the latest requested music number. Furthermore, if the requested song is in the list information (temporary storage section 23), the order of the songs before and after the latest requested song number is continued by referring to the list information (26) arranged from oldest to newest (requested song number (See (A) in FIG. 6, which is an example in which there is a request of 5211). On the other hand, if the requested song is not in the list information (temporary storage section 23), the data at the end of the list is returned by one song by referring to the list information (26) arranged from the oldest to the oldest. In Figure 6, which is an example of
See B). In the contents of the song number 5709 removed from the list information, information indicating the removed state is written. Note that the list information (26) arranged in chronological order is referred to when returning the song order or list end data for at least one song before the requested song number. Similarly, FIG. 7(A)
As shown in (B), the list information (26) arranged from the oldest to the newest list information (27)
It can be updated by referring to . In this way, by managing list information (26) arranged from oldest to newest and list information (27) arranged from newest to oldest, it is possible to efficiently respond to requests from user terminals even when the number of accumulated information increases. This enables list information management.

Next, an example of a file system using such list information will be explained with reference to block diagrams shown in FIGS. 1 to 3.

As shown in FIG. 1, an information read request from any one user terminal of the user terminal group 1 is received by the search section 22 in the information supply means 2 (via the information sending section 21).
Accepted. The search unit 22 searches whether the information requested by the user terminal is stored in the temporary storage unit 23 by referring to the list information 26 arranged from oldest to newest or the list information 27 arranged from newest to oldest.

First, if the information requested by the user terminal is not stored in the temporary storage section 23, the search section 22 issues an information read request to another information supply means group 3 via the reading section 24, and retrieves this information. Desired information is read from the supply means group 3, and the information is provided to the requesting user terminal via the information sending section 21 while storing the information in the temporary storage section 23. At this time, list information 26 in which the accumulated information is arranged from oldest to newest according to the procedure described above, and list information 2 in which the accumulated information is arranged in descending order.
Update registration on 7. The configuration of the information supplying means 3 is the same as that of the information supplying means 2, or at least has the function of transmitting information and means for accumulating and storing information.

Next, if the information requested by the user is stored in the temporary storage section 23, the search section 22 requests the temporary storage section 23 to read the information via the information transmission section 21, and the information transmission section 21 From here, the desired information is provided to the requesting user terminal via the . At this time, the requested song number according to the above-described procedure is set as the latest requested song number, the oldest list information 26 is updated, and the newest list information 27 is updated at the same time.

As these series of operations are repeated, the information stored in the temporary storage section 23 overflows, so the erasing section 25 monitors whether or not the information overflows. At this time, the erasing unit 25 refers to the oldest list information 26 from the beginning, thereby erasing the information requested at the earliest point from the temporary storage unit 23 before it overflows. After erasing, the reading unit 24 transfers a read request to the information supplying means group 3, and the information transferred from the upper level is newly registered in the temporary storage unit 23. These temporary storage units 23
When performing the deletion and registration processing from the list information, as described above, the deletion and registration processing is also performed from the list information, the list information is updated, and new requests from the user terminals are dealt with.

Furthermore, as shown in FIG. 2, when erasing processing becomes necessary, in order to ensure that there is sufficient space in the temporary storage section to store the information that is to be newly stored,
By referring to the items related to the accumulation state, not only the information requested at the earliest point in time but also the oldest information may be deleted sequentially in advance. In other words, the temporary storage section 23
When performing erasing processing before overflowing, the temporary storage unit 23 stores information such as the performance time of a song so that the information transferred from the information supply means group 3 can be stored in the temporary storage unit 23.
The storage information management unit 28 refers to items related to the storage status of the storage information, and further refers to the list information 26 starting from the oldest at the time of request generation, thereby sequentially deleting information from the temporary storage unit 23 in advance to secure free space. Configure it to do so. For example, the stored information management unit 28 checks the length of the information transferred from the information supply means group 3 via the reading unit 24, and in order to secure the length of the information to be transferred, a list is arranged from oldest to oldest. A plurality of pieces of information in the temporary storage unit 23 are deleted in advance by referring to the information from the beginning.

[0019] When performing the deletion and registration processing from the temporary storage section, the deletion and registration processing is similarly performed from the list information, the list information is updated, and new requests from user terminals are dealt with.

Furthermore, as shown in FIG. 3, when overwriting processing is required, items related to the storage status are referred to and the information requested at the earliest point is transferred from other information supply means. The information may be sequentially overwritten.

Here, each block other than the writing section 29 has the same functions as described above. The writing unit 29 monitors whether the storage state of the temporary storage unit 23 overflows. At this time, by referring to the oldest list information 26 from the beginning, the temporary storage section 26 can be saved before it overflows.
The writing unit 25 sequentially overwrites and stores the information transferred from the information supply means group 3. When performing overwrite processing from these temporary storage units, the list information is similarly removed and registered, the list information is updated, and new requests from user terminals are dealt with.

[0022]

Effects of the Invention As described above, the file system of the present invention provides a file system that provides desired information in response to a request from a user. a search unit that searches whether the requested information is stored in the temporary storage unit; and a reading unit that requests the information supply means to read the information if the information is not stored in the temporary storage unit. , an information sending unit that sends out information in response to a request when information is stored in the temporary storage unit; and an information sending unit that monitors the storage status and detects the information stored in the temporary storage unit before it overflows. , an erasing unit that sequentially erases the information requested at the earliest point in time, and a memory configured such that the data content value of the address number value corresponding to the identification number of the information becomes the identification number of continuous information,
The memory is configured such that the list information is arranged in order from the oldest at the time of request occurrence, and the data content value of the address number value corresponding to the identification number of the information becomes the identification number of the consecutive information, and the list information is arranged in order from the oldest at the time of request generation. It has continuous list information in the newest order, and when a request is generated or when the information in the temporary storage section is deleted, the oldest list information and the newest list information are referred to each other and updated to a new order. Therefore, even if the number of accumulated information increases, list information can be efficiently managed in response to requests from user terminals, and the list information can be arranged in chronological order from oldest to newest. Even when information is transferred from another information supply means, the information corresponding to the latest request is protected, so the efficiency of information transfer with another information supply means is improved.

Furthermore, if the information in the temporary storage section is not erased but is overwritten with information transferred from a higher level, the time required to erase the information in advance can be saved, which is ideal for file systems that require high-speed processing.

[Brief explanation of the drawing]

FIG. 1 is a functional block diagram showing an embodiment of a file system according to the present invention.

FIG. 2 is a functional block diagram showing another embodiment of the file system according to the present invention.

FIG. 3 is a functional block diagram showing another embodiment of the file system according to the present invention.

FIG. 4 is an example of list information in the newest order.

FIG. 5 is an example of list information in chronological order.

FIG. 6 is a diagram illustrating updating of list information in the newest order.

FIG. 7 is a diagram illustrating updating of list information in order of oldest.

FIG. 8 is a functional block diagram showing a conventional file system.

[Explanation of symbols]

1 User terminal group 2 Information supply means 3 Information supply means group 21 Information sending section 22 Search section 23 Temporary storage section 24 Reading section 25 Deletion section 26 List information arranged from oldest to newest 27 List information arranged from newest to oldest 28 Accumulated information management Section 29 Writing section

Claims (1)

[Claims] Claim 1: A file system that provides desired information in response to a request from a user, comprising: a temporary storage section that stores information read from an external information supply means; and a temporary storage section that stores the requested information in the temporary storage section. a search unit for searching whether the information is stored; a reading unit for requesting the information supply means to read the information if the information is not stored in the temporary storage unit; and a reading unit for requesting the information supply means to read the information. an information sending unit that sends out information according to the request, and an information sending unit that monitors the storage status and deletes the information that was requested at the oldest time sequentially before the information stored in the temporary storage unit overflows. and a memory configured such that the data content value of the address number value corresponding to the identification number of the information becomes an identification number of continuous information,
The memory is configured such that the list information is arranged in order from the oldest at the time of request occurrence, and the data content value of the address number value corresponding to the identification number of the information becomes the identification number of the consecutive information, and the list information is arranged in order from the oldest at the time of request generation. It has continuous list information in the newest order, and when a request is generated or when the information in the temporary storage section is deleted, the oldest list information and the newest list information are referred to each other and updated to a new order. A file system characterized by: