Page jumping method, electronic equipment, storage medium and program product

Abstract

The invention provides a page jumping method, electronic equipment, a readable storage medium and a computer program product. The page jumping method comprises the steps that a page identifier in a first address is recognized, the first address is displayed in a first page, the character number of the first address is smaller than or equal to a number threshold value, and the page identifier is used for indicating a second page; a second address associated with the page identifier is determined in an address mapping table, the address mapping table is used for recording the corresponding relation between the page identifier and the second address, and the second address is the entry address of the second page; and jumping from the first page to the second page according to the second address.

Description

Technical Field

[0001] The present disclosure particularly relates to a method for page jumping, an electronic device, a storage medium, and a program product. Background Art

[0002] Mini programs are one of the main ways to provide goods or services to users. Mini programs are generally deployed on servers provided by server providers (such as servers of the WeChat Open Platform). To relieve the pressure on the servers and limit the generation and spread of malicious links, the server providers have imposed strict daily quota restrictions on the generation of short links (urlLinks) of mini programs. For example, each WeChat mini program can generate at most 500,000 short links per day, and each short link can be opened at most 3 million times per day.

[0003] In high-frequency and large-scale sales scenarios, the generation volume of mini programs when generating short links can easily reach the daily quota, resulting in the inability to generate enough short links in time to support access requirements; in addition, the access volume to mini programs may quickly reach the upper limit of the number of times to open the mini program per day. Summary of the Invention

[0004] The present disclosure provides a method for page jumping, an electronic device, a storage medium, and a program product.

[0005] According to one aspect of the present disclosure, there is provided a method for page jumping, including: identifying a page identifier in a first address, the first address being displayed in a first page, the number of characters of the first address being less than or equal to a quantity threshold, the page identifier being used to indicate a second page; determining a second address associated with the page identifier in an address mapping table, the address mapping table being used to record the correspondence between the page identifier and the second address, the second address being an entry address of the second page; and jumping from the first page to the second page according to the second address.

[0006] In some embodiments, before identifying the page identifier in the first address, it includes: establishing the address mapping table, in which the second address of the second page and the page identifier of the second page are in one-to-one correspondence.

[0007] In some embodiments, before identifying the page identifier in the first address, it includes: splicing a first base address with the page identifier to obtain a first address, the first base address being an entry address of a processing module, and the processing module obtaining the second address by processing the page identifier.

[0008] In some embodiments, before identifying the page identifier in the first address, it includes: in response to a first operation on the first address, determining the processing module according to the first base address.

[0009] In some embodiments, after jumping from the first page to the second page according to the second address, the following steps are included: recording the used times of the first base address in the first address when the first operation is executed.

[0010] In some embodiments, after recording the used times of the first base address in the first address when the first operation is executed, the following steps are included: after the used times of the first base address exceed the times threshold, determining a second base address whose used times are less than the times threshold; and splicing the second base address and the page identifier to obtain a new first address.

[0011] In some embodiments, determining a second base address whose used times are less than the times threshold includes: using the base address with the smallest used times as the second base address.

[0012] According to another aspect of the present disclosure, an electronic device is provided, including: a memory that stores execution instructions; and a processor that executes the execution instructions stored in the memory, so that the processor executes the page jump method in any of the above embodiments.

[0013] According to still another aspect of the present disclosure, a readable storage medium is provided, in which execution instructions are stored, and when the execution instructions are executed by a processor, they are used to implement the page jump method in any of the above embodiments.

[0014] According to yet another aspect of the present disclosure, a computer program product is provided, including a computer program, and when the computer program is executed by a processor, it implements the page jump method in any of the embodiments. Description of the Drawings

[0015] The drawings illustrate exemplary embodiments of the present disclosure and, together with the description thereof, are used to explain the principles of the present disclosure. These drawings are included to provide a further understanding of the present disclosure and are included in this specification and form a part of this specification.

[0016] Figure 1 is a schematic diagram of an application scenario of the page jump method according to an embodiment of the present disclosure.

[0017] Figure 2 is an interaction flowchart of the page jump method according to an embodiment of the present disclosure.

[0018] Figure 3 is a schematic diagram of the page jump process according to an embodiment of the present disclosure.

[0019] Figure 4Schematic diagram of the jump process of the second page according to an embodiment of the present disclosure.

[0020] Figure 5 Flowchart of a page jump method according to an embodiment of the present disclosure.

[0021] Figure 6 Schematic block diagram of the structure of a page jump device according to an embodiment of the present disclosure.

[0022] Figure 7 Schematic block diagram of the structure of an electronic device configured with a page jump device according to an embodiment of the present disclosure. Detailed implementation manners

[0023] The present disclosure will be further described in detail below with reference to the accompanying drawings and examples. It can be understood that the specific examples described herein are only for explaining the relevant content and do not limit the present disclosure. Additionally, it should be noted that for the convenience of description, only parts related to the present disclosure are shown in the drawings.

[0024] It should be noted that, without conflict, the embodiments in the present disclosure and the features in the embodiments can be combined with each other. The technical solutions of the present disclosure will be described in detail below with reference to the drawings and in conjunction with the embodiments.

[0025] A short link is a network address pointing to a certain page and can support jumping to a unique mini-program page. Currently, the mini-program has proposed a short link that can concatenate dynamic parameters, dividing the original short link into two parts: the base address, which defines the path that the user first accesses after clicking, such as a certain page; and the dynamic part address, which is used to display different interactive results on the original page according to the user's click operation. Through the customized short link, it is supported that the page displays different interactive results according to different click operations of the user, improving the reuse rate of the short link. However, in order to ensure the user experience and the convenience of dissemination, the short link usually appears in the form of a short chain, which means that there is a limit on the number of characters when customizing the second part, for example, no more than 256 characters. Although the introduction of dynamic parameters improves the reuse rate of the short link, for enterprises with high-frequency and large-scale sales activities, the daily quota of the short link still restricts the scale and dissemination range of the enterprise's product sales, affecting the sales effect. The character limit for the dynamic part address of the short link that can concatenate dynamic parameters is also not applicable to the display scenario of the dynamic part with a relatively long address.

[0026] Therefore, the present disclosure proposes a page jump method.

[0027] Figure 1 Schematic diagram of the application scenario of the page jump method according to an embodiment of the present disclosure.

[0028] AsFigure 1 As shown, in this scenario, it may include a server 100 and a terminal device 200. The server 100 may be a cloud server or a physical server, and the terminal device 200 may be a device such as a mobile phone or a computer that can display a first page and a second page. The server 100 and the terminal device 200 interact through a network or other means.

[0029] The terminal device 200 displays a first page, and the first page displays a first address. After the terminal device 200 obtains a first operation of the user on the first address, the first address is synchronized to the server 100; wherein, the first operation may be an operation such as a mouse click or a touch screen click on the first address by the user, and is not limited herein. The server 100 runs a page jump method, identifies a page identifier in the first address, and determines a second address corresponding to the page identifier through an address mapping table; then, finds the content parameters of the second page according to the second address and displays the second page on the terminal device 200. In this way, the page identifier replaces the address part of the dynamic parameters in the short link, and then the corresponding and complete second address is determined in the address mapping table, overcoming the problem of the character number limit of the first address. Moreover, the second address corresponding to the page identifier can be the entry address of any page, which improves the reuse rate of the existing short links and avoids the waste of the daily quota of some short links with low click-through rates when the daily quota of the short links (i.e., the base address in the first address) generated by the mini program cannot be increased.

[0030] For the convenience of description and to make the technical solutions of the specific embodiments of the present disclosure easier to understand, before describing the page jump method implemented in the present disclosure, the technical terms involved in the specific embodiments of the present disclosure are explained as follows: First page: Displayed on a device terminal (such as Figure 1 the device terminal 200 herein), records a first address, and can obtain a first operation of the user on the first address. When the first page displays the first address, it may be in the form of text, icon, button, etc., and is not limited herein. In the scenario of selling products, the first page may be a product list page, which displays each product in the form of an icon. When the user selects a first address in the form of an icon, it jumps to the second page through the processing of the processing module.

[0031] First Address: A short link that is essentially a spliceable dynamic parameter. The first address includes a base address and a page identifier. The base address is used to define the path that the user first accesses after clicking. In this disclosure, it is the entry address of the processing module, which is generated by the applet. The daily generation quantity cannot exceed the limit quantity of short links set by the operator of the APP (such as WeChat APP). The page identifier is a customized part that can be used to indicate the second page in this disclosure. Different second pages have different and unique page identifiers. The base address is generated by the applet, and its character quantity is controllable and less than the quantity threshold of the first address; the page identifier is set by the maintainer of the applet. Compared with directly defining the address of a certain page, the character quantity of the page identifier is relatively controllable and is not restricted by the display scenario. In this way, the character quantity of the first address is less than or equal to the quantity threshold, meeting the requirements of the APP operator for the character quantity of short links (especially for the customized part), making the first address readable and easy to spread.

[0032] Processing Module: Can determine the second address by parsing the first address. The processing module contains an address mapping table that records multiple groups of page identifiers and second addresses, and the page identifiers and second addresses are in one-to-one correspondence. The processing module also has the ability to monitor the used times of the base address in the first address, and after the used times of the base address exceed the times threshold, it selects a base address that has not exceeded the times threshold to generate a new first address. Through the intelligent reuse mechanism, the processing module achieves the purpose of balancing the reuse rate of each base address and maximizes the use times of the base address under the limitation of the fixed daily quota.

[0033] Second Address: The second address is the entry address pointing to the second page, and its character quantity is set according to the specific content or status of the second page. The second address is recorded in the address mapping table of the processing module and is not externally displayed, so there is no need to be in the form of a short link. The character quantity of the second address can be set arbitrarily according to the actual situation and is applicable to various display scenarios.

[0034] Second Page: It is the target page that the user finally accesses and is the pointed object of the second address. Different second pages have different page identifiers. For example, the second page can be the detail page of a certain product in the first page, which is used to introduce the specific information of the corresponding product, etc.

[0035] Figure 2 It is the interaction flowchart of the page jump method according to the embodiments of this disclosure. Refer to Figure 2 , which shows the data interaction process among the first page, the processing module, and the second page during the implementation of the page jump method.

[0036] In step S201, the first page receives the first operation on the first address.

[0037] The first operation can be an operation such as a mouse click, a touch screen click, or a voice selection on the first address, used to trigger the first address. For example, in the first page, a product list is displayed, and each product in the product list is shown in the form of an icon, and each icon is associated with a different page address. When the user wants to know about Product 1, clicking on the icon of Product 1 triggers the first address corresponding to Product 1. The first address includes a first base address pointing to the processing module and a page identifier of the second page to be opened.

[0038] Generally, the first address should point to the second page to be opened. However, there may be a problem that the number of characters in the address of the second page exceeds the quantity threshold. To solve the limitation in the process of customizing the address, the base address of the first address is the entry address of the processing module, and then the customized part is written as the page identifier of the second page to overcome the problem of the limited number of characters. In this way, it also provides a triggering condition for multiple second pages to be triggered by the same first base address.

[0039] In step S202, the processing module identifies the page identifier in the first address.

[0040] The processing module has the ability to parse the first address and can identify two parts in the first address: the processing module address and the page identifier. For example: https: / / example.com / middle1?uid=1234, in this first address, "https: / / example.com / middle1" is the entry address of the processing module, that is, the first base address; "uid=1234" is the page identifier. After the used times of the first base address exceed the times threshold, it can be replaced with a base address whose used times do not exceed the times threshold, such as "https: / / example.com / middle2", etc., but all point to the processing module. The page identifier is set according to the second page to be opened. For example, the page identifier of the detailed page of Product 1 is "uid=1234", and the page identifier of the detailed page of Product 2 is "uid=2345", etc. Of course, the above is an example of the first address, and the base address and the page identifier can be in any form, but the number of characters in the first address cannot exceed the quantity threshold. The processing module can parse the first address into two parts: the base address and the page identifier, and then determine the page identifier.

[0041] In step S203, the processing module determines the second address corresponding to the page identifier in the address mapping table. In the address mapping table, the page identifier and the second page are in one-to-one correspondence.

[0042] Table 1 Table 1 is the address mapping table, which contains the one-to-one corresponding page identifier and the second address.

[0043] For example, if the page identifier in the first address is "uid=12345", then by looking up the address mapping table, it can be determined that the second address is: "https: / / www.example.com / product / detail?uid=1234&category=electronics&promotion=blackfriday", where "https: / / www.example.com / product / detail" represents the entry address of the second page, "uid=1234" is the page identifier, "category=electronics" indicates that the product on the second page is in the electronics category, and "promotion=blackfriday" indicates that the promotion activity for this product is the "Black Friday" event.

[0044] If the page identifier in the first address is "uid=6789", then by looking up the address mapping table, it can be determined that the second address is: "https: / / www.example.com / shop / item?uid=6789&category=fashion&brand=XXXX&discount=spring_sale", where "https: / / www.example.com / shop / item" represents the entry address of the second page, "uid=6789" is the page identifier, "category=fashion" indicates that the product is in the fashion category, "brand=XXXX" indicates that the product is of the "XXXXX" brand, and "discount=spring_sale" indicates that the promotion activity for this product is the "Spring Sale" event.

[0045] Whenever the first address, page identifier, and second address are configured for any page in the applet or any interaction result of any page, the page identifier and the second address should be recorded in a one-to-one correspondence in the address mapping table. There is no limit on the number of page identifiers and second addresses in the address mapping table.

[0046] In step S204, the processing module jumps from the first page to the second page according to the identified second address.

[0047] The processing process of the processing module is carried out on the backend. Therefore, the process from the first address to the processing module is not displayed on the client of the terminal device, and users usually can only see the result of jumping from the first page to the second page.

[0048] In step S205, the processing module records the used times of the first base address.

[0049] The processing module also has the function of monitoring the used times of the base address. Therefore, after the first base address is triggered and executed, the processing module will perform an operation of adding 1 to the used times corresponding to the first base address. For example, if the first base address is triggered for the first time, the used times changes from "0" to "1".

[0050] In step S206, the processing module determines whether the used times is greater than or equal to the times threshold. The times threshold is determined according to the maximum daily usage times of the base address allowed by the applet, and can be the maximum daily usage times; of course, it can also be another value less than the maximum usage times, so that the base address with fewer used times can be called in advance to balance the reuse rate of each base address.

[0051] In step S207, after the used times of the first base address is greater than or equal to the times threshold, a second base address is determined.

[0052] The second base address is the base address generated by the applet. In this method, the second base address points to the entry address of the processing module, and can be in the form of https: / / example.com / middle2, etc. The second base address is selected from the base addresses with used times less than the times threshold, and usually can be any base address less than the times threshold. However, in order to ensure the maximum reuse rate of each base address, the base address with the fewest used times among all the generated base addresses will be selected as the second base address, that is, the new base address. If there are multiple base addresses with the fewest used times, then any one of them can be selected as the second base address with the same probability. For example, among the multiple generated base addresses, the used times of "https: / / example.com / middle2" is 1 time, which is the base address with the fewest used times, so this base address is used as the second base address. If among the multiple generated base addresses, the used times of "https: / / example.com / middle2" and "https: / / example.com / middle3" are the fewest and both are 1 time, then one of them is randomly selected as the second base address.

[0053] In step S208, the processing module configures a corresponding new first address for the second page according to the second base address.

[0054] That is to say, in the first page, the first address containing the page identifier of the second page has been used, and the number of times the first base address in the first address has been used is greater than or equal to the number threshold, then the second base address and the page identifier of the second page are spliced ​​to obtain a new first address. The new first address contains the second base address and the page identifier of the second page. Then, execute step S209 to synchronize the new first address to the first page, and replace the first address in the first page, for example, associate it with the product 1 icon. If a user wants to know about product 1 later, then after clicking the icon of product 1, the new first address is triggered, realizing the reuse of the second base address.

[0055] Based on the above, through the data interaction between the first page, the processing module and the second page, the first address can be in the form of the basic address generated by the applet spliced ​​with the page identifier, which ensures the short link characteristics of the first address; and by recording the second address corresponding to the page identifier in the address mapping table, it adapts to the needs of various second page display scenarios for long links to represent the entry address. In addition, through the splicing form of the first address and the association mechanism of the address mapping table, the basic address generated by the applet can point to different pages, maximizing the reuse rate of the existing basic address within the inherent short link daily quota limit, and meeting the needs of enterprises for more short links as much as possible.

[0056] Figure 3 Schematic diagram of page jump process according to the embodiment of the present disclosure. Figure 3 As shown, the method architecture of page jump is explained.

[0057] Before the mini program is put into use, or when the base address is updated daily, the preparation phase is performed. For example, the first address is formed based on the first base address and the page identifier, and an address mapping table is established based on the second address and the page identifier. Any base address can be used as the first base address when it is used. The first base address represents the base address in the state of being used. The second base represents the base address when it is in the state of replacing the first base address. Any base address can be called the second base address when it is used to replace the original first base address.

[0058] After the user performs the first operation on the first address, the processing module corresponding to the first address is triggered, and the module identifies the page identifier in the first address. Further, the processing module searches the address mapping table for the second address corresponding to the page identifier. Then, the processing module jumps to the second page according to the second address. In this process, the client cannot see the processing action of the processing module, and can only perceive the jump process from the first page to the second page.

[0059] After the first address is operated, that is, after the first base address in the first address is used, the processing module will record the number of times the first base address has been used. Then, the module will also determine whether the number of times the first base address has been used is greater than or equal to the number threshold. If the number of times the first base address has been used is not greater than or equal to the number threshold, then it can still be displayed on the first page. Otherwise, the processing module selects the second base address and generates a new first address. The selection mechanism for determining the second base address can be referred to in the previous text and will not be repeated here. The new first address consists of the second base address and the page identifier of the second page that has a display requirement.

[0060] In addition, if multiple first addresses use the same first base address at the same time, then when multiple triggers on a certain first address cause the number of times the first base address has been used to exceed the threshold, or even exceed the number of times the first base address is available (i.e., the maximum number of times the mini program allows the base address to be used), the first base addresses of the remaining first addresses are updated to the second base address at the same time. Different first addresses can use different second base addresses. After calling the second page, the new first address is displayed on the first page to increase the reuse rate of the second address.

[0061] The page jump method disclosed in the present invention displays the first address in the form of splicing the basic address generated by the program with the page identifier, thereby ensuring the short link characteristics of the first address; and by recording the second address corresponding to the page identifier in the address mapping table, it adapts to the requirements of various second page display scenarios for long links to represent the entry address. In addition, through the splicing form of the first address and the association mechanism of the address mapping table, the basic address generated by the mini program can point to different pages, maximizing the reuse rate of the existing basic address within the inherent short link daily quota, and meeting the needs of enterprises for more short links as much as possible.

[0062] Figure 4 Schematic diagram of the jump process of the second page according to the embodiment of the present disclosure. Figure 4 , which intuitively shows the jump process from the first page to the second page.

[0063] The first page displays a first address, which includes a base address j and a page identifier i, wherein j and i are used to mark the base address and the page identifier, and can be any characters. The processing module is triggered by the first operation on the first address, and then it parses the first address and determines that the page identifier is "page identifier i". Further, the processing module searches the address mapping table for a second address corresponding to the page identifier i. And, the number of times the base address j has been used is recorded as N times, where N can be any value. At the same time, the processing module controls the first page to jump to the second page according to the second address, and the second page is the page with the page identifier i.

[0064] Through the foregoing process, it can be intuitively seen that when configuring the first address, only the page identifier of the second page is concerned, and the actual value of the entry address of the second page is not concerned. Therefore, the number of characters of the first address is in a controllable state and can be controlled to be less than or equal to the number threshold. This makes the method of the present disclosure applicable to various page display scenarios. In addition, the processing module records the used times of the base address and can, when the used times exceed the number threshold, call a base address with fewer used times to form a new first address, so as to maximize the reuse rate of the existing base address under the condition of the inherent daily quota. At the same time, through the mechanism of the address mapping table, the same base address can be associated with the second addresses of different pages, and the available times of each base address are converted into the call times for different pages, which is essentially an expansion of the daily quota and avoids the waste of the base address by the second page with a small demand.

[0065] Figure 5 It is a flowchart of a page jump method according to an embodiment of the present disclosure.

[0066] As Figure 5 shown, it shows a page jump method M500 of the foregoing technical solution, including step S510 of identifying the page identifier in the first address, the first address being displayed in the first page, the number of characters of the first address being less than or equal to the number threshold, and the page identifier being used to indicate the second page; step S520 of determining, in the address mapping table, the second address associated with the page identifier, the address mapping table being used to record the correspondence between the page identifier and the second address, and the second address being the entry address of the second page; and step S530 of jumping from the first page to the second page according to the second address.

[0067] The first page is displayed on the device terminal and shows one or more first addresses. The first page can trigger the processing module in response to the user's selection of any first address. The first address includes the entry address of the processing module and the page identifier of the corresponding second page. And when the first address is displayed on the first page, the first address can be displayed in the form of an icon, text, etc., and a unique second page can be mapped through the display form of the first address. For example, in the product list page, the first address is displayed in the form of an icon, then the icon should be a photo, model or other graphics that can represent the product described in the associated second page.

[0068] The processing module has the ability to identify the page identifier in the first address and stores a module mapping table. Of course, if there is no memory in the processing module, the module mapping table can also be independent of the processing module, for example, stored in a database and then called by the processing module. The processing module also has the ability to record the used times of the first base address in the first address and determine whether to generate a new first address by replacing the first base address with a second base address according to the used times of the first base address.

[0069] The second address is complete and can point to the address of the second page. The second address is recorded in the module mapping table, avoiding the limitation of the number of address characters displayed or associated on the first page, and expanding the applicable scenario range of this method. Of course, the module mapping table can also record the page identifier and the second page detail parameters. The page identifier and the second page detail parameters are in one-to-one correspondence. Then, the second page looks up the second page detail parameters corresponding to the page identifier in the module mapping table, and restores the second address of the second page by processing the second page detail parameters, and then jumps to the second page. The present disclosure does not limit the content in the module mapping table, and any method capable of determining the second address through the page identifier falls within the protection scope of the present disclosure. This way of determining the second address can be an intuitive search method or an indirect restoration method.

[0070] The second page is also presented on the display screen of the device terminal after the jump.

[0071] In some embodiments, before identifying the page identifier in the first address, it includes: establishing an address mapping table, in which the second address of the second page and the page identifier of the second page are in one-to-one correspondence.

[0072] In some embodiments, before identifying the page identifier in the first address, it includes: splicing the first base address with the page identifier to obtain the first address. The first base address is the entry address of the processing module, and the processing module obtains the second address by processing the page identifier.

[0073] In some embodiments, before identifying the page identifier in the first address, it includes: in response to a first operation on the first address, determining the processing module according to the first base address.

[0074] In some embodiments, after jumping from the first page to the second page according to the second address, it includes: recording the number of times the first base address in the first address has been executed for the first operation.

[0075] In some embodiments, after recording the number of times the first base address in the first address has been executed for the first operation, it includes: after the number of times the first base address has been used exceeds the threshold number of times, determining a second base address with the number of times used less than the threshold number of times; and splicing the second base address with the page identifier to obtain a new first address.

[0076] In some embodiments, determining the second base address with the number of times used less than the threshold number of times includes: taking the base address with the smallest number of times used as the second base address.

[0077] The implementation manners and execution principles of the various steps of this method can be referred to the foregoing, and will not be elaborated herein.

[0078] The page jump method M500 disclosed in the present invention displays the first address in the form of a basic address generated by the program and a page identifier, thereby ensuring the short link characteristics of the first address; and by recording the second address corresponding to the page identifier in the address mapping table, it adapts to the needs of various second page display scenarios for long links to represent the entry address. In addition, through the splicing form of the first address and the association mechanism of the address mapping table, the basic address generated by the mini program can point to different pages, maximizing the reuse rate of the existing basic address within the inherent short link daily quota, and meeting the needs of enterprises for more short links as much as possible.

[0079] Figure 6 It is a schematic block diagram of the structure of a page jump device according to an embodiment of the present disclosure. Figure 6 The page jump device is shown, which is a virtual device of the page jump method.

[0080] The page jump device includes an identification module 610, a positioning module 620 and an execution module 630. The identification module 610 executes Figure 5 In step S510, a page identifier in a first address is identified, the first address is displayed in a first page, the number of characters in the first address is less than or equal to a quantity threshold, and the page identifier is used to indicate a second page; the positioning module 620 executes step S520, determines a second address associated with the page identifier in an address mapping table, the address mapping table is used to record the correspondence between the page identifier and the second address, and the second address is an entry address of the second page; and the execution module 630 executes step S530, jumps from the first page to the second page according to the second address.

[0081] The first page is displayed on the device terminal and displays one or more first addresses. The first page can trigger the processing module in response to the user's selection of any first address. The first address includes the entry address of the processing module and the page identifier of the corresponding second page. When the first address is displayed on the first page, the first address can be displayed in the form of an icon, text, etc., and the unique second page can be mapped through the display form of the first address. For example, in the product list page, the first address is displayed in the form of an icon, then the icon should be a photo, model or other graphic that can represent the product described in the associated second page.

[0082] The processing module has the ability to identify the page identifier in the first address and stores a module mapping table. Of course, if there is no memory in the processing module, the module mapping table can also be independent of the processing module, for example, stored in a database and then called by the processing module. The processing module also has the ability to record the usage times of the first base address in the first address and determine whether to generate a new first address by replacing the first base address with a second base address according to the usage times of the first base address.

[0083] The second address is a complete address that can point to the second page. The second address is recorded in the module mapping table, avoiding the limitation of the number of address characters displayed or associated with the first page, and expanding the applicable scenario range of the present method. Of course, the module mapping table can also record the page identifier and the second page detail parameters, and the page identifier and the second page detail parameters are in one-to-one correspondence. Then, the second page can find the second page detail parameters corresponding to the page identifier in the module mapping table, and restore the second address of the second page by processing the second page detail parameters, and then jump to the second page. The present disclosure does not limit the content in the module mapping table, and any method that can determine the second address through the page identifier falls within the protection scope of the present disclosure. This method of determining the second address can be an intuitive search method or an indirect restoration method.

[0084] In some embodiments, it further includes a mapping table establishment module (not shown in the figure) for establishing an address mapping table, in which the second address of the second page and the page identifier of the second page are in one-to-one correspondence.

[0085] In some embodiments, it further includes a first address generation module (not shown in the figure) for splicing the first base address and the page identifier to obtain the first address. The first base address is the entry address of the processing module, and the processing module obtains the second address by processing the page identifier.

[0086] In some embodiments, it further includes a trigger module (not shown in the figure) for determining the processing module according to the first base address in response to a first operation on the first address.

[0087] In some embodiments, the execution module 630 is further configured to record the usage times of the first base address in the first address when the first operation is performed.

[0088] In some embodiments, the execution module 630 is further configured to determine a second base address with a usage times less than the times threshold after the usage times of the first base address exceed the times threshold; and splice the second base address and the page identifier to obtain a new first address.

[0089] Specifically, the base address with the smallest usage times is used as the second base address.

[0090] The implementation methods and execution principles of each module of this device can be referred to above and will not be repeated here.

[0091] The page jump device disclosed in the present invention displays the first address in the form of a basic address generated by the program and a page identifier, thereby ensuring the short link characteristics of the first address; and by recording the second address corresponding to the page identifier in the address mapping table, it adapts to the needs of various second page display scenarios for long links to represent the entry address. In addition, through the splicing form of the first address and the association mechanism of the address mapping table, the basic address generated by the mini program can point to different pages, maximizing the reuse rate of the existing basic address under the inherent short link daily quota limit, and meeting the needs of enterprises for more short links as much as possible.

[0092] Figure 7 The electronic device provided with a page jump device according to an embodiment of the present disclosure includes: Figure 6 The identification module 610, the positioning module 620, and the execution module 630 in the apparatus also include a bus 1100, a processor 1200, a memory 1300, and other circuits 1400 necessary for implementing the operation of the page jump device.

[0093] The bus 1100 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Component (EISA) bus, etc. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, the figure only uses one connecting line, but does not mean that there is only one bus or one type of bus.

[0094] The electronic device disclosed in the present invention displays the first address in the form of a basic address generated by the program and a page identifier, thereby ensuring the short link characteristics of the first address; and by recording the second address corresponding to the page identifier in the address mapping table, it adapts to the needs of various second page display scenarios for long links to represent the entry address. In addition, through the splicing form of the first address and the association mechanism of the address mapping table, the basic address generated by the mini program can point to different pages, maximizing the reuse rate of the existing basic address under the inherent short link daily quota limit, and meeting the needs of enterprises for more short links as much as possible.

[0095] The present disclosure also provides a readable storage medium storing a computer program, which is used to implement the above method when executed by a processor. The "readable storage medium" can be any device that can contain, store, communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. More specific examples of the readable storage medium include the following: an electrical connection part with one or more wirings (electronic device), a portable computer disk cartridge (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable read-only memory (CDROM), etc.

[0096] The present disclosure also provides a computer program product. The method of the present disclosure can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed, the processes or functions of the present disclosure are executed in whole or in part.

[0097] The computer program or instructions can be stored in a readable storage medium or transmitted from one readable storage medium to another. For example, the computer program or instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center in a wired or wireless manner. The readable storage medium can be any accessible available medium or a data storage device such as a server or data center integrating one or more available mediums. The available medium can be a magnetic medium, such as a floppy disk, a hard disk, or a magnetic tape; it can also be an optical medium, such as a digital video disc; or it can be a semiconductor medium, such as a solid state drive. The computer-readable storage medium can be a volatile or non-volatile storage medium, or can include both volatile and non-volatile types of storage media.

[0098] The storage medium and computer program product of the storage page jump method of the present disclosure only care about the page identifier of the second page when configuring the first address, and do not care about the actual value of the entry address of the second page. Therefore, the number of characters of the first address is in a controllable state and can be controlled to be less than or equal to the number threshold. This makes the method of the present disclosure applicable to various page display scenarios. In addition, the processing module records the used times of the base address, and can call the base address with fewer used times to form a new first address when the used times exceed the number threshold, so as to maximize the reuse rate of the existing base address under the condition of the inherent daily quota. At the same time, through the mechanism of the address mapping table, the same base address can be associated with the second addresses of different pages, converting the available times of each base address into the call times for different pages, which is essentially an expansion of the daily quota and avoids the waste of the base address by the second page with a small demand.

[0099] Those skilled in the art should understand that the embodiments of the present disclosure can be provided as a method, a system, or a computer program product. Therefore, the present disclosure can take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present disclosure can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0100] The present disclosure is described with reference to the flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to the present disclosure. It should be understood that each flow and / or block in the flowchart and / or block diagram, and the combination of flows and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing devices to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing devices generate for implementing in the process Figure 1 one process or multiple processes and / or blocks Figure 1 a device for the function specified in one block or multiple blocks.

[0101] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory generate a manufactured article including an instruction device, and the instruction device implements in the process Figure 1 one process or multiple processes and / or blocks Figure 1 a device for the function specified in one block or multiple blocks.

[0102] These computer program instructions can also be loaded onto a computer or other programmable data processing apparatus, so that a series of operation steps are executed on the computer or other programmable apparatus to produce a computer-implemented process, and thus the instructions executed on the computer or other programmable apparatus provide steps for implementing the functions specified in one process or a plurality of processes and / or blocks. Figure 1 one process or a plurality of processes and / or blocks Figure 1 steps for implementing the functions specified in one block or a plurality of blocks.

[0103] In the description of this specification, the descriptions with reference to the terms "one embodiment / way", "some embodiments / ways", "example", "specific example", or "some examples", etc. mean that the specific features, structures, or characteristics described in connection with the embodiment / way or example are included in at least one embodiment / way or example of the present disclosure. In this specification, the schematic representations of the above terms are not necessarily directed to the same embodiment / way or example. Moreover, the specific features, structures, or characteristics described can be combined in any one or more embodiments / ways or examples in a suitable manner. In addition, without contradiction, those skilled in the art can combine and combine the different embodiments / ways or examples described in this specification and the features of different embodiments / ways or examples.

[0104] In addition, the terms "first" and "second" are used for descriptive purposes only and cannot be construed as indicating or implying relative importance or implicitly specifying the quantity of the indicated technical features. Thus, the features defined with "first" and "second" may explicitly or implicitly include at least one of the features. In the description of the present disclosure, "a plurality of" means at least two, such as two, three, etc., unless otherwise specifically defined.

[0105] Those skilled in the art should understand that the above embodiments are only for clearly explaining the present disclosure and are not intended to limit the scope of the present disclosure. For those skilled in the art, other changes or variations can be made on the basis of the above disclosure, and these changes or variations are still within the scope of the present disclosure.

Claims

1. A page jump method, characterized in that: include: identifying a page identifier in a first address, the first address being displayed in a first page, the number of characters in the first address being less than or equal to a number threshold, and the page identifier being used to indicate a second page; Determine a second address associated with the page identifier in an address mapping table, wherein the address mapping table is used to record a correspondence between the page identifier and the second address, and the second address is an entry address of the second page; as well as According to the second address, jump from the first page to the second page.

2. The page jump method according to claim 1, characterized in that: Before identifying the page identifier in the first address, including: The address mapping table is established, in which the second address of the second page and the page identifier of the second page correspond one to one.

3. The page jump method according to claim 1, characterized in that: Before identifying the page identifier in the first address, including: The first base address is concatenated with the page identifier to obtain a first address, wherein the first base address is an entry address of a processing module, and the processing module obtains a second address by processing the page identifier.

4. The page jump method according to claim 3, characterized in that: Before identifying the page identifier in the first address, including: In response to a first operation on the first address, the processing module is determined according to the first base address.

5. The page jump method according to claim 1, characterized in that: After jumping from the first page to the second page according to the second address, the method includes: The number of times the first base address in the first address is used to perform the first operation is recorded.

6. The page jump method according to claim 5, characterized in that: After recording the number of times the first base address in the first address is used to perform the first operation, the method includes: After the number of times the first base address has been used exceeds a number threshold, determining a second base address whose number of times is less than the number threshold; and The second base address is concatenated with the page identifier to obtain a new first address.

7. The page jump method according to claim 6, characterized in that: Determining a second base address whose number of times of use is less than the number threshold includes: The base address with the smallest number of used times is used as the second base address.

8. An electronic device, characterized in that: include: A memory storing execution instructions; as well as A processor, wherein the processor executes the execution instruction stored in the memory, so that the processor executes the page jump method according to any one of claims 1 to 7.

9. A readable storage medium, characterized in that: The readable storage medium stores execution instructions, which are used to implement the page jump method according to any one of claims 1 to 7 when executed by a processor.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the page jump method according to any one of claims 1 to 7 is implemented.

Images