JP3287077B2 - Automatic alignment method for distributed data - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an automatic distributed data matching method which is effective when applied to a computer system for process management used in, for example, a production factory.

[0002]

2. Description of the Related Art Conventionally, in a production factory for automobiles and the like, a production plan is established according to order status collected from each sales company and the like, and the operation of various production machines provided in the factory based on this production plan. Is controlling.

[0003] A computer system is provided to perform such control. As an example of this computer system, a system as shown in FIG. 8 can be exemplified.

This computer system is of a distributed type, and a main computer 10 has master data 12 functioning as a database. The subsystem 14 is a computer that controls a production line such as a factory. The computer has local data 16 which mainly functions as a database storing data for the computer. On the other hand, the computer 20 creates, for example, production instructions for all factories.
It has local data 22 which mainly functions as a database storing data for the computer. Local data 16 and local data 2
2 stores the data from the master data 12 sent from the computer 10 as it is,
4 or data independently generated by the computer 20.

Accordingly, the same data as the master data 12 exists in the local data 16 and 22.
The subsystem 14 and the computer 20 perform various calculations based on the data.

[0006]

However, in the above conventional system, the master data 12
Will be present in the local data 16 and 22 in a distributed manner. If the distributed data is altered by any computer, Since the data cannot be matched with the computer, problems such as the system not starting up occur. Therefore, the same data needs to be similarly modified in all computers. This modification requires a lot of man-hours, and there is also a problem in the reliability of the data after the modification.

For example, when a part of the local data 16 is changed due to a line abnormality in the subsystem 14 controlling the production line, the local data 16 in the master data 12 or the local data 22 is changed. It is necessary to make the same data as the data changed in step 16 the same as the data after the change, but this operation is manually performed by a human based on a list in which the data before the change and the data after the change are described. There is a need. For this reason, the operation requires a lot of time, and since there is an input error, there is a problem in the reliability of the changed data.

[0008]

According to the present invention, there is provided a host computer having master data, and a local computer having local data having the same contents as the master data and connected to the host computer. An automatic matching method for distributed data used in a computer system comprising: the host computer or the local computer,
When the content of the local data is changed, local data and master data having the same content as the local data before the change are searched from the local computer and the host computer, and the changed local data is changed to the searched local data. If the same processing as that of the local data is performed, a process is performed to rewrite the searched local data with the changed local data.
On the other hand, the local data after the change
If processing different from that of the
Local data before processing the searched local data
And convert the searched master data to the
Process to rewrite according to local data
The retrieved local data is compared to the rewritten master data.
The same processing as that performed on the local data is performed, and processing is performed to rewrite the retrieved local data with the processed local data.

[0009]

According to the present invention thus configured, when the content of the local data is changed, the host computer or the local computer transmits the local data and the master data having the same content as the local data before the change. Searching from the local computer and the host computer, when the same processing as the changed local data is performed on the searched local data, the searched local data is converted into the changed local data. Process to rewrite, while
Is different from the changed local data.
If any processing has been performed,
Invert local data to local data before processing
And converts the searched master data to local data after inverse conversion.
Data is rewritten according to the data
Local data searched for later master data
The same processing as that described above is performed, and processing is performed so that the searched local data is rewritten to the processed local data. Therefore, not only is the input operation unnecessary, but also erroneous data input is performed. Will be completely eliminated.

[0010]

An embodiment of the present invention will be described below with reference to the drawings. FIG. 1 shows an example of an apparatus for executing the distributed data automatic matching method according to the present invention. A database 32 is connected to the process management host computer 30 for controlling and controlling the devices arranged on the production line. The database 32 stores one day's data A regarding the types of vehicles to be produced on that day. Also, master data such as a data relational table described later is stored. The line management online processing unit 35 and the line management batch processing unit 36 perform online processing or batch processing on control information from the process management host computer 30. A local database 38 is connected to the line management online processing unit 35. In this local database 38, data obtained by processing data A stored in the database 32 is referred to as data A 'for one tact, that is, data A'. It is stored for half a day. The PLC 39 is a so-called sequencer for directly controlling the equipment 40, and a local database 42 is connected to the PLC 39. In the local database 42, data obtained by processing data A 'stored in the local database 38 is stored as data A "for 30 minutes. The data A' is stored in these local databases 38 and 42. The existing data is local data.

FIG. 2 is a schematic block diagram for explaining a method of automatically aligning distributed data according to the present invention. Only parts required for executing the method of the present invention are extracted from the configuration of FIG. It is described conceptually. The host computer 45 is the host computer 30 for process management described above.
The host computer 45 has a database 32 that constitutes the database 32.
A and 32B are connected respectively. Database 3
2A stores a data relational table to be described later, and the database 32B stores data A. The data A ′ processing unit 47
It is provided in the line management online processing unit 35 and is a part for processing data A into data A '. The data A 'back calculation processing unit 49 is connected to databases 50A and 50 of input data and output data.
Data A 'is inversely calculated (reversely converted) to data A based on B.

The schematic configuration of the apparatus for executing the distributed data automatic matching method of the present invention is as described above.
How data consistency is achieved by this method will be described with reference to flowcharts shown in FIG.

FIG. 3 shows an example of a data relational table, which shows which program or data is stored and where. For example, master data
ScheduleA is stored in the process management host computer 30, and ScheduleA ', which is relational data (local data), is a subordinate computer of the process management host computer 30, such as a support host computer, an assembly instruction host computer, or the like. PLC # 1 is stored, and Schedule A "is stored in PLC # 2.

The flowchart shown in FIG. 4 shows a process for adjusting the local data to the master data when the master data is changed. This processing is performed by the host computer 45.

When the master data is changed, the host computer 45 refers to the data relational table (RT) of the database 32A to determine where the same relational data as the changed master data is located, and the relational data thereof. It is grasped whether or not the data has been subjected to any processing such as processing or cutting (S1, S2). If processing has been performed on the grasped relational data, the same processing as processing performed on the relational data is performed on the changed master data. Then, in order to replace the master data after the processing with the grasped relational data, the location of the relational data to be replaced is grasped by a data relational table (S3 to S5). Next, all the relational data are separated, and all the relational data are retransmitted until all the data are completed (S6, S7). When the master data is changed by this processing, the change of the master data is performed. The target data is automatically changed to the changed data. At this time,
Even if the data after the change is processed, the data to be changed is subjected to the processing and changed.

Next, the flowchart shown in FIG. 5 shows a process for comparing the changed data with the data before the change.

When the master data is changed, a data relational table is searched to determine where the data corresponding to the changed master data exists, and the location of the corresponding relational data is determined. For example, when the master data is Schedule A, the relational data Schedule A 'is searched for by referring to the data relational table. In this case, it is understood that the relational data exists in the support host computer and the assembly instruction host computer PLC # 1, respectively (S11, S12). Next, all the retrieved relational data is fetched, and if the fetched data is processed, the same processing as that performed on each of the changed master data is performed. Performs data collation. The collation result is displayed on the screen so that the collation result can be confirmed (S13 to S17). The above collation is performed until all data is completed (S18).

Further, the flowchart shown in FIG. 6 shows a process for adjusting the corresponding master data and relational data to the changed data when the relational data is forcibly changed. .

First, the host computer 45 refers to the data relational table and searches for the relevant relational data, that is, whether the relational data before change is not master data. For example, if the relational data before the change is Schedule A ', a search is performed to determine whether this Schedule A' exists in the master data column (S3).
1). When this search is completed, a process of changing the relational data located under the searched master data is performed. (S32).

That is, the relational data is stored in the Schedule
When A 'is forcibly changed to Schedulea',
First, a search is performed to determine whether or not the schedule A 'before the change exists in the column of the master data.
Relational data Schedulea 'changed from leA'
Is performed.

Next, the relational data Schedu
leA 'is searched for the same relational data Schedule A' with reference to the data relational table, and the searched relational data is searched.
It is determined whether or not ScheduleA 'has been subjected to the same processing as the relational data Schedulea' which has been forcibly changed (S33, S34). If the same processing has been performed, the relational data ScheduleA ′ that has been retrieved can be replaced with the relational data Schedulea ′ that has been forcibly changed.
Relational data Schedulea 'after changing duleA'
(S35). On the other hand, if the same processing has not been performed, first, the flowchart shown in FIG. 7 is executed to change the master data (S36).

This flowchart shows a process for changing the master data. This process is performed in the data A 'back calculation processing section 49 shown in FIG. Forced relational data Schedu
In order to match relational data that has been subjected to processing different from leA ′, for example, Schedule A ″ to the relational data Schedulea ′ after being forcibly changed, the relational data Schedule A ″ is once inverted to the data before processing A Need to convert. In order to perform this reverse conversion, input / output collation of the processing is performed based on the input data 50A and the input data 50B (S4).
1). The processing data is grasped based on this input / output collation, and if the processing is performed, that is, if the input is not the same as the output, the back calculation is performed so that the input and the output are the same. , Change the corresponding item of the master data. In other words, the relational data Schedule A "
After the change to duleA ', the process is changed to Schedulea ". On the other hand, if the processing has not been performed, there is no need for the back calculation, so that the process of changing the corresponding item of the master data is performed. ′,
Change to Schedulea '(S43-S45). The above processing is performed until all the corresponding master data items are changed.

When the above processing is completed, the corresponding master data is returned to the original data before the processing, so that the relevant processing is re-executed, and the data after the execution is stored in the predetermined position ascertained by the data relational table. Is replaced with the data of In other words, if the relational data has not been processed, the relational data Schema
Replace duleA 'with Schedulea', and if the relational data has been processed, schedule
a 'is processed into Schedulea "(S37, S38). The above processing is performed for all the retrieved relational data (S39).

As described above, according to the embodiment of the present invention, when the master data is changed, all the same data as the master data before the change are converted into the same data as the master data after the change. Will be matched. On the other hand, when the local data is changed, all the same local data and master data as the local data before the change are rewritten with the data after the change. Therefore, it is not necessary to perform the operation for adjusting to the changed data as in the related art, and it is possible to completely solve the problem that the computer cannot be started due to an operation error or the like.

[0025]

As described above, according to the present invention, when the contents of the local data are changed, the host computer or the local computer can control the local data and the master data having the same contents as the local data before the change. Is searched from the local computer and the host computer, and if the same processing is performed on the searched local data as the changed local data, the searched local data is replaced with the changed local data. It performs a process to replace written to the data, on the other hand, Ken
What is the local data after changing to the searched local data?
If different processing is performed,
Of local data before processing to local data before processing
Local data after the reverse conversion of the searched master data.
Perform rewriting according to the data,
Local data searched against the master data
Since the same processing as that performed on the local data is performed and the searched local data is rewritten to the processed local data, an input operation for changing local data and master data is not required. In addition, there is no element of erroneous input of data, and even if the data is local data or master data in which processing is mixed, consistency can be automatically provided.

[Brief description of the drawings]

FIG. 1 is a diagram showing an example of an apparatus for realizing the method of the present invention.

FIG. 2 is a diagram showing an example of an apparatus for implementing the method of the present invention.

FIG. 3 is a diagram showing an example of a data relational table for realizing the method of the present invention.

FIG. 4 is a flowchart showing the procedure of the method of the present invention.

FIG. 5 is a flowchart showing the procedure of the method of the present invention.

FIG. 6 is a flowchart showing the procedure of the method of the present invention.

FIG. 7 is a flowchart showing the procedure of the method of the present invention.

FIG. 8 is a diagram illustrating an example of an apparatus that has performed a conventional method.

[Explanation of symbols]

Reference numeral 30: process control host computer, 32: database, 39: PLC, 42: local database, 4
5. Host computer.

Claims (1)

(57) [Claims] An automatic distribution system for distributed data used in a computer system including a host computer having master data and a local computer connected to the host computer and having local data of the same content as the master data. In the matching method, when the content of the local data is changed, the host computer or the local computer transmits the local data and the master data having the same content as the local data before the change to the local computer and the host. If a search is performed from the computer and the same processing is performed on the searched local data as the changed local data, a process is performed to rewrite the searched local data with the changed local data. , On the other hand, searched Local data after changing to local data
If processing different from the data
The searched local data is converted to the local data before processing.
Data is converted back to the master data
Performs processing to rewrite according to the local data , and searches the retrieved master data for the rewritten master data.
An automatic matching method of distributed data , wherein the same processing as performed on the cull data is performed, and the searched local data is rewritten to the processed local data.