Buried point data processing method and device and computing equipment

Abstract

The invention discloses a buried point data processing method and device and computing equipment. The method comprises the following steps: judging whether a target burying point event is a starting event of any event link or not; if yes, generating an event link identifier of a target event link of which the initial event is the target burying point event, creating a directed graph instance of the target event link in a link pool, and binding the event link identifier with the target burying point event and the directed graph instance; if not, searching a target directed graph instance matched with the target burying point event from the directed graph instances of the link pool, and binding an event link identifier of the target directed graph instance with the target burying point event; and associating the event data of the burying point events with the same event link identifier. According to the scheme, the same event link identifier is bound for different burying point events belonging to the same event link, and the burying point data association analysis based on the same event link identifier improves the determination efficiency and the determination precision of a fault point or a to-be-optimized point, and improves the burying point data processing efficiency and the analysis precision.

Description

Technical Field

[0001] The present application relates to the field of Internet technology, and specifically to a method, device, computing equipment, computer storage medium and computer program product for processing buried point data. Background Art

[0002] With the continuous development of science and technology and society, the emergence of various Internet services has greatly facilitated people's work and life. In order to improve the service experience, some Internet services will collect relevant data through point-of-sale, and perform fault location analysis, service optimization analysis, etc. based on the collected data.

[0003] However, during the implementation process, the inventors discovered that the prior art has the following defects: the tracking data of different tracking events in the prior art are independent of each other, and data analysis can only be performed on a single tracking event one by one. As a result, the tracking data analysis efficiency in the prior art is low, and it is impossible to accurately locate faults and optimize services. Summary of the invention

[0004] In view of the above problems, the present application is proposed to provide a method, apparatus, computing device, computer storage medium and computer program product for processing buried point data that overcome the above problems or at least partially solve the above problems.

[0005] According to the first aspect of the present application, a method for processing buried point data is provided, comprising:

[0006] Any triggered target tracking event is detected;

[0007] Determine whether the target tracking event is the starting event of any event link;

[0008] If so, generate an event link identifier of a target event link whose starting event is the target buried event, create a directed graph instance of the target event link in a link pool, and bind the event link identifier to the target buried event and the directed graph instance;

[0009] If not, search for a target directed graph instance that matches the target buried event from the directed graph instances in the link pool, and bind the event link identifier of the target directed graph instance to the target buried event;

[0010] Associate the event data of the tracking events with the same event link identifier.

[0011] In an optional implementation, the creating the directed graph instance of the target event link in the link pool includes: determining the event link template to which the target event link belongs, acquiring the directed graph of the event link template, creating a directed graph instance of the directed graph in the link pool, and updating the to-be-triggered node of the directed graph instance;

[0012] The method of searching for a target directed graph instance that matches the target buried point event from the directed graph instances of the link pool includes: taking the directed graph instance whose to-be-triggered node in the link pool matches the target buried point event as the target directed graph instance; and updating the to-be-triggered node of the target directed graph instance.

[0013] In an optional implementation, the method further includes: if the preset burying point event and the target burying point event are a cross-thread interactive event pair, and the preset burying point event is triggered before the target burying point event, binding the event link identifier of the preset burying point event to the preset burying point event;

[0014] Then the process of searching for a target directed graph instance that matches the target buried point event from the directed graph instances in the link pool includes: determining whether the target buried point event has been bound to an event link identifier; if not, searching for a target directed graph instance that matches the target buried point event from the directed graph instances in the link pool.

[0015] In an optional implementation, the method further includes: recording thread identifiers corresponding to triggered nodes in the directed graph instance of the link pool;

[0016] The step of searching the directed graph instance in the link pool for a target directed graph instance that matches the target buried point event includes:

[0017] The node to be triggered in the link pool is matched with the target buried point event, and a directed graph instance whose thread identifier of a triggered node on the node to be triggered is consistent with the thread identifier of the target buried point event is used as the target directed graph instance.

[0018] In an optional implementation, the directed graph instance in which the node to be triggered in the link pool is matched with the target buried event and the thread identifier of a triggered node on the node to be triggered is consistent with the thread identifier of the target buried event is used as the target directed graph instance includes:

[0019] If the node to be triggered in the link pool matches the target embedding event, and there are multiple directed graph instances whose thread identifier of a triggered node on the node to be triggered is consistent with the thread identifier of the target embedding event;

[0020] Then, a directed graph instance with the latest update time is selected from the multiple directed graph instances as the target directed graph instance.

[0021] In an optional implementation, the method further includes: determining whether the target embedding event is a termination event; if so, deleting the target directed graph instance from the link pool;

[0022] And / or, if the time difference between the current time and the update time of any directed graph instance in the link pool is greater than a preset threshold, the directed graph instance is deleted from the link pool and corresponding alarm information is generated.

[0023] In an optional implementation, after associating the event data of the buried events with the same event link identifier, the method further includes:

[0024] The event data of the buried events with the same event link identifier are stored in sequence according to the event execution order;

[0025] And / or, performing fault location based on the event data.

[0026] According to a second aspect of the present application, a device for processing buried point data is provided, including:

[0027] The detection module is used to detect any triggered target tracking event;

[0028] A starting judgment module is used to judge whether the target tracking event is the starting event of any event link;

[0029] A generation module is used to generate an event link identifier of a target event link whose starting event is the target buried point event when the starting judgment module is yes, and to create a directed graph instance of the target event link in a link pool, and to bind the event link identifier to the target buried point event and the directed graph instance;

[0030] A matching module is used to start the judgment module and find a target directed graph instance that matches the target buried point event from the directed graph instances in the link pool, and bind the event link identifier of the target directed graph instance to the target buried point event;

[0031] The association module is used to associate the event data of the buried events with the same event link identifier.

[0032] In an optional implementation, the generation module is used to: determine the event link template to which the target event link belongs, obtain a directed graph of the event link template, create a directed graph instance of the directed graph in a link pool, and update the to-be-triggered node of the directed graph instance;

[0033] The matching module is used to: use the directed graph instance that matches the to-be-triggered node in the link pool with the target buried point event as the target directed graph instance; and update the to-be-triggered node of the target directed graph instance.

[0034] In an optional implementation, if the preset burying point event and the target burying point event are a cross-thread interactive event pair, and the preset burying point event is triggered before the target burying point event, the event link identifier of the preset burying point event is bound to the preset burying point event;

[0035] The matching module is used to determine whether the target buried point event has been bound to an event link identifier; if not, search for a target directed graph instance that matches the target buried point event from the directed graph instances in the link pool.

[0036] In an optional implementation, the device further includes: a recording module, configured to record thread identifiers corresponding to triggered nodes in the directed graph instance of the link pool;

[0037] The matching module is used to match the node to be triggered in the link pool with the target embedding event, and the directed graph instance whose thread identifier of a triggered node on the node to be triggered is consistent with the thread identifier of the target embedding event is used as the target directed graph instance.

[0038] In an optional embodiment, the matching module is used to select the directed graph instance with the latest update time from the multiple directed graph instances as the target directed graph instance if the node to be triggered in the link pool matches the target buried event and there are multiple directed graph instances whose thread identifier of a triggered node on the node to be triggered is consistent with the thread identifier of the target buried event.

[0039] In an optional embodiment, the device also includes: an instance deletion module, used to determine whether the target tracking event is a termination event; if so, deleting the target directed graph instance from the link pool; and / or, if the time difference between the current time and the update time of any directed graph instance in the link pool is greater than a preset threshold, deleting the directed graph instance from the link pool and generating corresponding alarm information.

[0040] In an optional implementation, the device further includes: a storage module, configured to sequentially store event data of buried events with the same event link identifier according to the event execution order;

[0041] And / or, a fault locating module, configured to locate the fault based on the event data.

[0042] According to a third aspect of the present application, there is provided a computing device, comprising: a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface communicate with each other via the communication bus;

[0043] The memory is used to store at least one executable instruction, and the executable instruction enables the processor to execute operations corresponding to the above-mentioned buried point data processing method.

[0044] According to a fourth aspect of the present application, a computer storage medium is provided, wherein at least one executable instruction is stored in the storage medium, and the executable instruction enables a processor to perform operations corresponding to the above-mentioned buried point data processing method.

[0045] According to the fifth aspect of the present application, a computer program product is provided, comprising at least one executable instruction, wherein the executable instruction enables a processor to perform operations corresponding to the above-mentioned buried point data processing method.

[0046] The embodiments of the present application can bind the same event link identifier to different buried events belonging to the same event link, so that the buried data of the buried events belonging to the same event link can be associated based on the event link identifier, which is convenient for overall analysis based on the associated data, and can even realize cross-end data analysis of buried data in different execution ends, thereby achieving the technical effect of quickly and accurately locating fault points or points to be optimized, and improving the buried data processing efficiency and analysis accuracy.

[0047] The embodiment of the present application determines the directed graph of the event link template to which the target event link belongs, and creates a directed graph instance of the target event link, which can ensure the determination accuracy of the directed graph instance of the target event link, and timely update the to-be-triggered nodes of the directed graph instance to determine the execution progress of the current link, and is also conducive to accurately determining the target directed graph instance that matches the non-starting event.

[0048] The embodiment of the present application uses the directed graph instance that matches the to-be-triggered node in the link pool with the target buried point event as the target directed graph instance, and can accurately find the target directed graph instance corresponding to the target buried point event.

[0049] The embodiment of the present application is directed to a cross-thread interactive event pair, and binds the event link identifier of the upstream event in the event pair to the downstream event, thereby ensuring the matching accuracy of the event link identifier and the buried event during cross-thread processing.

[0050] The embodiment of the present application combines the thread identifier of the buried event to accurately determine the target directed graph instance that matches the non-starting event, improves the determination accuracy of the target directed graph instance, and further improves the accuracy of the event link identifier bound to the buried event.

[0051] The embodiment of the present application combines the thread identifier and update time to determine the target directed graph instance that matches the non-starting event, which can avoid erroneously associating the target buried event with the interrupted event link, reduce the misassociation rate between the buried event and the directed graph instance, and improve the accuracy of the event link identifier bound to the buried event.

[0052] In an embodiment of the present application, when it is determined that the target buried event is a termination event and / or the time difference between the current time and the update time of any directed graph instance in the link pool is greater than a preset threshold, the corresponding directed graph instance is deleted, thereby being able to delete the directed graph instance of the event link that has been completed and / or interrupted, thereby avoiding interference of the directed graph with other buried event matching processes.

[0053] The embodiment of the present application can associate and store the event data of the buried events with the same event link identifier, so that visualization and full-link fault analysis can be performed based on the stored event data, thereby improving the accuracy and efficiency of fault analysis.

[0054] The above description is only an overview of the technical solution of the present application. In order to more clearly understand the technical means of the present application, it can be implemented in accordance with the contents of the specification. In order to make the above and other purposes, features and advantages of the present application more obvious and easy to understand, the specific implementation methods of the present application are listed below. BRIEF DESCRIPTION OF THE DRAWINGS

[0055] Various other advantages and benefits will become apparent to those of ordinary skill in the art by reading the detailed description of the preferred embodiments below. The accompanying drawings are only for the purpose of illustrating the preferred embodiments and are not to be considered as limiting the present application. Also, the same reference symbols are used throughout the accompanying drawings to represent the same components. In the accompanying drawings:

[0056] Figure 1 A schematic diagram of an operating environment provided for implementing at least one embodiment of the present application is shown;

[0057] Figure 2 A schematic diagram of a process flow of a method for processing buried point data provided in Embodiment 1 of the present application is shown;

[0058] Figure 3 A schematic diagram of an event link template provided in Embodiment 1 of the present application is shown;

[0059] Figure 4 A schematic diagram of an event link provided in Embodiment 1 of the present application is shown;

[0060] Figure 5 A schematic diagram showing an example of a directed graph provided in Embodiment 1 of the present application is shown;

[0061] Figure 6 A schematic diagram of a process flow of a method for processing buried point data provided in the second embodiment of the present application is shown;

[0062] Figure 7 A schematic diagram of a cross-thread interaction event pair provided in Embodiment 2 of the present application is shown;

[0063] Figure 8A schematic diagram of a process flow of a method for processing buried point data provided in Embodiment 3 of the present application is shown;

[0064] Fig. 9 A schematic diagram of the architecture of a tracking point reporting component provided in Embodiment 3 of the present application is shown;

[0065] Fig.10 A schematic diagram of an event data storage process provided by Embodiment 3 of the present application is shown;

[0066] Fig.11 A schematic diagram of the structure of a buried point data processing device provided in Embodiment 4 of the present application is shown;

[0067] Fig.12 A schematic diagram of the structure of a computing device provided in Embodiment 5 of the present application is shown. DETAILED DESCRIPTION

[0068] The exemplary embodiments of the present application will be described in more detail below with reference to the accompanying drawings. Although the exemplary embodiments of the present application are shown in the accompanying drawings, it should be understood that the present application can be implemented in various forms and should not be limited by the embodiments set forth herein. On the contrary, these embodiments are provided in order to enable a more thorough understanding of the present application and to fully convey the scope of the present application to those skilled in the art.

[0069] It should be noted that the user-related data in the tracking data involved in the embodiments of the present application are all information and data that are authorized or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant laws, regulations and standards of relevant countries and regions, and provide corresponding operation entrances for selection of authorization or rejection.

[0070] Figure 1 The present invention is applicable to an application environment including, but not limited to, a client 2 , a server 4 , and a network 6 .

[0071] in:

[0072] The server 4 may be composed of a single or multiple computing devices. The multiple computing devices may include virtualized computing instances. Virtualized computing instances may include virtual machines, such as simulations of computer systems, operating systems, servers, etc. The computing device may load a virtual machine based on a virtual image and / or other data defining specific software (e.g., operating system, dedicated application, server) for simulation. As the demand for different types of processing services changes, different virtual machines may be loaded and / or terminated on one or more computing devices. A hypervisor may be implemented to manage the use of different virtual machines on the same computing device.

[0073] The server 4 may be configured to communicate with the client 2, etc., via a network 6. The network 6 includes various network devices, such as routers, switches, multiplexers, hubs, modems, bridges, repeaters, firewalls, proxy devices, and / or the like. The network 6 may include physical links, such as coaxial cable links, twisted pair cable links, optical fiber links, combinations thereof, etc., or wireless links, such as cellular links, satellite links, Wi-Fi links, etc.

[0074] The server 4 can provide storage, reading, downloading, writing, querying, deleting and other services, such as providing static resource download services to clients through multiple domain names.

[0075] Client 2 can be running Windows, Android TM ) or IOS and other operating systems, such as smart phones, tablet devices, laptop computers, virtual reality devices, gaming devices, set-top boxes, car terminals, smart TVs. Based on the above operating systems, various applications, such as browsers, can be run.

[0076] Embodiment 1

[0077] Figure 2 A flow chart of a method for processing buried point data provided in Example 1 of the present application is shown.

[0078] Among them, the method for processing buried point data provided in the embodiment of the present application can be executed on the client side, can be executed on the server side, or can be executed jointly by the client side and the server side.

[0079] Specifically, Figure 2 As shown, the method comprises the following steps:

[0080] Step S201, detecting any triggered target burying point event.

[0081] The embedding point described in the embodiment of the present application is a data collection point set in the code to obtain the corresponding data. The embedding point event is an event triggered when the embedding point trigger condition is met. The embedding point event is usually a data collection event, so the embedding point event can be understood as the data collection work performed when the embedding point trigger condition is met. The embedding point trigger condition corresponding to the embedding point event can be a preset operation (for example, a user clicks on a certain control, etc.), or it can be that the system is in a preset state (for example, the current system receives a setting request or a setting response, etc.).

[0082] Any triggered embedding event is taken as the target embedding event, and a matching event link identifier is bound to each triggered embedding event (ie, the target embedding event) through subsequent operations.

[0083] Step S202, determine whether the target tracking event is the starting event of any event link; if so, execute step S203; if not, execute step S204.

[0084] The event link described in the embodiment of the present application refers to a series of buried events that occur in a corresponding order on the client and / or server in order to achieve the corresponding goal (that is, to realize a certain business). In other words, an event link can achieve one or several goals, and an event link contains multiple buried events that occur in sequence. The buried events contained in the same event link can come from the same device end or from different device ends. Each event link contains a corresponding starting node, and the event corresponding to the starting node is the starting event.

[0085] This step detects whether the target buried event is the starting event of any event link. In the actual implementation process, the buried event will not be a starting event and a non-starting event at the same time. Therefore, the event information such as the event name of the starting event of each event link template of the system can be pre-extracted, and the event information of the starting event can be stored in the corresponding starting event set. When executing this step, the event information such as the event name of the target buried event can be compared with the event information in the set. If the event information of the target buried event matches the event information of a starting event in the starting event set, the target buried event is determined to be the starting event of a certain event link, and step S203 is executed; if the event information of the target buried event does not match the event information of each starting event in the starting event set, it is determined that the target buried event is not a starting event, and step S204 is executed.

[0086] This step detects whether the target buried event is a starting event, which can facilitate the subsequent use of different processing methods for starting events and non-starting events to bind event link identifiers.

[0087] Step S203, generate an event link identifier of a target event link whose starting event is the target buried point event, create a directed graph instance of the target event link in a link pool, and bind the event link identifier to the target buried point event and the directed graph instance.

[0088] If the target buried event is the starting event, it indicates that a new event link is triggered. The new event link is the target event link, and the starting event of the target event link is the target buried event. Therefore, this step generates a new event link identifier to mark the target event link. The event link identifier is a unique identifier of the event link, and the corresponding event link can be uniquely determined by the event link identifier. The embodiment of the present application does not limit the specific event link identifier generation method, and any generation method that can ensure the uniqueness of the event link identifier can be applied to the embodiment of the present application.

[0089] It should be understood here that the buried point events in the embodiments of the present application are also unique, that is, there is only one event that executes the corresponding content at the corresponding time and by the corresponding subject. For example, the event "user end U1 requests user end U2 to connect to the microphone" generated at time T1 is event1, and the event "user end U1 requests user end U2 to connect to the microphone" generated at time T2 is event2. Although these two events have the same event name and the same execution subject, they are still two events due to the different occurrence times. In this application, if the starting events of the event links are different, the event links are different, and the event link identifiers corresponding to the event links are also different. For example, event link link1 is "event1-event3", and event link2 is "event2-event4". Event1 and event3 are "user end U1 requests user end U2 to connect to the microphone" events executed at different times, and event2 and event4 are "user end U1 requests server interface check" events executed at different times. Event link link1 and event link link2 are different event links, and their corresponding event link identifiers are also different.

[0090] Furthermore, in order to facilitate the subsequent triggered non-starting events to accurately and quickly find the event link to which they belong and the event link identifier that needs to be bound, in addition to generating an event link identifier for the newly generated target event link, this step also creates a directed graph instance with the target event link, and sets the created directed graph instance in the link pool. Among them, each event link corresponds to a directed graph instance, which includes multiple nodes and directed edges between nodes. Each node in the directed graph instance represents a buried event, and the directed edges between nodes represent the execution order of the buried events. Moreover, the nodes in the directed graph instance of the target event link include both the buried events that have been currently executed by the target event link and the buried events that should be executed by the target event link later.

[0091] And the target event link binds the event link identifier to the target embedded point event and the directed graph instance.

[0092] In an optional implementation, in order to improve the accurate binding of the buried event and the event link identifier, the directed graph instance of the target event link is created in the following manner:

[0093] (1) Determine the event link template to which the target event link belongs. The event link template to which the target event link belongs is the event execution process that should be adopted in order to achieve the same goal as the target event link. The event link template constrains which execution process should be adopted when a certain goal is achieved. The event link template is a sequence of event nodes arranged in order of execution. Each event node in the event link template corresponds to an event abstraction rather than an actually generated event. The event node constrains which event should be executed at the node, while the events in the target event link are actually generated events. Taking the microphone connection scenario as an example, Figure 3 is an event link template. Figure 3 Each node in the diagram represents an event node. Each event node constrains which event should be executed at the node. The event node can be understood as an abstraction of a certain event. The arrows point to the order of execution. Figure 3 It can be seen that the event link template is composed of event nodes in the three device ends of the first user end, the second user end, and the server end, and describes the execution process that should be adopted to achieve the purpose of connecting the first user end and the second user end. Figure 4 is an event link belonging to the event link template, Figure 4 and Figure 3 Both are for the purpose of connecting the first user end and the second user end. Figure 4 Event1 and Event2 are both actually generated tracking events. Event1 is Figure 3 Event1 is a specific execution event of the event node "the first user terminal triggers the connection with the second user terminal". Event1 can be understood as an instance of the event node "the first user terminal triggers the connection with the second user terminal". Event1 inherits the characteristics of the event node "the first user terminal triggers the connection with the second user terminal". For example, Event1 event node "the first user terminal triggers the connection with the second user terminal" all indicates the event of triggering the connection with the second user terminal.

[0094] (2) Obtain a directed graph of the event link template. Each event link template corresponds to a directed graph. Each node of the directed graph represents an event node in the event link template. The directed edges of the directed graph represent the execution order between nodes. For example, Figure 3 It is a directed graph representation of an event link template.

[0095] (3) Create a directed graph instance of the directed graph in the link pool. A directed graph is an abstraction of a directed graph instance, that is, a directed graph can be understood as an object, and a directed graph instance can be understood as an instance of the object. A directed graph instance inherits all the properties of the directed graph, so the directed graph instance also contains each event node and the execution order between event nodes. The priority graph instance corresponds one-to-one to the event link actually generated. For example, Figure 5 is right Figure 3An instantiated representation of the directed graph shown.

[0096] (4) After creating the directed graph instance, update the to-be-triggered nodes of the directed graph instance in a timely manner. Since the current target embedding event has been triggered, the node corresponding to the target embedding event in the directed graph instance is the triggered node, and the next node of the node corresponding to the target embedding event in the directed graph instance is the to-be-triggered node. Figure 5 For example, the target tracking event is Event1 event, and the node corresponding to Event1 event in the directed graph instance is the starting node "U1 end triggers the connection with U2 end", and the node to be triggered is the next node "Request server to check interface" node or "Local check failed" node of the starting node "U1 end triggers the connection with U2 end".

[0097] Step S204, searching for a target directed graph instance that matches the target buried event from the directed graph instances in the link pool, and binding the event link identifier of the target directed graph instance to the target buried event.

[0098] If the target buried event is not the starting event of an event link, it means that what is triggered at this time is not a new event link, but an event link that already existed before. Therefore, the target directed graph instance that matches the target buried event can be found from the directed graph instance of the link pool. That is, the directed graph instance that matches the target buried event in the link pool is the target directed graph instance. Specifically, if the target buried event matches a node in a directed graph instance in the link pool, the directed graph instance is used as the target directed graph instance.

[0099] In an optional implementation, in order to accurately determine the target directed graph instance, the target directed graph instance can be determined specifically in the following manner: the directed graph instance whose to-be-triggered node in the link pool matches the target buried point event is used as the target directed graph instance; and the to-be-triggered node of the directed graph instance is updated. Specifically, if the event name of the to-be-triggered node of a certain directed graph instance in the link pool is consistent with the event name of the target buried point event, it means that the to-be-triggered node matches the target buried point event, so that the directed graph instance is used as the target directed graph instance. And, since the target buried point event has been triggered, the to-be-triggered node of the target directed graph instance is updated, specifically, the next node of the node corresponding to the target buried point event in the target directed graph instance is used as the to-be-triggered node. Figure 5 For example, if the target tracking event Event2 corresponds to the "request server check interface", then the "server check logic" is the updated node to be triggered.

[0100] Since the target directed graph instance has a bound event link identifier, and the target buried point event matches the target directed graph instance, it indicates that the target buried point event belongs to its corresponding event link, so the event link identifier bound to the target directed graph instance is also bound to the target buried point event. Therefore, this step can bind the corresponding event link identifier for the non-starting event.

[0101] Step S205, associating event data of buried events with the same event link identifier.

[0102] The relevant data collected by the buried event is the event data of the buried event. Since the buried event is bound to the corresponding event link identifier, the event data of different buried events belonging to the same event link can be connected in series according to the event link identifier. Specifically, the event data of the buried events with the same event link identifier are associated to facilitate the analysis of the buried data. In addition, the event link in the embodiment of the present application may include at least one execution end, such as Figure 5 As shown, the directed graph instance can span the user end U1, the user end U2 and the server end, so that the data associated with the event link identifier corresponding to the directed graph instance involves multiple execution ends, thereby realizing cross-end analysis and processing of the buried data.

[0103] It can be seen that the method for processing buried point data provided in the embodiment of the present application can bind the same event link identifier to different buried point events belonging to the same event link, so that the buried point data of the buried point events belonging to the same event link can be associated based on the event link identifier, which is convenient for overall analysis based on the associated data, and can even realize cross-end data analysis of buried point data in different execution ends, which can quickly and accurately locate fault points or points to be optimized, thereby improving the efficiency of buried point data processing and analysis accuracy.

[0104] Embodiment 2

[0105] Figure 6 A flow chart of a method for processing buried point data provided in the second embodiment of the present application is shown.

[0106] Among them, the method for processing buried point data provided in the embodiment of the present application can be executed on the client side, can be executed on the server side, or can be executed jointly by the client side and the server side.

[0107] In the actual implementation process, when determining the target directed graph instance, there will be multiple directed graph instances in the link pool with the same nodes to be triggered. For example, if the user terminal U1 initiates two microphone connection operations with the user terminal U2 in a short period of time, there will be two directed graph instances of event links in the link pool, and the two directed graph instances are the same. At this time, if the nodes to be triggered of the two directed graph instances are both "request the server to check the interface", when the target buried event Event3 of "request the server to check the interface" is triggered at time T, there will be two directed graph instances in the link pool whose nodes to be triggered match the target buried event.

[0108] In view of this situation, the present embodiment is proposed to accurately determine the target directed graph instance that matches the target buried point event.

[0109] Specifically, Figure 6 As shown, the method comprises the following steps:

[0110] Step S601, determine whether the detected target embedding event is the starting event of any event link; if so, execute step S602; if not, execute step S603.

[0111] Step S602, generate an event link identifier of the target event link whose starting event is the target buried point event, and create a directed graph instance of the target event link in the link pool, bind the event link identifier to the target buried point event and the directed graph instance, and update the node to be triggered of the directed graph instance.

[0112] Step S603, determine whether the target tracking event has been bound to an event link identifier; if not, execute step S604.

[0113] In the actual execution process of the tracking events, the tracking events belonging to the same execution end in the same event link are usually executed by the same thread. However, in the actual execution process, the same event link usually has the situation of same-end cross-thread or cross-end cross-thread. The cross-thread means that the processing threads of two adjacent tracking events in the event link are different. Among them, two adjacent tracking events in the event link with different processing threads are called cross-thread interaction event pairs. Usually, request event-response event is a cross-thread interaction event pair, and broadcast event-receive broadcast event is a cross-thread interaction event pair. Figure 7 The request interface event corresponding to the B node and the interface return event corresponding to the E node shown are a cross-thread interaction event pair.

[0114] For this situation, this embodiment reports the event link identifier after the upstream buried event in the cross-thread interactive event pair is bound to the corresponding event link identifier, carries the event link identifier when the upstream buried event and its corresponding downstream buried event interact across threads, and binds the event link identifier to the downstream buried event. For example, if the preset buried event and the target buried event are a cross-thread interactive event pair, and the preset buried event is triggered before the target buried event, the event link identifier of the preset buried event is bound to the preset buried event. More specifically, the cross-thread interactive event pair is a request event-response event. After the upstream event (i.e., the request event) in the cross-thread interactive event pair is bound to the event link identifier, the event link identifier is added to the request. The downstream event (i.e., the response event) can obtain the event link identifier of the upstream event by parsing the request, thereby binding the event link identifier to the downstream event. Figure 7 As shown, the event link identifier trace_id of the upstream event (interface request event corresponding to node B) in the cross-thread interaction event pair is set in the request header, so as to be passed to the downstream event (interface return event corresponding to node E), and the trace_id is bound to the downstream event.

[0115] Therefore, after determining that the target buried point event is not the starting event, it is further determined whether the target buried point event has been bound to an event link identifier; if so, there is no need to perform the subsequent binding process; if not, the target directed graph instance that matches the target buried point event is searched from the directed graph instances in the link pool, and step S604 is specifically executed.

[0116] Step S604, filter the directed graph instances in the link pool whose to-be-triggered nodes match the target buried event and whose thread identifier of a triggered node on the to-be-triggered node is consistent with the thread identifier of the target buried event.

[0117] The embodiment of the present application also records the thread identifier corresponding to the triggered node in the directed graph instance of the link pool. A triggered node means that the buried event corresponding to the event node in the directed graph instance has been triggered, and the thread identifier corresponding to the triggered node is the identifier of the thread that processes the buried event corresponding to the node.

[0118] After determining that the target buried event is neither a starting event nor a bound event link identifier, the to-be-triggered node is screened from the link pool to match the target buried event, and the directed graph instance whose thread identifier of the previous triggered node of the to-be-triggered node is consistent with the thread identifier of the target buried event. That is, the to-be-triggered node of the screened directed graph instance matches the target buried event, and the thread identifier of the previous triggered node of the to-be-triggered node of the screened directed graph instance is the same as the thread identifier of the target buried event, ensuring that the target buried event and the buried event last triggered in the screened directed graph instance correspond to the same thread. Thus, the to-be-triggered node in the link pool is matched with the target buried event, and the directed graph instance whose thread identifier of the previous triggered node of the to-be-triggered node is consistent with the thread identifier of the target buried event can be used as the target directed graph instance.

[0119] Step S605, determining whether there are multiple directed graph instances screened out; if so, executing step S606; if not, executing step S607.

[0120] In some cases, there may be multiple directed graph instances in the link pool where the to-be-triggered node matches the target buried event, and the thread identifier of the previous triggered node on the to-be-triggered node is consistent with the thread identifier of the target buried event. For example, a user initiates two microphone connection requests within a very short period of time, and the buried events involved in the two microphone connection requests are processed by thread W1 on the user side, then there will be directed graph instance 1 and directed graph instance 2 in the link pool. If W1 is abnormally interrupted after only executing the starting buried event during the first microphone connection request processing, then the to-be-triggered node of directed graph instance 1 is the node after the starting node, and the thread identifier of the previous triggered node on the to-be-triggered node is W1; when thread W1 detects that the buried event (target buried event) after the starting buried event is triggered during the second microphone connection request processing, the to-be-triggered nodes of directed graph instance 1 and directed graph instance 2 in the link pool match the target buried event, and the threads of the previous triggered nodes of directed graph instance 1 and directed graph instance 2 are the same, both W1. This situation is handled through the subsequent step S607.

[0121] Step S606: Select the directed graph instance with the latest update time from the multiple filtered directed graph instances as the target directed graph instance, and bind the event link identifier of the target directed graph instance to the target buried event.

[0122] The embodiment of the present application records the update time each time after updating the to-be-triggered node of the directed graph instance. When the screened to-be-triggered node matches the target buried event, and there are multiple directed graph instances whose thread identifier of the previous triggered node on the to-be-triggered node is consistent with the thread identifier of the target buried event, the directed graph instance with the latest update time is determined from the multiple directed graph instances as the target directed graph instance.

[0123] Step S607: Use the filtered directed graph instance as the target directed graph instance, and bind the event link identifier of the target directed graph instance to the target buried event.

[0124] When the filtered node to be triggered matches the target buried event, and there is one directed graph instance whose thread identifier of a triggered node on the node to be triggered is consistent with the thread identifier of the target buried event, the filtered directed graph instance is used as the target directed graph instance.

[0125] Step S608, determine whether the target tracking event is a termination event; if so, execute step S609; if not, execute step S610.

[0126] If the target buried point event is a termination node in the corresponding node of the target directed graph instance, the target buried point event is determined to be a termination event, and step S609 is executed; if it is not a termination event, step S610 is executed.

[0127] Step S609: Delete the target directed graph instance from the link pool.

[0128] If the target tracking event is a termination event, indicating that the event link corresponding to the target directed graph instance has been executed, the target directed graph instance is deleted from the link pool to reduce interference.

[0129] In an optional implementation, if the time difference between the current time and the update time of any directed graph instance in the link pool is greater than a preset threshold, the directed graph instance is deleted from the link pool and a corresponding alarm message is generated. Among them, if the time difference between the current time and the update time of any directed graph instance in the link pool is greater than the preset threshold, it indicates that there is an abnormal interruption in the event link corresponding to the directed graph instance, so the directed graph instance is deleted from the link pool to reduce interference, and a responsive alarm message can be generated. The alarm message carries event information of the buried events corresponding to each triggered node of the directed graph instance and data such as the event link identifier.

[0130] In an optional implementation, if a target directed graph instance matching the target buried point event cannot be found, a corresponding alarm message is generated to determine whether the constructed directed graph is accurate.

[0131] Step S610: Update the to-be-triggered nodes of the target directed graph instance.

[0132] If the target tracking event is not a termination event, indicating that the event link corresponding to the target directed graph instance has not been executed, the to-be-triggered node of the target directed graph instance is updated.

[0133] It can be seen that the buried point data processing method provided in the embodiment of the present application can combine the thread identifier of the buried point event to accurately determine the target directed graph instance that matches the non-starting event, improve the determination accuracy of the target directed graph instance, and further improve the accuracy of the event link identifier bound to the buried point event; the embodiment of the present application is aimed at cross-thread interactive event pairs, and the event link identifier of the upstream event in the event pair is bound to the downstream event, thereby ensuring the matching accuracy of the event link identifier and the buried point event during cross-thread processing.

[0134] Embodiment 3

[0135] Figure 8 FIG. 1 is a flow chart of a method for processing buried point data provided in Embodiment 3 of the present application. Specifically, Figure 8 As shown, the method comprises the following steps:

[0136] Step S801, the burial point reporting component in the execution end collects the event data of the burial point event and binds the corresponding event link identifier to the burial point event, and aggregates and reports the event data of the burial point event and the bound event link identifier.

[0137] In the embodiment of the present application, the collection of event data of the buried event and the binding of the event link identifier to the buried event can be performed by the buried reporting component in the execution end. Among them, the binding process of the event link identifier and the buried event can be specifically referred to the description in other embodiments, which will not be repeated here. The execution end can be a client or a server.

[0138] The tracking point reporting component aggregates and reports the event data of the tracking point event and the bound event link identifier, so that the reported data of a tracking point event contains both the event data and the event link identifier.

[0139] In an optional embodiment, the event data includes but is not limited to one or more of the following data: event identifier, event log, event name, node type, event type, log level, custom parameters, etc. Among them, the event identifier is a unique identifier assigned to the buried event; the event log is the log record corresponding to the buried event; the event name is the name of the buried event; the node type specifically identifies the position of the buried event in the corresponding event link, and the node type includes start, process and end; the event type is the business type described by the buried event; the log level can also be called the exception level, which includes normal, warning, and abnormal, and is marked in different ways according to the level, such as marking abnormal logs and warning logs in red or yellow, etc. Custom parameters represent customized extended data, which can be added according to actual business conditions. For example, custom parameters can be device performance parameters, etc.

[0140] In an optional implementation, in order to facilitate accurate troubleshooting and other data analysis work based on the reported tracking data, the tracking reporting component usually needs to report more data content. If the traditional component architecture is used, the tracking code is lengthy. In order to streamline the tracking code and reduce the excessive intrusion of the tracking code into the business code, the tracking reporting component of this embodiment can be used. Fig. 9 In the architecture shown, the link automation layer describes each directed graph instance in the link pool and determines the event link identifier of the buried event; the parameter splicing layer performs the splicing of common parameters, and the buried aggregation layer aggregates the data acquisition codes of various parameters and various business events into a code that can be directly called by the business, so that the business layer can realize data reporting through simple code calls. Among them, the corresponding event model class can be encapsulated in the buried aggregation layer, and each event model type can automatically add the corresponding common parameters, such as automatically adding event type fields through the event type model, etc.

[0141] Step S802, the event data of the buried events with the same event link identifier are stored in sequence according to the event execution order.

[0142] First, the event data of the buried events with the same event link identifier are associated. In the specific implementation process, if an event link uses a single event link identifier at different execution ends, the event data of the buried events of the entire event link can be connected in series using only the single event link identifier; in the actual implementation process, there will be a situation where an event link uses different link identifiers at different execution ends. In this case, a link identifier mapping table can be established, and the link identifiers corresponding to the original event link identifiers at different execution ends are recorded in the link identifier mapping table. When the event data is associated, the link identifiers customized by the execution end are uniformly converted into the original event link identifier according to the mapping table. Then, the event data is associated using the original event link identifier. When establishing the link identifier mapping table, the event link identifier of the initially generated event link is first recorded. Since the cross-thread interactive event pair will carry the event link identifier, when the event of the event link crosses to the other end, the custom link identifier of the event link at the other end can be determined, and a mapping relationship between the custom link identifier and the initially generated event link identifier is established.

[0143] The event data of the buried events with the same event link identifier may further be stored in the corresponding data table in sequence according to the event execution order.

[0144] by Fig.10Taking the storage process shown as an example, the event data and event link identifier reported by the tracking point reporting component are stored in data storage components such as Kafka, and the event data is periodically obtained from the storage component using the stream computing task processing method; the event data is cleaned and then processed by a multiple mapping algorithm to determine the original event link identifier corresponding to the custom link identifier of each execution end according to the mapping table. Then, the original event link identifier is used to connect the event data of the tracking point event in the same event link, and the event data is stored in the corresponding event table for query by the data analysis platform or query platform.

[0145] Step S803: Visually display the event data.

[0146] An interactive interface is provided for analysts, and users can use the interactive interface to enter corresponding filtering conditions to filter the event links or embedded events to be viewed. According to the user's input conditions, the corresponding data is obtained for visual display. When a user views an event or an event link, the event data can be visualized in the form of a directed graph. For example, a directed graph node displays the event ID or name of the corresponding embedded event, and when a directed graph node is clicked, the event data of the corresponding embedded event is displayed in detail.

[0147] Step S804: locating the fault based on the event data.

[0148] Specifically, the event data of each buried event bound to any event link identifier is obtained, and the node type in each event data is obtained. If the node type does not contain a start type and an end type, it is determined that the link integrity of the event link is abnormal. And / or, if the log level of the event data of a buried event contains an abnormality or warning, it is determined that the buried event is abnormal. In short, full-link analysis can be performed based on the event data to accurately locate the fault.

[0149] It can be seen that the method for processing buried point data provided in the embodiment of the present application can associate and store the event data of buried point events with the same event link identifier, so that visualization and full-link fault analysis can be performed based on the stored event data, thereby improving the accuracy and efficiency of fault analysis.

[0150] Embodiment 4

[0151] Fig.11 The structure diagram of a buried point data processing device provided in the fourth embodiment of the present application is shown. Fig.11 As shown, the device 1100 includes: a detection module 1110 , a start judgment module 1120 , a generation module 1130 , a matching module 1140 , and an association module 1150 .

[0152] Detection module 1110, used to detect any triggered target burying event;

[0153] A start judgment module 1120 is used to judge whether the target tracking event is a start event of any event link;

[0154] A generation module 1130 is used to generate an event link identifier of a target event link whose starting event is the target buried point event when the starting judgment module is yes, and to create a directed graph instance of the target event link in a link pool, and to bind the event link identifier to the target buried point event and the directed graph instance;

[0155] Matching module 1140, used for starting the judgment module to determine whether the result is no, searching for a target directed graph instance that matches the target buried event from the directed graph instances in the link pool, and binding the event link identifier of the target directed graph instance to the target buried event;

[0156] The association module 1150 is used to associate the event data of the buried events with the same event link identifier.

[0157] In an optional implementation, the generation module 1130 is used to: determine the event link template to which the target event link belongs, obtain the directed graph of the event link template, create a directed graph instance of the directed graph in the link pool, and update the to-be-triggered node of the directed graph instance;

[0158] The matching module 1140 is used to: use the directed graph instance that matches the to-be-triggered node in the link pool with the target buried event as the target directed graph instance; and update the to-be-triggered node of the target directed graph instance.

[0159] In an optional implementation, if the preset burying point event and the target burying point event are a cross-thread interactive event pair, and the preset burying point event is triggered before the target burying point event, the event link identifier of the preset burying point event is bound to the preset burying point event;

[0160] The matching module 1140 is used to determine whether the target burial point event has been bound to an event link identifier; if not, search for a target directed graph instance that matches the target burial point event from the directed graph instances in the link pool.

[0161] In an optional implementation, the device further includes: a recording module (not shown in the figure), configured to record thread identifiers corresponding to triggered nodes in the directed graph instance of the link pool;

[0162] The matching module 1140 is used to match the node to be triggered in the link pool with the target embedding event, and use the directed graph instance whose thread identifier of a triggered node on the node to be triggered is consistent with the thread identifier of the target embedding event as the target directed graph instance.

[0163] In an optional embodiment, the matching module 1140 is used to select the directed graph instance with the latest update time from the multiple directed graph instances as the target directed graph instance if the node to be triggered in the link pool matches the target buried event and there are multiple directed graph instances whose thread identifier of a triggered node on the node to be triggered is consistent with the thread identifier of the target buried event.

[0164] In an optional embodiment, the device also includes: an instance deletion module (not shown in the figure), which is used to determine whether the target embedding event is a termination event; if so, deleting the target directed graph instance from the link pool; and / or, if the time difference between the current time and the update time of any directed graph instance in the link pool is greater than a preset threshold, deleting the directed graph instance from the link pool and generating corresponding alarm information.

[0165] In an optional implementation, the device further includes: a storage module (not shown in the figure), which is used to store the event data of the buried events with the same event link identifier in sequence according to the event execution order;

[0166] And / or, a fault locating module (not shown in the figure), configured to locate the fault based on the event data.

[0167] It can be seen that the buried point data processing device provided in the embodiment of the present application can bind the same event link identifier to different buried point events belonging to the same event link, so that the buried point data of the buried point events belonging to the same event link can be associated based on the event link identifier, which is convenient for overall analysis based on the associated data, and can even realize cross-end data analysis of buried point data in different execution ends, which can quickly and accurately locate fault points or points to be optimized, thereby improving the buried point data processing efficiency and analysis accuracy.

[0168] Embodiment 5

[0169] Fig.12 A schematic diagram of the structure of a computing device provided in Embodiment 5 of the present application is shown. The specific embodiments of the present application do not limit the specific implementation of the computing device.

[0170] like Fig.12 As shown, the computing device may include: a processor (processor) 1202 , a communication interface (Communications Interface) 1204 , a memory (memory) 1206 , and a communication bus 1208 .

[0171] The processor 1202, the communication interface 1204, and the memory 1206 communicate with each other via the communication bus 1208. The communication interface 1204 is used to communicate with other devices such as a client or other server network elements. The processor 1202 is used to execute the program 1210, which can specifically execute the relevant steps in the above embodiment of the method for processing buried data of a computing device.

[0172] Specifically, the program 1210 may include program codes, which include computer operation instructions.

[0173] The processor 1202 may be a central processing unit (CPU), or an application-specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of the present application. The one or more processors included in the computing device may be processors of the same type, such as one or more CPUs; or may be processors of different types, such as one or more CPUs and one or more ASICs.

[0174] The memory 1206 is used to store the program 1210. The memory 1206 may include a high-speed RAM memory, and may also include a non-volatile memory (non-volatile memory), such as at least one disk memory. The program 1210 may be specifically used to enable the processor 1202 to perform the operations in the above method embodiment.

[0175] Embodiment 6

[0176] Embodiment 6 of the present application provides a non-volatile computer storage medium, wherein the computer storage medium stores at least one executable instruction or computer program, and the executable instruction or computer program enables a processor to execute operations corresponding to the point-of-care data processing method in any of the above-mentioned method embodiments.

[0177] Embodiment 7

[0178] Embodiment 7 of the present application provides a computer program product, which includes at least one executable instruction or computer program, and the executable instruction or computer program can enable a processor to execute operations corresponding to the point data processing method in any of the above-mentioned method embodiments.

[0179] To summarize, according to the computing device, computer storage medium and computer program product provided in this embodiment, the same event link identifier can be bound to different buried events belonging to the same event link, so that the buried data of the buried events belonging to the same event link can be associated based on the event link identifier, which is convenient for overall analysis based on the associated data, and even cross-end data analysis of buried data in different execution ends can be realized, which can quickly and accurately locate fault points or points to be optimized, thereby improving the buried data processing efficiency and analysis accuracy.

[0180] The algorithm or display provided here are not inherently related to any specific computer, virtual system or other equipment. Various general systems can also be used together with the teaching based on this. According to the above description, it is obvious to construct the structure required for this type of system. In addition, the present application embodiment is not directed to any specific programming language yet. It should be understood that various programming languages ​​can be utilized to realize the content of the present application described here, and the above description of specific languages ​​is to disclose the best mode of implementation of the present application.

[0181] In the description provided herein, a large number of specific details are described. However, it is understood that the embodiments of the present application can be practiced without these specific details. In some instances, well-known methods, structures and techniques are not shown in detail so as not to obscure the understanding of this description.

[0182] Similarly, it should be understood that in order to streamline the present application and help understand one or more of the various inventive aspects, in the above description of the exemplary embodiments of the present application, the various features of the embodiments of the present application are sometimes grouped together into a single embodiment, figure, or description thereof. However, the disclosed method should not be interpreted as reflecting the following intention: the claimed application requires more features than the features clearly stated in each claim. More specifically, as reflected in the claims below, the inventive aspects are less than all the features of the single embodiment disclosed above. Therefore, the claims following the specific embodiment are hereby expressly incorporated into the specific embodiment, wherein each claim itself serves as a separate embodiment of the present application.

[0183] Those skilled in the art will appreciate that the modules in the devices in the embodiments may be adaptively changed and arranged in one or more devices different from the embodiments. The modules or units or components in the embodiments may be combined into one module or unit or component, and in addition they may be divided into a plurality of submodules or subunits or subcomponents. Except that at least some of such features and / or processes or units are mutually exclusive, all features disclosed in this specification (including the accompanying claims, abstracts and drawings) and all processes or units of any method or device disclosed in this manner may be combined in any combination. Unless otherwise expressly stated, each feature disclosed in this specification (including the accompanying claims, abstracts and drawings) may be replaced by an alternative feature providing the same, equivalent or similar purpose.

[0184] In addition, those skilled in the art will appreciate that, although some embodiments herein include certain features included in other embodiments but not other features, the combination of features of different embodiments is meant to be within the scope of the present application and form different embodiments. For example, in the claims below, any one of the claimed embodiments may be used in any combination.

[0185] The various component embodiments of the present application can be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. It should be understood by those skilled in the art that a microprocessor or digital signal processor (DSP) can be used in practice to implement some or all functions of some or all components according to the embodiments of the present application. The application can also be implemented as a device or apparatus program (e.g., computer program and computer program product) for executing a part or all of the methods described herein. Such a program implementing the present application can be stored on a computer-readable medium, or can have the form of one or more signals. Such a signal can be downloaded from an Internet website, or provided on a carrier signal, or provided in any other form.

[0186] It should be noted that the above embodiments illustrate the present application rather than limit the present application, and that those skilled in the art may design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference symbol between brackets shall not be constructed as a limitation on the claims. The word "comprising" does not exclude the presence of elements or steps not listed in the claims. The word "one" or "an" preceding an element does not exclude the presence of multiple such elements. The present application may be implemented by means of hardware including several different elements and by means of a suitably programmed computer. In a unit claim that lists several devices, several of these devices may be embodied by the same hardware item. The use of the words first, second, and third, etc. does not indicate any order. These words may be interpreted as names. The steps in the above embodiments, unless otherwise specified, should not be understood as limitations on the order of execution.

Claims

1. A method for processing buried point data, characterized in that: include: Any triggered target tracking event is detected; Determine whether the target tracking event is the starting event of any event link; If so, generate an event link identifier of a target event link whose starting event is the target buried event, create a directed graph instance of the target event link in a link pool, and bind the event link identifier to the target buried event and the directed graph instance; If not, search for a target directed graph instance that matches the target buried event from the directed graph instances in the link pool, and bind the event link identifier of the target directed graph instance to the target buried event; Associate the event data of the tracking events with the same event link identifier.

2. The method according to claim 1, characterized in that The step of creating the directed graph instance of the target event link in the link pool includes: determining the event link template to which the target event link belongs, acquiring the directed graph of the event link template, creating the directed graph instance of the directed graph in the link pool, and updating the to-be-triggered node of the directed graph instance; The method of searching for a target directed graph instance that matches the target buried point event from the directed graph instances of the link pool includes: taking the directed graph instance whose to-be-triggered node in the link pool matches the target buried point event as the target directed graph instance; and updating the to-be-triggered node of the target directed graph instance.

3. The method according to claim 2, characterized in that The method further includes: if the preset burying point event and the target burying point event are a cross-thread interactive event pair, and the preset burying point event is triggered before the target burying point event, binding the event link identifier of the preset burying point event to the preset burying point event; Then the process of searching for a target directed graph instance that matches the target buried point event from the directed graph instances in the link pool includes: determining whether the target buried point event has been bound to an event link identifier; if not, searching for a target directed graph instance that matches the target buried point event from the directed graph instances in the link pool.

4. The method according to claim 3, characterized in that The method further comprises: recording thread identifiers corresponding to triggered nodes in the directed graph instance of the link pool; The step of searching the directed graph instance in the link pool for a target directed graph instance that matches the target buried point event includes: The node to be triggered in the link pool is matched with the target buried point event, and a directed graph instance whose thread identifier of a triggered node on the node to be triggered is consistent with the thread identifier of the target buried point event is used as the target directed graph instance.

5. The method according to claim 4, characterized in that The method of matching the node to be triggered in the link pool with the target buried event, and using a directed graph instance whose thread identifier of a triggered node on the node to be triggered is consistent with the thread identifier of the target buried event as a target directed graph instance includes: If the node to be triggered in the link pool matches the target embedding event, and there are multiple directed graph instances whose thread identifier of a triggered node on the node to be triggered is consistent with the thread identifier of the target embedding event; Then, a directed graph instance with the latest update time is selected from the multiple directed graph instances as the target directed graph instance.

6. The method according to any one of claims 2 to 5, characterized in that: The method further includes: determining whether the target embedding event is a termination event; if so, deleting the target directed graph instance from the link pool; And / or, if the time difference between the current time and the update time of any directed graph instance in the link pool is greater than a preset threshold, the directed graph instance is deleted from the link pool and corresponding alarm information is generated.

7. The method according to any one of claims 1 to 6, characterized in that After associating the event data of the buried events with the same event link identifier, the method further includes: The event data of the buried events with the same event link identifier are stored in sequence according to the event execution order; And / or, performing fault location based on the event data.

8. A buried point data processing device, characterized in that: include: The detection module is used to detect any triggered target tracking event; A starting judgment module is used to judge whether the target tracking event is the starting event of any event link; A generation module is used to generate an event link identifier of a target event link whose starting event is the target buried point event when the starting judgment module is yes, and to create a directed graph instance of the target event link in a link pool, and to bind the event link identifier to the target buried point event and the directed graph instance; A matching module is used to start the judgment module and find a target directed graph instance that matches the target buried point event from the directed graph instances in the link pool, and bind the event link identifier of the target directed graph instance to the target buried point event; The association module is used to associate the event data of the buried events with the same event link identifier.

9. A computing device, characterized in that include: A processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface communicate with each other via the communication bus; The memory is used to store at least one executable instruction, and the executable instruction enables the processor to perform operations corresponding to the buried point data processing method as described in any one of claims 1-7.

10. A computer storage medium, characterized in that: The storage medium stores at least one executable instruction, and the executable instruction enables the processor to execute operations corresponding to the buried point data processing method as described in any one of claims 1-7.

11. A computer program product, characterized in that It includes at least one executable instruction, which enables the processor to perform operations corresponding to the buried point data processing method as described in any one of claims 1-7.

Images