JPH08171573A - Distributed arrangement device for drawing data - Google Patents

Abstract

PURPOSE: To enable properly distributed arrangement in the case where drawing data are divided into meshes of proper size and initially arranged in distributed data bases by deciding which management segment each mesh belongs to and holding the correspondence relation between the management segment and the mesh as arrangement information. CONSTITUTION: A drawing data input means 2 inputs the drawing data and a drawing data storage means 4 divides the inputted drawing data into meshes and stores the data in terms of a mesh. A border information input means 5 inputs border information determining management segments for managing the divided drawing data and a border information storage means 6 stores the border information. Then a data arrangement decision means 7 decides which management segment each data belongs to on the basis of the border information and generates the correspondence relation between the management segments and meshes as the arrangement information, and an arrangement information storage means 8 stores the arrangement information. Then a drawing data arranging means 9 stores the drawing data of the meshes in the data bases 32 to 37.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a drawing data distribution / arrangement device for managing a huge amount of drawing data having a two-dimensional spread by distributing and arranging it on a plurality of computers.

[0002]

2. Description of the Related Art FIG. 16 shows, for example, Japanese Unexamined Patent Publication No. 1-16233.
FIG. 10 is a block diagram showing a conventional data arrangement method shown in “Database arrangement method in distributed system” of Japanese Patent Publication No. In the above-mentioned conventional example, access from each computer to data respectively arranged in databases (hereinafter, DB) 23, 24, 25, 26 on a plurality of computers 27, 28, 29, 30 connected by a communication network. The situation is monitored using the DB access / monitoring means 18 in the figure, and the data arranged in each DB is transferred to the DB of the computer with high access frequency according to the frequency of access from each computer to the DB. It can be sequentially transferred and rearranged by using the control means 20.

Further, in the above-mentioned conventional example, when the access frequencies to the DB are the same among a plurality of computers, the database data can be transferred to the computer with the lowest data transfer cost by using the processing cost evaluation means 19 in the figure. it can. As described above, conventionally, after disposing data in a distributed database, by monitoring the access status of each computer to the DB, each data is rearranged in the DB closest to the computer that requires it. be able to.

[0004]

Since the conventional data allocation method is configured as described above, it is not possible to appropriately redistribute data by analyzing the access situation after the data is once allocated to the distributed database. Although it was possible, each data could not be properly initialized at the initial data input stage. Therefore, when the data is once placed in the distributed database and the data is appropriately placed again according to the access situation, the load of moving the data between the databases becomes considerably large, and the optimal placement takes time. Also, when new data was added to the distributed database, it could not be properly arranged, and data could only be transferred to an appropriate database after operating to some extent and monitoring the access status. . The present invention has been made to solve such problems,

A first object of the present invention is to obtain a drawing data distribution / arrangement device capable of carrying out an appropriate distributed arrangement when dividing drawing data into meshes of an appropriate size and initially arranging them in a distributed database. .

A second object is that even if the boundary information is changed midway due to a change in the drawing data operating method,
The purpose is to appropriately rearrange the drawing data among the distributed databases accordingly.

A third object is to optimally arrange drawing data appropriately arranged in a short time from the initial stage of distributed arrangement.

A fourth object is to dispose the same drawing data in a plurality of distributed arrangements to enhance the processing capability and improve the reliability.

[0009]

A drawing data distribution / arrangement apparatus according to the first invention is a drawing data inputting means for inputting drawing data, and a mesh for dividing each drawing data which is a unit for reading and writing inputted drawing data. Drawing data saving means for saving in units, boundary information inputting means for inputting boundary information for determining an area of a management division for dividing and managing drawing data, boundary information saving means for saving the boundary information, A data arrangement determination unit that determines which management section each mesh belongs to based on the stored boundary information based on a predetermined criterion, and generates a correspondence relationship between the management section and the mesh as arrangement information. Based on the arrangement information storage means for storing information and the arrangement information stored in the arrangement information storage means, the mesh drawing data belonging to the management division is transferred to the communication network. Disposed on a connected computer via the de - ate - drawing de Save to scan - those having a motor disposed means.

The drawing data distribution / arrangement apparatus according to the second invention uses boundary information input means for inputting boundary information for changing the boundary of the management section and boundary information after the change inputted by the boundary information input means. A data arrangement change determining means for determining which management category each mesh belongs to based on a predetermined criterion and generating arrangement information, and arrangement information generated by the data arrangement change determining means. Data arrangement changing means for changing the arrangement of the drawing data is provided.

According to a third aspect of the present invention, there is provided a drawing data distributing and arranging device which monitors access frequency of drawing data in mesh units arranged in a database by a plurality of computers and an access status monitoring means for monitoring the result. , Data for generating layout information by determining whether or not to move drawing data in mesh units to other management divisions so as to reduce the data transmission load transmitted / received between computers and to generate layout information. The data movement determining means and the data arrangement changing means for changing the arrangement of the drawing data based on the arrangement information generated by the data movement determining means.

The predetermined criterion according to the fourth aspect of the invention is to set the management section having the largest area of the management section in the mesh as the management section to which the mesh belongs.

The predetermined criterion according to the fifth aspect of the invention is to set the management section having the largest data amount of the management section in the mesh as the management section to which the mesh belongs.

The predetermined criterion according to the sixth aspect of the invention is that all the management divisions that occupy a mesh are the management divisions to which the mesh belongs.

The predetermined criterion according to the seventh aspect of the invention is based on the frequency of access to the drawing data by the computer and the area of the management division in the mesh corresponding to the drawing data.

The predetermined criterion according to the eighth aspect of the invention is based on the frequency of access to the drawing data by the computer and the data amount of the management division occupying the mesh corresponding to the drawing data.

[Action]

In the first aspect of the invention, the drawing data input means inputs the drawing data, and the drawing data saving means divides the inputted drawing data for each mesh which is a unit for reading and writing and saves the divided drawing data in mesh units. Boundary information input means inputs boundary information that determines an area of a management section for dividing and managing the drawing data, and boundary information storing means stores the boundary information. Then, based on the stored boundary information, the data arrangement determination means determines to which management section each mesh belongs to by a predetermined criterion, and generates a correspondence relationship between the management section and the mesh as arrangement information. The arrangement information storage means stores the arrangement information. Next, the drawing data arranging means, based on the arrangement information stored in the arrangement information storing means, connects the drawing data of the meshes belonging to the management division through the communication network to the computer. Save in the database located above.

In the second invention, the boundary information input means inputs boundary information for changing the boundary of the management section,
Based on the changed boundary information input by the boundary information input means, the data layout change judging means judges to which management section each mesh belongs, based on a predetermined criterion, and generates the layout information. To do. Then, the data arrangement changing means is
The layout of the drawing data is changed based on the layout information generated by the data layout change determining means.

In the third invention, the access frequency monitoring means monitors the frequency at which drawing data in mesh units arranged in the database are read and written by a plurality of computers. Then, based on the access frequency result monitored by the data movement determination means, whether or not the drawing data in mesh units should be moved to another management division in advance so that the data transmission load transmitted / received between the computers is reduced. Judgment is made based on the determined standard, and the arrangement information is generated. The data arrangement changing means changes the arrangement of the drawing data based on the arrangement information generated by the data movement judging means.

In the fourth aspect of the present invention, the predetermined criterion is that the management section having the largest area of the management section in the mesh is the management section to which the mesh belongs.

In the fifth aspect of the present invention, the predetermined criterion is that the management section having the largest data amount of the management section in the mesh is the management section to which the mesh belongs.

In the sixth aspect of the invention, the predetermined criterion is that all the management divisions that occupy the mesh are the management divisions to which the mesh belongs.

In the seventh invention, the predetermined criterion is based on the frequency of access to the drawing data of the computer and the area of the management division occupied in the mesh corresponding to the drawing data.

In the eighth invention, the predetermined criterion is based on the frequency of access to the drawing data of the computer and the data amount of the management division occupying the mesh corresponding to the drawing data.

[0025]

【Example】

Example 1. The present embodiment is intended to properly arrange the drawing data in the distributed database at the initial stage. FIG. 1 is a diagram showing a configuration of a data placement device according to an embodiment of the present invention. Reference numeral 1 is a central management node for distributively arranging drawing data. 31 is a database of the management node 1, A to F are computers, 32 to 37 are databases of computers A to F, 10 is databases 32 to 3.
7 is a distributed database management program for managing 7. Reference numeral 2 is a drawing data input means for inputting drawing data to the management node 1. Reference numeral 3 is a drawing data deleting means for deleting unnecessary drawing data.

A drawing data storage unit 4 stores the drawing data input by the drawing data input unit 2. 5
Is a boundary information input means for inputting a boundary line that determines a management division area for dividing and managing the drawing data. A boundary information storage unit 6 stores the boundary information input by the boundary information input unit 5.

Reference numeral 7 is a data arrangement determination means, which determines which drawing data is to be arranged in the databases 32 to 37 of which computers A to F by using the drawing data in mesh units and the boundary information according to a predetermined standard. judge. For example,
It is determined that the mesh belongs to the management section having the largest mesh area or data amount occupied by each management section on the drawing, and the databases 32 to 37 corresponding to the management sections A to F are determined.
To place. Reference numeral 8 denotes a layout information storage unit which stores layout information indicating in which database 32 to 37 the drawing data is to be arranged. A drawing data arranging unit 9 arranges each drawing data in each of the databases 32 to 37 according to the arrangement information. 11 is a distributed database management program 10
It is a network communication means for transmitting and receiving data between the computers A to F having.

Next, the operation of this embodiment will be described. In the present embodiment, when compared to a map, the management divisions are divided into management boundaries such as boundaries of prefectures and administrative areas. Handle data. In this embodiment, these data are used as drawing data. In such data, in addition to the drawing body, there is boundary line data representing the management boundary of the drawing such as the prefectural boundary of the map. In the drawing data input means 2, the user creates all the drawing data managed by the distributed databases 32 to 37 as initial data using a commercially available CAD or the like, and inputs it to the management node 1.

At this time, in the case of drawing data having a two-dimensional wide spread, if the entire range is treated as one drawing, the amount of data becomes enormous and the operation becomes difficult. It is necessary to divide and handle. Therefore, when all drawing data is read and written, it is divided into mesh units of a size suitable for reading and writing, and when managing drawing data, all drawings are divided into management sections and managed. The management division manages drawing data in mesh units, and each mesh belongs to one of the management divisions. Drawing data is input in mesh units. FIG. 2 shows an example in which the entire range of drawing data is divided into meshes. In the example of FIG. 2, the total drawing data is 15
It is divided into meshes. Drawing data input means 2
The entire drawing data input by the user at 1 is temporarily stored in the drawing data storing means 4. The management division is an area delimited by a boundary line on the drawing, and the user inputs the management division area on the drawing by the boundary information input means 5.

The boundary information input means 5 displays the drawing data stored in the drawing data storage means 4 on the screen of the management node 1 (not shown) prior to inputting the boundary information. The user inputs the data of the management boundary line to the management node 1 by drawing the boundary line indicating the management division on the drawing data displayed on the screen. An example of the boundary line drawn on the drawing is shown in FIG. The figure shows an example in which the management lines A to F are divided by a boundary line. The boundary information input by the user in the boundary information input means 5 is stored in the boundary information storage means 6.

Next, the procedure for deciding to which management section A to F the drawing data input by the drawing data input means 2 and divided into 15 meshes stored in the drawing data storage means 4 will be described below. explain. However, in this embodiment, the respective management sections A to F correspond one-to-one to the computers A to F connected by the communication network, and the databases 32 to 3 are used.
7 also shows an example corresponding one-to-one.

FIG. 4 shows the processing flow of the data arrangement determination means 7.
Shown in In addition, in the explanation of the flow chart, management classification A to.
F is also described as management divisions 1 to 6. In the figure, in step 1, the data arrangement determination means 7 is the drawing data storage means 4
The drawing data for 15 meshes stored in is read. In step 2, the boundary information stored in the boundary information storage means 6 is read. Here, the boundary information stored in the boundary information storage means 6 is the data of the boundary line of the management section shown in FIG. 3, and each is stored in the form of vector data. Step 3 repeats Steps 4 to 7 as many times as the number 15 of meshes of drawing data. In step 4, the data allocation determining means 7 determines the areas Si1 to Si6 occupied by the management sections 1 to 6 (the management sections 1 to 6 correspond to the computers A to F) in the mesh of number i (i = 1 to 15). calculate.

At step 5, the maximum area Sij is obtained from the areas Si1 to Si6 calculated at step 4, and j at this time is set as the management section j to which the mesh i belongs. In addition, when there are a plurality of maximum values j, the smallest j
Is a management section j to which the mesh i belongs. Step 6
Then, the data arrangement determination means 7 stores the relationship between the mesh i determined in step 5 and the management section j to which it belongs in the arrangement information storage means 8. In step 7, the maximum area Sij of the areas Si1 to Si6 obtained in step 5 is stored in the layout information storage means 8.

That is, the arrangement information storage means 8 stores the relationship between the mesh number i and the management section j to which it belongs and the area Sij for it. In the example of FIG. 3, the area S (2) A has the maximum value and the area S (2) D has the next area for the mesh (2). Remaining area S (2) B, S (2) C, S (2) E, S
(2) F is all 0. Therefore, the management division to which the drawing data of the drawing number (2) belongs is the management division A in the example of FIG. That is, in the above example, the management category that includes the largest range for each mesh is the management category to which the mesh belongs.

Next, an example of arranging drawing data in each database will be shown. The drawing data arranging means 9 reads the drawing data of each mesh from the drawing data storing means 4 according to the judgment result of the data arrangement judging means 7. Then, the distributed database management program 10 is instructed to arrange the drawing data in the databases 32 to 37 of the computers A to F corresponding to the management division to which each mesh belongs. Database 3 with database management program 10 specified
The drawing data of the mesh are arranged in 2-37. FIG.
In the above example, the drawing data of the meshes (1) and (2) are arranged in the database 32 of the computer A of the management division A.

Database 33 of computer B in management category B
The drawing data of the meshes (6) and (11) are arranged in. What is arranged in the database 34 of the computer C of the management section C is the drawing data of the mesh (12). What is arranged in the database 35 of the computer D of the management division D is
It is drawing data of meshes (3), (7), (8), (9), (10), (13) and (14). Database 3 of computer E of management division E
Arranged in 6 is drawing data of meshes (4) and (5). Arranged in the database 37 of the computer F of the management section F is the drawing data of the mesh (15). FIG. 5 shows the result of arranging the drawing data of each mesh in the databases 32-37 of the computers AF corresponding to each management division.

According to the above example, by providing the boundary information input means 5, the boundary information storage means 6 and the data arrangement determination means 7, the drawing is divided into mesh units, and the computer corresponding to the management division to which each mesh belongs. When the drawing data of the mesh is arranged in the databases 32 to 37 of A to F and one mesh spans a plurality of management divisions, the computers A to F corresponding to the management divisions having a large mesh area belonging to each management division. Since the drawing data of the mesh is arranged in the databases 32 to 37 of No. 3, each drawing data can be initially arranged in the appropriate databases 32 to 37 on the distributed database management program 10.

In the above example, the data arrangement determination means 7
In the above, the layout of the drawing data is determined by calculating the areas Si1 to Si6 occupied by the ranges of the management classifications 1 to 6 for the drawing data of the mesh number i. Regardless of the area, when the data is concentrated locally, and the drawing data amount depends on the management division, by calculating the data amount Dij in the management division instead of the area of the management division,
Similarly, an appropriate initial arrangement can be made according to the amount of data. FIG. 6 shows a processing flow of the data arrangement determination means 7 at this time. In this flowchart, the area Sij in FIG.
Since it has been rewritten as ij, its explanation is omitted.

In the above example, one mesh belongs to any one management section. However, if there are a plurality of management sections including one mesh in the drawing, the meshes are duplicated and a plurality of management sections are included. You may belong to the management division.
That is, although the data arrangement determination means 7 arranges only one drawing data of each mesh in the databases 32-37 of any of the computers AF, the drawing data of each mesh includes the mesh. It is also possible to duplicately arrange them in the databases 32 to 37 of all the management divisions. FIG. 7 shows the result of overlapping arrangement in the example of FIG. For example, in the example of FIG. 3, the mesh 7 has management sections A, B,
It can be seen that the mesh 7 is arranged in the database of the computers A, B, C and D included in C and D and shown in FIG. 7.

It is necessary to always maintain the consistency of the redundantly arranged databases. That is, if one of the duplicates cannot be updated when an update request is made to the database, a contradiction occurs in the database. Therefore, it is performed by using the two-phase commit function of the distributed database management system which confirms in advance that all the overlapping databases 32 to 37 can be updated. Since the drawing data of the same mesh is duplicated in a plurality of databases, the load of access to the drawing data is distributed, the processing capacity is improved, and the drawing data can be accessed in real time. Further, even if the drawing data of one mesh cannot be accessed due to a failure, the drawing data of another database can be used as a substitute, so that the reliability is improved.

When one mesh belongs to one management section, the drawing data of the mesh is arranged as master data in the database corresponding to the management section and corresponds to other management section including the mesh on the drawing. It is also possible to place a copy of the drawing data in the database.
However, the duplicate database data is managed by the distributed database management program so that it is not accepted except for the update from the master data. An example of duplicating the mesh 7 will be described with reference to FIGS. 3 and 8. In FIG. 3, the mesh 7 is included in the management section ABCD, but the area occupied by the management section D occupies the mesh 7 at the maximum. Therefore, as shown in FIG.
The master drawing data is arranged in the database 35 of the computer D, and the copy of the drawing data of the mesh 7 is arranged in the other management sections A, B and C including the mesh 7.

The data is updated to the master data, and the data update made to the master data is regularly reflected in the duplicated data. Therefore,
This method is possible when it is not necessary to refer to the master data managed by other computers AF in real time. By associating the mesh with the distributed database as described above, it is possible to improve the processing capacity by distributing the access load in a database such as a map that has a low update frequency and a high read frequency. Further, since the drawing data of the mesh is duplicated and held, even if the drawing data of one mesh cannot be accessed due to the occurrence of a failure, the drawing data of another database can be taken over and reliability is improved.

Further, in the above example, in the boundary information input means 5, the user draws a boundary line indicating a management section on the drawing data displayed on the screen, so that the drawing data is divided into several management sections. Input the information to divide into, but instead of the user directly inputting it on the screen of the computer of the management node 1, enter the boundary line on the paper drawing in advance and apply it to the drawing recognition device. It is also possible to recognize and input the boundary line. Further, in the above example, an example in which the drawing data is divided and managed in a mesh shape as shown in FIG. 2 has been described, but the same purpose can be achieved even if the drawing data is divided into shapes other than the mesh. In addition,
The database 31 of the management node 1 may be incorporated into the drawing data database.

Example 2. In this embodiment, when the boundary information is changed, an appropriate rearrangement is attempted. The configuration according to this embodiment is shown in FIG. In the figure, reference numeral 15 is a data arrangement changing means for changing the arrangement of the corresponding drawing data among the databases 32 to 37 according to the new boundary information inputted by the boundary information inputting means 5. Others are the same as the configuration of the first embodiment shown in FIG.

Next, the operation will be described. After the initial drawing data are distributed and arranged in the databases 32 to 37 of the computers A to F by the method described in the first embodiment, the user inputs new boundary information by the boundary information input means 5. At this time, the drawing data of the drawing to be displayed to the user for reference of the boundary line drawing is the latest drawing data in the databases 32-37 of each distributed database management program 10. Then, the newly input boundary information is stored in the boundary information storage means 6. Further, the data placement determination means 7 redetermines the placement location of the drawing data of each mesh based on the changed boundary information by the method described in FIG. 4 or FIG. 6 of the first embodiment to obtain new placement information. It is added to the arrangement information storage means 8 as the changed arrangement location.

The data arrangement changing means 15 refers to the current arrangement location and the changed arrangement location of the mesh-based drawing data in the arrangement information storage means 8 and distributes the movement of data necessary for changing the drawing data arrangement. Instruct the database management program 10 to execute the distributed database management program 10
Moves the data according to the instructions. FIG. 10 shows a processing flow of the data arrangement changing means 15. In the figure, in step 1, the data arrangement changing means 15 reads the current arrangement information and the changed arrangement information for 15 meshes stored in the arrangement information storing means 8. I = 1 to 1 in step 2
In step 5, step 3 to step 7 are repeated 15 times as many times as the number of meshes of drawing data. In step 3, the data layout changing unit 15 manages the drawing data of the mesh number i read from the layout information storing unit 8 and the management classification j to which it belongs, that is, the drawing data of the mesh number i and the distributed database management in which it is arranged. The current relationship with the databases 32 to 37 of the program 10 is compared with the modified relationship, and it is checked whether the relationship has changed.

If the current relationship and the changed relationship have changed, the process proceeds to step 4. In step 4, the data arrangement changing means 15 uses the distributed database management program 10 of the computers A to F in which the drawing data of the mesh number i to which the management division to which the data belongs is changed.
The distributed database management program 10 is instructed to retrieve from the databases 32 to 37. Upon receiving this command, the distributed database management program 10 fetches the drawing data from the designated databases 32 to 37. In step 5, an instruction is issued to the distributed database management program 10 to send the drawing data of the mesh number i extracted in step 4 to the databases 32-37 of the computers AF of the changed management classification. Upon receiving this command, the distributed database management program 10 sends the drawing data of the specified databases 32 to 37.

In step 6, the data arrangement changing means 15
Issues a command to delete the drawing data of the mesh number i from the databases 32 to 37 of the computers AF in the current management section, and deletes the drawing data from the databases 32 to 37 designated by the distributed database management program. . In step 7, the data layout changing means 15 deletes the current relationship between the drawing data of the mesh number i stored in the layout information storing means 8 and the management division j to which it belongs, and the changed relationship is changed to the current one. Update as a relationship. 11 and 12 show an example of changing the boundary information and an example of moving the mesh drawing data accordingly. FIG. 11 shows an example in which after the initial input in the state of FIG. 3, one management boundary line is changed, and as a result, the management classification to which the drawing data of mesh number (7) belongs is changed to C. There is. 12
Is the mesh number (7) by the data arrangement changing means 15.
Of the drawing data is transferred from the database 35 of the computer D to the database 34 of the computer C that manages the data of the new management section C.

According to the above example, the data arrangement changing means 15
If a part of the boundary information is changed by setting, the changed part is judged based on a predetermined criterion and the arrangement is decided, so that the appropriate arrangement can be made. The state can be continued and can be rearranged appropriately in a short time. In the second embodiment, an example in which the management classification and the number of computers A to F corresponding thereto are not changed is described. However, even when the number of computers is increased or decreased or the drawing data is increased or decreased, the boundary is the same as above. The data arrangement can be changed by changing the information. The database 31 of the management node 1 may be incorporated in the drawing data database.

Example 3. In this embodiment, the drawing data is appropriately arranged according to the operation status. The configuration according to this embodiment is shown in FIG. In FIG. 13, 16
Is an access status monitoring means for monitoring the frequency of access from the terminals of the computers A to F connected by the network communication means to the databases 32 to 37 of the computers AF. An access status information storage unit 17 stores the information monitored by the access status monitoring unit 16. Reference numeral 22 denotes a data movement determination means, which uses the information stored in the arrangement information storage means 8 and the access status information storage means 17 to determine the destination of the data movement on the databases 32-37 of the computers AF. Others are the same as the configuration of FIG. 9 of the second embodiment,
Omit the explanation.

Next, the operation will be described. After the initial drawing data is distributed and arranged in the databases 32 to 37 of the computers A to F by the method described in the first embodiment, or after the boundary information is updated and the drawing data is rearranged, the access status monitoring means 16 operates. , Database 3 of each computer AF
It is monitored from which computer A to F the mesh drawing data of each of the computers 2 to 37 is accessed for a certain period of time, and the results are stored in the access status information storage means 17. Then, the data movement determination means 22 periodically compares the frequency of access from the computers A to F having the drawing data and the access from the other computers AF to the drawing data of each mesh. . If the accesses from the other computers A to F are more frequent than the accesses from the computers A to F having the drawing data, the drawing data of the mesh is rearranged.

For example, the drawing data of the mesh (13) of FIG. 3 includes the drawing data included in the management section C and the drawing data included in the management section D. According to the data arrangement determination means 7 described in the first embodiment, as shown in FIG. 5, the drawing data of the mesh (13) is arranged in the database 35 of the computer D of the management division D. FIG. 14 shows an example of information stored in the access status information storage means 17 after the access status monitor means 16 monitors the access status to each of the databases 32 to 37 for a certain period. In the figure, the management divisions with bold numbers represent computers AF having the drawing data of the mesh. According to Figure 14, mesh
It can be seen that the number of accesses to the drawing data in (7) is greater from the computer B than from the computer D.

Next, the ratio of the access frequencies of the computer D and the computer B with respect to the drawing data of the mesh (7) and the management division D by the data arrangement determination means 7 described in the first embodiment.
And the area ratio of the management section B are compared to determine the new location of the drawing data of the mesh (7). The processing flow of the data movement determination means 22 at this time is shown in FIG.
Shown in In the figure, in step 1, the data movement determination means 22 reads the current layout information for 15 meshes stored in the layout information storage means 8. In step 2, the data movement determination means 22 reads from the access status information storage means 17 a frequency Fij at which the computers A to F access drawing data in mesh units held by the databases 32 to 37 of the computers A to F.

The access frequency Fij represents the number of times of access to the drawing data of the mesh number i from the computer that manages the management division j in a certain fixed period. I = of step 3
In steps 1 to 15, steps 4 to 10 are repeated 15 times as many times as the number of meshes of drawing data. Step 4
Then, the data movement determination means 22 sets the access frequency Fij (j = 1 to 6) of the computer that manages the management division j (j = 1 to 6) in a certain predetermined period to the drawing data of the mesh number i. The maximum value Fib of them is calculated. B is the management classification at that time. In step 5, the data movement determination means 22 determines the access frequency Fib calculated in step 4 and the access frequency Fia from the computer of the management section A that is currently managing the drawing data of the mesh number i to the drawing data of the mesh number i. To compare. If the access frequency Fib is smaller, the process returns to step 3.

If the access frequency Fib is higher, it means that the drawing data of the mesh number i is accessed more frequently from the management section A, so that the layout of this drawing data is changed from the management section A to B. Go to step 6 to proceed with the procedure. In step 6, the data movement determination means 22 determines the access frequency ratio Fib / Fia and the area ratio Sia / S.
It is compared with ib multiplied by a weighting coefficient k (k = 0.0 to 1.0). The area Sia is the area occupied by the range of the management division A for the drawing data of the mesh number i, as described in the first embodiment. k is a coefficient for weighting the influence of the area ratio Sia / Sib. This is to simply compare the access frequencies and relocate to a management division with a high frequency.
On average, the larger the area, the higher the access frequency. Therefore, in order to avoid unnecessary data layout change based on a temporary exceptional increase, the layout change is determined by considering the influence of the area ratio. Therefore, the above comparison is performed.
Here, k is set to k = 1 in order to increase the influence of the area when the access frequency is high in proportion to the area on average, and the access frequency is averaged as in an example in which data is concentrated in a specific place. When it is not proportional to the area, the value of k is made smaller than 1 according to the degree. Further, when the movement is determined only by the access frequency, k = 0. If the access frequency ratio Fib / Fia is smaller, the process returns to step 3. If the access frequency ratio Fib / Fia is larger, step 7
Go to.

In step 6, the data amount ratio Dia / Dib may be used in place of the area ratio Sia / Sib for determining the data arrangement change. Data amount Dia
Is the amount of data included in the arrangement section A in the drawing data of the mesh number i, as described in the first embodiment. Extract drawing data in step 7, send drawing data in step 8, delete drawing data in step 9, step 1
The updating of the arrangement information of 0 is the same as that of step 4 to step 7 of FIG. 10, and thus the description thereof is omitted here.

As described above, according to the present embodiment, the boundary information input by the user to the management node 1 is provided by providing the access status monitoring means 16, the access status information storage means 17, and the data movement determination means 22. Based on the drawing data initial arrangement based on the above, the drawing data is arranged so as to reduce the data transfer load between the computers A to F according to the access frequency monitoring result, so that the optimum arrangement can be performed in a short time. The database 31 of the management node 1 may be incorporated in the drawing data database.

[0058]

According to the first aspect of the present invention, a drawing is divided into mesh units, and the drawing data of the mesh is placed in a database corresponding to a management division according to a predetermined standard. It can be initially placed in the appropriate database on the management system.

According to the second aspect of the invention, when a part of the boundary information is changed, the changed part is judged based on a predetermined criterion and the arrangement is decided. The optimally placed state up to that point can be continued, and appropriate relocation can be performed in a short time.

According to the third aspect of the present invention, the initial arrangement of drawing data based on the boundary information is used as a base rather than the conventional arrangement in which the initial arrangement is randomly arranged without any special consideration and the optimum arrangement is made based on the access situation monitoring result. Since the optimum allocation is performed based on the monitoring result, it is possible to reduce the load of data movement between databases at the time of data reallocation and optimize the data allocation in a short time.

According to the fourth aspect, when the amount of drawing data depends on the area occupied by the mesh, the drawing data of the mesh is arranged in the management section having the largest area occupied by the mesh, so that the layout can be appropriately arranged.

According to the fifth aspect, when the drawing data amount depends on the management division, the drawing data of the mesh is arranged in the management division having the largest data amount occupying the mesh, so that the appropriate arrangement can be achieved.

According to the sixth invention, since the drawing data of the same mesh is arranged in a plurality of databases, the load of access to the drawing data is dispersed, the processing capability is improved, and the drawing data can be accessed in real time. Further, even if the drawing data of one mesh cannot be accessed due to a failure, the drawing data of another database can be used as a substitute, so that the reliability is improved.

According to the seventh invention, since the data movement is judged based on the frequency of access to the drawing data of the computer and the area of the management section occupying the mesh corresponding to the drawing data, the temporary access frequency Optimal layout of drawing data can be avoided by avoiding unnecessary movement of data due to increase.

According to the eighth invention, the data movement is judged based on the access frequency to the drawing data of the computer and the data amount of the management division occupying the mesh corresponding to the drawing data. It is possible to avoid the unnecessary movement of data due to the increase in the number of data and arrange the optimum drawing data.

[Brief description of drawings]

FIG. 1 is an overall configuration diagram of a data placement device according to a first embodiment of the present invention.

FIG. 2 is a diagram showing an example in which the entire drawing data is divided into 15 units in a mesh shape.

FIG. 3 is a diagram showing an example in which a user inputs a management boundary for drawing data.

FIG. 4 is a diagram showing a processing flow of data placement determination by area according to the first embodiment of the present invention.

FIG. 5 is a diagram showing an example in which drawing data divided into 15 according to the first embodiment of the present invention is arranged in a database of computers of five management divisions.

FIG. 6 is a diagram showing a processing flow of data arrangement determination according to the data amount according to the first embodiment of the present invention.

FIG. 7 is a diagram showing an example in which drawing data of each mesh according to the first embodiment of the present invention is arranged in a database of computers of all management divisions including the mesh in an overlapping manner.

FIG. 8 is a diagram showing master data of drawing data of each mesh according to the first embodiment of the present invention, which is arranged in a database, and the master data is duplicated in the database of the computer of the management division including the other meshes. It is a figure which shows the example arrange | positioned.

FIG. 9 is an overall configuration diagram of a data placement device according to a second embodiment of the present invention.

FIG. 10 is a diagram showing a processing flow of data arrangement change according to the second embodiment of the present invention.

FIG. 11 is a diagram showing an example in which a user changes a management boundary for drawing data.

FIG. 12 is a diagram showing an example in which the arrangement of the drawing data arranged in the database of the computer is changed by the data arrangement changing process according to the second embodiment of the present invention.

FIG. 13 is an overall configuration diagram of a data placement device according to a third embodiment of the present invention.

FIG. 14 is a diagram showing an example of access status information according to a third embodiment of the present invention.

FIG. 15 is a diagram showing a processing flow of data movement determination according to the third embodiment of the present invention.

FIG. 16 is a block diagram showing a conventional data arrangement method.

[Explanation of symbols]

1 Computer as Management Node 2 Drawing Data Input Means 4 Drawing Data Saving Means 5 Boundary Information Inputting Means 6 Boundary Information Saving Means 7 Data Allocation Judging Means 8 Layout Information Saving Means 9 Drawing Data Allocation Means 10 Distributed Database Management Program 11 Network Communication Means 15 data arrangement changing means 16 access status monitoring means 17 access status information storage means 22 data movement determination means AF Computers corresponding to each management division 32-37 Database of distributed database management system

─────────────────────────────────────────────────── ─── Continuation of the front page (51) Int.Cl. ⁶ Identification code Internal reference number FI Technical display location G06T 1/00 9365-5H G06F 15/62 P 9365-5H 335

Claims (8)

[Claims] 1. A drawing data distribution arrangement apparatus having the following components. 1. 1. Drawing data input means for inputting drawing data; 2. Drawing data storage means for dividing the input drawing data into meshes, which are units for reading and writing, and storing the mesh data in mesh units. 3. Boundary information input means for inputting boundary information that determines an area of a management division for dividing and managing the drawing data. 4. Boundary information storage means for storing the boundary information; A data arrangement that determines which management section each mesh belongs to based on the stored boundary information based on a predetermined criterion, and generates a correspondence relationship between the management section and the mesh as arrangement information. Determination means, 6. 6. Location information storage means for storing the location information; Based on the layout information stored in the layout information storage means, the drawing data of the meshes belonging to the management section is displayed.
Drawing data arranging means for storing data in a data base arranged on a computer connected via a communication network. 2. The drawing data distributing and arranging device according to claim 1, which has the following components. 1. 1. Boundary information input means for inputting boundary information for changing the boundary of the management division. Based on the changed boundary information inputted by the boundary information input means, it is judged which management section each mesh belongs to by a predetermined criterion, and the data arrangement change judgment is made to generate arrangement information. Means, 3. Data arrangement changing means for changing the arrangement of the drawing data based on the arrangement information generated by the data arrangement change judging means. 3. The drawing data distributing and arranging device according to claim 1, comprising the following components. 1. 1. Access status monitoring means for monitoring the frequency with which the mesh-based drawing data arranged in the database is read and written by the computers. Based on the monitored access frequency result, the data for transmitting / receiving the drawing data in mesh units between the computers
2. A data movement judging means for judging whether or not to move to another management section based on a predetermined criterion so as to reduce the data transmission load, and generating arrangement information. Data arrangement changing means for changing the arrangement of the drawing data based on the arrangement information generated by the data movement judging means. 4. The predetermined standard according to claim 1, wherein the management section having the largest area of the management section in the mesh is set as the management section to which the mesh belongs. Drawing data distribution device. 5. The predetermined criterion is that the management division having the largest data amount of the management division occupying the mesh is set as the management division to which the mesh belongs. Drawing data distribution arrangement device. 6. The predetermined criterion is that all the management divisions that occupy the mesh are the management divisions to which the mesh belongs.
The device for distributing and arranging drawing data described in. 7. The method according to claim 3, wherein the predetermined criterion is based on the frequency of access to the drawing data of the computer and the area of the management section occupying the mesh corresponding to the drawing data. Drawing data distribution arrangement device. 8. The method according to claim 3, wherein the predetermined criterion is based on a frequency of access to the drawing data of the computer and a data amount of a management section occupying a mesh corresponding to the drawing data. Drawing data distribution arrangement device.