Event processing method and device, electronic equipment and storage medium

Abstract

The invention provides an event processing method and device, electronic equipment and a storage medium. The event processing method comprises the following steps: in response to a first event generated under a target application, determining a first leaf node corresponding to the first event in a functional architecture tree; according to a preset aggregation rule and the first event, determining a target node aggregated by the first event in a first leaf node and an ancestor node of the first leaf node; determining a target operation object corresponding to the target node, and executing an operation corresponding to the first event on the target operation object; wherein the functional architecture tree is a tree-shaped hierarchical structure of each function of the target application. The event processing efficiency is improved.

Description

Technical Field

[0001] The present disclosure relates to the field of computer technology, and in particular to an event processing method, device, electronic device and storage medium. Background Art

[0002] Applications usually include many functions and sub-functions of functions. Any function may produce an exception, which may result in an alarm event. After an alarm event is generated, it needs to be processed. If the application is more complex, such as a large server application, it will have more functions or sub-functions, and alarm events need to be processed efficiently. Summary of the invention

[0003] The present disclosure provides an event processing method, device, electronic device and storage medium.

[0004] The present disclosure adopts the following technical solutions.

[0005] In some embodiments, the present disclosure provides an event processing method, including:

[0006] In response to a first event being generated in the target application, determining a first leaf node corresponding to the first event in the functional architecture tree;

[0007] According to a preset aggregation rule and the first event, determining a target node to which the first event is aggregated from a first leaf node and an ancestor node of the first leaf node;

[0008] Determine a target operation object corresponding to the target node, and perform an operation corresponding to the first event on the target operation object;

[0009] The functional architecture tree is a tree-like hierarchical structure of each function of the target application.

[0010] In some embodiments, the present disclosure provides an event processing device, comprising:

[0011] A determination unit, configured to determine, in response to a first event being generated in a target application, a first leaf node corresponding to the first event in a functional architecture tree;

[0012] A control unit, configured to determine, according to a preset aggregation rule and the first event, a target node to which the first event is aggregated among a first leaf node and an ancestor node of the first leaf node;

[0013] The control unit is further configured to determine a target operation object corresponding to the target node, and perform an operation corresponding to the first event on the target operation object;

[0014] The functional architecture tree is a tree-like hierarchical structure of each function of the target application.

[0015] In some embodiments, the present disclosure provides an electronic device, comprising: at least one memory and at least one processor;

[0016] The memory is used to store program codes, and the processor is used to call the program codes stored in the memory to execute the above method.

[0017] In some embodiments, the present disclosure provides a computer-readable storage medium, wherein the computer-readable storage medium is used to store program code, and when the program code is executed by a processor, the processor is prompted to perform the above method.

[0018] The event processing method provided by the embodiment of the present disclosure can improve event processing efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0020] Figure 1 It is a flowchart of the event processing method of the embodiment of the present disclosure.

[0021] Figure 2 It is a schematic diagram of a functional structure diagram of an embodiment of the present disclosure.

[0022] Figure 3 It is a schematic diagram of the event processing method of the embodiment of the present disclosure.

[0023] Figure 4 It is a schematic diagram of the structure of an electronic device according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0024] It is understandable that before using the technical solutions disclosed in the embodiments of the present disclosure, the types, scope of use, usage scenarios, etc. of the personal information involved in the present disclosure should be informed to the user and the user's authorization should be obtained in an appropriate manner in accordance with relevant laws and regulations.

[0025] For example, in response to receiving an active request from a user, a prompt message is sent to the user to clearly prompt the user that the operation requested to be performed will require obtaining and using the user's personal information. Thus, the user can autonomously choose whether to provide personal information to software or hardware such as an electronic device, application, server, or storage medium that performs the operation of the technical solution of the present disclosure according to the prompt message.

[0026] As an optional but non-limiting implementation, in response to receiving an active request from the user, the prompt information may be sent to the user in the form of a pop-up window, in which the prompt information may be presented in text form. In addition, the pop-up window may also carry a selection control for the user to choose "agree" or "disagree" to provide personal information to the electronic device.

[0027] It is understandable that the above notification and the process of obtaining user authorization are merely illustrative and do not constitute a limitation on the implementation of the present disclosure. Other methods that meet the relevant laws and regulations may also be applied to the implementation of the present disclosure.

[0028] It is understandable that the data involved in this technical solution (including but not limited to the data itself, the acquisition or use of the data) shall comply with the requirements of relevant laws, regulations and relevant provisions.

[0029] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments described herein, which are instead provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

[0030] It should be understood that the various steps described in the method embodiments of the present disclosure can be performed in sequence and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect.

[0031] The term "including" and its variations used herein are open inclusions, i.e., "including but not limited to". The term "based on" means "based at least in part on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description.

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

[0033] It should be noted that the modification of “one” mentioned in the present disclosure is illustrative rather than restrictive, and those skilled in the art should understand that it should be understood as “one or more” unless otherwise clearly indicated in the context.

[0034] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0035] The solution provided by the embodiment of the present disclosure will be described in detail below with reference to the accompanying drawings.

[0036] like Figure 1 As shown, Figure 1 It is a flowchart of an event processing method of an embodiment of the present disclosure, which includes the following steps.

[0037] S11. In response to a first event being generated in a target application, determining a first leaf node corresponding to the first event in a functional architecture tree.

[0038] In some embodiments, the target application may be a computer application, a mobile application, or a server application. The first event generated under the target application may be an alarm event, and the alarm event may be an event when one or more functions in the target application are abnormal. After the alarm event occurs, an alarm message will be generated. The target applications all have corresponding functional architecture trees, and the functional architecture tree is a tree-like hierarchical structure of each function of the target application. The root node in the functional architecture tree may be the target application, and the nodes other than the root node may be functions. The functions of the high-level nodes cover the functions of the low-level nodes. For example, taking the target application as a collaborative office software that integrates video conferencing and document functions as an example, the target application can be used as the root node, and the next level can be divided into two nodes, video conferencing and document. There may be other sub-nodes in the video conference. For example, under the video conference, there may be functions such as meeting records and meeting summaries, and under the document function node, there may be functional nodes such as table documents, text documents, and presentation documents. Nodes such as meeting minutes, meeting summaries, spreadsheet documents, text documents, and presentation documents can be divided according to specific scenarios to obtain their next-level nodes. For example, spreadsheet documents, text documents, and presentation documents can be asynchronously divided according to online functions and offline functions to obtain nodes for specific functional scenarios. Figure 2 The functional architecture tree of the XX application is schematically shown, where the business is the function, the business module is the next level function of the business, and the scenario is the next level function of the business module. The XX application is divided into business 1 and business 2 according to the business it involves. Business 1 is divided into business module 1 to business module 3 according to the subdivided business. Business module 1 is further subdivided into scenario 1 to scenario 3 according to the specific scenarios it involves. In some cases, the node of the function of the previous level can be a summary or outline of the node of the function of the next level. The functional architecture tree can be used to understand the functional composition of the target application.

[0039] S12. According to a preset aggregation rule and the first event, determine a target node to which the first event is aggregated from the first leaf node and the ancestor node of the first leaf node.

[0040] In some embodiments, the aggregation rule is a pre-set rule for determining whether to aggregate an event (e.g., an alarm event) toward the root node of the functional architecture tree. The first leaf node is usually the end node of the functional architecture tree, and is usually the node of the specific functional scenario that generates the first event. After the first event is generated, it will be aggregated upward layer by layer along the direction from the first leaf node to the root node according to the aggregation rule. For example, Figure 2 As shown in the figure, in scenario 1, alarm rules (rule A and rule B) are pre-set. When the alarm rules are met, an alarm event is generated. Figure 2 The rule engine in is a computing layer used to perform calculations using aggregation rules. When rule A in the alarm rule is met, an alarm event is generated. The rule engine of business module 1 calculates whether the alarm event meets the conditions for aggregation to business module 1. If it does, it is aggregated to business module 1. Then, the rule engine of business 1 calculates whether the alarm event meets the conditions for aggregation to business 1. If it does not meet the conditions, the target node is determined to be Figure 2 If the alarm event does not meet the conditions for aggregation to business module 1, the target node is scenario 1. The ancestor nodes of the first leaf node include the parent node, grandparent node and root node of the first leaf node, but do not include the sibling nodes of the ancestor node of the first leaf node, for example, do not include the uncle node of the same generation as the parent node. Figure 2 The ancestor nodes of scenario 1 are business module 1, business 1 and xx application.

[0041] S13: Determine a target operation object corresponding to the target node, and perform an operation corresponding to the first event on the target operation object.

[0042] In some embodiments, the target operation object is the operation object corresponding to the target node, and the operation objects of different nodes may be different. The target operation object may be a person, a group, etc. The operation corresponding to the first event may be related to the first event, and the operations corresponding to different events may have the same or different types, or may have the same or different contents. For example, if the target operation object is a target group, the operation corresponding to the first event performed on the target operation object may include: sending the relevant information of the first event to the target group. In some embodiments, for any event, after it is aggregated to the target node (the target node may be any node), the operation corresponding to the event may be performed on the target operation object corresponding to the target node. In some embodiments, after each different event is aggregated to the target node, the operation corresponding to each event will be performed on the target operation object. Taking the target operation object as the target group as an example, the first event is aggregated to the target node, and the relevant information of the first event will be sent in the target group. After other events are aggregated to the target node, the relevant information of the other events may be sent in the target group. The relevant information of the first event currently existing and occurring in the future will be sent to the target group. In some embodiments, relevant information of the first event is sent to the target group in the form of a message, and the message may include an identifier of the first event. By clicking or triggering the identifier of the first event, a collection of messages of relevant information of the first event already in the target group can be displayed, so that the first event is conveniently and quickly viewed. In some embodiments, relevant information of each event aggregated to the target node is sent to the target group. For example, if the second event is also aggregated to the same target node as the first event, then relevant information of the second event will also be sent to the target group. Similarly, relevant information of the second event is sent to the target group in the form of a message, and the message may include an identifier of the second event. By clicking or triggering the identifier of the second event, a collection of messages of relevant information of the second event already in the target group can be displayed.

[0043] In some embodiments of the present disclosure, after the occurrence of a first event, it will be aggregated to a target node according to a preset aggregation rule, and then the target operation object will be determined and the operation corresponding to the first event will be performed on the target operation object. Since the target node to which the event is aggregated is determined, that is, the functional level reached by the event is determined, by dividing the functional level reached by the first event that occurs, and then performing the corresponding operation on the corresponding target operation object, it is ensured that the target operation object matches the first event, and the selected target operation object is rationalized, which is conducive to improving processing efficiency. For example, when a fault involving a larger function occurs, the functional level involved in the fault can be reasonably determined to avoid the problem of delays caused by the fault being unable to be resolved after being processed at a lower functional level, and the problem of delays caused by further resolution at a higher functional level is avoided.

[0044] In some embodiments of the present disclosure, the method further includes: in response to the second event being aggregated to the target node, performing the operation corresponding to the second event on the target operation object. In some embodiments, the second event is another event different from the first event, for example, it can be another fault or anomaly. After the second event occurs, the node to which it is aggregated can be determined, and the determination method can be the same as the method in which the first event determines the node to which it is aggregated. After the second event is also aggregated to the target node, the operation corresponding to the second event will be performed on the target operation object. In some embodiments, for other events (such as the second event) aggregated to the same target node, after being aggregated to the target node, the operations corresponding to other events will also be performed on the target operation object, and the same is true for other nodes, that is, if multiple events are aggregated to the same node, the operation object corresponding to the node performs the operations corresponding to these multiple events aggregated to the node. In this way, there is no need to create multiple target operation objects for unused events, and the operation object will be determined based on the hierarchical height of the functional nodes involved in the event and the corresponding operation will be performed. For example, taking the target operation object as the target group, performing the operation corresponding to the first event on the target operation object is to send the relevant information of the first event to the corresponding target group. Multiple events involving functions of the same level share the same target group, and the relevant information of each different event aggregated to the target node is sent to one target group without creating multiple groups, thereby improving the aggregation of information.

[0045] In some embodiments of the present disclosure, each node in the functional architecture tree corresponds to a related object, for example, the related object may be a related person, a related document, etc. In some embodiments, the related object is not a node, the node is each function of the target application, and the related object is a related object of the function. The related person corresponding to the node may be a processing person. In some embodiments, the higher the level of the node in the functional architecture tree, the larger the event processing scope of the related person corresponding to the node. This is because the higher the level of the node in the functional architecture tree, the larger the functional scope covered by the node can be represented. Accordingly, it is necessary to configure a person who can handle the covered functions. For example, the business in scenario 2 may be a collaborative office function, business module 1 may be a video conferencing function, scenario 1 may be a sub-function in the video conferencing function, and the related object corresponding to scenario 1 may be a person who can handle the sub-function, and the related person corresponding to each level node may be a person who can handle the function covered by the node. Determining the target operation object corresponding to the target node includes: determining the target operation object according to the related objects corresponding to each node on the path from the target node to the first leaf node. For example, if the target operation object is a target group, then the relevant personnel corresponding to each node on the path from the target node to the first leaf node can be added to the target group. In some embodiments, after the first event occurs, a group of relevant personnel corresponding to the first leaf node can be created first, and after the target node is determined, the relevant personnel of the nodes on the path from the first leaf node to the target node can be added to the group. In this way, the relevant personnel corresponding to each node are added to the target group, so that the personnel involved in the first event are all in the target group, which is convenient for mutual communication and resolution of the first event.

[0046] In some embodiments of the present disclosure, the method further includes: in response to the second event being aggregated to the target node, updating the target operation object according to the relevant objects corresponding to each node on the path from the target node to the second leaf node, or sending an invitation for updating the target operation object to the relevant objects corresponding to each node on the path from the target node to the second leaf node. In some embodiments, it may be that in response to the second event being aggregated to the target node, adding the relevant personnel corresponding to each node on the path from the target node to the second leaf node who have not yet joined the target group to the target group, or sending an invitation to join the target group to the relevant personnel corresponding to each node on the path from the target node to the second leaf node who have not yet joined the target group; wherein the first event corresponds to the second leaf node in the functional architecture tree.

[0047] In some embodiments, such as Figure 2As shown, the first leaf node corresponding to the first event can be scenario 1, and the second leaf node corresponding to the second event can be scenario 2. If the first event and the second event are aggregated to the same target node, then the relevant persons (if they have not yet joined the target group) of the nodes on the path from the second leaf node to the target node (the second node and the ancestor node of the second node on the path) will be added to the target group, or an invitation to the target group will be sent to these persons so that they can join the target group. The relevant information of the second event will also be sent to the target group.

[0048] In some embodiments of the present disclosure, the terminal leaf node of the functional architecture tree has one or more corresponding trigger rules, and the first event is an event that satisfies any of the trigger rules; the first leaf node corresponding to the first event in the functional architecture tree is: the terminal leaf node corresponding to the trigger rule satisfied by the first event. Figure 2 As shown, the terminal leaf node of the functional architecture tree is usually a node of a specific functional scenario, which is provided with a corresponding trigger rule, such as an alarm rule. If the trigger rule is met, a corresponding event is generated. Both the first event and the second event can be events that satisfy any trigger rule. The first event satisfies the trigger rule corresponding to the first leaf node, and the second event satisfies the trigger rule corresponding to the second leaf node. The trigger rules corresponding to different terminal leaf nodes can be the rules that will generate alarms in the specific functional scenarios involved in the terminal leaf nodes.

[0049] In some embodiments of the present disclosure, the non-terminal nodes of the functional architecture tree have corresponding aggregation conditions, and the aggregation rule includes the aggregation conditions; in some embodiments, the aggregation rule may be a set of aggregation conditions. Figure 2 As shown, whether an event satisfies the aggregation condition of a non-terminal node can be determined by the rule engine corresponding to the terminal node.

[0050] In some embodiments, based on a preset aggregation rule and the first event, a target node to which the first event is aggregated is determined in a first leaf node and an ancestor node of the first leaf node, including: activating the first leaf node; in response to the presence of a target ancestor node in the ancestor node of the first leaf node that satisfies the corresponding aggregation conditions for the first event and is in an inactivated state, activating the target ancestor node; in the path from the first leaf node to the root node, using the highest-level node among the consecutive nodes that are activated starting from the first leaf node as the target node.

[0051] In some embodiments, after the first event is generated, the first leaf node will be activated, and then starting from the first leaf node, along the path from the first leaf node to the root node, it is determined one by one whether the first event meets the aggregation condition of the ancestor node of the first leaf node, and the ancestor node is activated if it meets the condition. When the first event does not meet the aggregation condition, the judgment can be stopped. Because if an event does not meet the aggregation condition of a node with a lower level, it will not meet the aggregation condition of a node with a higher level. Therefore, on the path from the first leaf node upward, there are one or more nodes in a continuous activated state, and the node with the highest level among these nodes is used as the target node.

[0052] In some embodiments of the present disclosure, according to a preset aggregation rule and the first event, a target node to which the first event is aggregated is determined in a first leaf node and an ancestor node of the first leaf node, including: setting the first leaf node as a current node, making the first leaf node in an activated state, and executing a detection step, the detection step including: in response to the parent node of the current node being in an activated state and the parent node of the current node being a root node, setting the parent node of the current node as the current node, and ending the detection step; in response to the parent node of the current node being in an activated state and the parent node of the current node being not a root node, setting the parent node of the current node as the current node, and re-executing the detection step; in response to the parent node of the current node being in an inactivated state and the first event satisfying the aggregation condition corresponding to the parent node of the current node, activating the parent node of the current node and setting the parent node of the current node as the current node, and re-executing the detection step; in response to the parent node of the current node being in an inactivated state and the first event not satisfying the aggregation condition corresponding to the parent node of the current node, ending the detection step; setting the current node as the target node. In some embodiments of the present disclosure, after determining the first leaf node corresponding to the first event in the functional architecture tree, the method further includes: in response to the presence of a target ancestor node in the ancestor node of the first leaf node that satisfies the corresponding aggregation condition for the first event and is in an inactivated state, mounting the first event to the highest-level node in the target ancestor node; in response to the absence of a target ancestor node in the ancestor node of the first leaf node that satisfies the corresponding aggregation condition for the first event and is in an inactivated state, mounting the first event to the first leaf node.

[0053] In some embodiments, such as Figure 3 As shown, it schematically shows a flowchart for determining a target node, and the nodes in the functional architecture tree are initially in an inactive state. Figure 3The first event in is an alarm event. After the first event is generated, the corresponding leaf node (first leaf node) is activated. Specifically, if the first leaf node has not been activated, the first leaf node is activated and the first event is mounted to the first leaf node. If the first leaf node has been activated (for example, other events corresponding to the first leaf node have been generated), the detection step is executed. When executing the detection step, the activation state of the parent node of the current node is first detected (the current node is the first leaf node when the detection step is executed for the first time). If the parent node of the current node has been activated, it will be detected whether the parent node of the current node is a root node. If the parent node of the current node has been activated and is a root node, then there is no node at a higher level, and the parent node of the current node is set as the current node, and further set as the target node. If the parent node of the current node has been activated but is not a root node, the parent node of the current node is set as the current node, and then the detection step is re-executed (starting from checking the activation state of the parent node of the current node). If the parent node of the current node is not activated, and according to the aggregation conditions, the parent node of the current node does not need to be activated (that is, the first event does not meet the aggregation conditions of the parent node of the current node), the current node is set as the target node. If the parent node of the current node needs to be activated, the first event is mounted to the parent node of the current node, and then the parent node of the current node is set as the current node, and the detection step is re-executed. Through the above operation, after the first event occurs, the first leaf node to which it belongs will be activated, and it will be determined whether to further activate the ancestor node according to the aggregation rules, so that an activated target node of the highest level will be obtained, which is convenient for processing the first event.

[0054] In some embodiments of the present disclosure, the method also includes: in response to the first event being resolved, determining the node to be adjusted from the descendant nodes of the target node according to the event mounting status of the descendant nodes of the target node; and adjusting the target node and the node to be adjusted to an inactivated state.

[0055] In some embodiments, after the first event is resolved (usually a member of the target group resolves the first event, for example, the relevant personnel corresponding to the first leaf node to the target node resolves the first event), the already activated nodes need to be processed and converted to inactivated. In addition to the target node, the nodes on the path from the first leaf node to the target node also need to be converted to inactivated. However, after the first event occurs, other events may also have occurred. If the nodes on the path from the first leaf node to the target node are directly converted from an activated state to an inactivated state, errors may occur. For example, if another event causes the first leaf node to be activated, the first leaf node should not be converted to an inactivated state at this time. Therefore, in this embodiment, the node to be adjusted is determined based on the event mounting state (i.e., whether an event is mounted), and then the node to be adjusted is converted to an inactivated state.

[0056] In some embodiments of the present disclosure, a node to be adjusted is determined from the descendant nodes of the target node according to the event mounting status of the descendant nodes of the target node, including: traversing each sub-node path of the target node to determine the node to be adjusted; wherein traversing any of the sub-node paths includes: in response to the existence of an activated node on the sub-node path, and an event is mounted on at least one activated node on the sub-node path, ending the traversal of the sub-node path; in response to the existence of an activated node on the sub-node path, and no event is mounted on any of the activated nodes on the sub-node path, adding the activated node on the sub-node path to the node to be adjusted.

[0057] In some embodiments, after the first event is resolved, it is necessary to adjust the state of the relevant nodes, because the first event is bound to the node, and multiple events may exist simultaneously on the function structure tree. Therefore, when determining the node to be adjusted, first find the target node bound to the first event, and the subtree with the target node as the root node is the maximum range of the activation state of this adjustment, and the target node is the node that needs to be adjusted to the inactive state. Then traverse each child node path of the target node, and the child node path is the path from the target node, through the child node of the target node to the end node, and when traversing the nodes on the child node path, traverse in the order from high level to low level. If there is a node in the activated state on a child node path, and at least one node in the activated state is mounted with an event, then the node on the path may be caused by the mounted event to become the activated state, so the path ends traversal. If there is a node in the activated state on a child node path, but no event is mounted, then these nodes in the activated state are caused by the first event, and they are marked as nodes to be adjusted, and then the target node and the node to be adjusted are converted into the inactive state.

[0058] In some embodiments of the present disclosure, the functional architecture tree includes nodes and connections between nodes. On the functional architecture tree, a parent node can have one or more child nodes, and the terminal leaf node is set with a trigger rule. The node has an activated and an unactivated state, and the initial default is an unactivated state. After an event is generated, the target node to which the event is aggregated and the nodes on its path are adjusted to an activated state. Generally, it is necessary to wait until the event is processed and then adjust it back to an unactivated state. For example, after an alarm event occurs, the leaf node to which it belongs is activated, and whether to activate its parent node is further determined based on the aggregation rule. This step is repeated until an activated top-level node is obtained. This aggregation link is a one-way linked list structure, which can be the target node that can be aggregated to the event according to the aggregation rule calculated by the installed plug-in. The group pointed to by this event is the target group corresponding to the target node, and the relevant information of the event will be sent to the target group in the form of a message. After the event is processed, the relevant nodes are adjusted back to the unactivated state. By using the functional architecture tree, events are aggregated upward so that relevant information of events aggregated to the same target node is sent to the same target group, which is convenient for processing personnel. Because when different events involve functions at the same level, they often need to be processed by personnel at that level. They are processed in one target group without the need to establish multiple groups. In addition, messages of different events can be distinguished by event identifiers in the messages, and related messages of the event can be viewed, which is convenient for processing personnel to handle and improves processing efficiency.

[0059] The present disclosure also provides an event processing device, comprising:

[0060] A determination unit, configured to determine, in response to a first event being generated in a target application, a first leaf node corresponding to the first event in a functional architecture tree;

[0061] A control unit, configured to determine, according to a preset aggregation rule and the first event, a target node to which the first event is aggregated among a first leaf node and an ancestor node of the first leaf node;

[0062] The control unit is further configured to determine a target operation object corresponding to the target node, and perform an operation corresponding to the first event on the target operation object;

[0063] The functional architecture tree is a tree-like hierarchical structure of each function of the target application.

[0064] In some embodiments, the control unit is further configured to: in response to a second event being aggregated to the target node, execute an operation corresponding to the second event on the target operation object.

[0065] In some embodiments, the nodes in the functional architecture tree correspond to related objects;

[0066] Determining the target operation object corresponding to the target node includes: determining the target operation object according to related objects corresponding to each node on the path from the target node to the first leaf node.

[0067] In some embodiments, the control unit is also used to: in response to the second event being aggregated to the target node, update the target operation object according to the relevant objects corresponding to each node on the path from the target node to the second leaf node, or send an invitation for updating the target operation object to the relevant objects corresponding to each node on the path from the target node to the second leaf node; wherein the first event corresponds to the second leaf node in the functional architecture tree.

[0068] In some embodiments, the non-terminal nodes of the functional architecture tree have corresponding aggregation conditions, and the aggregation rule includes the aggregation conditions;

[0069] According to the preset aggregation rule and the first event, the target node to which the first event is aggregated is determined in the first leaf node and the ancestor node of the first leaf node, including: activating the first leaf node; in response to the existence of a target ancestor node in the ancestor node of the first leaf node that satisfies the corresponding aggregation conditions for the first event and is in an inactivated state, activating the target ancestor node; in the path from the first leaf node to the root node, the node with the highest level among the consecutive nodes that are activated starting from the first leaf node is used as the target node.

[0070] In some embodiments, determining the target node to which the first event is aggregated from the first leaf node and the ancestor node of the first leaf node according to a preset aggregation rule and the first event includes:

[0071] The first leaf node is set as the current node and the first leaf node is activated.

[0072] Execute a detection step, the detection step comprising: in response to the parent node of the current node being in an activated state and the parent node of the current node being a root node, setting the parent node of the current node as the current node and ending the detection step; in response to the parent node of the current node being in an activated state and the parent node of the current node being not a root node, setting the parent node of the current node as the current node and re-executing the detection step; in response to the parent node of the current node being in an inactivated state and the first event satisfying the aggregation condition corresponding to the parent node of the current node, activating the parent node of the current node and setting the parent node of the current node as the current node, and re-executing the detection step; in response to the parent node of the current node being in an inactivated state and the first event not satisfying the aggregation condition corresponding to the parent node of the current node, ending the detection step;

[0073] The current node is set as the target node.

[0074] In some embodiments, after determining the first leaf node corresponding to the first event in the functional architecture tree, the control unit is also used to: in response to the presence of a target ancestor node in the ancestor node of the first leaf node that satisfies the corresponding aggregation condition for the first event and is in an inactive state, mount the first event to the highest-level node in the target ancestor node; in response to the absence of a target ancestor node in the ancestor node of the first leaf node that satisfies the corresponding aggregation condition for the first event and is in an inactive state, mount the first event to the first leaf node.

[0075] In some embodiments, the control unit is further configured to: in response to the first event being resolved, determine the node to be adjusted from the descendant nodes of the target node according to the event mounting status of the descendant nodes of the target node;

[0076] The target node and the node to be adjusted are adjusted to an inactivated state.

[0077] In some embodiments, determining the node to be adjusted from the descendant nodes of the target node according to the event mounting state of the descendant nodes of the target node includes:

[0078] Traversing each sub-node path of the target node to determine the node to be adjusted;

[0079] Among them, traversing any of the sub-node paths includes: in response to the existence of an activated node on the sub-node path and an event mounted on at least one of the activated nodes on the sub-node path, ending the traversal of the sub-node path; in response to the existence of an activated node on the sub-node path and no event mounted on the activated nodes on the sub-node path, adding the activated node on the sub-node path to the node to be adjusted.

[0080] In some embodiments, the terminal leaf node of the functional architecture tree has one or more corresponding trigger rules, and the first event is an event that satisfies any of the trigger rules;

[0081] The first leaf node corresponding to the first event in the functional architecture tree is: the terminal leaf node corresponding to the trigger rule satisfied by the first event.

[0082] In some embodiments, determining a target operation object corresponding to the target node and performing an operation corresponding to the first event on the target operation object includes: determining a target group corresponding to the target node and sending relevant information of the first event to the target group.

[0083] For the embodiments of the device, since they basically correspond to the method embodiments, the relevant parts refer to the partial description of the method embodiments. The device embodiments described above are merely illustrative, wherein the modules described as separation modules may or may not be separated. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of the present embodiment. Those of ordinary skill in the art can understand and implement without paying creative work.

[0084] The method and device of the present disclosure are described above based on the embodiments and application examples. In addition, the present disclosure also provides an electronic device and a computer-readable storage medium, which are described below.

[0085] Reference below Figure 4 , which shows a schematic diagram of the structure of an electronic device (such as a terminal device or a server) 800 suitable for implementing the embodiment of the present disclosure. The terminal device in the embodiment of the present disclosure may include, but is not limited to, mobile terminals such as mobile phones, laptops, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. The electronic device shown in the figure is only an example and should not bring any limitation to the functions and scope of use of the embodiment of the present disclosure.

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

[0087] Typically, the following devices may be connected to the I / O interface 805: input devices 806 including, for example, a touch screen, a touchpad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; output devices 807 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; storage devices 808 including, for example, a magnetic tape, a hard disk, etc.; and communication devices 809. The communication device 809 may allow the electronic device 800 to communicate with other devices wirelessly or by wire to exchange data. Although the electronic device 800 with various devices is shown in the figure, it should be understood that it is not required to implement or have all the devices shown. More or fewer devices may be implemented or have alternatively.

[0088] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program contains program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device 809, or installed from a storage device 808, or installed from a ROM 802. When the computer program is executed by the processing device 801, the above-mentioned functions defined in the method of the embodiment of the present disclosure are executed.

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

[0090] In some embodiments, the client and the server may communicate using any currently known or future developed network protocol such as HTTP (HyperText Transfer Protocol), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or future developed network.

[0091] The computer-readable medium may be included in the electronic device, or may exist independently without being incorporated into the electronic device.

[0092] The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device executes the method of the present disclosure.

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

[0094] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present disclosure. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some implementations as replacements, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0095] The units involved in the embodiments described in the present disclosure may be implemented by software or hardware, wherein the name of a unit does not, in some cases, limit the unit itself.

[0096] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.

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

[0098] According to one or more embodiments of the present disclosure, there is provided an event processing method, including:

[0099] In response to a first event being generated in the target application, determining a first leaf node corresponding to the first event in the functional architecture tree;

[0100] According to a preset aggregation rule and the first event, determining a target node to which the first event is aggregated from a first leaf node and an ancestor node of the first leaf node;

[0101] Determine a target operation object corresponding to the target node, and perform an operation corresponding to the first event on the target operation object;

[0102] The functional architecture tree is a tree-like hierarchical structure of each function of the target application.

[0103] According to one or more embodiments of the present disclosure, an event processing method is provided, further comprising: in response to a second event being aggregated to the target node, performing an operation corresponding to the second event on the target operation object.

[0104] According to one or more embodiments of the present disclosure, there is provided an event processing method, wherein the nodes in the functional architecture tree correspond to related objects;

[0105] Determining the target operation object corresponding to the target node includes: determining the target operation object according to related objects corresponding to each node on the path from the target node to the first leaf node.

[0106] According to one or more embodiments of the present disclosure, there is provided an event processing method, further comprising:

[0107] In response to the second event being aggregated to the target node, updating the target operation object according to the related objects corresponding to each node on the path from the target node to the second leaf node, or sending an invitation for updating the target operation object to the related objects corresponding to each node on the path from the target node to the second leaf node;

[0108] The first event corresponds to the second leaf node in the functional architecture tree.

[0109] According to one or more embodiments of the present disclosure, an event processing method is provided.

[0110] The non-terminal nodes of the functional architecture tree have corresponding aggregation conditions, and the aggregation rule includes the aggregation conditions;

[0111] According to the preset aggregation rule and the first event, the target node to which the first event is aggregated is determined in the first leaf node and the ancestor node of the first leaf node, including: activating the first leaf node; in response to the existence of a target ancestor node in the ancestor node of the first leaf node that satisfies the corresponding aggregation conditions for the first event and is in an inactivated state, activating the target ancestor node; in the path from the first leaf node to the root node, the node with the highest level among the consecutive nodes that are activated starting from the first leaf node is used as the target node.

[0112] According to one or more embodiments of the present disclosure, an event processing method is provided, which determines, according to a preset aggregation rule and the first event, a target node to which the first event is aggregated in a first leaf node and an ancestor node of the first leaf node, including:

[0113] The first leaf node is set as the current node and the first leaf node is activated.

[0114] Execute a detection step, the detection step comprising: in response to the parent node of the current node being in an activated state and the parent node of the current node being a root node, setting the parent node of the current node as the current node and ending the detection step; in response to the parent node of the current node being in an activated state and the parent node of the current node being not a root node, setting the parent node of the current node as the current node and re-executing the detection step; in response to the parent node of the current node being in an inactivated state and the first event satisfying the aggregation condition corresponding to the parent node of the current node, activating the parent node of the current node and setting the parent node of the current node as the current node, and re-executing the detection step; in response to the parent node of the current node being in an inactivated state and the first event not satisfying the aggregation condition corresponding to the parent node of the current node, ending the detection step;

[0115] The current node is set as the target node.

[0116] According to one or more embodiments of the present disclosure, an event processing method is provided. After determining the first leaf node corresponding to the first event in the functional architecture tree, the method further includes:

[0117] In response to the presence of a target ancestor node in an inactive state in an ancestor node of the first leaf node, in which the first event meets a corresponding aggregation condition, mounting the first event to the highest-level node in the target ancestor node;

[0118] In response to the fact that there is no target ancestor node in the ancestor node of the first leaf node that satisfies the corresponding aggregation condition of the first event and is in an inactive state, the first event is mounted to the first leaf node.

[0119] According to one or more embodiments of the present disclosure, there is provided an event processing method, the method further comprising:

[0120] In response to the first event being resolved, determining a node to be adjusted from the descendant nodes of the target node according to an event mounting state of a descendant node of the target node;

[0121] The target node and the node to be adjusted are adjusted to an inactivated state.

[0122] According to one or more embodiments of the present disclosure, an event processing method is provided, which determines a node to be adjusted from the descendant nodes of the target node according to the event mounting state of the descendant nodes of the target node, including:

[0123] Traversing each sub-node path of the target node to determine the node to be adjusted;

[0124] Wherein, traversing any of the sub-node paths includes:

[0125] In response to the existence of an activated node on the sub-node path and an event mounted on at least one of the activated nodes on the sub-node path, the traversal of the sub-node path is terminated; in response to the existence of an activated node on the sub-node path and no event mounted on the activated nodes on the sub-node path, the activated nodes on the sub-node path are added to the node to be adjusted.

[0126] According to one or more embodiments of the present disclosure, an event processing method is provided, wherein the terminal leaf node of the functional architecture tree has one or more corresponding trigger rules, and the first event is an event that satisfies any of the trigger rules;

[0127] The first leaf node corresponding to the first event in the functional architecture tree is: the terminal leaf node corresponding to the trigger rule satisfied by the first event.

[0128] According to one or more embodiments of the present disclosure, an event processing method is provided, which determines the target operation object corresponding to the target node, and performs the corresponding operation of the first event on the target operation object, including: determining the target group corresponding to the target node, and sending relevant information of the first event to the target group.

[0129] According to one or more embodiments of the present disclosure, there is provided an event processing device, comprising:

[0130] A determination unit, configured to determine, in response to a first event being generated in a target application, a first leaf node corresponding to the first event in a functional architecture tree;

[0131] A control unit, configured to determine, according to a preset aggregation rule and the first event, a target node to which the first event is aggregated among a first leaf node and an ancestor node of the first leaf node;

[0132] The control unit is further configured to determine a target operation object corresponding to the target node, and perform an operation corresponding to the first event on the target operation object;

[0133] The functional architecture tree is a tree-like hierarchical structure of each function of the target application.

[0134] According to one or more embodiments of the present disclosure, there is provided an electronic device, including: at least one memory and at least one processor;

[0135] The at least one memory is used to store program codes, and the at least one processor is used to call the program codes stored in the at least one memory to execute any one of the above methods.

[0136] According to one or more embodiments of the present disclosure, a computer-readable storage medium is provided, wherein the computer-readable storage medium is used to store program code, and when the program code is executed by a processor, the processor is prompted to execute the above method.

[0137] The above description is only a preferred embodiment of the present disclosure and an explanation of the technical principles used. Those skilled in the art should understand that the scope of disclosure involved in the present disclosure is not limited to the technical solutions formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above disclosed concept. For example, the above features are replaced with the technical features with similar functions disclosed in the present disclosure (but not limited to) by each other to form a technical solution.

[0138] In addition, although each operation is described in a specific order, this should not be understood as requiring these operations to be performed in the specific order shown or in a sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Similarly, although some specific implementation details are included in the above discussion, these should not be interpreted as limiting the scope of the present disclosure. Some features described in the context of a separate embodiment can also be implemented in a single embodiment in combination. On the contrary, the various features described in the context of a single embodiment can also be implemented in multiple embodiments individually or in any suitable sub-combination mode.

[0139] Although the subject matter has been described in language specific to structural features and / or methodological logical actions, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or actions described above. On the contrary, the specific features and actions described above are merely example forms of implementing the claims.

Claims

1. An event processing method, characterized in that: include: In response to a first event being generated in the target application, determining a first leaf node corresponding to the first event in the functional architecture tree; According to a preset aggregation rule and the first event, determining a target node to which the first event is aggregated from a first leaf node and an ancestor node of the first leaf node; Determine a target operation object corresponding to the target node, and perform an operation corresponding to the first event on the target operation object; The functional architecture tree is a tree-like hierarchical structure of each function of the target application.

2. The method according to claim 1, characterized in that Also includes: In response to the second event being aggregated to the target node, an operation corresponding to the second event is performed on the target operation object.

3. The method according to claim 1, characterized in that: The nodes in the functional architecture tree correspond to related objects; Determining the target operation object corresponding to the target node includes: determining the target operation object according to related objects corresponding to each node on the path from the target node to the first leaf node.

4. The method according to claim 3, characterized in that Also includes: In response to the second event being aggregated to the target node, updating the target operation object according to the related objects corresponding to each node on the path from the target node to the second leaf node, or sending an invitation for updating the target operation object to the related objects corresponding to each node on the path from the target node to the second leaf node; The first event corresponds to the second leaf node in the functional architecture tree.

5. The method according to claim 1, characterized in that The non-terminal nodes of the functional architecture tree have corresponding aggregation conditions, and the aggregation rule includes the aggregation conditions; According to the preset aggregation rule and the first event, the target node to which the first event is aggregated is determined in the first leaf node and the ancestor node of the first leaf node, including: activating the first leaf node; in response to the existence of a target ancestor node in the ancestor node of the first leaf node that satisfies the corresponding aggregation conditions for the first event and is in an inactivated state, activating the target ancestor node; in the path from the first leaf node to the root node, the node with the highest level among the consecutive nodes that are activated starting from the first leaf node is used as the target node.

6. The method according to claim 5, characterized in that Determining, according to a preset aggregation rule and the first event, a target node to which the first event is aggregated in a first leaf node and an ancestor node of the first leaf node, includes: The first leaf node is set as the current node and the first leaf node is activated. Execute a detection step, the detection step comprising: in response to the parent node of the current node being in an activated state and the parent node of the current node being a root node, setting the parent node of the current node as the current node and ending the detection step; in response to the parent node of the current node being in an activated state and the parent node of the current node being not a root node, setting the parent node of the current node as the current node and re-executing the detection step; in response to the parent node of the current node being in an inactivated state and the first event satisfying the aggregation condition corresponding to the parent node of the current node, activating the parent node of the current node and setting the parent node of the current node as the current node, and re-executing the detection step; in response to the parent node of the current node being in an inactivated state and the first event not satisfying the aggregation condition corresponding to the parent node of the current node, ending the detection step; The current node is set as the target node.

7. The method according to claim 5, characterized in that After determining the first leaf node corresponding to the first event in the functional architecture tree, the method further includes: In response to the presence of a target ancestor node in an inactive state in an ancestor node of the first leaf node, in which the first event meets a corresponding aggregation condition, mounting the first event to the highest-level node in the target ancestor node; In response to the fact that there is no target ancestor node in the ancestor node of the first leaf node that satisfies the corresponding aggregation condition of the first event and is in an inactive state, the first event is mounted to the first leaf node.

8. The method according to claim 7, characterized in that The method further comprises: In response to the first event being resolved, determining a node to be adjusted from the descendant nodes of the target node according to an event mounting state of a descendant node of the target node; The target node and the node to be adjusted are adjusted to an inactivated state.

9. The method according to claim 8, characterized in that Determining a node to be adjusted from the descendant nodes of the target node according to the event mounting status of the descendant nodes of the target node includes: Traversing each sub-node path of the target node to determine the node to be adjusted; Among them, traversing any of the sub-node paths includes: in response to the existence of an activated node on the sub-node path and an event mounted on at least one of the activated nodes on the sub-node path, ending the traversal of the sub-node path; in response to the existence of an activated node on the sub-node path and no event mounted on the activated nodes on the sub-node path, adding the activated node on the sub-node path to the node to be adjusted.

10. The method according to claim 1, characterized in that The terminal leaf node of the functional architecture tree has one or more corresponding trigger rules, and the first event is an event that satisfies any of the trigger rules; The first leaf node corresponding to the first event in the functional architecture tree is: the terminal leaf node corresponding to the trigger rule satisfied by the first event.

11. The method according to claim 1, characterized in that Determining a target operation object corresponding to the target node, and performing an operation corresponding to the first event on the target operation object, includes: determining a target group corresponding to the target node, and sending relevant information of the first event to the target group.

12. An event processing device, characterized in that: include: A determination unit, configured to determine, in response to a first event being generated in a target application, a first leaf node corresponding to the first event in a functional architecture tree; A control unit, configured to determine, according to a preset aggregation rule and the first event, a target node to which the first event is aggregated among a first leaf node and an ancestor node of the first leaf node; The control unit is further used to: determine a target operation object corresponding to the target node, and perform an operation corresponding to the first event on the target operation object; The functional architecture tree is a tree-like hierarchical structure of each function of the target application.

13. An electronic device, comprising: at least one memory and at least one processor; The at least one memory is used to store program code, and the at least one processor is used to call the program code stored in the at least one memory to execute the method according to any one of claims 1 to 11.

14. A computer-readable storage medium, the computer-readable storage medium being used to store program code, wherein when the program code is executed by a processor, the processor is prompted to execute the method according to any one of claims 1 to 11.

Images