JP6729742B1 - Information processing apparatus, information processing system, information processing method, and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide an information processing device, an information processing system, an information processing method, and a program capable of efficiently dividing data according to processing contents. An information processing device has a starting point based on an analysis result of the program based on information indicating a process definition of a program that realizes software, data accessed by the program, and a data set including the data. The information indicating the program to be used, the information indicating the subprogram called from the starting program, and the information about the data set accessed from the starting program and the subprogram are route information indicating the processing flow from the starting program. A route processing unit; and a determination unit that determines, based on the route information and the analysis result, a belonging process flow that is a process flow to which the shared data set belongs, for the data sets included in the plurality of process flows. , Is provided. [Selection diagram] Fig. 4

Description

The present invention relates to an information processing device, an information processing system, an information processing method, and a program.

When the old existing system is renewed, due to the cost and the period, the business process running in the existing system may not be changed and the operating base may be replaced. In the case of such renewal, one of the architectures after the renewal is a configuration in which microservices are combined. When using microservices, the functions of the system are divided into smaller parts within a range that is easy to maintain, and services are created in units of the divisions. Further, the services are loosely coupled by calling an API (Application Programming Interface). By loosely coupling the services in this way, it is possible to reduce the period and cost for system renovation and to update the system in a timely manner.
Patent Document 1 discloses, as a related technique, a technique capable of grasping the actual state of how data is used in software.

JP, 2017-228048, A

In order to realize microservices, it is necessary to divide data so that services are loosely coupled. However, such division of data has heretofore often been performed by analyzing a program by an expert in business. Therefore, it may take a lot of trouble to divide the data.

An object of the present invention is to provide an information processing device, an information processing system, an information processing method, and a program that solve the above problems.

According to an aspect of the present invention, an information processing device provides information describing processing definitions of a plurality of programs for realizing software, data accessed by the programs, and a data set including the data. Based on an analysis result which is a result of analysis of the program based on, information indicating a starting point program which is a program that is not called from another of the plurality of programs, and directly or indirectly from the starting point program. Information indicating a subprogram that is the called program and information relating to the data set accessed from the starting point program and the subprogram are associated with each other in a calling order or an access order. A route processing unit that is route information indicating, and a shared data set that is the data set included in the plurality of processing flows based on the route information and the analysis result, among the plurality of processing flows, And a determining unit that determines a belonging processing flow that is a processing flow to which the shared data set belongs.

Further, according to one aspect of the present invention, an information processing system includes information describing processing definitions of a plurality of programs for realizing software, data accessed by the programs, and a data set including the data. Based on the analysis result which is the analysis result of the program based on, the information indicating the starting program which is a program that is not called from the other programs among the plurality of programs, and directly or indirectly from the starting program. Information indicating a sub-program that is the program that is called automatically, and information about the data set that is accessed from the starting-point program and the sub-program, information in which the calling order or the access order is associated with each other. A route processing unit that is route information indicating a processing flow, a shared data set that is the data set included in the plurality of processing flows, based on the route information and the analysis result, among the plurality of processing flows. And a determining unit that determines a belonging process flow that is a process flow to which the shared data set belongs.

According to another aspect of the present invention, an information processing method includes information describing processing definitions of a plurality of programs for implementing software, data accessed by the programs, and a data set including the data. Based on the analysis result which is the analysis result of the program based on, the information indicating the starting program which is a program that is not called from the other programs among the plurality of programs, and directly or indirectly from the starting program. Information indicating a sub-program that is the program that is called automatically, and information about the data set that is accessed from the starting-point program and the sub-program, information in which the calling order or the access order is associated with each other. A route processing step that is route information indicating a processing flow, and a shared data set that is the data set included in the plurality of processing flows, based on the route information and the analysis result, among the plurality of processing flows. And a determining step of determining a belonging process flow that is a process flow to which the shared data set belongs.

According to one aspect of the present invention, a program includes information describing processing definitions of a plurality of programs for implementing software, data accessed by the program, and a data set including the data. Based on an analysis result which is a result of analysis of the program based on, information indicating a starting point program which is a program that is not called from another of the plurality of programs, and directly or indirectly from the starting point program. Information indicating a subprogram that is the called program and information relating to the data set accessed from the starting point program and the subprogram are associated with each other in a calling order or an access order. Of a plurality of the processing flows for a shared data set, which is the data set included in the plurality of processing flows, based on the route processing step including the route information indicating the route information and the analysis result. And a determining step of determining a belonging processing flow, which is a processing flow to which the shared data set belongs, and a computer.

According to the present invention, data can be efficiently divided according to the processing content.

It is a 1st figure for demonstrating the microservice realization of the business system regarding this invention. It is FIG. 2 for demonstrating the microservice realization of the business system regarding this invention. It is FIG. 3 for demonstrating the microservice realization of the business system regarding this invention. It is a schematic block diagram which shows an example of a structure of the information processing apparatus which concerns on 1st Embodiment of this invention. It is a figure which shows an example of the data access information which concerns on 1st Embodiment of this invention. It is a figure which shows another example of the data access information which concerns on 1st Embodiment of this invention. It is a figure which shows an example of the control structure information which concerns on 1st Embodiment of this invention. It is a figure which shows an example of the related information which concerns on 1st Embodiment of this invention. It is a figure which shows another example of the related information which concerns on 1st Embodiment of this invention. It is a figure which shows an example of the route information which concerns on 1st Embodiment of this invention. It is a flow chart which shows an example of the route extraction processing concerning a 1st embodiment of the present invention. It is a flow chart which shows an example of data access analysis processing concerning a 1st embodiment of the present invention. It is a schematic block diagram which shows an example of a structure of the information processing apparatus which concerns on 2nd Embodiment of this invention. It is a figure showing an example of business information concerning a 2nd embodiment of the present invention. It is a figure which shows an example of the analysis result which concerns on 2nd Embodiment of this invention. It is a schematic block diagram which shows an example of the minimum structure of the information processing system which concerns on each embodiment of this invention.

<Outline of microservices>
First, an outline of microservices will be described with reference to the drawings.
Microservices are one of the techniques and ideas in software development. In microservices, one application (business system) is divided into a plurality of small services according to business functions. The entire application is realized by loosely coupling multiple microservices. Loose coupling is, for example, an API call or the like. By dividing the application into multiple microservices, it becomes possible to develop for each microservice. Therefore, multiple developments can be performed in parallel. Also, since each service becomes smaller, it becomes easier for developers to understand, develop, and test. Due to these factors, it is possible to reduce the period and cost when the entire business system is refurbished.

1 to 3 are views for explaining the microservices of a business system according to the present invention.
When making an existing business system into a micro service, it is necessary to determine the range of the micro service. There are a plurality of methods for grasping the range of one microservice, and one of them is the idea that a series of processing flows from a program in which business processing is started is regarded as one microservice.

FIG. 1 is a diagram showing an example of an existing business system. In the example shown in this figure, programs for executing the business system are shown as programs 1-8. A database 1 is a database that is accessed when the business system is executed. Further, arrows between programs and arrows from programs to databases indicate calling or access relationships. In the example shown in this figure, for example, the program 1 indicates that the program 4 is called. Further, for example, the program 4 is called from the program 1 and the program 2, calls the programs 6 and 7, and indicates that the database 1 is accessed.
As shown in this figure, the existing business system is in a state where not only many programs and intricately entangle each other, but also many programs access one or more databases. Therefore, in order to make such a business system into a micro service, it is necessary to scrutinize each program.

In order to make such a group of programs into microservices, there is an idea that a series of processing flows are regarded as microservices. First, the program that is the starting point of a series of processing flows is determined. In the example shown in FIG. 1, the programs 1, 2, and 3 are programs that have not been called from anywhere. Therefore, these programs are the starting programs. Therefore, in the example shown in FIG. 1, there are three processing flows.

Then, the entire program is divided for each processing flow. At this time, if there are programs used in a plurality of processing flows, the programs are duplicated for the processing flows being used. For example, in the case of the example shown in FIG. 1, the program 4 is called from the program 1 and the program 2. Since the program 1 and the program 2 have different processing flows, the program 4 is duplicated and divided.
The result of such division is shown in FIG. Since the programs 4, 5, and 7 are called by a plurality of processing flows, they are duplicated and divided. By thus duplicating and dividing the program according to the processing flow, the program can be divided for each processing flow. However, since the database 1 is not divided, it cannot be microserviced as it is.

In order to convert all the processing flows into microservices, the database also needs to be divided according to the processing flows, as shown in FIG. In the example shown in FIG. 3, the database 1 is divided into a database 11, a database 12, a database 13, and a database 14. If the database can be divided in this way, it becomes possible to create microservices for each processing flow. In the example shown in FIG. 3, the processing flow including the program 1, the program 4, the program 6, and the database 11 can be one microservice.

In order to divide the database as shown in FIG. 3, it is necessary to refer to the database 1 in FIG. 2 and grasp which data is used for which process. For that purpose, it is necessary to confirm the processing for each of the programs that call the database (five programs, program 4 to program 8 in the example of FIG. 2 ). When the existing business system is easy to grasp as in the example shown in FIGS. 1 to 3, it is easy to confirm the processing. However, in reality, since there are so many tasks, it is often very difficult to understand the processing, and it often takes a huge amount of time to realize microservices.

<First Embodiment>
Hereinafter, the first embodiment of the present invention will be described in detail with reference to the drawings.

FIG. 1 is a schematic block diagram showing an example of the configuration of an information processing device 1 according to the first embodiment of the present invention.
The information processing device 1 is, for example, a terminal device such as a desktop computer, a notebook computer, a tablet terminal, a smartphone, or a processing device such as a server.
The information processing device 1 analyzes, for example, asset information including a program of a business system and setting information. Further, the information processing device 1 determines a program that is the starting point of the processing flow based on the analysis result. Further, the information processing device 1 divides the program called from the program that is the starting point for each processing flow. Further, the information processing device 1 associates the called data with the called program for the data called from the programs included in the series of processing flows. Further, the information processing device 1 divides the database based on the associated information.

As a result, the information processing apparatus 1 can efficiently divide the data according to the processing content without the business expert or the program developer performing the analysis of the program.

The information processing device 1 includes a storage unit 11 and a processing unit 12.
The storage unit 11 is a storage device such as a hard disk drive or a memory. The storage unit 11 stores various programs to be executed by the processing unit 12, such as firmware and application programs, and results of processing executed by the processing unit 12.
The processing unit 12 is a processor such as a central processing unit (CPU). The processing unit 12 generates output information for the input information, for example, based on the information stored in the storage unit 11.

Specifically, the processing unit 12 reads out the asset information stored in advance in the storage unit 11 and analyzes the asset information based on the read information. Here, the asset information includes a source code that is a source of an application that configures a system that is an analysis target, and definition information of the application. For example, in the case of a mainframe, the source code indicates a file in which a user (for example, a system developer) describes a process definition such as a program source code or a JCL source code describing a job process. Further, for example, in the case of a mainframe, the definition information indicates various kinds of setting information of applications that make up the system.
In addition, the processing unit 12 extracts a processing flow of a program configuring the system (hereinafter, also referred to as “route information”) based on the analysis result. Further, the processing unit 12 determines the data to be accessed for each route information based on the extracted route information and the access information to the data of the program included in the analysis result (hereinafter, also referred to as “data access information”). Sushi The processing unit 12 divides the data used by the system as necessary according to the determination result.

<Memory unit of information processing device>
Details of the storage unit 11 will be described. The storage unit 11 includes an asset information storage unit 111, an analysis result storage unit 112, a route information storage unit 113, and an analysis result storage unit 114.

The asset information storage unit 111 stores asset information.
The analysis result storage unit 112 stores the analysis result obtained by the analysis unit 121 analyzing the asset information. The analysis result includes data access information, control structure information, and relationship information. The data access information is information indicating the correspondence between the data to be accessed (file, table, etc.) and the program. Further, the control structure information is information indicating processing, branching, repetition, calling of other programs and functions, etc. existing in the program according to the processing flow of each program. The relationship information is information indicating a calling relationship between programs and a quoting relationship when other asset information is quoted in the program.

The analysis result storage unit 112 includes a data access information storage unit 1121, a control structure information storage unit 1122, and a relation information storage unit 1123. The data access information storage unit 1121 stores data access information (see FIGS. 5 and 6). The control structure information storage unit 1122 stores control structure information (see FIG. 7). The relationship information storage unit 1123 stores the relationship information (see FIGS. 8 and 9). A specific example of the information stored in each storage unit will be described later.

The route information storage unit 113 stores route information (see FIG. 10). The route information storage unit 113 stores the route information extracted by the route extraction unit 122 based on the analysis result. A specific example of the route information will be described later.

The analysis result storage unit 114 stores the analysis result which is the result of analyzing the data accessed by the system based on the analysis result of the target system and the route information. The analysis result storage unit 114 stores the analysis result of the data used by the system by the data access analysis unit 123. The analysis result also stores the result of data division performed by the data access analysis unit 123, if necessary.

Hereinafter, an example of the data access information, the control structure information, the relationship information, and the route information stored in the storage unit 11 will be described with reference to FIGS.

FIG. 5 is a diagram showing an example of data access information according to the first embodiment of the present invention.
In the example shown in this figure, the data access information is information in which a correspondence relationship between the data and the program is shown in a CRUD diagram at the table or file level forming the data. The expression format of the data access information is not limited to the CRUD diagram.
A CRUD diagram is data (or a table or file that constitutes the data) and in which program the data is created (Create, indicated by "C" in the figure), and referenced (Read, indicated by "R" in the figure). It is the figure which matched and showed whether it is updated (Update, is displayed by "U" in a figure), and is deleted (Delete, is displayed by "D" in a figure). In the following, any of the processes of creation, reference, update, and deletion is also referred to as “access”.

In the example shown in this figure, the data access information is No. And the type, the DB/file name information, and a plurality of programs are associated with each other. No. Is information indicating an identifier for identifying a table or a file that constitutes data. The type is information indicating the constituent elements that make up the data. A component is a unit including data such as a table and a file. The DB/file name information is information indicating the name (file name or database name) indicating the constituent elements that make up the data.

In the example shown in this figure, “No.” is “1”, “Type” is “Table”, and “DB/file name” is “Table 1”. Refers to "program 2" (display of "R"). In addition, for the table corresponding to “No.” is “2”, “Type” is “Table”, and “DB/file name” is “Table 2”, it is created and referenced from “Program 3”. It indicates that the update is performed (display of "CRU").

FIG. 6 is a diagram showing another example of the data access information according to the first embodiment of the present invention.
In the example shown in this figure, the data access information is the information showing the correspondence relationship between the data and the program in the CRUD diagram at the data item level defined in the table or file constituting the data. Note that, as in FIG. 5, the expression format of the data access information is not limited to the CRUD diagram.

In the example shown in this figure, the data access information is No. It is information in which a type, a DB/file name information, a data item name, and a plurality of programs are associated with each other. Here, No. Is information indicating a data item forming data and an identifier for identifying a data item defined in a table or a file. The data item name is information indicating the name of the data item.
In the example shown in this figure, "No." is "1", "Type" is "Table", "DB/file name" is "Table 1", and "Data item name" is "Item 1". It indicates that the corresponding data is referred to by the “subprogram 4” (display of “R”).

FIG. 7 is a diagram showing an example of control structure information according to the first embodiment of the present invention.
The example shown in this figure is a flow chart showing the control structure information of one program. In the example shown in this figure, when a program is started, the program first calls another program identified by "PROG1"("CALLPROG1"). Then, the program branches according to some condition (“IF”). In the first branch, the program calls another program identified by "PROG2"("CALLPROG2"). Then the program ends. On the other hand, in the other branch, the program substitutes the data "AAA" into the variable "BBB"("MOVE AAA TO BBB"). Then, the program writes the data of the variable "BBB"("WRITEBBB"). At this time, the data to which "BBB" is written is updated. After that, the program ends.

FIG. 8 is a diagram showing an example of relationship information according to the first embodiment of the present invention.
In the example shown in this figure, an example of relation information indicating a calling relation between programs is shown. In the example shown in this figure, the relationship information is No. Is information that associates a call source program, a call destination program, and an argument. No. Is information indicating an identifier for identifying the related information. The call source program indicates a program that calls another program. The called program indicates a program called from another program. The argument is information indicating a variable for exchanging information necessary for executing the callee program from the caller program when the callee program is called. There may be a plurality of arguments or no arguments.

In the example shown in this figure, the relational information of "1" in "No." is that "caller program" is "program 1", "callee program" is "program 4", and "argument" is Indicates that it is "PRAM1".

FIG. 9 is a diagram showing another example of the relationship information according to the first embodiment of the present invention.
In the example shown in this figure, an example of relation information indicating a quoting relation when a program cites other information is shown. In the example shown in this figure, the relationship information is No. And the reference source asset, the reference destination asset, and the reference destination asset type. No. Is information indicating an identifier for identifying the related information. The quote source asset indicates asset information that cites other information. The citation destination asset is information indicating a citation format when the citation source asset cites other information. The citation destination asset type is information indicating the citation destination asset information.

In the example shown in this figure, the relational information with "No." of "1" is that the "quoted asset" is "program A", the "cited asset" is "COPY1", and the "cited asset type". Indicates that it is a “registration original text”. This example shows that the COPY syntax is used to cite the definition of the data contained in the library text. Further, regarding the related information of “No.” of “2”, the “quoted asset” is “program A”, the “cited asset” is “MACRO1”, and the “cited asset type” is “macro”. Is shown. In this example, the MACRO syntax is used to refer to the definition of the function contained in the macro.

FIG. 10 is a diagram showing an example of route information according to the first embodiment of the present invention.
In the example shown in this figure, No. And the origin program and the combination of the relationship destination type and the relationship destination name are associated with each other. A plurality of the above combinations may correspond to the route information.
Here, No. Is information indicating an identifier for identifying route information. The starting program is a program that is not called by another program. The relationship destination type is information indicating the type of the call destination or the access destination. The related party type is, for example, a program, a database, a file, or the like. The relationship destination name is information indicating the name of the program, database, file, etc. of the callee or accessee.

A program called from a certain program is also called a subordinate program. A program that calls a certain program is also called a higher-level program. In this case, there is no upper-level program in the starting point program. Further, the set of the relationship destination type 1 and the relationship destination name 1 is a program directly called from the starting point program, or a database or file directly accessed. The set of the relationship destination type 2 and the relationship destination name 2 is a program, database, file, etc. of a lower level, and is called or accessed by the combination of the relationship destination type 1 and the relationship destination name 1. That is, in the information shown in FIG. 10, the call source and the call destination (access destination) are sequentially shown by tracing the same column from left to right.

In the example shown in this figure, the route information with "1" as "No." is "Program A" as "Starting program", "Relationship type 1" called from the starting program is "Program", and " The "related party name" is "subprogram 1". That is, it indicates that the subordinate “program” named “subprogram 1” is called inside the “program A”.
Further, in the example shown in this figure, the route information of "No." is "2", the "starting program" is "program A", and the "relationship type 1" called from the starting program is "program". , "Relationship name" is "subprogram 2". Furthermore, the “relationship destination type 2” is “database” and the “relationship destination name” is “table 1”. That is, it indicates that the subordinate “program” named “subprogram 2” is called inside the “program A”. It also indicates that the subordinate “database” named “table 1” is accessed inside the “subprogram 2”.

<Processing unit of information processing device>
Returning to FIG. 4, details of the processing unit 12 will be described. The processing unit 12 includes an analysis unit 121, a route extraction unit 122, and a data access analysis unit 123.

The analysis unit 121 acquires asset information from the asset information storage unit 111 and analyzes it. Here, the analysis means that analysis is performed according to the syntax of the program language based on the program language used in the program included in the asset information. The analysis unit 121 stores the data access information, the control structure information, and the relation information in the data access information storage unit 1121, the control structure information storage unit 1122, and the relation information storage unit 1123, respectively, as the analysis result.

The route extraction unit 122 acquires the analysis result from the analysis result storage unit 112 and extracts the processing flow of the program based on the acquired information. The processing flow refers to a series of programs called from the starting point program, or the order in which the accessed data and the like are shown in the called order and the accessed order. The route extraction unit 122 stores the extracted processing flow as route information in the route information storage unit 113. Details of the process of the route extraction unit 122 will be described later.

The data access analysis unit 123 acquires the data access information and the route information from the data access information storage unit 1121 and the route information storage unit 113, respectively, and determines the data belonging to the processing flow based on the acquired information. Further, the data access analysis unit 123 divides the database or file based on the determination result. Here, the data belonging to the processing flow indicates data called from a program included in the processing flow. The data access analysis unit 123 stores the determination result and the division result (hereinafter, also referred to as “analysis result”) in the analysis result storage unit 114. Details of the processing of the data access analysis unit 123 will be described later.

<Operation of information processing device>
FIG. 11 is a flowchart showing an example of processing of the route extraction unit 122 according to the first embodiment of the present invention.

First, the route extraction unit 122 acquires relationship information from the relationship information storage unit 1123. The route extraction unit 122 extracts a program that is not called from another program among the programs based on the acquired relationship information (step S100). Specifically, the route extraction unit 122 includes a program that is included in the caller program of the relationship information (FIG. 8) indicating the call relationship between the programs and is not included in the callee program and is not called by another program. To extract. After extracting, the route extraction unit 122 advances the process to step S101.

The route extraction unit 122 sets the extracted program as a starting point program and recursively extracts programs and functions called from the program (step S101). Specifically, the route extraction unit 122 refers to the relation information (FIGS. 8 and 9) and stores the programs and functions called from the starting program and the information (hereinafter collectively referred to as “program”). Extract. The route extraction unit 122 extracts a program that is further called from the extracted program. Such processing is repeated recursively until there are no called programs. After extracting the route, the route extracting unit 122 advances the process to step S102.

The route extraction unit 122 extracts information of data accessed from each extracted program (step S102). Specifically, the route extraction unit 122 acquires the data access information from the data access information storage unit 1121 and extracts the data accessed by each program based on the acquired information and the extracted program. After extracting the route, the route extracting unit 122 advances the process to step S103.

The route extraction unit 122 sorts out the calling order of the extracted call destination program and the access order to the extracted data in the processing order based on the control structure information (step S103). Specifically, the route extraction unit 122 acquires the control structure information from the control structure information storage unit 1122, and acquires the processing order based on the acquired control structure information and the extracted program and data. When acquiring the processing order, the route extracting unit 122 advances the processing to step S104.

The route extraction unit 122 stores the processing flow from each starting point program in the route information storage unit 113 as route information according to the acquired processing order (step S104). Specifically, the route extraction unit 122 sets a processing list from the starting point program as a processing flow based on the processing order. The route extraction unit 122 stores each processing flow in the route information storage unit 113 as route information. The route information is described in, for example, an XML (Extensible Markup Language) format having connection information, a binary format, or the like as a structure expressing a processing flow. The route extraction unit 122 thus ends the route extraction process.

FIG. 12 is a flowchart showing an example of processing of the data access analysis unit 123 according to the first embodiment of the present invention.

First, the data access analysis unit 123 extracts the data shared between the processing flows (step S200). Specifically, first, the data access analysis unit 123 acquires route information from the route information storage unit 113. The data access analysis unit 123 extracts information of data accessed by a plurality of routes based on the acquired route information. After extracting, the data access analysis unit 123 advances the process to step S201.

The data access analysis unit 123 acquires the access type of the shared data and determines whether or not the access type differs depending on the granularity of the file or table (step S201). The types of access are specifically creation (C), reference (R), update (U), and deletion (D). "Different in the granularity of the file or table" means that the programs included in the plurality of processing flows accessing the shared data satisfy both of the following two conditions. The first condition is that access from a certain process flow includes creation, update, and deletion (collectively these are also referred to as “update system”). The access from this processing flow may include a reference. The second condition is that the processing flow is accessing the shared data, and access from all other processing flows is reference only. "The granularity of the file or table does not differ" indicates cases other than the above.

When both of the above two conditions are satisfied, the data access analysis unit 123 determines that the data access differs depending on the granularity of the file or table (step S201: YES), and advances the process to step S202. On the other hand, when either of the above two conditions is not satisfied, the data access analysis unit 123 determines that the data access does not differ depending on the granularity of the file or table (step S201: NO), and the process proceeds to step S203.

A specific example will be described with reference to FIGS.
No. in FIG. "2" and No. In the case of "4", in these two processing flows, the starting point programs are "A" and "B", respectively. Therefore, the two processing flows are different processing flows. Then, each refers to the “database” of “table 3” as the second access destination. Therefore, the data access analysis unit 123 determines that the data is “table 3” in common. Further, the data access analysis unit 123 acquires the program for accessing this data by referring to the relationship destination name 1. That is, the data access analysis unit 123 acquires that the "table 3" that is the shared data is accessed from the "subprogram 2" and the "subprogram 3".

Subsequently, the data access analysis unit 123 refers to FIG. 5 and determines whether or not the type of access differs depending on the granularity of the table. No. 1 in FIG. “3” indicates that the table 3 is accessed only by reference (R) from the subprogram 2, and the subprogram 3 is accessed by creation, reference, update, and deletion (CRUD). ing. The data access analysis unit 123 acquires this information, and the processing flow using the program A as the starting point program is reference only (not the updating type), and the processing flow using the program B as the starting point program is the updating type. To get In this case, the data access analysis unit 123 determines that the granularity of the file or table is different.

The data access analysis unit 123 determines that data having different access types depending on the file/table granularity belongs to the update processing flow (step S202). Further, in this case, for other processing flows for accessing the data, the access to the data is in the form of an inquiry to the processing flow of the update system. In the case of being made into a micro service, the micro service including the update process flow and the micro service including other individual process flows are loosely coupled through the inquiry. After finishing the attribution process, the data access analysis unit 123 advances the process to step S206.
In the examples of FIGS. 5 and 10 described above, the table 3 belongs to the process flow starting from the program B. The processing flow starting from the program A is an inquiry form to this processing flow.

If the data access does not differ depending on the file/table granularity, it is determined whether the data access differs depending on the granularity of the data item (step S204). In the case of a data item, "data access differs depending on the granularity of the data item" means that one of the following two conditions is satisfied for programs included in multiple processing flows that are accessing shared data. Is. The first condition is that the same data item is accessed from multiple process flows, access to the data item from a certain process flow is an update type, and the data item is accessed from all other process flows. Access to is for reference only. Another condition is that an access to a data item can only be made from a single process flow.

If either of the above two conditions is satisfied, the data access analysis unit 123 determines that the data access differs depending on the granularity of the data item (step S203: YES), and advances the process to step S204. On the other hand, when neither of the above two conditions is satisfied, the data access analysis unit 123 determines that the data access does not differ depending on the granularity of the data item (step S201: NO), and the process proceeds to step S205.

A specific example will be described with reference to FIGS.
No. in FIG. “6” and No. In the case of "7", in these two processing flows, the starting point programs are "D" and "E", respectively. Therefore, the two processing flows are different processing flows. Then, each refers to the “database” of “table 4” as the second access destination. Therefore, the data access analysis unit 123 determines that the data is “table 4” in common. Further, the data access analysis unit 123 acquires the program for accessing this data by referring to the relationship destination name 1. That is, the data access analysis unit 123 acquires that the "table 4" that is the shared data is accessed from the "subprogram 4" and the "subprogram 5". It is also assumed that the data access analysis unit 123 determines that the data access does not differ depending on the granularity of the tables forming the data.

Subsequently, the data access analysis unit 123 refers to FIG. 6 and determines whether or not the types of access differ depending on the granularity of the data item. Referring to FIG. 6, “item 1” and “item 2” are referenced (R) from the subprogram 4, but not accessed from the subprogram 5. Further, "item 3," "item 4," and "item 5" are not accessed by the subprogram 4, but are referenced (R) by the subprogram 5. The data access analysis unit 123 acquires the above-mentioned information and determines that the above-mentioned second condition is satisfied because each data item is accessed only from either processing flow.

The data access analysis unit 123 divides the table or file based on the data having different access types depending on the granularity of the data item (step S204). Specifically, the data access analysis unit 123 determines that, when data having different access types depending on the granularity of the data item is accessed from a plurality of processing flows, the data belongs to the processing flow of the update system. Further, in this case, for other processing flows for accessing the data, the access to the data is in the form of an inquiry to the processing flow of the update system. Further, when the data is accessed only from a single processing flow, the data access analysis unit 123 determines that the data belongs to the accessed processing flow.
Subsequently, the data access analysis unit 123 divides the table or file containing the data according to the assigned processing flow. After finishing the belonging process and the division process, the data access analysis unit 123 advances the process to step S206.

In the examples of FIGS. 6 and 10 above, in the table 4, the data of item 1 and item 2 belong to the process flow starting from the program D, and the data of item 3, item 4, and item 5 are programs. It belongs to the processing flow starting from E. Further, the table 4 is divided into a sub table 41 including the data of item 1 and item 2, and a sub table 42 including the data of item 3, item 4, and item 5.

If the access types do not differ depending on the granularity of the data items, the data access analysis unit 123 collects routes for sharing data into one route (step S205). In this case, there are a plurality of starting programs. After summarizing the routes, the data access analysis unit 123 advances the process to step S206.

The data access analysis unit 123 determines whether or not the shared data still exists (step S206). The data access analysis unit 123 determines that there is still shared data if there is still data that has not been resolved by the above-mentioned processing among the data shared among the plurality of processing flows extracted in step S200. The determination is made (step S206: YES), and the process is returned to step S201. The data access analysis unit 123 determines that there is no shared data when the shared state of all data is resolved by the above-described processing (step S206: NO), and advances the processing to step S207.

The data access analysis unit 123 outputs the analysis result to the analysis result storage unit 114, and ends the process.

As described above, the information processing apparatus 1 includes information (asset information) describing the processing definitions of a plurality of programs for realizing software, data accessed by the programs, and a data set including the data ( Database or file), and a program that is not called from another of the plurality of programs based on the analysis result (data access information, control structure information, relationship information) that is the result of analysis of the program based on Information indicating a certain starting program, information indicating a sub-program that is the program directly or indirectly called from the starting program, and information about the data set accessed from the starting program and the sub-program, Based on the route information and the analysis result, the route processing unit (route extraction unit 122) having the information in which the call order or the access order is associated as the route information indicating the processing flow from the starting point program. For a shared data set that is the data set included in the processing flow, a determination unit (data access) that determines, among a plurality of the processing flows, a belonging process flow (belonging destination) that is a processing flow to which the shared data set belongs. And an analysis unit 123).

As a result, the information processing device 1 is called from the starting program based on the access method when a plurality of programs for realizing software (business system) access a database or file containing data. It is possible to determine which of the plurality of processing flows including the series of programs to be assigned to which processing flow should be assigned. Therefore, it is possible to efficiently divide the data for each belonging destination according to the processing content without annoying the hand of a software expert (or a business expert) when converting into a micro service.

In addition, the determining unit (data access analyzing unit 123) of the information processing device 1 is configured to perform the above-mentioned operation based on the type of access when the starting program or the sub-program accesses data included in the shared data set. Determine attribution process flow.
As a result, even if the same database or file is accessed from multiple process flows, the data can be attributed to one process flow and the process flow can be inquired from other process flows. , It is possible to efficiently divide data according to the processing content, toward microservices with a finer granularity.

In addition, the determination unit (data access analysis unit 123) of the information processing device 1 determines whether the type of access from one processing flow out of the plurality of processing flows for performing the access includes data included in the shared data set. The change, which is a change, when the access type from the remaining processing flow is an acquisition of data included in the shared data set, the access type is a change in data included in the shared data set The flow is determined to be the above-mentioned attribution processing flow.
As a result, the process flow to be attributed is made to be a process flow in which data is changed, so that access to the data from other process flows does not include the change process so that the process flows are combined. Can be loosely coupled. Therefore, in order to realize microservices, data can be efficiently divided according to the processing content so that the microservices are more loosely coupled.

In addition, the determination unit (data access analysis unit 123) of the information processing device 1 determines whether or not two or more of the process flows that access the data included in the shared data set have the access flow. If the types are all changes of the data or both are acquisition of the data, and the data to be accessed is the same data included in the shared data set, the processing flow is changed. The integrated processing flows are combined into one integrated processing flow, and the belonging processing flow is determined.
As a result, when data is accessed from a plurality of process flows and it is not preferable that the process flows belong to either process flow, the process flows that cannot be divided are combined into one process flow. If not summarized, it is not necessary to perform analysis that requires a software expert (or a business expert). Therefore, it is possible to efficiently divide the data according to the processing content toward the microservice.

In addition, the determination unit (data access analysis unit 123) of the information processing device 1 determines whether or not two or more of the process flows that access the data included in the shared data set have the access flow. When the types are all changes of the data or both are the acquisition of the data, and the data to be accessed is different data included in the shared data set, the shared data set is One of the processing flows is divided into sets of data to be accessed, and a divided data set that is a set of divided data is divided into the processing flow of accessing the data included in the divided data set. It is decided to the above-mentioned belonging processing flow.
As a result, for databases and files that are accessed from multiple process flows, from the perspective of the granularity of the data items contained in the databases and files, each of the multiple process flows can access different data items. In this case, the processing flow can be created with finer granularity by dividing the database or file for each item being accessed. Therefore, it is possible to efficiently divide the data according to the processing content, toward the microservice with a finer granularity.

<Second Embodiment>
Hereinafter, a second exemplary embodiment of the present invention will be described in detail with reference to the drawings.
In the present embodiment, a modified example in which data division is performed in consideration of business information indicating the characteristics of data will be described. Hereinafter, the same configurations as those in the first embodiment will be denoted by the same reference numerals and the description thereof will be omitted.

FIG. 13 is a schematic block diagram showing an example of the information processing device 1a according to the second embodiment of the present invention.
The information processing device 1a includes a storage unit 11a and a processing unit 12a. The storage unit 11a differs from the storage unit 11 (FIG. 4) of the first embodiment in that a business information storage unit 115a is added. The business information storage unit 115a will be described below.

The business information storage unit 115a stores business information. Business information is information indicating the characteristics of data used in a business system. Data used in business systems are roughly classified into two types. One is master data that is commonly used in all business. The other is transaction data unique to each business process. Master data is data that is changed less frequently and is referenced by various operations. Transaction data is data that is updated/referenced in daily work, and is accessed from a specific work. The business information is information indicating which data is in the file table including the data.

FIG. 14 is a diagram showing an example of business information according to the second embodiment of the present invention.
In the example shown in this figure, the business information is No. And the type, the DB/file name, and the data type are associated with each other. No. Is information indicating an identifier for identifying business information. The data type is information indicating whether the data included in the DB/file name is master data or transaction data.
In the example shown in this figure, the business information having “No.” of “1” has the “type” of “table” and the “DB/file name” of “data type” of data included in “table 1”. Indicates "master" (master data).

Returning to FIG. 13, the processing unit 12a is different from the processing unit 12 (FIG. 4) of the first embodiment in the function of the data access analysis unit 123a. The basic function of the data access analysis unit 123a is the same as that of the data access analysis unit 123. Hereinafter, among the functions of the data access analysis unit 123a, the functions different from those of the data access analysis unit 123 will be described.

The data access analysis unit 123a determines the data belonging to the processing flow also based on the business information. Further, the data access analysis unit 123a divides the database or file based on the determination result.
When the data access does not differ even with the granularity of the data item (step S203: NO in FIG. 12), the data access analysis unit 123a acquires the type of business information regarding the database or file containing the shared data. Specifically, the data access analysis unit 123a acquires business information from the business information storage unit 115a and determines whether or not a database or file including shared data is master data.

The data access analysis unit 123a excludes access to the master data when the shared data is the master data. In this case, the data access analysis unit 123a outputs, as the analysis result, information indicating that processing different from the microservice conversion, such as converting the access itself into a service, is required to access the data. In addition, the data access analysis unit 123a performs the same processing as that in the first embodiment regarding access to data other than the master data.

Further, when the shared data is transaction data, the data access analysis unit 123a collects the routes sharing the data into one route (processing similar to step S205 in FIG. 12).

A specific example will be described with reference to FIGS. 14 and 15.
FIG. 15 is a diagram showing an example of an analysis result according to the second embodiment of the present invention. The upper part of FIG. 15 shows an example of the data access information stored in the data access information storage unit 1121. The lower part of FIG. 15 shows an example of the relationship information stored in the relationship information storage unit 1123.

With reference to FIG. 15, the data access analysis unit 123a determines that the table 1 is accessed by the programs included in many processing flows. In the example shown in FIG. 15, the table 1 has a sub-program 2 of a processing flow starting from the program A, a sub-program 3 of a processing flow starting from the program B, a sub-program 5 of a processing flow starting from the program B, It is called from the sub-program 5 and the sub-program 51 of the process flow starting from the program C, and the sub-program 61 and the sub-program 6 of the process flow starting from the program D. Further, in any of the programs, the access to the table 1 is a reference (R), and the data division cannot be performed with the granularity of the table. Similarly, the data cannot be divided even by the granularity of data items.

In this case, the data access analysis unit 123a acquires the data type of the table 1 with reference to FIG. In the example shown in FIG. 14, the data type of table 1 is master, and the data included in table 1 is master data. The data access analysis unit 123a acquires this information and determines that the process for microservice conversion is not performed because the table 1 is master data. The data access analysis unit 123a excludes the information included in the table 1 from the information acquired from the analysis result storage unit 112, and determines the data belonging to the processing flow again. Further, the data access analysis unit 123a divides the database or file based on the determination result.

In the example shown in FIG. 15, when table 1 is excluded, only table 2 is accessed from a plurality of processing flows. As for each type of access, one of the processing flows (the sub-program 4 of the processing flow having the program B as the starting program) is reference only (R) and the other (the processing flow having the program C as the starting program is Since the subprogram 52) is the update system (CRUD), it is determined that the subprogram 52 can belong to the granularity of the table.

As described above, the information processing device 1a is based on the information that describes the process definitions of a plurality of programs for realizing software, the data accessed by the programs, and the data set including the data. Based on the analysis result which is the result of analysis of the program, information indicating a starting point program which is a program that is not called from other ones of the plurality of programs and directly or indirectly called from the starting point program The processing flow from the starting point program is indicated by information in which the information indicating the sub program that is the program and the information about the data set accessed from the starting point program and the sub program are associated with each other in the calling order or the access order. The data included in the plurality of processing flows based on a route processing unit (route extraction unit 122) that is route information and the route information, the analysis result, and type information (business information) indicating the type of the data. For a shared data set that is a set, a determination unit (a data access analysis unit 123a) that determines a belonging process flow that is a process flow to which the shared data set belongs, out of the plurality of process flows.
As a result, in the case of access to master data used in the entire system, the information processing apparatus 1a excludes the access to the master data from the processing for microservices, and thus divides the processing flow finely. Will be possible. Therefore, it is possible to efficiently divide the data according to the processing content, toward the microservice with a finer granularity.

FIG. 16 is a block diagram showing an example of the minimum configuration of the information processing device 1 according to each of the above embodiments.
As shown in this figure, the information processing device 1 includes a route processing unit 101 and a determination unit 102.
The route processing unit 101 is a result of analysis of the program based on information describing process definitions of a plurality of programs for realizing software, data accessed by the program, and a data set including the data. Based on the analysis result, information indicating a starting program which is a program that is not called from the other programs among the plurality of programs, and a sub-program that is the program that is called directly or indirectly from the starting program. The information in which the information shown and the information about the data set accessed from the starting program and the subprogram are associated with each other in the calling order or the access order is set as route information indicating a processing flow from the starting program.
The determining unit 102, based on the route information and the analysis result, assigns the shared data set of the plurality of processing flows to the shared data set that is the data set included in the plurality of processing flows. An attribution processing flow that is a processing flow is determined.

In the second embodiment described above, the data access analysis unit 123a has described the example in which the business information is acquired from the business information storage unit 115a when the data access does not differ depending on the granularity of the data items. Not limited. For example, when the business information is acquired in advance and the data access does not differ depending on the file/table granularity, the above-described processing may be performed before the determination based on the granularity of the data item. Further, when the analysis unit 121 performs the analysis, the master data may be excluded from the processing. In this case, the data access information storage unit 1121 includes only data access information regarding transaction data.

Further, in each of the above-described embodiments, an example in which the storage unit 11 (11a) and the processing unit 12 (12a) are included in the same processing device has been described, but the present invention is not limited to this. For example, a storage device including the storage unit 11 (11a) may be provided outside the information processing device 1 (1a).

Further, in each of the above-described embodiments, each processing unit (analysis unit 121, route extraction unit 122, data access analysis unit 123 (123a)) of the processing unit 12 (12a) is an information processing device 1 as an independent device. It may be provided outside of (1a).

Moreover, you may make it implement|achieve a part of information processing apparatus 1 in the above-mentioned embodiment, for example, the process part 12 (12a) etc. with a computer. In that case, the program for realizing this function may be recorded in a computer-readable recording medium, and the program recorded in this recording medium may be read by a computer system and executed. The “computer system” referred to here is a computer system built in the information processing apparatus 1 and includes an OS (Operating System) and hardware such as peripheral devices.

The "computer-readable recording medium" refers to a portable medium such as a flexible disk, a magneto-optical disk, a ROM, a CD-ROM, or a storage device such as a hard disk built in a computer system. Further, the "computer-readable recording medium" means a program that dynamically holds a program for a short time, such as a communication line when transmitting the program through a network such as the Internet or a communication line such as a telephone line. In such a case, a volatile memory that holds a program for a certain period of time, such as a volatile memory inside a computer system serving as a server or a client, may be included. Further, the program may be for realizing a part of the above-described functions, and may be a program for realizing the above-mentioned functions in combination with a program already recorded in the computer system.

Moreover, you may implement|achieve a part or all of the information processing apparatus 1 in the above-mentioned embodiment as an integrated circuit, such as LSI(Large Scale Integration). Each functional unit of the information processing device 1 may be individually implemented as a processor, or a part or all of the functional units may be integrated and implemented as a processor. Further, the method of circuit integration is not limited to LSI, and may be realized by a dedicated circuit or a general-purpose processor. In addition, when a technique for forming an integrated circuit that replaces the LSI appears due to the progress of semiconductor technology, an integrated circuit according to the technique may be used.

Although one embodiment of the present invention has been described in detail above with reference to the drawings, the specific configuration is not limited to the above, and various design changes and the like without departing from the scope of the present invention. It is possible to Further, according to one aspect of the present invention, various modifications can be made within the scope of the claims, and an embodiment obtained by appropriately combining the technical means disclosed in different embodiments is also a technical aspect of the present invention. Included in the range. In addition, a configuration in which elements described in each of the above-described embodiments and modified examples and having the same effect are replaced with each other is also included.

1... Information processing device, 11, 11a... Storage unit, 12, 12a... Processing unit, 111... Asset information storage unit, 112... Analysis result storage unit, 1121... Data access Information storage unit 1122... Control structure information storage unit, 1123... Relation information storage unit, 113... Route information storage unit, 114... Analysis result storage unit, 115a... Business information storage unit, 121... Analysis unit, 122... Route extraction unit, 123, 123a... Data access analysis unit, 101... Route processing unit, 102... Determination unit

Claims (9)

Based on the analysis result which is the result of the analysis of the program based on the information describing the processing definition of the plurality of programs for realizing the software, the data accessed by the program, and the data set including the data. Information indicating a starting program that is a program that is not called from another of the plurality of programs, information indicating a subprogram that is the program that is called directly or indirectly from the starting program, and A route processing unit that uses information that associates an origin program and information about the data set accessed from the subprogram with a calling order or an access order as route information indicating a processing flow from the origin program,
Attribution that is a processing flow to which the shared data set belongs, out of the plurality of processing flows, for the shared data set that is the data set included in the plurality of processing flows based on the route information and the analysis result. A determination unit that determines the processing flow,
Equipped with
The deciding unit is configured such that, among the plurality of processing flows that access the data included in the shared data set, the origin program or the subprogram is included in the shared data set for two or more of the processing flows. If the access type is the same data included in the shared data set, the access type is either a modification of the data or both are acquisition of the data. If it is, collectively the said processing flow in a single integrated process flow, the information processing apparatus that determine the integration process flow to the belonging process flow. Based on the analysis result which is the result of the analysis of the program based on the information describing the processing definition of the plurality of programs for realizing the software, the data accessed by the program, and the data set including the data. Information indicating a starting program that is a program that is not called from another of the plurality of programs, information indicating a subprogram that is the program that is called directly or indirectly from the starting program, and A route processing unit that uses information that associates an origin program and information about the data set accessed from the subprogram with a calling order or an access order as route information indicating a processing flow from the origin program,
Attribution that is a processing flow to which the shared data set belongs, out of the plurality of processing flows, for the shared data set that is the data set included in the plurality of processing flows based on the route information and the analysis result. A determination unit that determines the processing flow,
Equipped with
The deciding unit is configured such that, among the plurality of processing flows that access the data included in the shared data set, the origin program or the subprogram is included in the shared data set for two or more of the processing flows. When accessing the data, the type of access is either a modification of the data, or both are acquisition of the data, and the data to be accessed is different data included in the shared data set. In this case, the shared data set is divided for each set of data accessed from the single processing flow, and the divided data set that is the divided data set is accessed for the data included in the divided data set. the processing flow for performing a corresponding divided data the belonging process flow information processing apparatus that determine the set. The determining unit determines the attribution processing flow based on the route information, the analysis result, and type information indicating a type of the data.
The information processing apparatus according to claim 1 or 2 . Based on the analysis result which is the result of the analysis of the program based on the information describing the processing definition of the plurality of programs for realizing the software, the data accessed by the program, and the data set including the data. Information indicating a starting program that is a program that is not called from another of the plurality of programs, information indicating a subprogram that is the program that is called directly or indirectly from the starting program, and A route processing unit that uses information that associates an origin program and information about the data set accessed from the subprogram with a calling order or an access order as route information indicating a processing flow from the origin program,
Attribution that is a processing flow to which the shared data set belongs, out of the plurality of processing flows, for the shared data set that is the data set included in the plurality of processing flows based on the route information and the analysis result. A determination unit that determines the processing flow,
Bei to give a,
The deciding unit is configured such that, among the plurality of processing flows that access the data included in the shared data set, the origin program or the subprogram is included in the shared data set for two or more of the processing flows. If the access type is the same data included in the shared data set, the access type is either a modification of the data or both are acquisition of the data. If it is, collectively the said processing flow in a single integrated process flow, the information processing system that determines the integration process flow to the belonging process flow. Based on the analysis result which is the result of the analysis of the program based on the information describing the processing definition of the plurality of programs for realizing the software, the data accessed by the program, and the data set including the data. Information indicating a starting program that is a program that is not called from another of the plurality of programs, information indicating a subprogram that is the program that is called directly or indirectly from the starting program, and A route processing unit that uses information that associates an origin program and information about the data set accessed from the subprogram with a calling order or an access order as route information indicating a processing flow from the origin program,
Attribution that is a processing flow to which the shared data set belongs, out of the plurality of processing flows, for the shared data set that is the data set included in the plurality of processing flows based on the route information and the analysis result. A determination unit that determines the processing flow,
Equipped with
The deciding unit is configured such that, among the plurality of processing flows that access the data included in the shared data set, the origin program or the subprogram is included in the shared data set for two or more of the processing flows. When accessing the data, the type of access is either a modification of the data, or both are acquisition of the data, and the data to be accessed is different data included in the shared data set. In this case, the shared data set is divided for each set of data accessed from the single processing flow, and the divided data set that is the divided data set is accessed for the data included in the divided data set. An information processing system that determines the processing flow for performing the above as the belonging processing flow of the divided data set. The route processing unit of the information processing apparatus analyzes the program based on information describing process definitions of a plurality of programs for realizing software, data accessed by the program, and a data set including the data. On the basis of the analysis result which is the result, information indicating a starting program which is a program that is not called from the other programs among the plurality of programs, and the program which is called directly or indirectly from the starting program. Information indicating a certain subprogram and information relating to the starting point program and the data set to be accessed from the subprogram are associated with each other in the calling order or the access order, and route information indicating a processing flow from the starting point program. Route processing steps to
The determination unit of the information processing device , based on the route information and the analysis result, for the shared data set that is the data set included in the plurality of processing flows, the shared data among the plurality of processing flows. A determination step of determining a belonging processing flow which is a processing flow to which the set belongs;
Only including,
The deciding unit is configured such that, among the plurality of processing flows that access the data included in the shared data set, the origin program or the subprogram is included in the shared data set for two or more of the processing flows. If the access type is the same data included in the shared data set, the access type is either a modification of the data or both are acquisition of the data. When it is, the information processing method of integrating the processing flow into one integrated processing flow and determining the integrated processing flow as the belonging processing flow . The route processing unit of the information processing apparatus analyzes the program based on information describing process definitions of a plurality of programs for realizing software, data accessed by the program, and a data set including the data. On the basis of the analysis result which is the result, information indicating a starting program which is a program that is not called from the other programs among the plurality of programs, and the program which is called directly or indirectly from the starting program. Information indicating a certain subprogram and information relating to the starting point program and the data set to be accessed from the subprogram are associated with each other in the calling order or the access order, and route information indicating a processing flow from the starting point program. Route processing steps to
The determination unit of the information processing device, based on the route information and the analysis result, for the shared data set that is the data set included in the plurality of processing flows, the shared data among the plurality of processing flows. A determination step of determining a belonging processing flow which is a processing flow to which the set belongs;
Including
The deciding unit is configured such that, among the plurality of processing flows that access the data included in the shared data set, the origin program or the subprogram is included in the shared data set for two or more of the processing flows. When accessing the data, the type of access is either a modification of the data, or both are acquisition of the data, and the data to be accessed is different data included in the shared data set. In this case, the shared data set is divided for each set of data accessed from the single processing flow, and the divided data set that is the divided data set is accessed for the data included in the divided data set. An information processing method for deciding the processing flow for performing the above as the belonging processing flow of the divided data set. Based on the analysis result which is the result of the analysis of the program based on the information describing the processing definition of the plurality of programs for realizing the software, the data accessed by the program, and the data set including the data. Information indicating a starting program that is a program that is not called from another of the plurality of programs, information indicating a subprogram that is the program that is called directly or indirectly from the starting program, and A route processing step in which information in which a starting point program and information about the data set accessed from the subprogram are associated with each other in a calling order or an access order is route information indicating a processing flow from the starting point program,
Attribution that is a processing flow to which the shared data set belongs, out of the plurality of processing flows, for the shared data set that is the data set included in the plurality of processing flows based on the route information and the analysis result. A determination step for determining the processing flow,
Is a program for causing a computer to execute ,
The computer is
In the determining step, the data in which the starting program or the subprogram is included in the shared data set is included in two or more of the process flows that access the data included in the shared data set. If the access type is the same data included in the shared data set, the access type is either a modification of the data or both are acquisition of the data. When it is, the program which combines the said process flow into one integrated process flow, and determines the said integrated process flow to the said belonging process flow . Based on the analysis result which is the result of the analysis of the program based on the information describing the processing definition of the plurality of programs for realizing the software, the data accessed by the program, and the data set including the data. Information indicating a starting program that is a program that is not called from another of the plurality of programs, information indicating a subprogram that is the program that is called directly or indirectly from the starting program, and A route processing step in which information in which a starting point program and information about the data set accessed from the subprogram are associated with each other in a calling order or an access order is route information indicating a processing flow from the starting point program,
Attribution that is a processing flow to which the shared data set belongs, out of the plurality of processing flows, for the shared data set that is the data set included in the plurality of processing flows based on the route information and the analysis result. A determination step for determining the processing flow,
Is a program for causing a computer to execute,
The computer is
In the determining step, the data in which the starting program or the subprogram is included in the shared data set is included in two or more of the process flows that access the data included in the shared data set. When accessing the data, the type of access is either a modification of the data, or both are acquisition of the data, and the data to be accessed is different data included in the shared data set. In this case, the shared data set is divided for each set of data accessed from the single processing flow, and the divided data set that is the divided data set is accessed for the data included in the divided data set. A program for deciding the processing flow for performing the above as the belonging processing flow of the divided data set.

Images