JP2006004099A - Method, device and program for reusing program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a technique enabling efficient reuse of a program at the time of transfer between information processors. <P>SOLUTION: This method comprises steps of specifying a program for performing an access to a database; extracting information for data and tables used for the access to the database in the specified program; converting a name and a structure of the data used in the extracted information for the data and the table to a predetermined notation or data structure expression to realize a data structure of a database before transfer; forming a data modal of a database after transfer from the realized database structure of the database before transfer to form a data structure of a database after transfer; forming matching information for matching the data structure of the database before transfer to the data structure of the database after transfer; and correcting the names of the data and the table of the database before transfer in the program to the names of data and tables of the database after transfer according to the formed matching information. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention relates to a program reuse technique for correcting and reusing a program when a processing system is migrated between information processing apparatuses, and more particularly to changing a database structure when migrating from an existing mainframe system to an open system. The present invention also relates to a technique that is effective when applied to a program reuse technique in which a program is modified and reused.

  In the construction of an open system, if business operations have been carried out by the mainframe system so far, a new system is constructed by reusing the existing mainframe system program, and the development man-hour of the open system program is reduced. Things have been done. In such a program reuse of the existing mainframe system, conventionally, a process part directly connected to a business described in the program is transferred to an open system environment as it is. In addition, regarding the program of the description part related to the database, the program is reused only when there is no change in the data structure of the database, and when there is a change in the data structure of the database, a corresponding means is found and on the spot Measures are being implemented. Therefore, all programs related to the database may be newly created.

  There is also a technology for assisting program correction by detecting a program that depends on the data structure when the program needs to be corrected in accordance with the change in the data structure. For example, when the data structure changes, the program, porting source and porting destination allocation information is input, and each detection means of structure, data structure difference, and arrangement difference is driven according to the case, and the arrangement result There is an apparatus for identifying a structure in which a difference content and a difference have occurred, detecting a location in a program where a change in data structure affects processing, and supporting the porting of the program (see Patent Document 1). Allocate information is a rule for determining an arrangement area on a memory for each data structure, and may differ for each computer. In this technology, the difference in data structure that occurs when a program is ported between computers with different data allocation rules is analyzed, and porting for changes in the data structure is supported. By providing on-screen information on locations that need to be corrected in the program, and clarifying the correction location of the program, porting to another system is supported and the program can be reused.

JP-A-5-233237

  Such conventional techniques have the following problems. In other words, when building an open system by reusing a mainframe system program, the processing part directly linked to the work described in the program is transferred to the open system environment as it is, and the data is stored in the database. If there is a change in the structure, examine the response method and determine whether it can be reused by modifying the program. If the structure of the database running on the existing mainframe is complicated, it may be difficult to reuse the program, so it may be created anew.

  For changes in data structure due to changes in data allocation rules, programs that depend on the data structure are detected, and the location where the change in the data structure in the program is affected is clarified. There is also a method of providing support. However, this method does not deal with changes in the structure of the database.

  Thus, in the conventional method, since a program correction method is formulated for each database migration pattern, the procedure is not constant, and there is a problem that the program cannot be reused when the structure is complicated.

  In addition, in the technology to detect the affected part due to the change of the data structure, correction support is provided according to the change of the allocation rule by the computer, but the structure change of the database where the change of the data structure occurs in addition to the change of the allocation rule There was a problem that it was not possible to cope with the reuse of the program.

  An object of the present invention is to solve the above-described problems and provide a technique capable of efficiently reusing a program when migrating between information processing apparatuses.

  The present invention relates to a program reuse apparatus that modifies and reuses a program when a processing system is migrated between information processing apparatuses. The database after migration is based on data and table information in the program before migration. Design and modify the program according to the data and table information of the designed database.

  In the present invention, attention is paid to the data structure that is changed when the structure of the database is changed in the migration of the processing system between information processing apparatuses, for example, the migration of the database processing system from the mainframe system to the open system. Rather than extracting the data and tables related to the database on the mainframe program that does not change even if the data structure changes, the names and data of the data used in the extracted data and table information are extracted. Convert the structure into the corresponding Japanese notation or table expression to embody the data structure of the database before migration.

  Then, a data model taking into consideration the structure of the database used in the open system is created from the embodied data structure, and a new database is designed from the information of the created data model. Create data and tables corresponding to the database after moving to the open system from the created data model and designed database data, aggregated data and tables, as well as data and table correspondence information related to the old and new databases In summary, the program is corrected by using the data and table correspondence information related to the new and old databases, thereby realizing the reuse of the program.

  According to the present invention, it is possible to efficiently reuse a program when performing a transition between information processing apparatuses.

  A program reuse apparatus according to an embodiment that modifies and reuses a program when shifting from a mainframe system to an open system will be described below.

  FIG. 1 is a flowchart showing a processing procedure of program migration processing according to the present embodiment. When a database-related program migration process from a mainframe system to an open system occurs, as shown in FIG. 1, in this embodiment, after specifying a DB access program and extracting data and tables, the data structure is changed. The database after migration is designed and the database after migration is designed, and the program before migration is modified according to the old and new DB correspondence information to generate the program after migration.

  FIG. 10 is a diagram showing a schematic configuration of the program reuse apparatus of the present embodiment. As shown in FIG. 10, the program reuse apparatus 1000 of this embodiment includes a DB access program identification processing unit 1001, a data / table extraction processing unit 1002, a data structure realization processing unit 1003, and a DB design processing unit 1004. And a new and old DB correspondence information creation processing unit 1005 and a program correction processing unit 1006, and a memory for reading and storing a pre-migration program for accessing a database from the magnetic disk device when performing the following processing. ing.

  The DB access program specifying processing unit 1001 is a processing unit that searches a memory for a description in a program indicating access to a database, specifies a program for accessing the database, and stores it in a DB access list on the memory. .

  The data / table extraction processing unit 1002 extracts data and table information used for accessing the database by the specified program from the program on the memory and stores it in the DB related data / table list on the memory Part.

  The data structure realization processing unit 1003 aggregates similar data and tables in the extracted data and table information on a memory, and sets the name and structure of the data used in the information in a predetermined format such as Japanese. Is a processing unit that realizes the data structure of the database before migration by converting the data into a predetermined data structure expression such as a notation or a table format on the memory.

  The DB design processing unit 1004 creates on the memory a data model of the migrated database in which the duplicated data items are separate files from the embodied data structure of the database before migration, and the database after migration from the data model This is a processing unit that creates the data structure of and stores it in the memory.

  The old and new DB correspondence information creation processing unit 1005 compares the data structure of the database before the migration and the data structure of the database after the migration on the memory, creates the old and new DB correspondence information from the corresponding information, and stores them in the memory. It is a processing part to store in.

  The program correction processing unit 1006 corrects the database data and table names before migration in the program to the database data and table names after migration according to the created new and old DB correspondence information, and stores them in a magnetic disk device or the like. A processing unit stored in the apparatus.

  The program reuse apparatus 1000 includes a DB access program identification processing unit 1001, a data / table extraction processing unit 1002, a data structure realization processing unit 1003, a DB design processing unit 1004, an old and new DB correspondence information creation processing unit 1005, and a program correction processing unit 1006. It is assumed that a program for functioning as a program is recorded in a recording medium such as a CD-ROM and stored in a magnetic disk, and then loaded into a memory and executed. The recording medium for recording the program may be a recording medium other than the CD-ROM. The program may be used by installing it from the recording medium into the information processing apparatus, or the program may be used by accessing the recording medium through a network.

  The program reuse apparatus 1000 according to the present embodiment starts a DB-related program migration work when a database-related program migration process occurs. In step 101, the DB access program identification processing unit 1001 performs the migration work. All the programs are stored in the memory, and it is determined whether or not an instruction for accessing the database, for example, a DB call instruction is described in the program, and whether or not the database is accessed is determined. When there is access to the database, identification information such as the name of the program is registered in the DB access program list.

  In step 102, the data / table extraction processing unit 1002 reads the corresponding program into the memory on the basis of the information in the DB access program list, searches the memory for the inside of the program line by line in the database. It is determined whether it is the location where the access to the database is executed, for example, the location of the DB call instruction, and if it is the location where the database is accessed, the data and table used when accessing the database are extracted. Register in DB related data / table list.

  Next, in step 103, the data structure realization processing unit 1003 reads the contents of the DB-related data / table list, and similar data that is similar between programs that are identified as having instructions for accessing the database. / Table, i.e., whether there is a table with the same data size in each table, if similar data / table exists, aggregation of similar data / table is performed, and another similar to a certain similar table is performed. The table is expressed in a similar table. Then, the data structure of the database before migration is realized by converting the alphabetical representation of the data items in the table into the corresponding Japanese representation.

  In step 104, the DB design processing unit 1004 separates each data from the embodied data structure, compares each data, extracts data items that overlap between the data structures of the database before migration, and creates another file. After creating and summarizing, create a data model after migration that includes the separate files. Then, the data structure of the database after migration is created from the data model after migration and the data structure information before migration. For example, if data items related to products are duplicated in the order file and customer file before migration, after the data items of the product are collected as product files, the data model after migration consisting of the order file, customer file, and product file Create Then, create the data structure of the migrated product file from the data items that were duplicated in the order file and customer file before migration, and remove the duplicate data items from the order file and customer file before migration. And create customer file data structure.

  In step 105, the new / old DB correspondence information creation processing unit 1005 compares the data structure of the order file of the database before migration with the data structure of the order file, product file, customer file, etc. of the database after migration on the memory. Then, the old and new DB correspondence information in which they are associated, for example, the old and new DB correspondence information in which the order file having the old DB data structure, the order file, the product file and the customer file having the new DB data structure are associated with each other is created.

  In step 106, the program correction processing unit 1006 opens the corresponding program from the program name registered in the related data / table name information of the data / table aggregation information, and the data or table registered in the related data / table name. After searching for the corrected part from the name, the old DB data structure of the old and new DB correspondence information is searched from the name after aggregation of the data / table aggregate information for the contents of the table after the change of the searched part, and the search is further performed. Referring to the new DB data structure corresponding to the old DB data structure, the data or table corresponding to the new DB data structure registered in the new DB data structure is searched from the new data / table structure, and the corrected portion is The program is corrected by replacing the searched new data / table structure.

  FIG. 2 is a flowchart showing the processing procedure of the DB access program specifying processing of this embodiment. FIG. 2 shows an example of processing for specifying a program accessing a database in step 101 of FIG.

  When the DB access program specifying process is started in step 101, the DB access program specifying processing unit 1001 starts reading all programs to be migrated in step 201, and loads the programs stored in the magnetic disk device or the like. Read and store in memory.

  In step 202, it is determined whether or not the database is accessed by checking whether or not an instruction for accessing the database is described in the program stored in the memory. In step 202, the process proceeds to step 203. In step 203, information for identifying the program, such as the name of the program, is registered in the DB access program list.

  If the result of determination in step 202 is that there is no access to the database in the program (step 202: NO), no processing is performed and processing proceeds to step 204, and registration in the DB access program list in step 203 is performed. Also when the process is completed, the process proceeds to step 204.

  In step 204, it is determined whether or not there is a program that has not been read yet. If there is a program that has not been read yet (step 204: NO), the program returns to step 201. If there is no program that has not been read (step 204: YES), the process proceeds to step 205, the DB access program list is output to a file such as a magnetic disk device, and the DB access program specifying process is terminated.

  FIG. 3 is a flowchart showing a processing procedure of data / table extraction processing in units of programs according to this embodiment. FIG. 3 shows an example of a processing procedure for extracting data and tables related to the database in step 102 of FIG.

  When the data / table extraction processing for each program is started in step 102, the data / table extraction processing unit 1002 in step 301 obtains the DB access program list information created in step 205 of the DB access program specifying processing in step 101. Start reading the program into the memory.

  In step 302, the inside of the read program is searched on the memory line by line, and it is determined whether or not it is a location where access to the database is executed. If it is an access location to the database (step 302: YES), the process proceeds to step 303, where the data and tables used when accessing the database are extracted and registered in the DB related data / table list.

  If the result of determination in step 302 is that there is no access to the database (step 302: NO), the process proceeds to step 304 without any processing, and the registration to the DB related data / table list in step 303 is completed. In this case, the process proceeds to step 304.

  In step 304, it is determined whether or not the line searched in step 302 is the last line of the program. If it is not the last line (step 304: NO), the process returns to the DB access execution location search process in step 302. If the program is the last line (step 304: YES), the process proceeds to step 305.

  In step 305, it is determined whether all the program data and table extraction processing registered in the DB access program list have been completed. If the corresponding program remains (step 305: NO), the process returns to the corresponding program reading process in step 301. If the corresponding program does not remain (step 305: YES), the DB related data / The table list is output to a file, and the program / data extraction process is terminated.

  FIG. 4 is a diagram showing a specific example of DB access location determination and DB related data / table list registration according to this embodiment. FIG. 4 shows an example of the DB access location determination method in step 302 in FIG. 3 and the DB related data / table list registration method in step 303.

  When the data / table extraction processing unit 1002 of the present embodiment reads the program example 400 and performs the DB access location determination processing in step 302, an instruction to access the database, for example, a DB call command of the DB access execution location 401 is issued. The database is searched and determined to be a DB access location.

  Next, in the DB related data / table list registration process in step 303, “JYUTYU-FILE” is extracted as the DB access table 402 from the DB call instruction at the DB access execution location 401 that is accessing the database, and the DB The DB access related table 403 is extracted from the definition part of the access table 402 “JYUTYU-FILE” and registered in the DB related data / table list together with the program name 404.

  FIG. 5 is a diagram showing a specific example of aggregation of similar data and tables in the realization of the data structure of this embodiment. FIG. 5 shows an example of a process for aggregating similar data and tables implemented in the data structure realization process in step 103 of FIG.

  In step 103, the data structure realization processing unit 1003 reads the contents of the DB-related data / table list output in step 306 from the file and determines whether there are similar data / tables, that is, tables having the same data size. Check out. In the example of FIG. 5, the data items of the similar table A501, J-CODE, J-SYOHIN-CODE, J-SYOHINMEI, J-KAKAKU ... are PIC X (4), PIC X (4), and PIC X (40). , PIC X (9) ... and the data items of similar table B502, J-CODE, J-SCODE, J-NAMAEI, J-KINGAKU ... are PIC X (4), PIC X (4), PIC X (40), PIC X (9)... And since the data sizes in parentheses are equal, it can be seen that these are similar data / tables.

  When similar data / tables exist like the similar table A501 and the similar table B502, the processing of the similar data / table aggregation 507 is performed, and other tables similar to the similar table A501 are aggregated in the similar table A501. The data / table aggregation information 508 and the data / table aggregation result 511 are created.

  The data / table aggregation information 508 is configured so that information on the name 509 after aggregation and related data / table name 510 can be registered. The name 509 after aggregation is defined in the aggregation table 513 of the data / table aggregation result 511. The related data / table name 510 is registered in the related data / table name 510, the program name A503 and the data / table name A505 related to the aggregate table name 512, and the program name B504 and the data / table / name of the aggregated similar table B502. The table name B506 and the like are registered respectively.

  FIG. 6 is a diagram showing a specific example of realization in the data structure realization of the present embodiment. FIG. 6 shows an example of the realization of the data structure of the database before migration in the data structure realization process in step 103 of FIG.

  In step 103, the data structure realization processing unit 1003 creates a data structure A 603 by visualizing the data structure by replacing the table structure with a specific name as it is from the table information A 601 of the data / table aggregation result 511. Similarly, the table information B602 is replaced with a specific name to create a data structure B that visualizes the data structure. In such a procedure, all data and tables in the data / table aggregation result 511 are replaced with specific names to visualize the data structure.

  In the example of FIG. 6, the data items of table information A601, J-CODE, J-SYOHIN-CODE, J-SYOHINMEI, J-KAKAKU ..., the corresponding order code, product code, product name, price in Japanese. The data structure A603 of table expression is created by converting as shown in FIG. At that time, if JS-JYUTYU and JS-ZAIKO are defined under the data item J-SURYOU, such as J-SURYOU, JS-JYUTYU, and JS-ZAIKO, the orders and the number of stocks are subordinate to the quantity. It is assumed that the data structure is shown using a table expression in which is placed. Note that the Japanese notation corresponding to each data item is defined in advance when the program is created.

  FIG. 7 is a diagram showing a specific example of the DB design processing of this embodiment. FIG. 7 shows an example of processing for designing a database in the DB design processing in step 104 of FIG.

  In step 104, the DB design processing unit 1004 creates an existing data structure 701 indicating the relationship by separating each data from the data structure visualized in the data structure realization in step 103. When comparing the data in the order file 702 and the customer file 703 shown as specific examples, the customer code 704 in the order file 702 and the customer code 705 in the customer file 703 are the same, and the product code 706 and the product name 707 in the order file 702 are the same. And the price 708, the product code 710, the product name 711, and the price 712 under the ordered product 726 in the customer file 703 have the same contents, and are duplicated as information.

  The DB design processing unit 1004 compares the data items of the existing data structure 701 obtained from the embodied data structure of the database before migration on the memory, and extracts duplicate data items. At this time, for items having lower data, it is determined whether there is duplication including lower data. For example, the quantity 722 in the order file 702 and the quantity 730 in the customer file have the same item name. Since the quantity 722 has the order 723 and the inventory quantity 720 in the lower order, it is determined that the quantity 722 and the quantity 730 do not overlap.

  Further, the DB design processing unit 1004 may determine whether or not the contents indicated by the data item are the same. For example, there is an order 723 under the quantity 722 in the order file 702, and it is understood that this has the same meaning as the quantity 730 of the order item 726 in the customer file 703. From this, it can be seen that the order file 702 needs information on the customer code 705 in the customer file 703 and the order product 726 in the customer file 703. Here, in the present invention, a table for determining whether or not the contents indicated by the data items are the same is prepared in advance, and the determination is performed according to the information in the table.

  When the information on the duplicated products extracted as described above is newly created as a separate product file 715, the relationship between the order file 702, the customer file 703, and the product file 715 is the data model 714. It can be shown as follows. In this flow, the DB design processing unit 1004 designs a new DB structure 716 from the information of the data model 714 and the existing data structure 701. The new DB structure 716 can be composed of a customer file 717, a product file 718, and an order file 719, which are created based on the customer file 703, product file 715, and order file 702 of the data model 714, respectively.

  That is, for the customer file 717, the DB design processing unit 1004 collects the customer code (primary key) 731 of the customer code 704 of the order file 702 of the existing data structure 701, the customer name 724 of the customer file 703 in the existing data structure 701, It consists of an address 727, a telephone number 728, and a FAX number 729 of the customer information 725 in the customer file 703 in the existing data structure 701.

  Here, when determining the data items of the new DB structure 716, the processing contents in the program that accesses the file in the existing data structure 701 are searched, and the data items that are not used in the program are omitted. Anyway. For example, the customer file 717 does not include a data item corresponding to the order product 726. This is because the data of the order product 726 is used in the program for accessing the customer file 703 in the existing data structure 701. This is to show an example in the case where there is no processing part. When the processing part using the data of the ordered product 726 exists in the program, the order code is included in the customer file 717 as an external key. .

  As for the product file 718, a product code (primary key) 732 in which the product code 706 of the order file 702 in the existing data structure 701 and the product code 710 of the order product 726 in the customer file 703 are aggregated, and the product name 707 of the order file 702. And the product name 733 in which the product names 711 of the order products 726 in the customer file 703 are aggregated, the price 708 in the order file 702 in the customer file 703 and the price 734 in which the prices 712 of the order products 726 in the customer file 703 are aggregated. It consists of a stock quantity of 720.

  For the order file 719, the order code 721 of the order file 702 of the existing data structure 701 is used as the main key, and the product code 706, the product name 707, and the price 708 of the order file 702 are the product code (primary key) of the product file 718. ) By specifying 732 as the product code (external key) 735, the product file information is set so that it can be retrieved at any time. For the customer code 704 of the order file 702, the customer code (primary key) 731 of the customer file 717 is the customer code. (External key) 736 is set so that product file information can be withdrawn at any time. Order quantity 737 in which order 723 of quantity 722 in order file 702 and quantity 730 of order product 726 in customer file 703 are aggregated, order file 702 Shows the delivery date 709 Composed of a delivery time 738.

  Here, when the data item of the new DB structure 716 is determined, the content may be changed by receiving an instruction from the user. For example, although the stock quantity 720 of the order file 702 is stored in the product file 718 instead of the order file 719, the stock quantity is information that is also used when inquiring product information other than at the time of ordering. This is because an example in which the stock quantity 720 is changed to be included in the product file 718 according to the instruction is shown.

  FIG. 8 is a diagram showing a specific example of the new and old DB correspondence information creation processing of this embodiment. FIG. 8 shows an example of processing for creating correspondence information of old and new databases in the new and old DB correspondence information creation processing in step 105 of FIG.

  Since the structure design of the new database has been performed in the DB design process in step 104 of FIG. 1, the data structure A 603 is a new data structure A 801 (order file) when the new data structure is examined based on the information of the new DB structure 716 of FIG. ), A new data structure B 802 (product file), and a new data structure C 803 (customer file).

  In step 105, the new / old DB correspondence information creation processing unit 1005 creates a data structure A603 that is the data structure of the database before migration, a new data structure A801 that is the data structure of the database after migration, a new data structure B802, and a new data structure C803. And the old DB data structure 805 and the new DB data structure 806 as the old and new DB correspondence information 804, and information corresponding to the old and new databases is stored and managed on the memory. As specific registration information, information on the data structure A603 (order file) is registered in the old DB data structure 805, and a new data structure A801 (order file) corresponding to the data structure A603 is registered in the new DB data structure 806. The information of the data structure B 802 (product file) and the new data structure C 803 (customer file) is registered as one correspondence information 807.

  FIG. 9 is a diagram showing a specific example of the program correction process of the present embodiment. FIG. 9 shows an example of a program correction process in the program correction process in step 106 of FIG.

  In step 106, the program correction processing unit 1006 uses the program correction information 901 to correct the program example 400 to the corrected program example 907. The program modification information 901 is information necessary for modifying the program. The data / table aggregation information 508 created in the data structure implementation work in step 103 in FIG. 1 and the old and new DB correspondence information creation in step 105 in FIG. New and old DB correspondence information 804 created in the processing operation, new data structure A 801 (order file), new data structure B 802 (product file) and new data structure C 803 (customer file) in FIG. A data / table structure 902 is used.

  In specific correction work, first, the program (example program 400) is opened from the program name registered in the related data / table name 510 information of the data / table aggregation information 508 and registered in the related data / table name 510. The correction portion 903 is searched from the data or table name that has been stored.

  As for the contents of the table after the change of the searched part, the old DB data structure 805 of the new / old DB correspondence information 804 is searched from the name 509 after the data / table aggregation information 508 is aggregated (904), and the old DB that has been retrieved is further retrieved. With reference to the new DB data structure 806 corresponding to the data structure 805, data or a table corresponding to the new DB data structure registered in the new DB data structure 806 is searched from the new data / table structure 902 (905). The correction part 903 is replaced with the searched new data / table structure 902, and the correction of the calling part of the database is performed according to the number of the replaced tables (906). Also, in the processing part of the program, each data item and table used outside the database call location is also converted to the data item and table name changed as described above, and the program is modified. And stored in a storage device such as a magnetic disk device.

  As described above, according to this embodiment, even if the structure of the database is changed in the open system migration by reusing the program of the mainframe system, the data items used in the program are not changed, and Data items and data to be extracted and the new database is designed from that information, so that the data and tables used in the migrated system can be brought close to the existing system data and table information. Reuse can be realized efficiently. In addition, data and tables used in the program after migration can be created in a form similar to the data and table format of the program before migration, and correction points can be found when searching the DB access execution location 401 or the DB access related table 403. By knowing it, it is possible to automatically perform correction work from the data and table correspondence information related to the old and new databases, so that the program can be reused efficiently even if the data structure changes. be able to.

  In the present embodiment, as a procedure for the migration process of the DB-related program shown in FIG. 1, first, the DB access program specifying process of Step 101 is performed, and then the data / table extraction process of the program unit of Step 102 is performed. Although the method is shown, when the program accessing the database is specified, the data and table accessing the database may be extracted by the program. In this method, since the program needs to be investigated only once, the program search process can be reduced and the efficiency can be improved.

  In the modification of the program of the present embodiment, an example is given in which the data name and table name of the new data / table structure 902 are used as they are. However, the prefix and suffix information is created, and the corresponding data and table are stored. It is also possible to specify that the created prefix or suffix is added when the correction is made.

  As described above, according to the program reuse apparatus of the present embodiment, the database after migration is designed based on the data and table information in the program before migration, and according to the data and table information of the designed database. Since the program is modified, it is possible to efficiently reuse the program when migrating between information processing apparatuses.

It is a flowchart which shows the process sequence of the program transfer process of this embodiment. It is a flowchart which shows the process sequence of DB access program specific process of this embodiment. It is a flowchart which shows the process sequence of the data / table extraction process of the program unit of this embodiment. It is a figure which shows the specific example of determination of the DB access location of this embodiment, and registration to DB related data / table list. It is a figure which shows the specific example of aggregation of the similar data and table by realization of the data structure of this embodiment. It is a figure which shows the specific example of realization in data structure realization of this embodiment. It is a figure which shows the specific example of DB design processing of this embodiment. It is a figure which shows the specific example of the old and new DB corresponding | compatible information creation process of this embodiment. It is a figure which shows the specific example of the program correction process of this embodiment. It is a figure which shows schematic structure of the program reuse apparatus of this embodiment.

Explanation of symbols

400 ... Program example, 401 ... DB access execution location, 402 ... DB access table, 403 ... DB access related table, 404 ... Program name, 501 ... Similar table A, 502 ... Similar table B, 503 ... Program name A, 504 ... Program name B, 505 ... Data / table name A, 506 ... Data / table name B, 507 ... Similar data / table aggregation, 508 ... Data / table aggregation information, 509 ... Name after aggregation, 510 ... Related data / table Name 511 ... Data / table aggregation result 512 ... Aggregation table name 513 ... Aggregation table, 601 ... Table information A, 602 ... Table information B, 603 ... Data structure A, 701 ... Existing data structure, 702 ... Order file, 703 ... Customer file, 704 ... Customer code, 705 ... Customer Code, 706 ... Product code, 707 ... Product name, 708 ... Price, 709 ... Delivery date, 710 ... Product code, 711 ... Product name, 712 ... Price, 714 ... Data model, 715 ... Product file, 716 ... New DB structure, 717 ... Customer file, 718 ... Product file, 719 ... Order file, 720 ... Stock quantity, 721 ... Order code, 722 ... Quantity, 723 ... Order, 724 ... Customer name, 725 ... Customer information, 726 ... Order product, 727 ... Address, 728 ... Telephone number, 729 ... FAX number, 730 ... Quantity, 731 ... Customer code (primary key), 732 ... Product code (primary key), 733 ... Product name, 734 ... Price, 735 ... Product code (external key) ) 736 ... Customer code (foreign key), 737 ... Quantity, 738 ... Delivery date, 801 ... New data structure A, 802 ... New data structure B, 03 ... New data structure C, 804 ... New and old DB correspondence information, 805 ... Old DB data structure, 806 ... New DB data structure, 807 ... Correspondence information, 901 ... Program modification information, 902 ... New data / table structure, 903 ... Modification Location: 904 ... Search for new DB data structure, 905 ... Search for new data / table structure, 906 ... Correction of database call location, 907 ... Program example after correction, 1000 ... Program reuse device, 1001 ... DB access program identification processing , 1002... Data / table extraction processing unit, 1003... Data structure realization processing unit, 1004... DB design processing unit, 1005.

Claims (5)

A program reuse method in a program reuse device that corrects and reuses a program when transferring a processing system between information processing devices,
Searching for a description in a program indicating access to a database on a storage device in the program reuse device to identify a program for accessing the database; and
Extracting data and table information used in accessing the database with the specified program from the program on the storage device;
Implementing the data structure of the database before migration by converting the name and structure of the data used in the extracted data and table information into a predetermined notation and data structure representation;
Creating a data model of the database after migration from the data structure of the database before migration embodied, storing the data structure of the database after migration from the data model, and storing in the storage device;
Creating correspondence information associating the data structure of the database before the migration with the data structure of the database after the migration and storing it in the storage device;
A step of correcting the names of the data and tables in the database before migration in the program to the names of the data and tables in the migrated database according to the created correspondence information, and storing them in the storage device. Program reuse method.   2. The implementation is performed by aggregating similar data and tables between the first program and the second program identified in the step of identifying a program that accesses the database. The program reuse method described in 1.   In the step of creating the data structure of the database after the migration, after creating the data model in which the data items that overlap between the first data structure and the second data structure of the database before the migration are created as separate files 3. The program reuse method according to claim 1, wherein the data structure of the database is created. In a program reuse device that modifies and reuses a program when a processing system is transferred between information processing devices,
A storage device for storing a program for accessing the database;
A DB access program identification processing unit for identifying a program for accessing the database by searching the storage device for a description in the program indicating access to the database;
A data / table extraction processing unit for extracting data and table information used in accessing the database by the specified program from the program on the storage device;
A data structure realization processing unit that realizes the data structure of the database before migration by converting the name and structure of the data used in the extracted data and table information into a predetermined notation and data structure representation;
Creating a data model of the database after migration from the data structure of the database before migration embodied, and creating a data structure of the database after migration from the data model and storing it in the storage device;
Compare the data structure of the database before the migration and the data structure of the database after the migration, create correspondence information from their corresponding information and store in the storage device the old and new DB correspondence information creation processing unit,
A program correction processing unit that corrects the names of the data and tables in the database before migration in the program to the names of the data and tables in the migrated database according to the created correspondence information, and stores them in the storage device. Feature program reuse device. A program for causing a computer to execute a program reuse method in a program reuse device that corrects and reuses a program when a processing system is transferred between information processing devices,
Searching for a description in a program indicating access to a database on a storage device in the program reuse device to identify a program for accessing the database; and
Extracting data and table information used in accessing the database with the specified program from the program on the storage device;
Implementing the data structure of the database before migration by converting the name and structure of the data used in the extracted data and table information into a predetermined notation and data structure representation;
Creating a data model of the database after migration from the data structure of the database before migration embodied, storing the data structure of the database after migration from the data model, and storing in the storage device;
Creating correspondence information associating the data structure of the database before the migration with the data structure of the database after the migration and storing it in the storage device;
Causing the computer to execute the step of correcting the database data and table names before migration in the program to the database data and table names after migration according to the created correspondence information and storing them in the storage device. A featured program.

Images