JP2785966B2 - Foreign key dynamic resolution processing method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Summary] The present invention relates to a foreign key dynamic solution processing method in which only data to be edited is expanded in a memory when editing data having a relationship between data, such as a relational database. In order to reduce the number of input / output operations to and from the file when editing data, and to reduce the amount of memory used, when developing a data file on the memory for the editing target specified by the user, If the related data has been expanded, resolve the chain relationship for the foreign key, and if editing is specified for an unresolved chain relationship, access the necessary data file and store it in memory. And resolve the chain relationship, and select the target to be edited by the user. It is configured to be performed at the point of time.

[Industrial applications]

The present invention relates to a foreign key dynamic solution processing method that, when editing data having a relationship between data, such as a relational database, expands only the data to be edited in a memory.

Today, due to the diversification of information, information edited by users
It is widely used to manage by storing it in a relational database (RDB) or RDB format file. Further, a processing function is provided to allow the user to freely edit the data. In a processing system that handles this type of data, a technique is required to speed up processing and reduce the amount of resources such as a memory used.

[Conventional technology]

In RDB format files, relations can be created between data tables each consisting of a set of data. In particular, in these relations, when an attribute is a key that uniquely identifies a record in another table, this is called a foreign-key.

Conventionally, in an RDB format file, the data stored in the file is temporarily expanded on the editing memory once so that the relationship between the data tables can be always resolved, and a column linking a chain relationship such as a foreign key Is sequentially solved using a function such as a hash.

 FIG. 7 shows an example of the prior art.

When the RDB format data stored in the data file 15 is edited on the editing screen 12 of the display 11, the palette 14-1 corresponding to the data table is stored in the editing memory.
Expand on 13.

In the prior art, even when only the data of one pallet 14-1 is edited, all pallets 14-2, 14-3, and 14 related to it are chained by a foreign key or the like.
-4 is developed on the editing memory 13 at a time and processed.

[Problems to be solved by the invention]

In the prior art, all the data is expanded on the editing memory 13 to solve the chain relation, so that there is a problem that a large amount of memory is required, and the data portion not to be edited is expanded. Since input / output (I / O) is performed, there is a problem that this leads to deterioration of performance.

SUMMARY OF THE INVENTION It is an object of the present invention to solve the above problems and reduce the number of times of input / output to / from a file when editing data, and also reduce the amount of memory used.

[Means for Solving the Problems] FIG. 1 is an explanatory view of the principle of the present invention.

In FIG. 1, reference numeral 10 denotes a processing device having a CPU or the like, 11 denotes a display, 12 denotes an editing screen on which data to be edited is displayed, 13 denotes an editing memory, and 14-1 and 14-2 denote relational databases (RDBs). Pallet equivalent to a table), 15
Represents a data file in which data in the RDB format is stored.

When the user refers to or updates the data in the data file 15, the processing device 10 first inputs a palette to be edited using a menu or the like, and selects an editing target. Here, it is assumed that the data of the pallet 14-1 has been instructed to be edited.

When the editing target is specified, the pallet 14-1 to be edited is read from the data file 15 and expanded in the editing memory 13 by the process P1.

Next, it is determined whether or not it is necessary to solve the chain relationship with the external key or the like for the pallet 14-1. It is assumed that the pallet 14-2 has a chain relationship with the pallet 14-1. In this case, it is determined whether or not the palette 14-2 has already been developed in the editing memory 13.

If the pallet 14-2 is not expanded, the related data of the pallet 14-2 is read from the data file 15 and expanded in the editing memory 13 by the process P2.

Then, the pallet 14-1 and the pallet 14 are processed by the process P3.
Solve the chain relationship with -2. That is, the pallet
An internal control table having information for linking the data of 14-1 and the data of the palette 14-2 is created in the editing memory 13.

[Action]

In the present invention, when the palette 14-1 is to be edited,
Even if all data related in a chain from the pallet 14-1 has not been expanded in the editing memory 13, the pallet 14-1
If the chain relationship between the pallet 14-2 and the pallet 14-2 directly related to the pallet 14 has been resolved, the data of the pallet 14-1 can be edited. That is, even if the chain relation is not completely solved, if the part related to editing is solved, the data can be edited.

Then, the solution of the chain relation is dynamically performed when the user selects an object to be edited.

As described above, according to the present invention, the chain relation of data within the range visible to the user is dynamically resolved when the data is expanded in the editing memory 13, so that the input and output can be performed without the user being particularly aware of the internal processing. It is possible to solve problems such as deterioration of performance and large consumption of memory.

〔Example〕

FIG. 2 is an example of an editor display format for explaining one embodiment of the present invention, FIG. 3 is an example of a memory expansion format for explaining one embodiment of the present invention, and FIG. FIG. 5 is an example of a database storage format for explaining the embodiment, FIG. 5 is a schematic flow of a chain solution according to an embodiment of the present invention, FIG.
The figure shows a processing flow of data editing according to one embodiment of the present invention.

Hereinafter, an example of editing data in the RDB format as shown in FIG. 2 will be described.

The data to be edited is Company, Section, Employee
One of the three pallets. The selected palette to be edited is displayed on the editing screen in a table format as shown in FIG.

Company consists of three columns, Co.name, Kind, and Sec. Section consists of three columns: Co.name, Section, and Emp. Employee consists of three columns, Employee, Section, and Salary.

The column of Co.name of pallet Section is pallet Comp
Since it has information for identifying any record, foreign key F
−key. On the other hand, the column of Sec. Of the palette Company is a child key C-key (Child-key) having a chain relationship with the foreign key F-key. Note that this Se
The numerical value “2” in the column of c. indicates the number of corresponding records in the palette section.

The relationship between the column of Section in the palette Employee and the column of Emp. In the palette Section is also the relationship between the foreign key F-key and the child key C-key.

The memory expansion format of the data shown in FIG.
It is as shown in the figure.

PDE is a pallet definition body for managing the contents of columns and data using control tables. CDE
Is a column definition body having column attribute information and the like. DP
E is a data record indicating the contents of data, etc., DPI is
It is a control table such as a pointer list that organizes data records. objid is an object ID uniquely assigned to each data record to identify each data record.

The head address of the target PDE is also set in the “objid =” field. Although not shown, each CDE has its own pallet P
It points to DE. In the state shown in Fig. 3, PDE and CDE
Is developed in the same format as DPE. PDE at this time,
What corresponds to CDE is the meta definition of PDE and CDE, which is set in the program.

The last CDE in the Company palette shown in Figure 3.
The pointer relationship between the and the second CDE in the Section palette is the chain relationship related to the foreign key. Resolving the chain relation means setting this pointer relation information.

In the present invention, when only the palette Company is to be edited, the chain relationship with the palette section is solved. Therefore, the memory expansion for the palette section is performed. Not done because there is no.

The storage format in the database is, for example, a format as shown in FIG.

All information in the database is the object ID (ob
jid) sets the relation (relationship). The information in the database does not need to be sorted and stored, but may be any sort as long as it can be sorted by any identifier (pallet ID). PDEs and CDEs can usually be considered unchanged.

 The solution of the chain relation is performed as shown in FIG.

First, search for the partner CDE and PDE. In other words, it follows the CDE chain of its own pallet and finds the partner CDE of the pallets in a chain relationship. In addition, find the PDE to which the CDE belongs.

 Next, the partner DPE is searched from the partner PDE.

If there is a partner DPE, resolve the chain relationship with that data.

FIG. 6 shows an example of data editing processing when data is added (ADD). In the following description ~
Corresponds to the processing shown in FIG.

 Determine whether additional editing has been completed.

 If there is a termination instruction, the process moves to processing.

Write the added data (DPE) to the editing memory.

Collect the object ID (objid) from the numbering file. The numbering file is the latest object ID
This file is used to manage the number of objects, and each time an object ID is acquired, the number is incremented.

 Set an add identifier indicating addition in the DPE.

The chain between DPEs is set based on PDE, CDE and objid.

If there is an instruction to end editing,
Write the contents of the DPE to the database.

Also, information for addition is written according to the identifier of the DPE. Thereafter, the editing process ends.

Among the above processes, what is significantly different from the conventional technology is the dynamic solution of the chain by the processes.

In the prior art, since there is no phase of this processing, the relationship between data is shown by directly searching the object ID. Also, even when the chain relationship by address is used, since data is stored in column units,
The chain of all pallets involved has to be followed.

In the former case, the processing can be simplified, but the processing is slow, and in the latter case, the amount of memory expansion increases. The present invention provides a closed chain solution for a target pallet, and both can be improved. However, when editing the entire palette, it is the same as the latter.

The processing shown in FIG. 6 is described in detail in FIG.
(D).

(A) Determine whether all chains of the target pallet have been resolved. If resolved, move on to the next process.

(B) Determine whether the CDE is related to a chain relationship. That is, it is checked whether it is a foreign key (F-key) or a child key (C-key).

(C) Foreign key (F-key) or child key (C-key)
If, resolve the chain relationship.

(D) Move the process to the next CDE, return to process (a),
The process is repeated until all chains of the target pallet are resolved.

The explanation was made with the addition of data (ADD) as an example.
The editing of E) and deletion (DELETE) is almost the same as the processing shown in FIG. The difference is in the processing, UPDATE
Alternatively, in the case of DELETE, the processing is rewriting. In the process, the object ID number is not added. In the processing, in the case of UPDATE or DELETE, each identifier is set.

When data is expanded from the database to the memory, the process shown in FIG. 6 is performed in reverse.

〔The invention's effect〕

As described above, according to the present invention, the minimum necessary
Since only the number of I / O times and the amount of memory are required, it is possible to improve overall performance and reduce the amount of memory used. Therefore, it is possible to reduce the load on machines that perform multiple tasks, such as large machines and workstations. Editing becomes possible.

[Brief description of the drawings]

FIG. 1 is a view for explaining the principle of the present invention, FIG. 2 is an example of an editor display format for explaining one embodiment of the present invention, and FIG. 3 is a memory expansion format for explaining one embodiment of the present invention. FIG. 4 is an example of a database storage format for explaining an embodiment of the present invention, FIG. 5 is a schematic flow of a chain solution according to an embodiment of the present invention, and FIG. FIG. 7 shows an example of the prior art of the data editing process flow according to the embodiment. In the figure, 10 is a processing device, 11 is a display, 12 is an edit screen, 13
Represents an editing memory, 14-1 and 14-2 represent pallets, and 15 represents a data file.

Continuation of the front page (58) Field surveyed (Int.Cl. ⁶ , DB name) G06F 17/30 G06F 12/00

Claims (1)

(57) [Claims] 1. An external key dynamic solution processing method in a data processing system having a processing function of editing data stored in a relational database format having a relationship between data, the method comprising: When expanding the file on the memory (P1), if the related data is expanded, resolve the chain relation related to the foreign key (P3), and specify the edit for the unresolved chain relation. In this case, the necessary data files are accessed and expanded on the memory (P2), the chain relation is resolved (P3), and the chain relation is resolved when the user selects the object to be edited. A foreign key dynamic solution processing method characterized by being performed.