Data processing method and device, computer equipment and computer readable storage medium

By determining the status of the target node and processing it accordingly when the data processing flow is updated, the problem of data being unprocessable after the flow update is solved, thus improving the processing efficiency of computer equipment.

CN115563162BActive Publication Date: 2026-04-24SENSOR NETWORKS TECH BEIJING CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
SENSOR NETWORKS TECH BEIJING CO LTD
Filing Date
2022-10-17
Publication Date
2026-04-24

AI Technical Summary

Technical Problem

When the data processing workflow is updated, incomplete data occupies computer equipment resources and affects processing efficiency because the processing method cannot be determined.

Method used

By identifying the target node and its status in the first data processing flow, the target object data is processed according to the updated second data processing flow, thus preventing data from stagnating in memory.

Benefits of technology

It improves the data processing efficiency of computer equipment and avoids resource consumption problems caused by process updates.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115563162B_ABST
    Figure CN115563162B_ABST
Patent Text Reader

Abstract

Embodiments of the present application disclose a data processing method and device, computer equipment and a computer readable storage medium. The second data processing flow is obtained by updating the first data processing flow. If the first data processing flow is updated and there is target object data that is not processed based on the first processing flow, the target node in the first data processing flow for processing the target object data is determined. The node state of the target node is determined based on the first data processing flow. The processing mode for the target object data is determined according to the node state, and the target object data is processed based on the processing mode. By determining the target node where the target object data is located in the first data processing flow and processing the target object data according to the node state of the target node, the target object data can be processed without occupying memory space due to the update of the first data processing flow, thereby improving the data processing efficiency of the computer equipment.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application relates to the field of communication technology, specifically to a data processing method, apparatus, computer equipment, and computer-readable storage medium. Background Technology

[0002] During data processing, changes in application scenario requirements may necessitate updating the data processing workflow. Data that entered the workflow before the update but has not yet been processed after the update cannot be determined based on the updated workflow. As this data remains unprocessed, it will continue to exist in memory, consuming computer resources and impacting the computer's data processing efficiency. Summary of the Invention

[0003] This application provides a data processing method, apparatus, computer device, and computer-readable storage medium. By determining the target node where the target object data is located in a first data processing flow, and determining the node state of the target node according to the first data processing flow and a second data processing flow (a flow obtained by updating the first data processing flow), the target object data is processed according to the node state. This can prevent the target object data from becoming unprocessable due to the first data processing flow being updated, thereby improving the data processing efficiency of the computer device.

[0004] This application provides a data processing method, including:

[0005] Obtain the second data processing flow obtained by updating the first data processing flow;

[0006] If, after the first data processing flow is updated, there is target object data that has not been processed by the first processing flow, then the target node in the first data processing flow used to process the target object data is determined.

[0007] The node status of the target node is determined based on the first data processing flow;

[0008] The processing method for the target object data is determined based on the node status, and the target object data is processed based on the processing method.

[0009] Accordingly, this application also provides a data processing apparatus, including:

[0010] The acquisition unit is used to acquire the second data processing flow obtained by updating the first data processing flow;

[0011] The node determination unit is used to determine the target node in the first data processing flow that is used to process the target object data if there is target object data that has not been processed based on the first processing flow after the first data processing flow is updated.

[0012] A state determination unit is used to determine the node state of the target node based on the first data processing flow;

[0013] The processing unit is used to determine the processing method for the target object data based on the node status, and to process the target object data based on the processing method.

[0014] In one embodiment, both the first data processing flow and the second data processing flow include at least one processing branch, and the state determination unit includes:

[0015] The branch node determination subunit is used to determine the branch node on the processing branch where the matching node is located in the second data processing flow if there is a matching node in the second data processing flow that matches the target node.

[0016] The state acquisition sub-unit is used to obtain the node state of the target node according to the update type of the branch node in the second data processing flow.

[0017] In one embodiment, the branch node includes a first branch node and a second branch node, and the state obtaining sub-unit includes:

[0018] The first type acquisition module is used to acquire the update type of the first branch node on the processing branch whose execution time is earlier than that of the matching node;

[0019] The second type acquisition module is used to acquire the update type of the second branch node on the processing branch whose execution time is later than that of the target node if the update type is a reserved type.

[0020] The node status acquisition module is used to determine the node status of the target node based on the update type of the second updating node.

[0021] In one embodiment, the node state includes a valid state, and the processing unit includes:

[0022] The flow node determination subunit is used to determine the flow node that matches the target node in the second data processing flow if the node status is valid.

[0023] The data processing subunit is used to process the target object data through the flow node.

[0024] In one embodiment, the node state includes an invalid state, and the processing unit includes:

[0025] The method determination subunit is used to determine that if the node status is invalid, the processing method for the target object data is the deletion processing method;

[0026] The deletion subunit is used to delete the target object data based on the deletion processing method.

[0027] In one embodiment, the acquisition unit includes:

[0028] The display subunit is used to display a flowchart corresponding to the first data processing flow.

[0029] An update subunit is used to update the first data processing flow in response to an edit operation on the process canvas, thereby obtaining the second data processing flow.

[0030] In one embodiment, the data processing apparatus further includes:

[0031] The data acquisition unit is used to acquire object data received after the first data processing flow is updated;

[0032] An object data processing unit is used to process the object data through the second data processing flow.

[0033] Accordingly, this application also provides a computer device including a memory and a processor; the memory stores a computer program, and the processor is used to run the computer program in the memory to execute any of the data processing methods provided in this application.

[0034] Accordingly, embodiments of this application also provide a computer-readable storage medium for storing a computer program, which is loaded by a processor to execute any of the data processing methods provided in embodiments of this application.

[0035] This application embodiment obtains a second data processing flow by updating the first data processing flow; if, after the first data processing flow is updated, there is target object data that has not been processed based on the first processing flow, then the target node used to process the target object data in the first data processing flow is determined; the node state of the target node is determined based on the first data processing flow; the processing method for the target object data is determined according to the node state, and the target object data is processed based on the processing method.

[0036] This application embodiment determines the target node where the target object data is located in the first data processing flow, determines the node state of the target node according to the first data processing flow and the second data processing flow (the flow obtained by updating the first data processing flow), and processes the target object data according to the node state. This can avoid the target object data becoming unprocessable due to the first data processing flow being updated, thus avoiding the occupation of memory space and improving the data processing efficiency of computer equipment. Attached Figure Description

[0037] To more clearly illustrate the technical solutions in the embodiments of this application, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0038] Figure 1 This is a flowchart of the data processing method provided in the embodiments of this application;

[0039] Figure 2 This is another flowchart of the data processing method provided in the embodiments of this application;

[0040] Figure 3 This is a schematic diagram of the data processing apparatus provided in an embodiment of this application;

[0041] Figure 4 This is a schematic diagram of the structure of the computer device provided in the embodiments of this application. Detailed Implementation

[0042] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0043] This application provides a data processing method, apparatus, computer device, and computer-readable storage medium. The data processing apparatus can be integrated into a computer device, which may be a server or a terminal, etc.

[0044] The terminal may include mobile phones, wearable smart devices, tablets, laptops, personal computers (PCs), and in-vehicle computers, etc.

[0045] The server can be a standalone physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms.

[0046] The following sections provide detailed descriptions of each example. It should be noted that the order in which the embodiments are described is not intended to limit the preferred order of the embodiments.

[0047] This embodiment will be described from the perspective of a data processing device, which can be integrated into a computer device, such as a server or a terminal.

[0048] First, a brief introduction will be given to the data processing flow, nodes, and canvas involved in the data processing method provided in the embodiments of this application.

[0049] A data processing flow can be a process for processing data. A data processing flow can consist of multiple nodes, and the order in which the nodes are executed and the operations constitute the data processing flow.

[0050] Each node can correspond to a specific algorithm to perform the corresponding processing on the data. An algorithm is an accurate and complete description of a problem-solving scheme; it is a series of clear instructions for solving a problem. An algorithm represents a systematic approach to describing the strategy and mechanism for solving a problem.

[0051] The canvas can be a tool provided in this application embodiment for configuring a data processing flow. A data processing flow can be generated by adding nodes to the canvas, setting the order between nodes, and the operation to be performed for each node, so as to instruct the server to perform data processing based on the data processing flow.

[0052] Next, the application scenarios of the data processing method provided in the embodiments of this application will be introduced. The embodiments of this application can be applied to scenarios that require data processing based on processes, such as operational activities. Operational activities may include sending coupons, pushing activity messages, pushing recommended content, and sending reminder messages, etc. The following will take pushing activity messages to users who meet the conditions as an example for explanation.

[0053] Assume there is a first data processing flow (hereinafter referred to as the first flow) in this scenario. This data processing flow is used to push activity messages to users who meet certain conditions. The first data processing flow contains multiple nodes. Different nodes can be used to filter users who meet different filtering conditions. For example, the first data processing flow P contains nodes a→b→c→d→e. Node a is the entry node, and the condition for entering the node is users who registered as members after January 1st. Node b is users who viewed product F. Node c is users who added product F to their shopping cart within 10 minutes. Node d is users who added product F to their shopping cart but did not pay within 24 hours. Node e is the node that sends a message about the timeout.

[0054] If a user registers as a member after January 1st, the user will enter node a. When the user browses product F, the user will move to node b. After browsing product F, the user will add product F to their shopping cart within 1 minute. The user will then move to node c. If the user does not pay within 24 hours of adding the product to their cart, the user will move to node d and then continue to node e, triggering node e to send the user a message about the upcoming timeout.

[0055] When business needs change, the first data processing flow is updated to obtain the second data processing flow (hereinafter referred to as the second flow). For example, if node c in the first flow is deleted, the second flow is obtained, that is, the second flow is node a→node c→node d→node e. Suppose that before the first flow is updated, a user enters the first flow, and when the user enters node c, the first flow is updated. Since the node has been deleted, the user cannot continue to flow and will remain on the server, occupying the server's resources.

[0056] According to the embodiments of this application, the node status of node c can be determined to be invalid according to the first process and the second process, and the user can be deleted from the server's memory; if the user is in node d of the first process when the first process is completed, the node status of node d can be determined to be valid according to the first process and the second process, and the user can continue to be processed based on the second process.

[0057] This application provides a data processing method, such as... Figure 1 As shown, the specific flow of this data processing method can be as follows:

[0058] 101. Obtain the second data processing flow obtained by updating the first data processing flow.

[0059] The first data processing flow can be a data processing flow used to process data, and the second data processing flow is a data processing flow obtained by updating the first data processing flow.

[0060] The second data processing procedure can be obtained from a storage device such as memory or a database.

[0061] The second data processing flow obtained by updating the first data processing flow can be edited using a process canvas. The process canvas is a tool provided in this application embodiment for configuring data processing flows. Specifically, in one embodiment, the step "obtaining the second data processing flow obtained by updating the first data processing flow" may include:

[0062] Displays a flowchart used to show the first data processing flow;

[0063] In response to an edit operation on the workflow canvas, the first data processing workflow is updated to obtain the second data processing workflow.

[0064] For example, a process canvas can be displayed on the client side, which is configured with a first data processing process. Users can edit the first data processing process on the process canvas, such as deleting, modifying, and adding nodes. In response to the editing operation, the client sends an update message to the server. The server updates the first data processing process based on the update message to obtain the second data processing process.

[0065] In one embodiment, after editing the first data processing flow in the process canvas, a second data processing flow is obtained. The process canvas may include the second data processing flow, or it may include the first data processing flow marked with an update type, for example, such as... Figure 2 As shown, the flowchart (1) displays the first data processing flow. Figure 2 The middle process canvas (2) shows the second data processing flow and the first data processing flow marked with the update type.

[0066] Optionally, the second data processing flow may only include its data processing nodes. Alternatively, the second data processing flow may include not only its data processing nodes but also nodes from the first data processing flow that are marked with update types. Update types may include delete, retain, and modify types, so as to determine the node status of nodes in the first data processing flow based on the second data processing flow. It is understood that there are overlapping nodes between the first and second data processing flows, i.e., nodes whose update types are retain or modify.

[0067] 102. If, after the first data processing flow is updated, there is target object data that has not been processed by the first processing flow, then the target node in the first data processing flow used to process the target object data is determined.

[0068] The target object data can be the target object data that was not processed by the first data processing process after the first data processing process was updated, that is, the data that entered the first data processing process for data processing before the first data processing process was updated and was still not processed by the first data processing process after the first data processing process was updated.

[0069] The target object data may contain node data. Node data can represent the node where the target object data is currently flowing in the first data processing flow, i.e., the target node, or it can represent the current processing progress of the target object data in the first data processing flow.

[0070] For example, if there is target object data that has not been processed by the first data processing flow after the first data processing flow is updated, the node (i.e. the target node) that the first data processing flow is currently processing the target object data can be determined based on the node data carried by the target object data.

[0071] 103. Determine the node status of the target node based on the second data processing flow.

[0072] The node status can represent the validity status of the node. For example, it can include a valid status and an invalid status. A valid status indicates that the target node is executable and can be processed based on the second data processing flow. An invalid status indicates that the target node is not executable and cannot be processed based on the second data processing flow.

[0073] For example, if the second data processing flow only contains nodes used for data processing, it can be determined whether the second data processing flow contains a target node based on the nodes in the second data processing flow. If it does, the node status of the target node is valid; otherwise, it is invalid.

[0074] If the second data processing flow includes not only its data processing nodes but also the nodes of the first data processing flow that are marked with update types, the node status of the target node can be determined according to the update type of the target node in the second data processing flow. For example, if the update type is a reserved type, the node status is a valid state; otherwise, it is an invalid state.

[0075] If the second data processing flow includes a target node, but a node in the second data processing flow that executes before the target node might be updated, this could render the target node unexecutable. For example, consider a first data processing flow P containing nodes a → b → c → d → e. Node a is the entry node, defined as a user who registered after January 1st. Node b represents users who viewed product F. Node c represents users who added product F to their cart within 10 minutes. Node d represents users who haven't paid within 24 hours. Node e sends a message about an impending timeout. It's understandable that in the first data processing flow P, the node can be executed upon triggering a corresponding event. A node can include updates to the user's current node triggered by a response event.

[0076] If we modify node a to show users who registered after May 1st, and the target node is node c, with the update type set to "retain," then the data will continue flowing from the target node to nodes d and e. Node e will then send messages about impending timeout to users who registered on January 1st, viewed product F, and did not pay for it within 24 hours of adding it to their cart. This does not include users who were the target users of the second data processing flow—those who registered on May 1st, viewed product F, and did not pay for it within 24 hours of adding it to their cart.

[0077] Therefore, it is necessary to determine the node state of the target node based on the update type of the branch node on the processing branch where the matching node of the target node is located in the second data processing flow. That is, in one embodiment, both the first data processing flow and the second data processing flow contain at least one processing branch. The step "determine the node state of the target node based on the first data processing flow" may specifically include:

[0078] If there is a matching node in the second data processing flow that matches the target node, then determine the branch node on the processing branch where the matching node is located in the second data processing flow.

[0079] Based on the update type of the branch node in the second data processing flow, the node status of the target node is obtained.

[0080] Here, the matching node is the node in the second data processing flow that is the same as the target node in the first data processing flow, for example... Figure 2 The nodes marked in the middle that match each other between the first and second data processing flows.

[0081] Here, a processing branch can be a portion of the data processing flow that is branched off from the second data processing flow. For example, such as... Figure 2 As shown, the processing branches for nodes x and y are branch 1, and the processing branches for nodes u and v are branch 2.

[0082] The update type can be the type of node being edited, such as retain, modify, and add. If the second data processing flow includes data from the first data processing flow that identifies the update type, the update type of the node in the second data processing flow can also include the delete type.

[0083] For example, it can specifically determine the processing branch where the matching node is located in the second data processing flow and the branch nodes on that processing branch. The nodes in the second data processing flow can correspond to update information indicating the update type, and the update type of the branch node can be determined based on the update information.

[0084] If the update type of a branch node is modification or addition (or deletion), the node status of the target node is determined to be invalid. If all branch nodes are retained, the node status of the target node is valid.

[0085] Optionally, since the update type of branch nodes whose execution order follows the target node is either newly added or retained, which does not affect the processing of the target object data, the update type of the first branch node whose execution order precedes the matching node can be determined first, and then the update type of the second branch node whose execution order follows the matching node can be determined, thereby determining the node state of the target node. That is, in one embodiment, the branch nodes include the first branch node and the second branch node, and the step "determining the update type of the branch nodes in the second data processing flow to obtain the node state of the target node" can specifically include:

[0086] In the processing branch, the update type of the first branch node that is executed before the matching node is obtained;

[0087] If the update type is a reserved type, then obtain the update type of the second branch node on the processing branch whose execution time is later than that of the target node;

[0088] The node status of the target node is determined based on the update type of the second update node.

[0089] For example, if the update type of the first branch node, which is executed before the matching node, is a reserved type, it means that the target object data obtained by the target node conforms to the processing result of the second data processing flow. Then, the update type of the second branch node, which is executed after the target node, is further determined, and the node status of the target node is determined based on the update type of the second branch node.

[0090] If the second branch node is of update type, either new or retained, then the node status of the target node is determined to be valid; otherwise, the node status of the target node is determined to be invalid.

[0091] 104. Determine the processing method for the target object data based on the node status, and process the target object data based on the processing method.

[0092] When the first data processing flow is updated, after the update is completed, there may be target data in the server that was processed based on the first data processing flow before the update was completed, and that was not processed when the update was completed. At this time, since the data processing flow has been updated, the server cannot process the target data, which causes the target data to be stored in memory, occupying memory resources, resulting in slow processor speed and low server processing efficiency.

[0093] This application embodiment processes target object data based on node status to avoid the target object data stagnating in memory and occupying memory space. For example, node status can include valid and invalid status. If the node status is valid, it can be executed according to the matching flow node of the target node, that is, the node whose execution sequence is second only to the matching node among the unexecuted nodes in the second data processing flow. In one embodiment, the node status includes valid status. The step "determine the processing method for the target object data according to the node status, and process the target object data based on the processing method" can specifically include:

[0094] If the node status is valid, then the processing method for the target object data is determined to be the node processing method;

[0095] The flow node that matches the target node in the second data processing flow is determined based on the node processing method.

[0096] Data processing of the target object data is performed through the flow nodes.

[0097] For example, if the node status is valid, then the flow node that matches the target node is determined according to the execution sequence of the nodes in the second data processing flow, and the target object is processed based on the flow node.

[0098] If a node is in an invalid state, it indicates that the target object data cannot be processed based on the second data processing flow, and the target object data needs to be deleted from memory. In one embodiment, the node state includes an invalid state. The step "determine the processing method for the target object data based on the node state, and process the target object data based on the processing method" may specifically include:

[0099] If the node status is invalid, then the processing method for the target object data is determined to be deletion.

[0100] The data of the target object is deleted based on the deletion processing method.

[0101] For example, if the node status is invalid, the processing method for the target object data is determined to be deletion, and the target object data is deleted from the server's memory based on the deletion processing method.

[0102] After the first data processing flow is completed, the received object data is processed through the second data processing flow. Specifically, in one embodiment, the data processing method provided in this application may further include:

[0103] Retrieve object data received after the first data processing flow has been updated;

[0104] The object data is processed through the second data processing flow.

[0105] Among them, object data refers to data that needs to be processed through the second data processing flow.

[0106] For example, if object data is received after the first data processing flow is updated, it can be processed through a node in the second data processing flow.

[0107] As can be seen from the above, the embodiments of this application obtain a second data processing flow by updating the first data processing flow; if there is target object data that has not been processed based on the first processing flow after the first data processing flow is updated, then the target node used to process the target object data in the first data processing flow is determined; the node state of the target node is determined based on the first data processing flow; the processing method for the target object data is determined according to the node state, and the target object data is processed based on the processing method.

[0108] This application embodiment determines the target node where the target object data is located in the first data processing flow, determines the node state of the target node according to the first data processing flow and the second data processing flow (the flow obtained by updating the first data processing flow), and processes the target object data according to the node state. This can avoid the target object data becoming unprocessable due to the first data processing flow being updated, thus avoiding the occupation of memory space and improving the data processing efficiency of computer equipment.

[0109] To facilitate better implementation of the data processing method provided in the embodiments of this application, a data processing apparatus is also provided in one embodiment. The meanings of the terms used are the same as in the data processing method described above, and specific implementation details can be found in the description of the method embodiments.

[0110] This data processing device can be integrated into a computer device, such as... Figure 3As shown, the data processing device may include: an acquisition unit 301, a node determination unit 302, a state determination unit 303, and a processing unit 304, as detailed below:

[0111] (1) Acquisition unit 301: used to acquire the second data processing flow obtained by updating the first data processing flow.

[0112] (2) Node determination unit 302: If there is target object data that has not been processed based on the first processing flow after the first data processing flow is updated, then determine the target node in the first data processing flow used to process the target object data.

[0113] (3) Status determination unit 303: used to determine the node status of the target node based on the first data processing flow.

[0114] In one embodiment, both the first data processing flow and the second data processing flow include at least one processing branch, and the state determination unit may include a branch node determination subunit and a state acquisition subunit, specifically:

[0115] Branch node determination subunit: If there is a matching node in the second data processing flow that matches the target node, then determine the branch node on the processing branch where the matching node is located in the second data processing flow.

[0116] The status acquisition sub-unit is used to obtain the node status of the target node based on the update type of the branch node in the second data processing flow.

[0117] In one embodiment, the branch nodes include a first branch node and a second branch node, and the state acquisition subunit may include a first type acquisition module, a second type acquisition module, and a node state acquisition module, specifically:

[0118] The first type of acquisition module is used to acquire the update type of the first branch node in the processing branch whose execution time precedes that of the matching node;

[0119] The second type of acquisition module is used to acquire the update type of the second branch node on the processing branch whose execution time is later than that of the target node if the update type is a reserved type.

[0120] Node Status Acquisition Module: Used to determine the node status of the target node based on the update type of the second updating node.

[0121] (4) Processing unit 304: used to determine the processing method for the target object data according to the node status, and process the target object data based on the processing method.

[0122] In one embodiment, the node state includes a valid state, and the processing unit may include a node determination subunit and a data processing subunit, specifically:

[0123] Flow node determination subunit: used to determine the flow node that matches the target node in the second data processing flow if the node status is valid;

[0124] Data processing subunit: Used to process target object data through flow nodes.

[0125] In one embodiment, the node state includes an invalid state, and the processing unit may include a method determination subunit and a deletion subunit, specifically:

[0126] Method determination sub-unit: used to determine the processing method for the target object data as deletion if the node status is invalid;

[0127] Deletion sub-unit: Used to delete target object data based on the deletion processing method.

[0128] In one embodiment, the acquisition unit may include a display subunit and an update subunit, specifically:

[0129] Display subunit: Used to display the flowchart corresponding to the first data processing flow;

[0130] Update subunit: Used in response to an edit operation on the process canvas to update the first data processing flow and obtain the second data processing flow.

[0131] In one embodiment, the data processing apparatus may further include a data acquisition unit and an object data processing unit, specifically:

[0132] Data acquisition unit: used to acquire object data received after the first data processing flow is updated;

[0133] Object data processing unit: used to process object data through the second data processing flow.

[0134] As can be seen from the above, in this embodiment of the application, the data processing device acquires the second data processing flow obtained by updating the first data processing flow through the acquisition unit 301; if there is target object data that has not been processed based on the first processing flow after the first data processing flow is updated, the node determination unit 302 determines the target node used to process the target object data in the first data processing flow; the state determination unit 303 determines the node state of the target node based on the first data processing flow; and the processing unit 304 determines the processing method for the target object data according to the node state, and processes the target object data based on the processing method.

[0135] This application embodiment determines the target node where the target object data is located in the first data processing flow, determines the node state of the target node according to the first data processing flow and the second data processing flow (the flow obtained by updating the first data processing flow), and processes the target object data according to the node state. This can avoid the target object data becoming unprocessable due to the first data processing flow being updated, thus avoiding the occupation of memory space and improving the data processing efficiency of computer equipment.

[0136] This application also provides a computer device, which can be a terminal or a server, such as... Figure 4 As shown, it illustrates a structural schematic diagram of the computer device involved in the embodiments of this application, specifically:

[0137] The computer device may include components such as a processor 1001 with one or more processing cores, a memory 1002 with one or more computer-readable storage media, a power supply 1003, and an input unit 1004. Those skilled in the art will understand that... Figure 4 The computer device structure shown does not constitute a limitation on the computer device and may include more or fewer components than shown, or combine certain components, or have different component arrangements. Wherein:

[0138] The processor 1001 is the control center of the computer device. It connects various parts of the computer device via various interfaces and lines, and performs various functions and processes data by running or executing software programs and / or modules stored in the memory 1002, and by calling data stored in the memory 1002, thereby providing overall monitoring of the computer device. Optionally, the processor 1001 may include one or more processing cores; preferably, the processor 1001 may integrate an application processor and a modem processor, wherein the application processor mainly handles the operating system, user interface, and computer programs, and the modem processor mainly handles wireless communication. It is understood that the modem processor may not be integrated into the processor 1001.

[0139] The memory 1002 can be used to store software programs and modules. The processor 1001 executes various functional applications and data processing by running the software programs and modules stored in the memory 1002. The memory 1002 may mainly include a program storage area and a data storage area. The program storage area may store the operating system, computer programs required for at least one function (such as sound playback function, image playback function, etc.), etc.; the data storage area may store data created according to the use of the computer device, etc. In addition, the memory 1002 may include high-speed random access memory, and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other volatile solid-state storage device. Accordingly, the memory 1002 may also include a memory controller to provide the processor 1001 with access to the memory 1002.

[0140] The computer equipment also includes a power supply 1003 that supplies power to the various components. Preferably, the power supply 1003 can be logically connected to the processor 1001 through a power management system, thereby enabling functions such as charging, discharging, and power consumption management through the power management system. The power supply 1003 may also include one or more DC or AC power supplies, recharging systems, power fault detection circuits, power converters or inverters, power status indicators, and other arbitrary components.

[0141] The computer device may also include an input unit 1004, which can be used to receive input digital or character information and generate keyboard, mouse, joystick, optical or trackball signal inputs related to user settings and function control.

[0142] Although not shown, the computer device may also include a display unit, etc., which will not be described in detail here. Specifically, in this embodiment, the processor 1001 in the computer device loads the executable files corresponding to the processes of one or more computer programs into the memory 1002 according to the following instructions, and the processor 1001 runs the computer programs stored in the memory 1002 to realize various functions, as follows:

[0143] Obtain the second data processing flow obtained by updating the first data processing flow;

[0144] If, after the first data processing flow is updated, there is target object data that has not been processed by the first processing flow, then the target node in the first data processing flow used to process the target object data is determined.

[0145] The node status of the target node is determined based on the first data processing flow;

[0146] The processing method for the target object data is determined based on the node status, and the target object data is processed based on the processing method.

[0147] For details on the implementation of each of the above operations, please refer to the previous examples, which will not be repeated here.

[0148] As can be seen from the above, the computer device in this application embodiment can obtain a second data processing flow obtained by updating the first data processing flow; if there is target object data that has not been processed based on the first processing flow after the first data processing flow is updated, then the target node used to process the target object data in the first data processing flow is determined; the node state of the target node is determined based on the first data processing flow; the processing method for the target object data is determined according to the node state, and the target object data is processed based on the processing method.

[0149] This application embodiment determines the target node where the target object data is located in the first data processing flow, determines the node state of the target node according to the first data processing flow and the second data processing flow (the flow obtained by updating the first data processing flow), and processes the target object data according to the node state. This can avoid the target object data becoming unprocessable due to the first data processing flow being updated, thus avoiding the occupation of memory space and improving the data processing efficiency of computer equipment.

[0150] According to one aspect of this application, a computer program product or computer program is provided, comprising computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium and executes the computer instructions, causing the computer device to perform the methods provided in the various optional implementations of the above embodiments.

[0151] Those skilled in the art will understand that all or part of the steps in the various methods of the above embodiments can be performed by a computer program, or by a computer program controlling related hardware. The computer program can be stored in a computer-readable storage medium and loaded and executed by a processor.

[0152] Therefore, embodiments of this application provide a computer-readable storage medium storing a computer program that can be loaded by a processor to execute any of the data processing methods provided in embodiments of this application.

[0153] For details on the implementation of each of the above operations, please refer to the previous examples, which will not be repeated here.

[0154] The computer-readable storage medium may include: read-only memory (ROM), random access memory (RAM), disk or optical disk, etc.

[0155] Since the computer program stored in the computer-readable storage medium can execute any of the data processing methods provided in the embodiments of this application, the beneficial effects that any of the data processing methods provided in the embodiments of this application can achieve can be realized, as detailed in the preceding embodiments, and will not be repeated here.

[0156] The data processing method, apparatus, computer device, and computer-readable storage medium provided in the embodiments of this application have been described in detail above. Specific examples have been used to illustrate the principles and implementation methods of this application. The description of the above embodiments is only for the purpose of helping to understand the method and core ideas of this application. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this application. Therefore, the content of this specification should not be construed as a limitation of this application.

Claims

1. A data processing method, characterized in that, include: Obtain the second data processing flow obtained by updating the first data processing flow; If, after the first data processing flow is updated, there is target object data that has not been processed by the first data processing flow, then the target node in the first data processing flow used to process the target object data is determined. The node state of the target node is determined based on the first data processing flow; wherein, both the first data processing flow and the second data processing flow contain at least one processing branch; if there is a matching node in the second data processing flow that matches the target node, then the branch nodes on the processing branch where the matching node is located in the second data processing flow are determined, and the branch nodes include a first branch node and a second branch node; the update type of the first branch node on the processing branch whose execution time is earlier than that of the matching node is obtained; if the update type is a reserved type, then the update type of the second branch node on the processing branch whose execution time is later than that of the target node is obtained; the node state of the target node is determined according to the update type of the second branch node; The processing method for the target object data is determined based on the node status, and the target object data is processed based on the processing method.

2. The method according to claim 1, characterized in that, The node status includes a valid status. The step of determining the processing method for the target object data based on the node status, and processing the target object data based on the processing method, includes: If the node status is valid, then the flow node that matches the target node in the second data processing flow is determined. The target object data is processed through the flow node.

3. The method according to claim 1, characterized in that, The node state includes an invalid state. The step of determining the processing method for the target object data based on the node state, and processing the target object data based on the processing method, includes: If the node status is invalid, then the processing method for the target object data is determined to be deletion. The target object data is deleted based on the deletion processing method described above.

4. The method according to claim 1, characterized in that, The step of obtaining the second data processing flow obtained by updating the first data processing flow includes: Display a flowchart corresponding to the first data processing flow; In response to an editing operation on the process canvas, the first data processing flow is updated to obtain the second data processing flow.

5. The method according to any one of claims 1-4, characterized in that, The method further includes: Obtain the object data received after the first data processing flow is updated; The object data is processed through the second data processing procedure.

6. A data processing apparatus, characterized in that, include: The acquisition unit is used to acquire the second data processing flow obtained by updating the first data processing flow; The node determination unit is used to determine the target node in the first data processing flow that is used to process the target object data if there is target object data that has not been processed based on the first data processing flow after the first data processing flow is updated. A state determination unit is used to determine the node state of the target node based on the first data processing flow; wherein both the first data processing flow and the second data processing flow contain at least one processing branch; if there is a matching node in the second data processing flow that matches the target node, then the branch nodes on the processing branch where the matching node is located in the second data processing flow are determined, and the branch nodes include a first branch node and a second branch node; the update type of the first branch node on the processing branch whose execution time is earlier than that of the matching node is obtained; if the update type is a reserved type, then the update type of the second branch node on the processing branch whose execution time is later than that of the target node is obtained; and the node state of the target node is determined according to the update type of the second branch node. The processing unit is used to determine the processing method for the target object data based on the node status, and to process the target object data based on the processing method.

7. A computer device, characterized in that, It includes a memory and a processor; the memory stores a computer program, and the processor is used to run the computer program in the memory to perform the data processing method according to any one of claims 1 to 5.

8. A computer-readable storage medium, characterized in that, The computer-readable storage medium is used to store a computer program, which is loaded by a processor to perform the data processing method according to any one of claims 1 to 5.

Citation Information

Patent Citations

  • Task scheduling method and system, computing equipment and storage medium

    CN113703929A

  • Business process arrangement method and device, electronic equipment and storage medium

    CN115061895A