Data analysis method, device and equipment

By obtaining and analyzing the matter information processed by the nodes, identifying and replacing bottlenecks, the problem of inefficiency in the government matter processing process is solved, and the efficient operation of the matter processing process is achieved.

CN111178665BActive Publication Date: 2024-11-08TENCENT TECHNOLOGY (SHENZHEN) CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN201911144931.8
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2019-11-19
Publication Date
2024-11-08
Estimated Expiration
2040-11-08

AI Technical Summary

Technical Problem

It is difficult to find real bottlenecks in the process of government affairs processing, resulting in low processing efficiency.

Method used

By obtaining the matter information processed by each node, determining whether it is a bottleneck, and replacing the processing node when it is a bottleneck, improving the efficiency of the matter processing process.

Benefits of technology

Effectively discover and solve bottlenecks in the matter handling process, improving the efficiency of the entire matter handling.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN111178665B_ABST
    Figure CN111178665B_ABST
Patent Text Reader

Abstract

The embodiment of the present invention discloses a method, device and equipment for data analysis. The data analysis method obtains the matters processed by each of M nodes, and the processing flow of a matter includes at least one node, where M is a positive integer; determines whether the first node is a blocking point according to the matters processed by the first node, and the first node is any one of the M nodes; when the first node is a blocking point, if the processing time of the first matter at the first node is greater than a preset threshold, the first node in the processing flow of the first matter is replaced with a second node. Through the above data analysis method, by supervising each node included in the matter processing flow, the real blocking point is found therefrom, and when the processing time of the matter processed by the blocking point is greater than the preset time, the blocking point in the processing flow of the matter can be replaced, thereby improving the processing efficiency of the matter.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The embodiments of the present application relate to the field of the Internet, and in particular to a method, device and equipment for data analysis. Background Art

[0002] "Internet Plus" promotes the continuous change of social forms. The deep integration of the Internet and traditional industries provides a new platform for reform and innovation, thereby continuously improving our work efficiency.

[0003] At present, in the process of handling matters, the main detection method is to detect the granularity of the matter. By detecting the approval process of the entire matter, it is confirmed whether the matter has been completed. When the matter exceeds the expected time standard, an early warning will be given, but it is difficult to really promote the acceleration of the approval process. The reason is that in actual problems, the process of handling government affairs is often coordinated by multiple nodes, and the persons in charge of different nodes are not the same. It is difficult to find the real problems in the process of handling matters by detecting the process of the entire matter. It can be seen that in government affairs management, how to find the real problems in the process of handling matters and solve them has become a problem that needs to be solved in the current process of handling matters. Summary of the invention

[0004] The embodiment of the present invention discloses a method, device and equipment for data analysis, which solves the problem that it is difficult to find the real blocking point in the whole process of processing an event in the prior art, and the efficiency of event processing is low.

[0005] In a first aspect, an embodiment of the present application provides a method for data analysis, comprising:

[0006] Obtaining matters processed by each of the M nodes, where a process of processing a matter includes at least one node, and M is a positive integer;

[0007] Determine whether the first node is a blocking point according to matters processed by the first node, where the first node is any one of the M nodes;

[0008] When the first node is a bottleneck, if the processing time of the first matter at the first node is greater than a preset threshold, the first node in the processing flow of the first matter is replaced with a second node.

[0009] As a possible implementation manner, the first node and the second node are two nodes in a set of nodes managed by a management node of the first node, and the second node is a non-blocking node.

[0010] As a possible implementation manner, replacing the first node in the processing flow of the first matter with a second node includes:

[0011] Sending a node replacement request for the first matter to the management node of the first node, where the node replacement request is used to request the management node of the first node to replace the first node in the processing flow of the first matter with a node in the candidate node list;

[0012] receiving instruction information sent by the management node of the first node, the instruction information being used to instruct to replace the first node in the processing flow of the first matter with the second node, the second node being a node selected in the candidate node list;

[0013] According to the indication information, the first node in the processing flow of the first matter is replaced with the second node.

[0014] As a possible implementation manner, determining whether the first node is a blocking point according to matters processed by the first node, where the first node is any one of the M nodes, includes:

[0015] Determine whether the first node is a bottleneck based on at least one of the following: the number of overdue items completed, the number of non-overdue items completed, the number of overdue items not completed, the number of non-overdue items not completed, the processing time of each completed item, and the overdue time of each overdue item among the items processed by the first node.

[0016] As a possible implementation manner, determining whether the first node is a blocking point according to matters processed by the first node, where the first node is any one of the M nodes, includes:

[0017] If the number of unfinished items among the items processed by the first node is greater than a first threshold and the average processing time of completed items in the first node is greater than a second threshold, the first node is determined as a bottleneck.

[0018] As a possible implementation manner, determining whether the first node is a blocking point according to matters processed by the first node, where the first node is any one of the M nodes, includes:

[0019] If the number of unfinished and overdue items among the items processed by the first node is greater than a third threshold and the average processing time of completed items in the first node is greater than a fourth threshold, the first node is determined to be a bottleneck.

[0020] As a possible implementation manner, before replacing the first node in the processing flow of the first matter with a second node, the method further includes:

[0021] A reminder message for a first matter is received from a terminal of a party, wherein the reminder message is used to instruct processing of the first matter.

[0022] As a possible implementation, the method further includes:

[0023] Receiving a handling request for the second matter sent by a terminal of the party concerned;

[0024] Determining a processing flow of the second matter according to the matter type of the second matter, the processing flow of the second matter including Q nodes;

[0025] Determine, according to the processing time of each item in the historical completed items of the second node, the estimated processing time of the second node processing the second time, where the second node is any one of the Q nodes;

[0026] The estimated processing time for each of the Q nodes to process the second matter is sent to the terminal of the party concerned.

[0027] As a possible implementation, the M nodes belong to N sets, the nodes in one set process matters of the same type, N is a positive integer, and the method further includes:

[0028] Obtaining a processing efficiency of the first set according to at least one of completed non-overdue items, completed overdue items, uncompleted non-overdue items, and uncompleted overdue items among items processed by each node in the first set, where the first set is any one of the N sets;

[0029] According to the processing efficiency corresponding to each of the N sets, screening out a set whose processing efficiency is lower than a fifth threshold from the N sets;

[0030] Indication information is sent to the management node of each of the filtered sets, and the indication information sent to the management node of the second set is used to indicate that the processing efficiency of the second set is lower than the fifth threshold, and the second set is any one of the filtered sets.

[0031] As a possible implementation, the method further includes:

[0032] Receiving a request from the fourth node to view the warning item;

[0033] Determining, according to the viewing request, matters in the first set that meet a warning condition, the warning condition including that a difference between a processing time and an expected processing time limit is greater than a sixth threshold;

[0034] The information of the matter that has reached the warning condition is sent to the fourth node.

[0035] In a second aspect, an embodiment of the present application provides a data analysis device, the data analysis device comprising:

[0036] An acquisition unit, used for acquiring an item processed by each of the M nodes, wherein a processing flow of an item includes at least one node, and M is a positive integer;

[0037] A first determining unit, configured to determine whether the first node is a blocking point according to matters processed by the first node, wherein the first node is any one of the M nodes;

[0038] A replacement unit is used to replace the first node in the processing flow of the first matter with a second node when the first node is a blocking point and if the processing time of the first matter at the first node is greater than a preset threshold.

[0039] As a possible implementation manner, the first node and the second node are two nodes in a set of nodes managed by a management node of the first node, and the second node is a non-blocking node.

[0040] As a possible implementation manner, the replacement unit is specifically used for:

[0041] Sending a node replacement request for the first matter to the management node of the first node, where the node replacement request is used to request the management node of the first node to replace the first node in the processing flow of the first matter with a node in the candidate node list;

[0042] receiving instruction information sent by the management node of the first node, the instruction information being used to instruct to replace the first node in the processing flow of the first matter with the second node, the second node being a node selected in the candidate node list;

[0043] According to the indication information, the first node in the processing flow of the first matter is replaced with the second node.

[0044] As a possible implementation manner, the first determining unit is specifically configured to:

[0045] Determine whether the first node is a bottleneck based on at least one of the following: the number of overdue items completed, the number of non-overdue items completed, the number of overdue items not completed, the number of non-overdue items not completed, the processing time of each completed item, and the overdue time of each overdue item among the items processed by the first node.

[0046] As a possible implementation manner, the first determining unit is specifically configured to:

[0047] If the number of unfinished items among the items processed by the first node is greater than a first threshold and the average processing time of completed items in the first node is greater than a second threshold, the first node is determined as a bottleneck.

[0048] As a possible implementation manner, the first determining unit is specifically configured to:

[0049] If the number of unfinished and overdue items among the items processed by the first node is greater than a third threshold and the average processing time of completed items in the first node is greater than a fourth threshold, the first node is determined as a bottleneck. As a possible implementation, the device further includes:

[0050] The first receiving unit is used to receive a reminder message sent by the terminal of the party for the first matter before the replacement unit replaces the first node in the processing flow of the first matter with a second node, wherein the reminder message is used to instruct the processing of the first matter.

[0051] As a possible implementation manner, the device further includes:

[0052] A second receiving unit, configured to receive a handling request for a second matter sent by a terminal of a party;

[0053] a second determining unit, configured to determine a processing flow of the second matter according to the matter type of the second matter, wherein the processing flow of the second matter includes Q nodes;

[0054] A third determining unit is used to determine an estimated processing time for the second node to process the second time duration according to the processing time of each item in the history of completed items of the second node, where the second node is any one of the Q nodes;

[0055] The first sending unit is used to send the estimated processing time of each of the Q nodes for processing the second matter to the terminal of the party.

[0056] As a possible implementation manner, the M nodes belong to N sets, the nodes in one set process matters of the same type, N is a positive integer, and the device further includes:

[0057] a fourth determining unit, configured to obtain a processing efficiency of the first set according to at least one of completed non-overdue items, completed overdue items, uncompleted non-overdue items, and uncompleted overdue items among items processed by each node in the first set, wherein the first set is any one of the N sets;

[0058] a screening unit, configured to screen out a set having a processing efficiency lower than a fifth threshold from the N sets according to a processing efficiency corresponding to each set in the N sets;

[0059] A second sending unit is used to send indication information to the management node of each set in the filtered set, and the indication information sent to the management node of the second set is used to indicate that the processing efficiency of the second set is lower than the fifth threshold, and the second set is any one of the filtered sets.

[0060] As a possible implementation manner, the device further includes:

[0061] A third receiving unit, configured to receive a viewing request from a fourth node for an early warning event;

[0062] a fourth determining unit, further configured to determine, according to the viewing request, items in the first set that meet a warning condition, wherein the warning condition includes that a difference between a processing time and an expected processing time limit is greater than a sixth threshold;

[0063] The second sending unit is further used to send the information of the matter that meets the warning condition to the fourth node.

[0064] In a third aspect, an embodiment of the present application provides a data analysis device, which includes a processor and a memory, wherein the processor and the memory are coupled, wherein the memory is used to store computer instructions, and the processor is used to execute the computer instructions and call the program code to implement the data analysis method disclosed in the embodiment of the first aspect.

[0065] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a computer device, the data analysis method disclosed in the embodiment of the first aspect is implemented.

[0066] In an embodiment of the present invention, the matters processed by each of the M nodes are obtained, and the processing flow of a matter includes at least one node, where M is a positive integer; whether the first node is a blocking point is determined based on the matters processed by the first node, and the first node is any one of the M nodes; when the first node is a blocking point, if the processing time of the first matter at the first node is greater than a preset threshold, the first node in the processing flow of the first matter is replaced with a second node. By implementing an embodiment of the present invention, by supervising each node included in the matter processing flow, the real blocking point is discovered, and when the processing time of the matter processed by the blocking point is greater than the preset time, the blocking point in the processing flow of the matter can be replaced, thereby improving the processing efficiency of the entire matter. BRIEF DESCRIPTION OF THE DRAWINGS

[0067] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0068] Figure 1a It is a schematic diagram of the relationship between an event, a matter and a node provided by an embodiment of the present invention;

[0069] Figure 1b is a schematic diagram of a system architecture for data analysis provided by an embodiment of the present invention;

[0070] Figure 2a It is a flowchart of a data analysis method provided by an embodiment of the present invention;

[0071] Figure 2b It is a flowchart of a data analysis method provided by an embodiment of the present invention;

[0072] Figure 3 An exemplary method of obtaining M nodes from a database and the matters processed by each of the M nodes is given;

[0073] Figure 4 A method flow chart including at least one node according to a processing flow of a congestion point adjustment matter provided by an embodiment of the present invention;

[0074] Figure 5 It is a flowchart of a method for obtaining an estimated processing time of each node in a processing flow of an item provided by an embodiment of the present invention;

[0075] Figure 6 It is a flow chart of a method for determining a low-efficiency set and sending prompt information to the low-efficiency set provided by an embodiment of the present invention;

[0076] Figure 7 An exemplary user interface diagram for viewing processing information of matters processed by a business department is provided;

[0077] Figure 8 A user interface diagram showing, by way of example, processing information of a matter handled by a business department;

[0078] Fig. 9 A user interface diagram of processing information of each item in a type of item is exemplarily provided;

[0079] Fig.10 An exemplary user interface diagram of a detailed processing information page of a matter is given;

[0080] Fig.11 A user interface diagram showing the statistics of items that have reached the warning conditions in each department is given as an example;

[0081] Fig.12 An exemplary user interface diagram for viewing processing information of a department's warning items is provided;

[0082] Fig.13 A user interface diagram showing detailed information of an alarm item is provided as an example;

[0083] Fig.14 It is a structural schematic diagram of a data analysis provided by an embodiment of the present invention;

[0084] Fig.15 It is a structural schematic diagram of another data analysis device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0085] The embodiment of the present invention discloses a method and device for data analysis, which are used to improve the efficiency of matter processing. The technical scheme in the embodiment of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiment of the present invention. Obviously, the described embodiment is only a part of the embodiment of the present invention, not all of the embodiments. Based on the embodiment of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.

[0086] It should be noted that the terms used in the embodiments of the present invention are only for the purpose of describing specific embodiments, and are not intended to limit the present invention. The singular forms of "a", "said" and "the" used in the embodiments of the present invention and the appended claims are also intended to include plural forms, unless the context clearly indicates other meanings. It should also be understood that the term "and / or" used herein refers to and includes any or all possible combinations of one or more associated listed items.

[0087] It should be noted that the relationship between events, matters and nodes in the embodiments of the present application is as follows: an event includes at least one matter, and the processing flow of a matter includes at least one node. It should be understood that when a party applies for an event, in the actual process of handling the event, the event may usually require the collaboration of multiple departments to complete. Therefore, an event can be composed of multiple matters, each of which is completed by the corresponding processing department, and each matter includes a specific processing flow. For example, Figure 1aAs shown, it is a flow chart of the relationship between events, matters and nodes provided in an embodiment of the present application. As shown in the figure, the party submits an event "I want to open a supermarket" to the government affairs system. The event may include matters "Application for issuance of "Food Business License", "Fire filing for completion acceptance of construction project" and "Registration and verification of taxpayer's real-name tax information". Among them, the matter "Application for issuance of "Food Business License"" is handled by the "Market Supervision Bureau", and the processing flow includes nodes a, b and c; the matter "Fire filing for completion acceptance of construction project" is handled by the "Housing and Urban-Rural Development Bureau", and the processing flow includes nodes e, f, g and h; the matter "Registration and verification of taxpayer's real-name tax information" is handled by the "Tax Bureau", and the processing flow includes nodes i and m.

[0088] First, the concepts and terms involved in the embodiments of the present application are briefly introduced.

[0089] (1) Node

[0090] In the embodiment of the present application, the entire processing flow of a matter is divided into at least one part, each part corresponds to a node, the processing flow of a matter includes at least one node, and a node can also process multiple matters. After node a of a matter is processed, node b starts to process the matter. In the processing flow of the matter, node b is the next node of node a. A node corresponds to at least one processor (or terminal).

[0091] (2) Expiration

[0092] In the embodiment of the present application, overtime includes three forms: item overtime at the node, item overtime, and event overtime. Among them, item overtime at the node includes completed items overtime at the node and unfinished items overtime at the node. If the item is completed at the node, and the difference between the completion time of the item at the node and the time when the item enters the node is greater than the preset processing time of the item at the node, then the completed item is overtime at the node; if the item is not completed at the node, and the difference between the current time and the time when the item enters the node is greater than the preset processing time of the item at the node, then the unfinished item is overtime at the node. Item overtime includes completed item overtime and unfinished item overtime. If the item is completed, the completion time of the item and the start time of the item are greater than the preset processing time of the item, then an overdue item is formed; if the item is not completed, then in the nodes included in the processing flow of the item, if there is an item overtime at the node, then an overdue item is formed. If there is an overtime of the item constituting the event, then the event is overtime.

[0093] (3) The processing status of the event at the node

[0094] The processing status of items at a node may include: completed and not overdue, completed and overdue, not completed and not overdue, and not completed and overdue. The processing status is obtained based on the estimated completion time and actual completion time of item a at node a. If the actual completion time of item a at node a does not exceed the estimated completion time of item a at node a, then the processing status of item a at node a is completed and not overdue; if the actual completion time of item a at node a exceeds the estimated completion time of item a at node a, then the processing status of item a at node a is completed and overdue; if the actual completion time of item a at node a is empty and the current time has not exceeded the estimated completion time, then the processing status of item a at node a is not completed and not overdue; if the actual completion time of item a at node a is empty and the current time exceeds the estimated completion time, then the processing status of item a at node a is not completed and overdue.

[0095] See also Figure 1b , Figure 1b It is a schematic diagram of a system architecture of data analysis disclosed in an embodiment of the present invention. As shown in FIG1 , the system architecture diagram may include a first terminal 101, a second terminal 102, a third terminal 103, a server 104, and a database 105. Among them, the first terminal can be understood as a terminal corresponding to a user, the second terminal can be understood as a terminal corresponding to a person who handles matters, and the third terminal can be understood as a terminal corresponding to a manager.

[0096] The database 105 stores at least one data table, and the at least one data table stores processing information of nodes and matters processed by the nodes: including M nodes, matters processed by each of the M nodes, and the processing status of each matter at the node processing the matter, etc. For example, when the user of "node a" completes processing of "matter A", the server 104 sends the information that "matter A" is processed at "node a" to the database 105, so that the database 105 can update the processing status of "matter A" at "node a" in the database.

[0097] In an implementation scenario of a government affairs system, the database 105 stores government affairs events handled nationwide, each government affairs event includes at least one government affairs item, and the processing information of each government affairs item is stored in at least one data table. A user can determine all the processing information of a government affairs item according to the application serial number of the item, and the application serial number is the only identifier that determines an item in the data table.

[0098] The first terminal 101 is a platform for users to apply for matters. The first terminal 101 receives events applied for by the public based on the client and generates a request, and then sends the request containing the event to the server 104, so that the server 104 determines the processing flow of the matter and the processing node of the matter according to the type of matter in the request. The first terminal 101 is also used to send a reminder message of the event applied for by the user to the server 104, and the reminder message is used to instruct the second terminal 102 to handle the unfinished matters included in the event. The first terminal 101 is also used to receive the estimated processing time of each node sent by the server 104, so that the user of the first terminal 101 can know the estimated time required for each stage of the applied event.

[0099] After receiving the request sent by the first terminal 101, the server 104 determines the type of each item in all items included in the event according to the event contained in the request, and then determines the processing flow of each item according to the type of the item. The processing flow of each item includes at least one node, that is, at least one second terminal 102 is included to process the process of the item. The server 104 can also obtain at least one of the number of completed overdue items, the number of completed non-overdue items, the number of uncompleted overdue items, the number of uncompleted non-overdue items, the processing time of each completed item, and the overdue time of each overdue item from the database 105, to determine which nodes among the M nodes are blocking points. For example, according to the number of uncompleted items in "node a" and the average processing time of completed items in "node a", it is determined whether "node a" is a blocking point. If the number of uncompleted items in the items processed by "node a" is greater than the first threshold and the average processing time of completed items in "node a" is greater than the second threshold, then "node a" is determined to be a blocking point. Among them, the first threshold and the second threshold can be preset. When the server 104 receives the reminder message for the first item sent by the terminal 101, the server 104 first determines whether there is a bottleneck in the processing flow of the first item. If there is a first node in the processing flow of the first item that is a bottleneck, the server 104 detects the processing status of the first item at the first node. If the processing status of the first item at the first node is an unfinished item, the processing time of the first item at the first node is detected. If the processing time of the first item at the first node is greater than a preset threshold, the first node in the processing flow of the first item is replaced. In addition, the server 104 is also used to send a prompt message to the second terminal 102 where the bottleneck is located, so as to prompt the item handler corresponding to the second terminal 102 to promptly handle the unfinished items in the items processed by the node.

[0100] When the user of the first terminal 101 submits an event, the server 104 is also used to determine the estimated processing time of each node included in the event, and send the estimated processing time to the first terminal 101 to prompt the first terminal 101 of the estimated time required for the processing of the party's matter. The server 104 is also used to calculate the processing efficiency of each collectively processed matter, and send the processing efficiency of each collectively processed matter to the third terminal 103. The server 104 is also used to screen out matters that meet the warning conditions, and send the screened matters to the third terminal 103.

[0101] The second terminal 102 is a matter processing terminal. The second terminal 102 records the processing information of each matter entering the second terminal 102, including the entry time, expected processing period, actual completion time, etc., and sends the recorded processing information of each matter to the server 104, so that the server 104 updates the processing information of the matter to the database 105.

[0102] The third terminal 103 is a management node. The third terminal 103 is also used to receive the processing efficiency of each set sent by the server 104, so that the third terminal 103 can adjust the items processed by the set according to the processing efficiency of the set. The third terminal 103 is also used to view the warning items in each set. Among them, the first terminal, the second terminal and the third terminal can be a computer, a mobile phone, a tablet, or other smart devices that can obtain the data to be analyzed, which is not limited here.

[0103] Optionally, the first terminal 101, the second terminal 102, and the third terminal 103 may be the same terminal.

[0104] Optionally, the database 105 may exist independently or in the server 104 .

[0105] The data analysis system architecture diagram is not limited to the data analysis system architecture diagram shown in FIG1 . The data analysis system architecture diagram provided in the embodiment of the present application may also include other devices, which are not limited here.

[0106] See also Figure 2a and Figure 2b , Figure 2a , Figure 2b FIG. 1 is a flow chart of a data analysis method disclosed in an embodiment of the present invention. Figure 2a and Figure 2b As shown, the data analysis method can be implemented by the data analysis system shown in Figure 1 above, wherein the terminal of the party can be the first terminal 101, the first node can be the second terminal 102, the management node of the first node can be the third terminal 103, the server can be the server 104, and the database can be the database 105. The implementation of the data analysis method can include the following steps.

[0107] S202. The server obtains the matters processed by each of the M nodes. The processing flow of one matter includes at least one node, and M is a positive integer.

[0108] The server obtains M nodes and the items processed by each of the M nodes from the database, thereby obtaining the processing information of each item processed by each node at the node. The processing information includes the expected processing period, entry time, expected completion time, actual completion time and processing status of each item processed by each node at the node. For example, the items processed by node a include item a, and the expected processing period of item a at node a is the preset time when item a is expected to be processed and completed at node a; the time when item a arrives at node a is the entry time of item a entering node a; the expected completion time of item a at node a can be obtained based on the entry time of item a at node a and the expected processing period; the actual completion time refers to the time when item a is actually completed at node a; the processing status is obtained based on the expected completion time and actual completion time of item a at node a. If the actual completion time of item a at node a does not exceed the expected completion time of item a at node a, then the processing status of item a at node a is completed and not overdue.

[0109] See also Figure 3 , Figure 3 The server obtains M nodes from the database and the matters processed by each of the M nodes as an example. If the time when the M nodes and the matters processed by each of the M nodes are obtained is 2019 / 08 / 20, then the current time is 2019 / 08 / 20. Figure 3 As shown, it includes M nodes and the matters processed by each of the M nodes. Figure 3 It can be seen that the items processed by node 1 include item 1, item 3 and item 5, and the processing flow of item 1 includes at least node 1 and node 2. In addition, the processing information of the item at each node that processes the item can also be obtained, for example, Figure 3 As shown, the processing information of item 1 at node 1 includes the expected processing period of item 1 at node 1 being 10 working days; the entry time of item 1 into node 1 being 2019 / 08 / 26; the expected completion time of item 1 at node 1 being 2019 / 08 / 20 according to the expected processing period and entry time of item 1 at node 1; the actual completion time of item 1 at node 1; and the processing status of item 1 at node 1 being determined to be unfinished and overdue according to the expected completion time and actual completion time of item 1 at node 1. S204. The server determines whether the first node is a blocking point according to the items processed by the first node, and the first node is any one of the M nodes.

[0110] The server determines whether the first node is a bottleneck based on at least one of the following: the number of completed overdue items, the number of completed non-overdue items, the number of uncompleted overdue items, the number of uncompleted non-overdue items, the processing time for each completed non-overdue item, and the processing time for each completed overdue item among the items processed by the first node.

[0111] Among them, according to the processing information of each matter processed by the first node at the first node, determining whether the first node is a bottleneck may include the following three implementation methods.

[0112] Implementation method (I):

[0113] If the number of unfinished items among the items processed by the first node is greater than a first threshold and the average processing time of completed items in the first node is greater than a second threshold, the first node is determined as a bottleneck.

[0114] Among them, the unfinished items among the items processed by the first node include items whose processing status at the first node is unfinished and not overdue and unfinished and overdue. The completed items among the items processed by the first node include items whose processing status at the first node is completed and not overdue and completed and overdue. The processing time of each completed item at the first node is determined according to the entry time of the item at the first node and the actual completion time. The average processing time of completed items is determined according to the processing time of each completed item in the first node and the number of completed items. If the number of unfinished items in the first node is greater than the first threshold, and the average processing time of completed items in the first node is greater than the second threshold, the first node is determined to be a bottleneck, otherwise, the first node is not a bottleneck.

[0115] For example, Figure 3 As shown, the unfinished items in node 1 include item 1, so the number of unfinished items in node 1 is 1. The completed items in node 1 include items 3 and 5, so the number of completed items in node 1 is 2. Among them, the processing time of item 3 is 7 working days; the processing time of item 5 is 4 working days. It can be obtained that the average processing time of completed items in node 1 is 5.5 working days. If the first threshold is 1 and the second threshold is 5 working days, it can be judged that node 1 is not a bottleneck.

[0116] Optionally, the first threshold and the second threshold may be set according to the processing efficiency of the nodes in the system.

[0117] Implementation method (two):

[0118] If the number of unfinished and overdue items among the items processed by the first node is greater than the third threshold and the average processing time of the completed items in the first node is greater than the fourth threshold, the first node is determined as a bottleneck.

[0119] Among them, the completed items among the items processed by the first node include items whose processing status at the first node is completed and not overdue and completed and overdue. The processing time of each completed item at the first node is determined according to the entry time and actual completion time of the item at the first node. The average processing time of completed items is determined according to the processing time of each completed item in the first node and the number of completed items. If the number of unfinished and overdue items in the first node is greater than the third threshold, and the average processing time of completed items in the first node is greater than the fourth threshold, the first node is determined to be a bottleneck, otherwise, the first node is not a bottleneck.

[0120] For example, Figure 3 As shown, the unfinished overdue items in node 1 include item 1, so the number of unfinished overdue items in node 1 is 1. The completed items in node 1 include items 3 and 5, so the number of completed items in node 1 is 2. Among them, the processing time of item 3 is 7 working days; the processing time of item 5 is 4 working days. It can be obtained that the average processing time of completed items in node 1 is 5.5 working days. If the third threshold is 1 and the fourth threshold is 6 working days, it can be judged that node 1 is not a bottleneck.

[0121] Optionally, the third threshold and the fourth threshold may be set according to the processing efficiency of the nodes in the system.

[0122] Implementation method (three):

[0123] The server determines the proportion of overdue items among the items processed by the first node, and if the proportion is greater than a seventh threshold, determines that the first node is a bottleneck.

[0124] The value of the seventh threshold is greater than 0 and less than 1. The overdue items among the items processed by the first node include items whose processing status is completed overdue and uncompleted overdue.

[0125] For example, Figure 3 As shown, the overdue items in the items processed by node 1 include item 1 and item 3, and the items processed by node 1 include item 1, item 3 and item 5. It can be obtained that the proportion of overdue items in node 1 in the items processed by node 1 is 2 / 3. If the seventh threshold is preset to 0.6, node 1 can be determined to be a bottleneck.

[0126] Optionally, the seventh threshold may be set according to the processing efficiency of the nodes in the system.

[0127] Optionally, determining whether the first node is a blocking point is not limited to the above two implementations. Different implementations of determining a blocking point may produce different results in determining whether a node is a blocking point.

[0128] Optionally, the implementation methods of determining whether a node is a blocking point are not limited to the above three methods, and the implementation method of determining whether a node is a blocking point can be determined according to user needs.

[0129] After the server obtains the items processed by each of the M nodes, the server can also receive a reminder message sent by the terminal of the party for the first item, and the reminder message is used to instruct to process the first item. If the processing flow of the first item includes the first node, the following describes how the server processes the reminder message for the first item.

[0130] S206: When the first node is a bottleneck, if the processing time of the first matter at the first node is greater than a preset threshold, the first node in the processing flow of the first matter is replaced with a second node.

[0131] Among them, the first matter can be any one of the matters processed by the first node whose processing time is longer than the preset threshold, or it can be the matter processed by the first node whose processing time is longer than the preset threshold and is urged by the parties to be processed. There is no limitation on this.

[0132] First, the server determines whether there is a bottleneck in the processing flow of the first item; secondly, the server determines whether the first item is an unfinished item at the bottleneck; finally, the server determines whether the processing time of the first item at the bottleneck is greater than the preset threshold. When there is a bottleneck in the processing flow of the first item and the first item is an unfinished item at the bottleneck and the processing time of the first item at the bottleneck is greater than the preset threshold, the bottleneck in the processing flow of the first item is replaced with a replacement node for the bottleneck. If the processing flow of the first item includes a first node, then when the first node is a bottleneck, and the first item is an unfinished item at the first node, and the processing items of the first item at the first node are greater than the preset threshold, the first node is replaced with the replacement node of the first node, that is, the second node. Among them, the first node and the second node are two nodes in the set of nodes managed by the management node of the first node, and the second node is a non-blocking point. Optionally, the preset threshold can be set according to user needs.

[0133] The following describes a specific implementation method of replacing the first node in the processing flow of the first matter with the second node, which may refer to all or part of the following steps:

[0134] S2061. The server sends a node replacement request for a first matter to the management node of the first node, where the node replacement request is used to request the management node of the first node to replace the first node in the processing flow of the first matter with a node in the candidate node list;

[0135] S2062. The server receives instruction information sent by the management node of the first node, where the instruction information is used to instruct to replace the first node in the processing flow of the first matter with the second node, where the second node is a node selected in the candidate node list;

[0136] S2063. The server replaces the first node in the processing flow of the first matter with the second node according to the instruction information.

[0137] For example, Figure 4 As shown, it is a schematic diagram of a node processing matter in a set provided by an embodiment of the present application. In the actual handling of government affairs, there will be multiple users applying for the event "I want to open a supermarket", and "I want to open a supermarket" includes the matter "Application for issuance of "Food Business License". The server assigns an application number to multiple matters of the same type "Application for issuance of "Food Business License"" as a mark that uniquely identifies a matter, as shown in the figure, "ID: 01", "ID: 02", "ID: 03", "ID: 04", etc. The matter "Application for issuance of "Food Business License"" is executed by the "Market Supervision and Administration Bureau". If a group A in the "Market Supervision and Administration Bureau" includes: management node A, node a, node b, node c, node a1, node b1, node a2, node b2 and node c1, a total of nine nodes, among which node a, node a1 and node a2 are nodes for processing the same process; node b, node b1, and node b2 are nodes for processing the same process; node c and node c1 are nodes for processing the same process. The processing flow of the item "Application for and Issuance of Food Business License" includes three nodes. Items "ID: 01", "ID: 02", "ID: 03" and "ID: 04" are executed by nodes a, b and c. When the server receives a reminder message for item "ID: 04" from the party involved in item "ID: 04", the server determines whether node b is a bottleneck. After determining that node b is a bottleneck, if the server detects that the processing status of item "ID: 04" at node b is an unfinished item, and the processing time of item "ID: 04" at node b is greater than a preset threshold, the server detects whether nodes b1 and b2 that process the same process as node b are bottlenecks. If the server detects that node b1 is not a bottleneck and node b2 is not a bottleneck, The candidate node list formed by node b1 and node b2 is sent to management node A, and the processor of management node A selects a node from the nodes included in the candidate node list as a replacement node for node b. If the processor of the management node selects node b1 as a replacement node for node b from the candidate node list, after the server receives the replacement node b1 selected by management node A, it replaces node b in the processing flow of matter "ID: 04" with node b1. At this time, the processing flow of matter "ID: 04" is changed to: node a, node b1 and node c.

[0138] Optionally, the method for detecting whether node b, node b1 and node b2 are blocking points can adopt any one of the above-mentioned implementation method (one), implementation method (two) or implementation method (three), or other methods for determining whether a node is a blocking point can be adopted according to user needs.

[0139] In some embodiments, the server may also send prompt information to each bottleneck point among the M nodes, wherein the prompt information sent to the first bottleneck point is used to prompt the person handling the first bottleneck point to handle unfinished matters among the matters handled by the first bottleneck point, and the first bottleneck point is any bottleneck point among the M nodes.

[0140] In some embodiments, the server may also send the estimated processing time of each node in all nodes included in the matter processing flow to the party who applied for the matter, so that the party concerned can know the estimated processing time required for the matter. Figure 5 , Figure 5 is a flowchart of a method for obtaining an estimated processing time of each node in a processing flow of an item disclosed in an embodiment of the present application, such as Figure 5 As shown, the method may include the following steps.

[0141] S502. The server receives a processing request for the second matter sent by the terminal of the party concerned.

[0142] The second matter is any one of the matters included in the second event, the second event includes at least one matter, and the second event is any one event received by the server.

[0143] S504. The server determines a processing flow of the second matter according to the matter type of the second matter, and the processing flow of the second matter includes Q nodes.

[0144] According to the item type to which the received second item belongs, nodes are allocated to the processing flow of the second item.

[0145] S506. The server determines the estimated processing time of the second node for processing the second item based on the processing time of each item in the history of completed items of the second node, where the second node is any one of the Q nodes.

[0146] Optionally, one implementation method for determining the estimated processing time for the second node to process the second matter may be to obtain the estimated processing time for the second node to process the second matter based on the average processing time for historically completed matters of the second node.

[0147] The method of determining the estimated processing time for the second node to process the second matter is not limited to the above-mentioned method, and a suitable method can be selected according to the actual processing information of the matter processed by the node.

[0148] S508. The server sends the estimated processing time of each of the Q nodes for processing the second matter to the terminal of the party concerned.

[0149] For example, Figure 3 As shown, if the processing flow of the second item includes node 1 and node 2. Among them, the average processing time of historical completed items in node 1: the completed items in node 1 include items 3 and 5, so the number of completed items in node 1 is 2. Among them, the processing time of item 3 is 7 working days; the processing time of item 5 is 4 working days. It can be obtained that the average processing time of completed items in node 1 is 5.5 working days. The average processing time of historical completed items in node 2: the completed items in node 2 include items 1, 2, 5 and 6, so the number of completed items in node 2 is 4. Among them, the processing time of item 1 is 5 working days; the processing time of item 2 is 1 working day; the processing time of item 5 is 8 working days; the processing time of item 6 is 12 working days. It can be obtained that the average processing time of completed items in node 2 is 6.5 working days. Then, the average processing time of node 1 and node 2 is sent to the terminal of the party involved in the second matter, so that the party involved in the second matter can know the estimated processing time required for each processing stage of the second matter.

[0150] Optionally, the M nodes belong to N sets respectively, and can send indication information to the set with low efficiency in processing items, so as to prompt each node in the set with low efficiency to improve the efficiency of processing items. Figure 6 , Figure 6 is a flow chart of a method for determining a low-efficiency set and sending prompt information to the low-efficiency set disclosed in an embodiment of the present application, such as Figure 6 As shown, the method may include the following steps.

[0151] S602. The server obtains the processing efficiency of the first set based on at least one of the completed non-overdue items, completed overdue items, uncompleted non-overdue items, and uncompleted overdue items among the items processed by each node in the first set. The first set is any one of the N sets.

[0152] The calculation of the processing efficiency of the first set may include the following two implementation methods.

[0153] Implementation method (A):

[0154] By calculating the efficiency of each node in the first set in processing matters, the average processing efficiency of all nodes in the first set in processing matters is obtained, and the average processing efficiency of all nodes in the first set is taken as the processing efficiency of the first set.

[0155] The processing efficiency of each node in the first set is calculated based on the number of completed items and the number of overdue items among the items processed by the node, that is, the number of completed items by the node / (the number of completed items by the node + the number of overdue items completed by the node)

[0156] For example, Figure 3 As shown, if the first set includes node 1 and node 2. The processing efficiency of node 1 is calculated based on the number of completed items and the number of completed overdue items in the items processed by node 1. The completed items in node 1 include item 3 and item 5, a total of 2 items; the overdue items in node 1 include item 3, a total of 1 item; it can be obtained that the processing efficiency of node 1 is 2 / (2+1)=0.667, that is, 66.7%; the completed items in node 2 include item 1, item 2, item 5 and item 6, a total of 4 items; the overdue items in node 2 include item 6, a total of 1 item; it can be obtained that the processing efficiency of node 2 is 4 / (4+1)=0.8, that is, 80%. The average processing efficiency of all nodes in the first set is (66.67%+80%) / 2=0.73, that is, 73%, so the processing efficiency of the first set is 73%.

[0157] Implementation method (B):

[0158] The processing efficiency of the first set is determined according to the number of completed items and the number of completed overdue items in all nodes included in the first set.

[0159] The processing efficiency of the first set is calculated by: the number of completed items in the first set / (the number of completed items in the first set + the number of overdue items in the first set)

[0160] For example, Figure 3 As shown, if the first set includes node 1 and node 2, the completed items in the first set include items 3 and 6 in node 1, and also include items 1, 2, 5 and 6 in node 2, a total of 6 items; the completed overdue items in the first set include item 3 in node 1, and also include item 6 in node 2, a total of 2 items; so the processing efficiency of the first set is 6 / (6+2)=0.75, that is, 75%.

[0161] Optionally, the processing efficiency of the first set calculated according to different implementations may be different.

[0162] Optionally, the implementation manners of calculating the processing efficiency of the first set are not limited to the above two.

[0163] S604: The server selects a set whose processing efficiency is lower than a fifth threshold from the N sets according to the processing efficiency corresponding to each set in the N sets.

[0164] Optionally, the fifth threshold is determined according to user needs, and the value of the fifth threshold is greater than 0 and less than 1.

[0165] For example, if the value of the fifth threshold is 0.8, by calculating the processing efficiency of the first set and selecting implementation mode (A), it can be obtained that the processing efficiency of the first set is lower than the fifth threshold.

[0166] S606. The server sends indication information to the management node of each of the filtered sets. The indication information sent to the management node of the second set is used to indicate that the processing efficiency of the second set is lower than the fifth threshold. The second set is any one of the filtered sets.

[0167] For example, according to the above steps, the first set can be screened out as a set whose processing efficiency is lower than the fifth threshold, and an indication information for indicating that the processing efficiency of the first set is lower than the threshold is sent to the management node of the first set, so as to prompt the user corresponding to each node in the first set to improve the efficiency of processing matters.

[0168] In one implementation scenario of an embodiment of the present application, the national government affairs system can manage the government affairs of the whole country. The national government affairs system brings together the government affairs of each province in the country. The government affairs of each province can be divided according to administrative divisions or according to business departments. An administrative division or a business department is equivalent to a set, and a person (or terminal) in an administrative division or a business department is equivalent to a node. An event includes at least one matter, and the matters included in an event can be handled by multiple business departments. Through the national government affairs system, you can view the processing information of the matters handled by each administrative division or business department.

[0169] For example, see Figure 7 , Figure 7 An exemplary user interface diagram for viewing the processing information of matters handled by a business department is provided. Figure 7 As shown, the user interface includes a province selection control 701, a date selection control 702, and a display container 703. Among them, the identity selection control 701 is used to save the province selected by the user; the date selection control 702 is used to receive and save the date selected by the user; the display container 703 is used to display the processing information of the matters handled by the administrative region or business department queried through the contents saved by the province selection control 701 and the contents saved by the date selection control 702. The processing information of the matters handled by each administrative division can be displayed according to the administrative division, and the processing information of the matters handled by each business department can also be displayed according to the business department. For example, Figure 7As shown, when the terminal detects that the province selected by the province selection control 701 is "Guangdong Province" and the date selected by the date selection control 702 is "2019-02", the terminal sends the contents saved by the province selection control 701 and the date selection control 702 to the server, so that the server can find out the items that meet the above conditions in the database and display the processing results of the found items in the display container 703 in the selected form. Figure 7 As shown, the display container 703 displays the processing information of each part of the matters according to the business part, and can display the number of businesses being processed, the number of businesses completed on time, the number of abnormal overtime completions, and the number of delayed businesses of each business department.

[0170] Select as Figure 7 After selecting a business department, you can also view the details of the matters handled by the business department. Figure 8 , Figure 8 The following is a user interface diagram showing information on a business department's processing of a matter. Figure 8 As shown, the user interface includes a display container 801, a page control area 802 and a return control 803. The display container 801 is used to display the items handled by a business department, and display the processing details of the items handled by a department according to the type of the items; the page control area 802 is used to view all types of items handled by a business department, and can also know the total number of types of items handled by a business department according to the sequence number corresponding to the current page; for example, when in Figure 7 When you select "Guangdong Provincial Department of Culture" in the user interface shown in the figure, enter the following Figure 8 In the user interface shown, you can view in display control 801 that the types of matters handled by the "Guangdong Provincial Department of Culture" include approval of construction project design plans within the construction control zone of cultural relics protection units, cultural relics protection unit cultural relics project permits and other types of matters. And you can view the statutory completion time limit, promised completion time limit, number of ongoing businesses, number of cases completed on time, number of overdue completion exceptions, percentage of overdue completion exceptions, number of delayed business and other information for each type of matter currently handled by the "Guangdong Provincial Department of Culture". Return control 803 is used to return to the previous page, for example, return to Figure 7 The user interface shown.

[0171] Select as Figure 8 After selecting a type of matter, you can also view the processing information of each matter in all matters of this type. Fig. 9 , Fig. 9 The following is an exemplary user interface diagram of processing information of each item in a type of item. Fig. 9As shown, the user interface includes a display container 901 and a return control 902. The return control 902 is used to return to the previous user interface, for example, to return to the previous user interface. Figure 8 The user interface shown. Display container 901 is used to display the processing information of each item of all items included in a type of item, such as the application serial number, acceptance time, commitment period, remaining days, etc. of a specific item. In addition, display container 901 also includes operation area 9011. When input to operation area 9011 is detected, the business details of the item corresponding to the input can be viewed. For example, when the input of "business details" of the item with application serial number "495131" is detected, it jumps to the detailed processing page of item "495131". Please refer to Fig.10 , Fig.10 The following is an exemplary user interface diagram of a detailed processing information page of a matter. Fig.10 As shown, the user interface includes a first container 1001 and a second container 1002. The first container 1001 is used to display basic information of the selected item, and the second container 1002 is used to display processing details of each node in all nodes included in the processing flow of the selected item. Fig. 9 After selecting the application serial number "495131" in the user interface shown, jump to the following Fig.10 The detailed processing information page of the items shown, such as Fig.10 As shown, the name of the department to which the matter belongs, the current processing status, the administrative region to which it belongs, the acceptance time, the application serial number, the business processing time limit, the name of the accepting agency, the name of the matter, the completed business process, the necessary business process, the basic business process, etc. can be displayed in the first container 1001; the detailed information of each node in the matter processing flow can be displayed in the second container. For example, the application node may include the matter name, the application project name, the application receipt number, the application time, the specific application outlet, the submission method, the unit applicant, the applicant type, the applicant identity type, the applicant ID number, the contact person name, the contact person ID type, the contact person ID number, the contact person mobile phone, the contact person email address, the original application serial number, the status, the application materials list, etc.

[0172] Optionally, the server may also filter out items that meet the early warning condition according to the request sent by the terminal. The method may include the following steps.

[0173] S801. The server receives a request from the fourth node to view an early warning item.

[0174] S802. The server determines, based on the viewing request, items in the first set that meet warning conditions, where the warning conditions include that a difference between a processing time and an expected processing time limit is greater than a sixth threshold.

[0175] S803. The server sends the information of the matter that has reached the warning condition to the fourth node.

[0176] See also Fig.11 , Fig.11 The user interface diagram is given as an example to show the statistics of the items that have reached the warning conditions in each department. Fig.11 As shown, the user interface includes a display container 1101. The display container 1101 is used to display the processing information of the matters processed by the administrative region or business department queried according to the early warning condition. The processing information of the early warning matters of each administrative region can be displayed according to the administrative region, and the processing information of the early warning matters of each business department can also be displayed according to the business department. For example, the matters that meet the early warning conditions of each department are displayed according to the department, including displaying the department name, implementation type, number of normal business, number of business in progress, and number of early warning business of each department.

[0177] When you select a department, you can view the processing information of each warning item in the department. Fig.12 , Fig.12 An exemplary user interface diagram for viewing the processing information of a department's warning items is given. Fig.12 As shown, the user interface diagram may include a department input control 1201, an item input control 1202, a serial number input control 3, a query control 1204, a display container 1205, and a return control 1206. Among them, the department input control 1201 is used to input a department name keyword, the item input control 1202 is used to input an item name keyword, the serial number input control 1203 is used to input a serial number, and the filter control 1204 is used to query items containing keywords based on one of the keywords input into the department input control 1201, the item input control 1202, and the serial number input control 1203. For example, when an input operation is detected for the input control 1204, it is detected that the keyword input into the department input control 1201 is "Provincial Department of Housing and Urban-Rural Development", and the item input control 1202 and the serial number input control 1203 are both empty, then items with a department name of "Provincial Department of Housing and Urban-Rural Development" are filtered out from all items that meet the warning conditions based on the keyword input into the department input control 1201 and displayed in the display container 1205. Enter as Fig.12 After the user interface is displayed, the display container 1205 is first used to display Fig.11The display container 1205 can also be used to display the items that meet the warning conditions in the selected department according to the filter control 1204. The display container 1205 also includes an operation area 12051. When the operation area 1205 is detected, it jumps to the warning details page of the warning item corresponding to the operation. The return control 1206 is used to return to the previous user interface, for example, Fig.11 The user interface shown.

[0178] See also Fig.13 , Fig.13 The following is a user interface diagram showing detailed information of the warning items. Fig.13 As shown, the user interface includes a first display container 1301 and a second display container 1302. The first display container 1301 is used to display the basic information of the warning item, including the department name, current handling status, administrative division, acceptance time, application serial number, business handling time limit, acceptance agency name, item name, completed business process, necessary business process, basic business process and other information of the warning item; the second display container 1302 is used to display detailed information of the warning node of the warning item, including the acceptance department name, acceptance department organization code, handler name, handling manual number, acceptance time, acceptance status, acceptance receipt number, non-acceptance reason, item version number, real-time online supervision information, handling time limit, remaining days, business prescribed time limit, prescribed completion time and the like of the warning node of the warning item.

[0179] The following describes the devices and apparatuses involved in the embodiments of the present application.

[0180] See also Fig.14 , Fig.14 Schematic diagram of a data analysis structure provided by an embodiment of the present invention. Fig.14 As shown, the data analysis device 1400 can be applied to the above Figure 2a , Figure 2b , Figure 5 and Figure 6 Corresponding to the server in the embodiment, the apparatus 1400 may include:

[0181] An acquisition unit 1401 is used to acquire an item processed by each of M nodes, where a processing flow of an item includes at least one node, and M is a positive integer;

[0182] A first determining unit 1402 is configured to determine whether the first node is a blocking point according to matters processed by the first node, wherein the first node is any one of the M nodes;

[0183] The replacement unit 1403 is used to replace the first node in the processing flow of the first matter with a second node when the first node is a blocking point and the processing time of the first matter at the first node is greater than a preset threshold.

[0184] In an implementation of the embodiment of the present application, the first node and the second node are two nodes in a set of nodes managed by a management node of the first node, and the second node is a non-blocking point.

[0185] In one implementation of the embodiment of the present application, the replacement unit 1403 is specifically used to:

[0186] Sending a node replacement request for the first matter to the management node of the first node, where the node replacement request is used to request the management node of the first node to replace the first node in the processing flow of the first matter with a node in the candidate node list;

[0187] receiving instruction information sent by the management node of the first node, the instruction information being used to instruct to replace the first node in the processing flow of the first matter with the second node, the second node being a node selected in the candidate node list;

[0188] According to the indication information, the first node in the processing flow of the first matter is replaced with the second node.

[0189] In an implementation of the embodiment of the present application, the first determining unit 1402 is specifically configured to:

[0190] Determine whether the first node is a bottleneck based on at least one of the following: the number of overdue items completed, the number of non-overdue items completed, the number of overdue items not completed, the number of non-overdue items not completed, the processing time of each completed item, and the overdue time of each overdue item among the items processed by the first node.

[0191] In an implementation of the embodiment of the present application, the first determining unit 1402 is specifically configured to:

[0192] If the number of unfinished items among the items processed by the first node is greater than a first threshold and the average processing time of completed items in the first node is greater than a second threshold, the first node is determined as a bottleneck.

[0193] In an implementation of the embodiment of the present application, the first determining unit 1402 is specifically configured to:

[0194] If the number of unfinished and overdue items among the items processed by the first node is greater than a third threshold and the average processing time of completed items in the first node is greater than a fourth threshold, the first node is determined to be a bottleneck.

[0195] In an implementation of the embodiment of the present application, before replacing the first node in the processing flow of the first matter with a second node, the apparatus further includes:

[0196] The first receiving unit 1404 is used to receive a reminder message sent by a terminal of a party regarding a first matter, where the reminder message is used to instruct to process the first matter.

[0197] In one implementation of the embodiment of the present application, the device further includes:

[0198] A second receiving unit, configured to receive a handling request for a second matter sent by a terminal of a party;

[0199] a second determining unit, configured to determine a processing flow of the second matter according to the matter type of the second matter, wherein the processing flow of the second matter includes Q nodes;

[0200] A third determining unit is used to determine an estimated processing time for the second node to process the second time duration according to the processing time of each item in the history of completed items of the second node, where the second node is any one of the Q nodes;

[0201] The first sending unit is used to send the estimated processing time of each of the Q nodes for processing the second matter to the terminal of the party.

[0202] In one implementation of the embodiment of the present application, the M nodes belong to N sets, the nodes in one set process matters of the same type, N is a positive integer, and the device further includes:

[0203] a fourth determining unit, configured to obtain a processing efficiency of the first set according to at least one of completed non-overdue items, completed overdue items, uncompleted non-overdue items, and uncompleted overdue items among items processed by each node in the first set, wherein the first set is any one of the N sets;

[0204] a screening unit, configured to screen out a set having a processing efficiency lower than a fifth threshold from the N sets according to a processing efficiency corresponding to each set in the N sets;

[0205] A second sending unit is used to send indication information to the management node of each set in the filtered set, and the indication information sent to the management node of the second set is used to indicate that the processing efficiency of the second set is lower than the fifth threshold, and the second set is any one of the filtered sets.

[0206] In one implementation of the embodiment of the present application, the device further includes:

[0207] A third receiving unit, configured to receive a viewing request from a fourth node for an early warning event;

[0208] a fourth determining unit, further configured to determine, according to the viewing request, items in the first set that meet a warning condition, wherein the warning condition includes that a difference between a processing time and an expected processing time limit is greater than a sixth threshold;

[0209] The second sending unit is further used to send the information of the matter that meets the warning condition to the fourth node.

[0210] It should be understood that the specific functional implementation of each of the above functional units can refer to the above Figure 2a , Figure 2b , Figure 5 and Figure 6 The relevant descriptions in the corresponding embodiments will not be repeated here.

[0211] See also Fig.15 , Fig.15 FIG. 1 is a schematic diagram of the structure of another data analysis device 1500 provided in an embodiment of the present invention. Fig.15 As shown, the data analysis device 1500 may correspond to the above Figure 1a In the corresponding embodiment, the server 104, the data analysis device 1500 may include: a processor 1501, a network interface 1504 and a memory 1505. In addition, the above-mentioned data analysis device 1500 may also include: a user interface 1503, and at least one communication bus 1502. Among them, the communication bus 1502 is used to realize the connection and communication between these components. Among them, the user interface 1503 may include a display screen (Display), a keyboard (Keyboard), and optionally, the user interface 1503 may also include a standard wired interface and a wireless interface. The network interface 1504 may optionally include a standard wired interface and a wireless interface (such as a WI-FI interface). The memory 1504 may be a high-speed RAM memory, or it may be a non-volatile memory (non-volatile memory), such as at least one disk storage. The memory 1505 may optionally also be at least one storage device located away from the aforementioned processor 1501. As Fig.15 As shown, the memory 1501 as a computer-readable storage medium may include an operating system, a network communication module, a user interface module, and a device control application program.

[0212] In such Fig.15In the data analysis device 1500 shown, the network interface 1504 can provide a network communication function; the user interface 1503 is mainly used to provide an input interface for the user; and the processor 1501 can be used to call the device control application stored in the memory 1505 to execute:

[0213] Obtaining matters processed by each of the M nodes, where a process of processing a matter includes at least one node, and M is a positive integer;

[0214] Determine whether the first node is a blocking point according to matters processed by the first node, where the first node is any one of the M nodes;

[0215] When the first node is a bottleneck, if the processing time of the first matter at the first node is longer than a preset threshold, the first node in the processing flow of the first matter is replaced with a second node. Fig.14 The acquisition unit 1401, the first receiving unit 1404, the second receiving unit, the first sending unit, the second sending unit and the third receiving unit in the embodiment can be composed of Fig.15 The network interface 1504 is implemented as above. Fig.14 The first determining unit 1402, the changing unit 1403, the second determining unit, the third determining unit, the fourth determining unit and the screening unit in the embodiment can be composed of Fig.15 The processor 1501 is used to implement the above.

[0216] It should be understood that the data analysis device 1500 described in the embodiment of the present invention can execute the above Figure 2a , Figure 2b , Figure 5 and Figure 6 The description of the data analysis method in any corresponding embodiment will not be repeated here. In addition, the description of the beneficial effects of adopting the same method will not be repeated here.

[0217] In addition, it should be pointed out here that: the embodiment of the present invention further provides a computer storage medium, and the computer storage medium stores a computer program executed by the data analysis device 1400 or 1500 mentioned above, and the computer program includes program instructions. When the processor executes the program instructions, it can execute the above-mentioned Figure 2a , Figure 2b , Figure 5 and Figure 6 The method implemented in the corresponding embodiment will not be described in detail here.

[0218] In addition, the description of the beneficial effects of the same method will not be repeated. For technical details not disclosed in the computer storage medium embodiment of the present invention, please refer to the description of the method embodiment of the present invention.

[0219] A person skilled in the art can understand that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the relevant hardware through a computer program, and the program can be stored in a computer-readable storage medium, and when the program is executed, it can include the processes of the embodiments of the above-mentioned methods. The storage medium can be a disk, an optical disk, a read-only memory (ROM) or a random access memory (RAM), etc.

[0220] The above disclosure is only the preferred embodiment of the present invention, which certainly cannot be used to limit the scope of the present invention. Therefore, equivalent changes made according to the claims of the present invention are still within the scope of the present invention.

Claims

1. A data processing method, It is characterized in that The method comprises: Obtaining matters processed by each of the M nodes, wherein the processing flow of a matter includes at least one node in a processing department, and M is a positive integer; Determine whether the first node is a blocking point according to matters processed by the first node, where the first node is any one of the M nodes; When the first node is a blocking point, if the processing time of the first matter at the first node is greater than a preset threshold and the first matter is an unfinished matter, the server sends a node replacement request for the first matter to the management node of the first node, receives the indication information sent by the management node of the first node, replaces the first node in the processing flow of the first matter with the second node according to the indication information, and sends a prompt information to the first node; the node replacement request is used to request the management node of the first node to replace the first node in the processing flow of the first matter with a node in the candidate node list, the indication information is used to indicate that the first node in the processing flow of the first matter is replaced with the second node, the second node is the node selected in the candidate node list, and the prompt information is used to prompt the processor of the first node to process the unfinished matters in the first node; the nodes included in the first node and the candidate node list are nodes in the set of nodes managed by the management node of the first node, the second node is a non-blocking point, the nodes in a set process matters of the same type, and the processing flow of the second node is the same as that of the first node.

2. The method according to claim 1, It is characterized in that The determining whether the first node is a blocking point according to matters processed by the first node, wherein the first node is any one of the M nodes, includes: Determine whether the first node is a bottleneck based on at least one of the following: the number of overdue items completed, the number of non-overdue items completed, the number of overdue items not completed, the number of non-overdue items not completed, the processing time of each completed item, and the overdue time of each overdue item among the items processed by the first node.

3. The method according to claim 1, It is characterized in that The determining whether the first node is a blocking point according to matters processed by the first node, wherein the first node is any one of the M nodes, includes: If the number of unfinished items among the items processed by the first node is greater than a first threshold and the average processing time of completed items in the first node is greater than a second threshold, the first node is determined as a bottleneck.

4. The method according to claim 1, It is characterized in that The determining whether the first node is a blocking point according to matters processed by the first node, wherein the first node is any one of the M nodes, includes: If the number of unfinished and overdue items among the items processed by the first node is greater than a third threshold and the average processing time of completed items in the first node is greater than a fourth threshold, the first node is determined to be a bottleneck.

5. The method according to any one of claims 1 to 4, It is characterized in that Before replacing the first node in the processing flow of the first matter with a second node, the method further includes: A reminder message for a first matter is received from a terminal of a party, wherein the reminder message is used to instruct processing of the first matter.

6. The method according to any one of claims 1 to 4, It is characterized in that The method further comprises: Receiving a handling request for the second matter sent by a terminal of the party concerned; Determining a processing flow of the second matter according to the matter type of the second matter, the processing flow of the second matter including Q nodes; Determine an estimated processing time for the third node to process the second item according to the processing time of each item in the history of completed items of the third node, where the third node is any one of the Q nodes; The estimated processing time for each of the Q nodes to process the second matter is sent to the terminal of the party concerned.

7. The method according to any one of claims 1 to 4, It is characterized in that The M nodes belong to N sets, where N is a positive integer, and the method further includes: Obtaining a processing efficiency of the first set according to at least one of completed non-overdue items, completed overdue items, uncompleted non-overdue items, and uncompleted overdue items among items processed by each node in the first set, where the first set is any one of the N sets; According to the processing efficiency corresponding to each of the N sets, screening out a set whose processing efficiency is lower than a fifth threshold from the N sets; Indication information is sent to the management node of each of the filtered sets, and the indication information sent to the management node of the second set is used to indicate that the processing efficiency of the second set is lower than the fifth threshold, and the second set is any one of the filtered sets.

8. The method according to claim 7, It is characterized in that The method further comprises: Receiving a request from the fourth node to view the warning item; Determining, according to the viewing request, matters in the first set that meet a warning condition, the warning condition including that a difference between a processing time and an expected processing time limit is greater than a sixth threshold; The information of the matter that has reached the warning condition is sent to the fourth node.

9. A data analysis device, It is characterized in that include: An acquisition unit, used for acquiring matters processed by each of the M nodes, wherein a processing flow of a matter includes at least one node in a processing department, and M is a positive integer; a determining unit, configured to determine whether the first node is a blocking point according to matters processed by the first node, wherein the first node is any one of the M nodes; a replacement unit, configured to, when the first node is a blocking point, if the processing time of the first item at the first node is greater than a preset threshold and the first item is an unfinished item, send a node replacement request for the first item to the management node of the first node, receive instruction information sent by the management node of the first node, replace the first node in the processing flow of the first item with a second node according to the instruction information, and send prompt information to the first node; The node replacement request is used to request the management node of the first node to replace the first node in the processing flow of the first matter with a node in the candidate node list; the indication information is used to indicate that the first node in the processing flow of the first matter is replaced with the second node, and the second node is a node selected in the candidate node list; the prompt information is used to prompt a processor of the first node to process unfinished matters in the first node; The nodes included in the first node and the candidate node list are two nodes in the set of nodes managed by the management node of the first node, the second node is a non-blocking point, the nodes in a set handle the same type of matters, and the processing flow of the second node is the same as that of the first node.

10. The device according to claim 9, It is characterized in that The first node and the second node are two nodes in a set of nodes managed by a management node of the first node, and the second node is a non-blocking node.

11. A device, It is characterized in that It comprises a processor and a memory, which are coupled, wherein the memory is used to store computer instructions, and the processor is used to execute the computer instructions so that the data analysis device implements the method according to any one of claims 1-8.

12. A computer-readable storage medium, It is characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by a computer device, the computer device implements the method according to any one of claims 1 to 8.