Task detection method and apparatus, electronic device, and storage medium

Abstract

Embodiments of the present disclosure provide a task detection method and device, electronic equipment and a storage medium. The method comprises: determining a first task operation in a task operation path and determining attribution logic information of the first task operation, the attribution logic information of the first task operation being used to indicate at least one task function instruction to be adopted for attribution processing of the first task operation, each task function instruction indicated by the attribution logic information of the first task operation having a one-to-one correspondence relationship with each sub-process operation in an attribution processing flow of the first task operation; determining task state information of the first task operation according to the attribution logic information of the first task operation; and determining an attribution positioning result of the task operation path according to the task state information of each first task operation in the task operation path. The present application can reduce the development and maintenance cost of attribution logic, and ensure that the attribution logic is iterated efficiently while ensuring maintainability.

Description

Technical Field

[0001] This disclosure relates to the field of computer technology, and in particular to a task detection method, apparatus, electronic device, and storage medium. Background Technology

[0002] In the booming development of the internet industry, various task scenarios commonly involve task attribution operations. For example, task attribution operations related to orders and traffic require accurately identifying the key task operations that play a crucial role in the completion of a task. To achieve accurate, efficient, and observable task attribution information calculation, it is usually necessary to consider, analyze, and process the specific circumstances, cases, and events of each task separately, based on different task scenario types, and then develop task attribution logic that is adapted to it. However, with the rapid iteration of task scenarios and the turnover of developers, the task attribution logic built in the above way has become increasingly complex after multiple iterations. The complex attribution logic makes it difficult for new developers to quickly understand and get started, and the development and maintenance costs of task attribution logic are also constantly increasing. The excessively high maintenance costs consume a lot of human and time resources, affecting business agility and innovation capabilities. Summary of the Invention

[0003] This disclosure provides a task detection method, apparatus, electronic device, and storage medium to reduce the development and maintenance costs of attribution logic and ensure that the attribution logic can iterate efficiently while maintaining maintainability.

[0004] In a first aspect, embodiments of this disclosure provide a task detection method, the method comprising:

[0005] The first task operation in the task operation path is determined and the attribution logic information of the first task operation is determined. The attribution logic information of the first task operation is used to indicate at least one task function instruction to be used for attribution processing of the first task operation. Each task function instruction indicated by the attribution logic information of the first task operation has a one-to-one correspondence with each sub-process operation in the attribution processing flow of the first task operation.

[0006] Based on the attribution logic information of the first task operation, the task status information of the first task operation is determined. The task status information of the first task operation is used to record whether the task operation entry corresponding to the first task operation belongs to the reference task operation entry.

[0007] Based on the task status information of each first task operation in the task operation path, the attribution and localization result of the task operation path is determined. The attribution and localization result of the task operation path is used to characterize the task operation entry corresponding to the first task operation in the task operation path that can drive the completion of the task.

[0008] Secondly, embodiments of this disclosure also provide a task detection device, the device comprising:

[0009] The first determining module is used to determine the first task operation in the task operation path and to determine the attribution logic information of the first task operation. The attribution logic information of the first task operation is used to indicate at least one task function instruction to be used for attribution processing of the first task operation. Each task function instruction indicated by the attribution logic information of the first task operation has a one-to-one correspondence with each sub-process operation in the attribution processing flow of the first task operation.

[0010] The second determining module is used to determine the task status information of the first task operation based on the attribution logic information of the first task operation. The task status information of the first task operation is used to record whether the task operation entry corresponding to the first task operation belongs to the reference task operation entry.

[0011] The third determining module is used to determine the attribution and localization result of the task operation path based on the task status information of each first task operation in the task operation path. The attribution and localization result of the task operation path is used to characterize the task operation entry corresponding to the first task operation in the task operation path that can drive the task to be completed.

[0012] Thirdly, this disclosure also provides an electronic device, the electronic device comprising:

[0013] At least one processor; and

[0014] A memory communicatively connected to the at least one processor; wherein,

[0015] The memory stores a computer program that can be executed by the at least one processor, which enables the at least one processor to perform the task detection method described in any of the above embodiments.

[0016] Fourthly, this disclosure also provides a computer-readable medium storing computer instructions that cause a processor to execute the task detection method described in any of the above embodiments.

[0017] The technical solution of this disclosure embodiment uses attribution logic information of a first task operation to indicate at least one task function instruction to be used for attribution processing of the first task operation. Each task function instruction indicated by the attribution logic information of the first task operation has a one-to-one correspondence with each sub-process operation in the attribution processing flow of the first task operation. This allows for a clear understanding of the sub-process operation to be completed by each task function instruction. A concise flowchart of the attribution processing flow ensures the logical relationship between the various task function instructions used in the attribution logic. The good readability of the flowchart effectively avoids problems caused by non-standard programming methods and project issues for attribution logic code developers. The lack of comments and maintenance documentation can lead to the gradual unmaintainability of attribution logic code. In complex task execution scenarios, multiple task operations are often involved. By determining whether the task operation entry point corresponding to the first task operation belongs to the reference task operation entry point, we can accurately identify the task operation entry point corresponding to the first task operation that can truly drive the task completion in the task operation path. This allows us to focus resources and efforts on these key task operations, thereby optimizing key task operations, adjusting task function instructions or sub-process operations, improving the efficiency and quality of task execution, avoiding wasting resources on unimportant task operation links, and improving resource utilization efficiency.

[0018] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of this disclosure, nor is it intended to limit the scope of this disclosure. Other features of this disclosure will become readily apparent from the following description. Attached Figure Description

[0019] The above and other features, advantages, and aspects of the embodiments of this disclosure will become more apparent from the accompanying drawings and the following detailed description. Throughout the drawings, the same or similar reference numerals denote the same or similar elements. It should be understood that the drawings are schematic, and the originals and elements are not necessarily drawn to scale.

[0020] Figure 1 This is a schematic flowchart of a task detection method provided in an embodiment of this disclosure;

[0021] Figure 2 This is a schematic diagram of another task detection process provided in an embodiment of this disclosure;

[0022] Figure 3 This is a schematic diagram of another task detection process provided in an embodiment of this disclosure;

[0023] Figure 4 This is a schematic diagram of another task detection process provided in this disclosure, in which the attribution engine reads task function instructions.

[0024] Figure 5 This is a schematic diagram of the structure of a task detection device provided in an embodiment of this disclosure;

[0025] Figure 6 This is a schematic diagram of the structure of an electronic device that implements a task detection method according to an embodiment of this disclosure. Detailed Implementation

[0026] Embodiments of this disclosure will now be described in more detail with reference to the accompanying drawings. While some embodiments of this disclosure are shown in the drawings, it should be understood that this disclosure can be implemented in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided to provide a more thorough and complete understanding of this disclosure. It should be understood that the accompanying drawings and embodiments of this disclosure are for illustrative purposes only and are not intended to limit the scope of protection of this disclosure.

[0027] It should be understood that the steps described in the method embodiments of this disclosure may be performed in different orders and / or in parallel. Furthermore, the method embodiments may include additional steps and / or omit the steps shown. The scope of this disclosure is not limited in this respect.

[0028] The term "comprising" and its variations as used herein are open-ended inclusions, meaning "including but not limited to". The term "based on" means "at least partially based on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". Definitions of other terms will be given in the description below.

[0029] It should be noted that the concepts of "first" and "second" mentioned in this disclosure are used only to distinguish different devices, modules or units, and are not used to limit the order of functions performed by these devices, modules or units or their interdependencies.

[0030] It should be noted that the terms "a" and "a plurality of" used in this disclosure are illustrative rather than restrictive, and those skilled in the art should understand that, unless otherwise expressly indicated in the context, they should be understood as "one or more".

[0031] The names of messages or information exchanged between multiple devices in the embodiments of this disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.

[0032] Figure 1This is a flowchart illustrating a task detection method provided in an embodiment of the present disclosure. This embodiment is applicable to situations where multiple task operations involved in a task operation path are attributed to determine the key task operations. The task detection method can be executed by a task detection device, which can be implemented in software and / or hardware and is generally integrated into any electronic device with network communication capabilities, such as a mobile terminal, PC, or server.

[0033] like Figure 1 As shown, the task detection method of this disclosure embodiment may include the following process:

[0034] S110. Determine the first task operation in the task operation path and determine the attribution logic information of the first task operation. The attribution logic information of the first task operation is used to indicate at least one task function instruction to be used for attribution processing of the first task operation. Each task function instruction indicated by the attribution logic information of the first task operation has a one-to-one correspondence with each sub-process operation in the attribution processing flow of the first task operation.

[0035] In one example, this disclosed solution can be applied to an order processing task scenario. In an order processing task, the operation path involves tasks such as order creation, payment confirmation, inventory check, and shipment arrangement. It is necessary to identify the order processing task operations that can play a key role in order completion from the order processing task operation path.

[0036] In another example, this disclosed solution can also be applied to traffic allocation task scenarios. In traffic allocation tasks, the operation path involves tasks such as traffic introduction from different channels and targeted traffic distribution. It is necessary to identify the traffic allocation task operations that play a crucial role in completing the traffic allocation. Of course, it can also be applied to scenarios other than order processing tasks and traffic allocation tasks, where multiple task operations are involved, thus requiring the identification of key task operations.

[0037] A task operation path refers to the trajectory or route formed by a series of operational steps and their sequential order required to complete a task. It details the various task operation stages from the initial task operation to the final completion, as well as the logical relationships between these operations. Taking online shopping as an example, the task operation path might include: opening a shopping website or application, searching for items, browsing item details, selecting item specifications and quantity, adding items to the cart, proceeding to the checkout page, filling in the shipping address, selecting a payment method, and completing the payment. Each task operation is a node on the task operation path; these nodes, connected in a specific order, form the operation path for completing the shopping task.

[0038] The attribution logic information of the first task operation records several instruction function commands required for the attribution processing of the first task operation. Each instruction function can be code that specifically executes the attribution processing operation or an abstract representation of the operation steps, and each instruction function has a specific function. The attribution processing flow of the first task operation can be decomposed into multiple sub-flow operations. There is a one-to-one correspondence between each instruction function indicated by the attribution logic information of the first task operation and each sub-flow operation included in the attribution processing flow of the first task operation, meaning that each sub-flow operation has a dedicated instruction function responsible for its execution. For example, in the attribution processing flow of a successful e-commerce order payment, the "browsing items sub-flow" corresponds to the "page browsing history extraction instruction function," and the "selecting items sub-flow" corresponds to the "item click data analysis instruction function," etc.

[0039] The attribution logic information of the first task operation describes the magnitude of the driving force provided by the first task operation relative to other task operations in the task operation path during the attribution process. In real-world business scenarios, when it is necessary to determine whether the first task operation is the primary cause of task completion, this attribution logic information can be used for detection. For example, in an e-commerce order processing flow, taking the "order payment successful" task operation as the first task operation, the attribution logic information of the first task operation can be used to detect whether the "order payment successful" task operation is a core reason for ensuring the completion of this order.

[0040] Because there is a one-to-one correspondence between each task function instruction of the first task operation and each sub-process operation involved in the first task operation, the entire attribution process is hierarchically distinct and clearly structured. This allows for a clear understanding of the role of each sub-process operation and the collaborative relationships between them, facilitating process optimization, maintenance, and management, and avoiding confusion and errors in the attribution process. Furthermore, since the attribution logic information of the first task operation explicitly indicates at least one task function instruction, the attribution process has precise guidance. It allows for analysis of the first task operation according to established rules and methods, accurately identifying the causes that led to the task operation and improving the accuracy of attribution.

[0041] S120. Based on the attribution logic information of the first task operation, determine the task status information of the first task operation. The task status information of the first task operation is used to record whether the task operation entry corresponding to the first task operation belongs to the reference task operation entry.

[0042] The task status information for the first task operation records whether the corresponding task operation entry point belongs to the reference task operation entry point. This can be a simple Boolean value (whether it belongs to the reference task operation entry point) or a status identifier with more detailed information, such as recording the degree of matching between the task operation entry point and the reference task operation entry point. A task operation entry point can refer to the location or path within a system, platform, or process where a task operation can be entered and started; it is the interaction interface or trigger point between the task processing function and the user. Task operation entry points can be represented as menu options, buttons, icons, or specific task operation entry points.

[0043] Reference task operation entry points can be pre-defined task operation entry points used as reference standards. These reference task operation entry points can be pre-configured task operation entry points corresponding to task operations that are identified as playing a key role in the execution of a series of task operations. If the task operation entry point corresponding to the first task operation belongs to a reference task operation entry point, it indicates that the first task operation is the core driving force for promoting the completion progress of the task in the task operation path. In this case, it is necessary to record the reference task operation entry point to which the first task operation belongs. This means that by attributing the first task operation, it is possible to accurately identify whether the first task operation belongs to the key task operation that continuously moves the task towards completion in the entire task operation path, and further clarify the corresponding task operation entry point.

[0044] Optionally, determining the task status information of the first task operation based on its attribution logic information may include: performing attribution processing on the first task operation according to the various task function instructions indicated by the attribution logic information of the first task operation; determining the matching degree between the task operation entry corresponding to the first task operation and the reference task operation entry by performing attribution processing on the first task operation; and then determining the task status information of the first task operation based on the matching degree between the task operation entry corresponding to the first task operation and the reference task operation entry. Specifically, if the matching degree between the task operation entry corresponding to the first task operation and the reference task operation entry is greater than a preset matching degree, the task status information of the first task operation is marked as "yes," and the reference task operation entry to which the first task operation belongs is recorded; if the matching degree between the task operation entry corresponding to the first task operation and the reference task operation entry is not greater than the preset matching degree, the task status information of the first task operation is marked as "no."

[0045] Optionally, after determining the task status information of the first task operation, the method further includes: recording the determined task status information of the first task operation and storing it in the corresponding database or data storage system to ensure the traceability of the task status information of the first task operation and the availability of subsequent analysis.

[0046] Optionally, the attribution processing flow of the first task operation can be decomposed into multiple sub-process operations. The nodes corresponding to each sub-process operation can include at least one of the following types of nodes: start node, judgment node, storage node, and control node. The attribution processing flow of the first task operation can be composed of multiple sub-process operations and the execution order between the sub-process operations. Each sub-process operation has its specific role and purpose. From the overall perspective, the flowchart corresponding to the attribution processing flow of the first task operation belongs to a directed acyclic graph.

[0047] The attribution logic is structured as follows: **Start Node:** Defines the starting position of a loop. Each sub-process operation within a task operation starts from the start node and continues until the node corresponding to the "next sub-process operation" or the node indicating "stop iteration, return to result table". **Decision Node:** Defines nodes that need to determine "yes" or "no" in the attribution logic. These nodes determine whether the entry point for each task operation in the task operation path belongs to a reference task operation entry point. Different logic is executed based on the "yes" or "no" result. **Storage Node:** Defines nodes that need to store temporary result values ​​in the attribution logic. These nodes store the reference task operation entry point to which each task operation in the task operation path belongs. **Control Node:** Defines nodes that need to change the loop process in the attribution logic. For example, "stop iteration, return to result table" is similar to the `return` statement in C, while "next task operation" is similar to the `continue` statement in C. Combining these four types of nodes defines a complete attribution logic.

[0048] S130. Based on the task status information of each first task operation in the task operation path, determine the attribution and localization result of the task operation path. The attribution and localization result of the task operation path is used to characterize the task operation entry corresponding to the first task operation in the task operation path that can drive the completion of the task.

[0049] The attribution and localization results of task operation paths are used to characterize the task operation entry point corresponding to the first task operation in the task operation path that has a decisive impact on task completion, directly affects the success or failure of the task, and plays a core driving role in the task achievement process. Taking the order processing flow of an e-commerce platform as an example, from placing an order, accepting the order, shipping the goods, logistics and delivery, to finally confirming receipt, in this long task operation path, the attribution and localization results can accurately identify the key links that have a decisive impact on the smooth completion of the order. For example, the timely and accurate order acceptance operation by the merchant may effectively avoid order delays and ensure the smooth progress of subsequent processes. The attribution and localization results of task operation paths are used to clearly present the task operation entry point corresponding to the first task operation in the task operation path that plays a core driving role in promoting the progress of task completion. This means that by attributing and localizing each task operation, it is possible to accurately identify which key task operations in the entire task process continuously advance the task towards completion and further clarify their corresponding operation entry points.

[0050] The technical solution of this disclosure embodiment uses attribution logic information of a first task operation to indicate at least one task function instruction to be used for attribution processing of the first task operation. Each task function instruction indicated by the attribution logic information of the first task operation has a one-to-one correspondence with each sub-process operation in the attribution processing flow of the first task operation. This allows for a clear understanding of the sub-process operation to be completed by each task function instruction. A concise flowchart of the attribution processing flow ensures the logical relationship between the various task function instructions used in the attribution logic. The good readability of the flowchart effectively avoids problems caused by non-standard programming methods and project issues for attribution logic code developers. The lack of comments and maintenance documentation can lead to the gradual unmaintainability of attribution logic code. In complex task execution scenarios, multiple task operations are often involved. By determining whether the task operation entry point corresponding to the first task operation belongs to the reference task operation entry point, we can accurately identify the task operation entry point corresponding to the first task operation that can truly drive the task completion in the task operation path. This allows us to focus resources and efforts on these key task operations, thereby optimizing key task operations, adjusting task function instructions or sub-process operations, improving the efficiency and quality of task execution, avoiding wasting resources on unimportant task operation links, and improving resource utilization efficiency.

[0051] Figure 2 This is a flowchart illustrating another task detection method provided in this embodiment. The technical solution of this embodiment further optimizes the process of determining the first task operation in the task operation path in the above embodiments based on the technical solutions of the above embodiments. This embodiment can be combined with various optional solutions in one or more of the above embodiments.

[0052] like Figure 2 As shown, the task detection method of this disclosure embodiment may include the following process:

[0053] S210. Display at least one attribution mode configuration item related to the task operation path, wherein the at least one attribution mode configuration item includes at least one of the following types of attribution modes: first attribution mode and last attribution mode.

[0054] A task operation path can be a series of ordered task operations that need to be performed to complete a task, with each task operation being an operation point in the task completion process. For example, in the e-commerce ordering process, the series of task operations from browsing items, adding items to the shopping cart, checking out, selecting a payment method, to finally completing the payment can constitute a task operation path.

[0055] For individual task operations requiring attribution processing, there is often a large amount of repetitive logic. For example, most attribution logic is developed using a "last attribution" or "first attribution" pattern, differing only in logical details. This necessitates developing a significant amount of duplicate code. To address this, configuration options for attribution modes within the task operation path can be used to determine how attribution analysis is performed on the task operations. Different attribution modes will perform attribution processing on each task operation within the path according to different execution orders.

[0056] Optionally, displaying at least one attribution pattern configuration item related to the task operation path includes: reading available attribution pattern information related to the task operation path from a configuration file or database, including the relevant definitions and parameters of the first and last attribution patterns; and displaying the obtained attribution pattern information related to the task operation path on the interface in a visual manner; for example, components such as drop-down menus and radio button groups can be used to clearly present and provide selection of different attribution pattern configuration items.

[0057] S220. In response to the selection operation for an attribution mode configuration item, perform a traversal operation on a series of task operations included in the task operation path according to the traversal order associated with the selected attribution mode, and determine the first task operation that needs to be attributed in each round of traversal from the task operation path during each round of traversal.

[0058] Optionally, the selection operation of at least one attribution mode configuration item in attribution mode configuration items is detected in real time. Once a selection operation of an attribution mode configuration item is detected, the selection operation event of the attribution mode configuration item is immediately captured. Then, according to the traversal order associated with the selected attribution mode, the series of task operations in the task operation path is traversed. If it is the first attribution mode, the traversal can start from the task operation corresponding to the beginning of the series of task operations included in the operation path and traverse from smallest to largest in chronological order. If it is the last attribution mode, the traversal can start from the task operation corresponding to the end of the series of task operations included in the operation path and traverse from largest to smallest in chronological order. When traversing each task operation included in the operation path, it is determined whether the task operation meets the criteria of being the first task operation to be attributed in the current traversal, according to preset rules and conditions.

[0059] With built-in "first attribution" and "last attribution" traversal logic, the attribution mode can be directly set, eliminating the need for repetitive code development. A simple configuration is all that's required: select the desired attribution mode ("first attribution" or "last attribution"), and the built-in logic will execute the corresponding attribution analysis. This significantly saves time and effort in attribution processing, improves work efficiency, and lowers the technical barrier. Even non-professional programmers can easily use these two attribution modes for attribution analysis. Furthermore, different attribution modes can be selected based on specific needs and business scenarios to meet diverse attribution analysis requirements. At different stages and for different business objectives, the first or last attribution mode can be used to deeply analyze the impact of each step in the business process on the final result.

[0060] S230. Determine the attribution logic information of the first task operation. The attribution logic information of the first task operation is used to indicate at least one task function instruction to be used for attribution processing of the first task operation. Each task function instruction indicated by the attribution logic information of the first task operation has a one-to-one correspondence with each sub-process operation in the attribution processing flow of the first task operation.

[0061] The attribution logic information of the first task operation is formed by combining one or more task function instructions. Each task function instruction can correspond one-to-one with each sub-process operation in the attribution processing flow of the first task operation, ensuring that the task function instructions involved in the first task operation and each sub-process operation in the attribution processing flow of the first task operation can be efficiently converted to each other, that is, ensuring the clarity, operability and efficient conversion between the two logics.

[0062] Optionally, determining the attribution logic information of the first task operation includes: pre-decomposing the attribution processing flow of the first task operation into multiple sub-process operations, such as order processing attribution processing flow being divided into order creation, payment confirmation, and shipping arrangement sub-process operations, and then matching task function instructions to each sub-process operation, recording the corresponding relationship through a configuration file (such as JSON format) or a database. Once the first task operation is determined, the task function instructions required for the first task operation are searched from the sub-process operation matching task function instructions according to preset matching rules to form the attribution logic information of the first task operation.

[0063] Optionally, the attribution logic information for the first task operation uses son as the basic writing format, and mainly consists of the following parts: basic_info represents the basic information of an attribution logic strategy; node represents the configuration information of the sub-process operation node in the attribution processing flow of the first task operation; it is divided into three types: io_conf represents the information of configuring the sub-process operation node; control_conf represents the information of the control node; cond represents the configuration information of the judgment node; root represents the execution order of the node, that is, the arrangement of the node in the attribution flowchart, which is a multi-way tree, and in actual execution, it is executed in the order of preorder traversal.

[0064] As an optional but not limited implementation, the attribution logic information for the first task operation is determined, including but not limited to the following steps A1-A2:

[0065] Step A1: Determine the attribution processing flow of the first task operation based on the task type of the first task operation. The attribution processing flow of the first task operation is formed by the orderly arrangement of several sub-process operations. The several sub-process operations are the sub-process operations corresponding to the executable logic required for attribution analysis of the first task operation.

[0066] Step A3: Determine the task function instruction of the first task operation from the preset instruction configuration information according to the attribution processing flow of the first task operation. The preset instruction configuration information pre-configures several task function instructions corresponding to each sub-process operation. Each task function instruction of the first task operation is used to drive the sub-process operation corresponding to each task function instruction in the attribution processing flow of the first task operation. The task function instruction corresponding to each sub-process operation is generated by encapsulating the metadata of the executable logic covered by the sub-process operation in the form of instructions.

[0067] The first task operation is categorized based on its nature, objectives, and operational characteristics. Examples include data processing tasks, file transfer tasks, and authentication tasks. Different task types have different attribution processing flows and requirements. The attribution processing flow for a first task operation is a series of ordered operational steps designed to perform attribution processing on that operation. Sub-processes within the attribution processing flow can be components of the overall attribution processing flow, each representing a specific executable logic required for attribution processing of the first task operation.

[0068] The preset instruction configuration information can be a pre-stored database of information on the correspondence between sub-process operations and task function instructions, recording the task function instructions corresponding to various sub-process operations. Task function instructions can be specific instructions that implement the function of a sub-process operation; they can be a piece of code, a function call, or a system command, etc. Each task function instruction is used to drive the execution of the corresponding sub-process operation to complete a specific attribution processing task. The definition of the task function instructions stored in the preset instruction configuration information can be as follows: Each task function instruction includes the following attributes: namespace, command, data_type, value_type, and params. Here, namespace indicates the range of data that the task function instruction can read and write; strategy indicates that only variables within the loop body to which the task function instruction applies can be read and written; task indicates that variables outside the loop body to which the task function instruction applies can be read and written (similar to global variables); command indicates the type of task function instruction; data_type indicates the input parameter type of the task function instruction operation; value_type indicates the return value type of the task function instruction; and params indicates parameters unique to the task function instruction.

[0069] The execution order of each task function instruction in the first task operation is configured in flowchart form according to the attribution processing flow of the first task operation. The flowchart of the attribution processing flow of the first task operation is a visual representation of the attribution execution logic, clearly showing the sequence, dependencies, and branching logic among the various task function instructions of the first task operation. In the flowchart of the attribution processing flow of the first task operation, each task function instruction corresponds to a sub-process operation in a specific attribution processing flow of the first task operation. The sub-process operations are connected by directed edges, indicating the execution order of the task function instructions corresponding to each sub-process operation. This configuration method ensures the orderliness and logic of the attribution execution process, allowing the entire attribution process to proceed according to predetermined rules, avoiding confusion and errors.

[0070] The efficient conversion between task function instructions and attribution flowcharts is a key characteristic of attribution execution logic. It not only automatically transforms flowcharts designed according to business needs and logical rules into specific instruction sequences, enabling automated instruction execution through programming, but also allows the instruction sequence to be reversed and converted back into a flowchart when problems arise or adjustments are needed during task function instruction execution. This visually demonstrates the logical structure of the entire attribution execution process, facilitating problem analysis and optimization. This efficient conversion mechanism improves the development efficiency and accuracy of attribution execution logic, reduces maintenance costs, and makes the attribution process more scientific and reliable.

[0071] Optionally, the task type information of the first task operation is obtained. This can be obtained from the task definition, description, or related metadata. Based on the pre-defined mapping relationship between task types and attribution processing flows, the attribution processing flow of the first task operation is determined. Then, based on the attribution processing flow of the first task operation, the task function instruction corresponding to each sub-process operation is retrieved from the pre-defined instruction configuration information. The task function instruction corresponding to each sub-process operation is generated by encapsulating the metadata of the executable logic covered by the sub-process operation in the form of instructions. During the generation of the task function instruction corresponding to each sub-process operation, the metadata such as the input / output requirements, operation steps, and dependencies of the sub-process operation can be converted into computer-executable instructions.

[0072] By pre-setting the mapping relationship between instruction configuration information, task types, and attribution processing flow, the standardization and normalization of attribution analysis flow and instruction configuration are achieved. Different task operations can be analyzed according to unified rules, improving the maintainability and scalability of attribution logic. It can quickly and accurately determine the task function instructions corresponding to each sub-process operation, and rapidly initiate the corresponding operation based on these instructions, reducing time and resource waste during the analysis process. Furthermore, the clear correspondence between each sub-process operation and task function instructions ensures good traceability of the attribution processing process.

[0073] As an optional but not limited implementation, after determining the attribution logic information of the first task operation, the following steps B1-B2 are also included, but are not limited to:

[0074] Step B1: Display the sub-process operations corresponding to each task function instruction indicated by the attribution logic information of the first task operation. The sub-process operations corresponding to each task function instruction are visualized using graphical elements.

[0075] Step B2: In response to the adjustment operation of the graphical elements of the sub-process operation corresponding to the task function instruction, the attribution logic information of the first task operation is adjusted. The adjustment operation includes at least one of the following types of adjustments: adjusting the graphical elements of the sub-process operation and adjusting the execution order between the graphical elements of the sub-process operation.

[0076] Each task function instruction indicated by the attribution logic information of the first task operation represents a specific function or operation step of each sub-process operation in the attribution processing flow of the first task operation. Each sub-process operation in the attribution processing flow of the first task operation can be visualized using graphical elements. For example, graphical elements can be graphic symbols or objects used to visualize sub-process operations, such as a rectangle representing an operation step, an arrow indicating the order of operations, etc. The use of graphical elements makes complex task flows and logical relationships more intuitive and easier to understand.

[0077] Business attribution collaboration processes typically involve production, operations, data analytics, and data warehouses, with multiple parties participating in discussions. This often results in a massive volume of messages, high communication costs, and a high risk of errors. To address this, various modifications can be made to the graphical elements of the sub-processes corresponding to task function instructions. These modifications include changing the attributes of graphical elements (such as size, color, and position) and adjusting the execution order between them (such as advancing or delaying an operation step). This allows for adjustments to each sub-process operation within the attribution processing flow of the first task operation, further enabling adjustments to the attribution logic information of the first task operation. The user-friendly graphical attribution logic editing function ensures that even those without software programming knowledge can directly modify the attribution logic, shortening the entire attribution processing collaboration chain. In other words, complex and difficult-to-understand attribution logic can be expressed simply and efficiently in a graphical way. Furthermore, it provides interactive graphical modification functions for attribution logic, allowing even those without programming knowledge to quickly edit the desired attribution logic. This solution significantly reduces the collaboration costs of adjusting attribution logic among multiple parties.

[0078] Optionally, the sub-process operations corresponding to each task function instruction indicated in the attribution logic information of the first task operation are displayed, and each sub-process operation is visualized using graphical elements. This intuitively shows the specific operation steps of the sub-process operations corresponding to each function instruction during task execution, as well as the logical relationships between the sub-process operations. By visualizing the abstract task function instructions and sub-process operations into intuitive graphical displays, the readability and comprehensibility of the information are improved, helping to quickly understand the execution logic and process of the task, facilitating task analysis, planning, and management, and reducing the difficulty of understanding complex task operations.

[0079] Optionally, in response to adjustments to the graphical elements of the sub-process operations corresponding to the task function instructions, the attribution logic information of the first task operation is adjusted accordingly. The adjustments include two aspects: first, modifying the attributes (such as shape, color, size, etc.) of the graphical elements of the sub-process operations; second, changing the execution order between the graphical elements of the sub-process operations, such as dragging a graphical element representing an operation step to another position, thereby changing the order of the operation in the entire task flow. These adjustments are reflected in the attribution logic information of the first task operation in real time, ensuring that the attribution logic information remains consistent with the desired adjustments. This approach provides interactive capabilities with the task operation logic, allowing for flexible adjustments to the task execution logic based on actual needs, new business rules, or optimization ideas, enabling timely updates to the attribution logic information and ensuring the dynamic and adaptable nature of the task execution logic.

[0080] S240. Based on the attribution logic information of the first task operation, determine the task status information of the first task operation. The task status information of the first task operation is used to record whether the task operation entry corresponding to the first task operation belongs to the reference task operation entry.

[0081] S250. Based on the task status information of each first task operation in the task operation path, determine the attribution and localization result of the task operation path. The attribution and localization result of the task operation path is used to characterize the task operation entry corresponding to the first task operation in the task operation path that can drive the completion of the task.

[0082] Optionally, a multi-environment isolation scheme can be pre-developed and set up, dividing the system into a test environment and a production environment. After modifying the attribution logic, when using the attribution logic information from the first task operation for attribution processing, the changes can be debugged in the test environment first. Once it is confirmed that there are no problems, the modifications can be deployed to the production environment. Because a multi-environment isolation scheme has been specifically developed, it can be ensured that modifying the attribution logic in the test environment will not affect the production environment. The testing process can directly use the provided general testing tools, and there is no need to repeatedly package the attribution code, which can save a lot of manpower.

[0083] The technical solution of this disclosure embodiment uses attribution logic information of a first task operation to indicate at least one task function instruction to be used for attribution processing of the first task operation. Each task function instruction indicated by the attribution logic information of the first task operation has a one-to-one correspondence with each sub-process operation in the attribution processing flow of the first task operation. This allows for a clear understanding of the sub-process operation to be completed by each task function instruction. A concise flowchart of the attribution processing flow ensures the logical relationship between the various task function instructions used in the attribution logic. The good readability of the flowchart effectively avoids problems caused by non-standard programming methods and project issues for attribution logic code developers. The lack of comments and maintenance documentation can lead to the gradual unmaintainability of attribution logic code. In complex task execution scenarios, multiple task operations are often involved. By determining whether the task operation entry point corresponding to the first task operation belongs to the reference task operation entry point, we can accurately identify the task operation entry point corresponding to the first task operation that can truly drive the task completion in the task operation path. This allows us to focus resources and efforts on these key task operations, thereby optimizing key task operations, adjusting task function instructions or sub-process operations, improving the efficiency and quality of task execution, avoiding wasting resources on unimportant task operation links, and improving resource utilization efficiency.

[0084] Figure 3 This is a flowchart illustrating another task detection method provided in this embodiment. The technical solution of this embodiment further optimizes the process of determining the task status information of the first task operation based on the attribution logic information of the first task operation in the foregoing embodiments, based on the technical solution of the above embodiments. This embodiment can be combined with various optional solutions in one or more of the above embodiments.

[0085] like Figure 3 As shown, the task detection method of this disclosure embodiment may include the following process:

[0086] S310. Determine the first task operation in the task operation path and determine the attribution logic information of the first task operation. The attribution logic information of the first task operation is used to indicate at least one task function instruction to be used for attribution processing of the first task operation. Each task function instruction indicated by the attribution logic information of the first task operation has a one-to-one correspondence with each sub-process operation in the attribution processing flow of the first task operation.

[0087] S320. Load the task function instruction indicated by the attribution logic information of the first task operation into the attribution engine. The attribution engine can be used to execute the executable logic described by the task function instruction of the first task operation, and a virtual environment that does not depend on the underlying restart is constructed by encapsulation at the code layer.

[0088] An attribution engine can be a pre-designed and developed virtual machine capable of executing executable logic described by task function instructions written in a domain-specific language (DSL). The attribution engine not only has the ability to parse and run task function instructions, but also belongs to a virtual runtime environment built on top of the code layer through encapsulation. The attribution engine can efficiently execute various attribution-related tasks. At the same time, this attribution engine possesses sufficiently fast execution performance, enabling efficient operation even in big data scenarios. This means that the attribution engine can quickly respond and accurately execute tasks when processing massive amounts of data and complex attribution logic, meeting the stringent requirements for data processing speed and system performance in big data scenarios, and ensuring the stable and efficient operation of the entire system under large data volumes.

[0089] For example, an attribution engine can be a pre-developed virtual machine capable of executing task function instructions written in a domain-specific language (DSL), and belongs to a type of virtual runtime environment encapsulated on top of Java code to achieve hot reloading capability. The attribution engine is developed using Java code and is generally divided into four parts: a metadata loading module, a metadata caching module, a rule compilation module, and a rule execution module.

[0090] The attribution engine, as the core carrier for executing the DSL language, is responsible for parsing and running the task function instructions of the first task operation written in the DSL language. This enables the attribution processing flow of the first task operation to perform various sub-process operations according to the executable logic described by the task function instructions of the first task operation defined in the DSL language. By loading the various task function instructions indicated by the attribution logic information corresponding to the first task operation into the attribution engine, the attribution engine can execute the instructions according to the various task function instructions indicated by the attribution logic information corresponding to the first task operation.

[0091] The attribution engine operates on top of the code layer, creating a virtual environment that doesn't rely on underlying system restarts. By building this virtual environment, new task instructions can be loaded without restarting the underlying system, enabling hot reloading. In other words, when content in the virtual environment is replaced, new attribution logic is automatically applied without restarting the data warehouse streaming task. This significantly improves system flexibility and maintainability, avoiding the time costs, resource consumption, and potential business interruptions associated with task restarts during deployment and daily maintenance. Ultimately, it enhances system flexibility and operational efficiency while reducing the risks and time costs associated with task restarts.

[0092] S330. In the attribution engine, the task status information of the first task operation is determined based on the task function instruction indicated by the attribution logic information of the first task operation.

[0093] The task status information of the first task operation is used to record whether the task operation entry corresponding to the first task operation belongs to the reference task operation entry.

[0094] Optionally, determining the task status information of the first task operation based on the task function instructions indicated by the attribution logic information of the first task operation includes: parsing the task function instructions indicated by the attribution logic information of the first task operation; executing the executable logic corresponding to the task function instructions indicated by the attribution logic information of the first task operation in sequence according to the instruction order of the parsed task function instructions indicated by the attribution logic information of the first task operation; and determining the task status information of the first task operation based on the execution result of the task function instructions indicated by the attribution logic information of the first task operation.

[0095] As an optional but not limited implementation, the task status information of the first task operation is determined based on the task function instruction indicated by the attribution logic information of the first task operation, including but not limited to steps C1-C2:

[0096] Step C1: Based on the execution order of each sub-process operation in the attribution processing flow of the first task operation, read the task function instructions indicated by the attribution logic information of the first task operation one by one.

[0097] Step C2: Determine the task status information of the first task operation by sequentially executing the task function instructions of each sub-process operation read one by one.

[0098] First, the execution order of each sub-process operation within the attribution processing flow of the first task operation can be determined. This order can be based on business logic and data dependencies. For example, during order creation, login information must be verified first to ensure the login account is valid before subsequent operations such as item inventory checks and order number generation can proceed. Second, following the determined execution order of the sub-process operations within the attribution processing flow of the first task operation, the task function instructions corresponding to each sub-process operation are read sequentially. This may involve retrieving relevant instruction information from storage locations such as the file system, database, or configuration center.

[0099] The attribution engine is deployed in the data warehouse as a UDF in Hive or Flink. When the attribution engine is called by the upper-level big data task scheduling component (such as Spark or Flink), it takes the SQL query result as input parameter, executes the task function instruction indicated by the attribution logic information of the first task operation, and returns the query result of the data warehouse task.

[0100] The specific process can be as follows: The attribution engine kernel uses a von Neumann-like architecture. Each task function instruction indicated by the attribution logic information of the first task operation is read sequentially according to the execution order of each sub-process operation in the attribution processing flow of the first task operation, and then executed within the attribution engine. See also... Figure 4 In the attribution engine, each task function instruction indicated by the attribution logic information of the first task operation is read sequentially from the instruction list and executed. During the execution of each task function instruction indicated by the attribution logic information of the first task operation, the memory management module is read to obtain various types of data, and the execution results are returned.

[0101] As an optional but not limited implementation, before determining the task status information of the first task operation based on the task function instruction indicated by the attribution logic information of the first task operation, the following steps are included, but are not limited to:

[0102] Several reference task operation entry tags of the first task operation are loaded into the attribution engine. The reference task operation entry tags of the first task operation are tags of the reference task operation entry that participate in the attribution, which are pre-configured in the form of metadata.

[0103] Accordingly, by sequentially executing the task function instructions for each sub-process operation read one by one, the task status information of the first task operation is determined, including but not limited to the following steps D1-D2:

[0104] Step D1: By sequentially executing the task function instructions of each sub-process operation read one by one, check whether the task operation entry corresponding to the first task operation can be labeled with the reference task operation entry tag.

[0105] Step D2: Determine the task status information of the first task operation based on whether the task operation entry corresponding to the first task operation can be labeled with the reference task operation entry tag.

[0106] Before performing attribution analysis on the first task operation, several pre-configured reference task operation entry tags for the first task operation are also loaded into the attribution engine. Specifically, these tag information can be read from locations such as a database storing metadata, a file system, or a configuration center, and stored in a specific data structure of the attribution engine for later use. The attribution engine executes the task function instructions of each sub-process operation read sequentially, and during execution, it checks the task operation entry corresponding to the first task operation to determine whether it meets the characteristics and conditions of the reference task operation entry tags. Specifically, it compares the relevant information of the task operation entry corresponding to the first task operation (such as the entry URL, the called function name, and the passed parameters) with the information contained in the reference task operation entry tags. If the relevant information of the task operation entry corresponding to the first task operation matches the information of a reference task operation entry tag, then the task operation entry corresponding to the first task operation is considered to be tagged with that reference task operation entry tag.

[0107] The several reference task operation entry tags involved in the first task operation are all pre-configured as metadata tags for task operation entry points participating in the attribution analysis. As metadata, these reference task operation entry tags are structured and descriptive, accurately defining the key attributes and characteristics of the task operation entry points. Through this metadata configuration method, these reference task operation entry tags can be quickly and accurately identified and invoked during attribution processing, thereby enabling comprehensive and in-depth attribution processing of the first task operation.

[0108] By pre-configuring and loading reference task operation entry tags into the attribution engine as metadata, precise reference standards are provided for attribution analysis. These reference task operation entry tags are pre-defined based on rich business experience and data insights, covering the key attributes and characteristics of task operation entry points. When executing task function instructions for sub-process operations, a detailed comparison between the task operation entry point and the reference tags can accurately determine whether the task operation can be tagged with a reference task operation entry tag. Furthermore, configuring reference task operation entry tags in the form of metadata provides high flexibility and scalability in the face of business changes and requirement adjustments. When business rules or analysis requirements change, only the reference tags need to be modified or added at the metadata level, without large-scale modifications to the underlying code. The attribution engine can quickly adapt to changes based on new tag configurations, enabling effective analysis of task operations under different business scenarios.

[0109] As an optional but not limited implementation, detecting whether the task operation entry corresponding to the first task operation can be tagged with a reference task operation entry tag includes, but is not limited to, the following steps:

[0110] Starting from the end of the tag string of the task operation entry corresponding to the first task operation, the tag string of the task operation entry corresponding to the first task operation is gradually reduced and compared with the tag string of the reference task operation entry tag; based on the comparison result with the tag string of the reference task operation entry tag, it is determined whether the task operation entry corresponding to the first task operation can be tagged with the reference task operation entry tag.

[0111] Optionally, it checks whether the tag string of the task operation entry corresponding to the first task operation is the same as the tag string of the reference task operation entry tag. If they are the same, it determines that the task operation entry corresponding to the first task operation can be tagged with the reference task operation entry tag. If they are different, it deletes some characters from the tag string of the task operation entry corresponding to the first task operation and updates the tag string of the task operation entry corresponding to the first task operation. It then returns to continue checking whether the tag string of the task operation entry corresponding to the first task operation is the same as the tag string of the reference task operation entry tag. It iterates through the tags to determine whether the updated tag string of the task operation entry corresponding to the first task operation after partial character deletion is the same as the tag string of the reference task operation entry tag. If they are the same, it determines that the task operation entry corresponding to the first task operation can be tagged with the reference task operation entry tag. Typically, a loop structure is used, starting from the end or the beginning of the tag string of the task operation entry corresponding to the first task operation, deleting one or more characters in each iteration to generate a shortened string.

[0112] Optionally, by partially deleting the tag string of the task operation entry corresponding to the first task operation and comparing it with the tag string of the reference task operation entry tag, the method of continuously deleting strings to compare with the reference string can be called progressive string reduction comparison or string truncation comparison. Specifically, starting from the original tag string of the task operation entry corresponding to the first task operation, characters of the tag string of the task operation entry corresponding to the first task operation are gradually deleted to form a series of shortened substrings. Then, these substrings are compared with the given tag string of the reference task operation entry tag to determine whether there is a shortened substring that matches the tag string of the reference task operation entry tag or meets the preset conditions.

[0113] As an optional but not limited implementation, the task status information of the first task operation is determined based on whether the task operation entry point corresponding to the first task operation can be tagged with a reference task operation entry point. This includes: if the task operation entry point corresponding to the first task operation can be tagged with a reference task operation entry point, then the reference task operation entry point tag is stored and recorded, and the position of the first task operation tagged with the reference task operation entry point tag in the task operation path is stored and recorded. If the task operation entry point corresponding to the first task operation cannot be tagged with a reference task operation entry point tag, then the next task operation following the first task operation in the task operation path is determined as the new first task operation.

[0114] Considering the significant problem of relatively closed attribution logic, taking order and traffic attribution scenarios as examples, in actual use, only one order or traffic attribution result can be obtained, but the reason for this attribution result is unclear. In other words, when hoping to gain a deeper understanding of the underlying attribution reasons, it is found that there is a severe lack of necessary contextual information, and no clues to trace the derivation process of the result, making it extremely difficult and costly to investigate the rationality of the attribution results. Both time and manpower costs are significantly increased. By partially deleting the tag string of the task operation entry corresponding to the first task operation and comparing it with the tag string of the reference task operation entry, the specific process of obtaining the attribution result can be clearly displayed, i.e., why the task operation entry corresponding to the first task operation is tagged with the reference task operation entry.

[0115] S340. Based on the task status information of each first task operation in the task operation path, determine the attribution and localization result of the task operation path. The attribution and localization result of the task operation path is used to characterize the task operation entry corresponding to the first task operation in the task operation path that can drive the completion of the task.

[0116] The technical solution of this disclosure embodiment uses attribution logic information of a first task operation to indicate at least one task function instruction to be used for attribution processing of the first task operation. Each task function instruction indicated by the attribution logic information of the first task operation has a one-to-one correspondence with each sub-process operation in the attribution processing flow of the first task operation. This allows for a clear understanding of the sub-process operation to be completed by each task function instruction. A concise flowchart of the attribution processing flow ensures the logical relationship between the various task function instructions used in the attribution logic. The good readability of the flowchart effectively avoids problems caused by non-standard programming methods and project issues for attribution logic code developers. The lack of comments and maintenance documentation can lead to the gradual unmaintainability of attribution logic code. In complex task execution scenarios, multiple task operations are often involved. By determining whether the task operation entry point corresponding to the first task operation belongs to the reference task operation entry point, we can accurately identify the task operation entry point corresponding to the first task operation that can truly drive the task completion in the task operation path. This allows us to focus resources and efforts on these key task operations, thereby optimizing key task operations, adjusting task function instructions or sub-process operations, improving the efficiency and quality of task execution, avoiding wasting resources on unimportant task operation links, and improving resource utilization efficiency.

[0117] Figure 5 This is a schematic diagram of a task detection device provided in an embodiment of the present disclosure. The embodiments of the present disclosure are applicable to situations where multiple task operations involved in a task operation path are attributed to determine the key task operations. The task detection device can be implemented in the form of software and / or hardware, and is generally integrated on any electronic device with network communication function, such as a mobile terminal, PC, or server.

[0118] like Figure 5 As shown, the task detection apparatus of this disclosure embodiment may include the following:

[0119] The first determining module 710 is used to determine the first task operation in the task operation path and to determine the attribution logic information of the first task operation. The attribution logic information of the first task operation is used to indicate at least one task function instruction to be used for attribution processing of the first task operation. Each task function instruction indicated by the attribution logic information of the first task operation has a one-to-one correspondence with each sub-process operation in the attribution processing flow of the first task operation.

[0120] The second determining module 720 is used to determine the task status information of the first task operation based on the attribution logic information of the first task operation. The task status information of the first task operation is used to record whether the task operation entry corresponding to the first task operation belongs to the reference task operation entry.

[0121] The third determining module 730 is used to determine the attribution and localization result of the task operation path based on the task status information of each first task operation in the task operation path. The attribution and localization result of the task operation path is used to characterize the task operation entry corresponding to the first task operation in the task operation path that can drive the task to be completed.

[0122] Based on the above embodiments, optionally, determining the first task operation in the task operation path includes:

[0123] Display at least one attribution mode configuration item related to the task operation path, the at least one attribution mode configuration item including at least one of the following types of attribution modes: first attribution mode and last attribution mode;

[0124] In response to the selection operation for an attribution mode configuration item, the traversal operation is performed on a series of task operations included in the task operation path according to the traversal order associated with the selected attribution mode, and the first task operation to be attributed in each round of traversal is determined from the task operation path during each round of traversal.

[0125] Based on the above embodiments, optionally, determining the attribution logic information of the first task operation includes:

[0126] The attribution processing flow of the first task operation is determined according to the task type of the first task operation. The attribution processing flow of the first task operation is formed by an orderly arrangement of several sub-process operations. The several sub-process operations are the sub-process operations corresponding to the executable logic required for attribution analysis of the first task operation.

[0127] The task function instruction of the first task operation is determined from the preset instruction configuration information according to the attribution processing flow of the first task operation. The preset instruction configuration information pre-configures a number of task function instructions corresponding to each sub-process operation. Each task function instruction of the first task operation is used to drive the implementation of the sub-process operation corresponding to each task function instruction in the attribution processing flow of the first task operation. The task function instruction corresponding to each sub-process operation is generated by encapsulating the metadata of the executable logic covered by the sub-process operation in the form of instructions.

[0128] Based on the above embodiments, optionally, determining the task status information of the first task operation according to the attribution logic information of the first task operation includes:

[0129] The task function instruction indicated by the attribution logic information of the first task operation is loaded into the attribution engine. The attribution engine can be used to execute the executable logic described by the task function instruction of the first task operation, and a virtual environment that does not depend on the underlying restart is constructed by encapsulation at the code layer.

[0130] In the attribution engine, the task status information of the first task operation is determined based on the task function instructions indicated by the attribution logic information of the first task operation.

[0131] Based on the above embodiments, optionally, determining the task status information of the first task operation based on the task function instruction indicated by the attribution logic information of the first task operation includes:

[0132] Based on the execution order of each sub-process operation in the attribution processing flow of the first task operation, the task function instructions indicated by the attribution logic information of the first task operation are read one by one.

[0133] The task status information of the first task operation is determined by sequentially executing the task function instructions of each sub-process operation read one by one.

[0134] Optionally, based on the above embodiments, before determining the task status information of the first task operation based on the task function instruction indicated by the attribution logic information of the first task operation, the method further includes:

[0135] Several reference task operation entry tags of the first task operation are loaded into the attribution engine. The reference task operation entry tags of the first task operation are tags of reference task operation entry points that participate in attribution and are pre-configured in the form of metadata.

[0136] Accordingly, by sequentially executing the task function instructions for each sub-process operation read one by one, the task status information of the first task operation is determined, including:

[0137] By sequentially executing the task function instructions of each sub-process operation read one by one, it is detected whether the task operation entry corresponding to the first task operation can be labeled with the reference task operation entry tag.

[0138] Based on whether the task operation entry corresponding to the first task operation can be tagged with a reference task operation entry label, the task status information of the first task operation is determined.

[0139] Based on the above embodiments, optionally, detecting whether the task operation entry corresponding to the first task operation can be tagged with a reference task operation entry label includes:

[0140] Starting from the end of the tag string of the task operation entry corresponding to the first task operation, the tag string of the task operation entry corresponding to the first task operation is gradually reduced and compared with the tag string of the reference task operation entry tag;

[0141] Based on the comparison result with the tag string of the reference task operation entry tag, determine whether the task operation entry corresponding to the first task operation can be tagged with the reference task operation entry tag.

[0142] Based on the above embodiments, optionally, the task status information of the first task operation is determined based on whether the task operation entry corresponding to the first task operation can be tagged with a reference task operation entry label, including:

[0143] If the task operation entry corresponding to the first task operation can be tagged with a reference task operation entry tag, then the reference task operation entry tag is stored and recorded, and the position of the first task operation tagged with the reference task operation entry tag in the task operation path is stored and recorded.

[0144] If the task operation entry corresponding to the first task operation cannot be tagged with a reference task operation entry, then the next task operation in the task operation path after the first task operation will be determined as the new first task operation.

[0145] Optionally, based on the above embodiments, after determining the attribution logic information of the first task operation, the method further includes:

[0146] The sub-process operations corresponding to each task function instruction indicated by the attribution logic information of the first task operation are displayed, and the sub-process operations corresponding to each task function instruction are visualized using graphic elements.

[0147] In response to the adjustment operation of the graphical elements of the sub-process operation corresponding to the task function instruction, the attribution logic information of the first task operation is adjusted. The adjustment operation includes at least one of the following types of adjustments: adjusting the graphical elements of the sub-process operation and adjusting the execution order between the graphical elements of the sub-process operation.

[0148] The technical solution of this disclosure embodiment uses attribution logic information of a first task operation to indicate at least one task function instruction to be used for attribution processing of the first task operation. Each task function instruction indicated by the attribution logic information of the first task operation has a one-to-one correspondence with each sub-process operation in the attribution processing flow of the first task operation. This allows for a clear understanding of the sub-process operation to be completed by each task function instruction. A concise flowchart of the attribution processing flow ensures the logical relationship between the various task function instructions used in the attribution logic. The good readability of the flowchart effectively avoids problems caused by non-standard programming methods and project issues for attribution logic code developers. The lack of comments and maintenance documentation can lead to the gradual unmaintainability of attribution logic code. In complex task execution scenarios, multiple task operations are often involved. By determining whether the task operation entry point corresponding to the first task operation belongs to the reference task operation entry point, we can accurately identify the task operation entry point corresponding to the first task operation that can truly drive the task completion in the task operation path. This allows us to focus resources and efforts on these key task operations, thereby optimizing key task operations, adjusting task function instructions or sub-process operations, improving the efficiency and quality of task execution, avoiding wasting resources on unimportant task operation links, and improving resource utilization efficiency.

[0149] The task detection device provided in this disclosure can execute the task detection method provided in any embodiment of this disclosure, and has the corresponding functional modules and beneficial effects for executing the task detection method.

[0150] It is worth noting that the various units and modules included in the above-mentioned device are only divided according to functional logic, but are not limited to the above division, as long as the corresponding functions can be realized; in addition, the specific names of each functional unit are only for easy differentiation and are not used to limit the protection scope of the embodiments of this disclosure.

[0151] Figure 6 This is a schematic diagram of the structure of an electronic device that implements a task detection method according to an embodiment of this disclosure. Refer to the following... Figure 6 It illustrates an electronic device suitable for implementing embodiments of the present disclosure (e.g., Figure 6 The diagram below shows the structure of the terminal device or server 800. The terminal device in this embodiment may include, but is not limited to, mobile terminals such as mobile phones, laptops, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), and vehicle terminals (e.g., vehicle navigation terminals), as well as fixed terminals such as digital TVs and desktop computers. Figure 6 The electronic device shown is merely an example and should not be construed as limiting the functionality and scope of the embodiments disclosed herein.

[0152] like Figure 6 As shown, the electronic device 800 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 801, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 802 or a program loaded from a storage device 808 into a random access memory (RAM) 803. The RAM 803 also stores various programs and data required for the operation of the electronic device 800. The processing device 801, ROM 802, and RAM 803 are interconnected via a bus 804. An edit / output (I / O) interface 805 is also connected to the bus 804.

[0153] Typically, the following devices can be connected to I / O interface 805: input devices 806 including, for example, touchscreens, touchpads, keyboards, mice, cameras, microphones, accelerometers, gyroscopes, etc.; output devices 807 including, for example, liquid crystal displays (LCDs), speakers, vibrators, etc.; storage devices 808 including, for example, magnetic tapes, hard disks, etc.; and communication devices 809. Communication device 809 allows electronic device 800 to communicate wirelessly or wiredly with other devices to exchange data. Although Figure 6 An electronic device 800 with various devices is shown; however, it should be understood that it is not required to implement or possess all of the devices shown. More or fewer devices may be implemented or possessed alternatively.

[0154] In particular, according to embodiments of this disclosure, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments of this disclosure include a computer program product comprising a computer program carried on a non-transitory computer-readable medium, the computer program containing program code for performing the task detection method shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via a communication device 809, or installed from a storage device 808, or installed from a ROM 802. When the computer program is executed by a processing device 801, it performs the functions defined in the task detection method of the embodiments of this disclosure.

[0155] The names of messages or information exchanged between multiple devices in the embodiments of this disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.

[0156] The electronic device provided in this embodiment and the task detection method provided in the above embodiments belong to the same inventive concept. Technical details not described in detail in this embodiment can be found in the above embodiments, and this embodiment has the same beneficial effects as the above embodiments.

[0157] This disclosure provides a computer storage medium storing a computer program that, when executed by a processor, implements the task detection method provided in the above embodiments.

[0158] It should be noted that the computer-readable medium described in this disclosure can be a computer-readable signal medium or a computer-readable storage medium, or any combination thereof. A computer-readable storage medium can be, for example,—but not limited to—an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of a computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof. In this disclosure, a computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in connection with an instruction execution system, apparatus, or device. In this disclosure, a computer-readable signal medium can include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium can be any computer-readable medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium can be transmitted using any suitable medium, including but not limited to: wires, optical fibers, RF (radio frequency), etc., or any suitable combination thereof.

[0159] In some implementations, clients and servers can communicate using any currently known or future-developed network protocol such as HTTP (Hypertext Transfer Protocol) and can interconnect with digital data communication (e.g., communication networks) of any form or medium. Examples of communication networks include local area networks (“LANs”), wide area networks (“WANs”), the Internet (e.g., the Internet of Things), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future-developed networks.

[0160] The aforementioned computer-readable medium may be included in the aforementioned electronic device; or it may exist independently and not assembled into the electronic device.

[0161] The aforementioned computer-readable medium carries one or more programs. When the electronic device executes the aforementioned one or more programs, the electronic device causes the following to occur: First, a first task operation in a task operation path and attribution logic information for the first task operation. The attribution logic information for the first task operation indicates at least one task function instruction to be used for attribution processing of the first task operation. Each task function instruction indicated by the attribution logic information for the first task operation corresponds one-to-one with each sub-process operation in the attribution processing flow of the first task operation. Second, based on the attribution logic information for the first task operation, the electronic device determines task status information for the first task operation. The task status information for the first task operation is used to record whether the task operation entry corresponding to the first task operation belongs to a reference task operation entry. Third, based on the task status information of each first task operation in the task operation path, the electronic device determines the attribution location result of the task operation path. The attribution location result of the task operation path characterizes the task operation entry corresponding to the first task operation in the task operation path that can drive the task completion.

[0162] Computer program code for performing the operations of this disclosure can be written in one or more programming languages ​​or a combination thereof, including but not limited to object-oriented programming languages ​​such as Java, Smalltalk, and C++, as well as conventional procedural programming languages ​​such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a local area network (LAN) or a wide area network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0163] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this disclosure. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0164] The units described in the embodiments of this disclosure can be implemented in software or in hardware. The name of a unit does not necessarily limit the unit itself; for example, the first acquisition unit can also be described as "a unit that acquires at least two Internet Protocol addresses".

[0165] The functions described above in this document can be performed, at least in part, by one or more hardware logic components. For example, exemplary types of hardware logic components that can be used, without limitation, include: Field Programmable Gate Arrays (FPGAs), Application-Specific Integrated Circuits (ASICs), Application Standard Products (ASSPs), System-on-Chip (SoCs), Complex Programmable Logic Devices (CPLDs), and so on.

[0166] In the context of this disclosure, a machine-readable medium can be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, apparatus, or device. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can be, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0167] The above description is merely a preferred embodiment of this disclosure and an explanation of the technical principles employed. Those skilled in the art should understand that the scope of this disclosure is not limited to technical solutions formed by specific combinations of the above-described technical features, but should also cover other technical solutions formed by arbitrary combinations of the above-described technical features or their equivalents without departing from the above-described concept. For example, technical solutions formed by substituting the above features with (but not limited to) technical features disclosed in this disclosure that have similar functions.

[0168] Furthermore, while the operations are described in a specific order, this should not be construed as requiring these operations to be performed in the specific order shown or in a sequential order. In certain environments, multitasking and parallel processing may be advantageous. Similarly, while several specific implementation details are included in the above discussion, these should not be construed as limiting the scope of this disclosure. Certain features described in the context of individual embodiments may also be implemented in combination in a single embodiment. Conversely, various features described in the context of a single embodiment may also be implemented individually or in any suitable sub-combination in multiple embodiments.

[0169] Although the subject matter has been described using language specific to structural features and / or methodological logic, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or actions described above. Rather, the specific features and actions described above are merely illustrative examples of implementing the claims.

Claims

1. A task detection method, characterized in that, The method includes: The first task operation in the task operation path is determined, and the attribution logic information of the first task operation is determined. The attribution logic information of the first task operation is used to indicate at least one task function instruction to be used for attribution processing of the first task operation. Each task function instruction indicated by the attribution logic information of the first task operation has a one-to-one correspondence with each sub-process operation in the attribution processing flow of the first task operation. Based on the attribution logic information of the first task operation, the task status information of the first task operation is determined. The task status information of the first task operation is used to record whether the task operation entry corresponding to the first task operation belongs to the reference task operation entry. Based on the task status information of each first task operation in the task operation path, the attribution and localization result of the task operation path is determined. The attribution and localization result of the task operation path is used to characterize the task operation entry corresponding to the first task operation in the task operation path that can drive the completion of the task.

2. The method according to claim 1, characterized in that, The first task operation in the determined task operation path includes: Display at least one attribution mode configuration item related to the task operation path, the at least one attribution mode configuration item including at least one of the following types of attribution modes: first attribution mode and last attribution mode; In response to the selection operation for an attribution mode configuration item, the traversal operation is performed on a series of task operations included in the task operation path according to the traversal order associated with the selected attribution mode, and the first task operation to be attributed in each round of traversal is determined from the task operation path during each round of traversal.

3. The method according to claim 1, characterized in that, The determination of the attribution logic information for the first task operation includes: The attribution processing flow of the first task operation is determined according to the task type of the first task operation. The attribution processing flow of the first task operation is formed by an orderly arrangement of several sub-process operations. The several sub-process operations are the sub-process operations corresponding to the executable logic required for attribution analysis of the first task operation. The task function instruction of the first task operation is determined from the preset instruction configuration information according to the attribution processing flow of the first task operation. The preset instruction configuration information pre-configures a number of task function instructions corresponding to each sub-process operation. Each task function instruction of the first task operation is used to drive the implementation of the sub-process operation corresponding to each task function instruction in the attribution processing flow of the first task operation. The task function instruction corresponding to each sub-process operation is generated by encapsulating the metadata of the executable logic covered by the sub-process operation in the form of instructions.

4. The method according to claim 1, characterized in that, Determining the task status information of the first task operation based on the attribution logic information of the first task operation includes: The task function instruction indicated by the attribution logic information of the first task operation is loaded into the attribution engine. The attribution engine can be used to execute the executable logic described by the task function instruction of the first task operation, and a virtual environment that does not depend on the underlying restart is constructed by encapsulation at the code layer. In the attribution engine, the task status information of the first task operation is determined based on the task function instructions indicated by the attribution logic information of the first task operation.

5. The method according to claim 4, characterized in that, The task status information of the first task operation is determined based on the task function instruction indicated by the attribution logic information of the first task operation, including: Based on the execution order of each sub-process operation in the attribution processing flow of the first task operation, the task function instructions indicated by the attribution logic information of the first task operation are read one by one. The task status information of the first task operation is determined by sequentially executing the task function instructions of each sub-process operation read one by one.

6. The method according to claim 5, characterized in that, Before determining the task status information of the first task operation based on the task function instruction indicated by the attribution logic information of the first task operation, the method further includes: Several reference task operation entry tags of the first task operation are loaded into the attribution engine. The reference task operation entry tags of the first task operation are tags of reference task operation entry points that participate in attribution and are pre-configured in the form of metadata. Accordingly, by sequentially executing the task function instructions for each sub-process operation read one by one, the task status information of the first task operation is determined, including: By sequentially executing the task function instructions of each sub-process operation read one by one, it is detected whether the task operation entry corresponding to the first task operation can be labeled with the reference task operation entry tag. Based on whether the task operation entry corresponding to the first task operation can be tagged with a reference task operation entry label, the task status information of the first task operation is determined.

7. The method according to claim 6, characterized in that, Detecting whether the task operation entry corresponding to the first task operation can be tagged with a reference task operation entry tag includes: Starting from the end of the tag string of the task operation entry corresponding to the first task operation, the tag string of the task operation entry corresponding to the first task operation is gradually reduced and compared with the tag string of the reference task operation entry tag; Based on the comparison result with the tag string of the reference task operation entry tag, determine whether the task operation entry corresponding to the first task operation can be tagged with the reference task operation entry tag.

8. The method according to claim 6, characterized in that, Based on whether the task operation entry corresponding to the first task operation can be tagged with a reference task operation entry label, the task status information of the first task operation is determined, including: If the task operation entry corresponding to the first task operation can be tagged with a reference task operation entry tag, then the reference task operation entry tag is stored and recorded, and the position of the first task operation tagged with the reference task operation entry tag in the task operation path is stored and recorded. If the task operation entry corresponding to the first task operation cannot be tagged with a reference task operation entry, then the next task operation in the task operation path after the first task operation will be determined as the new first task operation.

9. The method according to claim 1, characterized in that, After determining the attribution logic information of the first task operation, the method further includes: The sub-process operations corresponding to each task function instruction indicated by the attribution logic information of the first task operation are displayed, and the sub-process operations corresponding to each task function instruction are visualized using graphic elements. In response to the adjustment operation of the graphical elements of the sub-process operation corresponding to the task function instruction, the attribution logic information of the first task operation is adjusted. The adjustment operation includes at least one of the following types of adjustments: adjusting the graphical elements of the sub-process operation and adjusting the execution order between the graphical elements of the sub-process operation.

10. A task detection device, characterized in that, The device includes: The first determining module is used to determine the first task operation in the task operation path and to determine the attribution logic information of the first task operation. The attribution logic information of the first task operation is used to indicate at least one task function instruction to be used for attribution processing of the first task operation. Each task function instruction indicated by the attribution logic information of the first task operation has a one-to-one correspondence with each sub-process operation in the attribution processing flow of the first task operation. The second determining module is used to determine the task status information of the first task operation based on the attribution logic information of the first task operation. The task status information of the first task operation is used to record whether the task operation entry corresponding to the first task operation belongs to the reference task operation entry. The third determining module is used to determine the attribution and localization result of the task operation path based on the task status information of each first task operation in the task operation path. The attribution and localization result of the task operation path is used to characterize the task operation entry corresponding to the first task operation in the task operation path that can drive the task to be completed.

11. An electronic device, characterized in that, The electronic device includes: One or more processors; Storage device for storing one or more programs. When the one or more programs are executed by the one or more processors, the one or more processors implement the task detection method according to any one of claims 1-9.

12. A storage medium containing computer-executable instructions, characterized in that, The computer-executable instructions, when executed by a computer processor, are used to perform the task detection method according to any one of claims 1-9.

Images