Computer system and method for searching for business flows

Abstract

This computer system holds a first database for managing directed graphs that represent business flows defining a procedure of tasks and that are composed of nodes representing the tasks and directed edges connecting the nodes in accordance with a task order, and a second database for managing correspondence relationships between the nodes and the business flows. The computer system receives a search request including a search business flow represented as a directed graph. The computer system generates node pairs, which are pairs of the nodes constituting the search business flow and in which an order relationship of the nodes in the search business flow is designated. The computer system refers to the second database to identify candidate business flows including all the nodes constituting the search business flow. The computer system refers to the first database to search, from among the candidate business flows, for candidate business flows including all the generated node pairs.

Description

Computer system and business flow search method Incorporation by Reference

[0001] This application claims priority from Japanese Patent Application No. 2024-8653, filed on January 24, 2024, the contents of which are incorporated herein by reference.

[0002] The present invention relates to a search technique in a system that manages data used to analyze work performed according to a work flow.

[0003] In the production of products or materials and in administrative procedures, some tasks are performed according to a workflow that defines the order of tasks. To improve the efficiency of business operations, it is important to optimize the selection of tasks to be performed and the order in which they are performed.

[0004] A workflow can be represented as a directed graph consisting of nodes representing tasks and directed edges connecting the nodes in the order of tasks. In an environment where tasks are executed according to various workflows, useful information can be obtained by analyzing the results of each workflow. Conventionally, users have had to manually select the workflow to analyze. However, when there are a large number of workflows, the cost required to select a workflow increases. To address this issue, the technologies described in Patent Documents 1 and 2 are known.

[0005] Patent Document 1 discloses a technology in which "when searching for a part isomorphic with a query graph, which is the graph of the query used for the search, from a data graph, which is the graph of the data to be searched, among graphs consisting of labeled vertices and edges connecting adjacent vertices, a set of combinations of vertices of the query graph and vertices of the data graph is extracted as a failure pattern representing the cause of the search failure based on search failures that occur during the search process, and the search state that matches the failure pattern is pruned to search for a part isomorphic with the query graph from the data graph."

[0006] Patent Document 2 discloses a technology that "accepts a business flow as a search condition and searches for business flows that match or are similar to the accepted business flow. When searching for a business flow, input of the business flow to be used as the search condition is accepted, and based on the degree of match between the search condition and the combination of each individual task included in the business flow to be searched and the actor that performs that individual task, the similarity of the business flow compared to the business flow used as the search condition is calculated, and search results are presented based on the calculated individual similarities."

[0007] JP 2019-101610 A JP 2012-243268 A

[0008] In an environment where business processes are executed according to various workflows, useful information can be obtained by analyzing the results of each workflow. Because workflows are expressed as directed graphs that take order into account, conventional techniques have the problem of a large search space and time-consuming searches when searching for workflows. Furthermore, even in techniques that limit the search space using similarity, there is the problem of time-consuming calculations of similarity.

[0009] An object of the present invention is to provide a technology for quickly searching for a business flow that matches a condition from among a plurality of business flows.

[0010] A representative example of the invention disclosed in this application is as follows: A computer system including a processor, a storage device connected to the processor, and a network interface connected to the processor, the computer system holding a first database for managing a directed graph representing a workflow defining the procedures of a plurality of tasks and consisting of nodes representing the tasks and directed edges connecting the nodes in accordance with the task order, and a second database for managing the correspondence between the nodes and the workflow, receives a search request including a search workflow expressed as a directed graph consisting of at least two of the nodes, generates first node pairs that are pairs of the nodes that make up the search workflow and specify the order of the nodes in the search workflow, refers to the second database to identify as candidate workflows those workflows that include all of the nodes that make up the search workflow, refers to the first database to search from among the candidate workflows for candidate workflows that include all of the generated first node pairs, and outputs the search results.

[0011] According to the present invention, it is possible to quickly search for a business flow that matches a specified condition. Problems, configurations, and effects other than those described above will become apparent from the following description of the embodiment.

[0012] 1 is a diagram illustrating an example of the configuration of a system according to a first embodiment; FIG. 2 is a diagram illustrating an example of the configuration of a business data collection device according to a first embodiment; FIG. 3 is a diagram illustrating an example of the configuration of a business data management server according to a first embodiment; FIG. 4 is a diagram illustrating an example of the data structure of data stored in a business data DB according to a first embodiment; FIG. 5 is a diagram illustrating an example of the data structure of data stored in a business flow DB according to a first embodiment; FIG. 6 is a diagram illustrating an example of the data structure of data stored in a node / business flow correspondence management DB according to a first embodiment; FIG. 7 is a diagram illustrating an example of the data structure of data stored in an integrated business flow DB according to a first embodiment; FIG. 8 is a diagram illustrating an example of the data structure of data stored in an integrated business flow DB according to a first embodiment; FIG. 9 is a diagram illustrating an example of an integrated business flow generated by a business data management server according to a first embodiment; FIG. 10 is a diagram illustrating an example of an integrated business flow generated by a business data management server according to a first embodiment; FIG. 1 is a diagram showing an example of a screen presented by the business data management server of Example 1. FIG. 2 is a diagram showing an example of a screen presented by the business data management server of Example 1. FIG. 3 is a diagram showing an example of a screen presented by the business data management server of Example 1. FIG. 4 is a diagram showing an example of a screen presented by the business data management server of Example 1. FIG. 5 is a flowchart explaining an example of a business flow search process executed by the business data management server of Example 1. FIG. 6 is a flowchart explaining an example of a business flow search process executed by the business data management server of Example 2. FIG. 7 is a diagram showing an example of a screen presented by the business data management server of Example 3. FIG. 8 is a diagram showing an example of a screen presented by the business data management server of Example 3.

[0013] Hereinafter, embodiments of the present invention will be described with reference to the drawings. However, the present invention should not be construed as being limited to the description of the embodiments shown below. Those skilled in the art will readily understand that the specific configuration can be changed without departing from the spirit or intent of the present invention.

[0014] In the configuration of the invention described below, the same or similar configurations or functions are denoted by the same reference numerals, and redundant explanations will be omitted.

[0015] In this specification, the terms "first," "second," "third," etc. are used to identify components and do not necessarily limit the number or order.

[0016] FIG. 1 is a diagram illustrating an example of a system configuration according to a first embodiment.

[0017] The system is composed of a business data management server 100, a terminal 101, and a plurality of bases 102. The business data management server 100, the terminal 101, and the plurality of bases 102 are connected via a network 103 such as a WAN (Wide Area Network) or a LAN (Local Area Network).

[0018] At the base 102, work is performed according to a work flow. Work may be, for example, application work, manufacturing work, production work, or performance testing work. Note that the present invention is not limited to the content of the work. A work flow represents the procedure for multiple tasks. A work flow can be expressed as a directed graph consisting of nodes representing tasks and directed edges connecting the nodes in the order of the tasks.

[0019] The base 102 includes a plurality of data generation devices 111 and a business data collection device 110. The data generation device 111 is a device that generates business data related to business, such as a sensor, a camera, or a terminal operated by a worker. The business data collection device 110 is a device that collects and manages business data. The business data collection device 110 accumulates business data along with information related to business flows. The information related to business flows is, for example, a business flow identifier, etc.

[0020] The business data management server 100 acquires and stores business data from the business data collection device 110 at each base 102. The business data management server 100 also accepts requests from the terminal 101 and executes various processes.

[0021] The terminal 101 is a terminal for transmitting various requests to the business data management server 100 .

[0022] FIG. 2 is a diagram illustrating an example of the configuration of the business data collection device 110 according to the first embodiment.

[0023] The business data collection device 110 includes a processor 200, a main memory device 201, an auxiliary memory device 202, and a network interface 203. The hardware elements are connected via a bus 204.

[0024] The processor 200 is a device that performs various calculations and executes programs stored in the main memory device 201. The processor 200 executes processing in accordance with the programs, thereby operating as a functional unit (module) that realizes a specific function. In the following description, when a process is described using a functional unit as the subject, this indicates that the processor 200 is executing a program that realizes the functional unit.

[0025] The main memory device 201 is a storage device, such as a volatile or nonvolatile memory, that stores programs executed by the processor 200 and information executed by the programs. The main memory device 201 is also used as a work area. The auxiliary memory device 202 is a large-capacity storage device that permanently stores information, such as a hard disk drive (HDD) or a solid state drive (SSD). The network interface 203 communicates with other devices via a network.

[0026] The programs and information stored in the main memory device 201 may be stored in the auxiliary memory device 202. In this case, the processor 200 reads the programs and information from the auxiliary memory device 202 and loads them into the main memory device 201.

[0027] The main storage device 201 stores a program that realizes the collection unit 210 and a business data DB 220. The collection unit 210 collects business data from the data generation device 111. The business data DB 220 is a database that stores business data.

[0028] FIG. 3 is a diagram illustrating an example of the configuration of the business data management server 100 according to the first embodiment.

[0029] The business data management server 100 includes a processor 300, a main memory device 301, an auxiliary memory device 302, and a network interface 303. The hardware elements are connected via a bus 304.

[0030] The processor 300, main memory device 301, auxiliary memory device 302, network interface 303, and bus 304 are the same hardware elements as the processor 200, main memory device 201, auxiliary memory device 202, network interface 203, and bus 204, so their description will be omitted.

[0031] The main memory device 301 stores a program that realizes the management unit 310. The main memory device 301 also stores a business data DB 320, a business flow DB 321, a node / business flow correspondence management DB 322, and an integrated business flow DB 323.

[0032] The management unit 310 manages business data and business flows, and executes various processes in accordance with user requests.

[0033] The business data DB 320 is a database that stores business data. The business flow DB 321 is a database that stores information related to business flows. The node / business flow correspondence management DB 322 is a database that stores information for managing the correspondence between nodes and business flows. The integrated business flow DB 323 is a database that stores information related to integrated business flows that is used to search for business flows.

[0034] It should be noted that with regard to each functional unit of the business data management server 100, multiple functional units may be combined into one functional unit, or one functional unit may be divided into multiple functional units for each function.

[0035] Although the business data management server 100 is implemented using a physical computer, it may be implemented using virtualization technology. Furthermore, the functions of the business data management server 100 may be implemented using a computer system consisting of multiple computers.

[0036] FIG. 4 is a diagram illustrating an example of the data structure of data stored in the business data DB 320 according to the first embodiment.

[0037] The business data DB 320 stores business data 400. The business data 400 includes a business identifier 401, a data identifier 402, and a plurality of items 403.

[0038] The task identifier 401 is a field that stores a task identifier. The data identifier 402 is a field that stores an identifier for task data. The items 403 are fields that store item values ​​that are measured or acquired during work. The number of items 403 included in the task data 400 can be set arbitrarily.

[0039] If the work is materials research and development, an identifier that identifies the work, such as polymerization or mixing, becomes the work identifier, and values ​​that characterize the work content, such as the work date and time, work time, and temperature, are recorded as items.

[0040] The data stored in the business data DB 220 managed by the business data collection device 110 also has a similar data structure.

[0041] 5A and 5B are diagrams illustrating an example of the data structure of data stored in the business flow DB 321 according to the first embodiment.

[0042] The business flow DB 321 stores business flow metadata 500 and node data 510 .

[0043] The business flow metadata 500 is data for managing an overview of a business flow. The business flow DB 321 stores as many business flow metadata 500 as there are business flows. The business flow metadata 500 includes a business identifier 501, a business flow identifier 502, a creation date and time 503, and a business flow feature 504.

[0044] The business identifier 501 is a field that stores the identifier of a business. The business flow identifier 502 is a field that stores the identifier of a business flow. The creation date and time 503 is a field that stores the date and time when the business flow was created. The business flow characteristics 504 is a field that stores information that characterizes the business flow. For example, this may be the amount of CO2 reduction or power consumption of a factory production line. Note that the business flow metadata 500 does not have to include a business flow characteristic 504, or may include two or more business flow characteristics 504.

[0045] The node data 510 is data for managing nodes corresponding to the tasks that make up a business flow. In the following explanation, a node corresponding to a task will also be referred to as a task node. For one business flow, there is as many node data 510 as there are tasks that make up the business flow. The node data 510 includes a business flow identifier 511, a node identifier 512, a previous node identifier 513, a next node identifier 514, a data identifier 515, and a registration date and time 516.

[0046] The business flow identifier 511 is a field that stores the identifier of the business flow. The node identifier 512 is a field that stores the identifier of the work node. The previous node identifier 513 is a field that stores the identifier of the work node that precedes the work node that corresponds to the node data 510. The next node identifier 514 is a field that stores the identifier of the work node that follows the work node that corresponds to the node data 510. Note that the node identifier for the same work is assumed to be the same in each business flow.

[0047] The data identifier 515 is a field for storing an identifier for specifying the task data 400 corresponding to the task node. The registration date and time 516 is a field for storing the latest registration date and time of the task data 400.

[0048] A user sets the definition information of the business flow (business flow metadata 500 and node data 510 ) using, for example, the terminal 101 and registers it in the business data management server 100 .

[0049] FIG. 6 is a diagram illustrating an example of the data structure of data stored in the node / business flow correspondence management DB 322 according to the first embodiment.

[0050] The node / workflow correspondence management DB 322 stores correspondence data 600. The correspondence data 600 includes a node identifier 601 and a work flow list 602.

[0051] The node identifier 601 is a field that stores the identifier of an operation node. The business flow list 602 is a field that stores the identifier of a business flow that includes an operation node.

[0052] 7A, 7B, and 7C are diagrams illustrating an example of the data structure of data stored in the integrated workflow DB 323 according to the first embodiment.

[0053] The integrated workflow DB 323 stores integrated workflow metadata 700 , node data 710 , and integrated node data 720 .

[0054] The integrated business flow metadata 700 is data for managing an overview of an integrated business flow. The integrated business flow DB 323 stores as many pieces of integrated business flow metadata 700 as there are integrated business flows. The integrated business flow metadata 700 includes a business identifier 701 and an integrated business flow identifier 702.

[0055] The task identifier 701 is a field for storing the identifier of a task. The integrated workflow identifier 702 is a field for storing the identifier of an integrated workflow.

[0056] The node data 710 is data for managing the nodes that make up an integrated workflow. For one integrated workflow, there is as many node data 710 as there are nodes that make up the integrated workflow. Note that an integrated workflow includes operation nodes and integrated nodes that integrate multiple operation nodes. In the following explanation, when there is no need to distinguish between operation nodes and integrated nodes, they will be referred to as nodes.

[0057] The node data 710 includes an integrated workflow identifier 711 , a node identifier 712 , a previous node identifier 713 , and a subsequent node identifier 714 .

[0058] The integrated workflow identifier 711 is a field that stores the identifier of the integrated workflow. The node identifier 712 is a field that stores the identifier of the node. In the case of an operation node, the identifier of the operation node in the workflow is stored as is, and in the case of an integrated node, the identifier assigned to the integrated node is stored.

[0059] The previous node identifier 713 is a field that stores the identifier of the node that precedes the node that corresponds to the node data 710. The subsequent node identifier 714 is a field that stores the identifier of the node that follows the node that corresponds to the node data 710.

[0060] The integrated node data 720 is data for managing the integrated node, and includes an integrated business process identifier 721, a node identifier 722, and an operation node list 723.

[0061] The integrated workflow identifier 721 is a field that stores the identifier of the integrated workflow. The node identifier 722 is a field that stores the identifier of the integrated node. The operation node list 723 is a field that stores the identifiers of the operation nodes that make up the integrated node.

[0062] Next, we will explain the processing executed by the business data management server 100. The business data management server 100 executes processing to analyze the correspondence between nodes and business flows, processing to generate integrated business flows, and processing to search for business flows.

[0063] The business data management server 100 periodically or upon receiving an execution instruction executes an analysis process of the correspondence between nodes and business flows.

[0064] The business data management server 100 references the business flow DB 321 and aggregates the node data 510 having the same node identifier 512 to generate the correspondence data 600. The business data management server 100 stores the generated correspondence data 600 in the node / business flow correspondence management DB 322.

[0065] The business data management server 100 executes the integrated business flow generation process periodically or when an execution instruction is received.

[0066] In the integrated business flow generation process, an integrated node that aggregates multiple work nodes is generated based on the presence or absence of nodes in each business flow, the order of the nodes, etc., and an integrated business flow consisting of the work nodes and the integrated node is generated.

[0067] 8A and 8B are diagrams illustrating an example of an integrated business flow generated by the business data management server 100 according to the first embodiment.

[0068] Workflows 801 and 802 shown in Figure 8A are examples of workflows for materials research and development. Materials research and development is a typical example of workflows being revised and evaluated through trial and error, with new workflows being continually considered based on experimental results. In this example, workflow 801 is composed of three nodes (tasks): compounding, mixing, and reaction, and indicates that each task is performed in this order. Workflow 802 is composed of four nodes: compounding, mixing, feeling, and reaction, and indicates that each task is performed in this order.

[0069] The business data management server 100 generates an integrated business flow 810 by integrating business flows 801 and 802. The integrated business flow 810 is composed of four nodes: blending, mixing, drying, and reaction. Although the business flow 801 does not include a node corresponding to drying, the two business flows 801 and 802 can be managed as the integrated business flow 810 by regarding drying as having been skipped in the integrated business flow 810.

[0070] Workflows 801, 802, and 803 in Figure 8B are an example of a workflow for materials research and development. Workflow 803 has the same node configuration as workflow 802, but the order of drying and mixing is reversed. Workflows 802 and 803 are difficult to simply integrate. Therefore, drying and mixing are aggregated into a single integrated node as a set of steps in no particular order, and the work flows are integrated. The operation nodes included in the integrated node mean that they can be executed in any order in the integrated workflow. The work data management server 100 generates integrated workflow 811 by integrating workflows 801, 802, and 803.

[0071] In this way, by introducing an integrated node that represents a set of operation nodes in no particular order, it is possible to generate an integrated business flow that represents multiple business flows in a unified manner.

[0072] By presenting the integrated workflow to the user, it becomes easier to specify search conditions for workflows. Note that the generation of the integrated workflow does not necessarily have to be executed.

[0073] Next, the business data search process will be described with reference to FIG. 9. FIG. 9 is a sequence diagram illustrating the flow of the search process for the business flow in the system according to the first embodiment.

[0074] The user operates the terminal 101 to access the business data management server 100 (step S101).

[0075] When the business data management server 100 receives the access, it presents a screen (user interface) for receiving the designation of the business (step S102). For example, a screen 1000 as shown in FIG.

[0076] The screen 1000 includes a task list table 1001 and operation buttons 1002. The task list table 1001 displays entries consisting of a "task identifier," "number of task flows," "number of nodes," and "selection." The "number of nodes" in the task list table 1001 stores the total number of work nodes in each task flow. The task list table 1001 can be generated based on the task flow DB 321.

[0077] The user operates "select" for the entry corresponding to the desired business operation, and then operates the operation button 1002. At this time, the terminal 101 transmits a request to display the business flow to the business data management server 100 (step S103).

[0078] When the business data management server 100 receives the display request, it presents a screen (user interface) for displaying the business flow (step S104). For example, a screen 1100 as shown in FIG.

[0079] Screen 1100 includes display fields 1101 and 1102. Display field 1101 is a field that displays the integrated business flow of the selected business. Display field 1101 displays a directed graph representing the integrated business flow and operation buttons 1110. Operation buttons 1110 are operation buttons for setting search conditions for the business flow. Display field 1102 is a field that displays an overview of the business flow and includes a business flow list table 1120. The business flow list table 1120 displays entries consisting of a "business flow identifier," "number of nodes," and "number of data." "Number of data" is a field that stores the number of business data acquired in business performed according to the business flow.

[0080] After checking the business flow information displayed on the screen 1100, the user operates the operation button 1110. At this time, the terminal 101 transmits a setting request to the business data management server 100 (step S105).

[0081] When the business data management server 100 receives the setting request, it presents a screen (user interface) for setting search conditions (step S106). For example, a screen 1200 as shown in FIG.

[0082] The screen 1200 includes a node selection table 1201 , an order setting table 1202 , and operation buttons 1203 .

[0083] The node selection table 1201 is a table for selecting an operation node. The operation nodes that make up the integrated business flow are displayed in the node selection table 1201. The user operates the add button to select the operation node to be used in the search. In Figure 12, operations 3, 4, and 5 have been selected.

[0084] The order setting table 1202 is a table for setting the order of the work nodes selected in the node selection table 1201 .

[0085] The user sets a search workflow as a search condition using the node selection table 1201 and the order setting table 1202 on the screen 1200, and then operates the operation button 1203. At this time, the terminal 101 sends a search request to the business data management server 100 (step S107). The search request includes the search workflow as a search condition.

[0086] When the business data management server 100 receives the search request, it executes a business flow search process (step S108). The business flow search process will be described in detail later.

[0087] The business data management server 100 presents a screen (user interface) for displaying the results of the business flow search process (search results) (step S109). For example, a screen 1300 as shown in FIG.

[0088] The screen 1300 includes a display field 1301 and a display field 1302. The display field 1301 is a field for displaying a search workflow, which is a search condition. The display field 1302 is a field for displaying search results. The display field 1302 includes a workflow list 1310 and operation buttons 1311.

[0089] The business flow list 1310 is a list of business flows found based on the search criteria. The business flow list 1310 displays entries consisting of "business flow identifier," "selection," and "details." "Selection" is a field for selecting a business flow for which business data will be output. "Details" displays a display button for displaying a screen for selecting an operation (operation node) for which business data will be output. When the display button is operated, a screen for displaying a directed graph representing the business flow is displayed. For example, a screen 1400 such as that shown in FIG. 14 is displayed.

[0090] The user selects an operation for acquiring business data from the operations of the business flow displayed on the screen 1400, and operates the operation button 1401. In Fig. 14, operations 3 and 5 are selected.

[0091] The task for which business data is to be acquired may be selected using a search workflow. In this case, the business data of the task selected in the search workflow of the specified workflow is acquired.

[0092] Returning to the explanation of Fig. 13, the operation button 1311 is a button for outputting business data. When the operation button 1311 is operated, the terminal 101 sends an output request to the business data management server 100 (step S110). The output request includes one or more combinations of business flows and node groups.

[0093] When the business data management server 100 receives the output request, it acquires the business data from the business data DB 320 and transmits the acquired data to the terminal 101 (step S111). At this time, a screen 1500 such as that shown in FIG. 15 may be presented.

[0094] Screen 1500 displays business data corresponding to the selected business flow and operation node group. The user checks the business data displayed on screen 1500 and operates operation buttons 1501 to save the business data in a predetermined data format. Note that instead of displaying screen 1500, the business data management server 100 may transmit the business data in any data format, such as CSV.

[0095] FIG. 16 is a flowchart illustrating an example of a business flow search process executed by the business data management server 100 according to the first embodiment.

[0096] The business data management server 100 generates node pairs of the search business flow and creates a set (U Ｒ ) is generated (step S201). Specifically, the following process is executed.

[0097] (S201-1) The business data management server 100 selects one task node from the directed graph representing the search task flow. Here, it is assumed that the task node is selected in the order of tasks. The selected task node is referred to as the starting node.

[0098] (S201-2) The business data management server 100 identifies work nodes that can be reached by tracing the directed graph in the work order direction starting from the starting node, generates a pair of the starting node and the identified work node as a node pair, and creates a set (U Ｒ ) element in the work area. The business data management server 100 generates the node pair in a data format that indicates that the execution order of the identified task node is later than the execution order of the starting node.

[0099] (S201-3) The business data management server 100 determines whether or not processing has been completed for all the operation nodes that make up the search business flow.

[0100] If processing has not been completed for all the operation nodes that make up the search workflow, the business data management server 100 returns to S201-1. If processing has been completed for all the operation nodes that make up the search workflow, the business data management server 100 ends the processing of step S201.

[0101] In the case of the search workflow shown in FIG. 13, three node pairs are generated: (task 3, task 4), (task 3, task 5), and (task 4, task 5).

[0102] Next, the business data management server 100 identifies candidate business flows based on the search conditions (step S201).

[0103] Specifically, the business data management server 100 refers to the node / business flow correspondence management DB 322 and identifies a business flow that includes all of the operation nodes that make up the search business flow.

[0104] Next, the business data management server 100 starts a loop process of the candidate business flows (step S203), where the business data management server 100 selects one candidate business flow.

[0105] Next, the business data management server 100 uses the business flow DB 321 to generate node pairs of the candidate business flows and generate a set (U) whose elements are the node pairs (step S204). The node pair generation method is the same as the method described in step S201.

[0106] Next, the business data management server 100 Ｒ It is determined whether or not the set (U) is a subset of the set (U) (step S205).

[0107] Set (U Ｒ If (U) is not a subset of the set (U), the business data management server 100 proceeds to step S207.

[0108] Set (U Ｒ If the set (U) is a subset of the set (U), the business data management server 100 registers the candidate business flow in a list (step S206), and then proceeds to step S207.

[0109] In step S207, the business data management server 100 determines whether or not processing has been completed for all candidate business flows (step S207).

[0110] If processing has not been completed for all candidate workflows, the business data management server 100 returns to step S203. If processing has been completed for all candidate workflows, the business data management server 100 ends the business flow search process. The business data management server 100 transmits the list as the search results.

[0111] In the first embodiment, by using the correspondence between task nodes and workflows, it is possible to quickly narrow down candidate workflows. Also, by comparing sets whose elements are node pairs of workflows, it is possible to quickly identify workflows that contain task nodes in a specified order. This allows for faster workflow searches than searches based on graph comparison.

[0112] In the second embodiment, the process content of the business flow search process is different. The second embodiment will be described below, focusing on the differences from the first embodiment.

[0113] The system configuration of the second embodiment is the same as that of the first embodiment. The hardware configuration and software configuration of the business data collection device 110 and the business data management server 100 of the second embodiment are the same as those of the first embodiment. In addition, the data structure of the data stored in the databases managed by the business data collection device 110 and the business data management server 100 of the second embodiment is the same as that of the first embodiment.

[0114] FIG. 17 is a flowchart illustrating an example of a business flow search process executed by the business data management server 100 according to the second embodiment.

[0115] The business data management server 100 generates a node pair of a search business flow (step S301). Specifically, the following process is executed.

[0116] (S301-1) The business data management server 100 selects one task node from the directed graph representing the search task flow. Here, it is assumed that the task node is selected in the order of tasks. The selected task node is referred to as the starting node.

[0117] (S301-2) The business data management server 100 identifies work nodes that can be reached by tracing the directed graph in the work order direction starting from the starting node, and generates a node pair consisting of the starting node and the identified work node. The business data management server 100 generates the node pair so that the starting node can be identified. The business data management server 100 stores the node pair in a work area.

[0118] (S301-3) The business data management server 100 determines whether or not processing has been completed for all operation nodes that make up the search business flow.

[0119] If processing has not been completed for all the operation nodes that make up the search workflow, the business data management server 100 returns to S301-1. If processing has been completed for all the operation nodes that make up the search workflow, the business data management server 100 ends the processing of step S301.

[0120] Next, the business data management server 100 identifies candidate business flows based on the search conditions (step S302). The process of step S302 is the same as the process of step S202.

[0121] Next, the business data management server 100 starts loop processing of the candidate business flows (step S303). The processing in step S303 is the same as the processing in step S203.

[0122] Next, the business data management server 100 starts loop processing of the node pairs of the search business flow (step S304).

[0123] Next, the business data management server 100 determines whether the candidate business flow includes the selected node pair (step S305).

[0124] Specifically, the following process is executed: The business data management server 100 traces the directed graph (candidate business flow) in the work order direction, starting from the starting node of the node pair, and determines whether it is possible to reach the task nodes that make up the node pair. If it is possible to reach the task nodes that make up the node pair, the business data management server 100 determines that the candidate business flow includes the selected node pair.

[0125] If the candidate workflow does not include the selected node pair, the business data management server 100 ends the loop processing of the node pair and proceeds to step S308.

[0126] If the candidate workflow includes the selected node pair, the business data management server 100 determines whether processing has been completed for all node pairs (step S306).

[0127] If the processing has not been completed for all node pairs, the business data management server 100 returns to step S304.

[0128] When the processing has been completed for all node pairs, the business data management server 100 registers the candidate business flows in a list (step S307), and then proceeds to step S308.

[0129] In step S308, the business data management server 100 determines whether or not processing has been completed for all candidate business flows (step S308).

[0130] If processing has not been completed for all candidate workflows, the business data management server 100 returns to step S303. If processing has been completed for all candidate workflows, the business data management server 100 ends the workflow search process.

[0131] In the second embodiment, since it is not necessary to generate node pairs for candidate workflows, it is expected that the processing costs required for searching will be reduced more than in the first embodiment.

[0132] The third embodiment differs from the first embodiment in that business-specific information is included in the search conditions. The third embodiment will be described below, focusing on the differences from the first embodiment.

[0133] The system configuration of the third embodiment is the same as that of the first embodiment. The hardware configuration and software configuration of the business data collection device 110 and the business data management server 100 of the third embodiment are the same as those of the first embodiment. In addition, the data structure of the data stored in the databases managed by the business data collection device 110 and the business data management server 100 of the third embodiment is the same as that of the first embodiment.

[0134] In the third embodiment, the method of setting search conditions is different from that in the first embodiment. Fig. 18 is a diagram showing an example of a screen presented by the business data management server 100 in the third embodiment.

[0135] The screen 1200 newly includes an additional condition setting table 1210 and an operation button 1211. The additional condition setting table 1210 is a table for setting additional conditions for searching for business flows, in addition to the conditions related to the operation nodes. The operation button 1211 is an operation button for adding business conditions. In FIG. 18, ２ Emissions conditions are specified as additional conditions.

[0136] In the third embodiment, the process of searching for a workflow is partially different from that in the first embodiment. Specifically, the process of identifying a candidate workflow (step S201) is different from that in the first embodiment.

[0137] First, the business data management server 100 refers to the node / business flow correspondence management DB 322 and identifies a business flow that includes all of the operation nodes that make up the search business flow.

[0138] Next, the business data management server 100 refers to the business flow DB 321 and the business flow metadata 500 of the identified business flow to identify a business flow that satisfies the additional condition.

[0139] In the third embodiment, the content of the screen displaying the results of the business flow search process is partially different. Fig. 19 is a diagram showing an example of a screen presented by the business data management server 100 of the third embodiment. In addition to the business flow to be searched, additional conditions are displayed in a display field 1301. Furthermore, the business flow list 1310 includes items specified as additional conditions.

[0140] The present invention is not limited to the above-described embodiments, but includes various modifications. For example, the above-described embodiments are provided to explain the present invention in detail, and the present invention is not necessarily limited to those including all of the described configurations. Furthermore, some of the configurations of each embodiment can be added to, deleted from, or replaced with other configurations.

[0141] Furthermore, some or all of the above-described configurations, functions, processing units, processing means, etc. may be implemented in hardware, for example, by designing them as integrated circuits. The present invention can also be realized by software program code that implements the functions of the embodiments. In this case, a storage medium on which the program code is recorded is provided to a computer, and a processor included in the computer reads the program code stored in the storage medium. In this case, the program code itself read from the storage medium implements the functions of the above-described embodiments, and the program code itself and the storage medium on which it is stored constitute the present invention. Examples of storage media for providing such program code include flexible disks, CD-ROMs, DVD-ROMs, hard disks, solid-state drives (SSDs), optical disks, magneto-optical disks, CD-Rs, magnetic tape, non-volatile memory cards, and ROMs.

[0142] Furthermore, the program code that realizes the functions described in this embodiment can be implemented in a wide range of programming or scripting languages, such as assembler, C / C++, perl, Shell, PHP, Python, and Java.

[0143] Furthermore, the program code of the software that realizes the functions of the embodiments may be distributed via a network and stored in a storage means such as a computer's hard disk or memory, or in a storage medium such as a CD-RW or CD-R, and the processor of the computer may read and execute the program code stored in the storage means or the storage medium.

[0144] In the above-described embodiment, the control lines and information lines are those that are considered necessary for the explanation, and not all control lines and information lines are necessarily shown in the product. All components may be interconnected.

Claims

1. A computer system comprising a processor, a storage device connected to the processor, and a network interface connected to the processor, holding a first database for managing a directed graph composed of nodes representing operations and directed edges connecting between the nodes according to the operation order, representing a business process defining a plurality of operation procedures, and a second database for managing the correspondence between the nodes and the business process, receiving a search request including a search business process represented as a directed graph composed of at least two of the nodes, generating a first node pair which is a pair of the nodes constituting the search business process and in which the order relationship of the nodes in the search business process is specified, identifying, with reference to the second database, a business process including all of the nodes constituting the search business process as a candidate business process, searching, with reference to the first database, for the candidate business process including all of the generated first node pairs from among the candidate business processes, and outputting the result as a search result.

2. The computer system according to claim 1, holding a third database for managing business data obtained in operations performed based on the business process for each business process, and presenting an interface for obtaining business data related to the candidate business process included in the search result from the third database.

3. The computer system according to claim 1, generating a second node pair which is a pair of the nodes constituting the candidate business process and in which the order relationship of the nodes in the candidate business process is specified, comparing the set of the first node pairs and the set of the second node pairs, and identifying the candidate business process in which the set of the first node pairs is a subset of the set of the second node pairs.

4. A computer system according to claim 1, wherein for each of the first node pairs, the candidate service flow is identified by following the candidate service flow according to the order of the operations starting from the previous node in the order of the first node pair, so that the later node in the order of the first node pair can be reached.

5. A method for searching a service flow that defines procedures for a plurality of operations executed by a computer system, wherein the computer system includes a processor, a storage device connected to the processor, and a network interface connected to the processor, and holds a first database for managing a directed graph composed of nodes representing the service flow and directed edges connecting between the nodes according to the order of operations, and a second database for managing the correspondence between the nodes and the service flow. The method for searching the service flow includes: a first step in which the computer system receives a search request including a search service flow represented as a directed graph composed of at least two of the nodes; a second step in which the computer system generates a first node pair that is a pair of the nodes constituting the search service flow and in which the order relationship of the nodes in the search service flow is specified; a third step in which the computer system refers to the second database and identifies, as candidate service flows, the service flows that include all of the nodes constituting the search service flow; and a fourth step in which the computer system refers to the first database, searches for the candidate service flows that include all of the generated first node pairs from among the candidate service flows, and outputs the search results.

6. The method for searching a business process according to claim 5, wherein the computer system holds a third database for managing business data obtained in the business performed based on the business process for each business process, and the method for searching the business process includes a step of presenting, by the computer system, an interface for obtaining, from the third database, business data related to the candidate business processes included in the search result.

7. The method for searching a business process according to claim 5, wherein the third step includes: a step of generating, by the computer system, a second node pair which is a pair of the nodes constituting the candidate business process and in which the order relationship of the nodes in the candidate business process is specified; and a step of comparing, by the computer system, the set of the first node pairs and the set of the second node pairs, and specifying the candidate business process in which the set of the first node pairs is a subset of the set of the second node pairs.

8. The method for searching a business process according to claim 5, wherein the third step includes a step of specifying, for each of the first node pairs, by the computer system, the candidate business process in which the node with the later order of the first node pair can be reached by tracing the candidate business process according to the order of the operations starting from the node with the earlier order of the first node pair.

Images