JP2014235675A - Data processing apparatus and data processing method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a data processing apparatus and a data processing method capable of reducing data processing execution time and reducing the capacity of a storage area.SOLUTION: A data processing apparatus 1 according to the present invention comprises: a process analyzer 11 analyzing a process definition 2 defining services constituting a process and an order of calling the services when a data process is performed, and detecting whether service calls obtaining an identical data processing result are present; a service call relation storage unit 12 storing therein the service calls detected by the process analyzer 11 and the process including the service calls while making the detected services correspond to the process; a result information storage unit 14 storing therein a data processing result by the service calls stored in the service call relation storage unit 12; and a process execution unit 13 executing the data processing on the basis of the process definition 2 and the data processing result stored in the result information storage unit 14.

Description

  The present invention relates to a data processing apparatus, and more particularly to a data processing apparatus and a data processing method using a service linkage technology through a message bus such as SOA (Service Oriented Architecture).

  The SOA is a design method for constructing a system by combining a plurality of services. A service is a set of software having a function of a meaningful unit, and is called from outside according to a standardized procedure. Here, “meaningful” means that there is some meaning for business or for human beings.

  The service called from the outside performs data processing such as data calculation and value conversion using the data given from the outside at the time of the call or the data stored on the called service side, and the data Return the result of processing to the request source. A series of data processing configured by combining a plurality of services is called a process.

  When building a system based on SOA, middleware called ESB (Enterprise Service Bus) is often used. ESB is middleware that links multiple services and links external systems and services. The ESB provides a message bus. By exchanging messages between a plurality of services or between an external system and a service via the message bus, a plurality of services or an external system and a service are exchanged. It is running as a process in coordination.

  Conventionally, as a system using ESB, in order to shorten the execution time of the process, the result of data processing of each service is stored, and the same result is obtained by reusing the stored data processing result by other services. A technique for preventing the processing from being performed many times is disclosed (for example, see Patent Document 1).

JP 2001-34392 A

  Measurement data is measured at predetermined intervals, such as a meteorological observation data management system that measures rainfall and temperature at various locations at regular intervals and manages them centrally, and a meter data management system that manages meter readings of power meters with a central server. There are systems that are updated and the processes are executed in line with the updates. In such a system, measurement data is used in a variety of ways, such as for future predictions and regional analysis, so that data processing is performed by a plurality of processes.

  In recent years, the number of measurement objects has increased and the amount of measurement data has increased, so that the time required for data processing tends to increase. On the other hand, since it is necessary to complete a series of processes to be executed before the latest updated measurement data is updated again, the execution time of the process can be shortened.

  For example, in the above meteorological observation data management system, a process for calculating the temperature difference between the current day and the previous day (hereinafter referred to as the previous year comparison process) and a process for calculating the temperature difference between the current day and the previous day (hereinafter referred to as the previous day comparison process). )). In such a meteorological observation data management system, past measurement data (here, past temperature data) becomes enormous, so the device for storing past measurement data is the latest measurement data (here, the latest temperature data). (Data) may be provided separately from a device for storing data.

  At this time, the previous year comparison process and the previous day comparison process are different from the service that acquires the temperature information on the same day of the previous year or the previous day using the service that acquires the past measurement data and acquires the past measurement data. The temperature information of the day is acquired using a service that acquires the latest measurement data. Thereafter, in each process, a result of comparison between past measurement data and the latest measurement data is output.

  In the above meteorological observation data management system, the time required to call a service is shortened to shorten the process execution time. For example, if the number of observation points becomes enormous, the data size of the temperature information (measurement data) to be acquired also becomes enormous, so that it takes a lot of time to acquire the temperature information. Therefore, the temperature information, which is the result of the service called in each process (processing result), is temporarily saved, and the saved temperature information is reused between processes, thereby reducing the number of service calls and reducing the time required for data processing. doing.

  In Patent Document 1, the number of service calls is reduced by temporarily storing all the results of the service called in each process, but the capacity of the storage area for temporarily storing the service results is reduced. There was a problem. In other words, according to the above example, not only “current temperature information on the current day” that is reused among multiple processes (previous year comparison process, previous day comparison process), Since the temperature information is also stored, there is a problem in that the storage area required for the storage is limited.

  The present invention has been made to solve these problems, and provides a data processing apparatus and a data processing method capable of reducing the execution time of data processing and reducing the capacity of a storage area. With the goal.

  In order to solve the above-described problems, a data processing apparatus according to the present invention includes a service constituting a process and a service when the process performs data processing for a process configured by combining a plurality of services and performing a series of data processing. The process definition that defines the order of calling the service, the process analysis unit that detects whether there is a service call that can obtain the same data processing result, the service call detected by the process analysis unit, and the service A service call relationship storage unit that associates and stores a process having a call, a result information storage unit that stores a data processing result by a service call stored in the service call relationship storage unit, a process definition, and a result information storage unit And a process execution unit that executes data processing based on the data processing result stored in the storage.

  In addition, the data processing method according to the present invention includes (a) a service that is configured by combining a plurality of services and performs a series of data processing, a service that configures the process, and an order of calling the service when the process performs data processing; Analyzing the process definition that defines the process, and detecting whether there is a service call that can obtain the same data processing result; (b) having the service call detected by the process analysis unit and the service call A step of associating and storing the process in the service call relationship storage unit, (c) a step of storing a data processing result by the service call stored in the service call relationship storage unit, (d) a process definition, and result information And a step of executing data processing based on the data processing result stored in the storage unit.

  According to the present invention, a data processing apparatus defines, for a process configured by combining a plurality of services and performing a series of data processing, a service configuring the process and an order of calling the service when the process performs data processing. Corresponds between the process analysis unit that analyzes the process definition and detects whether there is a service call that can obtain the same data processing result, the service call detected by the process analysis unit, and the process having the service call A service call relationship storage unit that stores the result, a result information storage unit that stores a data processing result by the service call stored in the service call relationship storage unit, a process definition, and a data processing result stored in the result information storage unit And a process execution unit that executes data processing based on the With shortened, it is possible to reduce the capacity of the storage area.

  In addition, the data processing method defines (a) a process that is configured by combining a plurality of services and performs a series of data processing, and defines a service that configures the process and an order of calling the service when the process performs data processing. Analyzing the process definition and detecting whether or not there is a service call that provides the same data processing result; and (b) a service call detected by the process analysis unit and a process having the service call. Storing in the service call relationship storage unit in association with each other; (c) storing the data processing result by the service call stored in the service call relationship storage unit; (d) in the process definition and the result information storage unit And a step of executing data processing based on the stored data processing result, thereby shortening the data processing execution time. Both, it is possible to reduce the capacity of the storage area.

It is a block diagram which shows an example of a structure of the data processor by Embodiment 1 of this invention. It is a figure which shows an example of the concept of the process definition by Embodiment 1 of this invention. It is a figure which shows an example of the setting of the process definition by Embodiment 1 of this invention. It is a flowchart which shows an example of operation | movement of the data processor by Embodiment 1 of this invention. It is a figure which shows an example of the concept of the process definition by Embodiment 1 of this invention. It is a figure which shows an example of the tree structure of the process definition by Embodiment 1 of this invention. It is a figure which shows an example of a structure of the service call relationship memory | storage part by Embodiment 1 of this invention. It is a figure which shows an example of the tree structure of the process definition by Embodiment 1 of this invention. It is a figure which shows an example of a structure of the service call relationship memory | storage part by Embodiment 1 of this invention. It is a figure which shows an example of the tree structure of the process definition by Embodiment 1 of this invention. It is a figure which shows an example of a structure of the service call relationship memory | storage part by Embodiment 1 of this invention. It is a figure which shows an example of the tree structure of the process definition by Embodiment 1 of this invention. It is a flowchart which shows an example of operation | movement of the process execution part by Embodiment 1 of this invention. It is a figure which shows an example of a structure of the service call relationship memory | storage part by Embodiment 2 of this invention. It is a flowchart which shows an example of operation | movement of the process execution part by Embodiment 2 of this invention. It is a block diagram which shows an example of a structure of the data processor by Embodiment 3 of this invention. It is a figure which shows an example of a structure of the service call relationship memory | storage part by Embodiment 3 of this invention. It is a figure which shows an example of the process execution order definition by Embodiment 3 of this invention. It is a flowchart which shows an example of operation | movement of the data processor by Embodiment 3 of this invention. It is a flowchart which shows an example of operation | movement of the process execution part by Embodiment 3 of this invention. It is a block diagram which shows an example of a structure of the data processor by Embodiment 4 of this invention. It is a figure which shows an example of the process execution order priority definition by Embodiment 4 of this invention. It is a flowchart which shows an example of operation | movement of the data processor by Embodiment 4 of this invention.

  Embodiments of the present invention will be described below with reference to the drawings.

<Embodiment 1>
FIG. 1 is a block diagram showing an example of the configuration of the data processing apparatus 1 according to the first embodiment of the present invention.

  As shown in FIG. 1, the data processing apparatus 1 according to the first embodiment includes a process analysis unit 11, a service call relation storage unit 12, a process execution unit 13, and a result information storage unit 14. Further, the data processing apparatus 1 calls the service to the external service providing apparatuses 101 to 103 that provide the service, links the services, and processes results that are final data processing results in one process. Is transmitted to the process result storage device 201 and the external device 202 that requests the process result.

  The process analysis unit 11 analyzes the process definition 2 (described later), and detects whether there is a service call that can obtain the same data processing result. Here, the service call refers to a service that takes into consideration the order in which the process is called when performing data processing in a process that is configured by combining a plurality of services and performs a series of data processing.

  The service call relation storage unit 12 stores the service call detected by the process analysis unit 11 and the process having the service call in association with each other.

  The result information storage unit 14 stores the data processing result by the service call stored in the service call relation storage unit.

  The process execution unit 13 executes data processing based on the process definition 2 and the data processing result stored in the result information storage unit 14.

  FIG. 2 is a diagram illustrating an example of the concept of the process definition 2. FIG. 3 is a diagram illustrating an example of process definition settings.

  The process definition 2 determines the behavior of the system (in this case, the data processing apparatus 1). In many cases, the process definition 2 is set by a person and stored in the system, but receives a predetermined input from the outside of the system. The system itself may automatically generate based on the input.

  In FIG. 2, a rectangle indicates that a service call is performed, and an ellipse indicates data. The service calling order in process A will be described below.

  As shown in FIG. 2, first, the service 1-c is called without input, and data X is obtained as a result of data processing by the service 1-c. Thereafter, the service 2-b is called with the data X as an input, and the data Y is obtained as a result of data processing by the service 2-b.

  On the other hand, the service 2-c is called with data V, which is a unique input value, as input, and data W is obtained as a result of data processing by the service 2-c.

  Next, the service 3-a is called by combining the data Y and the data W as one input, and data Z is obtained as a result of data processing by the service 3-a. That is, the process A obtains data Z as a result of the entire data processing.

  As described above, the service does not require input data (for example, service 1-c) and one or more input data or a service that requires a specific input value for each process ( For example, there are service 2-b, service 2-c, and service 3-a). The output of the called service (data processing result) is used as the input of the service to be called next, and the services are linked by sequentially calling a series of services.

  In the above-described meteorological observation data management system and meter data management system, one or a plurality of processes are executed at regular time intervals (predetermined period). In the case where the data processing apparatus 1 according to the first embodiment is applied to such a system, the process analysis unit 11 reads all the process definitions 2 before starting the execution of the process, and is the same in all the read processes. It is searched (analyzed) whether there is a service call that can obtain the result of the data processing, that is, whether there is a service call that has the same name as the service name to be called. Thereafter, the process execution unit 13 does not call the detected service, and reuses the data processing result of the detected service. Note that the process analysis unit 11 may read the process definition 2 every fixed time (predetermined period) or may be read once before the above-described operation of each system or at the time of expansion.

  Next, the operation of the data processing apparatus 1 (processing of the process analysis unit 11 and the process execution unit 13) will be described in detail with reference to FIGS.

  FIG. 4 is a flowchart showing an example of the operation of the data processing apparatus 1. FIG. 4 shows a case where the process analysis unit 11 reads the process definition 2 at regular intervals.

  FIG. 5 is a diagram illustrating an example of the concept of the process definition 2, and conceptualizes the process definitions 2 of the process A, the process B, and the process C. In FIG. 5, unlike FIG. 3, illustration of data between services is omitted. Hereinafter, the process definition 2 will be described assuming that each process and each service shown in FIG. 5 are defined.

  In step S101, the process analysis unit 11 reads the process definition 2 in a tree structure. Specifically, the process analysis unit 11 reads each process defined by the process definition 2 in a tree structure having a service called last among a series of services constituting each process as a root. FIG. 6 shows a tree structure of each process read by the process analysis unit 11.

  In step S102, the process analysis unit 11 searches for a portion having a depth of 1 from the leaf portion of each process tree structure and searches for whether or not the same subtree structure is included. That is, in each process shown in FIG. 6 or the same process, a service or a specific input value (hereinafter referred to as a service or a specific input value) is located at the lowest level (a portion having a depth of 1 from the leaf portion of the tree structure). A part having the same tree structure (hereinafter referred to as the same partial tree structure part) is searched.

  In step S103, the process analysis unit 11 determines whether each process or the same process has the same partial tree structure location. If there is an identical partial tree structure, the process proceeds to step S104. On the other hand, if there is no identical partial tree structure, the process proceeds to step S106. In FIG. 6, the service 1-a is called in the process B and the process C, and the service 1-a is called in the process C a plurality of times. Accordingly, the process proceeds to step S104.

  In step S <b> 104, the process analysis unit 11 adds a partial tree structure (1-a) as a detection result to the service call relationship storage unit 12.

  FIG. 7 shows an example of the configuration of the service call relationship storage unit 12, and shows the search result at the depth 1. As shown in FIG. 7, in the service call relation storage unit 12, the subtree structure (1-a) detected by the process analysis unit 11 is stored in the subtree structure column (No. in FIG. 7). 1). At this time, the sub-tree structure (1-a) is replaced with the key α for convenience (α is stored in the column of the key after replacement). FIG. 8 shows the tree structure of each process after being replaced by the key α.

  Further, in the service call relationship storage unit 12, the column of presence / absence of cache processing and the column of the corresponding process are edited. Since the result of the data processing by the partial tree structure (1-a) is a target to be stored in the result information storage unit 14, the presence / absence of the cache processing is set to “Yes”. The name of the process (process B, process C) having the partial tree structure (1-a) is stored in the corresponding process column.

  Returning to FIG. 4, in step S <b> 105, the process analysis unit 11 decreases the depth by 1 (decreases to the depth 2), and searches for the same partial tree structure location at the depth 2. Specifically, in FIG. 8, the same partial tree structure location at the depth 2 starting from α is searched.

  As shown in FIG. 8, there are a plurality of places where the service 2-b is called following the call of α, and the service 2-b becomes the same partial tree structure place. Accordingly, the process analysis unit 11 determines that there is the same partial tree structure location in step S103, and additionally writes the partial tree structure α (2-b) as a detection result in the service call relationship storage unit 12 in step S104. Here, α (2-b) indicates that the service 2-b is called after α.

  FIG. 9 shows an example of the configuration of the service call relationship storage unit 12, and shows the search result at the depth 2. As shown in FIG. 9, in the service call relation storage unit 12, the subtree structure α (2-b) detected by the process analysis unit 11 is stored in the subtree structure column (No in FIG. 9). .2). At this time, the subtree structure α (2-b) is replaced with the key β for convenience (β is stored in the column of the key after replacement). FIG. 10 shows the tree structure of each process after being replaced with the key β.

  Further, in the service call relationship storage unit 12, the column of presence / absence of cache processing and the column of the corresponding process are edited. Since the result of the data processing by the partial tree structure α (2-b) is a target to be stored in the result information storage unit 14, the presence / absence of the cache processing is set to “present”. The name of the process (process B, process C) having the subtree structure α (2-b) is stored in the corresponding process column.

  At this time, the process analysis unit 11 also searches whether or not α exists in the tree structure of each process shown in FIG. In FIG. 10, since all α are replaced with β, it is not necessary to store the result of the data processing of α in the result information storage unit 14. Therefore, the column of presence / absence of cache processing in the partial tree structure (1-a) of the service call relation storage unit 12 is rewritten to “None” (see No. 1 in FIG. 9).

  Returning to FIG. 4, in step S <b> 105, the process analysis unit 11 decreases the depth by 1 (decreases to the depth 3), and searches for the same partial tree structure location at the depth 3. Specifically, in FIG. 10, the same partial tree structure location at the depth 3 starting from β is searched.

  As shown in FIG. 10, there are a plurality of places where the service 1-b is called following the call of β, and the service 1-b becomes the same partial tree structure place. Accordingly, the process analysis unit 11 determines that there is the same partial tree structure location in step S103, and additionally writes the partial tree structure β (1-b) as a detection result in the service call relationship storage unit 12 in step S104. Here, β (1-b) indicates that service 1-b is called after β.

  FIG. 11 shows an example of the configuration of the service call relationship storage unit 12 and shows search results at a depth of 3. As shown in FIG. 11, in the service call relation storage unit 12, the subtree structure β (1-b) detected by the process analysis unit 11 is stored in the subtree structure column (No in FIG. 11). .3). At this time, the sub-tree structure β (1-b) is replaced with the key γ for convenience (γ is stored in the column of the key after replacement). FIG. 12 shows the tree structure of each process after being replaced with the key γ.

  Further, in the service call relationship storage unit 12, the column of presence / absence of cache processing and the column of the corresponding process are edited. Since the result of the data processing by the partial tree structure β (1-b) is a target to be stored in the result information storage unit 14, the presence / absence of the cache processing is set to “Yes”. The name of the process (process B, process C) having the partial tree structure β (1-b) is stored in the corresponding process column.

  At this time, the process analysis unit 11 also searches for whether or not β exists in the tree structure of each process shown in FIG. In FIG. 12, since β exists in the process C, it is necessary to store the result of data processing of β in the result information storage unit 14. Therefore, the presence / absence of the cache processing in the sub-tree structure α (2-b) of the service call relationship storage unit 12 is left “Yes” (see No. 2 in FIG. 11).

  Returning to FIG. 4, in step S <b> 105, the process analysis unit 11 decreases the depth by 1 (decreases to the depth 4) and searches for the same partial tree structure location at the depth 4. Specifically, in FIG. 12, the same partial tree structure location at the depth 4 starting from γ is searched. In FIG. 12, since the same partial tree structure location is not searched, the process proceeds to step S106.

  In step S106, the process execution unit 13 refers to the service call relationship storage unit 12 and sequentially executes all processes (process A, process B, and process C).

  As described above, the operation (data processing method) of the data processing apparatus 1 is as follows: (a) a process that is configured by combining a plurality of services and performs a series of data processing; Analyzing the process definition that defines the order of calling the services, and detecting whether there is a service call that provides the same data processing result; and (b) the service call detected by the process analysis unit; Storing the process having the service call in association with the service call relationship storage unit, (c) storing the data processing result by the service call stored in the service call relationship storage unit, and (d) And a step of executing data processing based on the process definition and the data processing result stored in the result information storage unit.

  Next, details of the operation of the process execution unit 13 will be described.

  FIG. 13 is a flowchart showing an example of the operation of the process execution unit 13, and shows details of the processing in step S106 of FIG.

  In step S201, a process to be executed is determined and execution of the determined process is started. In the first embodiment, the process to be executed may be selected randomly, or may be in ascending order or descending order of process names.

  In step S202, the service to be called next is acquired from the process definition 2.

  In step S203, it is determined whether or not the service to be called in step S202 is stored in the service call relation storage unit 12. That is, it is determined whether or not the service to be called is replaced with a key such as key β or key γ shown in FIG. If the service to be called is not stored in the service call relationship storage unit 12, the process proceeds to step S204. On the other hand, when the service to be called is stored in the service call relation storage unit 12, the process proceeds to step S205.

  In step S204, a service is called.

  In step S <b> 205, it is determined whether a result of data processing for a series of services stored as a partial tree structure in the service call relationship storage unit 12 is stored in the result information storage unit 14. That is, it is determined whether or not the result information storage unit 14 stores the data processing result of the service corresponding to the key (key β, key γ) having the presence / absence of the cache processing shown in FIG. When the result of the data processing is not stored in the result information storage unit 14, the process proceeds to step S206. On the other hand, when the result of the data processing is stored in the result information storage unit 14, the process proceeds to step S207.

  In step S <b> 206, a series of services stored as a partial tree structure in the service call relation storage unit 12 are called, and the results of data processing for the series of services are stored in the result information storage unit 14.

  In step S <b> 207, the result of data processing of a series of services stored as a partial tree structure in the service call relationship storage unit 12 is acquired from the result information storage unit 14.

  In step S208, it is determined whether or not all services have been called in the currently executing process. If all the services have been called, the process proceeds to step S209. On the other hand, if all services have not been called, the process proceeds to step S202.

  In step S209, it is determined whether or not all processes have been executed. When the execution of all processes is finished, the process of the process execution unit 13 is finished. On the other hand, if the execution of all processes has not been completed, the process proceeds to step S201.

  From the above, according to the first embodiment, all process definitions 2 are read before the process is executed, and data processing results of all services are not stored, but data processing of reused services is stored. Only the result is stored in the result information storage unit 14. Therefore, it is possible to reduce the execution time of data processing and reduce the capacity of the entire storage area in the data processing apparatus 1.

<Embodiment 2>
In the data processing device 1 according to the second embodiment of the present invention, when the process execution unit 13 completes the execution of all the processes that perform service calls stored in the service call relation storage unit 12, the process that has completed the execution is performed. The data processing result of the service call that has been called is erased from the result information storage unit 14. Since other configurations and operations are the same as those in the first embodiment, description thereof is omitted here.

  FIG. 14 is a diagram illustrating an example of the configuration of the service call relationship storage unit 12. The service call relationship storage unit 12 shown in FIG. 14 is newly provided with an execution completion process column as compared to the service call relationship storage unit 12 (Embodiment 1) shown in FIG. The rest is the same as the service call relation storage unit 12 shown in FIG.

  FIG. 15 is a flowchart illustrating an example of the operation of the process execution unit 13. Note that the processing in steps S301 to S308 in FIG. 15 is the same as the processing in steps S201 to S208 in FIG. Below, step S309 and subsequent steps will be described.

  In step S309, the service call relationship storage unit 12 stores the name of the process that has been executed. Specifically, each time the execution of the process is completed, the name of the process that has been completed is added to the column of the execution completion process in the service call relation storage unit 12 shown in FIG. In other words, when the execution of the process stored in the service call relationship storage unit 12 is completed, the process execution unit 13 stores information indicating the completion in the service call relationship storage unit.

  For example, in FIG. 14, the result of the data processing of a series of services corresponding to the key α is not cached (because the presence or absence of the cache processing is “None”), so the execution completion process column is “-”. Yes. In addition, the key β and the key γ indicate that the process B has been executed.

  In FIG. 14, the process that has been executed is shown in the execution completion process column. However, if it can be determined which process has completed execution or which process has not yet completed execution, It may be a method.

  Returning to FIG. 15, in step S <b> 310, it is determined whether all processes described in the corresponding process column of the service call storage unit have been executed. Specifically, the names of the processes stored in the corresponding process column of the service call relation storage unit 12 are checked in order, and it is determined whether or not all the processes for calling a series of services corresponding to the predetermined key have been executed. . If all have been executed, the process proceeds to step S311. On the other hand, if all are not executed, the process proceeds to step S301. In other words, the process execution unit 13 executes all processes that perform service calls stored in the service call relationship storage unit 12 based on information indicating that the execution of processes stored in the service call relationship storage unit 12 is completed. It is determined whether or not is completed.

  In step S311, a result of data processing of a series of services corresponding to a predetermined key is deleted from the result information storage unit.

  In step S312, it is determined whether or not all processes have been executed. When the execution of all processes is finished, the process of the process execution unit 13 is finished. On the other hand, if the execution of all processes has not been completed, the process proceeds to step S301.

  From the above, according to the second embodiment, in addition to the effects of the first embodiment, less data is stored by erasing the result of data processing of services that are no longer reused from the result information storage unit 14. It is possible to execute a series of processes in capacity.

<Embodiment 3>
FIG. 16 is a block diagram showing an example of the configuration of the data processing device 1 according to the third embodiment of the present invention.

  As shown in FIG. 16, the data processing device 1 according to the third embodiment includes a process execution order definition creating unit 15, and the process execution order definition creating unit 15 creates the process execution order definition 3. . The process execution order definition 3 defines the process execution order. Since other configurations and operations are the same as those in the first or second embodiment, description thereof is omitted here.

  The process analysis unit 11 creates a service call relationship storage unit 12 based on the analysis result of the process definition 2. Further, the process execution unit 13 executes a process (data processing) according to the process execution order definition 3.

  The process execution order definition creating unit 15 processes the process execution order definition 3 so as to collectively execute processes for calling the series of services for the series of service calls corresponding to the same subtree structure location detected by the process analysis unit 11. Rewrite. In other words, the process execution order definition creating unit 15 creates the process execution order definition 3 based on the service call and the process stored in the service call relationship storage unit 12.

  In the third embodiment, the process execution order is created such that the smaller the number of processes that call a predetermined series of services, the earlier the series of services are called. Note that the process execution order definition creating unit 15 is characterized by the characteristics of the system, the characteristics of the service, etc. when there are a plurality of services called from many processes or when the data size of the data processing result of a predetermined service is very large. You may make it create the execution order of the process based on this.

  FIG. 17 is a diagram illustrating an example of the configuration of the service call relationship storage unit 12. FIG. 18 is a diagram showing an example of the process execution order definition 3 created based on the service call relationship storage unit 12 shown in FIG. As shown in FIG. 18, in the process execution order definition 3, one process name is described in one line without duplication, and the process described in the upper part is executed first. For example, FIG. 18 shows that process B is executed first and process D is executed last.

  FIG. 19 is a flowchart illustrating an example of the operation of the data processing apparatus 1. Note that the processing in steps S401 to S405 in FIG. 19 is the same as the processing in steps S101 to S105 in FIG. Hereinafter, step S406 and subsequent steps will be described.

  In step S <b> 406, the process execution order definition creation unit 15 creates the process execution order definition 3 based on the service call relationship storage unit 12. Specifically, the process execution order definition creation unit 15 acquires information on each partial tree structure from the service call relationship storage unit 12, and the smaller the number of calling source processes among the partial tree structures, the earlier the execution is performed. A process execution order definition 3 is created so that For example, when the service call relationship storage unit 12 is in the state shown in FIG. 17, the process execution order definition creation unit 15 creates the process execution order definition 3 as shown in FIG.

  In step S407, the process execution unit 13 sequentially executes all processes according to the process execution order definition 3. For example, when the process execution order definition 3 is as shown in FIG. 18, the process execution unit 13 executes process B, process C, process A, and process D in this order.

  FIG. 20 is a flowchart showing an example of the operation of the process execution unit 13, and shows details of the process in step S407 of FIG. Note that the processing from step S502 to step S512 in FIG. 20 is the same as the processing from step S302 to step S312 in FIG. Hereinafter, step S501 will be described.

  In step S501, the process to be executed next is acquired from the process execution order definition 3.

  From the above, according to the third embodiment, in addition to the effects of the first or second embodiment, the execution order of processes is defined, and the processes that call the same service are collectively executed, so that It is possible to shorten the time from storing the result of the data processing in the result information storage unit 14 until deleting the result. For example, in the third embodiment, the process execution order definition 3 is created so that a service with a low reuse frequency is processed first. During a series of processes, data processing results for services with low reuse frequency are reused at an early stage and then deleted, and data processing for services with high reuse frequency is performed later in the series of processes. Only the result is stored in the result information storage unit 14. Therefore, a series of processes can be executed with a smaller storage capacity.

<Embodiment 4>
FIG. 21 is a block diagram showing an example of the configuration of the data processing device 1 according to the fourth embodiment of the present invention.

  As shown in FIG. 21, the process execution order definition creating unit 15 according to the fourth embodiment creates a process execution order definition 3 with reference to the service call relationship storage unit 12 and the process execution order priority definition 4. It is characterized by that. The process execution order priority definition 4 defines the priority of the process execution order. Other configurations and operations are the same as those in the third embodiment, and thus description thereof is omitted here.

  The process analysis unit 11 creates a service call relationship storage unit 12 based on the analysis result of the process definition 2. The process execution order definition creating unit 15 creates the process execution order definition 3 based on the service call relationship storage unit 12 and the process execution order priority definition 4. The process execution unit 13 executes processes according to the process execution order definition 3.

  FIG. 22 is a diagram illustrating an example of the process execution order priority definition 4.

  As shown in FIG. 22, one process name and priority value are described in one line without duplication.

  In FIG. 22, the priority is set to be executed first as the priority value increases. Therefore, the process execution order definition creating unit 15 creates the process execution order definition 3 so that the process E is executed first.

  FIG. 23 is a flowchart illustrating an example of the operation of the data processing apparatus 1. Note that the processing in steps S601 to S606 in FIG. 23 is the same as the processing in steps S401 to S406 in FIG. Hereinafter, step S607 and subsequent steps will be described.

  In step S <b> 607, the process execution order definition creating unit 15 refers to the process execution order priority definition 4 and corrects the process execution order definition 3. For example, in FIG. 22, since the same priority value is set for each of process B, process C, and process D, the execution order of process B, process C, and process D is defined in step S606. 3 becomes the order at the time of creation.

  In step S608, the process execution unit 13 sequentially executes all processes according to the process execution order definition 3.

  From the above, according to the fourth embodiment, in addition to the effects of the third embodiment, the process execution order definition creating unit 15 defines an efficient process execution order, and then a predetermined process. It is possible to consider the execution order of Therefore, it is possible to reflect the execution order of processes due to business restrictions.

  1, 16, and 21, each of the process analysis unit 11, the process execution unit 13, and the process execution order definition creation unit 15 is realized by executing a program process using a CPU based on software. May be. Further, if possible, each of the process analysis unit 11, the process execution unit 13, and the process execution order definition creation unit 15 is configured to perform a specific operation or process on hardware (for example, an electric signal). An arithmetic / processing circuit or the like may be configured. Further, both of the above may be mixed.

  1, 16, and 21, the service call relationship storage unit 12 and the result information storage unit 14 have a function of storing data using, for example, an HDD (Hard Disk Drive), a DVD (Digital Versatile Disk), a semiconductor memory, or the like. It may be configured.

  It should be noted that the present invention can be freely combined with each other within the scope of the invention, and each embodiment can be appropriately modified or omitted.

  DESCRIPTION OF SYMBOLS 1 Data processing apparatus, 2 Process definition, 3 Process execution order definition, 4 Process execution order priority definition, 11 Process analysis part, 12 Service call relation storage part, 13 Process execution part, 14 Result information storage part, 15 Process execution order Definition creation unit, 101-103 service providing device, 201 process result storage device, 202 external device.

Claims (6)

Analyzing a process definition that defines a combination of a plurality of services and processes a series of data processing, the service configuring the process and the order in which the service is called when the process performs the data processing A process analysis unit for detecting whether there is a service call that can obtain the same data processing result;
A service call relation storage unit for storing the service call detected by the process analysis unit and the process having the service call in association with each other;
A result information storage unit for storing the data processing result by the service call stored in the service call relation storage unit;
A process execution unit that executes the data processing based on the process definition and the data processing result stored in the result information storage unit;
A data processing apparatus.   When the execution of all the processes that perform the service call stored in the service call relationship storage unit is completed, the process execution unit completes the data processing result of the service call that the process that has completed the execution calls The data processing apparatus according to claim 1, wherein the data processing device is deleted from the result information storage unit.   The process execution unit, when the execution of the process stored in the service call relationship storage unit is completed, stores information indicating the completion in the service call relationship storage unit, and is stored in the service call relationship storage unit 3. The method according to claim 2, wherein it is determined whether or not execution of all the processes that perform the service call stored in the service call relation storage unit is completed based on the information indicating completion. The data processing apparatus described. A process execution order definition creating unit for creating a process execution order definition that defines the execution order of the processes;
The process execution order definition creating unit creates the process execution order definition based on the service call and the process stored in the service call relation storage unit,
The data processing apparatus according to claim 1, wherein the process execution unit executes the data processing based on the process execution order definition.   5. The process execution order definition creation unit creates the process execution order definition based on a process execution order priority definition that defines a priority of the execution order of the process. Data processing device. (A) For a process configured by combining a plurality of services and performing a series of data processing, a process definition that defines the service configuring the process and the order in which the service is called when the process performs the data processing And detecting whether there is a service call that provides the same data processing result;
(B) storing the service call detected by the process analysis unit in association with the process having the service call in a service call relationship storage unit;
(C) storing the data processing result by the service call stored in the service call relation storage unit;
(D) executing the data processing based on the process definition and the data processing result stored in the result information storage unit;
A data processing method comprising:

Images