Process data processing method, device and equipment

Abstract

The invention relates to the technical field of business process approval, and provides a process data processing method, device and equipment. The process data processing method comprises the steps of obtaining record data generated in an approval process circulation process; according to the record data, the newest record data of each level of approval node is written into each linked list node of a double linked list to form the double linked list representing an approval process flow track, each linked list node corresponds to each level of approval node, and each linked list node is linked in sequence according to the order of the approval nodes; and in response to the target search request, starting from the current linked list node, searching a target linked list node from each linked list node of the double linked list according to the trend of each linked list node in the double linked list. According to the flow data processing method, the double linked list representing the flow circulation track can be generated based on the recorded data, so that tracing can be performed according to the double linked list, and the tracing efficiency is improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of business process approval, and particularly relates to a process data processing method, device and equipment. BACKGROUND

[0002] In an enterprise management system, a multi-level approval process is a common business scenario, especially in key business links such as order processing, contract signing, expense reimbursement, etc., which often need to go through multi-level and multi-role review. In order to ensure the traceability of the approval process, the system usually records the operation log of each approval node, including the approver, operation type (such as pass, reject, withdraw, reassign, etc.) and timestamp information.

[0003] At present, in the related art, when there is a traceability requirement, most systems use a full data traversal mechanism to gradually restore the approval track through full table scanning or conditional query to trace the target.

[0004] However, with the increase of business complexity, complex nested scenarios such as multiple withdrawals and re-submissions may occur in the approval process, and for data containing nested scenarios, full traversal of the approval needs to be performed multiple times, resulting in high traceability complexity and low traceability efficiency. SUMMARY

[0005] Therefore, the present application aims to provide a process data processing method to reduce traceability calculation complexity and improve traceability efficiency.

[0006] To achieve the above object, the technical scheme of the present application is as follows: A process data processing method, the method comprising: obtaining record data generated in the approval process flow process, the record data comprising a handler of an approval node, a name of the approval node, and an approval operation of the approval node, the approval node comprising each level node in the approval process; According to the record data, the latest record data of each level of the approval node is written into each linked list node of a double-linked list to form a double-linked list representing the approval process flow track, wherein each linked list node corresponds to each level of the approval node, and each linked list node is sequentially linked in the order of the approval node; In response to a target search request, starting from the current linked list node, the target linked list node is searched from each linked list node of the double-linked list according to the direction of each linked list node in the double-linked list.

[0007] Further, the writing of the latest record data of each level of the approval node into each linked list node of the double-linked list according to the record data comprises: filtering record data belonging to preset invalid records in the record data to obtain filtered record data; According to each item of filtered record data, the latest record data of each level of the approval node is written into each link list node of the double link list.

[0008] Further, the formation process of the double link list representing the approval process flow track includes: creating an empty double link list; According to the generation order of each item of the record data, each record data is traversed in turn; When each record data is traversed, the current approval node of the process when the current traversed record data is generated is determined; According to the current approval node, the current record approval node of the current record data, and the current record approval operation, it is judged whether the current record data is the record data that makes the approval operation for the first time in the current approval node; In the case that the current record data is the record data that makes the approval operation for the first time in the current approval node, a new link list node corresponding to the current approval node is created at the tail of the current double link list, and the current record data is written into the new link list node, and in the case that the current record data is not the record data that makes the approval operation for the first time in the current approval node, the current double link list is updated according to the current record data and the current approval node; After adjusting the double link list according to the current record data, the current approval node of the current process is re-determined, and in the case that there is a next record data, the next record data is traversed, and after the traversal is completed, the double link list representing the approval process flow track is formed.

[0009] Further, the judgment of whether the current record data is the record data that makes the approval operation for the first time in the current approval node includes: judging whether there is a link list node corresponding to the current approval node in the current double link list, and judging whether the current double link list contains other approval records of the handler of the current record data; In the case that there is no link list node corresponding to the current approval node in the current double link list, and the current double link list does not contain other approval records of the handler of the current record data, it is determined that the current record data is the record data that makes the approval operation for the first time in the current approval node.

[0010] Further, in the case that the current record data is not the record data that makes the approval operation for the first time in the current approval node, the current double link list is updated according to the current record data and the current approval node, including: In a case where the current record data is not the first record data of making an approval operation in the current approval node, the current bidirectional linked list is updated according to the current record data and the current approval node, including: The target modification approval node is determined according to a preset modification node determination mode corresponding to the repetitive operation type. The current record data is updated to the linked list node corresponding to the target modification approval node.

[0011] Further, the target modification approval node is determined according to the preset modification node determination mode corresponding to the repetitive operation type, including: In a case where the repetitive operation type belongs to a type that the handler retreats the current level approval node to the upper level approval node, and then withdraws the approval operation of retreating the current level approval node to the upper level approval node, the next level approval node of the current approval node is taken as the target modification approval node. In a case where the repetitive operation type belongs to a type that the handler retreats the current level approval node to the distributor node, and then withdraws the approval operation of retreating the current level approval node to the distributor node, the head node of the current bidirectional linked list is taken as the target modification approval node.

[0012] Further, in a case where the current record data is not the first record data of making an approval operation in the current approval node, the current bidirectional linked list is updated according to the current record data and the current approval node, including: In a case where the current record data is not the first record data of making an approval operation in the current approval node, the current bidirectional linked list is updated according to the current record data and the current approval node, including: In a case where the type of the current record data belongs to a preset withdrawal record data of submitting and then withdrawing, the linked list node corresponding to the upper level approval node of the current approval node is updated according to the current record data.

[0013] Further, the preset movement rule of the current approval node includes: In a case where the approval operation belongs to a retreat operation, the current approval node is moved to the upper level approval node of the current approval node. In a case where the approval operation belongs to a submission operation, the current approval node is moved to the next level approval node of the current approval node. In a case where the approval operation belongs to a withdrawal operation, in a case where the withdrawal operation belongs to a first withdrawal operation of withdrawing after retreating to the upper level approval node, the current approval node is moved to the next level approval node of the current approval node. when the withdrawal operation belongs to a second withdrawal operation that is withdrawn after being submitted to a next approval node, moving the current approval node to a previous approval node of the current approval node; when the withdrawal operation belongs to a third withdrawal operation that is withdrawn after being returned to a partner node, moving the current approval node to a first node of the approval process.

[0014] Compared with the related art, the present application has at least the following advantages: The process data processing method described in the present application acquires record data generated in the approval process, including the handler, the name of the approval node, and the operation, then writes the latest record data of each level of the approval node into a double-linked list, forms a flow track chain table that can be accessed in both directions according to the node order, and finally locates the target chain table node by starting from the current chain table node and following the double-linked list when responding to a target search request. In this way, the full data is only traversed once to construct the chain table, and then the target chain table node can be quickly searched by jumping with the help of the pointer of the double-linked list. Assuming there is a nested operation, it also does not need to traverse the full data multiple times, but only needs to traverse the full data once to construct the double-linked list. This avoids the problem of multiple full data traversals caused by nested operations in the related art, thereby facilitating the reduction of computational complexity and the improvement of target search efficiency.

[0015] The present application also proposes a process data processing device, which comprises: A data acquisition module is configured to acquire record data generated in the approval process, including the handler of the approval node, the name of the approval node, and the approval operation of the approval node, and the approval node includes each level of node in the approval process. A double-linked list generation module is configured to write the latest record data of each level of the approval node into each chain table node of a double-linked list according to the record data, forming a double-linked list representing the approval process flow track, wherein each chain table node corresponds to each level of the approval node, and each chain table node is sequentially linked according to the approval node order. A target search module is configured to start from the current chain table node and search for a target chain table node from each chain table node of the double-linked list according to the direction of each chain table node in the double-linked list in response to a target search request.

[0016] The present application also proposes an electronic device, which comprises: One or more processors; A memory 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 process data processing method described above.

[0017] The process data processing device and the electronic device described in the application can improve the efficiency of tracing and reduce the complexity of tracing by establishing a bidirectional linked list for each record data and tracing through the bidirectional linked list. BRIEF DESCRIPTION OF DRAWINGS

[0018] The accompanying drawings, which form a part of this application, are intended to provide further understanding of the application and are incorporated herein in their entirety, and they will be used for interpretation of the application together with the specification. In the drawings: Figure 1 A flowchart of a process data processing method described in an embodiment of the application; Figure 2 An example diagram of the formation of a bidirectional linked list in a process data processing method described in an embodiment of the application; Figure 3 A flowchart of the formation process of a bidirectional linked list in a process data processing method described in an embodiment of the application; Figure 4 A flowchart of updating a bidirectional linked list in a process data processing method described in an embodiment of the application in a case; Figure 5 A flowchart of determining a target modification approval node in a process data processing method described in an embodiment of the application; Figure 6 A flowchart of updating a bidirectional linked list in a process data processing method described in an embodiment of the application in another case; Figure 7 A flowchart of the complete process of generating a bidirectional linked list in a process data processing method described in an embodiment of the application; Figure 8 A schematic diagram of the formation of a process data processing device described in an embodiment of the application; Figure 9 A schematic diagram of the formation of an electronic device described in an embodiment of the application; Explanation of reference signs: 810, data acquisition module; 820, bidirectional linked list generation module; 830, target search module; 910, processor; 920, memory. DETAILED DESCRIPTION

[0019] In order to make the technical solutions of the application and their advantages clearer, the application will be further described in detail below with reference to the drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the application and do not limit the application.

[0020] It should be noted that the embodiments in the present application and the features in the embodiments can be combined with each other in the case of no conflict.

[0021] In addition, in the description of the present application, it should be noted that if the terms indicating the orientation or position relationship such as "upper", "lower", "inner", "outer" and the like appear, they are based on the orientation or position relationship shown in the drawings, and are only for the convenience of describing the present application and simplifying the description, and do not indicate or imply that the devices or elements indicated must have a particular orientation, be constructed and operated in a particular orientation, and therefore cannot be understood as a limitation on the present application. In addition, if the terms "first", "second" and the like appear, they are also only for the purpose of description and cannot be understood as indicating or implying relative importance.

[0022] In addition, in the description of the present application, unless otherwise explicitly limited, the terms "mounting", "connection", "connection", "connector" should be understood broadly. For example, it can be fixedly connected, or it can be detachably connected, or integrally connected; it can be mechanically connected, or it can be electrically connected; it can be directly connected, or it can be indirectly connected through an intermediate medium, or it can be the communication inside two elements. For those skilled in the art, the specific meaning of the above terms in the present application can be understood in conjunction with the specific circumstances.

[0023] In the present application, the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" mean that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present application. In the present specification, the illustrative representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any appropriate manner in any one or more embodiments or examples.

[0024] In the following, the present application will be specifically described through exemplary embodiments. However, it should be understood that the elements, structures and features in one embodiment can also be beneficially combined into other embodiments without further description.

[0025] The embodiments of the first aspect of the present application provide a flow data processing method, which aims to construct a double-linked list representing the flow trajectory of the approval process according to the record data in the flow process of the approval process. In this way, the staff can use the double-linked list to find the target, such as the person in charge of the target approval node, without searching for the target from the complex data or traversing multiple times, but only needs to traverse once, thereby improving the convenience and efficiency of target finding.

[0026] In the related art, in a business approval process, there are often multiple levels of approval nodes. For example, an approval process A includes five levels of approval nodes, and the five levels of approval nodes are preliminary audit, department audit, supervisor audit, financial audit, and manager audit, starting from the first level of approval node.

[0027] At each approval node, a corresponding handler performs a corresponding approval operation. For example, the handler selects a submission operation to submit the current approval node to the next level of approval node for approval of the next level of approval node; or the handler selects a return operation to return the current approval node to the previous level of approval node for approval of the previous level of approval node; or the handler selects a withdrawal operation to withdraw the operation of submitting the node a11 to the next level of approval node a12, so that the process returns to the node a11, or to withdraw the operation of returning the node a11 to the previous level of approval node a10, so that the process returns to the node a11; or the handler selects a reassignment to transfer the handler of the current approval node to another handler, and the other handler performs a corresponding operation.

[0028] In the business approval process, there is often a traceability requirement. For example, after the manager audit or all audits are completed, it is found that the order has a problem and should not be passed, and the problem belongs to the preliminary audit node, and the preliminary audit node needs to be located and the responsible person needs to be determined. When the traceability requirement is triggered, the approval system needs to accurately locate the target responsible person based on the complete operation log of the auditor.

[0029] In the related art, a full data traversal mechanism is used for positioning. The full data traversal mechanism means that when the system queries the records of the approval process, all related data in the database (or log storage system) needs to be scanned and matched one by one according to the query condition of the record, and the record meeting the query condition is filtered out. For example, assuming that there are 100 operation records in the entire approval process, and the current needs to find the responsible person of the node a11, the query condition needs to be determined, and then the 100 data are traversed to find the record of the node a11. That is, when the data of any node is found, a traversal needs to be performed.

[0030] If there are nested operations (such as multiple withdrawals / re-submissions) in the approval process, multiple full table scans need to be performed when tracing, for example, the latest re-submission record is first found, and then the last withdrawal record is associated, and so on, until the target record is traced. Each time the record is found, a full data traversal scan needs to be performed, so that the computational complexity increases exponentially, and the efficiency of locating the target is low.

[0031] In view of this, in order to overcome the deficiencies in the related art, in the process data processing method of the embodiment, the full data traversal mechanism is combined with the Figure 1In terms of overall design, it includes the following steps S110-S130.

[0032] Step S110: obtaining record data generated during the approval process.

[0033] The recorded data includes the processor of the approval node, the name of the approval node, and the approval operation of the approval node. The approval node includes nodes at all levels in the approval process.

[0034] Specifically, an approval node is a node in an approval process, which includes multiple levels of nodes. For example, the approval nodes in approval process a, starting from the first-level approval node, are: approval node a1 - approval node a2 - approval node a3 - approval node a4 - approval node a5. That is, the approval node below approval node a1 is approval node a2, and the approval node above approval node a2 is approval node a1.

[0035] The processor is the specific person who performs the approval operation at the approval node. For example, at approval node a1, after processor A completes the review, he submits the application. The approval process then transfers from approval node a1 to approval node a2. The processor at approval node a1 is then A.

[0036] Approval operations are actions performed by a handler at an approval node. These operations can include both process node transfer operations and handler transfer operations. For example, if handler A, at approval node a1, chooses to submit the process node to the next-level approval node (i.e., approval node a2) and then submit it to handler B for approval, handler A's approval operations can include submitting approval node a1 to approval node a2 (process node transfer operation) and submitting the task from handler A to handler B (handler transfer operation).

[0037] Approval operations can be categorized into submit, return, reassign, and withdraw. Submitting transfers approvals from the current approval node to the next-level approval node. Returning transfers approvals from the current approval node to the previous approval node. Reassigning maintains the current approval node and only changes the processor. Withdrawing withdraws approvals from the current approval node and transfers them to the approval node that initiated the withdrawal.

[0038] Specifically, in step S110, the recorded data is the data generated during the approval process. For example, at approval node a1, after review by Processor A, it is submitted to the next-level approval node a2, which is then submitted to Processor B for processing. Subsequently, at approval node a2, Processor B reviews it and submits it to approval node a3, which is then submitted to Processor C for processing. At this point, the current approval node in the system is a3, and Processor C is currently reviewing it (no corresponding approval action has been taken). The recorded data then includes record data x1 and record data x2.

[0039] Record data x1 corresponds to a record of a submission operation performed by processor A at approval node a1. It includes processor A, approval node a1, and the approval operation includes submitting approval node a1 to approval node a2. Processor A is transferred to processor B.

[0040] Record data x2 corresponds to a record of a submission operation performed by processor B at approval node a2, which includes processor B, approval node a2, the approval operation including the submission from approval node a2 to approval node a3, and the transfer of processor from B to C.

[0041] Step S120 , based on the record data, write the latest record data of the approval nodes at all levels into each link table node of the bidirectional link table to form a bidirectional link table representing the flow trajectory of the approval process.

[0042] Among them, each linked list node corresponds to an approval node at each level, and each linked list node is linked in sequence according to the approval node order.

[0043] For details, please refer to Figure 2 , Figure 2 The structure of a doubly linked list is shown in Figure 1. A doubly linked list is also called a double linked list and is composed of linked list nodes. Figure 2 The doubly linked list shown in the figure contains four nodes: node z0, node z1, node z2, and node z3. Node z0 is the head node, and node z5 is the tail node. Each node in the doubly linked list has two pointers, one pointing to its immediate successor node and the other to its immediate predecessor node. This allows easy access from any node in the doubly linked list to its predecessor and successor nodes.

[0044] For example, in step S120, if the recorded data includes the aforementioned recorded data x1 and x2, the bidirectional linked list formed based on this recorded data includes two linked list nodes: a first-level linked list node (linked list node b1) and a second-level linked list node (linked list node b2). Linked list node b1 corresponds to approval node a1, and linked list node b2 corresponds to approval node a2. Recorded data x1 is written into linked list node b1, and recorded data x2 is written into linked list node b2.

[0045] For example, in step S120, it is assumed that the record data includes record data generated at the approval node a1, the approval node a2, the approval node a3 and the approval node a4, and there are two submission records in the approval node a4, which are record data generated by the first submission and record data generated by the second submission after the withdrawal.

[0046] In this case, the bidirectional linked list formed according to the record data includes four linked list nodes, i.e., the linked list node b1, the linked list node b2, the linked list node b3 and the linked list node b4, and each linked list node stores the latest record data of the corresponding approval node. For example, the linked list node b1 stores the latest record data of the approval node a1. For another example, the latest record data of the approval node a4 is the record data generated by the second submission after the withdrawal, and the linked list node b4 stores the record data generated by the second submission after the withdrawal.

[0047] In this way, by step S120, the bidirectional linked list including the record data of the latest operation of each approval node can be obtained by traversing the full data once, i.e., the bidirectional linked list representing the flow trajectory of the approval nodes can be obtained by traversing all the record data once, and the bidirectional linked list includes the processing performed by each approval node.

[0048] In step S130, in response to the target search request, the target linked list node is searched from the current linked list node according to the direction of each linked list node in the bidirectional linked list.

[0049] Specifically, in step S130, when there is a traceability requirement, only the previous node or the next node in the bidirectional linked list is searched from the current linked list node according to the bidirectional linked list formed, and the target linked list node is searched, so that the target person in charge and the like can be located, thereby achieving the traceability requirement.

[0050] By steps S110-S130, the record data including the processor, the approval node name and the operation generated in the approval process is obtained, then the latest record data of each approval node is written into the bidirectional linked list, the flow trajectory linked list which can be accessed bidirectionally and linked in the order of nodes is formed, and finally, when responding to the target search request, the target linked list node can be located by starting from the current linked list node and following the direction of the bidirectional linked list.

[0051] This approach only requires a single traversal of the entire data set to construct the linked list. When searching for a target, the doubly linked list pointer can then be used to quickly jump to the target linked list node. Even if nested operations are involved, the entire data set only needs to be traversed once to construct the doubly linked list, eliminating the need for multiple traversals of the entire data set due to nested operations in related techniques. This reduces computational complexity and improves target search efficiency.

[0052] Continue to combine Figure 1 As shown in , in some exemplary implementation forms, in the above-mentioned step S120, based on the record data, the latest record data of the approval nodes at all levels are written into each linked list node of the bidirectional linked list, which can specifically include: filtering the record data belonging to preset invalid records in the record data to obtain filtered record data; and then writing the latest record data of the approval nodes at all levels into each linked list node of the bidirectional linked list based on each filtered record data.

[0053] Specifically, in step S120, the record data may be filtered first to filter out invalid records in the record data, and then the filtered record data may be used to obtain a bidirectional linked list representing the flow trajectory of the approval process.

[0054] More specifically, data that is considered a pre-set invalid record can be data corresponding to a reassignment operation. For example, at approval node a1, Person A, unable to handle the work at that node, chooses to assign the work to Person Zhang. Therefore, Person A reassigns the task to Person Zhang at approval node a1. This leaves the approval node unchanged, only the person handling the task changes. This type of record can be considered a pre-set invalid record.

[0055] After filtering out the records that belong to the reassignment, that is, deleting them from the record data, a bidirectional linked list is constructed based on the record data after deleting the reassignment records. For example: The original recorded data includes: Approval node a1: Processor A submits the application to approval node A2, which assigns it to Person B (record y1, valid). Approval node a2: Processor B is reassigned to Processor C (record y2, which is a reassignment operation and is invalid); Approval node a2: Processor C submits it to approval node a3 and assigns it to D (record y3, valid).

[0056] Since the record data y2 is invalid, the record data y2 is filtered out. The filtered record data includes: Record y1: At approval node a1, processor A submits it to approval node A2 and assigns it to processor B. Record y3: at the approval node a2, the handler C submits to the approval node a3 and is assigned to D.

[0057] For the record data corresponding to the reassignment operation, since it belongs to the record data whose actual approval node does not change, the change of the node is not involved in the actual process flow, and the double-linked list only needs to record the latest processed record, only the record of the handler after the reassignment in the approval node needs to be retained, therefore, by filtering out such invalid records and constructing the double-linked list using the filtered record data, it is beneficial to reduce the redundant data when constructing the double-linked list, thereby reducing the number of data traversals and improving the efficiency of constructing the double-linked list.

[0058] Continuing from Figure 1 , and in combination with Figure 3 , in some exemplary embodiments, in the above embodiments, the forming process of the double-linked list representing the approval process flow trajectory can specifically include the following steps S121-S126.

[0059] Step S121, creating an empty double-linked list.

[0060] Step S122, traversing each record data in turn according to the generation order of each record data.

[0061] Specifically, the record data is the data generated due to the operation of the handler in the approval process, and each operation corresponds to a record data. In step S122, each record data is traversed in turn according to the generation order, that is, each record data is sorted in the order from the earliest to the latest according to the generation time, and is traversed in turn according to the order.

[0062] It is worth noting that the generation order of the record data reflects the flow process of the approval node in the approval process. For example, in the approval process, the handler makes a submission operation in the current approval process, and a record data is formed in the current approval node. After that, the node of the approval process will be transferred to the next node, and the handler of the next node will perform the corresponding operation to form the next record data.

[0063] For example, in step S122, it is assumed that the record data includes: at the approval node a1, after the handler A completes the audit, the handler A selects to submit to the next approval node a2 and submits to the handler B for processing (record data x1); and then at the approval node a2, after the handler B audits, the handler B submits to the approval node a3 and submits to the handler C for processing (record data x2). According to the generation order of the record data, the record data x1 is traversed first, and then the record data x2 is traversed.

[0064] Step S123 , when traversing each record data, determining the current approval node of the process when the currently traversed record data is generated.

[0065] Step S124 : judging, based on the currently traversed record data, whether the current record data is the record data for which the approval operation is performed for the first time at the current approval node.

[0066] Step S125: If the current record data is the record data of the first approval operation performed at the current approval node, a new linked list node corresponding to the current approval node is created at the end of the current bidirectional linked list, and the current record data is written into the new linked list node. If the current record data is not the record data of the first approval operation performed at the current approval node, the current bidirectional linked list is updated according to the current record data and the current approval node.

[0067] Step S126, after adjusting the bidirectional linked list according to the current record data, re-determine the current approval node of the current process, and traverse the next record data if there is one, and after the traversal is completed, form a bidirectional linked list representing the flow trajectory of the approval process.

[0068] For example, the traversal starts from the first record data, which is record data x1 (when processor A submits the first-level approval node a1 to the second-level approval node a2).

[0069] In step S123, since the first approval node is the starting node of the process, that is, the node at which the process is located when the first record data x1 is generated, that is, when traversing the record data x1, the current approval node is approval node a1. The current bidirectional linked list is an empty linked list.

[0070] Then, in steps S124 and S125, it is determined that the current record data x1 is the record data of the first approval operation performed at the current approval node a1. Therefore, a new linked list node b1 is created in the empty bidirectional linked list, and the record data x1 is written into the new linked list node, resulting in a bidirectional linked list: linked list node b1 (corresponding to approval node a1).

[0071] After adjusting the bidirectional linked list, the approval node of the current process has been submitted by Person A to the second-level approval node a2. The process now flows to the second-level approval node a2. Therefore, in step S126, the current approval node is updated to the second-level approval node a2.

[0072] After that, the second record data is traversed, and the above steps S123-S126 are executed in a loop. In step S123, the second record data is record data x2 (person B submits the second level approval node a2 to the third level approval node a3). At this time, the current approval node is approval node a2. The current double-linked list is list node b1.

[0073] Record data x2 is the first operation data made at approval node a2, so a new list node is created after list node b1 in the current double-linked list, and the record data x2 is written into the new list node, obtaining the double-linked list: list node b1 (corresponding to approval node a1) - list node b2 (corresponding to approval node a2).

[0074] After that, since in the second record data, the approval node has been submitted by person B from approval node a2 to approval node a3, in step S126, the current approval node is updated to approval node a3.

[0075] Suppose that after the above second record data x2, a third record data x3 is generated, record data x3 is the operation of person C returning approval node a3 to approval node a2, and the operation of re-approval by person B at approval node a2. At this time, the current approval node is approval node a3, and the current double-linked list is list node b1-list node b2.

[0076] Then the third record data x3 is traversed, and the above steps S123-S126 are executed in a loop.

[0077] The third record data x3 belongs to the first approval operation at approval node a3, so on the basis of the current double-linked list, a new list node b3 is created after list node b1-list node b2, and the third record data x3 is written into the list node b3. At this time, the architecture of the double-linked list is changed to list node b1-list node b2-list node b3.

[0078] After that, since in the third record data, the approval node has been returned by person C from approval node a3 to approval node a2, the current approval node is changed to approval node a2.

[0079] When there is a next record data, the next record data is traversed, and the corresponding current approval node is approval node a2, and the corresponding current double-linked list is list node b1-list node b2-list node b3, and steps S123-S126 are continued to be executed in a loop to adjust the double-linked list according to the next record data. In this way, the record data is traversed until the final double-linked list is obtained.

[0080] Thus, by the above steps S121-S126, an empty double-linked list is first created, and then whether the record data is first submitted from the current approval node to the next approval node is determined according to the record data, and the double-linked list is adjusted according to the determination result to obtain the final double-linked list. In this way, the record data is traversed one by one, which not only can summarize the generated record data to obtain the double-linked list to improve the efficiency, but also can adjust once for each record generated in the process of real-time operation of the approval process, so that the double-linked list can represent the latest approval process flow track to improve the applicability.

[0081] Continuing from Figure 1 and Figure 3 In some exemplary embodiments, in step S122, it is determined whether the current record data is the record data of the first approval operation at the current approval node, which can specifically include determining whether the current double-linked list includes the linked list node corresponding to the current approval node, and determining whether the current double-linked list includes other approval records of the handler of the current record data.

[0082] In the case that the current double-linked list does not include the linked list node corresponding to the current approval node, and the current double-linked list does not include other approval records of the handler of the current record data, it is determined that the current record data is the record data of the first approval operation at the current approval node.

[0083] For example, the second record data x2 (the handler B submits the second approval node a2 to the third approval node a3) in the above example is taken as an example to illustrate the specific determination process. The current approval node corresponding to the second record data x2 is the approval node a2, the next approval node of the current approval node is a3, the current double-linked list is the linked list node b1 (corresponding to the approval node a1), and the handler of the current record data is B.

[0084] The current double-linked list only includes the linked list node b1 of the approval node a1, does not include the linked list node corresponding to the approval node a2, and only stores the approval record of the handler A submitting the first approval node to the second approval node, does not store the approval record of the handler B, and thus it is determined that the second record data x2 is the record data of the first approval operation at the approval node a2.

[0085] Further, if the current double-linked list includes the linked list node corresponding to the current approval node, and / or the current double-linked list includes other approval records of the handler of the current record data, it is determined that the current record data is not the record data of the first approval operation at the current approval node.

[0086] By judging the data of the linked list nodes in the bidirectional linked list, it is determined whether the current record data is the record data of the first approval operation made at the current approval node, thereby providing a judgment method to distinguish each record data, so as to form a bidirectional linked list.

[0087] Continued by Figure 1 and Figure 3 , combined with Figure 4 As shown in , in some exemplary implementation forms, in the above-mentioned step S162, when the current record data is not the record data of the first approval operation performed at the current approval node, more specifically, when there is a linked list node corresponding to the current approval node in the current bidirectional linked list, the current bidirectional linked list is updated according to the current record data and the current approval node, which may specifically include the following steps S1621 to S1623.

[0088] Step S1621 : When a linked list node corresponding to the current approval node exists in the current bidirectional linked list, the repeated operation type of the current recorded data is analyzed and determined based on the current recorded data.

[0089] For example, assume that after the third record data x3 (C, at approval node a3, returns approval node a3 to approval node a2), a fourth record data x4 is generated. The fourth record data x4 indicates that C, at approval node a3, withdrew the operation of returning approval node a3 to approval node a2, causing the approval node to be withdrawn from approval node a2 to approval node a3.

[0090] When traversing the fourth record data x4, the current bidirectional linked list is linked list node b1 (corresponding to approval node a1) - linked list node b2 (corresponding to approval node a2) - linked list node b3 (corresponding to approval node b3). The current approval node is approval node a2, and the linked list node corresponding to the current approval node is linked list node b2. It can be seen that when traversing the fourth record data x4, it is determined that the linked list node corresponding to the current approval node exists in the current bidirectional linked list, and the current bidirectional linked list needs to be updated.

[0091] Specifically, when a linked list node corresponding to the current approval node exists in the current bidirectional linked list, the repeated operation type of the current recorded data is first analyzed and determined based on the current recorded data.

[0092] Step S1622: Determine the target modification approval node according to the preset modification node determination method corresponding to the repeated operation type.

[0093] In step S1622, a target modification approval node is determined according to a preset modification node determination method corresponding to the repetitive operation type of the current record data, so as to update the target modification approval node to obtain an adjusted bidirectional linked list.

[0094] Continued by Figure 1 、 Figure 3 and Figure 4 , combined with Figure 5 As shown in FIG, in step S1622, the method of determining the target modification approval node may specifically include the following steps S510 to S520 in some exemplary implementation forms.

[0095] Step S510: When the repeated operation type is that the operator returns the current level approval node to the previous level approval node and then withdraws the approval operation of returning the current level approval node to the previous level approval node, the next level approval node of the current approval node is used as the target modification approval node.

[0096] Specifically, the current-level approval node is the approval node at which the current operation is performed, such as the fourth record data x4 described in the above embodiment. That is, after C, at approval node a3, returns approval node a3 to approval node a2, C, at approval node a3, reverses the operation of returning approval node a3 to approval node a2, causing the approval node to return to approval node a3.

[0097] For the fourth record data x4, which is the data of the approval operation performed by the processing person C at the approval node a3, the current level approval node is the approval node a3, and the previous level approval node of the current level approval node is the approval node a2.

[0098] It can be seen that the fourth record data x4 belongs to the type of approval operation in which the processor returns the current level approval node (approval node a3) to the previous level approval node (approval node a2), and currently withdraws the approval operation of returning the current level approval node (approval node a3) to the previous level approval node (approval node a2).

[0099] In this case, when determining the target modification approval node, the approval node immediately below the current approval node corresponding to the current record data is selected as the target modification approval node. For example, for the fourth record data x4, the current approval node for the fourth record data x4 is approval node a2 (because when the fourth record data x4 was generated, the process was at approval node a2 due to the operation on record data x3). Therefore, the target modification approval node is approval node a3.

[0100] Step S520, when the repeated operation type belongs to the type of the handling person withdrawing the current level approval node to the distributor node and then withdrawing the approval operation of withdrawing the current level approval node to the distributor node, the head node of the current double-linked list is taken as the target modification approval node.

[0101] Specifically, for the operation of withdrawing and then withdrawing, the next approval node of the current approval node is selected as the target modification approval node, and if it is directly withdrawn to the distributor node and then withdrawn, since the distributor submits the first level approval node, that is, only the first level approval node can be withdrawn to the distributor node and then withdrawn. In this case, the linked list node corresponding to the first level approval node can be directly taken as the target modification approval node, that is, the head node of the current double-linked list is taken as the target modification approval node.

[0102] Through steps S510 and S520, the target modification approval node is determined according to the preset modification node determination mode corresponding to the repeated operation type, so that the double-linked list can be established by updating and modifying the target modification approval node, and the target can be located through the double-linked list, thereby improving the traceability efficiency.

[0103] Step S1623, updating the current record data to the linked list node corresponding to the target modification approval node.

[0104] For example, after the target modification approval node is determined, the target modification approval node is directly modified to the current record data.

[0105] It is worth noting that when the task person modification affects the latest operation record of the approval node, the data of the target modification approval node can be modified according to the record data. When there is no task person modification, for example, direct withdrawal, the actual approver of each approval node and the latest record are not changed, and the content of the linked list node corresponding to the target modification approval node can be maintained unchanged.

[0106] According to the above steps S1621-S1623, for the record of withdrawing and then withdrawing operation, the record can also be retained in the double-linked list by updating the information of the linked list node in the double-linked list, so that in the presence of nested records, the double-linked list retaining the operation record of each level of approval in the approval process can also be formed by traversing the record data, thereby facilitating the efficiency of subsequent target searching.

[0107] Continue from Figure 1 and Figure 3 , combined with Figure 6As shown in the figure, in some exemplary embodiments, in step S162, if the current approval node does not exist in the current double-linked list, and the current double-linked list contains other approval records of the processing person of the current record data, the current double-linked list is updated according to the current record data and the current approval node, which can include the following steps S610-S620.

[0108] In step S610, if the current approval node does not exist in the current double-linked list, and the current double-linked list contains other approval records of the processing person of the current record data, the type of the current record data is determined.

[0109] In step S620, if the type of the current record data belongs to the preset withdrawal record data which is submitted and then withdrawn, the chain table node corresponding to the previous approval node of the current approval node is updated according to the current record data.

[0110] For example, in the second record data x2, the processing person B submits the approval node a2 to the approval node a3, and then the third record data x3' is generated, which is that the processing person B withdraws the operation of submitting the approval node a3 to the approval node a2, and withdraws the approval node a3 to the approval node a2, and reapproves by the processing person B.

[0111] When traversing the third record data x3', the current approval node of the third record data x3' is the approval node a3, and the processing person is B. The architecture of the current double-linked list includes the chain table node b1-chain table node b2.

[0112] It can be seen that the chain table node b3 corresponding to the approval node a3 does not exist in the current double-linked list. At the same time, other approval records made by the processing person B (the second record data x2 written in the chain table node b2) exist in the current double-linked list.

[0113] For this case, the third record data x3' belongs to the preset withdrawal record data which is submitted to the next level approval node and then withdrawn, so the chain table node b2 corresponding to the previous approval node a2 of the current approval node a3 is modified, that is, the data written in the chain table node b2 is modified according to the third record data x3'. For example, when the task processing person exists, the corresponding adjustment is made.

[0114] Through the step S610 and the step S620, for the nested operation record which is submitted and then withdrawn, the chain table node corresponding to the upper level approval node of the current approval node is modified, so that the bidirectional chain table can also contain the latest record data of each approval node when there is nested operation data, and then the target can be found and traced by using the bidirectional chain table, so as to improve the tracing efficiency.

[0115] In addition, in the case that the chain table node corresponding to the current approval node exists in the current bidirectional chain table, and the current bidirectional chain table contains other approval records of the processor of the current record data, the chain table node corresponding to the current approval node is modified according to the current record data.

[0116] For example, for the case that the next level node is returned to the current approval node, and then the processor re-submits to the next level node, or is submitted to the next level node and then is withdrawn and re-submitted to the next level node, the bidirectional chain table corresponding to the current approval node can be modified according to the current record data. For example, the case that the first return is performed, then the return operation is withdrawn, and then the next level node is submitted, the bidirectional chain table corresponding to the current approval node can be modified according to the current record data.

[0117] Continuing from the step S126 shown in the step S126, Figure 1 In some exemplary embodiments, in the step S126, when the current approval node is determined, the current approval node is moved according to a preset moving rule according to the approval operation of the record data. Specifically, the preset moving rule of the current approval node includes: When the approval operation is a return operation, the current approval node is moved to the upper level approval node of the current approval node. For example, the processor C returns the current approval node a3 to the approval node a2, and then the current approval node is changed to the approval node a2 after the processing operation is completed.

[0118] When the approval operation is a submission operation, the current approval node is moved to the next level approval node of the current approval node. For example, the processor A submits the current approval node a1 to the approval node a2, and then the current approval node is changed to the approval node a2 after the submission processing operation is completed.

[0119] When the withdrawal operation belongs to a first withdrawal operation after being withdrawn to a previous approval node, the current approval node is moved to a next approval node of the current approval node. For example, the handler B withdraws the current approval node a6 to the approval node a5, and the current approval node is the approval node a5. Then, the handler B withdraws the operation of withdrawing the approval node a6 to the approval node a5. After the first withdrawal operation is completed, the current approval node is changed to a next approval node of the approval node a5, i.e., the approval node a6.

[0120] When the withdrawal operation belongs to a second withdrawal operation after being submitted to a next approval node, the current approval node is moved to a previous approval node of the current approval node. For example, the handler E submits the current approval node a7 to the approval node a8, and the current approval node is the approval node a8. Then, the handler E withdraws the operation of submitting the approval node a7 to the approval node a8. After the second withdrawal operation is completed, the current approval node is changed to a previous approval node of the approval node a8, i.e., the approval node a7.

[0121] When the withdrawal operation belongs to a third withdrawal operation after being withdrawn to a cooperative node, the current approval node is moved to a first node of the approval process. For example, the handler A withdraws the current approval node a1 to the distributor node, and the current approval node is changed to the distributor node. Then, the handler A withdraws the operation of withdrawing the approval node a1 to the distributor node. After the third withdrawal operation is completed, the current approval node is changed to the first node of the approval node, i.e., the approval node a1.

[0122] For another example, when the approval operation belongs to a withdrawal operation, the current approval node is moved to a previous approval node of the current approval node.

[0123] Further, the moving rule of the current approval node is also applicable to the process of finding a target responsible person according to the bidirectional linked list. The current approval node is jumped according to the record data stored in each linked list node, so as to find the target responsible person gradually.

[0124] Through the preset moving rule of the current approval node, the current approval node can be determined, the bidirectional linked list can be created, and after the bidirectional linked list is created, the pointer of the bidirectional linked list can be jumped based on the preset moving rule, so that the target responsible person can be found conveniently, and the convenience of tracing is improved.

[0125] It should be noted that, for the embodiment, based on the above exemplary implementation forms, as a preferred example embodiment, with reference to the above description of the bidirectional linked list, the moving rule of the current approval node is as follows. Figure 1 and Figure 7Taking order approval data as an example, the overall flow of the flow data processing method includes: According to the order query case operation record; then filter out invalid records (for example, filter out the record data corresponding to the reassignment operation); then construct and generate a double-linked list according to the filtered record, which can be used to conveniently query the head node, tail node, previous node and next node; then find the target linked list node in the double-linked list according to the target finding instruction, and return if found, for example, when finding the original person (target responsible person), find the original person according to the double-linked list, and return the found result under the condition that the original person is found.

[0126] Among them, referring to Figure 7 The generation process of the double-linked list specifically includes: (1) Create an empty double-linked list; (2) Traverse the valid operation records; (3) When traversing a record data each time, add / modify the linked list node in the double-linked list according to the record data, specifically including: Determine whether the current approval node exists in the double-linked list, and determine whether the other operation records of the current traversed approval node exist in the double-linked list.

[0127] (3.a) The current approval node exists in the double-linked list i. If the record operation belongs to withdrawal after returning to the previous approval node, modify the next approval node information of the current approval node to the current traversed record data.

[0128] ii. If the record operation belongs to withdrawal after returning to the dealer node, since the first node of the double-linked list corresponding to the auditor allocated after the dealer submits, directly modify the first node information of the double-linked list to the current traversed record data.

[0129] (3.b) The current approval node does not exist in the double-linked list, and the other operation records of the current traversed approval node do not exist in the double-linked list, then add the current traversed operation record information to the tail of the double-linked list.

[0130] (3.c) The current approval node does not exist in the double-linked list, and the other operation records of the current traversed approval node exist in the double-linked list, if the record data belongs to withdrawal after submitting to the next approval node: modify the previous approval node information of the current approval node to the current traversed record data.

[0131] (4) After completing the traversal of each record data, move the current approval node according to the preset movement rule to update the current approval node.

[0132] (4.a) If the traversed record data is a record of returning to the previous approval node, after traversing the record data, the current approval node is moved to the previous approval node of the current approval node (4.b) If the traversed record data is a record of withdrawing after returning to the previous approval node, after traversing the record data, the current approval node is moved to the next approval node of the current approval node (4.c) If the traversed record data is a record of withdrawing after returning to the partner node, since the first node of the bidirectional linked list corresponding to the auditor assigned after the distributor submits, after traversing the record data, the current approval node is directly moved to the first node of the bidirectional linked list (4.d) If the traversed record data is a record of withdrawing after submitting to the next approval node, after traversing the record data, the current approval node is moved to the previous approval node of the current approval node (4.e) If the traversed record data is a record of submitting to the next approval node, after traversing the record data, the current node is moved to the next node of the current node (5) After traversing each record data, the bidirectional linked list is generated.

[0133] The flow data processing method of the embodiment is designed as above, by obtaining the record data generated in the approval process, containing the handler, the approval node name and the operation, then writing the latest record data of each approval node into the bidirectional linked list, forming the flow track linked list which can be accessed in both directions according to the node order, and finally when responding to the target search request, starting from the current linked list node and moving along the bidirectional linked list to locate the target linked list node.

[0134] In this way, the linked list is only constructed by traversing the full data once, and then the target linked list node can be quickly searched by jumping through the pointer of the bidirectional linked list. Assuming there is a nested operation, it also does not need to traverse the full data multiple times, but only needs to traverse the full data once to construct the bidirectional linked list, which avoids the problem of multiple full data traversals caused by nested operations in related technologies, thereby reducing the computational complexity and improving the target search efficiency.

[0135] In addition, in some exemplary embodiments, in the field of financial credit approval, when the approval task reaches the state of each approval node, the approval task needs to be assigned to the corresponding approver to complete the single, so that the approver can perform the corresponding approval task review. After the approver reviews, the corresponding linked list node is generated according to the above flow data processing method, and the bidirectional linked list is perfected.

[0136] However, the single distribution process of the related art has obvious business pain points: first, the single distribution process relies on fixed weights or random allocation, resulting in a serious imbalance in the workload of auditors, with some auditors working long-term overload and other auditor resources idling, resulting in low overall approval efficiency; second, special business scenarios (such as open single, revised reply single, etc.) require manual intervention to reassign, which not only increases the operation complexity, but also significantly prolongs the approval cycle; third, the single distribution flexibility in the related art is insufficient, and when the single distribution rules need to be adjusted, the technical team needs to be involved, which cannot quickly respond to business changes; finally, the manual maintenance of the auditor state management has a lag, and there are often errors in single distribution.

[0137] To solve the above problems, the process processing method of the present application can further include: (1) pre-configure an intelligent rule engine to support business personnel to independently configure multi-dimensional single distribution rules (including business type, amount interval, risk level, etc.), to realize accurate matching of orders and auditor professional ability; (2) by setting a special scenario processor, when orders need to be allocated, automatically identify orders in special scenarios, and prioritize processing of special orders, and through an intelligent backtracking algorithm to ensure business continuity; (3) pre-configure a dynamic state management system to synchronize the working state of auditors in real time, and combine an intelligent early warning mechanism to prevent system overload.

[0138] In this way, through business process reengineering and technical innovation, the single distribution efficiency can be improved by more than 40%, the processing efficiency of special orders can be improved by 50%, and the need for manual intervention can be reduced by 70%, thereby bringing significant operational efficiency improvement for financial institutions.

[0139] The present scheme is particularly suitable for financial institutions with complex business scenarios and large approval volumes, and can effectively solve the efficiency bottleneck and fairness problem under the traditional single distribution mode, while significantly reducing the business threshold through a visual rule configuration interface, shortening the risk control strategy adjustment cycle from days to hours, thereby providing strong technical support for the digital transformation of financial institutions.

[0140] Embodiments of the second aspect of the present application provide a process data processing apparatus. Referring to Figure 8 , the process data processing apparatus includes a data acquisition module 810, a double-linked list generation module 820, and a target finding module 830.

[0141] The data acquisition module 810 is configured to acquire record data generated in the process of the approval flow, and the record data includes a handler of an approval node, a name of the approval node, and an approval operation of the approval node, and the approval node includes each level node in the approval flow. The bidirectional linked list generation module 820 is configured to write the latest record data of each level approval node into each linked list node of the bidirectional linked list according to the record data, to form the bidirectional linked list representing the approval flow track, wherein each linked list node corresponds to each level approval node, and each linked list node is sequentially linked according to the order of the approval nodes. The target searching module 830 is configured to search, in response to a target searching request, a target linked list node from each linked list node of the bidirectional linked list, starting from a current linked list node, and according to the direction of each linked list node in the bidirectional linked list.

[0142] In particular, the flow data processing apparatus of the embodiment can use existing module products with data transmission, storage or operation processing functions in specific implementation.

[0143] In specific application, the specific implementation process of the functions of each module in the flow data processing apparatus of the embodiment can refer to the related description in the above method embodiment, which will not be described here.

[0144] The flow data processing apparatus of the embodiment constructs the bidirectional linked list representing the approval flow track through the data acquisition module 810 and the bidirectional linked list generation module 820, so that the target searching module 830 can search the target linked list node according to each linked list node of the bidirectional linked list when there is a target searching request. In this way, only one full data traversal is required to construct the bidirectional linked list, and then the target linked list node can be quickly searched by jumping through the bidirectional linked list in subsequent searching. Assuming that there is a nested operation, multiple full data traversals are not required, and only one full data traversal is required to construct the bidirectional linked list, which avoids the problem of multiple full data traversals caused by the nested operation in the related art, thereby facilitating the reduction of the calculation complexity and the improvement of the target searching efficiency.

[0145] The electronic device provided in the third aspect of the embodiment of the present application includes a processor 910 and a memory 920, as shown in the electronic device in Figure 9 , Figure 9 The processor 910 and the memory 920 are connected, for example, through a bus. Optionally, the electronic device can further include a transceiver. It should be noted that the transceiver in actual application is not limited to one, and the structure of the electronic device does not constitute a limitation on the embodiments of the present application.

[0146] The memory 920 is configured to store application program codes for implementing the solutions of the present application, and the processor 910 is configured to control the execution of the application program codes stored in the memory 920. The processor 910 is configured to execute the application program codes stored in the memory 920 to implement the content shown in the foregoing method embodiments.

[0147] The electronic device includes, but is not limited to, a mobile terminal such as a mobile phone, a notebook computer, a digital broadcast receiver, a PDA (Personal Digital Assistant), a PAD (Tablet Personal Computer), a PMP (Portable Multimedia Player), a car terminal (for example, a car navigation terminal), and the like, and a fixed terminal such as a digital TV, a desktop computer, and the like, and can be a server or the like. Figure 9 The electronic device shown is only an example, and should not bring any limitation to the functions and use range of the embodiments of the present application.

[0148] The electronic device of the present embodiment can construct a double-linked list representing the flow trajectory of the approval process by executing the control method in Embodiment One, and can search for a target linked list node according to each linked list node in the double-linked list. In this way, only one full data traversal is required to construct the double-linked list, and then the double-linked list can be used to quickly jump to the target linked list node during subsequent searches, thereby reducing the computational complexity and improving the search efficiency.

[0149] The above is only some embodiments of the present application, and is not used to limit the present application. The technical features or structures in the foregoing different embodiments can be combined as needed to form other specific technical solutions. The present application can have various changes and modifications for those skilled in the art. Any modification, equivalent replacement, improvement, etc. within the spirit and principles of the present application shall be included in the protection scope of the claims of the present application.

Claims

1. A process data processing method, characterized in that: The method includes: Acquire record data generated during the approval process, including the person handling the approval node, the name of the approval node, and the approval operation of the approval node. The approval node includes nodes at all levels in the approval process; Based on the recorded data, the latest recorded data of the approval nodes at each level are written into each linked list node of the bidirectional linked list, thereby forming a bidirectional linked list representing the flow trajectory of the approval process, wherein each linked list node corresponds to the approval nodes at each level, and each linked list node is linked in sequence according to the order of the approval nodes; In response to the target search request, starting from the current linked list node, the target linked list node is searched from each linked list node in the bidirectional linked list according to the direction of each linked list node in the bidirectional linked list.

2. The process data processing method according to claim 1, characterized in that: The step of writing the latest record data of the approval nodes at all levels into each linked list node of the bidirectional linked list according to the record data includes: Filtering the record data that are preset invalid records in the record data to obtain filtered record data; According to the filtered record data, the latest record data of the approval nodes at each level are written into each link table node of the bidirectional link list.

3. The process data processing method according to claim 1 or 2, characterized in that: The process of forming the bidirectional linked list representing the approval process flow trajectory includes: Create an empty doubly linked list; Traversing each item of recorded data in sequence according to the order in which the recorded data are generated; When traversing each record data, determining the current approval node of the process when the currently traversed record data is generated; According to the current approval node and the currently traversed record data, determining whether the current record data is the record data for which an approval operation is performed for the first time at the current approval node; If the current record data is the record data of the first approval operation performed at the current approval node, a new linked list node corresponding to the current approval node is created at the end of the current bidirectional linked list, and the current record data is written into the new linked list node; if the current record data is not the record data of the first approval operation performed at the current approval node, the current bidirectional linked list is updated according to the current record data and the current approval node; After adjusting the bidirectional linked list according to the current record data, the current approval node of the current process is re-determined, and if the next record data exists, the next record data is traversed, and after the traversal is completed, the bidirectional linked list representing the flow trajectory of the approval process is formed.

4. The process data processing method according to claim 3, characterized in that: The determining whether the current record data is the record data for which the approval operation is performed for the first time at the current approval node includes: Determine whether there is a linked list node corresponding to the current approval node in the current bidirectional linked list, and determine whether the current bidirectional linked list contains other approval records of the person who processed the current record data; When there is no linked list node corresponding to the current approval node in the current bidirectional linked list, and the current bidirectional linked list does not contain other approval records of the person who processed the current record data, it is determined that the current record data is the record data for which the approval operation is performed for the first time at the current approval node.

5. The process data processing method according to claim 4, characterized in that: When the current record data is not the record data of the first approval operation performed at the current approval node, updating the current bidirectional linked list according to the current record data and the current approval node includes: If a linked list node corresponding to the current approval node exists in the current bidirectional linked list, analyzing and determining a repeated operation type of the current recorded data according to the current recorded data; Determine the target modification approval node according to the preset modification node determination method corresponding to the repeated operation type; The current record data is updated to the linked list node corresponding to the target modification approval node.

6. The process data processing method according to claim 5, characterized in that: The determining of the target modification approval node according to the preset modification node determination method corresponding to the repeated operation type includes: When the repeated operation type is a type in which the processor returns the current level approval node to the previous level approval node and then withdraws the approval operation of returning the current level approval node to the previous level approval node, the approval node at the next level below the current approval node is used as the target modification approval node; When the repeated operation type is a type in which the processor returns the current level approval node to the dealer node and then withdraws the approval operation of returning the current level approval node to the dealer node, the first node of the current bidirectional linked list is used as the target modification approval node.

7. The process data processing method according to claim 4, characterized in that: When the current record data is not the record data of the first approval operation performed at the current approval node, updating the current bidirectional linked list according to the current record data and the current approval node includes: If there is no linked list node corresponding to the current approval node in the current bidirectional linked list, and the current bidirectional linked list contains other approval records of the person who processed the current record data, determining the type of the current record data; In a case where the type of the current record data is preset withdrawn record data that was submitted and then withdrawn, the linked list node corresponding to the upper-level approval node of the current approval node is updated according to the current record data.

8. The process data processing method according to claim 3, characterized in that: The preset movement rules of the current approval node include: When the approval operation is a return operation, the current approval node is moved to the approval node of the previous level of the current approval node; When the approval operation is a submit operation, moving the current approval node to the next-level approval node of the current approval node; When the approval operation is a withdraw operation, and when the withdraw operation is a first withdraw operation after returning to the previous approval node, moving the current approval node to the next-level approval node of the current approval node; When the withdrawal operation is a second withdrawal operation after submission to a next-level approval node, the current approval node is moved to an approval node one level above the current approval node. When the withdrawal operation is the third withdrawal operation after returning to the partner node, the current approval node is moved to the first node of the process approval.

9. A process data processing device, characterized in that: The process data processing device includes: A data acquisition module is used to acquire record data generated during the approval process, wherein the record data includes the person who handles the approval node, the name of the approval node, and the approval operation of the approval node. The approval node includes nodes at all levels in the approval process; a bidirectional linked list generation module, configured to write the latest recorded data of the approval nodes at each level into each linked list node of the bidirectional linked list based on the recorded data, thereby forming a bidirectional linked list representing the flow trajectory of the approval process, wherein each linked list node corresponds to the approval nodes at each level, and each linked list node is linked in sequence according to the order of the approval nodes; The target search module is used to respond to the target search request, start from the current linked list node, and search for the target linked list node from each linked list node in the bidirectional linked list according to the direction of each linked list node in the bidirectional linked list.

10. An electronic device, characterized in that: The electronic device comprises: one or more processors; a memory 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 process data processing method according to any one of claims 1 to 8.

Images