CN112288249A - Business process execution method and device, computer equipment and medium - Google Patents
Business process execution method and device, computer equipment and medium Download PDFInfo
- Publication number
- CN112288249A CN112288249A CN202011127112.5A CN202011127112A CN112288249A CN 112288249 A CN112288249 A CN 112288249A CN 202011127112 A CN202011127112 A CN 202011127112A CN 112288249 A CN112288249 A CN 112288249A
- Authority
- CN
- China
- Prior art keywords
- nodes
- node
- output
- dependent
- business process
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 160
- 230000008569 process Effects 0.000 title claims abstract description 112
- 230000001419 dependent effect Effects 0.000 claims abstract description 80
- 238000011835 investigation Methods 0.000 claims description 29
- 238000012954 risk control Methods 0.000 claims description 12
- 230000008859 change Effects 0.000 claims description 10
- 238000013210 evaluation model Methods 0.000 claims description 8
- 238000012545 processing Methods 0.000 claims description 5
- 238000011156 evaluation Methods 0.000 claims description 4
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 238000012423 maintenance Methods 0.000 abstract description 7
- 238000010586 diagram Methods 0.000 description 10
- 238000004364 calculation method Methods 0.000 description 9
- 230000006870 function Effects 0.000 description 6
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0635—Risk analysis of enterprise or organisation activities
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0633—Workflow analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/06—Asset management; Financial planning or analysis
Abstract
The invention provides a business process execution method, a business process execution device, computer equipment and a medium. The method comprises the following steps: acquiring the output nodes of the business process, and obtaining a plurality of dependent nodes of the output nodes by recursion of the dependency relationship of the output nodes; establishing a directed acyclic graph between an output node and a plurality of dependent nodes; carrying out topological sorting on the directed acyclic graph, and determining the execution priority of a plurality of dependent nodes and output nodes according to a topological sorting result; and executing the plurality of dependent nodes and the output nodes in sequence according to the execution priority to obtain the output data of the business process. The embodiment of the invention improves the execution efficiency of the business process of the switching business and reduces the maintenance labor cost of the business process.
Description
Technical Field
The present invention relates to the field of computer software technologies, and in particular, to a method and an apparatus for executing a business process, a computer device, and a medium.
Background
Generally, different business processes need to implement the processing of the business process in a manner or scheme matched with the business process. Therefore, for different business process schemes, developers generally write the computation process of the business process in the code according to the computation sequence required by the business. Therefore, the personalization of the business process is too strong (generally, the business process is only suitable for one or one class of business), and the universality is poor. Therefore, when the business is switched every time, developers need to rewrite the calculation flow codes of the business flow according to the calculation sequence of the business needs, which reduces the execution efficiency of the business flow of the switched business and increases the maintenance labor cost of the business flow.
Disclosure of Invention
In view of this, the present invention is directed to improve the execution efficiency of the service flow of the switching service and reduce the labor cost for maintaining the service flow.
According to a first aspect of the embodiments of the present invention, a method for executing a business process is provided, including:
acquiring an output node of a business process, and recursing the dependency relationship of the output node to obtain a plurality of dependency nodes of the output node;
establishing a directed acyclic graph between the output node and a plurality of dependent nodes;
carrying out topological sorting on the directed acyclic graph, and determining the execution priority of the plurality of dependent nodes and the output nodes according to the topological sorting result;
and executing the plurality of dependent nodes and the output nodes in sequence according to the execution priority to obtain the output data of the business process.
Optionally, the business process includes: a financial risk control process;
the financial risk control process comprises the following steps:
collecting credit investigation information of a user to be assessed for financial risk;
extracting credit investigation characteristics from the credit investigation information;
and inputting the credit investigation characteristics into a credit investigation risk evaluation model, and obtaining a credit investigation risk evaluation value of the user by the credit investigation risk evaluation model.
Optionally, the obtaining an output node of a business process, and recursively obtaining a plurality of dependent nodes of the output node include:
and recursing the dependency relationship of the output node, and selecting the plurality of dependency nodes from a memory, wherein the output node and the plurality of dependency nodes and the dependency relationship between the output node and the plurality of dependency nodes are stored in the memory.
Optionally, the establishing a directed acyclic graph between the output node and a plurality of dependent nodes includes:
performing the following loop flow for the output node and a plurality of dependent nodes of the output node:
judging whether a current node exists in the memory, if not, throwing an exception, and if so, adding the current node and a node depending on the current node into the directed acyclic graph;
and judging whether the current node has a dependent node, if not, building the directed acyclic graph, and if so, judging whether the memory has the dependent node of the current node.
Optionally, the performing topology ranking on the directed acyclic graph, and determining the execution priorities of the plurality of dependent nodes and the output nodes according to the topology ranking result includes:
judging whether the directed acyclic graph has nodes, if not, obtaining the topology sequencing result, if so, judging whether the directed acyclic graph has independent nodes,
if not, throwing the exception, if so, taking all the independent nodes as ith priority nodes, deleting the independent nodes and the dependency relationship of the independent nodes from the directed acyclic graph, and judging whether the directed acyclic graph has nodes or not, wherein i is an integer larger than 0.
Optionally, before obtaining the output node of the business process, the method further includes: and adding the newly added data nodes and the dependency relationship into the memory and/or deleting the specified data nodes and the dependency relationship from the memory based on the service change requirement of the service process.
Optionally, adding the new data node and the dependency relationship to the memory includes:
determining the newly added data node and a dependent node of the newly added data node according to the service change requirement of the service process;
judging whether a node which is not accessed into the memory exists in the dependent node of the newly added data node, if so, accessing the dependent node of the newly added data node into the memory, judging whether a node which is not accessed into the updated memory exists in the dependent node of the newly added data node,
if not, naming the newly added data node, configuring a dependency relationship and input parameter information, acquiring data and input parameter information in the dependency relationship, and setting corresponding processing logic for the newly added data node.
According to a second aspect of the embodiments of the present invention, there is provided a business process execution apparatus, including:
the directed acyclic graph establishing unit is configured to execute output node acquisition of a business process, recurse the dependency relationship of the output nodes to obtain a plurality of dependency nodes of the output nodes, and establish a directed acyclic graph between the output nodes and the plurality of dependency nodes according to the output nodes, the plurality of dependency nodes and the dependency relationship between the output nodes and the plurality of dependency nodes;
an execution priority determining unit configured to perform topology sorting of the directed acyclic graph, and determine execution priorities of the plurality of dependent nodes and output nodes according to a topology sorting result;
and the execution unit is configured to execute the plurality of dependent nodes and the output nodes in sequence according to the execution priority to obtain the output data of the business process.
According to a third aspect of embodiments of the present invention, there is provided a computer apparatus comprising:
a memory for storing computer executable code;
a processor for executing the computer executable code to implement the method of any one of the above.
According to a fourth aspect of embodiments of the present invention, there is provided a computer-readable medium comprising computer-executable code which, when executed by a processor, implements the method of any one of the above.
According to the business process execution method, the output nodes of the business process are obtained, the dependency relationship of the output nodes recurses to obtain the multiple dependency nodes of the output nodes, the directed acyclic graph between the output nodes and the multiple dependency nodes is established, the directed acyclic graph is subjected to topological sorting, the execution priorities of the multiple dependency nodes and the output nodes are determined according to the topological sorting result, the multiple dependency nodes and the output nodes are sequentially executed according to the execution priorities, output data of the business process are obtained, the whole business process can be executed only by obtaining the output nodes, manual maintenance is not needed, and the automation degree of the business process execution is improved. In addition, when the business is switched, based on the business change requirement of the business process, the newly added data nodes and the dependency relationship are added into the memory, and/or the appointed data nodes and the dependency relationship are deleted from the memory, the whole business process can be executed only by obtaining the output nodes, and developers do not need to rewrite the calculation process codes of the business process, so that the business process execution efficiency of the switching business is improved, and the maintenance labor cost of the business process is reduced.
Drawings
The above and other objects, features and advantages of the present invention will become more apparent by describing embodiments of the present invention with reference to the following drawings, in which:
FIG. 1 illustrates an overall flow diagram of a business process execution method in accordance with one embodiment of the present invention;
FIG. 2 illustrates a directed acyclic graph of a financial risk control flow according to one embodiment of the present invention;
FIG. 3 shows a detailed flow diagram of a business process execution method according to one embodiment of the invention;
FIG. 4 shows a detailed flow diagram of a business process execution method according to one embodiment of the invention;
FIG. 5 illustrates dependencies of a business process execution method according to one embodiment of the invention;
FIG. 6 illustrates a directed acyclic graph of a business process execution method according to one embodiment of the present invention;
FIG. 7 is a detailed flow diagram of a business process execution method according to one embodiment of the invention;
FIG. 8 illustrates a topological sequence of a business process execution method in accordance with one embodiment of the present invention;
FIG. 9 is a block diagram of a business process execution apparatus according to an embodiment of the present invention;
fig. 10 is a schematic structural diagram of a business process execution control apparatus according to an embodiment of the present invention.
Detailed Description
The present invention will be described below based on examples, but the present invention is not limited to only these examples. In the following detailed description of the present invention, certain specific details are set forth. It will be apparent to one skilled in the art that the present invention may be practiced without these specific details. Well-known methods, procedures, and procedures have not been described in detail so as not to obscure the present invention. The figures are not necessarily drawn to scale.
Taking financial services as an example, in the field of financial risk, common credit investigation analysis methods and models are relatively fixed, but different financial services often require different steps and flows, so that a common developer performs hard coding on a calculation flow of a financial service flow in a code according to a calculation sequence of different financial services, so that the financial service flow is generally only suitable for calculation of the related service flow and is not suitable for other financial services, and the universality is poor. In the later-stage service development process, when the services are switched, developers need to rewrite calculation flow codes of the service flows according to the calculation sequence required by the financial services, so that the service flow execution efficiency when the services are switched is reduced, and the maintenance labor cost of the service flows is increased.
Therefore, in the financial risk field, even in other business fields, in order to solve the above technical problems, the present invention provides a business process execution method, an apparatus, a computer device and a medium, and the business process execution method, the apparatus, the computer device and the medium according to the embodiments of the present invention are described in detail below with reference to the accompanying drawings.
Fig. 1 shows an overall flowchart of a business process execution method according to one embodiment of the present invention. A system architecture for performing a business process generally includes a plurality of subsystems, which may also be referred to as nodes, and specifically may be a computer or a computer cluster for performing a certain function. Data dependency relationships exist among a plurality of nodes executing the business process, and the data dependency relationships among the plurality of nodes are stored in the memory. It should be noted that the memory may be any storage medium, such as a node database.
As shown in fig. 1, the overall process of the business process execution method according to the embodiment of the present invention includes the following steps:
in step S110: and acquiring an output node of the business process, and recursing the dependency relationship of the output node to obtain a plurality of dependency nodes of the output node.
In this step, an output node of the business process is obtained, where the output node is a root node of the business process. The memory stores an output node and a plurality of dependent nodes, and a dependency relationship between the output node and the plurality of dependent nodes. The dependency relationship of the recursive output nodes selects a plurality of dependent nodes of the output node from the memory. Taking the financial risk control process as an example, the financial risk control process specifically includes: the first step is as follows: collecting credit investigation information of a user to be assessed for financial risk; the second step is as follows: extracting credit investigation characteristics from the credit investigation information; the third step: inputting the credit investigation characteristics into a credit investigation risk evaluation model, and obtaining a credit investigation risk evaluation value of the user by the credit investigation risk evaluation model. FIG. 2 illustrates a directed acyclic graph of a financial risk control flow, according to one embodiment of the invention. As shown in fig. 2, the system architecture for executing the financial risk control process includes: a first node 210 performing a first step, a second node 220 performing a second step, and a third node 230 performing a third step. The third node 230 is an output node, the first node 210 and the second node 220 are dependent nodes of the third node 230, and the first node 210 is a dependent node of the second node 220. It is easily understood that any one of the first node 210, the second node 220 and the third node 230 may include a plurality of sub-nodes that perform a certain sub-function, and a dependency relationship exists between the plurality of sub-nodes. When the third node 230 of the financial risk control process is acquired, the dependency relationship of the third node 230 is recursed to obtain the dependency node of the third node 230: a first node 210 and a second node 220.
In some embodiments, before obtaining the output node of the business process, based on the business change requirement of the business process, adding the newly added data node and dependency relationship to the memory, and/or deleting the specified data node and dependency relationship from the memory. Fig. 3 shows a specific flowchart of a method for executing a business process according to an embodiment of the present invention, specifically showing a process of adding a newly added data node and a dependency relationship to a memory, and the specific steps include:
in step S310, a newly added data node and a dependent node of the newly added data node are determined according to a service change requirement of the service process.
In step S320, it is determined whether there is a node that has not accessed the memory among the dependent nodes of the newly added data node, and if so, step S330 is performed. If not, step S340 is performed.
In step S330, the dependent node of the newly added data node is accessed to the memory, and step S310 is executed.
In step S340, naming, configuring the dependency relationship and inputting parameter information for the newly added data node.
In step S350, data in the dependency relationship and input parameter information are acquired. Because the data in all the dependency relationships are developed based on the same framework, the data in the dependency relationships only need to be directly acquired through a tool method.
In step S360, corresponding processing logic is set for the newly added data node, so as to set corresponding functions for the newly added data node.
In step S120: establishing a directed acyclic graph between the output node and the plurality of dependent nodes.
In this step, a directed acyclic graph is generated based on the dependency relationships between the output nodes and the plurality of dependent nodes. Fig. 4 shows a specific flowchart of a business process execution method according to an embodiment of the present invention, specifically showing a process of establishing a directed acyclic graph between an output node and a plurality of dependent nodes. As shown in fig. 4, the current node in the service flow execution method is one of the plurality of dependent nodes and the output node, and specifically includes the following steps:
in step S410, it is determined whether a current node exists in the memory, and if not, step S420 is performed. If so, step S430 is performed.
In step S420, a "node not present" exception is thrown.
In step S430, the current node and the nodes dependent on the current node are added to the directed acyclic graph.
In step S440, it is determined whether there is a dependent node in the current node, and if not, step S450 is performed. If yes, the dependent node of the current node is taken as the updated current node, and step S410 is executed.
In step S450, the construction of the directed acyclic graph is completed.
FIG. 5 illustrates dependencies of a business process execution method according to one embodiment of the invention. As shown in FIG. 5, node _01 depends on its dependent node: node _02 and node _ 03; node _02 depends on its dependent node: node _04, node _05, and node _ 08; dependent node on which node _03 depends: node _05, node _06, and node _ 09; node _04 depends on its dependent node: node _ 07; node _05 depends on its dependent node: node _ 08; node _06 depends on its dependent node: node _09 and node _ 10; node _07 has no dependent nodes; node _08 has no dependent node; node _09 has no dependent nodes; node _10 has no dependent nodes. Fig. 6 shows a directed acyclic graph of a business process execution method according to an embodiment of the present invention, and specifically shows a directed acyclic graph generated based on the dependency relationship shown in fig. 5. As shown in fig. 6, the node _01 is an output node, and the nodes _02 to _10 are dependent nodes of the node _ 01.
In step S130: and carrying out topological sorting on the directed acyclic graph, and determining the execution priority of the plurality of dependent nodes and the output nodes according to the topological sorting result.
In the step, the directed acyclic graph is subjected to topological sorting, leaf nodes in a plurality of dependent nodes are determined as first priority nodes, nodes which only depend on the leaf nodes in parent nodes of the leaf nodes are determined as second priority nodes, and so on, and nodes which only depend on nodes with priorities less than or equal to the Nth priority nodes in parent nodes of the Nth priority nodes are determined as N +1 priority nodes, wherein N is an integer greater than 1. Fig. 7 is a specific flowchart of a service flow execution method according to an embodiment of the present invention, specifically, a flow for performing topology sorting on a directed acyclic graph and determining execution priorities of a plurality of dependent nodes and output nodes according to a topology sorting result includes the following steps:
in step S710, it is determined whether or not a node exists in the directed acyclic graph, and if not, step S720 is performed. If so, step S730 is performed.
In step S720, a topology ranking result is obtained, and an execution priority sequence of the plurality of dependent nodes and the output node is determined according to the topology ranking result.
In step S730, it is determined whether there is an independent node in the directed acyclic graph, and if not, step S740 is performed. If so, step S750 is performed.
In step S740, a "loop dependency" exception is thrown, indicating that there is an error in the directed acyclic graph, where there is a closed loop.
In step S750, all independent nodes are taken as ith priority nodes, where i is an integer greater than 0.
In step S760, the dependency relationship between the independent node and the independent node is deleted from the directed acyclic graph, and step S710 is executed.
Each cycle of the flow shown in fig. 7, i is updated to i + 1.
In some embodiments, prior to performing step S710, an execution priority sequence of the plurality of dependent nodes and the output node is initialized.
Fig. 8 shows a topological sequence of a service flow execution method according to an embodiment of the present invention, and in particular shows an execution priority sequence of each node in the directed acyclic graph shown in fig. 6. As shown in fig. 8, node _07, node _08, node _09, and node _10 are first priority nodes 810; node _04, node _05, and node _6 are second priority nodes 820; node _02 and node _03 are third-priority nodes 830; node _01 is an output node, i.e., a fourth priority node 840.
In step S140: and executing the plurality of dependent nodes and the output nodes in sequence according to the execution priority to obtain the output data of the business process. As shown in fig. 8, the internal logic of each node is sequentially executed according to the execution sequence of the first priority node 810, the second priority node 820, the third priority node 830 and the output node 840, so as to obtain the output data of the service flow.
According to the business process execution method, the output nodes of the business process are obtained, the dependency relationship of the output nodes recurses to obtain the multiple dependency nodes of the output nodes, the directed acyclic graph between the output nodes and the multiple dependency nodes is established, the directed acyclic graph is subjected to topological sorting, the execution priorities of the multiple dependency nodes and the output nodes are determined according to the topological sorting result, the multiple dependency nodes and the output nodes are sequentially executed according to the execution priorities, output data of the business process are obtained, the whole business process can be executed only by obtaining the output nodes, manual maintenance is not needed, and the automation degree of the business process execution is improved. In addition, when the business is switched, based on the business change requirement of the business process, the newly added data nodes and the dependency relationship are added into the memory, and/or the appointed data nodes and the dependency relationship are deleted from the memory, the whole business process can be executed only by obtaining the output nodes, and developers do not need to rewrite the calculation process codes of the business process, so that the business process execution efficiency of the switching business is improved, and the maintenance labor cost of the business process is reduced.
Fig. 9 is a schematic structural diagram of a business process execution apparatus according to an embodiment of the present invention. As shown in fig. 9, the service flow execution apparatus according to the embodiment of the present invention includes: a directed acyclic graph establishing unit 910, an execution priority determining unit 920, and an executing unit 930.
A directed acyclic graph establishing unit 910, configured to execute obtaining an output node of a business process, and recurse a dependency relationship of the output node to obtain a plurality of dependency nodes of the output node; establishing a directed acyclic graph between the output node and a plurality of dependent nodes according to the output node, the plurality of dependent nodes and the dependency relationship between the output node and the plurality of dependent nodes;
an execution priority determining unit 920, configured to perform topology sorting on the directed acyclic graph, and determine the execution priorities of the plurality of dependent nodes and output nodes according to the topology sorting result.
The execution unit 930 is configured to execute the plurality of dependent nodes and the output nodes in sequence according to the execution priority, so as to obtain the output data of the business process.
Optionally, the business process includes: a financial risk control process; the financial risk control process comprises the following steps: collecting credit investigation information of a user to be assessed for financial risk; extracting credit investigation characteristics from the credit investigation information; and inputting the credit investigation characteristics into a credit investigation risk evaluation model, and obtaining a credit investigation risk evaluation value of the user by the credit investigation risk evaluation model.
Optionally, the obtaining an output node of a business process, and recursively obtaining a plurality of dependent nodes of the output node include: and recursing the dependency relationship of the output node, and selecting the plurality of dependency nodes from a memory, wherein the output node and the plurality of dependency nodes and the dependency relationship between the output node and the plurality of dependency nodes are stored in the memory.
Optionally, the establishing a directed acyclic graph between the output node and a plurality of dependent nodes includes:
executing the following loop flows for the output node and the plurality of dependent nodes of the output node respectively:
judging whether a current node exists in the memory, if not, throwing an exception, and if so, adding the current node and a node depending on the current node into the directed acyclic graph;
and judging whether the current node has a dependent node, if not, building the directed acyclic graph, and if so, judging whether the memory has the dependent node of the current node.
Optionally, the performing topology ranking on the directed acyclic graph, and determining the execution priorities of the plurality of dependent nodes and the output nodes according to the topology ranking result includes:
judging whether the directed acyclic graph has nodes, if not, obtaining the topology sequencing result, if so, judging whether the directed acyclic graph has independent nodes,
if not, throwing the exception, if so, taking all the independent nodes as ith priority nodes, deleting the independent nodes and the dependency relationship of the independent nodes from the directed acyclic graph, and judging whether the directed acyclic graph has nodes or not, wherein i is an integer larger than 0.
Optionally, before obtaining the output node of the business process, the method further includes: and adding the newly added data nodes and the dependency relationship into the memory and/or deleting the specified data nodes and the dependency relationship from the memory based on the service change requirement of the service process.
Optionally, adding the new data node and the dependency relationship to the memory includes:
determining the newly added data node and a dependent node of the newly added data node according to the service change requirement of the service process;
judging whether a node which is not accessed into the memory exists in the dependent node of the newly added data node, if so, accessing the dependent node of the newly added data node into the memory, judging whether a node which is not accessed into the updated memory exists in the dependent node of the newly added data node,
if not, naming the newly added data node, configuring a dependency relationship and input parameter information, acquiring data and input parameter information in the dependency relationship, and setting corresponding processing logic for the newly added data node.
Since the implementation details of the above device are described in the above detailed description of the method embodiments, they are not repeated for brevity.
Fig. 10 is a block diagram showing a business process execution control apparatus according to an embodiment of the present invention. The apparatus shown in fig. 10 is only an example and should not be used to limit the scope of the invention.
Referring to fig. 10, the apparatus includes a processor 1010, a memory 1020, and an input-output device 1030 connected by a bus. The memory 1020 includes a Read Only Memory (ROM) and a Random Access Memory (RAM), and the memory 1020 stores various computer instructions and data required for performing system functions, and the processor 1010 reads the various computer instructions from the memory 1020 to perform various appropriate actions and processes. The input and output device 1030 includes an input section of a keyboard, a mouse, and the like; an output section including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section including a hard disk and the like; and a communication section including a network interface card such as a LAN card, a modem, or the like. Memory 1020 also stores computer instructions to perform the operations specified by the methods of embodiments of the present invention.
Accordingly, an embodiment of the present invention further provides a computer device, including: a memory for storing computer executable code; a processor for executing the computer executable code to implement the method of the above embodiments.
Accordingly, the embodiment of the present invention further provides a computer-readable medium, which includes computer executable code, and when executed by a processor, the computer executable code implements the method of the above-mentioned embodiment.
The flowcharts and block diagrams in the figures and block diagrams illustrate the possible architectures, functions, and operations of the systems, methods, and apparatuses according to the embodiments of the present invention, and may represent a module, a program segment, or merely a code segment, which is an executable instruction for implementing a specified logical function. It should also be noted that the executable instructions that implement the specified logical functions may be recombined to create new modules and program segments. The blocks of the drawings, and the order of the blocks, are thus provided to better illustrate the processes and steps of the embodiments and should not be taken as limiting the invention itself.
The above description is only a few embodiments of the present invention, and is not intended to limit the present invention, and various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A method for executing a business process is characterized by comprising the following steps:
acquiring an output node of a business process, and recursing the dependency relationship of the output node to obtain a plurality of dependency nodes of the output node;
establishing a directed acyclic graph between the output node and a plurality of dependent nodes;
carrying out topological sorting on the directed acyclic graph, and determining the execution priority of the plurality of dependent nodes and the output nodes according to the topological sorting result;
and executing the plurality of dependent nodes and the output nodes in sequence according to the execution priority to obtain the output data of the business process.
2. The method of claim 1, wherein the business process comprises: a financial risk control process;
the financial risk control process comprises the following steps:
collecting credit investigation information of a user to be assessed for financial risk;
extracting credit investigation characteristics from the credit investigation information;
and inputting the credit investigation characteristics into a credit investigation risk evaluation model, and obtaining a credit investigation risk evaluation value of the user by the credit investigation risk evaluation model.
3. The method of claim 1, wherein the obtaining an output node of a business process, and recursively deriving the dependency relationship of the output node, to obtain a plurality of dependency nodes of the output node comprises:
and recursing the dependency relationship of the output node, and selecting the plurality of dependency nodes from a memory, wherein the output node and the plurality of dependency nodes and the dependency relationship between the output node and the plurality of dependency nodes are stored in the memory.
4. The method of claim 3, wherein establishing the directed acyclic graph between the output node and the plurality of dependent nodes comprises:
performing the following loop flow for the output node and a plurality of dependent nodes of the output node:
judging whether a current node exists in the memory, if not, throwing an exception, and if so, adding the current node and a node depending on the current node into the directed acyclic graph;
and judging whether the current node has a dependent node, if not, building the directed acyclic graph, and if so, judging whether the memory has the dependent node of the current node.
5. The method of claim 1, wherein topologically ordering the directed acyclic graph, and wherein determining the execution priority of the plurality of dependent nodes and output nodes according to the topological ordering comprises:
judging whether the directed acyclic graph has nodes, if not, obtaining the topology sequencing result, if so, judging whether the directed acyclic graph has independent nodes,
if not, throwing the exception, if so, taking all the independent nodes as ith priority nodes, deleting the independent nodes and the dependency relationship of the independent nodes from the directed acyclic graph, and judging whether the directed acyclic graph has nodes or not, wherein i is an integer larger than 0.
6. The method of claim 3, wherein obtaining the output node of the business process further comprises: and adding the newly added data nodes and the dependency relationship into the memory and/or deleting the specified data nodes and the dependency relationship from the memory based on the service change requirement of the service process.
7. The method of claim 6, wherein adding the new data nodes and dependencies to the memory comprises:
determining the newly added data node and a dependent node of the newly added data node according to the service change requirement of the service process;
judging whether a node which is not accessed into the memory exists in the dependent node of the newly added data node, if so, accessing the dependent node of the newly added data node into the memory, judging whether a node which is not accessed into the updated memory exists in the dependent node of the newly added data node,
if not, naming the newly added data node, configuring a dependency relationship and input parameter information, acquiring data and input parameter information in the dependency relationship, and setting corresponding processing logic for the newly added data node.
8. A business process execution apparatus, comprising:
the directed acyclic graph establishing unit is configured to execute output node acquisition of a business process, recurse the dependency relationship of the output nodes to obtain a plurality of dependency nodes of the output nodes, and establish a directed acyclic graph between the output nodes and the plurality of dependency nodes according to the output nodes, the plurality of dependency nodes and the dependency relationship between the output nodes and the plurality of dependency nodes;
an execution priority determining unit configured to perform topology sorting of the directed acyclic graph, and determine execution priorities of the plurality of dependent nodes and output nodes according to a topology sorting result;
and the execution unit is configured to execute the plurality of dependent nodes and the output nodes in sequence according to the execution priority to obtain the output data of the business process.
9. A computer device, comprising:
a memory for storing computer executable code;
a processor for executing the computer executable code to implement the method of any one of claims 1-7.
10. A computer-readable medium comprising computer-executable code that, when executed by a processor, performs the method of any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011127112.5A CN112288249A (en) | 2020-10-20 | 2020-10-20 | Business process execution method and device, computer equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011127112.5A CN112288249A (en) | 2020-10-20 | 2020-10-20 | Business process execution method and device, computer equipment and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112288249A true CN112288249A (en) | 2021-01-29 |
Family
ID=74423930
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011127112.5A Pending CN112288249A (en) | 2020-10-20 | 2020-10-20 | Business process execution method and device, computer equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112288249A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113672674A (en) * | 2021-07-15 | 2021-11-19 | 浙江大华技术股份有限公司 | Method, electronic device and storage medium for automatically arranging service flow |
| CN114884893A (en) * | 2022-07-12 | 2022-08-09 | 之江实验室 | Forwarding and control definable cooperative traffic scheduling method and system |
| CN117093502A (en) * | 2023-10-13 | 2023-11-21 | 支付宝(杭州)信息技术有限公司 | Method and device for detecting parallelism of program codes |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103207903A (en) * | 2013-03-26 | 2013-07-17 | 南京南瑞继保电气有限公司 | Visualization graph procedure topology sorting method |
| CN107239468A (en) * | 2016-03-29 | 2017-10-10 | 阿里巴巴集团控股有限公司 | Task node management method and device |
| CN108874757A (en) * | 2017-05-10 | 2018-11-23 | 北京京东尚科信息技术有限公司 | Report form generation method and system, computer-readable medium, electronic equipment |
| CN109144695A (en) * | 2018-08-30 | 2019-01-04 | 百度在线网络技术（北京）有限公司 | A kind of processing method, device, equipment and the medium of task topological relation |
| CN109523187A (en) * | 2018-11-27 | 2019-03-26 | 北京字节跳动网络技术有限公司 | Method for scheduling task, device and equipment |
| CN109598407A (en) * | 2018-10-26 | 2019-04-09 | 阿里巴巴集团控股有限公司 | A kind of execution method and device of operation flow |
| CN111147377A (en) * | 2019-12-05 | 2020-05-12 | 连连银通电子支付有限公司 | Method, device, equipment and medium for determining service channel |
-
2020
- 2020-10-20 CN CN202011127112.5A patent/CN112288249A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103207903A (en) * | 2013-03-26 | 2013-07-17 | 南京南瑞继保电气有限公司 | Visualization graph procedure topology sorting method |
| CN107239468A (en) * | 2016-03-29 | 2017-10-10 | 阿里巴巴集团控股有限公司 | Task node management method and device |
| CN108874757A (en) * | 2017-05-10 | 2018-11-23 | 北京京东尚科信息技术有限公司 | Report form generation method and system, computer-readable medium, electronic equipment |
| CN109144695A (en) * | 2018-08-30 | 2019-01-04 | 百度在线网络技术（北京）有限公司 | A kind of processing method, device, equipment and the medium of task topological relation |
| CN109598407A (en) * | 2018-10-26 | 2019-04-09 | 阿里巴巴集团控股有限公司 | A kind of execution method and device of operation flow |
| CN109523187A (en) * | 2018-11-27 | 2019-03-26 | 北京字节跳动网络技术有限公司 | Method for scheduling task, device and equipment |
| CN111147377A (en) * | 2019-12-05 | 2020-05-12 | 连连银通电子支付有限公司 | Method, device, equipment and medium for determining service channel |
Non-Patent Citations (2)
| Title |
|---|
| 刘逸敏;李捷玮;师恩洲;: "信息系统审计――医疗业务影响分析与持续计划建立", 医学信息, no. 07, pages 10 - 14 * |
| 杜永文 等: "软件定义无线传感器网络研究综述", 计算机工程与应用, vol. 55, no. 1, pages 1 - 8 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113672674A (en) * | 2021-07-15 | 2021-11-19 | 浙江大华技术股份有限公司 | Method, electronic device and storage medium for automatically arranging service flow |
| CN114884893A (en) * | 2022-07-12 | 2022-08-09 | 之江实验室 | Forwarding and control definable cooperative traffic scheduling method and system |
| CN117093502A (en) * | 2023-10-13 | 2023-11-21 | 支付宝(杭州)信息技术有限公司 | Method and device for detecting parallelism of program codes |
| CN117093502B (en) * | 2023-10-13 | 2024-01-30 | 支付宝(杭州)信息技术有限公司 | Method and device for detecting parallelism of program codes |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112288249A (en) | Business process execution method and device, computer equipment and medium | |
| US11016673B2 (en) | Optimizing serverless computing using a distributed computing framework | |
| CN110554958B (en) | Graph database testing method, system, device and storage medium | |
| CN107609004B (en) | Application program embedding method and device, computer equipment and storage medium | |
| CN109118155B (en) | Method and device for generating operation model | |
| CN113946321B (en) | Processing method of computing logic, electronic device and readable storage medium | |
| CN111522806A (en) | Big data cleaning processing method and device, server and readable storage medium | |
| CN112667860A (en) | Sub-graph matching method, device, equipment and storage medium | |
| CN116737130B (en) | Method, system, equipment and storage medium for compiling modal-oriented intermediate representation | |
| CN112965710A (en) | Processing method, device and system of computation graph | |
| CN111367786B (en) | Symbol execution method, electronic equipment and storage medium | |
| CN114238078A (en) | Method for extracting dependency relationship between programs based on high-order function | |
| CN116560629A (en) | Serialization method, device, medium and equipment for data transmission object | |
| CN113391795A (en) | Method and system for realizing self-adaptive mapping of application scene and software development kit | |
| Bracchi et al. | Performability modeling of mobile software systems | |
| CN115796228B (en) | Operator fusion method, device, equipment and storage medium | |
| CN114416574A (en) | Test data generation method, device, medium and equipment | |
| CN113342500B (en) | Task execution method, device, equipment and storage medium | |
| CN114615144B (en) | Network optimization method and system | |
| US11915135B2 (en) | Graph optimization method and apparatus for neural network computation | |
| Pathak et al. | Composing web services through automatic reformulation of service specifications | |
| JP2000039998A (en) | Method for supporting change of object oriented software component, device therefor and storage medium stored with program for supporting change of object oriented software component | |
| CN115936451A (en) | Service decision method and device | |
| Hunsberger | A practical temporal constraint management system for real-time applications | |
| CN116909704A (en) | Application running method and device, storage medium and electronic device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |