Fault tree updating method and device, computer device and storage medium

Abstract

The application relates to a fault tree updating method and device, computer equipment and a storage medium. The fault tree can be used for fault detection. The method comprises the following steps: when an operation fault is monitored, page information related to the operation fault is acquired; according to the page information, a local fault tree is traversed to acquire a fault link for fault positioning of the operation fault; when the fault link fails to position the fault cause of the operation fault, corresponding fault positioning rules are acquired according to the page information; the fault cause of the operation fault is positioned according to the fault positioning rules; and the fault tree is updated according to the fault positioning rules. The method does not need to be limited to a server. When the fault tree cannot position the fault, a terminal can match the fault positioning rules to analyze the fault cause, that is, the terminal has fault analysis capability, so that the fault tree can be updated in a timely manner.

Description

Technical Field

[0001] This application relates to the fields of computer technology and fault monitoring, and in particular to a fault tree updating method, apparatus, computer equipment, and storage medium. Background Technology

[0002] To meet the needs of different types of terminals, an application (APP) is usually configured with different versions for different types of terminals. For example, an application may have Android operating system versions, iOS operating system versions, and Windows operating system versions. As more versions are developed, it is also necessary to set up different fault monitoring methods for different versions of the application to detect faults in a timely manner.

[0003] One fault detection method involves the terminal collecting and reporting faults, summarizing and uploading the data to a server, which then generates a fault tree, performs fault diagnosis based on the fault tree, updates the fault tree, and distributes the latest fault tree to the terminal. However, fault diagnosis is limited by the server's analysis and processing efficiency, and the fault tree cannot be updated in a timely manner. Summary of the Invention

[0004] Therefore, it is necessary to provide a fault tree update method, apparatus, computer equipment, storage medium, and computer program product with high timeliness to address the above-mentioned technical problems.

[0005] Firstly, this application provides a fault tree update method, the method comprising:

[0006] When an operational failure is detected, obtain page information related to the operational failure;

[0007] Based on the page information, traverse the local fault tree to obtain the fault link for fault location of the operational fault;

[0008] When the cause of the operational failure cannot be located based on the faulty link, the corresponding fault location rule is obtained according to the page information;

[0009] The cause of the operational failure is located according to the fault location rules;

[0010] Update the fault tree according to the fault location rules.

[0011] Secondly, this application provides a fault tree update method, the method comprising:

[0012] The terminal receives a new fault link reported by the receiving terminal. When the terminal detects an operational fault, it obtains page information related to the operational fault, traverses the local fault tree according to the page information, obtains the fault link for fault location of the operational fault, and when the fault link fails to locate the cause of the operational fault, it obtains the corresponding fault location rule according to the page information, locates the cause of the operational fault according to the fault location rule, and generates a new fault node of the fault link according to the fault location rule to obtain a new fault link.

[0013] Update the server's fault tree based on the new faulty link;

[0014] The updated fault tree is distributed to the terminal.

[0015] Thirdly, this application also provides a fault tree updating apparatus, the apparatus comprising:

[0016] The page information acquisition module is used to acquire page information related to the operational failure when an operational failure is detected.

[0017] The link determination module is used to traverse the local fault tree based on the page information to obtain the fault links for fault location of the operational fault.

[0018] The rule acquisition module is used to acquire the corresponding fault location rules based on the page information when the cause of the operational fault cannot be located based on the faulty link.

[0019] The fault location module is used to locate the cause of the operational fault according to the fault location rules;

[0020] The update module is used to update the fault tree according to the fault location rules.

[0021] Fourthly, this application also provides a fault tree updating apparatus, the apparatus comprising:

[0022] The reporting and receiving module is used to receive new fault links reported by the terminal. When the terminal detects an operational fault, it obtains page information related to the operational fault, traverses the local fault tree according to the page information, and obtains the fault links for fault location based on the operational fault. When the fault link fails to locate the cause of the operational fault, it obtains the corresponding fault location rule according to the page information, locates the cause of the operational fault according to the fault location rule, and generates a new fault node for the fault link according to the fault location rule, thus obtaining a new fault link.

[0023] The update module is used to update the server's fault tree based on the new fault links;

[0024] The distribution module is used to distribute the updated fault tree to the terminal.

[0025] Fifthly, this application also provides a computer device. The computer device includes a memory and a processor, the memory storing a computer program, and the processor executing the computer program to perform the following steps:

[0026] When an operational failure is detected, obtain page information related to the operational failure;

[0027] Based on the page information, traverse the local fault tree to obtain the fault link for fault location of the operational fault;

[0028] When the cause of the operational failure cannot be located based on the faulty link, the corresponding fault location rule is obtained according to the page information;

[0029] The cause of the operational failure is located according to the fault location rules;

[0030] Update the fault tree according to the fault location rules.

[0031] Sixthly, this application also provides a computer device. The computer device includes a memory and a processor, the memory storing a computer program, and the processor executing the computer program to perform the following steps:

[0032] The terminal receives a new fault link reported by the receiving terminal. When the terminal detects an operational fault, it obtains page information related to the operational fault, traverses the local fault tree according to the page information, obtains the fault link for fault location of the operational fault, and when the fault link fails to locate the cause of the operational fault, it obtains the corresponding fault location rule according to the page information, locates the cause of the operational fault according to the fault location rule, and generates a new fault node of the fault link according to the fault location rule to obtain a new fault link.

[0033] Update the server's fault tree based on the new faulty link;

[0034] The updated fault tree is distributed to the terminal.

[0035] Seventhly, this application also provides a computer-readable storage medium. The computer-readable storage medium stores a computer program thereon, which, when executed by a processor, performs the following steps:

[0036] When an operational failure is detected, obtain page information related to the operational failure;

[0037] Based on the page information, traverse the local fault tree to obtain the fault link for fault location of the operational fault;

[0038] When the cause of the operational failure cannot be located based on the faulty link, the corresponding fault location rule is obtained according to the page information;

[0039] The cause of the operational failure is located according to the fault location rules;

[0040] Update the fault tree according to the fault location rules.

[0041] Eighthly, this application also provides a computer-readable storage medium. The computer-readable storage medium stores a computer program thereon, which, when executed by a processor, performs the following steps:

[0042] The terminal receives a new fault link reported by the receiving terminal. When the terminal detects an operational fault, it obtains page information related to the operational fault, traverses the local fault tree according to the page information, obtains the fault link for fault location of the operational fault, and when the fault link fails to locate the cause of the operational fault, it obtains the corresponding fault location rule according to the page information, locates the cause of the operational fault according to the fault location rule, and generates a new fault node of the fault link according to the fault location rule to obtain a new fault link.

[0043] Update the server's fault tree based on the new faulty link;

[0044] The updated fault tree is distributed to the terminal.

[0045] Ninthly, this application also provides a computer program product. The computer program product includes a computer program that, when executed by a processor, performs the following steps:

[0046] When an operational failure is detected, obtain page information related to the operational failure;

[0047] Based on the page information, traverse the local fault tree to obtain the fault link for fault location of the operational fault;

[0048] When the cause of the operational failure cannot be located based on the faulty link, the corresponding fault location rule is obtained according to the page information;

[0049] The cause of the operational failure is located according to the fault location rules;

[0050] Update the fault tree according to the fault location rules.

[0051] Tenthly, this application also provides a computer program product. The computer program product includes a computer program that, when executed by a processor, performs the following steps:

[0052] The terminal receives a new fault link reported by the receiving terminal. When the terminal detects an operational fault, it obtains page information related to the operational fault, traverses the local fault tree according to the page information, obtains the fault link for fault location of the operational fault, and when the fault link fails to locate the cause of the operational fault, it obtains the corresponding fault location rule according to the page information, locates the cause of the operational fault according to the fault location rule, and generates a new fault node of the fault link according to the fault location rule to obtain a new fault link.

[0053] Update the server's fault tree based on the new faulty link;

[0054] The updated fault tree is distributed to the terminal.

[0055] The aforementioned fault tree updating method, apparatus, computer equipment, storage medium, and computer program product enable the terminal to obtain fault location rules based on page information when the fault tree cannot locate the cause of an operational failure. This allows the terminal to pinpoint the cause of the operational failure according to the fault location rules and update the fault tree accordingly. This method is not limited by a server; when the fault tree cannot locate the fault, the terminal can match the fault location rules to analyze the cause of the failure, thus giving the terminal fault analysis capabilities and enabling timely updates to the fault tree.

[0056] The aforementioned fault tree updating method, apparatus, computer equipment, storage medium, and computer program product, when a terminal experiences an operational failure and the fault tree cannot locate the cause of the failure, obtains fault location rules based on page information, thereby enabling the location of the cause of the operational failure according to the fault location rules. This method is not limited by a server; when the fault tree cannot locate the fault, the terminal can match the fault location rules to analyze the cause of the failure, meaning the terminal has fault analysis capabilities. The server utilizes the fault links updated by the terminal to update the fault tree and distribute it to the terminals, ensuring that the fault trees of each terminal are updated in a timely manner. Attached Figure Description

[0057] Figure 1 This is a diagram illustrating the application environment of the fault tree update method in one embodiment;

[0058] Figure 2 This is a flowchart illustrating a fault tree update method in one embodiment;

[0059] Figure 3 This is a schematic diagram of the fault tree structure in one embodiment;

[0060] Figure 4 This is a flowchart illustrating the fault tree update method in another embodiment;

[0061] Figure 5 This is a flowchart illustrating a fault tree update method in one embodiment;

[0062] Figure 6 For a pair Figure 3 The diagram shows the structure of the updated fault tree obtained by the fault tree update.

[0063] Figure 7 This is a flowchart illustrating the fault tree update method in another implementation column;

[0064] Figure 8 This is a schematic diagram illustrating the interaction between a terminal and a server in one embodiment;

[0065] Figure 9 This is a schematic diagram of a normal page in one embodiment;

[0066] Figure 10 This is a schematic diagram of a fault page in one embodiment;

[0067] Figure 11 This is a schematic diagram of the fault tree update device in one embodiment;

[0068] Figure 12 This is a schematic diagram of the fault tree update device in another embodiment;

[0069] Figure 13 This is a schematic diagram of the internal structure of a computer device in one embodiment;

[0070] Figure 14 This is a diagram of the internal structure of a computer device in another embodiment. Detailed Implementation

[0071] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0072] The fault tree update method provided in this application can be applied to, for example... Figure 1In the application environment shown, terminal 102 communicates with server 104 via a network. A data storage system can store the data that server 104 needs to process. The data storage system can be integrated onto server 104 or placed on a cloud or other network server. When terminal 102 detects an operational fault, it obtains page information related to the operational fault; traverses the local fault tree based on the page information to obtain fault links for fault location; if the cause of the operational fault cannot be located based on the fault links, it obtains the corresponding fault location rules based on the page information; locates the cause of the operational fault according to the fault location rules; and updates the fault tree according to the fault location rules. The server receives new fault links reported by the terminal and updates the fault tree according to the new fault links.

[0073] The server 104 can be a standalone physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server providing basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms. The terminal 102 can be a smartphone, tablet, laptop, desktop computer, smart speaker, smartwatch, etc., but is not limited to these. The terminal and server can be directly or indirectly connected via wired or wireless communication, and this application does not impose any restrictions.

[0074] In one embodiment, such as Figure 2 As shown, a fault tree update method is provided, which is applied to... Figure 1 Taking the terminal in the example, the explanation includes the following steps:

[0075] Step 202: When an operational failure is detected, obtain page information related to the operational failure.

[0076] In this context, "operational failure" refers to client-side page failures in a general sense, meaning the client is in an abnormal state, including but not limited to code execution errors, program crashes, and code errors. There are clear defining standards and criteria for judging client-side operational failures. During actual software operation, based on interface standards and judgment criteria, pre-set fault detection scripts can be used for monitoring. The detection results from these scripts determine whether an operational failure has occurred, and then a fault tree can be used to locate the cause of the failure.

[0077] A fault tree is a hierarchical tree structure diagram that classifies system faults. Using a fault tree, one can trace the cause of a page fault from the largest granularity to the smallest granularity, thus pinpointing the specific cause of the page fault. Typically, a fault tree file is an XML configuration file containing descriptions of various page faults.

[0078] In practical use, the hierarchical principle of the fault tree corresponds to the hierarchical information of page elements. Therefore, the cause of the fault can be located from top to bottom according to the principle of descending from the largest to the smallest. Each fault node in the fault tree serves as a judgment condition for the fault, used to determine whether the page information has experienced the fault corresponding to that node. If the fault condition corresponding to the fault node is met, the cause of the current fault can be located.

[0079] When an operational failure is detected, the system retrieves information about the page where the failure occurred. This can include retrieving operational parameters from both the page's backend and frontend. Backend operational parameters can be information not visible in the backend, such as retrieving device information or calling APIs to report data to the server. Frontend operational parameters can be visible page information, such as the content displayed on the page.

[0080] The method for obtaining page information can be pre-defined. For example, page information can be obtained based on the hierarchical information of the page content. Specifically, the hierarchical information of the page content can include: module-page-element-element attribute. Based on module-page-element-element attribute, the background running information and front-end page information corresponding to the current running status can be obtained.

[0081] For the current page, parse each page element of the current page, and obtain the module-page-element-element attribute information of each page element. The module-page-element-element attribute information of each page element constitutes the page information related to the running failure.

[0082] Step 204: Traverse the local fault tree based on the page information related to the operational fault to obtain the fault link for fault location of the operational fault.

[0083] Generally, fault diagnosis is based on element attributes as the smallest unit, meaning the final judgment is whether a page element has malfunctioned. Therefore, the hierarchical information of the fault tree can be deployed based on the hierarchical information of page elements. Page elements belong to pages, and pages belong to modules, so the hierarchy of page information is consistent with the hierarchical structure of the fault tree to some extent. By traversing the local fault tree based on page information, matching fault links can be obtained for fault localization. The fault tree file is an XML configuration file containing descriptions of various page faults. For each fault node, there is a corresponding fault description, judgment rules, and judgment object (i.e., the attribute of the judgment element). During matching, based on the hierarchy of each page element to be investigated in the page information, fault links with consistent hierarchical relationships can be matched in the fault tree to obtain the fault links for fault localization of the operational fault. Each fault node in the fault link has corresponding page element information, thus enabling the determination of whether the current fault is caused by that page element.

[0084] To better locate faults, the top-to-bottom structure of the fault tree corresponds to the hierarchical structure of page elements. The hierarchical structure of page elements, from top to bottom, is module, page, page element, and element attribute. Therefore, the corresponding fault tree, from top to bottom, is module, page, page element, and element attribute. In other words, the fault tree can be located by starting from the module as the root node and then expanding to locate each element attribute of each page element in each page.

[0085] A fault tree, specifically, determines whether content at corresponding levels meets requirements. For example, the first level checks if a module meets requirements, the second level checks if the page meets requirements, the third level checks if page elements meet requirements, and the fourth level checks if page element attributes meet requirements. It's understandable that the judgment rules differ at each level, gradually refining from top to bottom, ultimately pinpointing the smallest granularity of the fault cause. Therefore, a fault tree is composed of fault nodes at corresponding levels, and fault nodes with hierarchical relationships form fault chains. In other words, a fault chain refers to the pointing relationship between fault nodes in the fault tree. An implemented fault tree can be like this: Figure 3 As shown, one of the faulty links can be: A1->B1->C1->D1.

[0086] When identifying faulty links, the fault tree can be traversed based on page information. For example, if a page contains element A, and the hierarchy of element A is Module 1 -> Page 2 -> Element A, then the fault tree is matched based on the hierarchy of element A to find faulty links whose hierarchy information matches that of element A. Specifically, the search can start from the root node of the fault tree and sequentially judge each branch. Starting from the first branch of the root node, if the node hierarchy of the first branch of the root node matches the hierarchy of element A (e.g., the node of the first branch follows the judgment rule of Module 1), then it is considered a match, and the traversal continues along the first branch link to match the next level. If the node hierarchy of the first branch of the root node does not match the hierarchy of element A (e.g., the node of the first branch follows the judgment rule of Module 2), then it is considered a mismatch, and the traversal continues along the other branches under the root node until a faulty link matching the hierarchy information of element A is found. If the hierarchical information of the attribute corresponding to a faulty link is matched as Module 1 -> Page 2 -> Element A, then the faulty link is determined to be the faulty link for fault location of Element A.

[0087] When an operational failure is detected, the page information related to the failure is obtained. This page information specifically includes the module-page-element-element attribute information of each page element on the current page. Based on this page information, the fault tree is traversed to determine the fault links that match the page information. It can be understood that for a given page, the fault links include multiple fault links corresponding to each of the page elements. For example, if a page has 10 page elements, the fault links determined from the fault tree based on the page information can include the fault links corresponding to each of the 10 faulty elements.

[0088] The judgment conditions corresponding to the fault nodes in the fault chain are those that correspond to the abnormalities in the page information, and can be used to locate the cause of the fault.

[0089] For example, consider a circular button located in the center of a page. The possible fault nodes for this element include its shape, text, and position. If the fault path leads to this element, it could be: Module -> Page -> Button 1 -> Shape, Module -> Page -> Button 1 -> Text, or Module -> Page -> Button 1 -> Position. Based on the first fault path, the button's shape is detected as circular, thus ruling out this type of fault. If the second fault path leads to the text being the default text, this type of fault can also be ruled out. If the third fault path leads to the position being on the left, then a fault has occurred, with the fault path being Module -> Page -> Button 1 -> Position, and the cause being an incorrect position.

[0090] Step 206: When the cause of the operational failure cannot be located based on the faulty link, obtain the corresponding fault location rules according to the page information related to the operational failure.

[0091] In response to operational failures, the judgment conditions of each failure node in the failure chain are used to judge the corresponding page elements in the current page. When the failure chain cannot be used to locate the cause of the failure, the corresponding failure location rules can be obtained further based on the page information.

[0092] Specifically, fault location rules are issued by the server. For each page, developers can pre-set fault location rules based on experience, or they can learn the rules using a neural network model. Fault location rules can correspond to page elements and are the conditions for judging whether a specific page element has a fault from various dimensions (such as position, shape, color, text, and other attributes).

[0093] Specifically, the server pre-sets certain trigger conditions for fault monitoring tasks. When these conditions are met, a fault monitoring task, along with associated page information and fault location rules, is issued. These conditions can be triggered when a new version is released.

[0094] Step 208: Locate the cause of the operational failure according to the fault location rules.

[0095] Specifically, if the page information meets the fault location rules, the cause of the new fault can be located. If the page information does not meet the fault location rules, the page information is reported to the server to notify the backend to investigate, or the fault location rules are updated to locate the cause of the new fault.

[0096] If fault detection is based solely on the fault tree, the efficiency of fault detection will be limited by the updates to the fault tree. If the fault tree is not updated in a timely manner, the speed of fault feedback will be slow.

[0097] In this embodiment, the terminal has fault location capabilities in addition to fault trees, specifically by utilizing fault location rules issued by the server. Because the terminal has fault location capabilities beyond fault trees, it possesses multiple fault location methods. When fault trees cannot locate the fault, fault location rules are used to locate the fault, thereby enabling timely fault location and improving fault location speed.

[0098] Step 210: Update the fault tree according to the fault location rules.

[0099] Specifically, the fault location rules are converted into fault nodes, the fault nodes are added to the fault links to generate new fault links or fault trees, the new fault links or fault trees are reported to the server, the server updates the fault trees and then distributes them to each terminal so that the fault trees of each terminal are updated.

[0100] When a terminal reports a new fault link or fault tree, it also reports page fault data to the server. Page fault data includes, but is not limited to, exception information thrown by the program code, stack traces of program crashes, and error messages printed during code execution.

[0101] The aforementioned fault tree update method, when a runtime failure cannot be located using the fault tree, can obtain fault location rules based on page information. These rules allow for the identification of the cause of the runtime failure, and the fault tree is then updated accordingly. This method is not server-dependent; when the fault tree cannot locate the fault, the terminal can match the fault location rules to analyze the cause, thus giving the terminal fault analysis capabilities and enabling timely updates to the fault tree.

[0102] In another embodiment, updating the fault tree according to the fault location rules includes: generating new fault nodes of the fault link according to the fault location rules to obtain a new fault link; and updating the fault tree according to the new fault link.

[0103] Specifically, the cause of the operational failure is located according to the failure location rules. A new failure node is inserted into the lowest-level failure node (the leaf node of the current failure link) of the failure link corresponding to the currently judged page element. The failure judgment condition of the new failure node is the failure location rule used to locate the new failure, thereby obtaining a new failure link.

[0104] After obtaining a new fault link, the new fault link and / or fault tree are reported to the server. The server updates the fault tree and then distributes it to each terminal, so that the fault tree of each terminal is updated.

[0105] In this embodiment, by detecting a terminal with operational failure, generating a new fault node in the fault link using fault location rules, and updating the fault link, the fault tree can be updated in the manner of fault link updates, thereby improving the fault tree update efficiency.

[0106] In another embodiment, updating the fault tree based on the new fault link may include: reporting the new fault link to the server, updating the server's fault tree based on the new fault link, and then distributing the updated fault tree to each terminal.

[0107] Specifically, when a terminal detects a fault that cannot be located by the existing fault tree, it generates a new fault link locally and reports it to the server. The server then performs a matching search in its own fault tree based on the reported fault link to determine if it exists. A reported fault link is considered to exist in the fault tree only if it is completely encompassed by a fault link in the server's fault tree. If the reported fault link exists in the server's fault tree, it indicates that the server already has the fault link, the reported fault is considered an existing fault, and the server does not update it. If the reported fault link does not exist in the server's fault tree, it indicates that the server does not have the fault link, the reported fault is considered a new fault, and the server updates its fault tree.

[0108] Specifically, updating the fault tree on the server side can include determining the target fault link in the fault tree that has the highest matching degree with the new fault link. For example, the link in the fault tree that contains the most faulty nodes in the new fault link can be selected as the target fault link. Generally, the target fault link includes all faulty nodes in the new fault link except for the new faulty node. When reporting, the terminal marks the new faulty node, and after determining the target fault link, the new faulty node is inserted into the leaf node of the target fault link.

[0109] Specifically, each fault node in the new faulty link is sequentially matched with each fault node in the fault tree. If a link in the fault tree contains the complete link of the new faulty link, the fault is reported as an existing fault. Figure 3 Taking the existing fault tree on the server as an example, if the received new fault link is A1->B1->C2->D4, matching shows that the existing fault tree includes this fault link, then the existing fault tree is not updated. If a fault link in the fault tree contains a fault node in the new fault link other than the new fault node, then the new fault node is inserted into the next level node of the matching fault link, and the fault tree is updated. For example, if the new fault link is A1->B3, matching shows that the existing fault tree does not include the complete link of this fault link. Therefore, the existing fault tree needs to be updated. During the update, B3 is inserted into the next level node of node A1 as the new fault node, resulting in the fault tree as follows. Figure 6 As shown.

[0110] In this embodiment, the server updates the fault tree and distributes it to each terminal, enabling each terminal to update its fault tree and locate faults based on the updated fault tree, thus greatly improving the accuracy and effectiveness of terminal fault monitoring.

[0111] In another embodiment, the method further includes: after responding to an application startup command, requesting a fault tree from a server; obtaining a locally existing fault tree; and if the requested fault tree is different from the locally existing fault tree, updating the local fault tree according to the requested fault tree.

[0112] Specifically, such as Figure 4 As shown, after the client starts, it first requests the latest fault tree from the server. If the request fails, the client uses its locally pre-configured fault tree. If the request succeeds, the latest fault tree obtained from the request is compared with the locally pre-configured fault tree. If the latest fault tree is different from the locally pre-configured fault tree, the locally pre-configured fault tree file is updated. If the latest fault tree is the same as the locally pre-configured fault tree, the locally pre-configured fault tree is not updated. The locally pre-configured fault tree includes two cases: one is the fault tree pre-configured during app installation, and the other is the fault tree from the last update. In general, the locally pre-configured fault tree is the fault tree that already exists locally relative to this request.

[0113] After the application starts, it executes a fault monitoring task. This task can be issued by the server or triggered by the client. The fault monitoring task is executed as soon as the application starts, collecting fault data from the corresponding page, matching it with the fault tree file, locating the cause of the fault, and then reporting it to the server.

[0114] Specifically, the terminal uses a fault tree to monitor faults and pinpoint their causes. For example... Figure 4 As shown, the terminal also obtains fault monitoring tasks issued by the server, as well as page information and fault location rules associated with the fault monitoring tasks. When an operational fault is detected, the terminal obtains page information related to the operational fault, traverses the local fault tree based on the page information, and obtains the fault link for fault location of the operational fault. When the cause of the operational fault cannot be located based on the fault link, the terminal obtains the corresponding fault location rules based on the page information, locates the cause of the operational fault based on the fault location rules, updates the fault link, and reports it.

[0115] In this embodiment, the terminal has the ability to locate faults in addition to fault trees, thus improving the terminal's fault location capability and efficiency. After being reported to the server, the server updates the fault trees, which in turn allows the fault trees of each terminal to be updated in a timely manner, thus forming a virtuous cycle and continuously improving the terminal's fault diagnosis capability.

[0116] In one embodiment, a fault tree update method is provided, applied to, for example... Figure 1 The server shown is as follows: Figure 5 As shown, it includes the following steps:

[0117] Step 502: Receive new fault links reported by the terminal; wherein, when the terminal detects an operational fault, it obtains page information related to the operational fault, traverses the local fault tree according to the page information, obtains fault links for fault location of the operational fault, when the fault link fails to locate the cause of the operational fault, obtains the corresponding fault location rules according to the page information, locates the cause of the operational fault according to the fault location rules, generates new fault nodes of the fault link according to the fault location rules, and obtains new fault links.

[0118] Specifically, the method by which the terminal obtains new faulty links has been described in the relevant embodiments of the fault tree update method, and will not be repeated here.

[0119] The rules for terminals to report new faulty links can be pre-set, and the specific rules can be customized according to the application's business scenario, which will not be elaborated here. For example, terminals can be set to report new faulty links immediately after obtaining them, or they can be set to report all new faulty links at a fixed time each day.

[0120] Step 504: Update the server's fault tree based on the new faulty link.

[0121] Specifically, the server determines whether its fault tree includes the complete link of the new fault link. If it does, no update is needed; otherwise, the fault tree is updated based on the new fault link. Specifically, the new fault nodes in the new fault link, i.e., the fault nodes not included in the fault tree, are inserted into the fault tree to update it.

[0122] Step 506: Distribute the updated fault tree to the terminal.

[0123] When a terminal reports a new faulty link, it also reports terminal information, including device type, client version number, and device ID. The server can then distribute the updated fault tree to specified terminals based on this information, such as distributing it to terminals of a specific type. A more efficient approach is for the server to distribute the updated fault tree to all terminals based on this updated fault tree.

[0124] The specific rules for distributing the updated fault tree can be pre-set, and these rules can be customized according to the application's business scenario, which will not be elaborated here. For example, the server can be set to distribute the updated fault tree immediately after updating it, or it can be set to distribute the updated fault tree at a fixed time every day, or the fault tree can be distributed to specified terminals.

[0125] The aforementioned fault tree update method, when a terminal experiences a runtime failure and the fault tree cannot pinpoint the cause, retrieves fault location rules based on page information, thereby enabling the location of the fault cause. This method is not server-dependent; when the fault tree cannot locate the fault, the terminal can match the fault location rules to analyze the cause, meaning the terminal possesses fault analysis capabilities. After locating the fault, the terminal reports the new fault path to the server. The server uses the updated fault path from the terminal to update the fault tree and distribute it to all terminals, ensuring that the fault trees of each terminal are updated promptly.

[0126] In another embodiment, the server performs a matching search in its fault tree based on the reported faulty link to determine whether the reported faulty link exists in the server's fault tree. Specifically, a reported faulty link is considered to exist in the fault tree only if it is completely contained within any faulty link in the server's fault tree. If the reported faulty link exists in the server's fault tree, it indicates that the server already has the faulty link, the reported fault is an existing fault, and the server does not update it. If the reported faulty link does not exist in the server's fault tree, it indicates that the server does not have the faulty link, the reported fault is a new fault, and the server updates the fault tree.

[0127] The fault tree is updated based on the new fault link, including: matching the fault tree based on the new fault link; if the complete link of the new fault link does not exist in the server's fault tree, then the target fault link with the highest matching degree with the new fault link is determined in the server's fault tree; and the fault nodes in the new fault link that are not included in the target fault link are inserted into the leaf nodes of the target fault link to obtain the server-updated fault tree.

[0128] Specifically, updating the fault tree on the server side can include determining the target fault link in the fault tree that has the highest matching degree with the new fault link. For example, the link in the fault tree that contains the most faulty nodes in the new fault link can be selected as the target fault link. Generally, the target fault link includes all faulty nodes in the new fault link except for the new faulty node. When reporting, the terminal marks the new faulty node, and after determining the target fault link, the new faulty node is inserted into the leaf node of the target fault link.

[0129] Specifically, each fault node in the new faulty link is sequentially matched with each fault node in the fault tree. If a link in the fault tree contains the complete link of the new faulty link, the fault is reported as an existing fault. Figure 3Taking the existing fault tree on the server as an example, if the received new fault link is A1->B1->C2->D4, matching shows that the existing fault tree includes this fault link, then the existing fault tree is not updated. If a fault link in the fault tree contains a fault node in the new fault link other than the new fault node, then the new fault node is inserted into the next level node of the matching fault link, and the fault tree is updated. For example, if the new fault link is A1->B3, matching shows that the existing fault tree does not include the complete link of this fault link. Therefore, the existing fault tree needs to be updated. During the update, B3 is inserted into the next level node of node A1 as the new fault node, resulting in the fault tree as follows. Figure 6 As shown.

[0130] In this embodiment, the server updates the fault tree and distributes it to each terminal, enabling each terminal to update its fault tree and locate faults based on the updated fault tree, thus greatly improving the accuracy and effectiveness of terminal fault monitoring.

[0131] In another embodiment, the fault tree update method further includes: obtaining a fault monitoring task, as well as page information and fault location rules associated with the monitoring task; and publishing the fault monitoring task, the page information and fault location rules associated with the monitoring task to the terminal.

[0132] Specifically, the server can be configured with fault monitoring tasks. These tasks supplement the fault tree and can be used to expand fault location methods.

[0133] Generally, fault diagnosis is based on element attributes as the smallest unit, meaning the final judgment is whether an element has malfunctioned. Therefore, when setting fault location rules, the fault tree hierarchy can be deployed based on element-level information. Consequently, the attributes of the fault location rules need to reflect the hierarchy of page information. Page information includes the hierarchy of a specific element on the page, specifically the hierarchy of module-page-element-element attribute. Correspondingly, fault location rules correspond to page elements and are the conditions for judging whether a specific page element has malfunctioned from various dimensions (such as position, shape, color, text, etc.).

[0134] Among these methods, fault location rules can be pre-set by developers based on experience, or they can be learned using neural network models.

[0135] The fault monitoring task, the associated page information, and the fault location rules are published to the terminal, which then executes the fault monitoring task based on the associated page information and fault location rules.

[0136] Specifically, if the application page information meets the fault location rules, the cause of the new fault can be located. If the application page information does not meet the fault location rules, the page information is reported to the server to notify the backend to investigate, or the fault location rules are updated to locate the cause of the new fault.

[0137] The distribution rules can be based on the client version number. For example, if the version number is less than version A, configuration X is distributed; if the version number is greater than version A, configuration Y is distributed. Distribution rules can also be defined based on the device ID. For example, if the device ID ends in 0, configuration X is distributed; if the device ID ends in 1, configuration Y is distributed.

[0138] In this embodiment, the terminal has fault location capabilities in addition to fault trees, specifically by utilizing fault location rules issued by the server. Because the terminal has fault location capabilities beyond fault trees, it possesses multiple fault location methods. When fault trees cannot locate the fault, fault location rules are used to locate the fault, thereby enabling timely fault location and improving fault location speed.

[0139] In one embodiment, obtaining a fault monitoring task, as well as page information and fault location rules associated with the monitoring task, includes: obtaining the fault monitoring task when a new version is released; obtaining the page information updated in the new version; obtaining fault location rules for the updated page information; and publishing the fault monitoring task, the page information updated in the new version, and the fault location rules for the updated page information to the terminal.

[0140] Specifically, for each new version release, a fault monitoring task can be generated to monitor for faults in the updated pages of the new version. This is because when a new version is released, the current fault tree usually does not include the judgment rules for the updated pages. As a supplement, in this embodiment, the fault location rules for the updated page information in the newly released version are distributed to the terminal, so that the terminal can locate the fault using the fault location rules when the fault tree cannot accurately locate the fault.

[0141] In another embodiment, the fault monitoring task includes designated terminal information, which includes at least one of device identifier, version number, and user login account.

[0142] Specifically, the fault monitoring task can perform fault monitoring on designated terminals, and can formulate targeted fault location rules based on device identifiers, version numbers, and user login accounts. Because fault location can be dynamically configured for designated terminals, it offers greater flexibility and operability.

[0143] like Figure 7As shown, the server distributes fault monitoring tasks to each terminal, and publishes the page information and fault location rules associated with the monitoring tasks to the terminals. This can be achieved by obtaining fault monitoring tasks, acquiring the updated page information of the new version, and obtaining fault location rules for the updated page information when a new version is released. Alternatively, fault monitoring tasks can be issued to specific terminals, where the specified terminal information includes at least one of the following: device identifier, version number, and user login account.

[0144] The server receives new fault links reported by the terminal. When the terminal detects an operational fault, it obtains page information related to the operational fault, traverses the local fault tree based on the page information, and obtains the fault links for fault location based on the fault links. If the cause of the operational fault cannot be located based on the fault links, the server obtains the corresponding fault location rules based on the page information, locates the cause of the operational fault according to the fault location rules, and generates new fault nodes in the fault links according to the fault location rules, thus obtaining new fault links.

[0145] The server updates the fault tree based on the new failed link. Specifically, it matches the fault tree with the new failed link; if the complete link of the new failed link does not exist in the server's fault tree, it identifies the target failed link with the highest matching degree in the server's fault tree; and it inserts the fault nodes of the new failed link that are not included in the target failed link into the leaf nodes of the target failed link, thus obtaining the updated fault tree. If the complete link of the new failed link exists in the server's fault tree, the fault tree is not updated.

[0146] The server distributes the updated fault tree to the terminals.

[0147] In this embodiment, for the server, since it has the ability to locate faults in addition to fault trees, the server receives the updated fault links reported by the terminals, which continuously updates the fault trees, thereby enabling the fault trees of each terminal to be updated in a timely manner, thus forming a virtuous cycle and continuously improving the fault diagnosis capabilities of the terminals.

[0148] like Figure 8 The diagram illustrates the interaction between the terminal and the server for fault location and fault map updates, including the following steps:

[0149] S1, the server publishes fault monitoring tasks to the terminal, along with the associated page information and fault location rules.

[0150] S2, when the terminal starts up, it requests the fault tree file from the server.

[0151] S3, the terminal compares the requested fault tree file with the existing fault tree file locally. If the fault tree files are different, the local fault tree file is updated.

[0152] S4: When a malfunction is detected, obtain page information.

[0153] S5 determines the faulty link from the local fault tree based on the page information.

[0154] S6. When the cause of the operational failure cannot be located based on the faulty link, the corresponding fault location rules are obtained according to the page information.

[0155] S7, locate the cause of the operational failure according to the fault location rules.

[0156] S8. Generate a new fault node in the fault link according to the fault location rules, and obtain a new fault link.

[0157] S9 reports the new faulty link to the server.

[0158] S10, the server updates the fault tree based on the new faulty link.

[0159] S11 distributes the updated fault tree to the terminal.

[0160] S12, the terminal updates its local fault tree based on the updated fault tree.

[0161] Applying the fault tree update method to page fault analysis, a normal page diagram in one embodiment is shown below. Figure 9 As shown. When the page encounters an error, such as... Figure 10 As shown, fault analysis can be performed first based on fault tree localization. If the fault tree cannot locate the fault, the current page information can be used to determine that the page is on the homepage. Then, the fault localization rules corresponding to each element on the homepage can be obtained, and the fault localization can be performed according to the fault localization rules.

[0162] It should be understood that, although Figure 2 , 4 The steps in flowcharts 5, 7, and 8 are shown sequentially as indicated by the arrows; however, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order in which these steps are performed, and they can be executed in other orders. Furthermore, Figure 2 , 4 At least some of the steps in 5, 7 and 8 may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but may be executed at different times. The execution order of these steps or stages is not necessarily sequential, but may be executed in turn or alternately with other steps or at least some of the steps or stages in other steps.

[0163] In one embodiment, such as Figure 11As shown, a fault tree update device is provided. This device can be a software module, a hardware module, or a combination of both integrated into a computer device. Specifically, the device includes: a page information acquisition module, a link determination module, a rule acquisition module, a fault location module, and an update module, wherein:

[0164] The page information acquisition module 1001 is used to acquire page information related to the operational failure when an operational failure is detected.

[0165] The link determination module 1002 is used to traverse the local fault tree based on the page information to obtain the fault links for fault location of operational faults.

[0166] The rule acquisition module 1003 is used to acquire the corresponding fault location rules based on the page information when the cause of the operational failure cannot be located based on the faulty link.

[0167] The fault location module 1004 is used to locate the cause of the operational fault according to the fault location rules.

[0168] Update module 1005, used to update the fault tree according to fault location rules.

[0169] In another embodiment, the update module includes:

[0170] The link update module is used to generate new fault nodes for the faulty link according to the fault location rules, thus obtaining the new faulty link;

[0171] The fault tree update module is used to update the fault tree based on new fault links.

[0172] Specifically, the fault tree update module is used to report new fault links to the server. The server updates its fault tree based on the new fault links and then distributes the updated fault tree to each terminal.

[0173] In another embodiment, the update module is further configured to request a fault tree from the server after responding to the application startup command; obtain the existing fault tree locally; and update the local fault tree according to the requested fault tree if the requested fault tree is different from the existing local fault tree.

[0174] Specific limitations regarding the fault tree update apparatus can be found in the limitations of the fault tree update method described above, and will not be repeated here. Each module in the aforementioned fault tree update apparatus can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in or independent of the processor in the computer device in hardware form, or stored in the memory of the computer device in software form, so that the processor can call and execute the operations corresponding to each module.

[0175] A fault tree update device, such as Figure 12 As shown, it includes:

[0176] The reporting and receiving module 1101 is used to receive new fault links reported by the terminal. When the terminal detects an operational fault, it obtains page information related to the operational fault, traverses the local fault tree according to the page information, and obtains the fault links for fault location based on the operational fault. When the fault link fails to locate the cause of the operational fault, it obtains the corresponding fault location rules according to the page information, locates the cause of the operational fault according to the fault location rules, and generates a new fault node of the fault link according to the fault location rules, thus obtaining a new fault link.

[0177] Update module 1102 is used to update the fault tree on the server based on the new fault links;

[0178] Distribution module 1103 is used to distribute the updated fault tree to the terminal.

[0179] In another embodiment, the update module is used to match the new fault link in the fault tree; if the complete link of the new fault link does not exist in the server's fault tree, the target fault link with the highest matching degree with the new fault link is determined in the server's fault tree; the fault nodes in the new fault link that are not included in the target fault link are inserted into the leaf nodes of the target fault link to obtain the server-updated fault tree.

[0180] In another embodiment, it also includes:

[0181] The task acquisition module is used to acquire fault monitoring tasks, as well as the page information and fault location rules associated with the monitoring tasks;

[0182] The distribution module is used to publish fault monitoring tasks, associated page information, and fault location rules to the terminal.

[0183] In another embodiment, the task acquisition module is used to acquire fault monitoring tasks when a new version is released; acquire page information updated in the new version; and acquire fault location rules for the updated page information.

[0184] In another embodiment, the fault monitoring task includes designated terminal information, which includes at least one of device identifier, version number, and user login account.

[0185] Specific limitations regarding the fault tree update apparatus can be found in the limitations of the fault tree update method described above, and will not be repeated here. Each module in the aforementioned fault tree update apparatus can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in or independent of the processor in the computer device in hardware form, or stored in the memory of the computer device in software form, so that the processor can call and execute the operations corresponding to each module.

[0186] In one embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be as follows: Figure 13 As shown, the computer device includes a processor, memory, and a network interface connected via a system bus. The processor provides computing and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system, computer programs, and a database. The internal memory provides an environment for the operation of the operating system and computer programs stored in the non-volatile storage media. The database stores fault tree data. The network interface communicates with external terminals via a network connection. When executed by the processor, the computer program implements a fault tree update method.

[0187] In one embodiment, a computer device is provided, which may be a terminal, and its internal structure diagram may be as follows: Figure 14 As shown, the computer device includes a processor, memory, communication interface, display screen, and input devices connected via a system bus. The processor provides computing and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system and computer programs. The internal memory provides an environment for the operation of the operating system and computer programs stored in the non-volatile storage media. The communication interface is used for wired or wireless communication with external terminals; wireless communication can be achieved through Wi-Fi, carrier networks, NFC (Near Field Communication), or other technologies. When the computer program is executed by the processor, it implements a fault tree update method. The display screen can be an LCD screen or an e-ink screen. The input devices can be a touch layer covering the display screen, buttons, a trackball, or a touchpad mounted on the computer device casing, or an external keyboard, touchpad, or mouse.

[0188] Those skilled in the art will understand that Figure 14The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0189] In one embodiment, a computer device is also provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps in the above method embodiments.

[0190] In one embodiment, a computer-readable storage medium is provided storing a computer program that, when executed by a processor, implements the steps in the above method embodiments.

[0191] In one embodiment, a computer program product or computer program is provided, the computer program product or computer program including computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium, and executes the computer instructions, causing the computer device to perform the steps in the above method embodiments.

[0192] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, data stored, data displayed, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties.

[0193] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium. When executed, the computer program can include the processes of the embodiments of the methods described above. Any references to memory, storage, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, or optical storage, etc. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM), etc.

[0194] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0195] The embodiments described above are merely illustrative of several implementation methods of this application, and while the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the invention patent. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this patent application should be determined by the appended claims.

Claims

1. A fault tree update method, characterized in that, The method includes: When an operational failure is detected, obtain page information related to the operational failure; The fault tree on the terminal is traversed based on the page information to obtain the fault link for fault location of the operational fault. The fault tree is a tree structure diagram formed by classifying system faults. For each fault node, there is a corresponding fault description, judgment rules, and judgment object. The top-to-bottom structure of the fault tree corresponds to the hierarchical structure of the page elements. The judgment rules of each level are different. The judgment rules of each level are gradually refined from top to bottom, and finally the smallest granular fault cause is located. The fault link is formed between fault nodes with hierarchical relationship. When the cause of the operational failure cannot be located based on the faulty link, the corresponding fault location rule is obtained according to the page information; the fault location rule corresponds to the page element and is a judgment condition for whether the page element has a fault from various dimensions. The cause of the operational failure is located locally on the terminal according to the fault location rules; The fault tree is updated according to the fault location rules.

2. The method according to claim 1, characterized in that, Updating the fault tree according to the fault location rules includes: A new fault node is generated in the fault link according to the fault location rules, and a new fault link is obtained; The fault tree is updated based on the new faulty link.

3. The method according to claim 2, characterized in that, Updating the fault tree based on the new faulty link includes: The new faulty link is reported to the server, which then updates its fault tree based on the new faulty link and distributes the updated fault tree to each terminal.

4. The method according to claim 1, characterized in that, The method further includes: After responding to the application startup command, request the fault tree from the server; Obtain the existing fault tree locally; If the requested fault tree is different from the existing local fault tree, the local fault tree is updated according to the requested fault tree.

5. A fault tree update method, characterized in that, The method includes: The system receives new fault links reported by the terminal. When the terminal detects an operational fault, it acquires page information related to the fault, traverses the local fault tree based on the page information, and obtains fault links for fault location based on the fault link. If the fault link fails to locate the cause of the operational fault, it acquires the corresponding fault location rule based on the page information, locates the cause of the operational fault based on the fault location rule, and generates a new fault node for the fault link, thus obtaining a new fault link. The fault tree is a tree structure diagram formed by classifying system faults. For each fault node, there is a corresponding fault description, judgment rule, and judgment object. The top-down structure of the fault tree corresponds to the hierarchical structure of the page elements. The judgment rules at each level are different, and the judgment rules at each level are gradually refined from top to bottom, ultimately locating the smallest granular fault cause. Fault links are formed between fault nodes with hierarchical relationships. The fault location rule corresponds to the page element and is a judgment condition for whether a page element has a fault from various dimensions. Update the fault tree based on the new faulty link; Distribute the updated fault tree to the terminal.

6. The method according to claim 5, characterized in that, The fault tree is updated based on the new faulty link, including: Matching is performed in the fault tree based on the new faulty link; If the complete link of the new faulty link does not exist in the fault tree of the server, then the target faulty link with the highest matching degree with the new faulty link is determined in the fault tree of the server. The faulty nodes in the new faulty link that are not included in the target faulty link are inserted into the leaf nodes of the target faulty link to obtain the server-updated fault tree.

7. The method according to claim 5, characterized in that, The method further includes: When a new version is released, acquire the fault monitoring task; Get page information about newly released version updates; Obtain the fault location rules for the updated page information; The fault monitoring task, the page information updated in the newly released version, and the fault location rules of the updated page information are published to the terminal.

8. The method according to claim 7, characterized in that, The fault monitoring task includes designated terminal information, which includes at least one of device identifier, version number, and user login account.

9. A fault tree updating device, characterized in that, The device includes: The page information acquisition module is used to acquire page information related to the operational failure when an operational failure is detected. The link determination module is used to traverse the fault tree on the terminal's local machine based on the page information to obtain the fault links for fault location of the operational fault. The fault tree is a tree structure diagram formed by classifying system faults into levels. For each fault node, there is a corresponding fault description, judgment rules, and judgment object. The top-to-bottom structure of the fault tree corresponds to the hierarchical structure of the page elements. The judgment rules of each level are different. The judgment rules of each level are gradually refined from top to bottom, and finally the smallest granular fault cause is located. The fault links are formed between fault nodes with hierarchical relationships. The rule acquisition module is used to acquire the corresponding fault location rules based on the page information when the cause of the operational failure cannot be located based on the fault link; the fault location rules correspond to page elements and are judgment conditions for whether page elements have failed from various dimensions. The fault location module is used to locate the cause of the operational fault locally on the terminal according to the fault location rules. An update module is used to update the fault tree according to the fault location rules.

10. The apparatus according to claim 9, characterized in that, The update module is also used to generate new fault nodes in the fault link according to the fault location rules, thereby obtaining a new fault link; and to update the fault tree according to the new fault link.

11. The apparatus according to claim 10, characterized in that, The update module is also used to report the new fault link to the server, and the server updates its fault tree according to the new fault link and then distributes the updated fault tree to each terminal.

12. The apparatus according to claim 9, characterized in that, The update module is also used to request a fault tree from the server after responding to the application startup command; obtain the existing fault tree locally; and update the local fault tree according to the requested fault tree if the requested fault tree is different from the existing local fault tree.

13. A fault tree updating device, characterized in that, The device includes: The reporting and receiving module is used to receive new fault links reported by the terminal. When the terminal detects an operational fault, it acquires page information related to the operational fault, traverses the local fault tree based on the page information, and obtains fault links for fault location based on the operational fault. If the fault link fails to locate the cause of the operational fault, it acquires the corresponding fault location rule based on the page information, locates the cause of the operational fault based on the fault location rule, and generates a new fault node for the fault link, thus obtaining a new fault link. The fault tree is a tree structure diagram formed by classifying system faults. For each fault node, there is a corresponding fault description, judgment rule, and judgment object. The top-down structure of the fault tree corresponds to the hierarchical structure of the page elements. The judgment rules at each level are different, and the judgment rules at each level are gradually refined from top to bottom, ultimately locating the smallest granular fault cause. Fault links are formed between fault nodes with hierarchical relationships. The fault location rule corresponds to the page element and is a judgment condition for whether a page element has a fault from various dimensions. The update module is used to update the fault tree based on the new faulty link; The distribution module is used to distribute updated fault trees to the terminals.

14. The apparatus according to claim 13, characterized in that, The update module is further configured to perform matching in the fault tree based on the new fault link; if the complete link of the new fault link does not exist in the fault tree of the server, then the target fault link with the highest matching degree with the new fault link is determined in the fault tree of the server; and the fault nodes of the new fault link that are not included in the target fault link are inserted into the leaf nodes of the target fault link to obtain the fault tree updated by the server.

15. The apparatus according to claim 13, characterized in that, The device further includes a task acquisition module, which is used to acquire fault monitoring tasks when a new version is released; acquire page information updated in the new version; and acquire fault location rules for the updated page information. The distribution module is also used to publish the fault monitoring task, the page information updated in the newly released version, and the fault location rules of the updated page information to the terminal.

16. The apparatus according to claim 15, characterized in that, The fault monitoring task includes designated terminal information, which includes at least one of device identifier, version number, and user login account.

17. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1 to 8.

18. A computer-readable storage medium having a computer program stored thereon, the computer program, when executed by a processor, implementing the steps of the method according to any one of claims 1 to 8.

19. A computer program product comprising a computer program that, when executed by a processor, implements the steps of the method according to any one of claims 1 to 8.

Images