Page jump link recording method and device, electronic equipment and storage medium

Abstract

The invention relates to a page jump link recording method and device, electronic equipment and a storage medium, and the method comprises the steps: responding to a jump instruction for jumping to a target page, and judging whether the target page is marked as a reset page or not; if the target page is marked as a reset page, clearing a page jump link recorded until the current moment, and recording a new page jump link again by taking the target page as a starting page; and if the target page is a link record end point page, ending the page jump link record, and reporting an obtained final page jump link to a server. By adopting the technical scheme provided by the invention, the redundancy of the page jump link can be reduced, the difficulty of analyzing the subsequent page jump link is reduced, and accurate and efficient data analysis and application optimization on the application program are facilitated.

Description

Technical Field

[0001] The present disclosure relates to the field of Internet technology, and in particular to a method, device, electronic device and storage medium for recording page jump links. Background Art

[0002] In Internet applications, page jump links are of great significance. They can clearly present the user's browsing links and behavior trajectories within the application, and help to deeply analyze the problems in the current application page design, page connection, etc.

[0003] At present, the page jump link recording method is to set a unique identifier for each page, and each time the user enters a new page, the identifier is added to the end of the existing page jump link, thereby realizing full link recording. However, in actual applications, users may frequently jump back and forth between specific pages, which will rapidly increase the length of the page jump link, including a large amount of redundant information, making it difficult to analyze and process the page jump link later, which is not conducive to accurate and efficient data analysis and application optimization of the application. Summary of the invention

[0004] In order to solve the above technical problem or at least partially solve the above technical problem, the present disclosure provides a page jump link recording method, device, electronic device and storage medium.

[0005] In a first aspect, the present disclosure provides a method for recording a page jump link, comprising:

[0006] In response to a jump instruction to jump to a target page, determining whether the target page is marked as a reset page;

[0007] If the target page is marked as a reset page, clear the page jump links recorded up to the current moment, take the target page as the starting page, and re-record a new page jump link;

[0008] If the target page is the end page of the link record, the page jump link record is ended, and the obtained final page jump link is reported to the server.

[0009] In a second aspect, the present disclosure further provides a page jump link recording device, comprising:

[0010] A determination module, configured to determine, in response to a jump instruction to jump to a target page, whether the target page is marked as a reset page;

[0011] A recording module, for clearing the page jump links recorded up to the current moment if the target page is marked as a reset page, and re-recording a new page jump link with the target page as the starting page;

[0012] The reporting module is used to end the page jump link record if the target page is the link record end page, and report the obtained final page jump link to the server.

[0013] In a third aspect, the present disclosure further provides an electronic device, the electronic device comprising:

[0014] one or more processors;

[0015] A storage device for storing one or more programs;

[0016] When the one or more programs are executed by the one or more processors, the one or more processors implement the page jump link recording method as described above.

[0017] In a fourth aspect, the present disclosure further provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the page jump link recording method as described above.

[0018] Compared with the prior art, the technical solution provided by the embodiments of the present disclosure has the following advantages:

[0019] The technical solution provided by the embodiment of the present disclosure determines whether the target page is marked as a reset page by setting a jump instruction in response to jumping to the target page; if the target page is marked as a reset page, the page jump link recorded up to the current moment is cleared, and the target page is used as the starting page to re-record a new page jump link. It can be achieved that in the process of using the application, the page jump link is recorded synchronously; and in the process of recording the page jump link, if the target page is marked as a reset page, the page jump link is streamlined once, and if the target page is the end page of the link record, the page jump link is stopped from being updated in time, so as to achieve the purpose of reducing the redundant information of the page jump link, thereby reducing the difficulty of subsequent page jump link analysis, which is conducive to accurate and efficient data analysis and application optimization of the application. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the principles of the present disclosure.

[0021] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0022] Figure 1 A flow chart of a page jump link recording method provided by an embodiment of the present disclosure;

[0023] Figure 2 It is a structural schematic diagram of a page jump link recording device in an embodiment of the present disclosure;

[0024] Figure 3 It is a structural schematic diagram of an electronic device in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0025] In order to more clearly understand the above-mentioned objectives, features and advantages of the present disclosure, the scheme of the present disclosure will be further described below. It should be noted that the embodiments of the present disclosure and the features in the embodiments can be combined with each other without conflict.

[0026] In the following description, many specific details are set forth to facilitate a full understanding of the present disclosure, but the present disclosure may also be implemented in other ways different from those described herein; it is obvious that the embodiments in the specification are only part of the embodiments of the present disclosure, rather than all of the embodiments.

[0027] In order to facilitate understanding of the technical solution provided by the present application, the inventive concept of the present application is first explained here.

[0028] During the operation of the application, multiple pages with different functions and uses can be presented to the user. Before using the technical solution provided by the present application, the pages involved in the application can be marked in advance. The essence of marking is to bind the page to a specific operation for the page jump link. Therefore, the tag information of the page reflects the corresponding relationship between the page and the specific operation for the page jump link. The operation of the page jump link may include resetting the page jump link operation. Resetting the page jump link operation may, for example, refer to clearing the page jump link recorded up to the current moment and restarting to record a new page jump link. Subsequently, in the process of the user using the application, no matter which page is jumped to, the tag information of the page is queried to determine whether the page corresponds to a specific operation for the page jump link. If the page corresponds to a specific operation for the page jump link, the operation recorded by the tag information of the page is executed for the page jump link recorded up to the current moment. In this way, it is possible to synchronously record page jump links while using the application; and in the process of recording page jump links, by performing one or some specific operations on the page jump links, the page jump links are streamlined from time to time, thereby achieving the purpose of reducing the redundant information contained in the page jump links that are finally reported.

[0029] It should be noted that, in some examples, it can be set that for an application, some pages in the application may have corresponding tag information, while some pages do not have corresponding tag information. In other examples, it can be set that for an application, each page in the application has corresponding tag information. The tag information of some pages includes the correspondence between the page and the specific operation for the page jump link. The tag information of some pages does not include the correspondence between the page and the specific operation for the page jump link, which means that the page does not correspond to any specific operation for the page jump link.

[0030] Figure 1 A flow chart of a page jump link recording method provided in an embodiment of the present disclosure. This embodiment is applicable to the situation where page jump link recording is performed in a client. The method can be executed by a page jump link recording device, which can be implemented in software and / or hardware. The device can be configured in an electronic device, such as a terminal, specifically including but not limited to smart phones, PDAs, tablet computers, wearable devices with display screens, desktop computers, laptop computers, all-in-one computers, smart home devices, etc.

[0031] like Figure 1 As shown, the method may specifically include:

[0032] S110 . In response to a jump instruction to jump to a target page, it is determined whether the target page is marked as a reset page.

[0033] The target page is a page in the application. This application does not limit what kind of page the target page is. The jump instruction to jump to the target page can be, for example, an instruction indicating that the target page needs to be displayed next.

[0034] In some scenarios, during the use of an application, the target page may be the next page that the application will display after a user operation. For example, in a video application, after the user clicks the option to purchase a membership, the membership details page is displayed next. The membership details page may be, for example, a page that centrally displays the rights and prices of various types of memberships. In this example, the membership details page is the target page. For another example, after the user clicks an option representing a video, the video playback page is displayed next. The video playback page can play the video selected by clicking the option. In this example, the video playback page is the target page.

[0035] Reset pages refer to pages that are bound to the reset page jump link operation. In other words, if you access a reset page, you need to reset the page jump link.

[0036] In some embodiments, the primary entry page and / or the secondary entry page may be marked as a reset page.

[0037] The primary entry page may be, for example, the first page displayed after opening the application, and is used to display the core functional modules or main content classification pages of the application. For example, the secondary entry page may be, for example, the next level page entered from the functional module or classification entrance of the primary entry page, and is mainly used to display the detailed content or sub-categories under a specific functional module.

[0038] For example, for an application for playing videos, the homepage is a primary entry page. The primary entry page includes tabs such as popular, TV series, movies, animation, variety shows, and a search bar. If you click on a tab on the primary entry page, such as movies, you will enter the secondary entry page. The secondary entry page is used to display a more detailed content classification, video list, or specific video information under a specific video category or function module (such as movies).

[0039] S120: If the target page is marked as a reset page, clear the page jump links recorded up to the current moment, take the target page as the starting page, and re-record a new page jump link.

[0040] Taking the target page as the starting page, a new page jump link is re-recorded, for example, the identification information of the target page is added to the page jump link. At this time, the target page is the first page in the page jump link.

[0041] Furthermore, if the target page is not marked as a reset page, the identification information of the target page is added to the page jump link; in the page jump link, each page is arranged in the order of page jump.

[0042] The identification information of the target page may be, for example, information used to distinguish one page from other pages. Exemplarily, the identification information of the target page may include, for example, one or more of a number, an ID, and a URL (Uniform Resource Locator).

[0043] For example, if an application includes page A, page B, page C, and page D. Among them, only page A is marked as a reset-type page. Assume that at a certain moment, the page jump link is ABC, and then under user operation, page C jumps to page D. Since page D is not marked as a reset-type page, a record is added to the page jump link, and the added page jump link is ABCD. Then, under user operation, page D jumps to page A. Since page A is marked as a reset-type page, the page jump link recorded up to the current moment is cleared, and page A is used as the starting page. A new page jump link is re-recorded, and the final page jump link is A.

[0044] S130: If the target page is the end page of the link record, end the page jump link record, and report the obtained final page jump link to the server.

[0045] The link record end page, for example, may mean that after accessing this page, no matter which page is subsequently jumped from this page, the identification information of the subsequent jumped page will no longer be added to the page jump link. In other words, accessing the link record end page means that the page jump link record work of this round is finished.

[0046] Further, the task target of the statistical task is obtained; based on the task target of the statistical task, the end page of the link record is determined.

[0047] The statistical task is a task of recording page jump links. The task goal is the reason why the task of recording page jump links needs to be performed. In practice, the task goals of the statistical tasks are different, and the final determined link record end page may be different.

[0048] For example, if the statistical task goal is to improve and optimize the user's ordering steps, the order confirmation submission page can be set as the link record end page. The order confirmation submission page can be, for example, a page used to allow users to confirm whether the order information is correct during shopping or trading, and submit the order after the order information is confirmed to be correct. The order confirmation submission page can include: the name, quantity, price, delivery address and other information of the product, so that the user can make a final check and confirmation before submitting the order.

[0049] Since the link record end page is usually related to the design optimization purpose of the application, if the target page is the link record end page, it usually means that when jumping from the target page to other pages, the other pages have little relevance to the task objectives of this statistical task and are redundant information.

[0050] Exemplarily, if an application includes page A, page B, page C, page D, and page E. Among them, only page A is a reset page. Page E is the end page of the link record. Assuming that the page jump link at a certain moment is ABCD, at this time, under the user's operation, page D jumps to page A. Since page A is a reset page, the page jump link recorded up to the current moment is cleared, and page A is used as the starting page. A new page jump link is re-recorded, and the final page jump link is A. Then, under the user's operation, page A jumps to page E. Since page E is the end page of the link record, the identification information of page E is added to the page jump link. At this time, the page jump link is AE. Stop the continued appending of the page jump link, and report the page jump link AE to the server.

[0051] The above technical solution determines whether the target page is marked as a reset page by setting a jump instruction in response to jumping to the target page; if the target page is marked as a reset page, the page jump link recorded up to the current moment is cleared, and a new page jump link is re-recorded with the target page as the starting page; if the target page is the end page of the link record, the page jump link record is ended, and the final page jump link obtained is reported to the server. It can be realized that the page jump link is recorded synchronously during the use of the application; and in the process of recording the page jump link, if the target page is marked as a reset page, the page jump link is streamlined once, and if the target page is the end page of the link record, the page jump link is stopped from being updated in time, so as to achieve the purpose of reducing the redundant information of the page jump link, thereby reducing the difficulty of subsequent page jump link analysis, which is conducive to accurate and efficient data analysis and application optimization of the application.

[0052] Based on the above technical solution, optionally, the method may also include: determining whether a loop occurs in the page jump link; if a loop occurs in the page jump link, it means that there is at least one page that appears in the page jump link greater than or equal to 2 times; if a loop occurs in the page jump link, removing the sub-links that form the loop from the page jump link.

[0053] Exemplarily, assume that A, B, C, D, and E represent five different pages. In one example, if the page jump link is ABCDC at a certain moment, since C appears twice in the page jump link, it can be determined that the page jump link has a loop. In another example, assume that the page jump link is ABCDEBCDE at a certain moment, since B, C, D, and E all appear twice in the page jump link, it can be determined that the page jump link has a loop. In another example, assume that the page jump link is ABCDEBDE at a certain moment, since B, D, and E all appear twice in the page jump link, it can be determined that the page jump link has a loop.

[0054] In practice, there are many opportunities to determine whether a page jump link has a loop, and the present application does not limit this. Exemplarily, determining whether a page jump link has a loop may include: periodically determining whether a page jump link has a loop at a preset time interval.

[0055] In another embodiment, optionally, a step of determining whether a page jump link has a loop may be set, including: after adding the identification information of the target page to the page jump link, determining whether a page jump link has a loop. The essence of such a setting is that each time the identification information of a new target page is added to the page jump link, the step of determining whether a page jump link has a loop is executed, so as to timely remove the sub-links that form a loop in the page jump link.

[0056] There are many methods for removing sub-links that form a loop from a page jump link, and this application does not limit this. In one embodiment, removing sub-links that form a loop from a page jump link may include: removing all page identifiers between the first first page and the previous page of the last first page from the page jump link; the first page is a page that appears in the page jump link more than or equal to 2 times.

[0057] In this application, it is not limited to what kind of page the first page specifically refers to. In practice, any page that appears in the page jump link more than or equal to 2 times can be used as the first page. In practice, optionally, each time the step of removing the sub-links that form a loop from the page jump link is performed, only one first page is determined.

[0058] For example, suppose that at a certain moment the page jump link is ABCDC, A, B, C and D represent four different pages, page C appears twice, page C is the first page, and all page identifiers between page C and page D, which are located in the third position, are removed from the page jump link. The final page jump link after the removal process is ABC.

[0059] In another embodiment, removing sub-links that form a loop from a page jump link may include: if the page jump link includes two consecutive sub-links from a first page to a second page, and the middle pages of the two sub-links from the first page to the second page are exactly the same, removing all page identifiers involved in any sub-link from the first page to the second page from the page jump link.

[0060] For example, assuming that at a certain moment the page jump link is ABCDEBCDE, A, B, C, D, and E represent five different pages, B is the first page, and E is the second page. The page jump link can be decomposed into two sub-links, both of which are BCDE, and the two sub-links are continuous. Any sub-link from the first page to the second page (i.e., BCDE) is removed from the page jump link, and the final page jump link after the removal process is ABCDE.

[0061] In some other embodiments, removing sub-links that form a loop from a page jump link may include: if the page jump link includes two consecutive sub-links from a first page to a second page, and one sub-link lacks some intermediate pages relative to the other sub-link, removing all page identifiers involved in the longer sub-link from the first page to the second page from the page jump link.

[0062] For example, assuming that at a certain moment the page jump link is ABCDEBDE, A, B, C, D, and E represent five different pages, with B as the first page and E as the second page, the page jump link can be disassembled into two sub-links, which are BCDE and BDE. The two sub-links are continuous, and BDE lacks C relative to BCDE. The longer sub-link from the first page to the second page (i.e., BCDE) is removed from the page jump link, and the final page jump link after the removal process is ABDE.

[0063] By removing the sub-links that form a loop from the page jump link, the redundant information of the page jump link can be further reduced, and the difficulty of analyzing subsequent page jump links can be reduced, which is conducive to accurate and efficient data analysis and application optimization of the application.

[0064] It should be noted that, for the above-mentioned method embodiments, for the sake of simplicity, they are all described as a series of action combinations, but those skilled in the art should know that the present invention is not limited by the described action sequence, because according to the present invention, certain steps can be performed in other sequences or simultaneously. Secondly, those skilled in the art should also know that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required by the present invention.

[0065] Figure 2 Schematic diagram of the structure of a page jump link recording device in an embodiment of the present disclosure. The page jump link recording device provided in the embodiment of the present disclosure can be configured in a client, or can be configured in a server. Figure 2 , the page jump link recording device specifically includes:

[0066] A determination module 210, configured to determine, in response to a jump instruction to jump to a target page, whether the target page is marked as a reset page;

[0067] The recording module 220 is used to clear the page jump links recorded up to the current moment if the target page is marked as a reset page, and re-record a new page jump link with the target page as the starting page;

[0068] The reporting module 230 is used to end the page jump link record if the target page is the link record end page, and report the obtained final page jump link to the server.

[0069] Furthermore, the recording module 220 is further configured to:

[0070] If the target page is not marked as a reset page, the identification information of the target page is added to the page jump link; in the page jump link, each page is arranged in the order of page jump.

[0071] Furthermore, the device also includes a cycle rejection module, which is used to:

[0072] Determine whether a loop occurs in the page jump link; if a loop occurs in the page jump link, it means that at least one page appears in the page jump link for more than or equal to 2 times;

[0073] If a loop occurs in the page jump link, the sub-links forming the loop are removed from the page jump link.

[0074] Furthermore, the loop elimination module is used to:

[0075] After the identification information of the target page is added to the page jump link, it is determined whether a loop occurs in the page jump link.

[0076] Furthermore, the loop elimination module is used to:

[0077] All page identifiers between the first first page and the previous page of the last first page are removed from the page jump link; the first page is a page that appears in the page jump link for more than or equal to 2 times.

[0078] Furthermore, the loop elimination module is used to:

[0079] If the page jump link includes two consecutive sub-links from the first page to the second page, and the intermediate pages of the two sub-links from the first page to the second page are exactly the same, all page identifiers involved in any sub-link from the first page to the second page are removed from the page jump link.

[0080] Furthermore, the loop elimination module is used to:

[0081] If the page jump link includes two consecutive sub-links from the first page to the second page, and one of the sub-links lacks some intermediate pages relative to the other sub-link, all page identifiers involved in the longer sub-link from the first page to the second page are removed from the page jump link.

[0082] The page jump link recording device provided in the embodiment of the present disclosure can execute the steps executed by the client or server in the page jump link recording method provided in the embodiment of the method of the present disclosure, and has execution steps and beneficial effects, which will not be repeated here.

[0083] Figure 3 Schematic diagram of the structure of an electronic device in the embodiment of the present disclosure. Figure 3 , which shows a schematic diagram of the structure of an electronic device 1000 suitable for implementing the embodiment of the present disclosure. The electronic device 1000 in the embodiment of the present disclosure may include, but is not limited to, mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), vehicle terminals (such as vehicle navigation terminals), wearable electronic devices, etc., and fixed terminals such as digital TVs, desktop computers, smart home devices, etc. Figure 3 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0084] like Figure 3 As shown, the electronic device 1000 may include a processing device (e.g., a central processing unit, a graphics processor, etc.) 1001, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 1002 or a program loaded from a storage device 1008 to a random access memory (RAM) 1003 to implement the page jump link recording method of the embodiment described in the present disclosure. In the RAM 1003, various programs and information required for the operation of the electronic device 1000 are also stored. The processing device 1001, the ROM 1002, and the RAM 1003 are connected to each other via a bus 1004. An input / output (I / O) interface 1005 is also connected to the bus 1004.

[0085] Typically, the following devices may be connected to the I / O interface 1005: an input device 1006 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 1007 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 1008 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009. The communication device 1009 may allow the electronic device 1000 to communicate with other devices wirelessly or by wire to exchange information. Although Figure 3 The electronic device 1000 is shown with various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead.

[0086] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a non-transitory computer-readable medium, and the computer program contains a program code for executing the method shown in the flowchart, thereby implementing the page jump link recording method as described above. In such an embodiment, the computer program can be downloaded and installed from the network through the communication device 1009, or installed from the storage device 1008, or installed from the ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment of the present disclosure are executed.

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

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

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

[0090] The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device:

[0091] In response to a jump instruction to jump to a target page, determining whether the target page is marked as a reset page;

[0092] If the target page is marked as a reset page, clear the page jump links recorded up to the current moment, take the target page as the starting page, and re-record a new page jump link;

[0093] If the target page is the end page of the link record, the page jump link record is ended, and the obtained final page jump link is reported to the server.

[0094] Optionally, when the above one or more programs are executed by the electronic device, the electronic device may also execute other steps described in the above embodiments.

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

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

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

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

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

[0100] According to one or more embodiments of the present disclosure, the present disclosure provides an electronic device, including:

[0101] one or more processors;

[0102] A memory for storing one or more programs;

[0103] When the one or more programs are executed by the one or more processors, the one or more processors implement any of the page jump link recording methods provided in the present disclosure.

[0104] According to one or more embodiments of the present disclosure, the present disclosure provides a computer-readable storage medium having a computer program stored thereon, and when the program is executed by a processor, the method for recording a page jump link as described in any one of the methods provided in the present disclosure is implemented.

[0105] The embodiment of the present disclosure further provides a computer program product, which includes a computer program or instructions, and when the computer program or instructions are executed by a processor, the page jump link recording method as described above is implemented.

[0106] It should be noted that, in this article, relational terms such as "first" and "second" are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

[0107] The above description is only a specific embodiment of the present disclosure, so that those skilled in the art can understand or implement the present disclosure. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present disclosure. Therefore, the present disclosure will not be limited to the embodiments described herein, but will conform to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A page jump link recording method, characterized in that: include: In response to a jump instruction to jump to a target page, determining whether the target page is marked as a reset page; If the target page is marked as a reset page, clear the page jump links recorded up to the current moment, take the target page as the starting page, and re-record a new page jump link; If the target page is the end page of the link record, the page jump link record is ended, and the obtained final page jump link is reported to the server.

2. The method according to claim 1, characterized in that: Also includes: If the target page is not marked as a reset page, adding the identification information of the target page to the page jump link; In the page jump link, each page is arranged in the order of page jump.

3. The method according to claim 1 or 2, characterized in that: Also includes: Determine whether a loop occurs in the page jump link; The page jump link occurrence cycle means that there is at least one page that appears in the page jump link for more than or equal to 2 times; If a loop occurs in the page jump link, the sub-links forming the loop are removed from the page jump link.

4. The method according to claim 3, characterized in that The determining whether a loop occurs in the page jump link includes: After the identification information of the target page is added to the page jump link, it is determined whether a loop occurs in the page jump link.

5. The method according to claim 4, characterized in that The removing of the sub-links forming a loop from the page jump link comprises: All page identifiers between the first first page and the previous page of the last first page are removed from the page jump link; the first page is a page that appears in the page jump link for more than or equal to 2 times.

6. The method according to claim 3, characterized in that The removing of the sub-links forming a loop from the page jump link comprises: If the page jump link includes two consecutive sub-links from the first page to the second page, and the intermediate pages of the two sub-links from the first page to the second page are exactly the same, all page identifiers involved in any sub-link from the first page to the second page are removed from the page jump link.

7. The method according to claim 3, characterized in that The removing of the sub-links forming a loop from the page jump link comprises: If the page jump link includes two consecutive sub-links from a first page to a second page, and one of the sub-links lacks some intermediate pages relative to the other sub-link, all page identifiers involved in the longer sub-link from the first page to the second page are removed from the page jump link.

8. A page jump link recording device, characterized in that: include: A determination module, configured to determine, in response to a jump instruction to jump to a target page, whether the target page is marked as a reset page; A recording module, for clearing the page jump links recorded up to the current moment if the target page is marked as a reset page, and re-recording a new page jump link with the target page as the starting page; The reporting module is used to end the page jump link record if the target page is the link record end page, and report the obtained final page jump link to the server.

9. An electronic device, characterized in that: The electronic device comprises: one or more processors; A storage device for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 7.

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

Images