CN113448570A

CN113448570A - Data processing method and device, electronic equipment and storage medium

Info

Publication number: CN113448570A
Application number: CN202110731041.8A
Authority: CN
Inventors: 杨峻豪
Original assignee: Industrial and Commercial Bank of China Ltd ICBC
Current assignee: Industrial and Commercial Bank of China Ltd ICBC
Priority date: 2021-06-29
Filing date: 2021-06-29
Publication date: 2021-09-28

Abstract

The present disclosure provides a data processing method, which can be applied to the financial field and the computer technical field. The data processing method comprises the following steps: acquiring a target process construction request, wherein the process construction request comprises process name information; responding to a target process construction request, and generating process configuration information according to process name information, wherein the process configuration information comprises a process definition table, a node definition table and a node relation table; generating flow execution information corresponding to the flow configuration information according to the flow configuration information, wherein the flow execution information comprises a flow processing table, a node processing table and a node routing table; and executing the flow example corresponding to the target flow according to the flow execution information. The present disclosure also provides a data processing apparatus, a device, a storage medium, and a program product.

Description

Data processing method and device, electronic equipment and storage medium

Technical Field

The present disclosure relates to the field of finance and computer technology, and more particularly, to a data processing method, apparatus, device, medium, and program product.

Background

Workflow refers to "automation of a portion or the whole of a business process in a computer application environment". It is an abstract and generalized description of the workflow and its business rules among the various operational steps. In computers, workflows are part of the collaborative work supported by the computer. The latter is a general study on how a group can achieve cooperative work with the help of computers.

In implementing the disclosed concept, the inventors found that there are at least the following problems in the related art: the existing workflow is realized through an existing workflow engine, and needs to be manually drawn by a developer during the process modeling, and the program needs to be correspondingly modified during the process modification, so that the started process instance cannot be normally processed.

Disclosure of Invention

In view of the above, the present disclosure provides a data processing method, apparatus, device, medium, and program product.

According to a first aspect of the present disclosure, there is provided a data processing method including:

acquiring a target process construction request, wherein the process construction request comprises process name information;

responding to the target process construction request, and generating process configuration information according to the process name information, wherein the process configuration information comprises a process definition table, a node definition table and a node relation table;

generating flow execution information corresponding to the flow configuration information according to the flow configuration information, wherein the flow execution information comprises a flow processing table, a node processing table and a node routing table;

and executing the process instance corresponding to the target process according to the process execution information.

According to an embodiment of the present disclosure, the data processing method further includes:

acquiring the process definition table construction request, wherein the process definition table construction request comprises description information corresponding to the process name information;

and responding to the flow definition table construction request, and generating the flow definition table according to the flow name information and the description information, wherein the flow definition table comprises a flow identification number corresponding to the flow name information.

acquiring the node definition table construction request, wherein the node definition table construction request comprises a plurality of node information corresponding to the process identification number, and the node information comprises node type information;

and responding to the node definition table construction request, and generating the node definition table according to each node information.

According to an embodiment of the present disclosure, the node type information includes a start node, a normal node, and a termination node.

acquiring the node relation table construction request, wherein the node relation table construction request comprises the association relation of each node information in the node definition table, and the association relation comprises routing type information;

and responding to the node relation table construction request, and generating the node relation table according to the incidence relation.

According to an embodiment of the present disclosure, the routing type information includes that the predecessor node is a start node type, a forward type, a backward type, and the successor node is a termination node type.

According to an embodiment of the present disclosure, the generating, in response to the flow construction request, flow configuration information according to the flow name information includes:

and associating the node definition table and the node relation table to the process definition table to generate the process configuration information.

According to an embodiment of the present disclosure, the generating, according to the flow configuration information, flow execution information corresponding to the flow configuration information includes:

generating the process processing table corresponding to the process definition table according to the process definition table;

generating the node processing table corresponding to the node definition table according to the node definition table;

generating the node routing table corresponding to the node relation table according to the node relation table; and

and generating the flow execution information according to the flow processing table, the node processing table and the node routing table.

According to an embodiment of the present disclosure, the executing the process instance corresponding to the target process according to the process execution information includes:

controlling, by a processing engine, processing logic of each node in the flow execution information; and

and sending a control signal to a state machine through the processing engine so that the state machine can update the state information of the current node in the process execution information according to the control signal until the process instance is completed, wherein the state information comprises to-be-processed, processing and processed states.

A second aspect of the present disclosure provides a data processing apparatus comprising:

the system comprises a first acquisition module, a first processing module and a second acquisition module, wherein the first acquisition module is used for acquiring a target process construction request, and the process construction request comprises process name information;

a first response module, configured to respond to the target process construction request and generate process configuration information according to the process name information, where the process configuration information includes a process definition table, a node definition table, and a node relationship table;

the first generation module is used for generating flow execution information corresponding to the flow configuration information according to the flow configuration information, wherein the flow execution information comprises a flow processing table, a node processing table and a node routing table;

and the execution module is used for executing the process instance corresponding to the target process according to the process execution information.

A third aspect of the present disclosure provides an electronic device, comprising: one or more processors; a memory for storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the above-described data processing method.

A fourth aspect of the present disclosure also provides a computer-readable storage medium having stored thereon executable instructions that, when executed by a processor, cause the processor to perform the above-mentioned data processing method.

A fifth aspect of the present disclosure also provides a computer program product comprising a computer program which, when executed by a processor, implements the above-described data processing method.

According to the embodiment of the present disclosure, the process configuration information composed of the process definition table, the node definition table, and the node relationship table is generated by the process name information in the process construction request, the process execution information composed of the process processing table, the node processing table, and the node routing table is generated according to the process configuration information, and finally, the process processing is executed according to the process execution information. The process of the process is executed according to the process execution information, so that the decoupling of the process configuration information and the process processing operation is realized, and the technical effect that the subsequent processing work of the started process instance is not influenced when the process configuration information is modified is realized. The problem that the started flow instance cannot be normally processed due to the fact that the program needs to be correspondingly modified when the flow is modified in the related art is at least partially solved.

Drawings

The foregoing and other objects, features and advantages of the disclosure will be apparent from the following description of embodiments of the disclosure, which proceeds with reference to the accompanying drawings, in which:

fig. 1 schematically shows an application scenario diagram of a data processing method according to an embodiment of the present disclosure.

Fig. 2 schematically shows a flow chart of a data processing method according to an embodiment of the present disclosure.

Fig. 3 schematically shows a schematic diagram of a data processing method according to an embodiment of the present disclosure.

Fig. 4 schematically shows a block diagram of a data processing apparatus according to an embodiment of the present disclosure.

Fig. 5 schematically shows a block diagram of an electronic device adapted to implement a data processing method according to an embodiment of the present disclosure.

Detailed Description

Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.

All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.

Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).

In the related art, the implementation of the workflow is mainly based on workflow engines such as activiti and jbpm (business process management), and although the above method can meet basic requirements, the method is less complicated in process modeling and requires developers to manually draw corresponding flow charts on an IDE (integrated development environment) interface. And once a certain flow needs to be modified, the corresponding program is also modified synchronously.

The embodiment of the disclosure provides a data processing method and a device, wherein the data processing method comprises the following steps: acquiring a target process construction request, wherein the process construction request comprises process name information; responding to a target process construction request, and generating process configuration information according to process name information, wherein the process configuration information comprises a process definition table, a node definition table and a node relation table; generating flow execution information corresponding to the flow configuration information according to the flow configuration information, wherein the flow execution information comprises a flow processing table, a node processing table and a node routing table; and executing the flow example corresponding to the target flow according to the flow execution information. It should be noted that the data processing method and apparatus of the embodiments of the present disclosure may be used in the financial field and the computer technology field, and may also be used in any technical field other than the financial field and the computer technology field, and the application field of the data processing method and apparatus of the present disclosure is not limited.

As shown in fig. 1, the application scenario 100 according to this embodiment may include a network, a terminal device, and a server. The network 104 serves as a medium for providing communication links between the

terminal devices

101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.

The user may use the

terminal devices

101, 102, 103 to interact with the server 105 via the network 104 to receive or send messages or the like. The

terminal devices

101, 102, 103 may have installed thereon various communication client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).

The

terminal devices

101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.

The server 105 may be a server providing various services, such as a background management server (for example only) providing support for websites browsed by users using the

terminal devices

101, 102, 103. The background management server may analyze and perform other processing on the received data such as the user request, and feed back a processing result (e.g., a webpage, information, or data obtained or generated according to the user request) to the terminal device.

It should be noted that the data processing method provided by the embodiment of the present disclosure may be generally executed by the server 105. Accordingly, the data processing apparatus provided by the embodiments of the present disclosure may be generally disposed in the server 105. The data processing method provided by the embodiment of the present disclosure may also be executed by a server or a server cluster different from the server 105 and capable of communicating with the

terminal devices

101, 102, 103 and/or the server 105. Accordingly, the data processing apparatus provided by the embodiment of the present disclosure may also be disposed in a server or a server cluster different from the server 105 and capable of communicating with the

terminal devices

101, 102, 103 and/or the server 105.

It should be understood that the number of terminal devices, networks, and servers in FIG. 1 are merely illustrative

And (4) the nature is good. There may be any number of terminal devices, networks, and servers, as desired for implementation.

The data processing method of the disclosed embodiment will be described in detail below with fig. 2 and 3 based on the scenario described in fig. 1.

As shown in fig. 2, the data processing method of the embodiment includes operations S201 to S204, and the data processing method may be performed by a terminal device or a server.

In operation S201, a target flow construction request is acquired, where the flow construction request includes flow name information.

According to an embodiment of the present disclosure, the target process may include, for example, a workflow and a business process, etc. running on a carrier. The carrier may comprise an electronic device, the electronic device may comprise a terminal device, and the terminal device may comprise a smartphone, a tablet, a laptop or desktop computer, or the like. The flow construction request may include, for example, flow name information, etc., and the identification of each target flow by the user may be facilitated by setting the flow name information. The target process building request can be generated according to a trigger operation of a user, and the trigger operation can comprise clicking or sliding.

For example, the target flow may be an opening flow of a class a bank card of a certain bank, and the flow name information corresponding to the flow may be, for example, an opening flow of the class a card.

In operation S202, in response to the target process construction request, process configuration information is generated according to the process name information, where the process configuration information includes a process definition table, a node definition table, and a node relationship table.

According to an embodiment of the present disclosure, the process configuration information may include at least a process definition table, a node definition table, and a node relationship table, etc. The flow definition table may include, for example, information describing the function, structure, and the like of the target flow. The node definition table may include node information of all nodes used by the target process, for example, and the node information may include a node ID and the like. The node relationship table may include, for example, an association relationship between nodes used in the target process.

In operation S203, flow execution information corresponding to the flow configuration information is generated according to the flow configuration information, where the flow execution information includes a flow processing table, a node processing table, and a node routing table.

According to an embodiment of the present disclosure, the flow processing table may correspond to a flow definition table, and the flow processing table may include, for example, information describing a function, a structure, and the like of the target flow and processing information of the target flow, and the like. The node processing table may correspond to a node definition table, and may include node information of all nodes used in the target process, processing information for the nodes, and the like, for example, and the node information may include a node ID, and the like, for example. The node routing table may correspond to a node relationship table, and the node routing table may include, for example, an association relationship between nodes used in the target flow, processing information on the association relationship, and the like.

In operation S204, a flow instance corresponding to the target flow is executed according to the flow execution information.

According to an embodiment of the present disclosure, the process instance may be executed according to process execution information, for example, by a processing engine and a state machine, or the like.

acquiring a process definition table construction request, wherein the process definition table construction request comprises description information corresponding to process name information; and responding to the flow definition table construction request, and generating a flow definition table according to the flow name information and the description information, wherein the flow definition table comprises a flow identification number corresponding to the flow name information.

According to an embodiment of the present disclosure, the description information may include, for example, description information of the function, structure, creation time, and the like of the target flow. The description information can enable the user to quickly grasp the basic information of the target flow. The flow identification number may include, for example, a flow identification ID composed of a plurality of numbers. Each target process has a unique process identification ID. It should be noted that the foregoing embodiments are only exemplary embodiments, and the description information may also include description information of other aspects of the target flow according to specific implementation needs. The flow identification number may also be other forms of content, such as a combination of letters and numbers.

According to the embodiment of the disclosure, by constructing the flow definition table, a user can conveniently know information such as functions of each target flow. And, the processing of each target flow by the system can be facilitated through the flow identification number.

acquiring a node definition table construction request, wherein the node definition table construction request comprises a plurality of node information corresponding to the process identification number, and the node information comprises node type information; in response to the node definition table construction request, a node definition table is generated from each node information.

According to the embodiment of the present disclosure, the node definition table construction request may be generated, for example, by a user's corresponding operation, and the corresponding operation may include, for example, a selection operation of a node. The node information may include, for example, a node ID and a node type, each of which may be associated with, for example, a corresponding node name and processing logic of the node.

According to the embodiment of the disclosure, all the required nodes having the target process are selected and operated according to the nodes of the user in the node definition table. Further, according to the specific implementation requirement, in the subsequent development process, for example, corresponding node information may be added or deleted in the node definition table.

According to the embodiment of the disclosure, each node definition table corresponds to the flow identifier of the corresponding target flow one by one. The accuracy and the stability of data can be guaranteed, and meanwhile, a user can conveniently manage the target process.

According to an embodiment of the present disclosure, the node type information includes a start node, a normal node, and a termination node. Specifically, each node type may be represented in the form of, for example, a number, a symbol, or the like.

For example, the node type may be represented by a number, and specifically, the starting node may be represented by a number "0", the general node may be represented by a number "1", and the terminating node may be represented by a number "2". It should be noted that the above embodiments are only exemplary embodiments, and may be represented by other numbers or symbols according to specific implementation requirements.

According to the embodiment of the disclosure, each node definition can be repeatedly used in a plurality of process definitions, and the reusability of node information and the process development efficiency are improved.

acquiring a node relation table construction request, wherein the node relation table construction request comprises an incidence relation of each node information in a node definition table, and the incidence relation comprises routing type information; and responding to the node relation table construction request, and generating the node relation table according to the association relation.

According to an embodiment of the present disclosure, the node relationship table construction request may be generated by, for example, a user's corresponding operation, and the corresponding operation may include, for example, a selection operation of an association relationship for each node. The association may include, for example, routing type information.

According to an embodiment of the present disclosure, the routing type information includes that the predecessor node is a start node type, a forward type, a backward type, and the successor node is a stop node type. Specifically, each routing type may be identified, for example, by numbers, symbols, and the like.

According to the embodiment of the disclosure, in the subsequent development process, according to specific implementation requirements, the user can also correspondingly modify the node relation table.

For example, the routing type may be represented by a number, and specifically, the predecessor node may be represented by a number "0" as the start node type, the forward type by a number "1", the backward type by a number "2", and the successor node may be represented by a number "3" as the end node type. It should be noted that the above embodiments are only exemplary embodiments, and may be represented by other numbers or symbols according to specific implementation requirements.

According to the embodiment of the disclosure, after the construction work of the node relationship table is completed, for example, a user and a handler associated with each node in the node relationship table can be further set. The setup method may include, for example, associating a user ID of the target handler to the target node, and so on. The user ID may include, for example, ID information of a personal computer or the like.

For example, the target process is a process of submitting an application, which is generated and issued by a first user at a first node, and requires a second user to perform an approval when the process reaches a second node. In this case, information such as the ID of the second user may be associated to the second node.

According to the embodiment of the disclosure, the information of the user or the processor related to each node in the target process can be specified by the user, so that the efficiency of process development can be improved.

According to an embodiment of the present disclosure, generating flow configuration information according to flow name information in response to a flow construction request includes:

and associating the node definition table and the node relation table to the process definition table to generate process configuration information.

According to an embodiment of the present disclosure, the process configuration information includes a process definition table, a node definition table, and a node relationship table, which may be associated, for example, by a process identification number of each target process. The accuracy of data can be guaranteed, and the processing speed of the system is improved.

According to an embodiment of the present disclosure, generating the flow execution information corresponding to the flow configuration information according to the flow configuration information includes: generating a flow processing table corresponding to the flow definition table according to the flow definition table; generating a node processing table corresponding to the node definition table according to the node definition table; generating a node routing table corresponding to the node relation table according to the node relation table; and generating flow execution information according to the flow processing table, the node processing table and the node routing table.

According to the embodiment of the present disclosure, the flow configuration information and the flow execution information are in one-to-one correspondence, and the flow configuration information and the flow execution information exist independently of each other. The flow instance corresponding to the target flow is executed according to the flow execution information, not according to the flow configuration information. Therefore, the modification of the process configuration information does not affect the execution of the started process instance, and the started process instance continues to execute according to the original process execution information. The problem that the started flow instance cannot be normally processed when the flow definition is modified in the related technology is avoided.

According to an embodiment of the present disclosure, executing a flow instance corresponding to a target flow according to flow execution information includes:

processing logic for each node in the execution information by the processing engine control flow; and sending a control signal to the state machine through the processing engine so that the state machine updates the state information of the current node in the process execution information according to the control signal until the process instance is completed, wherein the state information comprises to-be-processed, processing and processed information.

According to an embodiment of the present disclosure, the state of a single node is updated according to a state machine, while a processing engine encapsulates the processing logic of the various nodes involved in each business scenario. For example, returning a certain application from node a to node B requires modifying the state of node B to "in process" by a state machine, and modifying the state of all nodes between node B and node a (including node a) to "to be processed". In the above scenario, the state machine is responsible for processing a single node, and the processing engine encapsulates the methods for finding all involved nodes and how to invoke the state machine to update the nodes in this scenario. And the caller only needs to call the method of the processing engine to complete the complex rollback flow.

As shown in fig. 3, the data processing method can be further explained from a service layer 310, a system layer 320 and a data layer 330. Wherein the business layer 310 includes background management and foreground processing. The system layer 320 includes a design module 321 and an execution module 322. The data layer 330 includes a workflow design module 331 and a workflow execution module 332.

The developer designs and defines the target workflow in the design module 321 of the system layer 320 through background management.

And generating a corresponding flow definition table, a node definition table and a node relation table in the data layer 330. Specifically, the developer can input the name and description information of the process, generate a process service key, and insert a process definition table. Then, the developer can add processing nodes to the process, specify the node type of each node, and insert the ID of the target process and the information of each node into the node definition table. The association between the nodes may then be specified, inserted into the node relationship table, and the routing type set according to the node type of each node. And finally, the processing role of each node can be appointed according to the specific implementation requirement.

When the user uses the target workflow, in the system layer 320, a corresponding workflow instance is generated according to the target workflow in the design module 321, and a corresponding flow processing table, a node processing table, and a node routing table are generated in the workflow execution module 332 according to the flow definition table, the node definition table, and the node relationship table in the workflow design module 331.

The workflow instances are processed according to the workflow execution module 332 by a state machine and processing engine in the execution module 322.

According to the embodiment of the disclosure, according to actual needs, for example, the flow definition table, the node definition table, and the node relationship table may be modified correspondingly, for example, nodes may be added, nodes may be deleted, or association relationships between nodes may be modified, information of a handler may be processed, and the like, to a target flow.

For example, when adding a node to a target process, a developer may select the target process to be modified, insert a new node into a node definition table, associate an ID of the target process, query a predecessor node and a successor node of the new node, insert a new association relationship for the new added point in a node relationship table, and delete a waste node relationship.

When deleting the node in the target process, the target node can be deleted in the corresponding node definition table, the precursor node and the subsequent node of the target node are inquired, and a new association relation is added for the precursor node and the subsequent node in the node relation table.

And when the incidence relation between the nodes and the information of the processing person are modified for the target process, modifying the incidence relation in the target node relation table and the information of the processing person in the node definition table according to the ID of the target node.

According to the embodiment of the disclosure, under the condition that a user needs to modify the flow, only the relevant information defined by the flow needs to be modified in the background, and the program does not need to be modified, and the core processing logic and the process of the flow are realized in the system and are not sensed externally. And for the initiated process, when the definition corresponding to the process is modified, the influence on the initiated process is avoided, and the problem that the subsequent process cannot be normally processed because the definition of the process before the current process is modified in some scenes is also avoided.

Based on the data processing method, the disclosure also provides a data processing device. The apparatus will be described in detail below with reference to fig. 4.

As shown in fig. 4, the data processing apparatus 400 of this embodiment includes a first acquisition module 401, a first response module 402, a first generation module 403, and an execution module 404.

The first obtaining module 401 is configured to obtain a target process construction request, where the process construction request includes process name information. In an embodiment, the first obtaining module 401 may be configured to perform the operation S201 described above, which is not described herein again.

A first response module 402, configured to respond to the target process construction request and generate process configuration information according to the process name information, where the process configuration information includes a process definition table, a node definition table, and a node relationship table. In an embodiment, the first response module 402 may be configured to perform the operation S202 described above, which is not described herein again.

A first generating module 403, configured to generate flow execution information corresponding to the flow configuration information according to the flow configuration information, where the flow execution information includes a flow processing table, a node processing table, and a node routing table. In an embodiment, the first generating module 403 may be configured to perform the operation S203 described above, which is not described herein again.

And an executing module 404, configured to execute the process instance corresponding to the target process according to the process execution information. In an embodiment, the executing module 404 may be configured to execute the operation S204 described above, which is not described herein again.

According to an embodiment of the present disclosure, the data processing apparatus 400 further includes a second obtaining module and a second responding module.

And the second acquisition module is used for acquiring a process definition table construction request, wherein the process definition table construction request comprises description information corresponding to the process name information.

And the second response module is used for responding to the flow definition table construction request and generating a flow definition table according to the flow name information and the description information, wherein the flow definition table comprises a flow identification number corresponding to the flow name information.

According to an embodiment of the present disclosure, the data processing apparatus 400 further includes a third obtaining module and a third responding module.

A third obtaining module, configured to obtain a node definition table construction request, where the node definition table construction request includes a plurality of node information corresponding to the process identification number, and the node information includes node type information;

and the third response module is used for responding to the node definition table construction request and generating a node definition table according to the information of each node.

According to an embodiment of the present disclosure, the data processing apparatus 400 further includes a fourth obtaining module and a fourth responding module.

And the fourth obtaining module is used for obtaining a node relation table building request, wherein the node relation table building request comprises the incidence relation of each node information in the node definition table, and the incidence relation comprises the routing type information.

And the fourth response module is used for responding to the node relation table construction request and generating the node relation table according to the association relation.

According to an embodiment of the present disclosure, the routing type information includes that the predecessor node is a start node type, a forward type, a backward type, and the successor node is a stop node type.

According to an embodiment of the present disclosure, the first response module 402 includes a generation unit.

And the generating unit is used for associating the node definition table and the node relation table to the process definition table to generate process configuration information.

According to an embodiment of the present disclosure, the first generation module 403 includes a first generation unit, a second generation unit, a third generation unit, and a fourth generation unit.

And the first generation unit is used for generating a flow processing table corresponding to the flow definition table according to the flow definition table.

And the second generation unit is used for generating a node processing table corresponding to the node definition table according to the node definition table.

And the third generating unit is used for generating a node routing table corresponding to the node relation table according to the node relation table.

And the fourth generating unit is used for generating the flow execution information according to the flow processing table, the node processing table and the node routing table.

The execution module 404 includes an execution unit and an update unit according to an embodiment of the present disclosure.

And the execution unit is used for controlling the flow to execute the processing logic of each node in the information through the processing engine.

And the updating unit is used for sending a control signal to the state machine through the processing engine so that the state machine can update the state information of the current node in the flow execution information according to the control signal until the flow instance is completed, wherein the state information comprises to-be-processed, processing and processed states.

According to the embodiment of the present disclosure, any plurality of the first obtaining module 401, the first responding module 402, the first generating module 403, and the executing module 404 may be combined and implemented in one module, or any one of them may be split into a plurality of modules. Alternatively, at least part of the functionality of one or more of these modules may be combined with at least part of the functionality of the other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the first obtaining module 401, the first responding module 402, the first generating module 403, and the executing module 404 may be at least partially implemented as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented by hardware or firmware in any other reasonable manner of integrating or packaging a circuit, or implemented by any one of three implementations of software, hardware, and firmware, or implemented by any suitable combination of any of them. Alternatively, at least one of the first obtaining module 401, the first responding module 402, the first generating module 403 and the executing module 404 may be at least partially implemented as a computer program module, which when executed may perform a corresponding function.

As shown in fig. 5, an electronic device 500 according to an embodiment of the present disclosure includes a processor 501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. The processor 501 may comprise, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 501 may also include onboard memory for caching purposes. Processor 501 may include a single processing unit or multiple processing units for performing different actions of a method flow according to embodiments of the disclosure.

In the RAM 503, various programs and data necessary for the operation of the electronic apparatus 500 are stored. The processor 501, the ROM 502, and the RAM 503 are connected to each other by a bus 504. The processor 501 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM 502 and/or the RAM 503. Note that the programs may also be stored in one or more memories other than the ROM 502 and the RAM 503. The processor 501 may also perform various operations of method flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.

According to an embodiment of the present disclosure, electronic device 500 may also include an input/output (I/O) interface 505, input/output (I/O) interface 505 also being connected to bus 504. The electronic device 500 may also include one or more of the following components connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.

The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.

According to embodiments of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, which may include, for example but is not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. For example, according to embodiments of the present disclosure, a computer-readable storage medium may include ROM 502 and/or RAM 503 and/or one or more memories other than ROM 502 and RAM 503 described above.

Embodiments of the present disclosure also include a computer program product comprising a computer program containing program code for performing the method illustrated in the flow chart. When the computer program product runs in a computer system, the program code is used for causing the computer system to realize the item recommendation method provided by the embodiment of the disclosure.

The computer program performs the above-described functions defined in the system/apparatus of the embodiments of the present disclosure when executed by the processor 501. The systems, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.

In one embodiment, the computer program may be hosted on a tangible storage medium such as an optical storage device, a magnetic storage device, or the like. In another embodiment, the computer program may also be transmitted, distributed in the form of a signal on a network medium, downloaded and installed through the communication section 509, and/or installed from the removable medium 511. The computer program containing program code may be transmitted using any suitable network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.

In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511. The computer program, when executed by the processor 501, performs the above-described functions defined in the system of the embodiments of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.

In accordance with embodiments of the present disclosure, program code for executing computer programs provided by embodiments of the present disclosure may be written in any combination of one or more programming languages, and in particular, these computer programs may be implemented using high level procedural and/or object oriented programming languages, and/or assembly/machine languages. The programming language includes, but is not limited to, programming languages such as Java, C + +, python, the "C" language, or the like. The program code may execute entirely on the user computing device, partly on the user device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.

The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.

Claims

1. A method of data processing, comprising:

2. The method of claim 1, further comprising:

3. The method of claim 2, further comprising:

4. The method of claim 3, wherein the node type information includes a start node, a normal node, and a stop node.

5. The method of claim 3, further comprising:

6. The method of claim 5, wherein the route type information includes a predecessor node being a start node type, a forward type, a backward type, and a successor node being a termination node type.

7. The method of claim 5, wherein the generating flow configuration information from the flow name information in response to the flow construction request comprises:

8. The method of claim 1, wherein the generating flow execution information corresponding to the flow configuration information from the flow configuration information comprises:

9. The method of claim 1, wherein the executing the flow instance corresponding to the target flow according to the flow execution information comprises:

10. A data processing apparatus comprising:

11. An electronic device, comprising:

one or more processors;

a storage device for storing one or more programs,

wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-9.

12. A computer readable storage medium having stored thereon executable instructions which, when executed by a processor, cause the processor to perform the method of any one of claims 1 to 9.

13. A computer program product comprising a computer program which, when executed by a processor, implements a method according to any one of claims 1 to 9.