JPH08263336A - Design job support system and data base processor for the support system - Google Patents

Abstract

PURPOSE: To improve the processing speed when the data are retrieved out of a data base. CONSTITUTION: This system includes a data base 5 which includes plural data store areas 12 that are set in the different formats according to the types of data, an area management part 14 which monitors the areas 12 of the base 5, produces the new areas 12 based on each format when the number of data types exceeds the prescribed value, and sets the data retrieval priority in the order of production of areas 12, a data management part 15 which calculates the order of data retrieval priority based on the reference frequency of data stored in the areas 12 and the difference between the latest reference time and the present time and reverses the data so as to store them in the areas 12 having high retrieval priority in the order of their higher priority levels, and a means which refers to the data in the order of areas 12 of higher priority levels.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a design work support system and a database processing device in the system, and more particularly to a plant design work support system for supporting plant design work and a database processing device for the system. The present invention relates to a design work support system and a database processing device of the system, which improves a processing speed when searching a database for data necessary for work.

[0002]

2. Description of the Related Art Two prior art examples will be described. In the database search processing, as shown in Case 1, Case 2, and Case 3 showing the relationship between the search processing time and the number of pieces of search base data in FIG. 10, the data search processing time is stored in the data storage area. It depends on the number of data, that is, the number of mothers, and as the number of mothers increases,
The processing time for the number of data items increases. In FIG. 11, when the database 5 is constructed, it is usually defined by the format 9 including a plurality of data types, and is used for graphic data, specification numerical values, etc.
Prepare multiple formats according to the purpose of data usage.
One piece of data (one row) is referred to as one record 6, and a data storage area in which a plurality of the records 6 are stored, that is, a container is referred to as a file 7. The normal database 5 has one data storage area (file) 7 as shown in FIG. 11, and when data is registered,
All data is stored in this data storage area. Therefore, even when referring to data, the data storage area is accessed in all cases. In the related art, since the correspondence when the amount of data increases is not taken into consideration, the total number of data items stored in the data storage area, that is, the number of mother items, increases, and the search time increases. Therefore, in order to improve the search time, it is necessary to reduce the number of cases in each data storage area,
That is, it was necessary to provide a function of restricting each data storage area from storing more than a certain number of data.

Next, for each data in the database,
A prior art in which priority is given and data is processed based on this priority will be described with reference to FIG. In the prior art, when searching data from the database 5, a search is performed according to the search condition, a record that meets the search condition is selected, and, for example, two search conditions A and B are selected.
On the other hand, when referring to the data whose condition is A or B, the data which meets the condition A has a higher priority, and the data which meets the condition B has the next higher priority. The order of priority is higher in ascending date.

That is, the record that satisfies the condition A and has the newest registration date has the highest priority, and the record that satisfies the condition B and has the oldest registration date has the lowest priority. The priority is added to the record by the method of. Next, the data is rearranged according to this priority order and displayed on the display device 10 in order. That is, this priority order is the priority order for displaying on the screen. Further, at the stage of performing the search processing, the processing time for rearranging the data according to the priority order determined by the search condition by the above-described mechanism is included in the search processing time, which affects the increase of the search processing time. It was Therefore, prior to performing the search process, data such as the priority order of data, the number of times of reference and the registration date and time for automatically determining the priority order should be recorded together with each record, or the data may be stored in advance according to the priority order. It was necessary to provide a function for rearranging and storing.

[0005]

In the above-mentioned prior art, appropriate measures have not been taken to suppress the data retrieval processing time which increases with the increase in the number of mother cases. Also,
Even when considering the priority equivalent to the weighting of data, the priority only when displaying the screen after searching is attached to the data, and the priority when searching from the database is
It was attached at the time of storage in the database, and no consideration was given to reducing the time for data retrieval processing. Also, in the determination of the priority, it is not considered to prioritize in consideration of both the number of times data is referred to and a time factor.

In the plant design work, the number of data items in the database becomes enormous, so that the response of the database search process is deteriorated and there is a problem in design efficiency. Also, when prioritizing each data, the data to be used is different for each delivery destination, so the priority of each data does not change as the design work progresses depending on the delivery destination of the plant equipment. , There is a problem in design efficiency.

An object of the present invention is to solve the above-mentioned problems of the prior art, to appropriately search a database for a huge amount of data used in the design work of a plant having different specifications for each customer, and to reduce the search processing time. It is about shortening and achieving rationalization of design work.

[0008]

In order to achieve the above object, the invention claimed by the present invention is as follows. (1) On a computer equipped with a database, design including means for accessing the database and means for referring to required data from the database according to search conditions and performing plant design work based on the referred data In the business support system, the database having a plurality of types of data storage areas set according to the format depending on the type of data and the data storage area of the data registered in the database are monitored, and the number of data in the data storage area is predetermined. When the value exceeds the value, a new data storage area is created according to the format of the storage area, and the area management means assigns the priority order of data retrieval in the order of creation of the data storage area, and exists in the data storage area. Based on the reference count of each data and the difference between the latest reference time and the current time Then, the search priority of each data is calculated, and the data management means that replaces the data so that the data is stored in the data storage area with the highest priority in the data search processing in order from the data with the highest priority. A design work support system comprising: means for referring to data in the order of storage areas having a high priority.

(2) Design having means for accessing the database on a computer equipped with the database and means for referring to required data from the database according to search conditions and performing a plant designing operation based on the referred data In the database processing device of the business support system, the data storage area of the data registered in the database is monitored at any time, and if the number of data items in the data storage area exceeds a certain number, a new data storage area is created. , A method of assigning a priority when retrieving data in the order of creating the data storage area, and the cumulative value of the number of reference times and the latest reference time attached to each data (record) of each data existing in the data storage area And the current time are used to calculate the weighted average, and this average is used as the priority of the data. Database processing in a design work support system characterized by having means for calculating priority and replacing data at any time so that data with higher priority are stored in a data storage area with higher priority for data retrieval in order apparatus. (3) In claim 2, the priority of each data is: priority = α × (reference count (times)) − (1-α) × (latest reference time−current time (seconds)) where α Is a database processing device in a design work support system, characterized in that it is provided with means for calculating by a constant that is set depending on whether the priority is determined or the time factor when determining the priority.

[0010]

By using the means as described above, the number of data items stored in one data storage area is automatically controlled and suppressed to a certain value or less, so that the search processing time for each data storage area is shortened. it can. In addition, each data storage area is given a priority for search processing in the order of generation, and data with a high priority is stored in order from the data storage area with a high priority for search processing. It is enough to check the number of matching data and search for the number of data in order from the data storage area with the highest priority of search processing until the required number of data is satisfied. Speed is improved. This substantial data weight differs depending on the plant design of each customer, and as each customer progresses, the substantial data weight of the data related to this customer improves, that is, the priority increases. As a result, the data processing speed can be improved. For example, when an order for a plant is received from a customer named ABC, the design work of the plant to be stored in ABC is started, the number of times the customer uses the data of ABC from the database increases, and the design work currently in progress is targeted. Since it is a delivery destination, the latest data reference time also becomes large. As a result, the values of the reference count and the latest reference time are increased in the above priority calculation formula, and the priority is improved as a result. At the start of designing a new customer, the data group in the database, which is important for the customer, may have a low priority and the database search processing may slow down, but the plant design work continues for a long time. Also, the number of times a certain type of data is referenced has increased dramatically, and the priority of the data group in the database used by this customer has gradually increased during this period, from the beginning to the end of plant design work for one customer. Considering the whole, the database search processing efficiency is improved, and the efficiency of plant design work can be improved.

[0011]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The object of the present invention can be achieved by the system configuration as shown in FIG. 1 and by using the following means. Examples of the present invention will be described below. In the plant design support system that performs processing using the plant information accumulated in the database 5 on the computer 13 that can access the database 5, how many data are currently registered in each data area 12 in the database 5. If there is a data storage area where the number of data items exceeds a certain threshold value, create a new data storage area according to the format of the data storage area and search for the data in the order in which the data storage area was created. The area management unit 14 which assigns the priority order of processing, and the priority of the data registered in each data storage area 12 is calculated by the following priority calculation formula using the reference count, the latest reference time, and the current time. Priority = α × (reference count (times)) − (1-α) × (latest reference time−current time (seconds)) where α is the priority When determining the priority, a constant that is set depending on whether the reference count or the time factor is weighted, the priority of the data stored in each data storage area are sequentially compared, and the search processing is performed in order from the highest priority data. The data management unit 15 replaces data at any time so that the data is stored in the data storage area having the highest priority. Here, the high priority means that the value of the priority is large.

In the database 5, a data storage area 12 according to a different format is initially prepared for each purpose of use of data, one for each type of format.
For example, for the purpose of storing the dimensions of the boiler, one data storage area having a format such as the data format 11 of FIG. 2 is prepared, and design information such as other design specification numerical format and design drawing format is stored. Data storage areas are prepared for all the formats considered necessary for this purpose. In this format, not only the data read and written by the user of the database 5 but also the cumulative reference count indicating how many times this data has been referred to and the time of the latest reference are recorded for each reference. Set up each item. For example, in the case of the data A20 of FIG. 6, the cumulative reference count indicating how many times the data A20 has been referenced is recorded in the item of the reference count, in this case, once, and the latest reference time is: In the reference time item, in this case, for example, 9401 that represents 1:01:01 on January 1, 1994.
It is recorded as 01010101. When data is registered in the database 5, the data is always stored in the data storage area created according to the format in which the data should be stored. In addition, if the maximum number of items that can be stored in this data storage area is set as a threshold value, and the number of data items existing in the data storage area exceeds the threshold value due to the data being stored one after another, The management unit 14 creates a new data storage area according to the same format as the data storage area exceeding the threshold value. As a result, the search processing time for each data storage area is
It can be kept below a certain value. Furthermore, the area management unit 14
According to the order of the created data storage areas, the data storage areas are given a priority order when searching for data. When performing a data retrieval process, the data storage area with the highest priority is sequentially processed.

Next, for the data stored in the plurality of created data storage areas, the data management unit 1
5 calculates the priority according to the above priority calculation formula. First, the data management unit 15 investigates the data having the lowest priority among the data storage areas having the highest priority in the data search processing. Next, the data management unit 15 investigates the data having the highest priority in the data storage area having the second highest priority in data retrieval. Here, the data management unit 15 compares the priorities of these two data, and the priority of the data included in the data storage area with the lower priority of the data search process is the data with the higher priority of the data search process. If the priority of the data contained in the storage area is higher than that of the data stored in the data storage area, the data contained in the data storage area with the lower priority of the data search processing is moved to the data storage area with the higher priority of the data search processing, and vice versa. This data included in the data storage area having the higher priority in the data search processing is moved to the data storage area having the lower priority in the data search processing. In this way, the data management unit 15 sequentially compares the priorities of the data in the respective data storage areas, replaces the data at any time, and the data storage areas having the highest priority in the data search processing are arranged in order from the highest priority data. To be stored in. By providing the means as described above, it is possible to suppress the number of base cases in the data storage area to a fixed value or less, the processing time of the design work using the database can be shortened, and the efficiency of the design work can be improved. In addition, the priority can be automatically changed at any time according to the change of the delivery destination targeted for the design work, and the data with the high priority (the weight of the data is large) has a high priority in the data search processing. It can be centrally stored in the data storage area. The data group used in the plant design work of the same customer is almost specified, and as the plant design work progresses, the priority of this data group is improved, and the data group is stored in the data storage area having the high priority of the search process. Therefore, it becomes possible to refer to the data only by the number of cases that are known in advance from the data storage area with the high priority of the search processing, and it becomes possible to shorten the search processing time of the data with high priority, Similarly, the efficiency of design work using a database can be improved.

As a concrete example of the present invention, a method of processing a database for boiler main dimension data will be described. The boiler main dimension data registered in the database is stored in the data storage area secured according to the data format 11 of FIG. Here, the data format 1 of FIG.
The area secured according to 1 is called a data storage area. In FIG. 1, generally, in a database, this data storage area 12 is called a file, and a name (file name) for operating this data storage area, such as a boiler main dimension file and a plan summary numerical value file, is added and handled. . In addition, in the data format in this file, for example, in the data format 11 of FIG. HGT
And BLR Each piece of data such as WID is called an item, and one line including all items is called a record.

The boiler main dimension data is one record of data for one customer, that is, the data format 11 of FIG.
Is the data amount for one line of data. Therefore, one record of the boiler main dimension data in the database has a one-to-one relationship with the item "delivery destination" which is the search key, that is, the boiler main dimension data is retrieved such that the "delivery destination" is ABC. When searching from the database according to the conditions, it should be known in advance that the number of searches is one.
In FIG. 3, the database 5 has various data storage areas 12. It is assumed that there is one boiler main size data storage area in the initial state, and the maximum value of the number of records to be registered, that is, the threshold value of the number of registered records is set to 1000. In addition to this, the database 5 contains, for example, 100 pieces of data on the main dimensions of the boiler, and 500 pieces of data for numerical values of the tube design of the heat transfer tubes, which are the constituent parts of the boiler. There is a management data storage area 16 provided for the purpose of managing how many pieces of data are registered in each data storage area corresponding to a format for pipes, pipe design numerical values, etc. Computer 13 for operation management
This management data storage area 1 for each data operation from
6 is accessed and, for example, when one boiler main size data is registered, add 1 to the number of boiler main size data in the management data storage area where the number of boiler main size data is recorded. , Write in the number of boiler main dimension data in the management data storage area 16, and when deleting one boiler main dimension data, be sure to perform processing such as subtracting 1 from the number of boiler main dimension data and writing. It is assumed that it is operated under the rule that it is executed and the number of registrations of each design information is updated as needed.

The data storage area for the main dimensions of the boiler is shown in FIG.
The name "BLR1" 17 is given like this, and this "BLR1" 17 has 1000 cases, that is, 1
It is assumed that the data of 000 records has already been registered. Therefore, it is written that the number of pieces of boiler main dimension data is 1000 in the data storage area 16 for managing the number of data pieces. Further, the priority order of the search processing of this “BLR1” 17 is given the priority order 1 as the initial state because there is only one “BLR1” 17 in the data storage area. Here, first, consider a case where the boiler main dimension data 18 is newly registered in the "BLR1" 17. "BLR
Boiler main dimension data 18 whose delivery name is “A” is registered in “1” 17 ”. At the same time, the number data of the boiler main dimension data in the management data storage area 16 of the database is also 1
000 + 1 is rewritten to 1001. At this time, since the area management unit 14 constantly monitors the number of data items in all the data storage areas, the area management unit 14 sets "BLR1" here.
The processing performed for 17 will be described with reference to the flowchart of FIG.

First, the area management unit 14 refers to the number of boiler main dimension data from the management data storage area 16 (step 1). At this time, the threshold value of the boiler main dimension data storage area is 1000, The number of cases registered in is 1001, which exceeds the threshold (step 2)
The area management unit 14 creates a new data storage area 19 according to the format 11 of FIG. 2 (step 3). At this time, “BLR2” is stored in the new data storage area 19.
The area management unit 14 automatically assigns the name. (Step 4). Next, the area management unit 14 finds the lowest priority value in the data search processing priorities assigned to the boiler main dimension data storage area. At this time, the boiler main size data storage area is still "BLR1" 17
However, that is, the lowest priority value of the data search processing assigned to the boiler main dimension data storage area is 1.

Here, the area management unit 14 sets "BLR2" 19 as the priority order for the newly created "BLR2" 19.
Add "1" to the priority 1 of "1" (step 5)
. The area management unit 14 functions to give a lower priority to a newly created area. As a result, when referring to the boiler main dimension data, "B
LR1 ”17 will be accessed first. next,
The operation of the data management unit 15 will be described with reference to FIG. 6 according to the flowchart of FIG. The data management unit sequentially selects each data storage area (step 1) one by one, and investigates the priority of each data in the data storage area. In this case, the data management unit 15 uses the reference count data and the latest reference time attached to each data of “BLR1” 17,
Calculate the priority by the following priority calculation formula, and check the data with the lowest priority (step 2). The priority calculation formula is shown below.

Priority = α × (reference count (times))-(1-
α) × (latest reference time-current time (seconds)) Here, α is a constant that is set depending on which of the reference number and the time factor is weighted when determining the priority. Suppose now that α = 0.9 is defined. At this time, the data having the lowest priority is the data A20, and the reference count is 1 and the latest reference time-current time is 1000. That is, it is assumed that the priority is -99.1. At this time,
Since there is no data in "BLR2" 19, step
5 does not compare priorities. Therefore, the data management unit 15 sets the data having the lowest priority to “BLR2” 1
Move to 9 (step 6).

Next, a case where several data are already registered in "BLR2" 19 will be described with reference to FIG. Here, it is assumed that α in the priority calculation formula is set to 0.5. As with the above, the data management unit 15 first sets “B
Find the data with the lowest priority in "LR1" 17 (step 1), (step 2). At this time, the data with the lowest priority is the data A20, and according to the above-described priority calculation formula, the priority becomes 0 according to the following calculation.

Priority = 0.5 × 1000− (1−0.5) × (940101011101−940101010101) = 0.5 × 1000−0.5 × 1000 = 0 Next, the data management unit of “BLR2” 19 Find the highest priority data (step 3), (step 4).
At this time, the data having the highest priority in “BLR2” 19 is the data B21, and the priority becomes 50 by the similar calculation. Therefore, the data management unit 15 compares the lowest priority data A20 of "BLR1" 17 with the highest priority data B21 of "BLR2", and the "BLR1" 1
The lowest priority of data A20 of 7 is "B".
Since the priority of the data B21 having the highest priority in LR2 ”19 is lower, the data A20 having the lowest priority in“ BLR1 ”17 is moved to“ BLR2 ”19 and replaced with“ B
The highest priority data B21 of “LR2” 19 is set to “BL
Move to R1 "17. As a result, the data with high priority always moves to the data storage area with high data search priority. Since the data management unit replaces the data by the above method as needed, it also has a learning function effect for improving the database processing speed. Here, a method of determining the priority will be described. The priority of each data is determined by the above priority calculation formula. The latest registration data has a reference count of zero. Also,
The latest referenced time is the time when the data was registered for the first time. Therefore, even if the reference count is 0, the latest data has a higher priority according to the above equation. Also,
On the contrary, according to the above formula, the priority becomes low even if the data is referred to in the past a lot, if it has not been referred to recently. In addition, since α in the above equation is a constant that is set depending on whether the weight is given to the reference count or the time factor when determining the priority,
It can be set by the administrator considering the characteristics of the system. Therefore, it is possible to substantially weight each data by using the above-described priority determination method.

By the method as described above, the number of matrix cases in the database can be suppressed to a certain value or less, and the priority of the search processing can be set according to the practical utility value. By increasing the search processing speed from the database, the efficiency of design work using the database can be improved. In the above example, the threshold value is set for the number of registrations in the data storage area, and if there is more data than the threshold value, the data storage area will be I explained how to create a new data and store only the overflowed data in the created data storage area in a distributed manner. Similarly, when there is a number of data more than the threshold value and the data is distributed and stored. , Even if the number of data items to be stored is evenly allocated to a plurality of newly created data storage areas, the database processing speed can be improved by the same means, and the database can be used for design work. The efficiency can be improved.

[0023]

According to the present invention, even if the amount of data in the database increases, the number of records in each data storage area is limited to a certain value or less, and priority is given to these storage areas. Which storage area is stored is determined by the number of times each record is referenced and the priority that takes into consideration the time factor, so that it is possible to refer to plants with different specifications for each customer, such as plant design work. In a system in which the trend of data to be processed is different, it works to automatically improve the database processing speed for each customer, so that the efficiency of plant design work using the database can be improved.

[Brief description of drawings]

FIG. 1 is a schematic system diagram of a design support system according to the present invention.

FIG. 2 is a diagram showing an example of a data format used in the present invention.

FIG. 3 is a diagram showing a data storage area and a management data storage area.

FIG. 4 is an explanatory diagram of storage of boiler main dimension data.

FIG. 5 is an operation explanatory diagram of an area management unit.

FIG. 6 is an operation explanatory diagram of a data management unit.

FIG. 7 is an explanatory diagram of data exchange between areas according to search priority.

FIG. 8 is a flowchart showing the function of area management.

FIG. 9 is a flowchart showing the operation of the data management unit.

FIG. 10 is a diagram showing the relationship between the number of search base data items and search time.

FIG. 11 is a general explanatory diagram of a database.

FIG. 12 is an explanatory diagram of a conventional technique for searching and displaying data from a database.

[Explanation of symbols]

5 ... Database, 6 ... Record, 7 ... File, 8 ...
Number of mothers, 9 ... Format, 10 ... Display device, 11 ...
Data format, 12 ... Data storage area, 13 ... Computer, 14 ... Area management section, 15 ... Data management section,
16 ... Management data management section, 18 ... Boiler main dimension data.

Claims (3)

[Claims] 1. A computer equipped with a database, comprising means for accessing the database, means for referring to required data from the database according to search conditions, and means for performing plant design work based on the referred data. In the design work support system described above, the number of data items in the data storage area is monitored by monitoring the database that has multiple types of data storage areas that are set according to different formats depending on the type of data and the data storage area of the data registered in the database. If the value exceeds the specified value, a new data storage area is created according to the format of the storage area, and the area management means that assigns the priority order of data retrieval in the order of creation of the data storage area, and the data storage area Number of references to each existing data and the difference between the latest reference time and the current time The search priority of each data is calculated based on and, and the data management means that replaces the data so that the data with higher priority is stored in the data storage area with higher priority of data search A design work support system comprising: means for referring to data in the order of storage areas having the highest priority in the database. 2. A designing business having means for accessing a database on a computer equipped with the database and means for referring to required data from the database from the database and performing a plant designing work based on the referred data. In the database processing device of the support system, the data storage area of the data registered in the database is constantly monitored, and when the number of data items in the data storage area exceeds a certain number, a new data storage area is created, A means for giving a priority order when searching for data in the order of creating the data storage area, a cumulative value of the number of reference times attached to each data (record) of each data existing in the data storage area, and the latest reference time. Calculate the weighted average using the difference from the current time, and use this average value as the priority of the data,
A design work support system characterized by having means for calculating the priority of each data at any time, and replacing the data at any time so that the data is stored in a data storage area having a higher priority of data retrieval in order from the data having a higher priority. Database processing equipment in Japan. 3. The priority of each data according to claim 2, wherein priority = α × (reference count (times)) − (1−α) × (latest reference time−current time (seconds)) Where α is a constant set according to whether the priority is determined when determining the priority or the time factor, and a processing unit for the database in the design work support system, characterized in that .