CN116932347A - Link tracking method, device and computer readable medium - Google Patents

Link tracking method, device and computer readable medium Download PDF

Info

Publication number
CN116932347A
CN116932347A CN202310688138.4A CN202310688138A CN116932347A CN 116932347 A CN116932347 A CN 116932347A CN 202310688138 A CN202310688138 A CN 202310688138A CN 116932347 A CN116932347 A CN 116932347A
Authority
CN
China
Prior art keywords
log
service
tracking
service request
link
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.)
Pending
Application number
CN202310688138.4A
Other languages
Chinese (zh)
Inventor
刘成健
张丽斌
张辉
刘湛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Bilibili Technology Co Ltd
Original Assignee
Shanghai Bilibili Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shanghai Bilibili Technology Co Ltd filed Critical Shanghai Bilibili Technology Co Ltd
Priority to CN202310688138.4A priority Critical patent/CN116932347A/en
Publication of CN116932347A publication Critical patent/CN116932347A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/30—Monitoring
    • G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3466—Performance evaluation by tracing or monitoring
    • G06F11/3476—Data logging
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/30—Monitoring
    • G06F11/32—Monitoring with visual or acoustical indication of the functioning of the machine
    • G06F11/323—Visualisation of programs or trace data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
    • G06F16/2477—Temporal data queries
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/248—Presentation of query results
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/26—Visual data mining; Browsing structured data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Computational Linguistics (AREA)
  • Quality & Reliability (AREA)
  • Computing Systems (AREA)
  • Computer Hardware Design (AREA)
  • Fuzzy Systems (AREA)
  • Mathematical Physics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Software Systems (AREA)
  • Debugging And Monitoring (AREA)

Abstract

The application provides a link tracking method, equipment and a computer readable medium, wherein the scheme generates a tracking record instance when a service request is received; when the service request is executed to the link node, a corresponding log is generated, the log is pushed to different queues corresponding to the tracking record instance according to the service type, and when the service request is executed, the log in the queue is synchronized to the database. Because the log includes the timestamp of executing the service request, when the link tracking visualization request is received, the corresponding log can be queried from the database, and then the data of the log are sequentially displayed according to the timestamp of the log. Therefore, the method and the system realize the two-dimensional log tracking, organization and aggregation based on the tracking identification and the time axis, so that a user can conveniently check the processing process of a certain service request in each link node according to the time sequence through a visual form, and the links are restored better.

Description

Link tracking method, device and computer readable medium
Technical Field
The present application relates to the field of information technologies, and in particular, to a link tracking method, a device, and a computer readable medium.
Background
With the rapid development of internet products, business environments and user demands are constantly changing, which makes business demands more complicated. Business systems need to cope with a wider and wider variety of business scenarios, as well as increasingly complex business logic. This increase in complexity is also affected by the micro-service architecture, as implementing business logic often requires reliance on collaboration between multiple services. Thus, the complexity of the business system has become a normative.
The conventional link tracking technology uses a globally unique ID (i.e., traceID) to link the same service request scattered on different link nodes to restore the calling relationship in the execution process of the service request, track the system problem, analyze the calling data, and count the system index. By TraceID, a distributed request may be restored to a complete call link, starting from the service request initiator, and recording each node through which the service request flows until a response is returned.
However, as the complexity of the service system increases, the data of the related logs are only aggregated and displayed by the TraceID, which results in a more decentralized display of the log data, and a more difficult link restoration, which makes it difficult to quickly track the service processing process.
Disclosure of Invention
Aspects of the present application provide a link tracking method, apparatus, and computer readable medium for solving the problem of link recovery difficulty in the current link tracking scheme.
In one aspect of the present application, there is provided a method for link tracking, the method comprising:
when a service request is received, generating a tracking record instance, wherein the tracking record instance is associated with a tracking identifier corresponding to the service request;
when the service request is executed to a link node, a corresponding log is generated, and the log is pushed to different queues corresponding to the tracking record examples according to the service type, wherein the log comprises a time stamp for executing the service request;
when the service request is executed, synchronizing the log in the queue to a database;
when a link tracking visualization request is received, inquiring a corresponding log from a database according to a tracking identification of the link tracking visualization request, and displaying data of the log according to a time stamp sequence of the log.
Based on another aspect of the present application, there is also provided a link tracking device, wherein the device includes:
the log storage module is used for generating a tracking record instance when a service request is received, wherein the tracking record instance is associated with a tracking identifier corresponding to the service request; when the service request is executed to a link node, a corresponding log is generated, and the log is pushed to different queues corresponding to the tracking record examples according to the service type, wherein the log comprises a time stamp for executing the service request; when the service request is executed, synchronizing the log in the queue to a database;
and the visualization tracking module is used for inquiring the corresponding log from the database according to the tracking identification of the link tracking visualization request when the link tracking visualization request is received, and sequentially displaying the data of the log according to the time stamp of the log.
The embodiment of the application also provides electronic equipment, which comprises:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the aforementioned link tracking method.
Embodiments of the present application also provide a computer readable medium having stored thereon computer program instructions executable by a processor to implement the aforementioned link tracking method.
In the link tracking scheme provided by the embodiment of the application, when a service request is received, a tracking record instance is generated, and the tracking record instance is associated with a tracking identifier corresponding to the service request; when the service request is executed to a link node, a corresponding log is generated, the log is pushed to different queues corresponding to the tracking record examples according to the service type, and when the service request is executed, the log in the queues is synchronized to a database. Because the log includes a timestamp for executing the service request, when a link tracking visualization request is received, a corresponding log can be queried from a database according to a tracking identifier of the link tracking visualization request, and after the log is queried based on the tracking identifier, data of the log can be sequentially displayed according to the timestamp of the log. Therefore, the method and the system realize the two-dimensional log tracking, organization and aggregation based on the tracking identification and the time axis, so that a user can conveniently check the processing process of a certain service request in each link node according to the time sequence through a visual form, and the links are restored better.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings used in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present application, and other drawings may be obtained according to these drawings without inventive effort to a person skilled in the art. Other features, objects and advantages of the present application will become more apparent upon reading of the detailed description of non-limiting embodiments, made with reference to the accompanying drawings in which:
fig. 1 is a schematic process flow diagram of a link tracking method according to an embodiment of the present application;
FIG. 2 is a schematic diagram of a results preview tab page of a visualization page implementing link tracking in an embodiment of the present application;
FIG. 3 is a schematic diagram of a service information tab page of a visualization page for implementing link tracking in an embodiment of the present application;
FIG. 4 is a diagram of a call information tab page of a visualization page implementing link tracking in an embodiment of the present application;
FIG. 5 is a schematic diagram of an overall flow of generating logs and completing storage of service requests in the execution process of each link node of a service system according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a link tracking device according to an embodiment of the present application;
FIG. 7 is a schematic diagram of an apparatus suitable for implementing aspects of embodiments of the present application;
the same or similar reference numbers in the drawings refer to the same or similar parts.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present application more apparent, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments of the present application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
In one exemplary configuration of the application, the terminal, the devices of the services network each include one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of computer-readable media.
Computer-readable media include both permanent and non-permanent, removable and non-removable media, and information storage may be implemented by any method or technology. The information may be computer program instructions, data structures, modules of the program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape storage or other magnetic storage devices, or any other non-transmission medium which can be used to store information that can be accessed by a computing device.
The embodiment of the application provides a link tracking method, which can realize the two-dimensional log tracking, organization and aggregation based on a tracking identifier and a time axis, so that an operation and maintenance person can conveniently check the processing process of a certain service request in each link node according to the time sequence in a visual form, thereby better restoring the link.
In an actual scenario, the execution body of the method may be a user device, or a device formed by integrating the user device and a network device through a network, or may also be an application running on the device, where the user device includes, but is not limited to, various terminal devices such as a computer, a mobile phone, a tablet computer, a smart watch, a bracelet, and the network device includes, but is not limited to, a network host, a single network server, a plurality of network server sets, or a computer set based on cloud computing. Here, the Cloud is composed of a large number of hosts or web servers based on Cloud Computing (Cloud Computing), which is a kind of distributed Computing, one virtual computer composed of a group of loosely coupled computer sets.
Fig. 1 shows a process flow of a link tracking method according to an embodiment of the present application, where the method at least includes the following processing steps:
step S101, when a service request is received, a tracking record instance is generated, and the tracking record instance is associated with a tracking identifier corresponding to the service request. In the application scenario of the scheme, after the service system receives a service request, each node involved in the service system can be sequentially processed according to a specific service flow, so that a response result is obtained and returned to the equipment for initiating the service request. For example, taking a commodity recommendation scenario as an example, when the user1 starts the shopping APP (Application program) on the client device, the client device may initiate a service request for acquiring a recommended commodity to a service system corresponding to the shopping APP.
After receiving the service request, the service system performs a series of processing according to the service flow recommended by the commodity by each node in the service system to obtain a final processing result. For example, the processing flow for the service request in this embodiment may include steps such as request (requset), recall (recall), and rank (rank). The request step is to acquire the relevant information in the corresponding service request; the recall step is to determine user portrait information according to the acquired related information, and determine candidate results of the commodity to be recommended based on the user portrait; the sorting step includes sorting candidate results of the goods to be recommended, and determining the priority order when the recommended goods are displayed to the user; thus, after the processing of the steps, the service system can return the processing result of the service request to the user, thereby completing the sequential service processing. In this process, the corresponding processing may be performed by different nodes involved in the service system, respectively, thereby forming a processing link for the service request.
For any service request, a globally unique tracking identifier may be allocated to the service request, where in this embodiment, the tracking identifier may be a TraceID, and the service system may carry the tracking identifier when performing a series of processing on the service request, so that subsequent processing based on the same service request dispersed on different link nodes may be associated based on the tracking identifier. In the scheme, when a service request is received, a trace record instance (recoder) can be generated, and the traceID of the service request can be recorded, so that the trace record instance can be associated with a trace identifier corresponding to the service request.
Step S102, when the service request is executed to a link node, a corresponding log is generated, and the log is pushed to different queues corresponding to the tracking record instance according to the service type. The log comprises a time stamp for executing the service request, so that the time of corresponding processing executed by each link node based on the service request can be recorded through the time stamp, the data of the log can be organized and aggregated based on a time axis, and the problem that the link recovery is difficult due to the fact that the log data are scattered is avoided.
When the link node executes the service request, a corresponding log is generated, the log records related data when the service request is executed, and an operation and maintenance person can know the specific condition of the link node when the service request is executed through the data in the log. In the embodiment of the application, the log can be defined as two types of service types, including a service log and a call log. The service log is used for recording specific service information related to the service scene, for example, user portrait information used in the recovery step, specific results of recalling the recommended commodity, specific sorting results determined in the rank step, and the like, which can be recorded in the service log. The call log is used for recording call information when the related service is called, for example, a call request is initiated to redis (Remote Dictionary Server, remote dictionary service), and the call result is success or failure, etc., which can be recorded in the call log.
Accordingly, in this embodiment, two queues, i.e., a business queue (businechan) and a call queue (remoteChan), may be configured, corresponding to the business log and the call log, respectively. Thus, when the service request is executed to the link node, a service log and/or a call log can be generated according to the specific processing content actually executed. And then pushing the service log to a service queue corresponding to the tracking record instance, and pushing the call log to a call queue corresponding to the tracking record instance. Wherein the service log and the call log each include a timestamp of executing the service request to facilitate subsequent organization and aggregation of data of the log based on a time axis.
Step S103, when the service request is executed, synchronizing the log in the queue to the database.
For a service request, if each node in the service system completes a series of processing according to a preset service flow, and after a final processing result is obtained, the service request is finished, and at the moment, the log in the queue corresponding to the trace record instance can be synchronized into the database for persistent storage. In an actual scenario, since the queue corresponding to the trace record instance includes the service queue and the call queue, the trace record instance may be saved to the database in an asynchronous form after being merged according to the logs in the two queues, where the database may select a suitable type according to the requirement of the actual scenario, for example, in this embodiment, a MySQL database is used.
Step S104, when a link tracking visualization request is received, inquiring a corresponding log from a database according to a tracking identification of the link tracking visualization request, and displaying data of the log according to a time stamp sequence of the log. When the data of the log are displayed, the data of the line pipe can be visually rendered according to a preset mode, so that operation and maintenance personnel can better check the execution condition of the link.
Therefore, when the operation and maintenance personnel restore the link of the business processing by checking the data of the log, the data which is aggregated according to the execution time can be directly seen, so that the execution site of the restoration can be better. Taking the commodity recommendation scenario as an example, if the commodity recommendation scenario is arranged in a positive sequence according to the time stamp when the commodity recommendation scenario is displayed, when an operation and maintenance person checks the related logs of the link processing, the serial processing procedures of the service request on each link node can be more clearly checked.
In addition, when the data of the logs are visualized, the logs of different types can be displayed respectively, so that operation and maintenance personnel can independently check service information or call information, and the execution condition of each node in the link of the service request can be checked more pertinently. For example, in this embodiment, the log includes a service log and a call log, so the service log and the call log may be respectively ordered according to the order of the time stamps, and then the data of the service log and the data of the call log are separately displayed according to the ordering results of the service log and the call log.
In some embodiments of the present application, when a link tracking visualization request is received, in addition to displaying the data of the log according to the time stamp sequence, the execution result of the service request corresponding to the log may be restored, and the execution result may be displayed, so that an operation and maintenance person may preview the result after the execution of the service request while viewing the log data, thereby finding whether there is a problem in the execution process from the result, and facilitating the operation and maintenance person to more intuitively determine whether there is a problem in the link execution process.
The scheme of the embodiment of the application provides a visualization mode with better readability, which provides a visualization page as shown in figures 2-4. The visual page may include a plurality of tab pages, including a result preview tab page tag1, a service information tab page tag2, and a call information tab page tag3, and the execution result is displayed in the result preview tab page tag1 of the visual page, as shown in fig. 2, the data of the service log is displayed in the service information tab page tag2 of the visual page according to the time stamp order of the service log, as shown in fig. 3, and the data of the call log is displayed in the call information tab page tag3 of the visual page according to the time stamp order of the call log, as shown in fig. 4.
In some embodiments of the present application, when the log is pushed to a different queue corresponding to the trace record instance according to a service type, the log pushed to the queue is screened by a white list mechanism, so that a part of logs with lower importance are filtered, and the number of logs actually pushed to the queue and synchronized to the database is reduced. By means of the method, the number of logs to be stored and analyzed in the scheme can be effectively controlled, and compared with the scheme that all logs are obtained in a full amount without using a white list, the problems that the size of a single-shot log is limited, log analysis is time-consuming, excessive logs affect on-line service performance and the like can be avoided, so that the size of the single log is greatly improved compared with that of a traditional log, and more detailed data are recorded.
Specifically, in the link tracking scheme provided in this embodiment, when pushing the log to different queues corresponding to the tracking record instance according to a service type, whether the log belongs to a target user in a white list may be determined according to a unique user identifier. The target users in the white list can be set according to the requirements of actual scenes, and user unique identifiers of the target users can be included. When each link node of the service system executes the service request and generates the log, the unique user identifier corresponding to the user initiating the service request can be matched with the unique user identifier in the white list, if the unique user identifier is matched with the unique user identifier, the generated log is indicated to belong to the target user in the white list, and the log can be pushed to different queues corresponding to the tracking record examples according to the service type. If the same unique user identifier is not matched in the white list, the generated log is not included in the target user in the white list, and the log does not need to be pushed to a queue at this time, and the log cannot be synchronized into a database as data for link tracking.
In addition, the stored log is associated with the unique user identifier, so that the page can realize visual link tracking based on the unique user identifier. Therefore, when the link tracking visualization request is received, the corresponding logs can be queried from the database according to the unique identification of the user of the link tracking visualization request, and the data of the logs can be sequentially displayed according to the time stamps of the logs.
When the data of the logs are displayed, the logs of different types can be respectively displayed, the service logs and the call logs are respectively sequenced according to the sequence of the time stamps, and then the data of the service logs and the data of the call logs are independently displayed according to the sequencing results of the service logs and the call logs, so that operation and maintenance personnel can independently check service information or call information. Compared with the method of inquiring the corresponding log based on the tracking identifier and visualizing the data of the log, in the embodiment, the corresponding log is inquired according to the unique identifier of the user and the data of the log is visualized, so that an operation and maintenance person can quickly check the execution condition of all service requests of a specific user in a link within a period of time, and the problem is convenient to check.
Fig. 5 shows the overall process of the service request to generate a log and complete storage throughout the execution of each link node of the service system. When the system receives a service request, a trace record instance recoder can be generated, the traceID corresponding to the service request can be recorded, meanwhile, according to the preset flow of service processing, the processing of corresponding steps is executed by each different link node, for example, the figure comprises 3 steps step1-step3, which can be executed by specific link nodes respectively, and after the execution is finished, a response is returned to the initiator of the service request. The processing of each step generates a corresponding log, wherein specific execution conditions such as a time stamp during execution, service information or call information during execution of the corresponding processing are recorded.
When the link nodes execute the processing of the corresponding steps and generate logs, white lists are used for verification, and if the logs belong to target users in the white lists, the logs to be recorded are pushed into the queues corresponding to the recoder according to the service types. The service log is pushed into a service queue businechan, and the call log is pushed into a call queue remoteChan. And when the logs do not belong to the target users in the white list, the logs are filtered and are not pushed into the corresponding queues. After the service request is executed, the recoder merges the log of the service queue and the log of the call queue, and stores the merged log into the database mysql in an asynchronous mode through the database client dbClient. The specific data content in the database may include at least: id. info, type, time, traceid, etc., wherein id is the identification assigned by the database to the stored data; info is the specific content of the log data; the type is a service type corresponding to the log data, and can be business/remote (service log or call log); time is a timestamp corresponding to log data; is the tracking identification corresponding to the log data.
After the log data is stored in the mode, the specific log can be queried for visualization processing when needed, so that the execution condition of the service request in the whole link can be restored.
In addition, the embodiment of the application also provides a link tracking device, wherein the structure of the device is shown in fig. 6, and the device comprises a log storage module 610 and a visual tracking module 620. The log storage module 610 is configured to generate a trace record instance when a service request is received, where the trace record instance is associated with a trace identifier corresponding to the service request; when the service request is executed to a link node, a corresponding log is generated, and the log is pushed to different queues corresponding to the tracking record examples according to the service type, wherein the log comprises a time stamp for executing the service request; and synchronizing the log in the queue to a database when the service request is executed. The visualization tracking module 620 is configured to, when receiving a link tracking visualization request, query a corresponding log from a database according to a tracking identifier of the link tracking visualization request, and sequentially display data of the log according to a timestamp of the log.
Based on the same inventive concept, the embodiment of the present application further provides an electronic device, where the corresponding method of the electronic device may be the link tracking method in the foregoing embodiment, and the principle of solving the problem is similar to that of the method. The electronic equipment provided by the embodiment of the application comprises: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the methods and/or aspects of the various embodiments of the application described above.
The electronic device may be a user device, or a device formed by integrating the user device and a network device through a network, or may also be an application running on the device, where the user device includes, but is not limited to, various terminal devices such as a computer, a mobile phone, a tablet computer, a smart watch, a bracelet, and the network device includes, but is not limited to, a network host, a single network server, a plurality of network server sets, or a computer set based on cloud computing. Here, the Cloud is composed of a large number of hosts or web servers based on Cloud Computing (Cloud Computing), which is a kind of distributed Computing, one virtual computer composed of a group of loosely coupled computer sets.
Fig. 7 shows a structure of a device suitable for implementing the method and/or technical solution in an embodiment of the present application, the device 700 includes a central processing unit (CPU, central Processing Unit) 701, which may perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 702 or a program loaded from a storage section 708 into a random access Memory (RAM, random Access Memory) 703. In the RAM 703, various programs and data required for the system operation are also stored. The CPU 701, ROM 702, and RAM 703 are connected to each other through a bus 704. An Input/Output (I/O) interface 705 is also connected to bus 704.
The following components are connected to the I/O interface 705: an input section 706 including a keyboard, mouse, touch screen, microphone, infrared sensor, etc.; an output portion 707 including a display such as a Cathode Ray Tube (CRT), a liquid crystal display (LCD, liquid Crystal Display), an LED display, an OLED display, or the like, and a speaker; a storage portion 708 comprising one or more computer-readable media such as a hard disk, optical disk, magnetic disk, semiconductor memory, etc.; and a communication section 709 including a network interface card such as a LAN (local area network ) card, a modem, or the like. The communication section 709 performs communication processing via a network such as the internet.
In particular, the methods and/or embodiments of the present application 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 shown in the flow chart. The above-described functions defined in the method of the present application are performed when the computer program is executed by a Central Processing Unit (CPU) 701.
Another embodiment of the present application also provides a computer readable storage medium having stored thereon computer program instructions executable by a processor to implement the method and/or the technical solution of any one or more of the embodiments of the present application described above.
In particular, the present embodiments may employ any combination of one or more computer-readable media. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium would include the following: 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 this document, 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.
The computer readable signal medium may include 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 any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. 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 wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations of the present application 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 kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
The flowchart or block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of devices, methods and computer program products according to various embodiments of the present application. 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.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, which are not repeated herein.
In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the elements is merely a logical function division, and there may be additional divisions in actual implementation, e.g., multiple elements or page components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in hardware plus software functional units.
The integrated units implemented in the form of software functional units described above may be stored in a computer readable storage medium. The software functional unit is stored in a storage medium, and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) to perform part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present application, and are not limiting; although the application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present application.
Furthermore, it is evident that the word "comprising" does not exclude other elements or steps, and that the singular does not exclude a plurality. A plurality of units or means recited in the apparatus claims can also be implemented by means of one unit or means in software or hardware. The terms first, second, etc. are used to denote a name, but not any particular order.

Claims (10)

1. A method of link tracking, wherein the method comprises:
when a service request is received, generating a tracking record instance, wherein the tracking record instance is associated with a tracking identifier corresponding to the service request;
when the service request is executed to a link node, a corresponding log is generated, and the log is pushed to different queues corresponding to the tracking record examples according to the service type, wherein the log comprises a time stamp for executing the service request;
when the service request is executed, synchronizing the log in the queue to a database;
when a link tracking visualization request is received, inquiring a corresponding log from a database according to a tracking identification of the link tracking visualization request, and displaying data of the log according to a time stamp sequence of the log.
2. The method of claim 1, wherein the traffic types include a traffic log and a call log;
when the service request is executed to a link node, a corresponding log is generated, and the log is pushed to different queues corresponding to the tracking record examples according to the service type, wherein the log comprises a time stamp for executing the service request and comprises the following steps:
when the service request is executed to a link node, a service log and/or a call log are generated, the service log is pushed to a service queue corresponding to the tracking record instance, the call log is pushed to a call queue corresponding to the tracking record instance, and the service log and the call log comprise time stamps for executing the service request.
3. The method of claim 2, wherein sequentially displaying the data of the log according to the time stamps of the log comprises:
sequencing the service log and the call log according to the sequence of the time stamps;
and according to the sequencing results of the service log and the call log, the data of the service log and the data of the call log are independently displayed.
4. The method of claim 1, wherein after querying a corresponding log from a database according to the trace identification of the link trace visualization request, further comprising:
restoring the execution result of the service request corresponding to the log, and displaying the execution result.
5. The method of claim 4, wherein displaying the execution result comprises:
displaying the execution result in a result preview tab page of the visualization page;
displaying the data of the log according to the time stamp sequence of the log, comprising:
displaying data of the service log in a service information label page of the visual page according to the time stamp sequence of the service log;
and displaying the data of the call log in the call information label page of the visual page according to the time stamp sequence of the call log.
6. The method of claim 1, wherein pushing the log to a different queue corresponding to the trace record instance according to a service type comprises:
judging whether the log belongs to a target user in a white list according to the unique user identifier;
if the target user belongs to the white list, pushing the log to different queues corresponding to the tracking record examples according to the service types.
7. The method of claim 1, wherein the method further comprises:
when a link tracking visualization request is received, inquiring a corresponding log from a database according to a unique user identifier of the link tracking visualization request, and displaying data of the log according to a time stamp sequence of the log.
8. A link tracking device, wherein the device comprises:
the log storage module is used for generating a tracking record instance when a service request is received, wherein the tracking record instance is associated with a tracking identifier corresponding to the service request; when the service request is executed to a link node, a corresponding log is generated, and the log is pushed to different queues corresponding to the tracking record examples according to the service type, wherein the log comprises a time stamp for executing the service request; when the service request is executed, synchronizing the log in the queue to a database;
and the visualization tracking module is used for inquiring the corresponding log from the database according to the tracking identification of the link tracking visualization request when the link tracking visualization request is received, and sequentially displaying the data of the log according to the time stamp of the log.
9. An electronic device, the electronic device comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1 to 7.
10. A computer readable medium having stored thereon computer program instructions executable by a processor to implement the method of any of claims 1 to 7.
CN202310688138.4A 2023-06-12 2023-06-12 Link tracking method, device and computer readable medium Pending CN116932347A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310688138.4A CN116932347A (en) 2023-06-12 2023-06-12 Link tracking method, device and computer readable medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310688138.4A CN116932347A (en) 2023-06-12 2023-06-12 Link tracking method, device and computer readable medium

Publications (1)

Publication Number Publication Date
CN116932347A true CN116932347A (en) 2023-10-24

Family

ID=88381724

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310688138.4A Pending CN116932347A (en) 2023-06-12 2023-06-12 Link tracking method, device and computer readable medium

Country Status (1)

Country Link
CN (1) CN116932347A (en)

Similar Documents

Publication Publication Date Title
CN110162512B (en) Log retrieval method, device and storage medium
CN111339073A (en) Real-time data processing method and device, electronic equipment and readable storage medium
CN109815119B (en) APP link channel testing method and device
US20170364431A1 (en) Efficiently Debugging Software Code
CN112559475A (en) Data real-time capturing and transmitting method and system
CN111784318A (en) Data processing method and device, electronic equipment and storage medium
CN112445866A (en) Data processing method and device, computer readable medium and electronic equipment
CN113343312B (en) Page tamper-proof method and system based on front-end embedded point technology
CN113282583A (en) Data storage method, device, equipment and storage medium
CN111488386B (en) Data query method and device
US10990413B2 (en) Mainframe system structuring
CN114757157B (en) Method, apparatus, device and medium for generating an aircraft kit
US9286348B2 (en) Dynamic search system
CN116932347A (en) Link tracking method, device and computer readable medium
CN114217790A (en) Interface scheduling method and device, electronic equipment and medium
CN112818204A (en) Service processing method, device, equipment and storage medium
CN114371866A (en) Version reconfiguration test method, device and equipment of service system
CN110750569A (en) Data extraction method, device, equipment and storage medium
CN111639936A (en) Transaction information acquisition method and device, electronic equipment and readable storage medium
US12008017B2 (en) Replicating data across databases by utilizing validation functions for data completeness and sequencing
CN115760273A (en) Commodity label generating and displaying method, equipment and computer readable medium
CN116662448A (en) Automatic data synchronization method and device, electronic equipment and storage medium
CN115705257A (en) Failure reproduction method for application program, electronic device, and storage medium
CN115878574A (en) Enterprise development data processing method and device, electronic equipment and storage medium
CN114969201A (en) Data synchronization method and device, storage medium and electronic equipment

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