JPH02116936A - Reorganizing system - Google Patents

Abstract

PURPOSE:To perform the reorganization without stopping a data base system by executing partially the reorganization with respect to a data file, and repeating it until the processing is ended with regard to all store units in the data file. CONSTITUTION:A reorganizing means 2 starts a partial reorganizing means 3 successively with respect to a store unit in a data file 1, and the partial reorganizing means 3 starts a store unit read-in means 4 with respect to two or more store units and reads in data records in the store units in a lump onto a memory 5, and subsequently, starts a store unit generating means 6, reorganizes the store unit in accordance with a prescribed rule from the data records which are read in onto the memory 5 and reorganizes partially the data file 1. The reorganizing means 2 repeats these partial reorganizations, and when the store unit which does not conform with the rule is generated, the partial reorganizing means 3 is started with respect to its store unit and other store unit, and the processing is continued until the processing is ended with regard to all the store units in the data file 1.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to a data reorganization method in a database system of an electronic computer system.

(Prior Art) In a database system, data is stored in a data file as a data record, and the data record usually includes an index record that defines a search key that is a key value when searching, and There are via records that are accessed through index records.Furthermore, data files are generally made up of multiple storage units.

By the way, even if a data file is once organized based on a predetermined rule, due to subsequent circumstances, other rules (for example, a data file with no limit on the number of index records in each storage unit may be changed to It is often necessary to reorganize the data file into a data file based on a standard (such as limiting the number of index records to a predetermined number), and conventionally reorganization has been carried out using the configuration shown in FIG.

That is, in FIG. 7, the reorganizing means 2' loads all the data records from the data file 1° into the memory 5 at once by activating the data file reading means 4'.
Thereafter, the reorganizing means 2' activates the data file creating means 6' to perform organization based on new rules and store data records in the data file 1'.

(Problem to be solved by the invention) As mentioned above, in the conventional reorganization method, the entire data file is reorganized at once, so it is not necessary to occupy the data file while the process is being performed. However, the database system had to be temporarily stopped, which had a major impact on the users of the database system.In particular, as databases have become huge in recent years, the time required for reorganization has increased. As a result, the above-mentioned drawbacks became even more serious.

The present invention has been proposed in view of the above points, and its purpose is to provide a reorganization method that can perform reorganization without occupying the entire data file and minimizing service degradation. Our goal is to provide the following.

[Means for Solving the Problems] In order to achieve the above object, the present invention provides a method for reorganizing a data file consisting of a plurality of storage units including index records and via records. A storage unit reading means waits and reads data records in the storage unit all at once into memory, and a storage unit read means waits for activation and recreates the storage unit from the data records read into memory according to a predetermined rule, but the storage unit does not match the rules. storage unit creation means for creating at most one storage unit; and waiting for activation, activating the storage unit reading means and the storage unit creation means for two or more storage units to partially reorganize the data file. a partial reorganization means that sequentially activates the partial reorganization means for storage units in the data file, and when a storage unit that does not match the rules is created, the storage unit and other storage units are The apparatus further includes a reorganization means for activating the partial reorganization means to continue processing until processing is completed for all storage units in the data file.

(Operation) In the reorganization method of the present invention, the reorganization means sequentially activates the partial reorganization means for storage units in the data file, and the partial reorganization means operates for two or more storage units. Activating the storage unit reading means to read the data records in the storage unit into the memory all at once, and then activating the storage unit creation means to recreate the storage unit according to a predetermined rule from the data records read into the memory. The reorganization means repeats these partial reorganizations, and if a storage unit that does not conform to the rules is created, the reorganization means reorganizes the data file partially. The partial reorganization means is activated, and the processing is continued until processing is completed for all storage units in the data file.

〔Example〕

Embodiments of the present invention will be described below with reference to the drawings.

FIG. 1 is a block diagram showing an embodiment of the reorganization system of the present invention. In FIG. 1, 1 is a data file that stores data records to be reorganized, and as shown in FIG. and a plurality of via records b associated with them.

In the figure, data records that are associated with each other are shown connected by solid lines. In addition, via record b is managed so as to be located close to the index record a to which it belongs within the same storage unit.

In FIG. 1, a reorganization means 2, a partial reorganization means 3, a storage unit reading means 4, and a storage unit creation means 6 are provided as other components.

Note that the memory 5 is the main memory of a computer system that executes processing.

3, 4, and 5 are flowcharts showing the processing of the reorganization means 2, the partial reorganization means 3, and the storage unit creation means 6 in FIG. 1, respectively. The reorganization means 3 is started, and the partial reorganization means 3 starts up the storage unit reading means 4 and the storage unit creation means 6 as appropriate. Note that the storage unit reading means 4 performs a simple process of waiting for startup and reading data records in several storage units in the data file l into the memory 5 all at once, so it is not shown in a flowchart. .

The operation of each means will be explained below.

In FIG. 5, when the storage unit creation means 6 is activated,
Check whether there are enough data records in the memory 5 to create a storage unit that meets pre-specified predetermined rules (step 61); if so, extract data records for one storage unit from the memory 5; Step 62) of retrieving the data, step 63) of creating a new storage unit based on predetermined rules, and returning to step 61. Also, if there are not enough data records in step 61, the memory 5
step 64) of retrieving the remaining data records from
, one new storage unit is created (step 65), although not based on a predetermined rule, and the process ends.

In FIG. 4, when the partial reorganization means 3 is activated, the storage unit reading means 4 is activated for some storage units to read data records in those storage units into the memory 5 (step 31). ), if there is more space in the memory 5, the process returns to step 31.

Next, the storage unit creation means 6 is activated to create a new storage unit (step 32), and the process ends. That is, through the above processing, the data file 1 as a whole is partially reorganized for the plurality of target storage units.

In FIG. 3, the reorganization means 2 starts the partial reorganization means 3 for some storage units at the beginning of the data file l (step 21), waits for the processing to end, and then reorganizes the partial reorganization means 3 until the end of the data file l. Check whether the processing by the reorganization means 3 has been carried out (step 22), and if it has been carried out to the end, all the processing is terminated. Also, step 2
If step 2 has not been executed to the end, check whether the execution of the partial reorganization means 3 has created a storage unit that does not match the prespecified rule.
3) If it has not been created, activate the partial reorganization means 3 for some storage units following the data file 10 (step 25) and return to step 22. If it is determined in step 23 that a storage unit that does not match the rules has been created, the partial reorganization means 3 Step 24), Step 2
Return to 2. Through these processes, reorganization is performed without occupying the entire data file l at the same time.

FIG. 6 specifically shows how the contents of data file 1 change depending on the operation of the embodiment. Data file 1 initially consists of storage units 11A, IIB, IIc,
Assume that it is divided into 11D. Note that a, which is represented by ".", is an index record, and b, which is represented by 'OJ, is a via record. In addition, when the reorganization rule is adopted, ``The number of storage units to be simultaneously processed by the partial reorganization means 3 is 2, and the number of index records a in each storage unit is 2.'' This is an example.

When the reorganization means 2 starts processing in the first state (a), the reorganization means 2 starts the partial reorganization means 3 for the storage units 11A and 11B in the data file 1, and performs partial reorganization. The organizing means 3 has a storage unit 11A as shown in (b),
The storage unit reading means 4 is activated for IIB, and the data records in the storage unit 11A and IIB are collectively read into the memory 5.
Then, the storage unit creation means 6 is activated to recreate a storage unit from the data record read into the memory 5 according to the above-mentioned rules, and as shown in (c), a storage unit 11A' that meets the rules is created. , IIB and a storage unit 11E that does not match the rules are created and written back onto the data file 1.

Next, the reorganization means 2 activates the partial reorganization means 3 for the storage units 11E and IIC in the data file 1, and the partial reorganization means 3 starts the storage units 11E and IIC as shown in (d).
Activate the storage unit reading means 4 for C and read the storage unit 11.
The data records in E and 11C are read into the memory 5 all at once, and then the storage unit creation means 6 is activated to recreate the storage unit from the data records read into the memory 5 according to the above-mentioned rules. ), storage units LIE", IIC' matching the rules are created and written back onto the data file l.

Next, the reorganization means 2 activates the partial reorganization means 3 for the storage unit 11D in the data file 1, and the partial reorganization means 3 activates the storage unit reading means 4 for the storage unit ID as shown in (f). It is activated to read the data records in the storage unit 11D into the memory 5 all at once, and then activates the storage unit creation means 6 to recreate the storage unit from the data records read into the memory 5 according to the above-mentioned rules. ,
As shown in (g), a storage unit lID° matching the rules is created and written back onto the data file 1.

At this point, all storage units 11A in data file 1
Since the processing for -11D has been completed, the reorganization processing is ended.

〔Effect of the invention〕

As explained above, in the reorganization method of the present invention,
Since data files are partially reorganized and this process is repeated, the entire data file is not occupied at the same time, so reorganization can be performed without stopping the data storage system. This has the effect of minimizing the deterioration of service to users.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing an embodiment of the reorganization method of the present invention, FIG. 2 is a logical block diagram of the data files in FIG. 1, and FIG. 3 is a flowchart of the processing of the reorganization means in FIG. 1. , Fig. 4 is a flowchart of the processing of the partial reorganization means in Fig. 1, Fig. 5 is a flowchart of the processing of the storage unit creation means in Fig. 1, and Fig. 6 is a diagram showing changes in data files due to reorganization. FIG. 7 is a block diagram of a conventional reorganization method. In the figure, 1... Data file 11... Storage unit a... Index record b... Via record 2... Reorganization means 3... ... Partial reorganization means 4 ... Storage unit reading means 5 ... Memory 6 ... Storage unit creation means

Claims (1)

[Claims] In a method for reorganizing a data file consisting of a plurality of storage units including index records and via records, the data records in the storage unit are collectively stored in memory after startup. storage unit reading means for reading into the memory, storage unit creation means for re-creating the storage unit according to a predetermined rule from the data record read into the memory after waiting for activation, and creating at most one storage unit that does not match the rule; partial reorganization means for partially reorganizing the data file by waiting for activation and activating the storage unit reading means and the storage unit creation means for two or more storage units; and a storage unit within the data file. The partial reorganization means is activated sequentially for the data, and when a storage unit that does not match the rules is created, the partial reorganization means is activated for that storage unit and other storage units, and the data A reorganization method comprising a reorganization means for continuing processing until processing is completed for all storage units within a file.