CN115473839A - Data processing method, device and equipment based on buried point and storage medium - Google Patents
Data processing method, device and equipment based on buried point and storage medium Download PDFInfo
- Publication number
- CN115473839A CN115473839A CN202110656145.7A CN202110656145A CN115473839A CN 115473839 A CN115473839 A CN 115473839A CN 202110656145 A CN202110656145 A CN 202110656145A CN 115473839 A CN115473839 A CN 115473839A
- Authority
- CN
- China
- Prior art keywords
- link
- node
- field
- service
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000003860 storage Methods 0.000 title claims abstract description 30
- 238000003672 processing method Methods 0.000 title claims abstract description 20
- 238000001514 detection method Methods 0.000 claims abstract description 108
- 238000000034 method Methods 0.000 claims abstract description 78
- 230000008569 process Effects 0.000 claims abstract description 44
- 238000010586 diagram Methods 0.000 claims description 31
- 238000012545 processing Methods 0.000 claims description 31
- 238000004590 computer program Methods 0.000 claims description 13
- 238000011144 upstream manufacturing Methods 0.000 claims description 8
- 230000000977 initiatory effect Effects 0.000 claims description 5
- 230000002452 interceptive effect Effects 0.000 claims description 5
- 238000004519 manufacturing process Methods 0.000 abstract description 36
- 230000006870 function Effects 0.000 description 7
- 230000003287 optical effect Effects 0.000 description 6
- 238000004891 communication Methods 0.000 description 5
- 230000000694 effects Effects 0.000 description 5
- 230000000007 visual effect Effects 0.000 description 5
- 230000009471 action Effects 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000002159 abnormal effect Effects 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 230000000712 assembly Effects 0.000 description 2
- 238000000429 assembly Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000012512 characterization method Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the disclosure provides a data processing method, a device, equipment and a storage medium based on a buried point, wherein detection data of a service link is obtained based on a buried point model, the service link comprises a plurality of link nodes, the service link is used for representing an operation process of content data, the link nodes are used for representing operation events in the operation process, and the detection data is used for describing each link node and a link relation between each link node; generating a link map corresponding to the service link according to the detection data; the link relation between each link node and the link nodes in the service link can be described through the detection data, and the effective detection of the service link of the whole content production process is realized.
Description
Technical Field
The embodiment of the disclosure relates to the technical field of computers, in particular to a data processing method, a data processing device, data processing equipment and a storage medium based on a buried point.
Background
The content production process of the content platform comprises multiple links of release, modification, submission, issue and the like, and in the whole content production process, related personnel in the multiple links need to cooperate together to complete the processing of complete content data.
In the prior art, due to the complexity of the content production process, the whole service link is usually completed by the cooperation of a plurality of link nodes, but the service data acquired by each link node has the problems of inconsistency, no logical association and the like, so that the whole service link cannot be quickly and effectively detected, the failure rate of the whole content production process is high, the efficiency and the stability of the content production process are reduced, and the user experience is influenced.
Disclosure of Invention
The embodiment of the disclosure provides a data processing method, a data processing device, data processing equipment and a storage medium based on a buried point, so as to solve the problem of high failure rate of the whole content production process caused by the fact that the whole service link cannot be detected.
In a first aspect, an embodiment of the present disclosure provides a data processing method based on a buried point, including:
acquiring detection data of a service link based on a buried point model, wherein the service link comprises a plurality of link nodes, the service link is used for representing an operation process of content data, the link nodes are used for representing operation events in the operation process, and the detection data is used for describing each link node and a link relation between the link nodes; and generating a link map corresponding to the service link according to the detection data.
In a second aspect, an embodiment of the present disclosure provides a data processing apparatus based on a buried point, including:
an obtaining module, configured to obtain detection data of a service link based on a buried point model, where the service link includes multiple link nodes, the service link is used to characterize an operation process on content data, the link nodes are used to characterize operation events in the operation process, and the detection data is used to describe each link node and a link relationship between the link nodes;
and the generating module is used for generating a link map corresponding to the service link according to the detection data.
In a third aspect, an embodiment of the present disclosure provides an electronic device, including: at least one processor and memory;
the memory stores computer-executable instructions;
the at least one processor executing the computer-executable instructions stored by the memory causes the at least one processor to perform the method for buried-point based data processing as described above in the first aspect and in various possible designs of the first aspect.
In a fourth aspect, the embodiments of the present disclosure provide a computer-readable storage medium, in which computer-executable instructions are stored, and when a processor executes the computer-executable instructions, the data processing method based on the buried point according to the first aspect and various possible designs of the first aspect is implemented.
In a fifth aspect, embodiments of the present disclosure provide a computer program product comprising a computer program that, when executed by a processor, implements a method of buried point based data processing as described above in the first aspect and in various possible designs of the first aspect.
In the method, detection data of a service link is obtained based on a buried point model, where the service link includes a plurality of link nodes, the service link is used to characterize an operation process on content data, the link nodes are used to characterize operation events in the operation process, and the detection data is used to describe each link node and a link relationship between each link node; and generating a link diagram corresponding to the service link according to the detection data, wherein the link relationship between each link node in the service link and the link nodes can be described by the detection data acquired by the buried point model, so that the detection of the service link of the whole content production process can be realized on the basis of the link diagram generated by the detection data, the failure rate of the content production process is reduced, and the efficiency and the stability of the content production process are improved.
Drawings
In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present disclosure, and for those skilled in the art, other drawings can be obtained according to the drawings without inventive exercise.
Fig. 1 is an application scenario diagram of a data processing method based on a buried point according to an embodiment of the present disclosure;
fig. 2 is a first schematic flow chart of a data processing method based on a buried point according to an embodiment of the present disclosure;
fig. 3 is a schematic diagram of a link map provided by an embodiment of the present disclosure;
fig. 4 is a schematic flow chart diagram ii of a data processing method based on a buried point according to an embodiment of the present disclosure;
FIG. 5 is a schematic diagram of a user interface provided by an embodiment of the present disclosure;
FIG. 6 is a block diagram of a data processing apparatus based on a buried point according to an embodiment of the present disclosure;
fig. 7 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure;
fig. 8 is a schematic diagram of a hardware structure of an electronic device according to an embodiment of the present disclosure.
Detailed Description
To make the objects, technical solutions and advantages of the embodiments of the present disclosure more clear, the technical solutions of the embodiments of the present disclosure will be described clearly and completely with reference to the drawings in the embodiments of the present disclosure, and it is obvious that the described embodiments are some, but not all embodiments of the present disclosure. All other embodiments, which can be derived by a person skilled in the art from the embodiments disclosed herein without making any creative effort, shall fall within the protection scope of the present disclosure.
The following explains an application scenario of the embodiment of the present disclosure:
fig. 1 is an application scenario diagram of a data processing method based on a buried point according to an embodiment of the present disclosure, and the data processing method based on a buried point according to the present disclosure may be applied to an application scenario of content production process detection, specifically, as shown in fig. 1, a content production process of a content platform includes multiple links such as publishing, modifying, content understanding, and security detection, for a content cloud server of the content platform, after a user uploads content data, the content production process needs to be detected and detection data is generated, and a terminal device may obtain the detection data by communicating with the content cloud server, so that when the process is abnormal, by analyzing the detection data, a problem in a service link can be located in time, and then corresponding processing and program optimization are performed. The data processing method based on the embedded point provided by the embodiment can be applied to the terminal device, and the terminal device generates the visual link diagram corresponding to the content production flow for displaying after acquiring the detection data from the server and processing the detection data, so that the detection of the content production flow is realized.
In the whole content production flow, related personnel in multiple links are required to cooperate together to complete the processing of complete content data. Due to the complexity of the content production process, in the prior art, the whole service link is usually completed by the cooperation of a plurality of link nodes, among the link nodes on the service link, a front node may affect a rear node, but the service data acquired by each link node has the problems of inconsistency, no logical association and the like, so that the whole service link cannot be detected only by respectively analyzing the service data corresponding to each link node, which results in higher failure rate of the whole content production process, and reduces the efficiency and stability of the content production process.
Fig. 2 is a first schematic flow chart of a data processing method based on a buried point according to an embodiment of the present disclosure. The method of the embodiment can be applied to terminal equipment, for example, a computer with a display, and the computer can be used for detecting the content production process. The data processing method based on the buried points comprises the following steps:
step S101: based on the buried point model, acquiring detection data of a service link, wherein the service link comprises a plurality of link nodes, the service link is used for representing an operation process of content data, the link nodes are used for representing operation events in the operation process, and the detection data is used for describing each link node and link relations among the link nodes.
Illustratively, a buried point model is a buried point hierarchy for a content production flow, which may include relevant specifications for buried points. The embedded point model can be realized in the form of Software Development Kit (SDK), and the acquisition of related data generated in the content production process can be realized by setting embedded points for acquiring data in the content cloud. The setting mode of the buried point and the implementation mode of data acquisition by triggering the buried point can adopt the prior art known by those skilled in the art, and are not described again here.
Furthermore, the content production process has a corresponding relationship with the service link, the service link includes a plurality of link nodes, and the service link is used for representing the operation process of the content data in the content production process. And each link node characterizes each specific operational event in the operational flow. For example, content modification, content detection, and the like are combined based on the timing information of each link node, that is, the service link is obtained. In the process of the content production process, the information passes through each link node in the service link in sequence, and when passing through each link node, the relevant information of the operation event represented by the current link node, such as the content of the operation event, the occurrence time of the operation event and the like, is obtained through the buried point model, the relevant information of the previous link node of the current link node is obtained, and the relevant information of the service link corresponding to the current link node is obtained. Illustratively, the set of the above information is node information. The detection data includes node information corresponding to link nodes, and for any current link node, the node information corresponding to the current link node is used to characterize the current link node, a previous link node of the current link node, and a service link corresponding to the current link node, and after traversing all link nodes in the service link, since the node information of each link node includes the direction information of the previous link node, a link relationship between link nodes can be obtained (i.e., a relationship between link nodes, such as a previous-next relationship between the current node and the previous link node, and a previous-next relationship between link nodes can be determined according to a sequence of operation events in an operation flow of the service link corresponding to each link node, which is certainly not limited thereto). And traversing all link nodes in the service link through the buried point model to obtain data, namely detection data, wherein the detection data is used for describing the link nodes and the link relation among the link nodes.
Step S102: and generating a link map corresponding to the service link according to the detection data.
Illustratively, since the detection data can describe each link node and the link relationship between each link node, each link node and the link relationship between each link node can be expressed according to the node information corresponding to the link node in the detection data. Specifically, the link graph includes link node components corresponding to link nodes (corresponding relationships among the link nodes, the links and the link node components), and link relationship components representing the link relationships among the link node components, and the link graph can be formed by calling a preset visual program framework, generating corresponding link node components from node information corresponding to the link nodes in the detection data, and connecting the link node components in a connection and arrangement manner; the link relation component is a display component for representing the link relation between the link node components in the link diagram. The link node components may be implemented in various ways according to different visual program frameworks, for example, the link node components are panels (panels) or frames (frames) capable of accommodating characters, pictures or other components, and specific implementations of the link node components are not illustrated here.
Further, after step S102, the method may further include: and displaying a link diagram corresponding to the service link on a user interface.
Further, the visualized link map is displayed on a user interface according to specific contents in the node information, for example, the node information includes a link node execution result identifier describing the node information, if the link node execution result identifier is a successful execution identifier (i.e., if the corresponding operation event is successfully executed), if the identifier indicates that the link node corresponding to the node information is successfully executed, the link node component corresponding to the link node is filled in green in the link map; if the execution of the link node corresponding to the identifier characterization node information is unsuccessful, filling a link node component corresponding to the link node with red in a link map so as to better prompt a user of the link node with a problem and improve a visualization effect, where, exemplarily, the execution of the link node is unsuccessful, for example, the execution of an operation event corresponding to the link node fails, the execution is overtime, and the execution result of the operation event corresponding to the link node can be determined by the node information.
More specifically, fig. 3 is a schematic diagram of a link map provided by an embodiment of the present disclosure, as shown in fig. 3 (taking a link node component ID _1 as an example, contents in ID _2 and ID _3 are not shown), an operation action (modification) of a link node and corresponding time information (2021-06-0114. The identification of the link node, the operation action of the link node and the corresponding time information are determined by the node information. The operation action corresponding to the link node component identified as ID _4 of the link node is detection, and a label of "error" is displayed in the link node component, and the link node component is marked with red (not shown in the figure) to indicate that there is an exception in the operation task corresponding to the link node. And displaying abnormal links in the content production flow in a visualized link diagram mode. Therefore, the whole process of the service link can be restored quickly, abnormal links in the content production flow can be positioned quickly, and subsequent targeted improvement is facilitated.
In this embodiment, detection data of a service link is obtained based on a buried point model, where the service link includes a plurality of link nodes, the service link is used to characterize an operation process on content data, the link nodes are used to characterize operation events in the operation process, and the detection data is used to describe each link node and a link relationship between each link node; according to the detection data, a link diagram corresponding to the service link is generated, and because the detection data obtained through the buried point model can describe each link node in the service link and the link relationship between the link nodes, the operation process corresponding to the service link and each operation task in the operation process can be displayed in a visual mode based on the link diagram generated by the detection data, the detection of the service link in the whole content production process is realized, the failure rate of the content production process is reduced, and the efficiency and the stability of the content production process are improved.
Fig. 4 is a schematic flowchart of a second data processing method based on a buried point according to an embodiment of the present disclosure. In this embodiment, a specific implementation manner of node information of a link node is described in detail, and step S102 is refined based on the specific implementation manner of the node information of the link node, where a buried point model includes buried point interfaces corresponding to fields, and the buried point interfaces are used to obtain field values of the fields in the node information, and the data processing method based on buried points includes:
step S201: and acquiring a detection session, wherein the detection session is used for initiating a detection process of the content data based on the service link.
Step S202: and determining a service link according to the identification information of the detection session.
In a scenario of detecting a content production flow, in the content production flow, a flow composed of links to be detected is a detection flow, in a possible implementation manner, the content production flow is consistent with the detection flow, that is, the whole process of the content production flow is detected, and of course, the detection flow may also be a part of the content production flow, that is, a part of the content production flow is detected. Session (Session) represents multiple interactions in one communication, in this embodiment, one complete detection process is one Session, and one Session includes multiple events. More specifically, the detection session corresponds to a service link of a detection process, and a plurality of events in the session are operation events corresponding to link nodes, specifically, for example, "article release" is an operation event corresponding to link node a, and "video transcoding" is an operation event corresponding to link node B. The detection session may be generated based on operation triggering of a user, or based on an operation event of each link node on the content data, which is not specifically limited herein, where the generation principle and process of the session are the prior art known to those skilled in the art, and are not described herein again.
Further, the generated detection session has a unique identifier, and the unique identifier is used for representing a detection process of specific content data and also uniquely corresponds to a service link. After the identifier of the detection session is obtained, the service link can be determined according to a preset mapping relationship.
Specifically, in a possible implementation manner, the node information of each link node includes a third field, where the third field is used to represent an identifier corresponding to a service link where the link node is located, and the third field is consistent with the identifier information of the detection session, and according to the third field of each link node, the link node whose third field is consistent with the identifier information of the detection session is screened, and the corresponding service link may be determined accordingly. And enabling the service link to comprise a target link node, wherein the identifier corresponding to the third field of the target link node is consistent with the identifier information of the detection session.
In the step of this embodiment, by detecting the service link in the process of detecting sessions connected in series once, the continuity of the examination process and the logical relationship between the link nodes are improved, so that the detection condition corresponding to each link node in the service link can be better represented in the link diagram, and the detection effect of the link diagram is improved.
Step S203: and calling a buried point interface in the buried point model to obtain node information corresponding to each link node in the service link.
Step S204: and determining a first field and a second field according to the node information corresponding to the link node.
Illustratively, a specific buried point interface is preset in the buried point model, and by calling the buried point interface, the acquisition of buried point data, more specifically, the node information of a link node is acquired, and the node information is used for representing a current link node, a previous-stage link node of the current link node, and a service link corresponding to the current link node; the current link node is a link node corresponding to the node information, and by traversing each link node in the service link, because the node information of each link node includes the pointing information of the previous link node, the operation event corresponding to each link node and the link relationship between each link node can be obtained.
The node information is, for example, a structural body having preset structural features, and the structural body includes a plurality of fields. The node information of each link node has the same field, i.e., has the same data structure, but the field values of the fields may be different. Further, the node information includes a first field and a second field, and the first field represents the identifier of the current link node; the second field characterizes an identity of a previous link node of the current link node. More specifically, illustratively, thread is an interface description language and binary communication protocol that is used to define and create cross-language services. It can be used as a Remote Procedure Call (RPC) framework, based on the thread framework, the node information is a structure (struct), and among the plurality of fields contained in the structure body of the node information, the first field is, for example: i64 current _ node _ id, namely the field name of the field is current _ node _ id, and the corresponding field value is a variable of i64 (signed 64-bit integer) data type and is used for representing the identification of the current link node; a second field, for example: i64 from _ node _ id, namely the field name of the field is from _ node _ id, and the corresponding field value is a variable of i64 data type, which is used for indicating the identification of the previous link node of the current link node. The field names of the fields in the node information may be set according to different naming rules and requirements, which is only an example.
Optionally, the node information further includes an operation field, where the operation field is used to characterize reference information of an operation event corresponding to the current link node, and the reference information includes at least one of the following: operation time, operation service, operation type, upstream service. Specifically, the operation field may include a plurality of code fields, each code field corresponds to a type of reference information, and specific contents of the operation event, such as time information, a service involved, an operation type, and the like, may be recorded by the reference information. The upstream service refers to a service corresponding to an upstream event of the current operation event, and a change in the upstream service may cause an exception to the current operation event.
Optionally, the node information further includes a content field, where the content field is used to represent an identifier corresponding to the content data, specifically, for example, article content, video title, and the like corresponding to the content data.
Optionally, the node information further includes a context field for characterizing state information affected by the node information of the current link node. Specifically, for example, the operation task corresponding to the current link node is modification of the content data, and after the content data is modified, the distribution state, the contribution state, and the like of the content data may be affected, that is, the context field is used to record the node information of the link node and is related to the related state of the node information. When the node information of the current link node changes, the state information affected by the node information of the current link node may also change accordingly.
Step S205: and respectively storing each field in the node information in a corresponding storage position according to the field name of each field.
Different fields, with different field names, are used for storing different data. Different data can be stored in different storage media according to the requirements of access frequency and the like, so that the data access efficiency is improved. For example, the data corresponding to each field is classified and stored according to the field name, and more specifically, for example, information related to specific operation events is stored on a data warehouse (e.g., hive) for offline analysis, and index information of link nodes is stored in an open-source column database (e.g., clickwouse) for online analysis processing (OLAP), so as to facilitate quick query; the content corresponding to the context field is stored in a Key-Value (KV) model-based storage device (e.g., loghouse) because the volume of the data of the portion is large, and can be quickly queried in KV. In this embodiment, by storing data of different fields in corresponding storage media, the data access efficiency can be improved.
Step S206: and generating a link map corresponding to the service link according to the identifier corresponding to the first field, the identifier corresponding to the second field and the identifier corresponding to the third field of each link node.
Step S207: and displaying a link map corresponding to the service link on a user interface.
According to the node information of each link node, the relevant description of the operation task corresponding to the current link node, the preposed link node of the current link node and the relevant context information can be determined, and therefore all the link nodes and relevant information relevant to the current detection process on the service link are determined. The first field, the second field and the third field in the node information are used as basic fields, and link relationships among the service link, the link node assemblies corresponding to the link nodes in the service link and the link node assemblies can be respectively determined, so that a link graph is generated. Meanwhile, optionally, according to other fields of the link node, such as an operation field, a content field, an upper and lower text field, and the like, the operation task corresponding to each link node is further described, so that the link node component corresponding to the link node can display more information, and the visual detection effect on the whole service link is improved. Determining state information influenced by the node information of the link nodes, for example, according to the context field of each link node; the status information is displayed in the link map.
Fig. 5 is a schematic diagram of a user interface according to an embodiment of the present disclosure, where as shown in fig. 5, the user interface includes a first area and a second area, and a flow component corresponding to a third field (i.e., identification information of a detection session) is displayed in the first area located on the left side, and each flow component corresponds to a session, that is, corresponds to a detection process of content data. And displaying a service link corresponding to the flow component in a second area on the right side. In one possible implementation manner, in response to the interactive instruction aiming at the link node assembly, the node information of the link node corresponding to the link node assembly is displayed on the user interface. Illustratively, after the terminal device responds to the operation of clicking the flow component by the user, a link diagram of a service link corresponding to the flow component is displayed in the second area. The link map includes a plurality of identified link node components, and the identified link node components display content (other information provided by the node information, not shown in the figure) such as time information (e.g., 2020-09-23. Optionally, if there is a post-link node in the link node corresponding to the identified link node component, the "-" identifier corresponding to the identified link node component of the link node may be clicked and collected, so as to implement control of the identified link node component displayed in the link map. Optionally, tag information (not shown in the figure) corresponding to the context field of the link node component is set in the link node component, and through the tag information, state information affected by the current link node can be determined.
Fig. 6 is a block diagram of a data processing apparatus based on buried points according to an embodiment of the present disclosure. For ease of illustration, only portions that are relevant to embodiments of the present disclosure are shown. Referring to fig. 6, the buried point-based data processing apparatus 3 includes:
an obtaining module 31, configured to obtain detection data of a service link based on a buried point model, where the service link includes a plurality of link nodes, the service link is used to characterize an operation process on content data, the link nodes are used to characterize an operation event in the operation process, and the detection data is used to describe each link node and a link relationship between each link node;
and a generating module 32, configured to generate a link map corresponding to the service link according to the detection data.
In a possible implementation manner, the detection data includes node information corresponding to a link node, and for any current link node, the node information corresponding to the current link node is used to characterize the current link node, a previous-stage link node of the current link node, and a service link corresponding to the current link node.
In one possible implementation manner, the node information includes a plurality of fields, the embedded point model includes embedded point interfaces corresponding to the fields, and the embedded point interfaces are used for acquiring field values of the fields in the node information; the obtaining module 31 is specifically configured to: and calling the buried point interface to obtain node information corresponding to the link node.
In a possible implementation manner, the node information includes a first field and a second field, and the first field represents an identifier of a current link node; the second field characterizes an identity of a previous link node of the current link node.
In a possible implementation manner, the node information further includes a third field, where the third field is used to characterize an identifier corresponding to the traffic link.
In a possible implementation manner, the node information further includes an operation field, and the operation field is used for representing reference information of an operation event corresponding to the current link node; the reference information includes at least one of: operation time, operation service, operation type, upstream service.
In a possible implementation manner, the node information further includes a content field, and the content field is used for characterizing a corresponding identifier of the content data.
In a possible implementation manner, the node information further includes a context field, and the context field is used for characterizing state information influenced by the node information of the current link node.
In a possible implementation manner, the node information includes a plurality of fields, and the obtaining module 31 is further configured to: and respectively storing each field in the node information in a corresponding storage position according to the field name of each field.
In a possible implementation manner, the node information includes a third field, and the third field is used to represent an identifier corresponding to the service link; the obtaining module 31 is further configured to: acquiring a detection session; and determining a service link according to the identification information of the detection session, wherein the service link comprises a target link node, the identification corresponding to the third field of the target link node is consistent with the identification information of the detection session, and the detection session is used for initiating a detection process of the content data based on the service link.
In a possible implementation manner, the generating module 32 is specifically configured to: and generating a link diagram corresponding to the service link according to the identifier corresponding to the first field, the identifier corresponding to the second field and the identifier corresponding to the third field of each link node. In a possible implementation manner, the node information further includes a context field, where the context field is used to characterize state information affected by the node information of the current link node, and the generating module is further configured to: and determining state information influenced by the node information of the link nodes in the link graph according to the context field of each link node.
In a possible implementation manner, the link graph includes link node components corresponding to the link nodes and a link relationship component representing a link relationship between the link node components, and the data processing apparatus 3 based on a buried point further includes:
and a display module 33, configured to display, on a user interface, a link map corresponding to the service link.
In a possible implementation manner, the display module 33 is further configured to: and responding to the interactive instruction aiming at the link node assembly, and displaying the node information of the link node corresponding to the link node assembly on the user interface.
The data processing apparatus 3 based on the buried point provided in this embodiment may be used to implement the technical solution of the above method embodiment, and the implementation principle and the technical effect are similar, which are not described herein again.
Fig. 7 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure, and as shown in fig. 7, the electronic device 4 includes at least one processor 41 and a memory 42;
the memory 42 stores computer-executable instructions;
the at least one processor 41 executes computer-executable instructions stored by the memory 42 to cause the at least one processor 41 to perform a buried-point based data processing method as in the embodiment shown in fig. 2-5.
The processor 41 and the memory 42 are connected by a bus 43.
The relevant description may be understood with reference to the relevant description and effect corresponding to the steps in the embodiments corresponding to fig. 2 to fig. 5, and redundant description is not repeated here.
Referring to fig. 8, a schematic structural diagram of an electronic device 900 suitable for implementing the embodiment of the present disclosure is shown, where the electronic device 900 may be a terminal device or a server. Among them, the terminal Device may include, but is not limited to, a mobile terminal such as a mobile phone, a notebook computer, a Digital broadcast receiver, a Personal Digital Assistant (PDA), a tablet computer (PAD), a Portable Multimedia Player (PMP), a car terminal (e.g., car navigation terminal), etc., and a fixed terminal such as a Digital TV, a desktop computer, etc. The electronic device shown in fig. 8 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 8, the electronic device 900 may include a processing means (e.g., a central processing unit, a graphics processor, etc.) 901, which may perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 902 or a program loaded from a storage means 908 into a Random Access Memory (RAM) 903. In the RAM 903, various programs and data necessary for the operation of the electronic apparatus 900 are also stored. The processing apparatus 901, the ROM902, and the RAM 903 are connected to each other through a bus 904. An input/output (I/O) interface 905 is also connected to bus 904.
Generally, the following devices may be connected to the I/O interface 905: input devices 906 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; an output device 907 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 908 including, for example, magnetic tape, hard disk, etc.; and a communication device 909. The communication means 909 may allow the electronic apparatus 900 to communicate with other apparatuses wirelessly or by wire to exchange data. While fig. 8 illustrates an electronic device 900 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication device 909, or installed from the storage device 908, or installed from the ROM 902. The computer program performs the above-described functions defined in the methods of the embodiments of the present disclosure when executed by the processing apparatus 901.
It should be noted that the computer readable medium of the present disclosure may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in the present disclosure, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
The computer readable medium may be embodied in the electronic device; or may be separate and not incorporated into the electronic device.
The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to perform the method shown in the above embodiments.
Computer program code for carrying out operations for aspects of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of 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 the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present disclosure may be implemented by software or hardware. Where the name of a unit does not in some cases constitute a limitation of the unit itself, for example, the first retrieving unit may also be described as a "unit for retrieving at least two internet protocol addresses".
The functions described herein above 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 a chip (SOCs), complex Programmable Logic Devices (CPLDs), and the like.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The 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, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, 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 compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
In a first aspect, according to one or more embodiments of the present disclosure, there is provided a method for data processing based on a buried point, including:
acquiring detection data of a service link based on a buried point model, wherein the service link comprises a plurality of link nodes, the service link is used for representing an operation process of content data, the link nodes are used for representing operation events in the operation process, and the detection data is used for describing each link node and a link relation between the link nodes; and generating a link map corresponding to the service link according to the detection data, wherein the link map comprises link node components corresponding to the link nodes and link relation components among the link node components.
According to one or more embodiments of the present disclosure, the detection data includes node information corresponding to a link node, and for any current link node, the node information corresponding to the current link node is used to characterize the current link node, a previous link node of the current link node, and a service link corresponding to the current link node.
According to one or more embodiments of the present disclosure, the node information includes a plurality of fields, the buried point model includes buried point interfaces corresponding to the fields, and the buried point interfaces are used to obtain field values of the fields in the node information; based on the buried point model, acquiring detection data of a service link, comprising: and calling the buried point interface to obtain node information corresponding to the link node.
According to one or more embodiments of the present disclosure, the node information includes a first field and a second field, the first field characterizing an identity of a current link node; the second field characterizes an identity of a previous link node of the current link node.
According to one or more embodiments of the present disclosure, the node information further includes a third field, where the third field is used to characterize an identifier corresponding to the traffic link.
According to one or more embodiments of the present disclosure, the node information further includes an operation field for characterizing reference information of an operation event corresponding to a current link node; the reference information includes at least one of: operation time, operation service, operation type, upstream service.
According to one or more embodiments of the present disclosure, the node information further includes a content field, where the content field is used to characterize an identifier corresponding to the content data.
According to one or more embodiments of the present disclosure, the node information further includes a context field for characterizing state information affected by the node information of the current link node.
According to one or more embodiments of the present disclosure, the node information includes a plurality of fields, the method further includes: and respectively storing the fields in the node information in corresponding storage positions according to the field names of the fields.
According to one or more embodiments of the present disclosure, the node information includes a third field, where the third field is used to characterize an identifier corresponding to the traffic link; the method further comprises the following steps: acquiring a detection session; and determining the service link according to the identification information of the detection session, wherein the service link comprises a target link node, an identification corresponding to the third field of the target link node is consistent with the identification information of the detection session, and the detection session is used for initiating a detection process of the content data based on the service link.
According to one or more embodiments of the present disclosure, generating a link map corresponding to the service link according to the detection data includes: and generating a link map corresponding to the service link according to the identifier corresponding to the first field, the identifier corresponding to the second field and the identifier corresponding to the third field of each link node.
According to one or more embodiments of the present disclosure, the node information further includes a context field, and the context field is used for characterizing state information affected by the node information of the current link node, and the method further includes: determining state information influenced by node information of the link nodes in the link graph according to the context field of each link node; displaying the status information in the link map.
According to one or more embodiments of the present disclosure, displaying a link map corresponding to the service link on a user interface includes: and responding to the interactive instruction aiming at the link node assembly, and displaying the node information of the link node corresponding to the link node assembly on the user interface.
In a second aspect, according to one or more embodiments of the present disclosure, there is provided a buried point based data processing apparatus comprising:
an obtaining module, configured to obtain detection data of a service link based on a buried point model, where the service link includes a plurality of link nodes, the service link is used to characterize an operation process on content data, the link nodes are used to characterize operation events in the operation process, and the detection data is used to describe each link node and a link relationship between the link nodes;
and a generating module, configured to generate a link map corresponding to the service link according to the detection data, where the link map includes link node components corresponding to the link nodes and link relation components between the link node components.
According to one or more embodiments of the present disclosure, the detection data includes node information corresponding to a link node, and for any current link node, the node information corresponding to the current link node is used to characterize the current link node, a previous-stage link node of the current link node, and a service link corresponding to the current link node.
According to one or more embodiments of the present disclosure, the node information includes a plurality of fields, the buried point model includes buried point interfaces corresponding to the fields, and the buried point interfaces are used to obtain field values of the fields in the node information; an acquisition module specifically configured to: and calling the buried point interface to obtain node information corresponding to the link node.
According to one or more embodiments of the present disclosure, the node information includes a first field and a second field, the first field characterizing an identity of a current link node; the second field characterizes an identity of a previous link node of the current link node.
According to one or more embodiments of the present disclosure, the node information further includes a third field, where the third field is used to characterize an identifier corresponding to the traffic link.
According to one or more embodiments of the present disclosure, the node information further includes an operation field, where the operation field is used to characterize reference information of an operation event corresponding to the current link node; the reference information includes at least one of: operation time, operation service, operation type, upstream service.
According to one or more embodiments of the present disclosure, the node information further includes a content field, and the content field is used for characterizing a corresponding identifier of the content data.
According to one or more embodiments of the present disclosure, the node information further includes a context field for characterizing state information affected by the node information of the current link node.
According to one or more embodiments of the present disclosure, the point information includes a plurality of fields, and the obtaining module is further configured to: and respectively storing each field in the node information in a corresponding storage position according to the field name of each field.
According to one or more embodiments of the present disclosure, the node information includes a third field, where the third field is used to represent an identifier corresponding to a service link; an acquisition module further configured to: acquiring a detection session; and determining a service link according to the identification information of the detection session, wherein the service link comprises a target link node, the identification corresponding to the third field of the target link node is consistent with the identification information of the detection session, and the detection session is used for initiating a detection process of the content data based on the service link.
According to one or more embodiments of the present disclosure, the generating module is specifically configured to: and generating a link map corresponding to the service link according to the identifier corresponding to the first field, the identifier corresponding to the second field and the identifier corresponding to the third field of each link node.
According to one or more embodiments of the present disclosure, the node information further includes a context field, where the context field is used to characterize state information affected by the node information of the current link node, and the generating module is further used to: and determining state information influenced by the node information of the link nodes in the link graph according to the context field of each link node.
In a possible implementation manner, the link graph includes link node components corresponding to the link nodes and a link relationship component representing a link relationship between the link node components, and the data processing apparatus based on the embedded point further includes:
and the display module is used for displaying the link diagram corresponding to the service link on a user interface.
In a possible implementation manner, the display module is further configured to: and responding to the interactive instruction aiming at the link node assembly, and displaying the node information of the link node corresponding to the link node assembly on the user interface.
In a third aspect, according to one or more embodiments of the present disclosure, there is provided an electronic device including: at least one processor and memory; the memory stores computer execution instructions; the at least one processor executes computer-executable instructions stored by the memory to cause the at least one processor to perform the method of buried point based data processing as described above in the first aspect and in various possible designs of the first aspect.
In a fourth aspect, according to one or more embodiments of the present disclosure, there is provided a computer-readable storage medium having stored therein computer-executable instructions that, when executed by a processor, implement a method for buried point-based data processing as described in the first aspect and various possible designs of the first aspect.
In a fifth aspect, embodiments of the present disclosure provide a computer program product comprising a computer program that, when executed by a processor, implements a method of buried point based data processing as described above in the first aspect and in various possible designs of the first aspect.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the disclosure herein is not limited to the particular combination of features described above, but also encompasses other embodiments in which any combination of the features described above or their equivalents does not depart from the spirit of the disclosure. For example, the above features and (but not limited to) the features disclosed in this disclosure having similar functions are replaced with each other to form the technical solution.
Further, while operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Likewise, while several specific implementation details are included in the above discussion, these should not be construed as limitations on the scope of the disclosure. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.
Claims (15)
1. A data processing method based on a buried point is characterized by comprising the following steps:
acquiring detection data of a service link based on a buried point model, wherein the service link comprises a plurality of link nodes, the service link is used for representing an operation process of content data, the link nodes are used for representing operation events in the operation process, and the detection data is used for describing each link node and a link relation between the link nodes;
and generating a link map corresponding to the service link according to the detection data.
2. The method according to claim 1, wherein the detection data includes node information corresponding to a link node, and for any current link node, the node information corresponding to the current link node is used to characterize the current link node, a previous link node of the current link node, and a service link corresponding to the current link node.
3. The method according to claim 2, wherein the node information includes a plurality of fields, and the buried point model includes a buried point interface corresponding to each field, and the buried point interface is configured to obtain a field value of each field in the node information;
based on the buried point model, acquiring detection data of a service link, comprising:
and calling the buried point interface to obtain node information corresponding to the link node.
4. The method of claim 2, wherein the node information comprises a first field and a second field, wherein the first field characterizes an identity of a current link node; the second field represents the identifier of a previous link node of the current link node; the node information further comprises a third field, and the third field is used for representing the corresponding identifier of the service link.
5. The method according to any of claims 2-4, wherein the node information further comprises at least one of: an operation field, a content field, a context field;
wherein the operation field is used for characterizing reference information of an operation event corresponding to the current link node, and the reference information includes at least one of the following information: operation time, operation service, operation type, upstream service;
the content field is used for representing the corresponding identifier of the content data;
the context field is used to characterize state information affected by node information of the current link node.
6. The method of claim 2, wherein the node information comprises a plurality of fields, the method further comprising:
and respectively storing the fields in the node information in corresponding storage positions according to the field names of the fields.
7. The method according to any of claims 2-4, wherein a third field is included in the node information, and the third field is used for characterizing an identifier corresponding to the traffic link;
the method further comprises the following steps:
acquiring a detection session;
and determining the service link according to the identification information of the detection session, wherein the service link comprises a target link node, an identification corresponding to the third field of the target link node is consistent with the identification information of the detection session, and the detection session is used for initiating a detection process of the content data based on the service link.
8. The method of claim 4, wherein generating a link map corresponding to the traffic link according to the detection data comprises:
and generating a link map corresponding to the service link according to the identifier corresponding to the first field, the identifier corresponding to the second field and the identifier corresponding to the third field of each link node.
9. The method of claim 8, wherein the node information further includes a context field for characterizing state information affected by the node information of the current link node, and wherein the method further comprises:
and determining state information influenced by the node information of the link nodes in the link graph according to the context field of each link node.
10. The method according to claim 1, wherein the link map includes link node components corresponding to the link nodes and a link relation component characterizing a link relation between the link node components, the method further comprising:
and displaying a link diagram corresponding to the service link on a user interface.
11. The method of claim 10, wherein displaying a link map corresponding to the service link on a user interface comprises:
and responding to the interactive instruction aiming at the link node assembly, and displaying the node information of the link node corresponding to the link node assembly on the user interface.
12. A data processing apparatus based on a buried point, comprising:
an obtaining module, configured to obtain detection data of a service link based on a buried point model, where the service link includes multiple link nodes, the service link is used to characterize an operation process on content data, the link nodes are used to characterize operation events in the operation process, and the detection data is used to describe each link node and a link relationship between the link nodes;
and the generating module is used for generating a link map corresponding to the service link according to the detection data.
13. An electronic device, comprising: at least one processor and memory;
the memory stores computer-executable instructions;
the at least one processor executing the computer-executable instructions stored by the memory causes the at least one processor to perform the method of buried point based data processing according to any of claims 1 to 11.
14. A computer-readable storage medium having computer-executable instructions stored thereon, which when executed by a processor, implement the method of data processing based on a buried point according to any one of claims 1 to 11.
15. A computer program product comprising a computer program which, when executed by a processor, implements the buried point based data processing method of any one of claims 1 to 11.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110656145.7A CN115473839B (en) | 2021-06-11 | 2021-06-11 | Buried point-based data processing method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110656145.7A CN115473839B (en) | 2021-06-11 | 2021-06-11 | Buried point-based data processing method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115473839A true CN115473839A (en) | 2022-12-13 |
| CN115473839B CN115473839B (en) | 2024-03-05 |
Family
ID=84365157
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110656145.7A Active CN115473839B (en) | 2021-06-11 | 2021-06-11 | Buried point-based data processing method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115473839B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117724891A (en) * | 2024-02-07 | 2024-03-19 | 荣耀终端有限公司 | Service data processing method and service data processing system |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040103426A1 (en) * | 2002-11-22 | 2004-05-27 | Ludvig Edward A. | Tracking end-user content viewing and navigation |
| US20120260205A1 (en) * | 2011-04-07 | 2012-10-11 | Grigore Rusu | System and method for event tracking across plural contact mediums |
| CN108183927A (en) * | 2017-11-22 | 2018-06-19 | 链家网（北京）科技有限公司 | The monitoring method and system that a kind of distributed system link calls |
| WO2020042029A1 (en) * | 2018-08-29 | 2020-03-05 | 华为技术有限公司 | Discovery method for invoked link, apparatus, device, and storage medium |
| CN110912738A (en) * | 2019-11-19 | 2020-03-24 | 支付宝(杭州)信息技术有限公司 | Business exception processing method, device, platform and electronic equipment |
| CN111159590A (en) * | 2019-12-31 | 2020-05-15 | 亚信科技（中国）有限公司 | Serial connection method and device based on front-end and back-end service call links |
| CN111259275A (en) * | 2018-12-03 | 2020-06-09 | 阿里巴巴集团控股有限公司 | Data tracking method, equipment and storage medium |
| CA3168303A1 (en) * | 2019-01-18 | 2020-07-23 | 10353744 Canada Ltd. | Microservice full-link monitoring system and method |
| CN111723134A (en) * | 2019-03-19 | 2020-09-29 | 北京京东尚科信息技术有限公司 | Information processing method, information processing device, electronic equipment and storage medium |
| CN111737630A (en) * | 2020-08-25 | 2020-10-02 | 智者四海（北京）技术有限公司 | Method for recording user access path |
| CN112003763A (en) * | 2020-08-07 | 2020-11-27 | 山东英信计算机技术有限公司 | Network link monitoring method, monitoring device, monitoring equipment and storage medium |
| CN112395180A (en) * | 2020-12-10 | 2021-02-23 | 南威软件股份有限公司 | Method for realizing service log full link tracking |
-
2021
- 2021-06-11 CN CN202110656145.7A patent/CN115473839B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040103426A1 (en) * | 2002-11-22 | 2004-05-27 | Ludvig Edward A. | Tracking end-user content viewing and navigation |
| US20120260205A1 (en) * | 2011-04-07 | 2012-10-11 | Grigore Rusu | System and method for event tracking across plural contact mediums |
| CN108183927A (en) * | 2017-11-22 | 2018-06-19 | 链家网（北京）科技有限公司 | The monitoring method and system that a kind of distributed system link calls |
| WO2020042029A1 (en) * | 2018-08-29 | 2020-03-05 | 华为技术有限公司 | Discovery method for invoked link, apparatus, device, and storage medium |
| CN111259275A (en) * | 2018-12-03 | 2020-06-09 | 阿里巴巴集团控股有限公司 | Data tracking method, equipment and storage medium |
| CA3168303A1 (en) * | 2019-01-18 | 2020-07-23 | 10353744 Canada Ltd. | Microservice full-link monitoring system and method |
| CN111723134A (en) * | 2019-03-19 | 2020-09-29 | 北京京东尚科信息技术有限公司 | Information processing method, information processing device, electronic equipment and storage medium |
| CN110912738A (en) * | 2019-11-19 | 2020-03-24 | 支付宝(杭州)信息技术有限公司 | Business exception processing method, device, platform and electronic equipment |
| CN111159590A (en) * | 2019-12-31 | 2020-05-15 | 亚信科技（中国）有限公司 | Serial connection method and device based on front-end and back-end service call links |
| CN112003763A (en) * | 2020-08-07 | 2020-11-27 | 山东英信计算机技术有限公司 | Network link monitoring method, monitoring device, monitoring equipment and storage medium |
| CN111737630A (en) * | 2020-08-25 | 2020-10-02 | 智者四海（北京）技术有限公司 | Method for recording user access path |
| CN112395180A (en) * | 2020-12-10 | 2021-02-23 | 南威软件股份有限公司 | Method for realizing service log full link tracking |
Non-Patent Citations (3)
| Title |
|---|
| AMUTHA NANMARAN; M. PONNAVAIKKO; N. KARTHICK: "Target Tracking with Integrated Coverage in Wireless Sensor Networks", 《2009 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, CONTROL, AND TELECOMMUNICATION TECHNOLOGIES》, 31 December 2009 (2009-12-31) * |
| 刘嘉裕: "基于分布式微服务全链路实时监控***设计与实现", 《CNKI》, 1 May 2018 (2018-05-01) * |
| 谭华;易学明;: "数据中台的定位和架构分析", 广东通信技术, no. 12, 15 December 2019 (2019-12-15) * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117724891A (en) * | 2024-02-07 | 2024-03-19 | 荣耀终端有限公司 | Service data processing method and service data processing system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115473839B (en) | 2024-03-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109299348B (en) | Data query method and device, electronic equipment and storage medium | |
| CN111897740B (en) | User interface testing method and device, electronic equipment and computer readable medium | |
| CN110865898B (en) | Method, device, medium and equipment for converging crash call stack | |
| CN111198859B (en) | Data processing method, device, electronic equipment and computer readable storage medium | |
| CN111352800A (en) | Big data cluster monitoring method and related equipment | |
| CN109634599B (en) | Page view display method, device, equipment and storage medium | |
| CN110390493B (en) | Task management method and device, storage medium and electronic equipment | |
| CN110287810B (en) | Vehicle door motion detection method, device and computer readable storage medium | |
| US20210200806A1 (en) | Method and apparatus for parallel processing of information | |
| CN112016284B (en) | Electronic form processing method and device | |
| CN111857720B (en) | User interface state information generation method and device, electronic equipment and medium | |
| CN115145560A (en) | Business orchestration method, device, equipment, computer readable medium and program product | |
| CN115473839B (en) | Buried point-based data processing method, device, equipment and storage medium | |
| CN112954056B (en) | Method and device for processing monitoring data, electronic equipment and storage medium | |
| CN112291121B (en) | Data processing method and related equipment | |
| CN112882948A (en) | Stability testing method, device and system for application and storage medium | |
| CN111274104B (en) | Data processing method, device, electronic equipment and computer readable storage medium | |
| CN109542743B (en) | Log checking method and device, electronic equipment and computer readable storage medium | |
| CN113807056B (en) | Document name sequence error correction method, device and equipment | |
| CN112379967B (en) | Simulator detection method, device, equipment and medium | |
| CN111092758A (en) | Method and device for reducing alarm and recovering false alarm and electronic equipment | |
| CN116703263B (en) | Power equipment distribution method, device, electronic equipment and computer readable medium | |
| CN113448550B (en) | Method and device for realizing collection management of classes, electronic equipment and computer medium | |
| CN116467178B (en) | Database detection method, apparatus, electronic device and computer readable medium | |
| CN111625692B (en) | Feature extraction method, device, electronic equipment and computer readable medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |