Page resource preloading method, device, equipment and storage medium
By preloading only the target page of the next time window in the application software, the problem of excessive consumption of device performance resources is solved, and the fluency and user experience between functional pages are improved.
Patent Information
- Application Number
- CN202210671815.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-06-14
- Publication Date
- 2024-11-08
- Estimated Expiration
- 2042-06-14
AI Technical Summary
In application software, too many device performance resources are consumed on the early loading of page resources, resulting in lag in function page operation or slow response, affecting the user experience.
By determining the target page of the target application software's current page and the next time window, only the page resources that the target page depends on are preloaded, reducing excessive consumption of device performance resources, improving the response time of page loading and the smoothness between function pages Spend.
The screening and determination of the page to be loaded is realized, which reduces the excessive consumption of device performance resources caused by preloading the page resources, improves the effective utilization rate of device performance resources and the smoothness of switching between function pages, and thus improves the application software User experience.
Smart Images

Figure CN115080143B_ABST
Abstract
Description
Technical Field
[0001] The embodiments of the present disclosure relate to the technical field of page loading, and in particular to a page resource preloading method, apparatus, device and storage medium. Background Art
[0002] The scenarios and functions of current application software are becoming increasingly complex. A single application software (such as an entertainment application software client) may have dozens of main functions, or even hundreds of secondary functions, each of which is associated with multiple pages. For application software, ensuring smooth switching between function pages during use and operation can ensure that the application software has a better user experience.
[0003] At present, the smooth switching of functional pages depends on the network environment and the computing and storage resources of electronic devices. The information involved in the functional application or required by the page is loaded in advance through the provided network environment and other resources. Therefore, after the functional application or page is triggered, it can quickly respond and execute related operations based on the pre-loaded information. Among them, the preloading of resources required for the page needs to rely on the support of set performance resources.
[0004] However, when the performance configuration of the electronic device remains unchanged, if too much device performance resources are consumed in preloading resources related to application software functions or pages, the operation of the functions or pages will also be affected due to insufficient device resource support, such as freezing or slow response. Therefore, it will also affect the user experience of the application software. Summary of the invention
[0005] The present disclosure provides a page resource preloading method, device, equipment and storage medium to achieve effective loading of function pages in application software.
[0006] In a first aspect, an embodiment of the present disclosure provides a method for preloading page resources, the method comprising:
[0007] Determine the current page presented by the target application software in the current time window;
[0008] According to the current page, determining a target page for the next time window from the function pages of the target application software;
[0009] The page resources that the target page depends on for running are determined, and the page resources are preloaded in the current time window.
[0010] In a second aspect, the embodiment of the present disclosure further provides a page resource preloading device, the device comprising:
[0011] A first determination module is used to determine the current page presented by the target application software in the current time window;
[0012] A second determination module, configured to determine a target page for a next time window from the function pages of the target application software according to the current page;
[0013] The resource preloading module is used to determine the page resources that the target page depends on for running, and preload the page resources in the current time window.
[0014] In a third aspect, an embodiment of the present disclosure further provides an electronic device, the electronic device comprising:
[0015] one or more processors;
[0016] a storage device for storing one or more programs,
[0017] When the one or more programs are executed by the one or more processors, the one or more processors implement the page resource preloading method provided in the first aspect of the embodiment of the present disclosure.
[0018] In a fourth aspect, the embodiments of the present disclosure further provide a storage medium comprising computer executable instructions, which, when executed by a computer processor, are used to implement the page resource preloading method provided in the first aspect of the embodiments of the present disclosure.
[0019] The disclosed embodiments provide a page resource preloading method, apparatus, device and storage medium, the method comprising: determining the current page presented by the target application software in the current time window; determining the target page of the next time window from the function page of the target application software according to the current page; determining the page resources on which the target page depends for operation, and preloading the page resources in the current time window. The above technical scheme can only preload the target page of the next time window determined, reducing the response time when the function page is loaded. Compared with the existing preloading of resources required for all function pages when the application software is running, the technical scheme realizes the screening and determination of the pages to be loaded, reduces the excessive consumption of device performance resources caused by preloading page resources, and improves the effective utilization rate of device performance resources while also improving the smoothness of switching between function pages, thereby improving the user experience of the application software. BRIEF DESCRIPTION OF THE DRAWINGS
[0020] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the accompanying drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and the originals and elements are not necessarily drawn to scale.
[0021] Figure 1A schematic diagram of a flow chart of a page resource preloading method provided by an embodiment of the present disclosure;
[0022] Figure 2 A schematic diagram of the structure of a page resource preloading device provided by an embodiment of the present disclosure;
[0023] Figure 3 A schematic diagram of the structure of an electronic device provided by an embodiment of the present disclosure. DETAILED DESCRIPTION
[0024] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments described herein, which are instead provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.
[0025] It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect.
[0026] The term "including" and its variations used herein are open inclusions, i.e., "including but not limited to". The term "based on" means "based at least in part on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description.
[0027] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.
[0028] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".
[0029] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.
[0030] It is understandable that before using the technical solutions disclosed in the embodiments of the present disclosure, the types, scope of use, usage scenarios, etc. of the personal information involved in the present disclosure should be informed to the user and the user's authorization should be obtained in an appropriate manner in accordance with relevant laws and regulations.
[0031] For example, in response to receiving an active request from a user, a prompt message is sent to the user to clearly prompt the user that the operation requested to be performed will require obtaining and using the user's personal information. Thus, the user can autonomously choose whether to provide personal information to software or hardware such as an electronic device, application, server, or storage medium that performs the operation of the technical solution of the present disclosure according to the prompt message.
[0032] As an optional but non-limiting implementation, in response to receiving an active request from the user, the prompt information may be sent to the user in the form of a pop-up window, in which the prompt information may be presented in text form. In addition, the pop-up window may also carry a selection control for the user to choose "agree" or "disagree" to provide personal information to the electronic device.
[0033] It is understandable that the above notification and the process of obtaining user authorization are merely illustrative and do not constitute a limitation on the implementation of the present disclosure. Other methods that meet the relevant laws and regulations may also be applied to the implementation of the present disclosure.
[0034] Figure 1 A flow chart of a page resource preloading method provided in an embodiment of the present disclosure is applicable to situations where resources allocated during the operation of application software are managed. The method can be executed by a page resource preloading device, which can be implemented in the form of software and / or hardware. Optionally, it can be implemented by an electronic device as an execution terminal, which can be a mobile terminal, a PC or a server, etc.
[0035] like Figure 1 As shown, a page resource preloading method provided by an embodiment of the present disclosure specifically includes the following operations:
[0036] S110: Determine the current page presented by the target application software in the current time window.
[0037] In this embodiment, the execution subject may be a mobile terminal or PC terminal installed with the target application software, and the target application software may be any application software installed on the execution subject and in a running state. The method provided in this embodiment may be triggered and executed after the target application software starts running.
[0038] It can be known that after the target application software is started, the execution subject can present the corresponding function page on the screen interface by responding to the trigger event or by responding to a certain execution instruction. The time window can be understood as the length of time consumed from responding to the trigger of the page to presenting all the contents of the page, and the current time window can be understood as the time window corresponding to the description of the method steps in this embodiment.
[0039] In this embodiment, this step can determine the current page presented by the target application software after responding to a command or triggering an event in the current time window, and can obtain relevant information of the current page, such as the page identifier or the function items corresponding to the page.
[0040] The current page presented includes the page content that needs to be displayed on the screen interface after the trigger event response or instruction response. For example, in response to the picture browsing instruction triggered by the user in the current time window, the current page containing the picture content can be presented relative to the picture browsing instruction.
[0041] S120: Determine a target page for the next time window from the function pages of the target application software according to the current page.
[0042] In this embodiment, the next time window can be considered to be equivalent to the current time window, which can be understood as the time window corresponding to the page presentation after the next trigger event is received or the next control instruction is received after the current page is presented. The above trigger event or control instruction can be triggered by the user and responded by the execution subject.
[0043] It can be known that, in general, the function page to be presented in the next time window needs to be determined and presented after receiving the next trigger event or the next control instruction. In this embodiment, in order to realize the preloading of the page resources associated with the function page, the relevant information of the target page to be presented in the next time window can be determined through the relevant information of the current page in the current time window.
[0044] It should be noted that the target application software may include at least one functional application or at least one functional page, and the number of functional pages included in the target application software is mainly set by software developers, which may be basic functional pages designed in the initial development phase, or newly added functional pages inserted in the form of patches during the maintenance phase of the software. In this embodiment, the target page to be presented in the next time window is preferably determined from the functional pages of the target application software, which may be selected from all functional pages or from pre-screened functional pages.
[0045] In this embodiment, after the current page is determined through the above steps, one implementation method of this step may be to determine the transition probability of jumping from the current page to other functional pages in the target application software, and then predict the target page to be presented in the next time window through the transition probability to other functional pages.
[0046] In this embodiment, another implementation method of this step may be to first construct a known page sequence based on the current page and a certain number of pages before it, then predict the unexecuted page sequence based on the known page sequence, and finally determine the target page that may be presented in the next time window based on the unknown page sequence.
[0047] In this embodiment, another implementation of this step may be to obtain a predetermined page jump association table, and then search the page jump association table for the next jump page that matches the current page, thereby using it as the target page that may be presented in the next time window.
[0048] S130: Determine the page resources that the target page depends on for running, and preload the page resources in the current time window.
[0049] In this embodiment, the above S110 and S120 are equivalent to realizing the prediction of the target page that may be presented in the next time window through the current page currently presented, and pre-loading of the page resources required to present the target page in the next time window is realized through this step.
[0050] It is understandable that for any function page presented on the screen interface, before the function page is presented, the required page resources need to be loaded. The page resources can be resource data for page content presentation such as image rendering and playback file cache. The loading of page resources requires the support of hardware resources (such as central processing unit, image processing and hard disk, etc.) on the execution subject, as well as the support of network resources. This step predetermines the page resources that the target page loading depends on, and pre-allocates hardware and network resources in the current time window to load the page resources of the target page, thereby realizing the pre-loading of the resources that the target page depends on in the current time window.
[0051] A page resource preloading method provided in the first embodiment of the present invention can preload only the target page of the determined next time window, thereby reducing the response time when loading the function page. Compared with the existing preloading of resources required for all function pages when the application software is running, the present technical solution realizes the screening and determination of the pages to be loaded, reduces the excessive consumption of device performance resources caused by preloading page resources, and improves the effective utilization rate of device performance resources while also improving the smoothness of switching between function pages, thereby improving the user experience of the application software.
[0052] As a first optional embodiment of this embodiment, based on the above embodiment, one of the methods for determining the target page is given. Further, this first optional embodiment determines the target page of the next time window from the function page of the target application software according to the current page, which is specifically as follows:
[0053] a1) taking the function page contained in the target application software as the page to be jumped to.
[0054] It is known that the target application software may include different functional applications, and the different functional applications are mainly presented through the associated functional pages, so the target application software may include a certain number of functional pages. In this step, each functional page included in the target application software may be regarded as a page to be jumped to based on the received trigger event or control instruction.
[0055] b1) determining the jump probability of the current page jumping to each of the to-be-jumped pages through a state transition model.
[0056] Through this step, the current page can determine a jump probability relative to each to-be-jumped page. The jump probability can be considered as the probability that the current page presented in the current time window will be presented as the to-be-jumped page in the next time window.
[0057] Specifically, the jump probability of the current page relative to the jump page can be determined by the state transition model, which can be regarded as a Markov model. Through the Markov model, the probability value of jumping from the current state to the next state can be determined in the state space, that is, the probability distribution of the next state needs to be determined by the current state. The next state can be another state different from the current state, or it can remain the current state.
[0058] Specifically, through the state transition model, determining the jump probability of the current page jumping to each of the to-be-jumped pages can be described as:
[0059] b11) Retrieving a predetermined state transfer matrix through a state transfer model, wherein rows and columns in the state transfer matrix represent function pages in the target application software.
[0060] In this embodiment, the structure of the state transfer model can be preferably a Markov model, and then the state transfer model can be trained by pre-acquired historical jump information of function page jumps in the historical operation of the target application software, and then a state transfer matrix based on the historical jump information is obtained, thereby obtaining a state transfer model that can perform jump probability calculations on the function pages of the target application software.
[0061] The state transfer matrix is a two-dimensional matrix, whose rows and columns represent the function pages in the target application software. In the state transfer matrix, each function page can be represented by a corresponding page identifier, and the total number of rows and columns can be the total number of function pages contained in the target application software. The execution logic of the state transfer model described in this step is mainly to call the state transfer matrix.
[0062] b12) Determine, according to the page identifier of the current page, the row of the state transfer matrix where the current page is located, and form a row vector based on the element values of the row.
[0063] In this embodiment, the row where the current page is located can be searched through the page identifier of the current page, thereby obtaining the row where the current page is located in the state transfer matrix. The row is equivalent to a row vector, which contains the column identifiers of the columns corresponding to the current page in the state transfer matrix relative to each page to be jumped.
[0064] b13) using each vector value in the row vector as the jump probability from the current page to each page to be jumped.
[0065] After determining the row of the current page through the above steps, the row element information of the row can be extracted; similarly, after determining the column identifier of the column where the page to be jumped is located, the column element information of the corresponding column can also be extracted based on the column identifier. The element value of the intersection of the above row element information and the column element information can be considered as the jump probability of the current page to the page to be jumped.
[0066] c1) determining the to-be-jumped page corresponding to the maximum jump probability as the target page of the next time window.
[0067] Through the above step b1), the jump probability of the current page relative to each page to be jumped can be determined, and the maximum probability, that is, the maximum jump probability, can be determined from each jump probability. This step can obtain the maximum jump probability, and the page to be jumped corresponding to the maximum jump probability in the state transition matrix can be obtained, and the page to be jumped can be used as the target page of the next time window.
[0068] The above optional embodiment of the present embodiment realizes the determination of the target page through the logic concept of the state transition model, and determines the target page by searching for the to-be-jumped page with the maximum jump probability, thereby ensuring the validity of the target page.
[0069] As a second optional embodiment of this embodiment, based on the above embodiment, another method for determining the target page is provided. Further, the target page of the next time window can be determined from the function page of the target application software according to the current page as follows:
[0070] a2) After the target application software is acquired and executed, a historical page set of historical pages presented within a period of time before the current time window is set.
[0071] In this embodiment, the operation of the target application software preferably refers to the current startup operation of the target application software; and it can be considered that the target application software has been running for a period of time before the current time window. In this step, the current time window can be used as the time end point, thereby setting a period of time before the time end point as the historical operation time period, and thereby obtaining the operation information of the target application software in the historical operation time period, and the operation information may include the historical pages that the target application software has presented in the historical operation time period, and the historical pages can be aggregated to form a historical page set.
[0072] b2) Each historical page in the historical page set and the current page constitute a triggered page sequence.
[0073] It can be known that each historical page included in the historical page set has a corresponding page identifier. This step can form a page sequence based on the page identifiers of each historical page and the page identifier of the current page. This step records the page sequence as a triggered page sequence.
[0074] c2) using the triggered page sequence as input data and inputting it into a pre-trained recurrent network model to obtain a state prediction sequence output by the recurrent network model.
[0075] In this embodiment, the state prediction sequence can be obtained through the recurrent network model in this step. It can be considered that the state prediction sequence contains page identifiers of various functional pages that may be presented in the subsequent operation of the target application software.
[0076] The recurrent network model can be regarded as a pre-built neural network model for sequence prediction, and is specifically used to predict the presentation sequence of pages when the target application software is running. The recurrent network model can be obtained by training based on the operation data corresponding to the historical operation of the target application software as training samples.
[0077] d2) determining a target page of the next time window from the function pages of the target application software according to the state prediction sequence.
[0078] In this embodiment, the state prediction sequence includes the page identifiers of each functional page that may be presented in the next time window; corresponding to each page identifier, there is also a corresponding probability value. This step can determine the functional page that is most likely to be presented in the next time window based on the page identifiers included in the state prediction sequence and the corresponding probability values, and record it as the target page.
[0079] Furthermore, according to the state prediction sequence, the specific implementation steps of determining the target page of the next time window from the function page of the target application software can be described as follows:
[0080] Extract each state value and corresponding state probability contained in the state prediction sequence to obtain a target state value corresponding to the maximum state probability; determine a function page matching the target state value from the target application software, and use the matching function page as the target page for the next time window.
[0081] In this embodiment, the state prediction sequence preferably includes at least one state value, each state value represents a function page as a page identifier; in addition, the state prediction sequence also includes the state probability of the state value, each state probability represents the probability value of the corresponding state value as the target page presented in the next time window. In this embodiment, the state value corresponding to the maximum state probability is preferably used as the target state value, and the function page corresponding to the target state value in the target application software can be determined, and finally the function page can be used as the target page in the next time window.
[0082] The second optional embodiment described above provides another method for determining the target page. The core of this method is to adopt a cyclic network model for determining the state prediction sequence. This method can effectively determine the target page and ensure the effectiveness of preloading page resources.
[0083] As a third optional embodiment of this embodiment, based on the above embodiment, another method for determining the target page is provided. Further, the target page of the next time window can be determined from the function page of the target application software according to the current page, which is specifically optimized as follows:
[0084] a3) searching a predetermined function page association table, and acquiring a reference prediction page matching the current page from the function page association table.
[0085] In this optional embodiment, it can be considered that a function page association table is pre-stored in this execution body, and the function page association table can be understood as an information association table containing at least one page tuple, and a page tuple contains page information of two function pages, and the page information can be specifically represented by the page identifier of the function page. The two function pages contained in the page tuple can represent the current page presented in the current time window and the predicted page that may be presented in the next time window.
[0086] This step can search the function page association table, and determine the target page tuple containing the current page from the page tuples contained in the function page association table. The predicted page contained in the target tuple can be considered as a reference predicted page matching the current page.
[0087] It should be noted that the function page association table stored in the execution subject is preferably updated at a set update cycle, and this update method is used to ensure the real-time and validity of the information contained in the function page association table. The set update cycle can be one day, two days, one week or two weeks, etc. In order to ensure the real-time nature of information updates and control the update frequency, this embodiment can preferably set the update cycle to one week.
[0088] In addition, in this embodiment, the updated function page association table can be used to directly replace the original function page association table, thereby ensuring the validity of the information in the association table and avoiding the association table from occupying too much storage space.
[0089] It should be noted that the current page may not exist in the function page association table. When this happens, it can be considered that the current page does not have the possibility of jumping to the next function page. At this time, the current page itself can be used as a reference prediction page. Therefore, when the current page is used as a reference prediction page, it is equivalent to the target page of the next time window is still the current page. In this case, the above step S103 of this embodiment can be no longer executed, or S103 can be executed to repeat the preloading operation of the current page.
[0090] b3) Using the reference prediction page as the target page of the next time window.
[0091] Continuing with the above description, after the reference prediction page is determined through the above steps, the reference prediction page can be directly determined as the target page of the next time window.
[0092] In this optional embodiment, the step of updating and determining the function page association table may include:
[0093] It should be noted that the initial construction process of the function page association table can also refer to the update steps of the function page association table provided in this embodiment. The difference is that when the function page association table is initially constructed, the function page association table can be an empty table.
[0094] a4) Obtaining historical running information corresponding to the target application software when it is running within a historical time period, wherein the historical running information includes historical execution information of function pages.
[0095] In this embodiment, the core of updating the function page association table is that the historical time period used in acquiring historical operation information in this step has changed. In this embodiment, the selection of the historical time period is preferably related to the set update period used for updating the function page association table. After the set update period is met, this step can be started to update the function page association table.
[0096] Continuing with the above description, the historical time period can be a time period before the time point when the function page association table is started to update, and the time period can be one day, two days, or even one week, one month, etc. The historical operation information can be considered as the log information generated when the application software is running during the historical time period. It can be known that the execution terminal running the application software can record the relevant information generated during the operation of the application software in the form of a log. Therefore, this step can obtain the log information corresponding to the application software during the historical time period from the pre-recorded log file.
[0097] Specifically, the historical operation information may include page information of each function page presented during the operation of the target application software; and each function page presented may be recorded in a log file in the order of presentation. In this embodiment, the information obtained from the historical operation information including each function page presented in the target application software is recorded as the historical execution information.
[0098] b4) analyzing the historical execution information of the function pages to determine the next function page to which each function page in the application software jumps after being executed within the historical time period.
[0099] According to the above description, the historical execution information includes the page information of each function page presented when the target application software is running in the historical time period, and each page information is recorded in chronological order. Therefore, this step can analyze the execution order of the function pages, and then determine which function page is presented after each function page, and the function page executed later is equivalent to the next function page in this step.
[0100] c4) For each function page, the next function pages associated with the function page are summarized, and the association times of each next function page are counted, and the next function page corresponding to the highest association time is used as the reference prediction page of the function page.
[0101] Continuing with the above description, for each function page that appears in the historical time period, there may be multiple next function pages. This step can be used to summarize the next function page of each function page. During the summary process, if there is a same next function page that appears multiple times for a function page, the number of occurrences of the next function page can be accumulated.
[0102] Thus, for a function page, it can obtain the next function page that appears thereafter, and the number of occurrences relative to each next function page, which is preferably recorded as the number of associations. In this step, the next function page corresponding to the highest number of associations can be used as the participating prediction page of the function page.
[0103] This embodiment can determine the corresponding reference prediction pages respectively through this step relative to each function page presented in the historical time period. It can be known that the function pages presented in the historical time period may not be all the function pages of the target application software.
[0104] d4) Summarize each function page and the associated reference prediction page to form a function page association table.
[0105] Exemplarily, after determining the associated reference prediction page for each function page through the above steps, the function page and the associated reference prediction page may be formed into a page tuple, and then the page tuples may be summarized to form a function page association table.
[0106] It should be noted that if the function page association table already contains a certain function page and the corresponding old reference prediction page, unlike this time, the new reference prediction page can be directly used to replace the corresponding old reference page. If the function page determined this time did not exist in the function page association table before, the formed page tuple can be directly added to the function page association table. In addition, there may be function pages in the function page association table that have not been updated in this update. This embodiment can continue to save the page tuple formed by the function page until its associated information is replaced in the update.
[0107] The above optional embodiment provides another implementation method for determining the target page, which reflects the effectiveness and efficiency of the target page determination and ensures the matching degree between the determined target and the target application software operated by the user.
[0108] Figure 2 A schematic diagram of the structure of a page resource preloading device provided by an embodiment of the present disclosure is shown in FIG. Figure 2 As shown, the device includes: a first determination module 210 , a second determination module 220 and a resource preloading module 230 .
[0109] A first determination module 210 is used to determine the current page presented by the target application software in the current time window;
[0110] A second determination module 220, configured to determine a target page for the next time window from the function pages of the target application software according to the current page;
[0111] The resource preloading module 230 is used to determine the page resources that the target page depends on for running, and preload the page resources in the current time window.
[0112] The technical solution provided by the disclosed embodiment can preload only the target page of the next time window, thereby reducing the response time when loading the function page. Compared with the existing preloading of resources required for all function pages when the application software is running, the technical solution realizes the screening and determination of the pages to be loaded, reduces the excessive consumption of device performance resources caused by preloading page resources, and improves the effective utilization rate of device performance resources while also improving the smoothness of switching between function pages, thereby improving the user experience of the application software.
[0113] Further, the second determining module 220 may include:
[0114] A first initialization unit, configured to use a function page included in the target application software as a page to be jumped to;
[0115] A probability determination unit, used to determine the jump probability of the current page jumping to each of the to-be-jumped pages through a state transition model;
[0116] The first page determination unit is used to determine the to-be-jumped page corresponding to the maximum jump probability as the target page of the next time window.
[0117] Furthermore, the probability determination unit may be specifically used for:
[0118] Retrieving a predetermined state transfer matrix through a state transfer model, wherein rows and columns in the state transfer matrix represent function pages in the target application software;
[0119] Determine, according to the page identifier of the current page, the row of the state transition matrix where the current page is located, and form a row vector based on the element values of the row;
[0120] Each vector value in the row vector is used as the jump probability from the current page to each page to be jumped.
[0121] Furthermore, the second determining module 220 may also include:
[0122] An acquisition unit, used for acquiring a historical page set of historical pages presented within a set period of time before the current time window after the target application software is run;
[0123] A second initialization unit, configured to form a triggered page sequence with each historical page in the historical page set and the current page;
[0124] A prediction determination unit, configured to input the triggered page sequence as input data into a pre-trained recurrent network model to obtain a state prediction sequence output by the recurrent network model;
[0125] The second page determination unit is used to determine the target page of the next time window from the function pages of the target application software according to the state prediction sequence.
[0126] Furthermore, the second page determination unit may be specifically used for:
[0127] Extracting each state value and corresponding state probability contained in the state prediction sequence to obtain a target state value corresponding to a maximum state probability;
[0128] A function page matching the target state value is determined from the target application software, and the matching function page is used as the target page of the next time window.
[0129] Further, the second determining module 220 may also include:
[0130] A search unit, configured to search a pre-updated function page association table, and obtain a reference prediction page matching the current page from the function page association table;
[0131] A third page obtaining unit, configured to use the reference prediction page as a target page for the next time window;
[0132] The function page association table is updated at a set update period.
[0133] Furthermore, the device may further include: an association table updating module, wherein the association table updating module may be specifically used for:
[0134] Acquire historical running information corresponding to the target application software when it was running in a historical time period, wherein the historical running information includes historical execution information of function pages;
[0135] Analyze the historical execution information of the function page to determine the next function page to which each function page in the application software jumps after being executed within the historical time period;
[0136] For each function page, the next function pages associated with the function page are summarized, and the number of associations of each next function page is counted, and the next function page corresponding to the highest number of associations is used as a reference prediction page for the function page;
[0137] Each function page and its associated reference prediction page are summarized to form a function page association table.
[0138] The page resource preloading device provided in the embodiments of the present disclosure can execute the page resource preloading method provided in any embodiment of the present disclosure, and has the corresponding functional modules and beneficial effects of the execution method.
[0139] It is worth noting that the various units and modules included in the above-mentioned device are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be achieved; in addition, the specific names of the functional units are only for the convenience of distinguishing each other, and are not used to limit the protection scope of the embodiments of the present disclosure.
[0140] Figure 3 This is a schematic diagram of the structure of an electronic device provided by an embodiment of the present disclosure. Figure 3 , which shows an electronic device (eg, Figure 3 The terminal device in the embodiment of the present disclosure may include but is not limited to mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, 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.
[0141] like Figure 3 As shown, the electronic device 300 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 301, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 302 or a program loaded from a storage device 308 into a random access memory (RAM) 303. In the RAM 303, various programs and data required for the operation of the electronic device 300 are also stored. The processing device 301, the ROM 302, and the RAM 303 are connected to each other via a bus 304. An edit / output (I / O) interface 305 is also connected to the bus 304.
[0142] Typically, the following devices may be connected to the I / O interface 305: input devices 306 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; output devices 307 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; storage devices 308 including, for example, a magnetic tape, a hard disk, etc.; and communication devices 309. The communication devices 309 may allow the electronic device 300 to communicate with other devices wirelessly or by wire to exchange data. Although Figure 3 The electronic device 300 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.
[0143] 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 program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication device 309, or installed from the storage device 308, or installed from the ROM 302. When the computer program is executed by the processing device 301, the above-mentioned functions defined in the method of the embodiment of the present disclosure are executed.
[0144] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.
[0145] The electronic device provided by the embodiment of the present disclosure and the page resource preloading method provided by the above embodiment belong to the same inventive concept. The technical details not fully described in this embodiment can be referred to the above embodiment, and this embodiment has the same beneficial effects as the above embodiment.
[0146] An embodiment of the present disclosure provides a computer storage medium on which a computer program is stored. When the program is executed by a processor, the page resource preloading method provided by the above embodiment is implemented.
[0147] 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 a data signal propagated in a baseband or as part of a carrier wave, in which a computer-readable program code is carried. This propagated data signal may take a variety of forms, including but not limited to an electromagnetic signal, an optical signal, 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.
[0148] In some embodiments, the client and the server may communicate using any currently known or future developed network protocol such as HTTP (HyperText Transfer Protocol), and may be interconnected with any form or medium of digital data 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 currently known or future developed network.
[0149] The computer-readable medium may be included in the electronic device, or may exist independently without being incorporated into the electronic device.
[0150] The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device:
[0151] The above-mentioned computer-readable medium carries one or more programs. When the above-mentioned one or more programs are executed by the electronic device, the electronic device: determines the current resource usage information corresponding to each resource item on the execution terminal during the operation of the application software; determines the target resource items that currently meet the resource allocation warning conditions based on each of the current resource usage information; and adjusts the resource allocation logic of each of the target resource items during the operation of the application software.
[0152] 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).
[0153] 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.
[0154] The units involved in the embodiments described in the present disclosure may be implemented by software or hardware. The name of a unit does not limit the unit itself in some cases. For example, the first acquisition unit may also be described as a "unit for acquiring at least two Internet Protocol addresses".
[0155] 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.
[0156] 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.
[0157] According to one or more embodiments of the present disclosure, [Example 1] provides a page resource preloading method, which includes: determining a current page presented by a target application software in a current time window; based on the current page, determining a target page for a next time window from a function page of the target application software; determining page resources on which the target page depends for running, and preloading the page resources in the current time window.
[0158] According to one or more embodiments of the present disclosure, [Example 2] provides a page resource preloading method, which includes further optimizing the determination of the target page of the next time window from the function pages of the target application software based on the current page. Specifically, the optimization can be as follows: using the function pages contained in the target application software as the pages to be jumped to; determining the jump probability of the current page jumping to each of the pages to be jumped to through a state transition model; and determining the page to be jumped corresponding to the maximum jump probability as the target page of the next time window.
[0159] According to one or more embodiments of the present disclosure, [Example Three] provides a page resource preloading method, which includes further optimizing the jump probability of the current page to jump to each page to be jumped to through a state transition model. Specifically, the optimization can be as follows: through the state transition model, a predetermined state transition matrix is called, and both rows and columns in the state transition matrix represent functional pages in the target application software; the row of the current page in the state transition matrix is determined based on a row vector formed by the element values of the row; each vector value in the row vector is used as the jump probability of the current page to each page to be jumped to.
[0160] According to one or more embodiments of the present disclosure, [Example 4] provides a page resource preloading method, which includes further optimizing the determination of a target page of the next time window from the function page of the target application software based on the current page. Specifically, the optimization can be as follows: after the target application software is run, a historical page set of historical pages presented within a period of time before the current time window is set; each historical page in the historical page set and the current page constitute a triggered page sequence; the triggered page sequence is input as input data into a pre-trained recurrent network model to obtain a state prediction sequence output by the recurrent network model; and according to the state prediction sequence, the target page of the next time window is determined from the function page of the target application software.
[0161] According to one or more embodiments of the present disclosure, [Example Five] provides a page resource preloading method, which includes further optimizing the determination of a target page for the next time window from the function page of the target application software according to the state prediction sequence. Specifically, the optimization can be as follows: extracting each state value and the corresponding state probability contained in the state prediction sequence to obtain a target state value corresponding to the maximum state probability; determining a function page that matches the target state value from the target application software, and using the matching function page as the target page for the next time window.
[0162] According to one or more embodiments of the present disclosure, [Example Six] provides a page resource preloading method, which includes further optimizing the determination of a target page of the next time window from the function page of the target application software based on the current page, and specifically can be optimized as follows: searching a pre-updated function page association table, and obtaining a reference prediction page matching the current page from the function page association table; using the reference prediction page as the target page of the next time window; wherein the function page association table is updated at a set update cycle.
[0163] According to one or more embodiments of the present disclosure, [Example 7] provides a page resource preloading method, which includes updating and determining the function page association table, and specifically may include: obtaining historical operation information corresponding to the target application software when it is running within a historical time period, the historical operation information including historical execution information of the function page; analyzing the historical execution information of the function page to determine the next function page to which each function page in the application software jumps after being executed within the historical time period; for each function page, summarizing the next function pages associated with the function page, and counting the number of associations of each next function page, and using the next function page corresponding to the highest number of associations as a reference prediction page for the function page; summarizing each function page and the associated reference prediction pages to form a function page association table.
[0164] According to one or more embodiments of the present disclosure, [Example Eight] provides a page resource preloading device, which includes: a first determination module, used to determine the current page presented by the target application software in the current time window; a second determination module, used to determine the target page of the next time window from the function page of the target application software based on the current page; a resource preloading module, used to determine the page resources on which the target page depends on to run, and preload the page resources in the current time window.
[0165] According to one or more embodiments of the present disclosure, [Example 9] provides an electronic device, which includes 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 page resource preloading method as described in any one of the above Examples 1 to Example 7.
[0166] According to one or more embodiments of the present disclosure, [Example 10] provides a storage medium containing computer executable instructions, which, when executed by a computer processor, are used to execute a page resource preloading method as described in any one of Examples 1 to 7.
[0167] The above description is only a preferred embodiment of the present disclosure and an explanation of the technical principles used. Those skilled in the art should understand that the scope of disclosure involved in the present disclosure is not limited to the technical solutions formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above disclosed concept. For example, the above features are replaced with the technical features with similar functions disclosed in the present disclosure (but not limited to) by each other to form a technical solution.
[0168] In addition, although each operation is described in a specific order, this should not be understood as requiring these operations to be performed in the specific order shown or in a sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Similarly, although some specific implementation details are included in the above discussion, these should not be interpreted as limiting the scope of the present disclosure. Some features described in the context of a separate embodiment can also be implemented in a single embodiment in combination. On the contrary, the various features described in the context of a single embodiment can also be implemented in multiple embodiments individually or in any suitable sub-combination mode.
[0169] Although the subject matter has been described in language specific to structural features and / or methodological logical actions, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or actions described above. On the contrary, the specific features and actions described above are merely example forms of implementing the claims.
Claims
1. A page resource preloading method, characterized in that: include: Determine the current page presented by the target application software in the current time window; According to the current page, determining a target page for the next time window from the function pages of the target application software; Determine the page resources that the target page depends on for running, and preload the page resources in the current time window; The step of determining the target page of the next time window from the function page of the target application software according to the current page includes: Searching a predetermined function page association table, and determining a target page tuple including the current page from the function page association table; Determining the predicted page included in the target bigram as a reference predicted page matching the current page; Using the reference prediction page as the target page of the next time window; Wherein, the function page association table is updated according to a set update cycle; The updating and determining step of the function page association table includes: Acquire historical running information corresponding to the target application software when it was running in a historical time period, wherein the historical running information includes historical execution information of function pages; Analyze the historical execution information of the function page to determine the next function page to which each function page in the application software jumps after being executed within the historical time period; For each function page, the next function pages associated with the function page are summarized, and the number of associations of each next function page is counted, and the next function page corresponding to the highest number of associations is used as a reference prediction page for the function page; Each function page and its associated reference prediction page are summarized to form a function page association table.
2. The method according to claim 1, characterized in that The step of determining the target page of the next time window from the function page of the target application software according to the current page includes: Using the function page included in the target application software as the page to be jumped to; Determine the jump probability of the current page jumping to each of the to-be-jumped pages through a state transition model; The to-be-jumped page corresponding to the maximum jump probability is determined as the target page of the next time window.
3. The method according to claim 2, characterized in that Determining the jump probability of the current page to jump to each of the to-be-jumped pages through a state transition model includes: Retrieving a predetermined state transfer matrix through a state transfer model, wherein rows and columns in the state transfer matrix represent function pages in the target application software; Determine, according to the page identifier of the current page, the row of the state transition matrix where the current page is located, and form a row vector based on the element values of the row; Each vector value in the row vector is used as the jump probability from the current page to each page to be jumped.
4. The method according to claim 1, characterized in that: The step of determining the target page of the next time window from the function page of the target application software according to the current page includes: After the target application software is run, a historical page set of historical pages presented within a period of time before the current time window is set; Each historical page in the historical page set and the current page constitute a triggered page sequence; Inputting the triggered page sequence as input data into a pre-trained recurrent network model to obtain a state prediction sequence output by the recurrent network model; According to the state prediction sequence, a target page of the next time window is determined from the function pages of the target application software.
5. The method according to claim 4, characterized in that Determining the target page of the next time window from the function pages of the target application software according to the state prediction sequence includes: Extracting each state value and corresponding state probability contained in the state prediction sequence to obtain a target state value corresponding to a maximum state probability; A function page matching the target state value is determined from the target application software, and the matching function page is used as the target page of the next time window.
6. A page resource preloading device, characterized in that: include: A first determination module is used to determine the current page presented by the target application software in the current time window; A second determination module, configured to determine a target page for a next time window from the function pages of the target application software according to the current page; A resource preloading module, used to determine the page resources that the target page depends on for running, and preload the page resources in the current time window; The second determining module is specifically used to: Searching a predetermined function page association table, and determining a target page tuple including the current page from the function page association table; Determining the predicted page included in the target bigram as a reference predicted page matching the current page; Using the reference prediction page as the target page of the next time window; Wherein, the function page association table is updated according to a set update cycle; The association table update module is specifically used for: Acquire historical running information corresponding to the target application software when it was running in a historical time period, wherein the historical running information includes historical execution information of function pages; Analyze the historical execution information of the function page to determine the next function page to which each function page in the application software jumps after being executed within the historical time period; For each function page, the next function pages associated with the function page are summarized, and the number of associations of each next function page is counted, and the next function page corresponding to the highest number of associations is used as a reference prediction page for the function page; Each function page and its associated reference prediction page are summarized to form a function page association table.
7. 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 page resource preloading method as described in any one of claims 1-5.
8. A storage medium containing computer executable instructions, characterized in that: The computer executable instructions are used to execute the page resource preloading method as described in any one of claims 1-5 when executed by a computer processor.
