JPS60191342A - File control processing system - Google Patents

Abstract

PURPOSE:To decrease considerably the processing time when the presence is detected for the desired file control information and to decrease the I/O frequencies, by making use of the result of the hash processing in an overlap check mode or a reference processing mode, etc. CONSTITUTION:A control program 2 performs the hash processing through a hash processing mechanism 12 according to the file name allocated to a job 1-i. Based on the result of this hash processing, the contents of the corresponding file name control area 13'-n are checked by a box search processing mechanism 16. In this case, a common spare box search processing mechanism also works to check the contents of a file name control area 14'-O, etc. An error is decided in case the same file names are already registered. When the same file names are not detected, a box contents processing mechanism works to register file names to the area 13'-n, 14'-0, etc. At the same time, the necessary file control information is stored on a file control area 15.

Description

Detailed Description of the Invention (~Technical Field of the Invention) The present invention relates to a file management processing method in which a volume table, a volume table, etc. on an external large storage medium such as a magnetic disk is
The present invention relates to a file management processing method in which file management information is stored on a file of content, in which file management is performed using, for example, the result of hashing a file name.

(B) Technical background and problems Conventionally, in magnetic disk media, etc.

File management information for each file stored on the medium is stored in a volume table of content (hereinafter abbreviated as VTOC) on the medium. When attempting to access the contents of the file, the file management program uses the VT
Check the file management information regarding the file on the OC.

Based on this, the contents of the file are accessed.

This aspect is shown in FIG. 1, with reference numeral 1-1 in FIG.
, 1-2, . . . are jobs, 2 is a file management program, 3 is an external large storage medium, and 4 is a VT.
OC, 5A, 5B, . . . each represent a file (or its contents).

In the illustrated state, job 1-1 allocates a new file A, performs data processing on the file A, and saves the results, and job 1-2 allocates the above file A and performs data processing on the file A. This shows a mode in which the data is executed and the results are deleted. During this time.

The file management program 2 reads the file management information regarding the file A on the VTOC 4, then accesses the file A'& based on the storage location ff1ti4 of the file A.

For this reason, it is necessary that the file name used to specify each file A, B, C, . . . must be unique for at least the corresponding storage medium. As shown in relation to file A, when allocating a new file, all file management information registered on VTOC4 is checked at dawn, and the file name described in each file management information is Then, it is necessary to check whether a file name that is the same as that of the file A to which the new allocation is desired exists, and if the same file name exists, it is necessary to perform processing such as determining that the new allocation to the file A is an error. Of course, when accessing a file as described above, the above file management information corresponding to the desired file is used.

It is necessary to search among those described on vToc4.

As mentioned above, file management information is written on the VTOC4, and in relation to its writing mode, conventionally there have been the CKD (Count Key Day Evening) method as shown in FIG.
An FBA (Fixed Block Architecture) system as shown in FIG. 3 is known.

In the case of the CKD method shown in FIG. 2, file management information 6E, 6C, . . . , etc. for each file is stored on the VTOC for each file. As shown in Figure 2, the individual file management information includes a count section 7, a key (file name) section 8. With the data (management information) section 9,
File to be accessed For example, file name of 5A (
key) and verification money and shi.

The storage location of the file 5A is known based on the contents of the data (W-processing information) section 9 of the six illustrated information.

File 5A is accessed. Each file management information is stored in the first vacant position on the V'TOC 4 and is searched by a key search of the hardware function. However, in the case of this method, it is necessary to check up to the end of VTOC4 in the above-mentioned duplicate file name check, and even if there is multi-track processing, I10 times equivalent to the number of shillings are required. It takes a lot of time.

In the case of the FBA method shown in FIG. 3, information called a control interval (hereinafter referred to as CI information) 10 is stored on the VTOC. Each CI information collectively describes management information regarding a plurality of files, as shown in FIG. 3(6). File management information for each file is stored in the first free location, and when searching, each C1
11V report 10 is read and deblocking is performed. In the case of this method as well, in the above-mentioned repeated inspection, it is necessary to check until the end of vTOC4, which requires I10 times equal to the number of pieces of CI information, and the inspection time increases.

0Object and structure of the invention The present invention aims to solve the above points,
A mode is adopted in which hash processing is performed on the file designation information such as the file name, and the above-mentioned file management information is stored in a plurality of boxes created on the VTOC 4.

It aims to solve the above problems. Therefore, the present invention is characterized by having the structure described in the claims.

0 Embodiment of the invention FIG. 4 is an explanatory diagram for explaining the box referred to in the present invention, and
The figure is an explanatory diagram for explaining one embodiment of the hash processing used in the present invention, FIG. 6 is an explanatory diagram for explaining the manner of storage in a box, and FIG. 7 is an explanatory diagram for explaining the manner of use of the common spare box according to the present invention. FIG. 8 is an explanatory diagram showing the main part configuration of an embodiment of the present invention.

In the case of the present invention, as shown in FIG. 4, hash processing is performed on a given file name 11 in a hash processing mechanism 12, and the above processing is performed as described below in correspondence with the example of the above-mentioned FB, A method. File management information for files that have the same hash processing result in the same box 13-0゜13-1. It is stored in... Illustrated = 0, n = 1. The details will be explained later.

In the hash processing mechanism 12 shown in FIG.

Hash processing is applied to the given file name in the form shown in FIG. That is, the file name given now is a string of 8 letters A, then 8 letters B, 9, and then 8 letters C, separated by a comma, as shown in Figure 5.26 Suppose it is given in bytes. In this case, there will be 2 bytes of blanks at the end (
X '4040') and the file name is a total of 28 bytes.

Hash processing is performed. It should be noted that although the description below is shown as being written on the VTOC in a form that corresponds to the above-mentioned FBA method, the present invention is not limited to this, and it is also possible to easily write it on the VTOC in a form that corresponds to the CKD method. It can be inferred by analogy.

As shown in Fig. 5, 28 bytes of file name are given, and as shown in Fig. 5), 4 bytes from the beginning are exclusive-ORed by the XC command.
Finally, a value of 4 bytes is obtained, as shown in the figure, Xmyyyyyyyy'. Then, as shown in FIG. 5, the value is processed to obtain the CI number rnJ. That is, the value of the above X Y yyyyyyyy ma is,
The remainder after dividing by the number of boxes 13 prepared on the VTOC 4 is set as the CI number "ru". When the CI number "ru" is (1) rL=0, box 13-0 shown in FIG.
Store the file management information of the file in (II)
When rL=1, file management information of the file is stored in box 13-1, and when rL=2, box 13-1 is stored.
-2 stores the file management information of the file +4
v)...... to...... 6th
The figure shows a state in which file management information regarding each file (the illustrated file name represents the file management information) is stored in each box. Since the file names given are random, so to speak, the number of pieces of file management information stored in each box 13-i varies.

Each box 13 is subjected to such hash processing.
File management information regarding each file is stored in -L, and the following processing is performed in the duplication check upon registration as described above. That is, hash processing is performed on a given file name such as "αα..." as shown in FIG. 5, and its CI numbers r, L
Suppose that J is, for example, "2". The CIW issue [rL
=24 is determined, VTOC4 on the external large storage medium
The content of box 13-2 is read into the central processing unit, and generally multiple pieces of file management information present in the content are examined, and the file name given above is "αα..." ” is already registered.

If the same file exists, the file name "αα...
New registration for "..." will be treated as an error. If the same one does not exist, it is registered on the box 13-2. Then, as shown in FIG.
Read the contents of -2 and name the file “αα...
The file management information corresponding to "..." is read.

The processing is performed as described above, but as described in connection with FIG. 6, the number of file management ff1 reports stored in each box generally varies. For this reason, there is a limit to the number of pieces of file management information that can be stored in one box, and in some cases overflow may occur. For this purpose, a common spare box is prepared as shown in FIG. 7 to store the overflowed file management information f. That is, a plurality of common spare boxes 14-0.14-1.・・・・・・
・Prepare everything 9, for example, box 13-3 as shown in the diagram.
When an overflow occurs in a box 13-1 or the like, the storage is first stored in an empty common spare box 14-j, regardless of which box the overflow occurs in. Therefore, among the common spare boxes 14-0 to 14-771, there are boxes that are in use and unused boxes that are not currently in use. Of course.

When the file management information registered in box 14-0 is deleted under the condition that common spare boxes 14-0 and 14-1 are in use as shown in the figure, this position is filled. It can be considered that the location of the file management information is moved in this way.

Also, for example, when there is space in the illustrated box 13-1, the items registered in the common spare boxes 14-0 and 14-1 that overflow from the box 13-1 are transferred to the box 13-1 side. It may also be transported.

Regarding the one that caused the above-mentioned overflow.

If the following method, which is normally employed in hash processing, is adopted, the following disadvantages will occur: That is, when an overflow occurs as a result of 9 normal/1 tush processing.

For example, if an overflow occurs in the box corresponding to LE=1, a method is adopted in which the overflow is accommodated in the box corresponding to LE=2. However, if such a method is adopted, the above-mentioned! For multiple inspections, boxes with n=1, boxes with n=2, boxes with rL=3, etc.
・There is a possibility that an overflow occurs in the shogi game, and the box with le = 1, the box with n = 2, and the box with n-, 3.

It becomes necessary to check all of the above, and the advantage of using the results of the hash processing described above is greatly reduced. If a common spare box is used as in the above embodiment, even when performing the above redundant inspection in consideration of overflow, the check is limited to the range of items in use in the common spare box. That will be enough.

FIG. 8 shows the configuration of an embodiment of the present invention.

Reference numerals 1, 2, 3, 4, 5, 12, 13, and 14 in the figures correspond to FIGS. 1 to 7, respectively.

15 is a file management area in which file management information is stored and an illustrated file name management area 13'-0, 13'-1
. . . together with the file name management area 14'-0, 14'-1, . . . corresponding to the middle common spare box 14. It constitutes a "common spare box" 14-no. 16 is a box search processing mechanism according to the present invention, and the figure shows its processing mode. Reference numeral 17 denotes a box content processing mechanism according to the present invention, and the figure shows its processing mode. Furthermore, although not shown in FIG. 8 to simplify FIG. 9, it may be assumed that a common spare box search processing mechanism exists in the file management program to search for common spare boxes.

In addition, in FIG. 8, as mentioned above, the file management area 1
5 is prepared, and for box 13 and common spare box 14, separate areas from file name management area 1v'-i and 14'-i are considered, but box 13 and common spare box 14 which combine both 9 are considered. Needless to say, you may consider the following.

In the illustration in FIG. 8, the file management program 2, based on the file name assigned to job 1-i,
The hash processing mechanism 12 performs the hash processing as described above. Then, based on the result, the box search processing mechanism 16 selects the corresponding file name management area 13'-
Check the contents of the file.

At this time, a common spare box search processing mechanism (not shown) also operates to check the contents of the file name management area 14'-0 and the like. If a registered file with the same file name exists, an error will occur.

If the same one does not exist, the illustrated box content processing mechanism 17 operates to register the file name in the file name management area 13'-rule or, if necessary, in the file name management area 14'-0, and Necessary file management information is stored on the file management area 15. Of course, when it comes to processing such as deleting files.

The box content processing mechanism 17 operates to perform the reverse process of the registration.

According to the present invention (as described in detail in Invention D), the result of the drop-off process is used during one-duplicate inspection or reference processing. Therefore, the processing time for finding the existence of desired file management information is greatly shortened, and the number of I10 times is reduced.

[Brief explanation of drawings]

Figures 1 to 3 are explanatory diagrams explaining the prerequisite problems of the present invention, Figure 4 is an explanatory diagram explaining the boxes referred to in the present invention,
FIG. 5 is an explanatory diagram illustrating an embodiment of hash processing used in the present invention, FIG. 6 is an explanatory diagram illustrating a storage manner in a box, and FIG. 7 is an explanatory diagram illustrating a manner in which the common spare box according to the present invention is used. FIG. 8 is an explanatory diagram illustrating the main structure of an embodiment of the present invention. In the figure, 1 is a job, 2 is a file management program, 3 is an external large storage medium, 4 is a VTOC, 5 is a file (or its contents), 12 is a hash processing mechanism, 13 is a box, and 14 is a common spare box. 16 represents a box search processing mechanism, and 17 represents a box content processing mechanism. Patent applicant: Fujitsu Limited (J II n II 11

Claims (1)

[Scope of claims] When accessing the storage contents of the file, the file management information on the volume table of content is indexed based on the file instruction information that specifies each file, and then the file management information is indexed based on the file management information. In a data processing system having a file management program configured to access storage contents, a plurality of boxes are provided on the volume table of contents for storing file management information regarding files having the same processing result. Along with the above file management programs are provided. A hash processing mechanism that performs hash processing on at least a portion of the file instruction information, and a box search process that searches for the contents of the box in which the file corresponding to the hash processing result by the hash processing mechanism is to be stored. The file management program is equipped with a box content processing mechanism that enables registering, changing, or deleting the contents of each box, and performs the hash processing based on the specified file instruction information. The file management processing method is characterized in that the content of the box is searched after the search is performed, and the content of a predetermined file is accessed based on the search result. (2) It has an external large storage medium in which file management information that designates a single file is written in a volume table op-content on the external large storage medium, and the storage on the external large storage medium When accessing the contents, the file management information on the volume table of contents is indexed based on the file instruction information that specifies each file, and the stored content regarding the file is determined based on the file management information. In a data processing system having a file management program configured to access a file, a plurality of boxes for storing file management information regarding files having the same hash processing result are prepared on the volume table of contents and a common box is provided. Along with a spare box being prepared. The file management program includes a hash processing mechanism that performs hash processing on at least a part of the file instruction information, and the contents of the box in which the file corresponding to the result of the hash processing by the hash processing mechanism is to be stored. The box search processing mechanism searches the common spare box for file management information written in the common spare box when the search target box is full. The file management program has a common spare box search processing mechanism for searching contents, and a box gatekeeper processing mechanism that enables registering, changing, or deleting the contents of each box. The content of the box or the common spare box is searched after performing the hash processing based on the specified file instruction information, and the content of a predetermined file is accessed based on the result. File management processing method.