JPS6232817B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a file registration method for cataloging files in a system.

In a data processing system, data created by a program or the like is generally registered in a catalog (registering information regarding the location of the data) in the system, and the history (generation) of the data is managed using a register. In the conventional method, after data is created in a file, it is immediately registered as the latest generation file.

Therefore, the files to be registered are F ₁ , F ₂ ,...F _o
When creating a job (composed of n job steps, with one file generated for each job step), there are n job steps in the middle (for example, file
If an error occurs during data creation ( _F3 data creation), a generation change is performed with files up to _F2 as the latest generation, and the job is abnormally terminated with the files registered in the catalog. In this case, generation change has been completed normally up to files F ₁ and F ₂ .

Therefore, when re-running the job (starting from job step 1), the file
Since the registration of the latest generation of F ₁ and F ₂ has been completed normally, the next generation file will be created as the latest generation, so the generation of files F ₁ and F ₂ and the generation of files F _{3 and} later will be created as the latest generation. There is a difference of one generation between generations, which breaks the continuity and relationship of each generation, and there is also the inconvenience that the operator of the system has to decide whether or not to delete it. .

The present invention has been made to solve the above-mentioned drawbacks, and an object of the present invention is to provide a file registration method that facilitates re-execution of a job that creates a generationally managed file.

The present invention provides a file registration method that has a registry in which multiple generations can be registered, and manages the history of a file by registering the file in the registry by generation at each time a file is registered. and means for registering an empty file in which no data is stored as a next-generation file of the latest generation, and after storing data in the latest generation file, The feature is that it is possible to change the generation to the latest generation by registering the next generation file.

Hereinafter, the present invention will be explained with reference to the drawings. FIG. 1 is a flowchart for explaining a conventional method, FIG. 2 is a flowchart for explaining an embodiment of the present invention, and FIG. 3 is a block diagram for explaining an embodiment of the present invention.

In the drawings, 1 is a disk device, 2 is a memory, 3 is a processing device, 4 is a control unit, 5 is a processing unit,
D ₁ , D ₂ , ...D _o are data, F ₁ , F ₂ , ...F _o and
f ₁ , f ₂ ,...f _o is the file number, J is the job, J ₁ ,
J ₂ , . . . J _o are job steps constituting the job, V ₁ , V ₂ , . . . V _o , and v ₁ , v _{2 ,} .

As shown in Figure 1, when registering n files F ₁ , F ₂ ,...F _o , in the conventional method, after creating the data of the file (for example, F ₁ ), the latest generation file F It was registered as ₁ .

In this case, since there are n files, n job steps J ₁ , J ₂ ,...J _o will be executed. For example, if an error occurs in job step J ₂ (creating file F ₂ ), is the file
A generation change is performed with _F1 as the latest generation file _F1 , and job J ends abnormally in the registered form.

Therefore, when re-executing using the conventional method, the registration of the latest generation of file _F1 is canceled and the generation is changed to ₁ .
After going back by generations, job J (job step J ₁ ,
J ₂ ,...J _o ) must be re-executed (RERUN). Otherwise, as described above, the generation of file F ₁ will differ by one generation from the generations of file F ₂ and subsequent generations.

In contrast, in the present invention, as shown in FIG.
N files are prepared as F ₁ , F ₂ , ...F _o , and by creating data in these latest generation files _{F 1} , F ₂ , ...F _{o , o} ) After all the data has been created, other free files (f ₁ , f ₂ , ...f _o ) that have not yet been stored are pre-registered as next-generation files, and generation change is performed during job execution. There's nothing to do.

If this method is adopted, if an abnormality occurs at an intermediate job step (for example, job step J ₂ ) during job execution, as is clear from FIG.
Even when individual job steps are executed, generation change processing is not performed, so when re-executing (RERUN), data is simply created in the latest generation files (F ₁ , F ₂ ,...F _o ). , and there is no need to cancel the registration of registered files as in the conventional method.

The above registration procedure of the present invention will be explained with reference to FIG. In FIG. 3, the control unit 4 is the disk device 1.
The latest generation of files located in _F1 ,
The positions of F ₂ , . . . F _o can be found by referring to the catalog T ₁ (provided in the memory 2).

That is, the file name F ₁ is written in the left column of the catalog T ₁ ,
F ₂ , . . . F _o and volume numbers (V ₁ , V ₂ , . . . V _o ) indicating the location of each file are also written in the right column.

As a result, the files F ₁ , F ₂ , ...F _o registered as the latest generation files are set to the volumes V ₁ , V ₂ , ... of the disk device 1 at the start of job steps J ₁ , J ₂ , ...J _o , respectively. To V _o , the control unit 4
It is mapped by .

Each job step J ₁ , J ₂ , ... _Jo is processed by the processing section 5
Data D ₁ created by executing each process in
is stored in file F ₁ on volume V ₁ , data D ₂ is stored in file F ₂ on volume V ₂ , and so on, and the last data D _o
One job J is completed by storing the file F _o on the volume V _o .

Then, the control unit 4 registers the files f ₁ , f ₂ , . . . f _o as next-generation files in the catalog T ₂ . That is, the file names f ₁ , f ₂ , . . . _fo and volume numbers v ₁ , v _{2 ,} .

In other words, files f ₁ , f ₂ , ...f _o are cataloged.
By pre-registering them in _T2 and preparing them as empty files, these files f ₁ , f ₂ , . . . f _o will be used as the latest generation files when the next job is executed.

If an error occurs while writing data to the file, the next generation file will not be registered as described above, so re-execution (RERUN) will simply write from file F ₁ to F _o . It is sufficient to refer to the catalog T ₁ and store the generated data in the latest generation files F ₁ , F ₂ , . . . F _o by overcoating.

As described above, in the present invention, a file to be registered as the latest generation is provided in advance, data is generated and stored in this by executing a job, and after the job is completed, a separate empty file is registered as the next generation file. By adopting a method of preliminary registration, re-execution is facilitated when an abnormal situation occurs, which has the advantage of significantly improving system operational efficiency.

[Brief explanation of the drawing]

Figure 1 is a flowchart explaining the conventional method.
FIG. 2 is a flowchart for explaining one embodiment of the present invention, and FIG. 3 is a block diagram for explaining one embodiment of the present invention. In the drawings, 1 is a disk device, 2 is a memory, 3 is a processing device, 4 is a control unit, 5 is a processing unit, and 6
is the display unit, 7 is the printer, D ₁ , D ₂ ,...D _o is data, F ₁ , F ₂ ,...F _o , and f ₁ , f ₂ ,... f _o file numbers, J is the job, J ₁ , J _{2 ,} . . . J _o represent job steps, V ₁ , V ₂ , . . _. V _o , and _{v 1 ,} v _{2 ,} .

Claims (1)

[Claims] 1 In a file registration method that has a registry that allows multiple generations to be registered, and manages file history by registering files by generation in the registry each time a file is registered, the file is registered as the latest generation. and means for registering an empty file in which no data is stored as the next generation file of the latest generation,
A file registration method characterized in that after data is stored in the latest generation file, the next generation file is registered so that the next generation file can be moved to the latest generation.