Point burying path reproduction method and system, storage medium and computer program product

Abstract

The embodiment of the invention provides a point burying path reproduction method and system, a storage medium and a computer program product. The method can comprise the steps that original burying point data in a target time period are obtained, target burying point data are extracted from the original burying point data, and each piece of target burying point data comprises a page jump source and a page identifier of a corresponding page; determining a jump sequence of pages corresponding to the target burying point data according to page jump sources and page identifiers contained in the target burying point data; and sorting the pages corresponding to the target burying point data based on the jump sequence to obtain a burying point path in the target time period. Through the technical scheme disclosed by the invention, the reproduction cost of technicians can be greatly reduced, and meanwhile, the reproduction efficiency is remarkably improved.

Description

Technical Field

[0001] The embodiments of the present disclosure relate to the field of data processing technology. More specifically, the embodiments of the present disclosure relate to a method, system, storage medium and computer program product for reproducing a burial point path. Background Art

[0002] This section is intended to provide a background or context to the embodiments of the disclosure that are recited in the claims. No description herein is admitted to be prior art by inclusion in this section.

[0003] The tracking path depicts the user's behavior trajectory in the process of using the service. Reproducing and analyzing the tracking path helps monitor user flow, understand user behavior patterns, and optimize products / services. Currently, the reproduction of the tracking path relies on tracking technology. Tracking technology is usually implemented by inserting specific codes at key interaction points and time triggers of the application. These codes are responsible for capturing user behavior data (hereinafter referred to as "tracking data") and sending it to a dedicated data collection and analysis platform for processing.

[0004] In the related technologies, when using tracking data to analyze user behavior and troubleshoot problems, technicians need to manually filter and extract important information fields from massive tracking data, and then reproduce the tracking path through manual analysis. This method is not only inefficient, but also requires technicians to have a high level of tracking knowledge in order to accurately extract and interpret the required fields from the huge tracking data set. Summary of the invention

[0005] In a first aspect of the embodiments of the present disclosure, a method for reproducing a buried point path is provided, comprising:

[0006] Obtaining original buried point data within a target time period, and extracting target buried point data from the original buried point data, each target buried point data including a page jump source and a page identifier of a corresponding page;

[0007] Determine the jump order of the pages corresponding to each target embedding data according to the page jump source and page identifier contained in each target embedding data;

[0008] The pages corresponding to the target burying point data are sorted based on the jump order to obtain the burying point path within the target time period.

[0009] Optionally, the page jump source of the corresponding page includes the identifier of the source page represented by the page jump source; determining the jump order of the pages corresponding to each target burying point data according to the page jump source and the page identifier contained in each target burying point data includes: determining the jump order of the pages corresponding to each target burying point data according to the identifier of the source page and the page identifier of the corresponding page.

[0010] Optionally, the page jump source of the corresponding page includes a target page element, which is displayed in the source page represented by the page jump source, and jumps from the source page to the corresponding page when the target page element is triggered; the method also includes: determining the conversion operations corresponding to each target burying point data according to the target page elements contained in each target burying point data, and adding the determined conversion operations to the burying point path.

[0011] Optionally, each of the target burying point data also includes page information of the corresponding page; the method also includes: rendering the target page corresponding to each target burying point data according to the page information contained in each target burying point data; sorting the pages corresponding to each target burying point data based on the jump order to obtain the burying point path within the target time period, including: sorting the rendered target pages based on the jump order to obtain a target page sequence, which is used to characterize the burying point path.

[0012] Optionally, the page information of the corresponding page includes the page route corresponding to the corresponding page and the interface link ID called by the corresponding page; the target page corresponding to any target burying point data is rendered according to the page information contained in any target burying point data, including: rendering the corresponding empty page according to the page route contained in any target burying point data; querying the target interface and the historical information returned by the target interface from the interface call record according to the interface link ID contained in any target burying point data; inserting the historical information into the corresponding empty page to generate the target page.

[0013] Optionally, the pages corresponding to the target buried point data are sorted based on the jump order to obtain the buried point path within the target time period, including: obtaining the timestamps corresponding to the target buried point data, and determining the buried point sequence according to the obtained timestamps; sorting the pages corresponding to the target buried point data according to the jump order and the buried point sequence to obtain the buried point path.

[0014] In a second aspect of the embodiments of the present disclosure, a system for reproducing a buried point path is provided, including:

[0015] A data extraction module is used to obtain the original buried point data within the target time period, and extract the target buried point data from the original buried point data, each target buried point data includes the page jump source and page identifier of the corresponding page;

[0016] A sequence determination module, used to determine the jump sequence of the pages corresponding to each target buried point data according to the page jump source and page identifier contained in each target buried point data;

[0017] The path generation module is used to sort the pages corresponding to the target buried point data based on the jump order to obtain the buried point path within the target time period.

[0018] In a third aspect of the embodiments of the present disclosure, there is provided an electronic device, including:

[0019] processor;

[0020] a memory for storing instructions executable by the processor;

[0021] The processor implements any method described in the first aspect by running the executable instructions.

[0022] In a fourth aspect of the embodiments of the present disclosure, a computer-readable storage medium is provided, on which computer instructions are stored, and when the instructions are executed by a processor, the method described in any one of the first aspects is implemented.

[0023] In a fifth aspect of the embodiments of the present disclosure, a computer program product is provided, comprising a computer program / instruction, which, when executed by a processor, implements the steps of any method described in the first aspect.

[0024] The above embodiments of the present disclosure have at least the following beneficial effects:

[0025] The buried point code inserted into each page of the disclosed solution has the ability to capture the page identifier and page jump source of the corresponding page. Therefore, when reproducing the user's buried point path, the target buried point data can be first extracted from the acquired original buried point data, and each target buried point data includes the page jump source and page identifier of the corresponding page. Therefore, according to the page jump source and page identifier contained in each target buried point data, the jump order of the page corresponding to each target buried point data can be accurately determined, and then the pages corresponding to each target buried point data can be sorted according to the jump order, and the buried point path can be reproduced. The disclosed implementation method can realize the automatic reproduction of the buried point path without the need for technical personnel to manually screen and analyze the buried point data, which greatly reduces the reproduction cost of technical personnel and significantly improves the reproduction efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] The above and other objects, features and advantages of the exemplary embodiments of the present disclosure will become readily understood by reading the detailed description below with reference to the accompanying drawings. In the accompanying drawings, several embodiments of the present disclosure are shown in an exemplary and non-limiting manner, in which:

[0027] Figure 1 This is a schematic diagram of the architecture of a system for reproducing a burial point path provided by an exemplary embodiment;

[0028] Figure 2 It is a flow chart of a method for reproducing a buried point path provided by an exemplary embodiment;

[0029] Figure 3 is a schematic diagram of a target page element provided by an exemplary embodiment;

[0030] Figure 4 It is a schematic diagram of a system for reproducing a buried point path provided by an exemplary embodiment;

[0031] Figure 5 This is a schematic diagram of the entire process of reproducing a point-burying path provided by an exemplary embodiment;

[0032] Figure 6 It is a block diagram of a device for reproducing a buried point path provided by an exemplary embodiment;

[0033] Figure 7 is a schematic diagram of a readable storage medium corresponding to the above method provided by an exemplary embodiment;

[0034] Figure 8 It is a schematic diagram of an electronic device capable of implementing the above method provided by an exemplary embodiment.

[0035] In the drawings, the same or corresponding reference numerals represent the same or corresponding parts. DETAILED DESCRIPTION

[0036] The principles and spirit of the present disclosure will be described below with reference to several exemplary embodiments. It should be understood that these embodiments are provided only to enable those skilled in the art to better understand and implement the present disclosure, and are not intended to limit the scope of the present disclosure in any way. On the contrary, these embodiments are provided to make the present disclosure more thorough and complete, and to fully convey the scope of the present disclosure to those skilled in the art.

[0037] Those skilled in the art know that the embodiments of the present disclosure can be implemented as a system, device, equipment, method or computer-readable storage medium. Therefore, the present disclosure can be specifically implemented in the following forms, namely: complete hardware, complete software (including firmware, resident software, microcode, etc.), or a combination of hardware and software.

[0038] According to an embodiment of the present disclosure, a method, system, storage medium and computer program product for reproducing a burial point path are proposed.

[0039] In this document, it should be understood that any number of elements in the drawings is for illustration and not limitation, and any naming is only for distinction and does not have any limiting meaning. In addition, the data involved in this disclosure may be data authorized by the user or fully authorized by all parties.

[0040] The principle and spirit of the present disclosure are explained in detail below with reference to several representative embodiments of the present disclosure.

[0041] Application Scenario Overview

[0042] In digital marketing and website analytics scenarios, a collection of a series of user access behaviors from contact with a product / service to the final completion of a target action (such as registration, purchase, subscription, etc.) is usually defined as a "point-burying path". The point-burying path depicts the user's behavioral trajectory in the process of using the service. Therefore, reproducing and analyzing the point-burying path helps monitor user flows, understand user behavior patterns, and optimize products / services. Currently, the reproduction of the point-burying path relies on point-burying technology. Point-burying technology is usually implemented by inserting specific codes at key interaction points and time triggers of the application. These codes are responsible for capturing user behavior data (hereinafter referred to as "point-burying data") and sending it to a dedicated data collection and analysis platform for processing.

[0043] In the related technology, in the process of using buried data to analyze user behavior and troubleshoot problems, technicians can usually only reproduce the path through the text content corresponding to the buried data. Specifically, technicians manually screen and extract important information fields from massive amounts of buried data, such as extracting information fields about user operation behaviors (clicks or slides, etc.), unique identifiers of user-opened pages, and the time when buried data is uploaded, and then manually analyze the extracted information fields to reproduce the buried path. This method is not only inefficient, but also requires technicians to have a high level of buried knowledge (for example, they need to clearly understand the meaning and value rules of each field in the buried data) in order to accurately extract and interpret the required fields from the huge buried data set.

[0044] This shows that in the scenario of reproducing the tracking path, the technicians may not have enough professional knowledge, resulting in the inability to reproduce or incorrect reproduction, and there may also be problems with low efficiency in path reproduction.

[0045] It should be noted that the above application scenarios are only shown to facilitate understanding of the spirit and principle of the present disclosure, and the embodiments of the present disclosure are not limited in this respect. On the contrary, the embodiments of the present disclosure can be applied to any applicable scenario. SUMMARY OF THE INVENTION

[0047] In view of this, this specification provides a technical solution for reproducing the tracking path.

[0048] The core concept of this specification is that the embedding code inserted into each page has the ability to capture the page identifier and page jump source of the corresponding page. When reproducing the user's embedding path, the target embedding data can be extracted from the massive original embedding data, and each target embedding data includes a page identifier and a page jump source. Therefore, according to the page jump source and page identifier contained in each target embedding data, the jump order of the page corresponding to each target embedding data can be accurately determined, and then the pages corresponding to each target embedding data can be sorted according to the jump order, and the embedding path can be reproduced. The disclosed embodiment can realize the automatic reproduction of the embedding path, without the need for technical personnel to manually screen and analyze the embedding data, and without the need for technical personnel to have a high level of embedding knowledge, which greatly reduces the reproduction cost of technical personnel and significantly improves the reproduction efficiency.

[0049] Exemplary Methods

[0050] The following will (combined with Figure 1 The system architecture diagram shown in the figure) describes the technical concept of this specification in detail through specific embodiments.

[0051]

System Architecture

[0052] In the embodiments of the present disclosure, the terminal may be an electronic device used by a user. The terminal may specifically include but is not limited to a smart phone, a desktop computer, a tablet computer, a laptop computer, an e-book reader, a smart watch, a smart bracelet, and other electronic devices with certain computing capabilities, and the electronic device may run software or websites of instant messaging, social networking, gaming, education, and other categories, and may be applied to scenarios of multi-person audio and video calls.

[0053] The server may include a server, a server cluster formed by multiple servers, or a cloud server. The server may be an independent physical server, a server cluster or a distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN (Content Delivery Network), and big data and artificial intelligence platforms.

[0054] The terminal and the server may be connected directly or indirectly via wired communication or wireless communication, which is not particularly limited in the present disclosure.

[0055] based on Figure 1 As shown in the system architecture diagram, the point-burying path reproduction system includes a server and a terminal. The terminal can obtain the original point-burying data within the target time period and upload the obtained data to the server. The server can extract the target point-burying data from the received original point-burying data, and determine the jump order of the corresponding pages according to the target point-burying data, and then sort the corresponding pages according to the jump order to generate the point-burying path within the target time period. The server can return the generated point-burying path to the terminal that submitted the original point-burying data, so that the terminal can display the point-burying path to the data analysis party.

[0056] In one embodiment of the present disclosure, the system for reproducing the buried point path may also include a terminal. The terminal may obtain the original buried point data within the target time period, and extract the target buried point data therefrom, and then determine the jump order of each page according to the target buried point data, and then sort the corresponding pages based on the jump order to generate the buried point path within the target time period.

[0057] The following will take the method for reproducing the tracking path provided by the embodiment of the present disclosure as an example to illustrate the exemplary embodiment. Figure 2 , Figure 2 This is a flow chart of a method for reproducing a buried point path provided by an exemplary embodiment. The method may include the following steps:

[0058] Step 201: Acquire the original buried point data within the target time period, and extract the target buried point data from the original buried point data, each target buried point data includes the page jump source and page identifier of the corresponding page.

[0059] The original buried data can be understood as all user behavior data captured by the buried code, including but not limited to: user operation behavior data in the page (click or slide, etc.), buried data upload time, user ID, user device information, user attribute information (such as age, gender, membership level, etc.). It should be noted that the buried code in the disclosed solution has the ability to capture page identifiers and page jump sources, so the original buried data will include the page identifiers and page jump sources of each page visited by the user. The present disclosure does not limit the data format of the original buried data, and a specific or universal data format can be used to represent the page identifier and page jump source. Among them, the page identifier refers to the information used to uniquely identify a specific page in a web page or application. Each page has a unique identifier, and a custom identifier, page title or other information can be used as a page identifier, which is not limited in the present disclosure. The page jump source refers to the page where the user was before accessing the current page. The jump relationship between each page can be determined based on the page jump source. The present disclosure does not specifically limit the specific form of the page jump source, such as the URL parameter of the page or a custom string can be used to represent the page jump source.

[0060] The target time period can be determined based on the actual needs of the data analyst. For example, if the developer of a product wants to know the access path and order rate of the product during the promotion period, the target time period can be the time period corresponding to the entire promotion period. For another example, when an exception occurs during the use of a service, the target time period can be the period before and after the exception occurs. For example, if an exception occurs at 10:00, the target time period can be 9:50-10:00.

[0061] It is understandable that when a user visits a page, the buried point code inserted in the page will record the relevant buried point data and send it to the corresponding buried point data collection system / platform. Therefore, in the process of reproducing the buried point path, the original buried point data within the target time period can be obtained from the buried point data collection system / platform. It should be noted that the buried point data collection system and the buried point path reproduction system can be deployed on different devices respectively, or on the same device, and the present disclosure is not limited to this. After obtaining the original buried point data within the target time period, the target buried point data is extracted therefrom. In this embodiment, each target buried point data corresponds to a page, and each target buried point data includes the page jump source and page identifier of the corresponding page. Exemplarily, it can be extracted according to the field of the target buried point data. When developing the buried point code, standardized fields can be used to define different buried point data, and then the target buried point data can be extracted according to the corresponding fields during the extraction process. For example, the data of the page jump source is represented by the source field, so during the extraction process, the buried point data corresponding to the source field can be extracted from the original buried point data. The above is only an example, and the extraction can also be performed in other ways, which is not limited in the present disclosure.

[0062] It should be noted that if you want to reproduce the tracking path of a specific user, you can extract the target tracking data based on the user ID of the specific user. In this way, the tracking path of the specific user can be obtained by reproducing the path based on the extracted target tracking data, so as to analyze the behavior of the specific user based on the tracking path.

[0063] Step 202: Determine the jump order of the pages corresponding to each target embedding data according to the page jump source and page identifier contained in each target embedding data.

[0064] Exemplarily, for any target embedding data, the corresponding page (hereinafter referred to as "current page") is determined according to the page identifier contained in the target embedding data, and the previous page of the current page is determined according to the page jump source contained in the target embedding data. In this way, the jump order of the pages corresponding to each target embedding data can be determined according to the page jump source and page identifier contained in each target embedding data.

[0065] In some possible implementations, the page jump source of each page may include the identifier of the source page represented by the page jump source. For example, if you jump from page A to page B, the target embedding data corresponding to page B includes the page identifier of page B and the page jump source, and the page jump source may be the page identifier of the source page (i.e., page A). In this case, when determining the jump order of the pages corresponding to each target embedding data, the jump order can be determined directly based on the page identifier of each page and the page identifier of the corresponding source page. Table 1 is a schematic table of target embedding data provided by an exemplary embodiment:

[0066] Table 1

[0067] Target point data Page Identification Page jump source Target burial point data 1 [a] none Target point data 2 [b] [d] Target point data 3 [c] [a] Target point data 4 [d] [c]

[0068] As shown in Table 1, the page jump source contained in each target buried data includes the page identifier of the source page. The page corresponding to the target buried data 1 is page a, which has no page jump source, so it can be determined that page a is the first page. The page corresponding to the target buried data 2 is page b. According to the page jump source, it is determined that the source page of page b is page d (that is, jump from page d to page b). Similarly, based on the target buried data 1 to 4, the jump order of pages a, b, c, and d can be determined as follows: jump from page a to page c, jump from page c to page d, and jump from page d to page b.

[0069] In this embodiment, by assigning a page identifier to each page, the page identifier of the source page is used as the page jump source, which helps to simplify the management and development of the target embedding data, reduce the amount of data that needs to be processed during the reproduction process, and improve the reproduction efficiency. In addition, since the page identifier of each page is unique, the above method can determine the accurate jump order and avoid the situation where the jump order analysis is wrong due to the overly complex page jump source.

[0070] Step 203: Sort the pages corresponding to the target burying point data based on the jump order to obtain the burying point path within the target time period.

[0071] In combination with the embodiment shown in Table 1, by sorting pages a to d based on the determined jump order, it can be obtained that the embedding path within the target time period is: page a→page c→page d→page b.

[0072] In the above embodiment, the embedding code inserted in each page has the ability to capture the page identifier and page jump source of the corresponding page. Therefore, when reproducing the user's embedding path, the terminal can extract the target embedding data (each target embedding data includes a page identifier and a page jump source) from the massive original embedding data. Furthermore, according to the page jump source and page identifier contained in each target embedding data, the jump order of the page corresponding to each target embedding data can be accurately determined, and the pages corresponding to each target embedding data can be sorted according to the jump order, so that the embedding path can be reproduced. The disclosed embodiment can realize the automatic reproduction of the embedding path, without the need for technical personnel to manually screen and analyze the embedding data, and without the need for technical personnel to have a high level of embedding knowledge, which greatly reduces the reproduction cost of technical personnel and significantly improves the reproduction efficiency.

[0073] In some possible implementations, the developed tracking code can capture the data of the target page element that triggers the page jump. In this way, the page jump source contained in the extracted target tracking data can include the target page element. The target page element is displayed in the source page, and when triggered, it jumps from the source page to the corresponding page corresponding to the target tracking data. The page element can be understood as a control or gesture operation displayed on the page. Figure 3 This is a schematic diagram of a target page element provided by an exemplary embodiment. Combined with the embodiment shown in Table 1, page a includes page elements 1 to 6, and the user clicks on page element 6 to enter page c, and page element 6 is the target page element. Then, for page c, its corresponding target embedding data 3 may include: page identifier [c], page jump source (source page identifier [a] + target page element 6).

[0074] In this case, while generating the embedding path, the conversion operation corresponding to each target embedding data can also be determined based on the target page elements contained in each target embedding data. Figure 3 , the conversion operation of the target buried point data 3 can be determined as clicking the target page element c according to the target page element c. In addition, the conversion operation can also include gesture operations or corresponding controls, and the present disclosure does not specifically limit the conversion operation. Further, the determined conversion operation can be added to the buried point path. Combined with the embodiment shown in Table 1, the buried point path can be page a-click page element 6 → page c-swipe up → page d-double-click page element 9 → page b.

[0075] In this embodiment, the data of the target page element that triggers the page jump is used as part of the page jump source, and then when reproducing the buried point path, the specific conversion operation is determined according to the target page element. Adding the analyzed conversion operation to the buried point path can effectively expand the richness of the content contained in the buried point path, so as to analyze the abnormal reasons or user behavior patterns based on the user's conversion operation, and then optimize the strategy according to the analysis results.

[0076] In some possible implementations, the developed tracking code can capture the page information of the page visited by the user. In this way, the extracted target tracking data can also include the page information of the corresponding page. The page information can be used to render the corresponding page, including but not limited to: page metadata (such as page description information, the creator of the page content, the page creation time and update time, etc.), page type, page structured data (such as Open Graph protocol, Schema.org markup, etc.), page source information.

[0077] In the process of reproducing the buried point path, the target page corresponding to each target buried point data can be rendered according to the page information contained in each target buried point data, and the rendered target pages can be sorted according to the determined jump order to obtain a target page sequence. The target page sequence can be used to characterize the buried point path within the target time period. Exemplarily, any target buried point data can be selected for page rendering to obtain the target page corresponding to the target buried point data (hereinafter referred to as the "current page"). Then, the previous page of the current page is determined according to the page jump source of the current page. The target buried point data corresponding to the previous page is searched from the extracted target buried point data to render the previous page based on the page information contained in the target buried point data. After obtaining the previous page, the previous page is arranged before the current page. Alternatively, the next page of the current page is determined according to the page identifier of the current page and the page jump source contained in other target buried point data, and then the next page is rendered. By analogy, a target page sequence is obtained. In another embodiment, the target pages corresponding to all target embedding data may be rendered first, and then all target pages may be sorted according to the page identifiers and page jump sources contained in each target embedding data. The present disclosure does not specifically limit the specific rendering and sorting methods.

[0078] This embodiment realizes the visualization of the buried point path by rendering the target page corresponding to the target buried point data. In this way, the page content seen by the user when accessing can be further restored during the analysis of the buried point data, so that the data analyst can understand the buried point path more intuitively and clearly, and analyze whether there is any abnormality in the page content of the page visited by the user.

[0079] In some possible implementations, the page information of the corresponding page may include the page route corresponding to the corresponding page and the interface link ID called by the corresponding page. Page routing is usually used to describe the mapping relationship between terminal requests and server processing, which determines which page needs to be displayed or which operations need to be performed when a user initiates an access request. In this embodiment, URL (Uniform Resource Location) or protocol link can be used to represent page routing. Among them, when the embedded code is inserted into an application and the application has its own end-to-end page, the page route may be a protocol link. When a user accesses a page, the gateway layer usually generates and stores a unique interface link ID for the interface call involved in the access process, and the interface link ID can be used to uniquely identify this interface call. In other words, the detailed information in the corresponding call process can be queried based on the interface link ID later, and the detailed information includes but is not limited to: the timestamp of the user's access request, the client IP address, the interface name / path, the interface link ID, the request parameters, the response status code, and the complete JSON data returned by the interface during the call.

[0080] Exemplarily, in the process of rendering the corresponding target page based on the page information contained in any target tracking data, the corresponding empty page can be rendered in the simulator according to the page route contained in the page information. Then, according to the interface link ID contained in the page information, the historical information returned by the target interface and the target interface is queried from the interface call record stored in the gateway layer. The historical information may include the complete JSON data returned by the target interface during the call process. The queried historical information is inserted into the empty page to generate the target page.

[0081] In the above process, an empty page is rendered based on the page routing, and the historical information corresponding to the interface link ID is inserted into the empty page. In this way, the page style and page content displayed during the user access process can be effectively restored, the page browsed during the user access process can be replicated, and the accuracy of the restored page can be improved.

[0082] In some possible implementations, the timestamps corresponding to each target buried point data can also be obtained from the original buried point data, and the timestamps are used to characterize the moment when the target buried point data is captured. It can be understood that when a user generates an access behavior, the terminal can capture the corresponding buried point data. Therefore, the timestamp corresponding to the target buried point data can reflect the moment when the corresponding user access behavior is generated. Furthermore, the time sequence of each target buried point data (hereinafter referred to as "buried point sequence") can be determined based on the acquired timestamp. Then, the pages corresponding to each target buried point data can be sorted according to the buried point sequence and the jump order of each page to obtain the buried point path. Table 2 is a schematic table of target buried point data provided by an exemplary embodiment:

[0083] Table 2

[0084] Target point data Page Identification Page jump source Timestamp Target burial point data 1 [a] none 100002 Target point data 2 [b] [d] 100035 Target point data 3 [c] [a] 100010 Target point data 4 [d] [c] 100020 Target point data 5 [c] [d] 100045 Target point data 6 [d] [b] 100042

[0085] In Table 2, there are 6 target buried point data in the target time period 10:00-10:01. Based on the target buried point data 1, it can be determined that page a is the first page of the buried point path. The jump order determined based on the target buried point data 2 is: jump from page d to page b. The jump order determined based on the target buried point data 3 is: jump from page a to page c. The jump order determined based on the target buried point data 4 is: jump from page c to page d. The jump order determined based on the target buried point data 5 is: jump from page d to page c. The jump order determined based on the target buried point data 6 is: jump from page b to page d. Obviously, a unique buried point path cannot be determined based on the page jump order alone. This is because there may be an operation of returning to the previous page during the user's access process, resulting in the same page identifier contained in multiple target buried point data. In this case, each page can be further arranged in combination with the buried point timing of the target buried point data. In Table 2, the larger the value of the timestamp corresponding to the target buried data, the later the target buried data was captured. Therefore, the buried data sequence is target buried data 1 → target buried data 3 → target buried data 4 → target buried data 2 → target buried data 6 → target buried data 5. By sorting each page based on the buried data sequence and page jump order, it can be determined that the buried data path is: page a → page c → page d → page b → page d → page c.

[0086] In the above implementation, sorting each page according to the timestamp and page jump order corresponding to the target buried point data helps to further improve the accuracy of the reproduced buried point path. In particular, when the page identifiers contained in multiple target buried point data are the same, the access order of each page can be further accurately determined according to the timestamp corresponding to the target buried point data.

[0087] Corresponding to the above-mentioned method for reproducing the buried point path, in another embodiment of the present disclosure, a system for reproducing the buried point path is also provided, and the above-mentioned method for reproducing the buried point path can be implemented through the reproduction system.

[0088] Figure 4 This is a schematic diagram of a module of a system for reproducing a burrowing path provided by an exemplary embodiment. Figure 4, the reproduction system may include a data extraction module 402, a sequence determination module 404, and a path generation module 406. Among them, the data extraction module 402 can obtain the original buried point data within the target time period, and extract the target buried point data from the original buried point data. The data extraction module 402 passes the extracted target buried point data to the sequence determination module 404. The sequence determination module 404 can determine the jump order of the pages corresponding to each target buried point data according to the page jump source and page identifier contained in each target buried point data, and send the determined jump order to the path generation module 406. The path generation module 406 can sort the pages corresponding to each target buried point data according to the jump order to generate a buried point path within the target time period.

[0089] In one embodiment, the reproduction system of the buried point path may further include a conversion operation determination module 408. The data extraction module 402 may send the extracted target buried point data to the conversion operation determination module 408, so that the conversion operation determination module 408 determines the conversion operation corresponding to each target buried point data based on the target page element contained in each target buried point data, and sends the determined conversion operation to the path generation module 406. The path generation module 406 may add the received conversion operation to the corresponding position in the buried point path.

[0090] In one embodiment, the reproduction system of the buried point path may further include a page rendering module 410. The data extraction module 402 may send the extracted target buried point data to the page rendering module 410, so that the page rendering module 410 renders the corresponding target page according to the page information contained in each target buried point data, and sends the target page to the path generation module 406. The path generation module 406 may sort the received target pages according to the jump order to obtain a target page sequence.

[0091] Figure 5 This is a schematic diagram of the entire process of reproducing the tracking path provided by an exemplary embodiment. Figure 5 , the developed tracking code can capture the page ID of the visited page, the page jump source, the page route, and the interface link ID of the page call. During the user access process, the user first visits page A, and then jumps from page A to page B. The subsequent jump process is not expanded here. Every time a user visits a page, the terminal will capture the original tracking data corresponding to the page, and upload the captured original tracking data to the tracking feedback system. In this embodiment, the tracking feedback system is used to collect the original tracking data. It can be a self-built data collection system or a third-party data collection platform. This disclosure is not limited to this.

[0092] The following is an explanation of the process of reproducing the buried point path:

[0093] Step (1): The path reproduction system can obtain the original buried point data within the target time period from the buried point feedback system, and then extract the target buried point data from the obtained original buried point data. In this embodiment, each target buried point data includes the page ID of the corresponding page, the page jump source, the page route, and the interface link ID of the page call.

[0094] Step (2): The path reproduction system can select any target tracking data (taking the target tracking data corresponding to page B as an example), render a corresponding empty page in the simulator according to the page route contained in the target tracking data, and query the historical information of the target interface and the target interface return from the interface call record stored in the gateway layer according to the interface link ID contained in the target tracking data. Then, insert the queried historical information into the rendered empty page to restore the page corresponding to the target tracking data. Assume that the target page RB is restored first, and the target page corresponds to page B during the user's access process.

[0095] Step (3): The path reproduction system determines the previous page of page B and the target page element for jumping from the previous page to page B based on the page jump source contained in the target buried point data corresponding to page B. Similarly, the next page of page B and the target page element for jumping from page B to the next page are determined. Similarly, the context information of each page corresponding to each target buried point data is constructed, and the context information indicates the jump order of each page.

[0096] Step (4): Search for target buried data corresponding to pages other than page B based on the context information constructed in step (3), and restore other pages through the operation of step (2). Figure 5 The restored page RA is shown in , which corresponds to the page A during the user's access process.

[0097] Step (5): Determine the target embedding point sequence according to the timestamp of each target embedding point data, and sort the restored pages based on the embedding point sequence and the context information constructed in step (3) to obtain the target page sequence within the target time period.

[0098] In this way, the target tracking data can be restored into a visual image set that includes user operations, which greatly reduces the reproduction cost of technicians and improves the convenience of troubleshooting abnormal causes.

[0099] Exemplary Devices

[0100] In an exemplary embodiment of the present disclosure, a device for reproducing a buried point path is also provided.

[0101] See also Figure 6 , Figure 6It is a block diagram of a device for reproducing a buried point path provided by an exemplary embodiment.

[0102] like Figure 6 As shown, the device 600 for reproducing the buried point path may include: an acquisition module 601, a determination module 602 and a sorting module 603. Among them:

[0103] The acquisition module 601 is used to acquire the original buried point data within the target time period, and extract the target buried point data from the original buried point data. Each target buried point data includes the page jump source and page identifier of the corresponding page.

[0104] The determination module 602 is used to determine the jump order of the pages corresponding to each target burying point data according to the page jump source and page identifier contained in each target burying point data.

[0105] The sorting module 603 is used to sort the pages corresponding to the target burying point data based on the jump order to obtain the burying point path within the target time period.

[0106] In one embodiment, the page jump source of the corresponding page includes the identifier of the source page represented by the page jump source; the determination module 602 is specifically used to determine the jump order of the pages corresponding to each target buried point data according to the identifier of the source page and the page identifier of the corresponding page.

[0107] In one embodiment, the page jump source of the corresponding page includes a target page element, the target page element is displayed in a source page represented by the page jump source, and jumps from the source page to the corresponding page when the target page element is triggered;

[0108] The device also includes:

[0109] The conversion operation determination module 604 is used to determine the conversion operation corresponding to each target embedding data according to the target page element contained in each target embedding data, and add the determined conversion operation to the embedding path.

[0110] In one embodiment, each of the target embedding data further includes page information of the corresponding page;

[0111] The device also includes:

[0112] The rendering module 605 is used to render the target page corresponding to each target burying point data according to the page information contained in each target burying point data;

[0113] The sorting module 603 is specifically used to sort the rendered target pages based on the jump order to obtain a target page sequence, and the target page sequence is used to characterize the embedding path.

[0114] In one embodiment, the page information of the corresponding page includes the page route corresponding to the corresponding page and the interface link ID called by the corresponding page; the rendering module 605 is specifically used to: render the corresponding empty page according to the page route contained in any target burying point data; query the target interface and the historical information returned by the target interface from the interface call record according to the interface link ID contained in any target burying point data; insert the historical information into the corresponding empty page to generate the target page.

[0115] In one embodiment, the sorting module 603 is specifically used to: obtain the timestamps corresponding to each target burial point data, and determine the burial point sequence according to the obtained timestamps; sort the pages corresponding to each target burial point data according to the jump order and the burial point sequence to obtain the burial point path.

[0116] The specific details of each module of the above-mentioned burial point path reproduction device 600 have been described in detail in the previous description of the burial point path reproduction method process, so they will not be repeated here.

[0117] It should be noted that although several modules or units of the device 600 for reproducing the buried point path are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiment of the present disclosure, the features and functions of two or more modules or units described above can be concretized in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided into multiple modules or units for concretization.

[0118] Exemplary Media

[0119] In an exemplary embodiment of the present disclosure, a computer-readable storage medium is also provided, on which a program product capable of implementing the above method of the present specification is stored. In some possible embodiments, various aspects of the present disclosure may also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to enable the terminal device to perform the steps according to various exemplary embodiments of the present disclosure described in the above "Exemplary Method" section of the present specification.

[0120] See also Figure 7 , Figure 7 It is a schematic diagram of a readable storage medium corresponding to a method for reproducing a burial point path provided by an exemplary embodiment.

[0121] refer to Figure 7 As shown, a readable storage medium 700 for implementing the above method according to an embodiment of the present disclosure is described, which can adopt a portable compact disk read-only memory (CD-ROM) and include program code, and can be run on a terminal device, such as a personal computer. However, the readable storage medium of the present disclosure is not limited thereto. In the present disclosure, the readable storage medium can be any tangible medium containing or storing a program, which can be used by or in combination with an instruction execution system, an apparatus or a device.

[0122] The readable storage medium can adopt any combination of one or more readable media. The readable medium can be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but not limited to, a system, device or device of electricity, magnetism, light, electromagnetic, infrared, or semiconductor, or any combination of the above. More specific examples (non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0123] Computer readable signal media may include data signals propagated in baseband or as part of a carrier wave, in which readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Readable signal media may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0124] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.

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

[0126] Exemplary Electronic Devices

[0127] In an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above-mentioned method for reproducing the buried point path is also provided.

[0128] See also Figure 8 , Figure 8 It is a schematic diagram of an electronic device capable of implementing the above method provided by an exemplary embodiment.

[0129] Refer to the following Figure 8 800 according to this embodiment of the present disclosure is described. Figure 8 The electronic device 800 shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0130] like Figure 8 As shown, the electronic device 800 is in the form of a general computing device. The components of the electronic device 800 may include but are not limited to: at least one processing unit 801, at least one storage unit 802, and a bus 803 connecting different system components (including the storage unit 802 and the processing unit 801).

[0131] The storage unit stores program codes, and the program codes can be executed by the processing unit 801, so that the processing unit 801 executes the steps of the above-mentioned various embodiments of this specification.

[0132] The storage unit 802 may include a readable medium in the form of a volatile storage unit, such as a random access storage unit (RAM) 8021 and / or a cache storage unit 8022 , and may further include a read-only storage unit (ROM) 8023 .

[0133] The storage unit 802 may also include a program / utility 8024 having a set (at least one) of program modules 8025, such program modules 8025 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include the reality of a network environment.

[0134] Bus 803 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

[0135] The electronic device 800 may also communicate with one or more external devices 804 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device 800, and / or communicate with any device that enables the electronic device 800 to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input / output (I / O) interface 805. Furthermore, the electronic device 800 may also communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) via a network adapter 806. As shown, the network adapter 806 communicates with other modules of the electronic device 800 via a bus 803. It should be understood that although Figure 8 Not shown, other hardware and / or software modules may be used in conjunction with electronic device 800, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0136] Exemplary computer program products

[0137] In an exemplary embodiment of the present disclosure, a computer program product is further provided, including a computer program / instruction, which implements the steps of the method described in any of the above embodiments when executed by a processor.

[0138] Through the description of the above embodiments, it is easy for those skilled in the art to understand that the example embodiments described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the embodiment of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiment of the present disclosure.

[0139] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the present disclosure that follow the general principles of the present disclosure and include common knowledge or customary technical means in the art that are not disclosed in the present disclosure. The specification and examples are to be considered exemplary only, and the true scope and spirit of the present disclosure are indicated by the claims.

[0140] It should be noted that, although several units / modules or subunits / modules of the device are mentioned in the above detailed description, this division is merely exemplary and not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more units / modules described above can be embodied in one unit / module. Conversely, the features and functions of one unit / module described above can be further divided into multiple units / modules to be embodied.

[0141] In addition, although the operations of the disclosed method are described in a specific order in the drawings, this does not require or imply that the operations must be performed in this specific order, or that all the operations shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps.

[0142] Although the spirit and principle of the present disclosure have been described with reference to several specific embodiments, it should be understood that the present disclosure is not limited to the disclosed specific embodiments, and the division of various aspects does not mean that the features in these aspects cannot be combined to benefit, and such division is only for the convenience of expression. The present disclosure is intended to cover various modifications and equivalent arrangements included in the spirit and scope of the attached claims.

Claims

1. A method for reproducing a buried point path, characterized in that: The method includes: Obtaining original buried point data within a target time period, and extracting target buried point data from the original buried point data, each target buried point data including a page jump source and a page identifier of a corresponding page; Determine the jump order of the pages corresponding to each target embedding data according to the page jump source and page identifier contained in each target embedding data; The pages corresponding to the target burying point data are sorted based on the jump order to obtain the burying point path within the target time period.

2. The method according to claim 1, characterized in that The page jump source of the corresponding page includes an identifier of a source page represented by the page jump source; The step of determining the jump order of the pages corresponding to the target embedding data according to the page jump source and the page identifier contained in each target embedding data includes: The jump order of the pages corresponding to each target embedding data is determined according to the identifier of the source page and the page identifier of the corresponding page.

3. The method according to claim 1, characterized in that The page jump source of the corresponding page includes a target page element, the target page element is displayed in a source page represented by the page jump source, and jumps from the source page to the corresponding page when the target page element is triggered; The method also includes: determining the conversion operations corresponding to each target embedding data according to the target page elements contained in each target embedding data, and adding the determined conversion operations to the embedding path.

4. The method according to claim 1, characterized in that: Each of the target embedding data also includes page information of the corresponding page; The method further includes: rendering a target page corresponding to each target burying point data according to the page information contained in each target burying point data; The method of sorting the pages corresponding to the target burying point data based on the jump order to obtain the burying point path within the target time period includes: sorting the rendered target pages based on the jump order to obtain a target page sequence, which is used to characterize the burying point path.

5. The method according to claim 4, characterized in that The page information of the corresponding page includes the page route corresponding to the corresponding page and the interface link ID called by the corresponding page; Rendering a target page corresponding to any target tracking data according to the page information contained in any target tracking data includes: Render a corresponding empty page according to the page route contained in any of the target tracking data; Query the target interface and the historical information returned by the target interface from the interface call record according to the interface link ID contained in any of the target tracking data; The historical information is inserted into the corresponding empty page to generate the target page.

6. The method according to claim 1, characterized in that The sorting of pages corresponding to the target tracking data based on the jump order to obtain the tracking path within the target time period includes: Obtain the timestamps corresponding to each target tracking point data, and determine the tracking point timing according to the obtained timestamps; The pages corresponding to the target burying point data are sorted according to the jump order and the burying point timing to obtain the burying point path.

7. A system for reproducing a buried point path, characterized in that: The system includes: A data extraction module is used to obtain the original buried point data within the target time period, and extract the target buried point data from the original buried point data, each target buried point data includes the page jump source and page identifier of the corresponding page; A sequence determination module, used to determine the jump sequence of the pages corresponding to each target buried point data according to the page jump source and page identifier contained in each target buried point data; The path generation module is used to sort the pages corresponding to the target buried point data based on the jump order to obtain the buried point path within the target time period.

8. An electronic device, characterized in that: include: processor; a memory for storing instructions executable by the processor; The processor implements the method according to any one of claims 1 to 6 by running the executable instructions.

9. A computer-readable storage medium having computer instructions stored thereon, characterized in that: When the instruction is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

10. A computer program product, characterized in that The method comprises a computer program / instruction, which, when executed by a processor, implements the steps of the method according to any one of claims 1 to 6.

Images