CN115080143A

CN115080143A - Page resource preloading method, device, equipment and storage medium

Info

Publication number: CN115080143A
Application number: CN202210671815.7A
Authority: CN
Inventors: 杨典; 陈贻东; 黄文臣; 高宇
Original assignee: Beijing Zitiao Network Technology Co Ltd
Current assignee: Beijing Zitiao Network Technology Co Ltd
Priority date: 2022-06-14
Filing date: 2022-06-14
Publication date: 2022-09-20

Abstract

The embodiment of the disclosure provides a method, a device, equipment and a storage medium for preloading page resources. The method comprises the following steps: determining a current page presented by the target application software in a current time window; determining a target page of a next time window from the functional pages of the target application software according to the current page; and determining page resources on which the target page runs, and preloading the page resources under the current time window. By the aid of the method, only the determined target page of the next time window can be preloaded, response time of the functional page during loading is reduced, compared with the existing method that resources required by all functional pages are preloaded during application software running, the technical scheme realizes screening and determining of the page to be loaded, excessive consumption of equipment performance resources caused by preloading of the page resources is reduced, effective utilization rate of the equipment performance resources is improved, smoothness of switching between the functional pages is improved, and user experience of the application software is improved.

Description

Page resource preloading method, device, equipment and storage medium

Technical Field

The embodiment of the disclosure relates to the technical field of page loading, and in particular, to a method, an apparatus, a device and a storage medium for preloading page resources.

Background

The scenes and functions of current application software become increasingly complex, and a single application software (such as an entertainment application software client) may have dozens of primary functions and even hundreds of secondary functions, and each function is related to a plurality of pages. For application software, smooth switching among function pages is ensured during use and operation, and the application software can be ensured to have better user experience.

At present, smooth switching of a functional page needs to depend on a network environment and computing and storage resources of electronic equipment, and information related to a functional application or required by the page is loaded in advance through resources such as the provided network environment, so that after the functional application or the page is triggered, the functional application or the page can quickly respond and execute related operations based on the information loaded in advance, wherein preloading of the resources required by the page needs to depend on support of setting performance resources.

However, if excessive device performance resources are consumed in the early loading of the resources related to the functions or pages of the application software when the performance configuration of the electronic device is not changed, the functions or pages may also be affected by insufficient support of the device resources, such as stuck or slow response. Thereby, the user experience of the application software is also affected.

Disclosure of Invention

The disclosure provides a method, a device, equipment and a storage medium for preloading page resources, so as to realize effective loading of functional pages in application software.

In a first aspect, an embodiment of the present disclosure provides a method for preloading page resources, where the method includes:

determining a current page presented by the target application software in a current time window;

determining a target page of a next time window from the functional pages of the target application software according to the current page;

and determining page resources on which the target page runs, and preloading the page resources under the current time window.

In a second aspect, an embodiment of the present disclosure further provides a page resource preloading device, where the device includes:

the first determination module is used for determining a current page presented by the target application software in a current time window;

the second determining module is used for determining a target page of a next time window from the functional pages of the target application software according to the current page;

and the resource preloading module is used for determining the page resource on which the target page runs and preloading the page resource in the current time window.

In a third aspect, an embodiment of the present disclosure further provides an electronic device, where the electronic device 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 provided by the first aspect of the embodiments of the present disclosure.

In a fourth aspect, the present disclosure also provides a storage medium containing computer-executable instructions, which when executed by a computer processor, are configured to perform a method for preloading page resources, which is provided by implementing the first aspect of the present disclosure.

The embodiment of the disclosure provides a method, a device, equipment and a storage medium for preloading page resources, wherein the method comprises the following steps: determining a current page presented by the target application software in a current time window; determining a target page of a next time window from the functional pages of the target application software according to the current page; and determining page resources on which the target page runs, and preloading the page resources under the current time window. According to the technical scheme, the target page of the determined next time window can be only preloaded, the response time of the functional page during loading is reduced, and compared with the prior method of preloading the resources required by all the functional pages during the operation of the application software, the technical scheme realizes the screening and determining of the pages to be loaded, reduces the excessive consumption of the equipment performance resources caused by preloading the page resources, improves the effective utilization rate of the equipment performance resources, and simultaneously improves the fluency of switching between the functional pages, thereby improving the user experience of the application software.

Drawings

The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and features are not necessarily drawn to scale.

Fig. 1 is a schematic flowchart of a method for preloading page resources according to an embodiment of the present disclosure;

fig. 2 is a schematic structural diagram of a page resource preloading device according to an embodiment of the present disclosure;

fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the disclosure.

Detailed Description

Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it is to be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein, but rather are provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the disclosure are for illustration purposes only and are not intended to limit the scope of the disclosure.

It should be understood that the various steps recited in the method embodiments of the present disclosure may be performed in a different order, and/or performed in parallel. Moreover, method embodiments may include additional steps and/or omit performing the illustrated steps. The scope of the present disclosure is not limited in this respect.

The term "include" and variations thereof as used herein are open-ended, i.e., "including but not limited to". The term "based on" is "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". Relevant definitions for other terms will be given in the following description.

It should be noted that the terms "first", "second", and the like in the present disclosure are only used for distinguishing different devices, modules or units, and are not used for limiting the order or interdependence relationship of the functions performed by the devices, modules or units.

It is noted that references to "a", "an", and "the" modifications in this disclosure are intended to be illustrative rather than limiting, and that those skilled in the art will recognize that "one or more" may be used unless the context clearly dictates otherwise.

The names of messages or information exchanged between devices in the embodiments of the present disclosure are for illustrative purposes only, and are not intended to limit the scope of the messages or information.

It is understood that before the technical solutions disclosed in the embodiments of the present disclosure are used, the type, the use range, the use scene, etc. of the personal information related to the present disclosure should be informed to the user and obtain the authorization of the user through a proper manner according to the relevant laws and regulations.

For example, in response to receiving an active request from a user, a prompt message is sent to the user to explicitly prompt the user that the requested operation to be performed would require the acquisition and use of personal information to the user. Thus, the user can autonomously select whether to provide personal information to software or hardware such as an electronic device, an application program, a server, or a storage medium that performs the operations of the technical solution of the present disclosure, according to the prompt information.

As an optional but non-limiting implementation manner, in response to receiving an active request from the user, the manner of sending the prompt information to the user may be, for example, a pop-up window, and the prompt information may be presented in a text manner in the pop-up window. In addition, a selection control for providing personal information to the electronic device by the user's selection of "agreeing" or "disagreeing" can be carried in the pop-up window.

It is understood that the above notification and user authorization process is only illustrative and not limiting, and other ways of satisfying relevant laws and regulations may be applied to the implementation of the present disclosure.

Fig. 1 is a flowchart of a method for preloading page resources according to an embodiment of the present disclosure, where the embodiment of the present disclosure is applicable to a situation where resources allocated in an application software operation are managed, and the method may be executed by a page resource preloading device, where the device may be implemented in a form of software and/or hardware, and optionally, may be implemented by using an electronic device as an execution terminal, where the electronic device may be a mobile terminal, a PC terminal, a server, or the like.

As shown in fig. 1, a method for preloading page resources provided in the embodiment of the present disclosure specifically includes the operations of:

and S110, determining the current page presented by the target application software in the current time window.

In this embodiment, the execution main body may be a mobile terminal or a PC terminal or the like installed with target application software, and the target application software may be any application software in a running state of the application software installed on the execution main body. The method provided by the embodiment can be triggered and executed after the target application software starts to run.

It is to be appreciated that the execution subject can present a corresponding function page on the screen interface after the target application software is started, by responding to a trigger event, or by responding to a certain execution instruction. The time window may be understood as a time length consumed from the triggering of the response page to the presentation of all the content in the page, and the current time window may be understood as a corresponding time window described in the method steps performed in this embodiment.

In this embodiment, the current page presented after the target application software performs the instruction response or triggers the event response in the current time window may be determined through this step, and relevant information of the current page, such as a page identifier or a function item corresponding to the page, may be obtained.

The presented current page comprises page content which needs to be displayed on a screen interface after a trigger event response or an instruction response is carried out. For example, in response to a picture browsing instruction triggered by a user in a current time window, a current page containing picture content may be presented relative to the picture browsing instruction.

And S120, determining a target page of the next time window from the functional pages of the target application software according to the current page.

In this embodiment, the next time window may be regarded as equivalent to the current time window, which may be understood as a time window corresponding to the page rendering after the current page is rendered and a next trigger event is received or a next control instruction is received. The triggering event or the control command may be triggered by a user and responded by the execution main body.

It will be appreciated that in the general case, the function page presented within the next time window needs to be determined and presented upon receipt of the next trigger event or the next control instruction. In this embodiment, in order to preload the page resource associated with the functional page, the relevant information of the target page to be presented in the next time window may be determined through the relevant information of the current page in the current time window.

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 the functional pages included in the target application software is mainly set by a software developer through programming, and may be a basic functional page designed in an initial development phase or a newly added functional page inserted in a patch form in a maintenance phase of the software. In this embodiment, the target page to be presented in the next time window is preferably determined from the function pages provided by the target application software, wherein the target page may be selected from all the function pages or selected from the function pages screened in advance.

In this embodiment, after the current page is determined through the above steps, one implementation manner of this step may be to determine a transition probability of jumping from the current page to each other functional page in the target application software, and then predict a target page to be presented in the next time window according to the transition probability to each other functional page.

In this embodiment, another implementation manner of this step may be to first form a known page sequence based on the current page and a certain number of pages before the current page, then predict an unexecuted page sequence based on the known page sequence, and finally determine a target page that may be presented in the next time window according to the unknown page sequence.

In this embodiment, a further implementation manner of this step may be to obtain a predetermined page jump association table, and then look up a next jump page matching the current page from the page jump association table, so as to serve as a target page that may be presented in a next time window.

S130, determining page resources on which the target page runs, and preloading the page resources under the current time window.

In this embodiment, the above S110 and S120 are equivalent to that the prediction of the target page that may be presented in the next time window is realized through the currently presented current page, and the pre-loading of the page resource required for presenting the target page in the next time window is realized through this step.

It can be understood that for any functional page presented on the screen interface, it needs to load the required page resource before the functional page presentation is completed, and the page resource may be resource data of page content presentation such as image rendering, play file cache, and the like. And the loading of the page resources requires the support of hardware resources (such as a central processing unit, image processing, a hard disk and the like) on the execution main body and also requires the support of network resources.

According to the page resource preloading method provided by the embodiment, only the determined target page of the next time window can be preloaded, the response time length during the loading of the functional page is reduced, compared with the existing method that the resources required by all the functional pages are preloaded during the running of application software, the technical scheme realizes the screening and determining of the page to be loaded, the excessive consumption of the equipment performance resources caused by the preloading of the page resources is reduced, the smoothness of switching between the functional pages is improved while the effective utilization rate of the equipment performance resources is improved, and further the user experience of the application software is improved.

As a first optional embodiment of this embodiment, on the basis of the above embodiment, a determination method of a target page is provided, and further, according to the current page, the first optional embodiment determines a target page of a next time window from function pages of the target application software, specifically:

a1) and taking the functional page contained in the target application software as a page to be jumped.

It is to be understood that different functional applications may be included in the target application software, and the different functional applications are mainly presented through the associated functional pages, so that a certain number of functional pages may be included in the target application software. In this step, each functional page included in the target application software can be regarded as a page to be jumped to be presented based on the received trigger event or control instruction.

b1) And determining the jump probability of the current page jumping to each page to be jumped through a state transition model.

Through the step, the current page can respectively determine a jump probability relative to each page to be jumped, and the jump probability can be regarded as the probability that the current page presented in the current time window is presented as the page to be jumped in the next time window.

Specifically, the jump probability of the current page relative to the page to be jumped can be determined through a state transition model, and the state transition model can be regarded as a Markov model. By means of the markov model, a probability value for a jump from a current state to a next state can be determined in the state space, i.e. the probability distribution of the next state needs to be determined with the current state. The next state may be a state other than the current state, or may remain the current state.

Specifically, by using a state transition model, determining the transition probability of the current page transitioning to each page to be transitioned may be described as:

b11) and calling a predetermined state transition matrix through a state transition model, wherein rows and columns in the state transition matrix represent functional pages in the target application software.

In this embodiment, the structure of the state transition model may preferably be a markov model, and then the state transition model may be trained according to the history jump information of the function page jump in the history operation of the target application software, so as to obtain a state transition matrix formed based on the history jump information, thereby obtaining the state transition model capable of performing the jump probability operation processing on the function page of the target application software.

The state transition matrix is a two-dimensional matrix, rows and columns of the two-dimensional matrix respectively represent functional pages in the target application software, each functional page in the state transition matrix can be represented by a corresponding page identifier, and the total number of rows and the total number of columns can be the total number of pages of the functional pages included in the target application software. The execution logic of the state transition model described in this step is mainly the calling of the state transition matrix.

b12) And determining the line of the current page in the state transition matrix according to the page identifier of the current page, and forming a row vector based on the element values of the line.

In this embodiment, the row of the current page in the state transition matrix can be searched through the page identifier of the current page, so that the row of the current page in the state transition matrix can be obtained, the row of the current page is equivalent to a row vector, and the row vector includes the column identifiers of the corresponding columns of the current page in the state transition matrix relative to the pages to be skipped.

b13) And taking the vector values in the row vector as the jump probability from the current page to each page to be jumped.

After the line of the current page is determined through the steps, line element information of the line can be extracted; similarly, after the column identifier of the column where the page to be skipped is located is determined, the column element information of the corresponding column can be extracted based on the column identifier, and the jump probability that the current page jumps to the page to be skipped can be considered as the element value of the intersection of the row element information and the column element information.

c1) And determining the page to be jumped corresponding to the maximum jump probability as a target page of the next time window.

The jump probability of the current page relative to each page to be jumped can be determined through the step b1), and thus the probability maximum value, namely the maximum jump probability, can be determined from each jump probability. In this step, the maximum jump probability can be obtained, 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.

In this embodiment, the optional embodiment realizes target page determination through a logic idea of a state transition model, and determines a target page by searching a page to be skipped with a maximum skipping probability, thereby ensuring validity of the target page.

As a second optional embodiment of this embodiment, on the basis of the foregoing embodiment, another determination method of a target page is provided, and further, determining a target page of a next time window from the function page of the target application software according to the current page may be embodied as:

a2) and after the target application software is operated, setting a historical page set of the presented historical pages in a period of time before the current time window.

In this embodiment, the operation optimization of the target application software refers to the current starting and operation of the target application software; and the target application software may be considered to have been running for a period of time before the current time window. In this step, the current time window may be a time end point, a period of time is set before the time end point as a historical operating time period, and thus, operating information of the target application software in the historical operating time period is obtained, the operating information may include historical pages that have been presented by the target application software in the historical operating time period, and the historical pages may be summarized to form a historical page set.

b2) And forming a triggered page sequence by each historical page in the historical page set and the current page.

It can be known that each historical page included in the historical page set has a corresponding page identifier, and in this step, a page sequence may be formed based on the page identifiers of the historical pages and the page identifier of the current page, and this step marks the page sequence as a triggered page sequence.

c2) And inputting the triggered page sequence serving as input data into a pre-trained circulating network model to obtain a state prediction sequence output by the circulating network model.

In this embodiment, the state prediction sequence may be obtained through the cyclic network model in this step, and it may be considered that the state prediction sequence includes page identifiers of functional pages that may be presented by the target application software in subsequent operations.

The cyclic network model can be regarded as a pre-constructed neural network model for sequence prediction, and is particularly used for predicting the presentation sequence of pages in the runtime of target application software. The loop network model can be obtained by training as a training sample based on operation data corresponding to the historical operation of the target application software.

d2) And determining a target page of the next time window from the functional pages of the target application software according to the state prediction sequence.

In this embodiment, the state prediction sequence includes page identifiers of function pages that may be presented in a next time window; and correspondingly, a probability value exists for each page identifier, and the most likely functional page in the next time window can be determined according to the page identifiers and the corresponding probability values in the state prediction sequence and recorded as the target page.

Further, according to the state prediction sequence, the specific implementation step of determining the target page of the next time window from the functional pages of the target application software may be described as:

extracting 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; and determining a functional page matched with the target state value from the target application software, and taking the matched functional page as a target page of the next time window.

In this embodiment, the state prediction sequence preferably includes at least one state value, and each state value represents a functional page as a page identifier; in addition, the state prediction sequence also comprises state probabilities of the state values, and each state probability represents a probability value of the corresponding state value as a target page presented in the next time window. In this embodiment, preferably, the state value corresponding to the maximum state probability is used as the target state value, and the functional page corresponding to the target state value in the target application software may be determined, and finally, the functional page may be used as the target page of the next time window.

The second optional embodiment provides another determination method for the target page, and the core of the determination method is to adopt a cyclic network model for determining the state prediction sequence, so that the effective determination of the target page is realized through the method, and the effectiveness of page resource preloading is ensured.

As a third optional embodiment of this embodiment, on the basis of the above embodiment, a further determination manner of the target page is provided, and further, the determining of the target page of the next time window from the function page of the target application software according to the current page may be specifically optimized as follows:

a3) and searching a predetermined function page association table, and acquiring a reference prediction page matched with the current page from the function page association table.

In this optional embodiment, it may be considered that a function page association table is pre-stored in the execution body, where the function page association table may be understood as an information association table including at least one page binary group, where one page binary group includes page information of two function pages, and the page information may be specifically represented by a page identifier of a function page. The two functional pages contained in the page doublet may represent the current page presented in the current time window, as well as the predicted page that is likely to be presented in the next time window.

In this step, the functional page association table may be searched, and a target page binary group including the current page may be determined from the page binary groups included in the functional page association table, and a predicted page included in the target binary group may be regarded as a reference predicted page matched with the current page.

It should be noted that the function page association table stored in the execution main body is preferably updated at a set update cycle, and the real-time performance and validity of the information included in the function page association table are ensured by this update method. The set update period may be one day, two days, one week, two weeks, or the like, and in order to ensure real-time information update and control the update frequency, the set update period is preferably one week.

In addition, in this embodiment, the updated function page association table may be directly used to replace the original function page association table. Therefore, the validity of the information in the association table is ensured, and the occupation of excessive storage space of the association table is avoided.

It should be noted that the current page may not exist in the function page association table, and when this occurs, it may be considered that there is no possibility of jumping to the next function page in the current page, and at this time, the current page itself may be used as the reference prediction page. Therefore, when the current page is used as the reference predicted page, the target page corresponding to the next time window is still the current page, and in this case, the step of S103 in the embodiment may not be executed any more, or S103 may be executed to repeatedly execute the preloading operation of the current page.

b3) And taking the reference prediction page as a target page of the next time window.

As described above, after the reference prediction page is determined through the above steps, the reference prediction page may be directly determined as the target page of the next time window.

In this optional embodiment, the step of determining the update of the function page association table may include:

it should be noted that the initial construction process of the function page association table may also refer to the update step of the function page association table provided in this embodiment, and the difference is that the function page association table may be an empty table when the function page association table is initially constructed.

a4) And acquiring historical operation information corresponding to the operation of the target application software in a historical time period, wherein the historical operation information comprises historical execution information of the function page.

In this embodiment, the core of updating the function page association table is mainly that the historical time period adopted when the historical operation information is acquired in this step is changed. Preferably, the selection of the historical time period is related to a set update period used for updating the function page association table, and the step may be started to update the function page association table after the set update period is met.

As described above, the historical time period may be a time period prior to the point in time at which the function page association table update was initiated, which may be one day, two days, or even one week, one month, or the like. The historical operating information may be considered log information generated when the application software operates within the historical time period. It is known that the execution terminal running the application software can record the relevant information generated in the running of the application software in the form of a log. Therefore, the step can acquire the corresponding log information of the application software in the historical time period from the pre-recorded log file.

Specifically, the historical operating information may include page information of each functional page presented in the operation of the target application software; and the presented function pages can be recorded in the log file in the time sequence of presentation. The present embodiment records information including each function page presented in the target application software, which is obtained from the historical operating information, as historical execution information.

b4) And analyzing the historical execution information of the functional pages, and determining the next functional page which is jumped after each functional page in the application software is executed in the historical time period.

As described above, the history execution information includes page information of each functional page presented when the target application software runs in the history time period, and each page information is recorded according to the time sequence. Therefore, the execution sequence of the function pages can be analyzed in the step, and then which function page is presented after each function page is determined, wherein the function page executed later is equivalent to the next function page in the step.

c4) And summarizing each next function page associated with the function page aiming at each function page, counting the association times of each next function page, and taking the next function page corresponding to the highest association times as a reference prediction page of the function page.

As described above, for each function page that occurs within a historical time period, there may be multiple next function pages. The next function page of each function page can be summarized through the steps, and in the summarizing process, if the same next function page appears for many times relative to one function page, the appearing times of the next function page can be accumulated.

Thus, for a function page, it can obtain the next function page that follows it, and the number of occurrences for each next function page, which is preferably recorded as the number of associations. In this step, the next functional page corresponding to the highest association frequency may be used as the prediction participating page of the functional page.

In this embodiment, the reference prediction pages corresponding to the functional pages presented in the historical time period may be determined respectively through this step. It will be appreciated that the functional pages that appear during the historical time period may not be all of the functional pages of the target application software.

d4) And summarizing each functional page and the related reference prediction pages to form a functional page association table.

For example, after the associated reference prediction page is determined for each functional page through the above steps, the functional page and the associated reference prediction page may form a page binary group, and then the page binary group is summarized to form the functional page association table.

It should be noted that, if a functional page association table already contains a certain functional page and the corresponding old reference prediction page, unlike this time, the new reference prediction page may be directly used to replace the corresponding old reference page. And if the determined function page does not exist in the function page association table before, directly adding the formed page binary group to the function page association table. In addition, a function page that is not updated in the current update may also exist in the function page association table, and the embodiment may continue to store the page binary group formed by the function page until the associated information in the update is replaced.

The above optional embodiment provides another implementation manner of target page determination, which embodies the effectiveness and effectiveness of target page determination and ensures the matching degree of the determined target and the user operation target application software.

Fig. 2 is a schematic structural diagram of a page resource preloading device according to an embodiment of the present disclosure, and as shown in fig. 2, the device includes: a first determination module 210, a second determination module 220, and a resource preloading module 230.

A first determining module 210, configured to determine a current page presented by the target application software in a current time window;

a second determining module 220, configured to determine, according to the current page, a target page of a next time window from the functional pages of the target application software;

the resource preloading module 230 is configured to determine a page resource on which the target page runs, and preload the page resource in a current time window.

According to the technical scheme, the target page of the determined next time window can be pre-loaded only, the response time length during loading of the functional page is reduced, and compared with the prior art that resources required by all the functional pages are pre-loaded during running of application software, the technical scheme realizes screening and determining of the page to be loaded, reduces excessive consumption of equipment performance resources caused by pre-loading of the page resources, improves the effective utilization rate of the equipment performance resources, and simultaneously improves the fluency of switching between the functional pages, so that the user experience of the application software is improved.

Further, the second determining module 220 may include:

a first initial unit, configured to use a functional page included in the target application software as a page to be skipped;

a probability determining unit, configured to determine, through a state transition model, a jump probability that the current page jumps to each page to be jumped;

and the first page determining unit is used for determining the page to be jumped corresponding to the maximum jump probability as a target page of the next time window.

Further, the probability determination unit may specifically be configured to:

calling a predetermined state transition matrix through a state transition model, wherein rows and columns in the state transition matrix represent function pages in the target application software;

determining a line of the current page in the state transition matrix according to the page identifier of the current page, and forming a line vector based on element values of the line;

and taking the vector values in the row vector as the jump probability from the current page to each page to be jumped.

Further, the second determining module 220 may further include:

the acquisition unit is used for acquiring a historical page set of the historical pages presented in a period of time before the current time window after the target application software is operated;

the second initial unit is used for enabling each historical page in the historical page set and the current page to form a triggered page sequence;

the prediction determining unit is used for inputting the triggered page sequence serving as input data into a pre-trained circulating network model to obtain a state prediction sequence output by the circulating network model;

and the second page determining unit is used for determining a target page of the next time window from the functional pages of the target application software according to the state prediction sequence.

Further, the second page determining unit may specifically be configured to:

extracting 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;

and determining a functional page matched with the target state value from the target application software, and taking the matched functional page as a target page of the next time window.

Further, the second determining module 220 may also include:

the searching unit is used for searching a function page association table obtained by updating in advance and obtaining a reference prediction page matched with the current page from the function page association table;

a third page obtaining unit, configured to use the reference predicted page as a target page of the next time window;

and updating the function page association table by setting an updating period.

Further, the apparatus may further include: an association table updating module, wherein the association table updating module may be specifically configured to:

acquiring historical operation information corresponding to the target application software when the target application software operates in a historical time period, wherein the historical operation information comprises historical execution information of a function page;

analyzing historical execution information of the function pages, and determining the next function page which is jumped after each function page in the application software is executed in the historical time period;

summarizing each next function page related to each function page, counting the related times of each next function page, and taking the next function page corresponding to the highest related times as a reference prediction page of the function page;

and summarizing each functional page and the related reference prediction pages to form a functional page association table.

The page resource preloading device provided by the embodiment of the disclosure can execute the page resource preloading method provided by any embodiment of the disclosure, and has corresponding functional modules and beneficial effects of the execution method.

It should be noted that, the units and modules included in the apparatus are merely divided according to functional logic, but are not limited to the above division as long as the corresponding functions can be implemented; in addition, specific names of the functional units are only used for distinguishing one functional unit from another, and are not used for limiting the protection scope of the embodiments of the present disclosure.

Fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the disclosure. Referring now to fig. 3, a schematic diagram of an electronic device (e.g., the terminal device or server of fig. 3) 300 suitable for implementing embodiments of the present disclosure is shown. The terminal device in the embodiments of the present disclosure may include, but is not limited to, a mobile terminal such as a mobile phone, a notebook computer, a digital broadcast receiver, a PDA (personal digital assistant), a PAD (tablet computer), a PMP (portable multimedia player), a vehicle terminal (e.g., a car navigation terminal), and the like, and a stationary terminal such as a digital TV, a desktop computer, and the like. The electronic device shown in fig. 3 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.

As shown in fig. 3, the electronic device 300 may include a processing means (e.g., a central processing unit, a graphics processor, etc.) 301 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)302 or a program loaded from a storage means 308 into a Random Access Memory (RAM) 303. In the RAM 303, various programs and data necessary for the operation of the electronic apparatus 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 bus 304.

Generally, the following devices may be connected to the I/O interface 305: input devices 306 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; an output device 307 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage devices 308 including, for example, magnetic tape, hard disk, etc.; and a communication device 309. The communication means 309 may allow the electronic device 300 to communicate wirelessly or by wire with other devices to exchange data. While fig. 3 illustrates an electronic device 300 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided.

In particular, the processes described above with reference to the flow diagrams may be implemented as computer software programs, according to embodiments of the present disclosure. For example, embodiments of the present disclosure include a computer program product comprising a computer program carried on a non-transitory computer readable medium, the computer program containing program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication means 309, or installed from the storage means 308, or installed from the ROM 302. The computer program, when executed by the processing device 301, performs the above-described functions defined in the methods of the embodiments of the present disclosure.

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, and the technical details that are not described in detail in the embodiment can be referred to the above embodiment, and the embodiment and the above embodiment have the same beneficial effects.

The embodiment of the disclosure provides a computer storage medium, on which a computer program is stored, and when the program is executed by a processor, the method for preloading page resources provided by the above embodiment is implemented.

It should be noted that the computer readable medium in the present disclosure can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in the present disclosure, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.

In some embodiments, the clients, servers may communicate using any currently known or future developed network Protocol, such as HTTP (HyperText Transfer Protocol), and may interconnect with any form or medium of digital data communication (e.g., a communications network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the Internet (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed network.

The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device.

The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to:

the computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: determining current resource use information corresponding to each resource item on an execution terminal in the running of application software; determining a target resource item which currently meets the resource allocation early warning condition according to each piece of current resource use information; and adjusting the resource allocation logic of each target resource item in the running of the application software.

Computer program code for carrying out operations for the present disclosure may be written in any combination of one or more programming languages, including but not limited to an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units described in the embodiments of the present disclosure may be implemented by software or hardware. Where the name of a unit does not in some cases constitute a limitation of the unit itself, for example, the first retrieving unit may also be described as a "unit for retrieving at least two internet protocol addresses".

The functions described herein above 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 a chip (SOCs), Complex Programmable Logic Devices (CPLDs), and the like.

In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The 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, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

According to one or more embodiments of the present disclosure, [ example one ] there is provided a page resource preloading method, including: determining a current page presented by the target application software in a current time window; determining a target page of a next time window from the functional pages of the target application software according to the current page; and determining page resources on which the target page runs, and preloading the page resources in the current time window.

According to one or more embodiments of the present disclosure, an [ example two ] provides a page resource preloading method, which includes further optimization of a target page for determining a next time window from function pages of the target application software according to the current page, and specifically may be optimized as follows: taking a functional page contained in the target application software as a page to be jumped; determining the jump probability of the current page jumping to each page to be jumped through a state transition model; and determining the page to be jumped corresponding to the maximum jump probability as a target page of the next time window.

According to one or more embodiments of the present disclosure, an [ example three ] provides a page resource preloading method, which includes further optimizing, by using a state transition model, a jump probability that the current page jumps to each page to be jumped, and specifically may be optimized as follows: calling a predetermined state transition matrix through a state transition model, wherein rows and columns in the state transition matrix represent function pages in the target application software; determining the current page in the row of the state transition matrix, and forming a row vector based on the element values of the row; and taking the isotropic values in the row vector as the jumping probability from the current page to each page to be jumped.

According to one or more embodiments of the present disclosure, an [ example four ] provides a page resource preloading method, which includes further optimization of a target page for determining a next time window from function pages of the target application software according to the current page, and specifically may be optimized as follows: after the target application software is operated, setting a historical page set of historical pages presented in a period of time before the current time window; forming a triggered page sequence by each historical page in the historical page set and the current page; inputting the triggered page sequence serving as input data into a pre-trained circulating network model to obtain a state prediction sequence output by the circulating network model; and determining a target page of the next time window from the functional pages of the target application software according to the state prediction sequence.

According to one or more embodiments of the present disclosure, [ example five ] there is provided a page resource preloading method, including further optimization of a target page for determining a next time window from function pages of the target application software according to the state prediction sequence, which may be specifically optimized as: extracting 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; and determining a functional page matched with the target state value from the target application software, and taking the matched functional page as a target page of the next time window.

According to one or more embodiments of the present disclosure, an [ example six ] provides a page resource preloading method, which includes further optimization of a target page for determining a next time window from function pages of the target application software according to the current page, and specifically may be optimized as follows: searching a function page association table obtained by updating in advance, and obtaining a reference prediction page matched with the current page from the function page association table; taking the reference prediction page as a target page of the next time window; and updating the function page association table by setting an updating period.

According to one or more embodiments of the present disclosure, [ example seven ] there is provided a page resource preloading method, where the method includes determining an update of the function page association table, and specifically may include: acquiring historical operation information corresponding to the target application software when the target application software operates in a historical time period, wherein the historical operation information comprises historical execution information of a function page; analyzing historical execution information of the function pages, and determining the next function page which is jumped after each function page in the application software is executed in the historical time period; summarizing each next function page related to each function page, counting the related times of each next function page, and taking the next function page corresponding to the highest related times as a reference prediction page of the function page; and summarizing each functional page and the related reference prediction pages to form a functional page association table.

According to one or more embodiments of the present disclosure, [ example eight ] there is provided a page resource preloading device, including: the first determination module is used for determining a current page presented by the target application software in a current time window; the second determining module is used for determining a target page of a next time window from the functional pages of the target application software according to the current page; and the resource preloading module is used for determining the page resource on which the target page runs and preloading the page resource in the current time window.

According to one or more embodiments of the present disclosure, [ example nine ] there is provided an electronic device comprising one or more processors; a storage device, configured to store one or more programs, which when executed by the one or more processors, cause the one or more processors to implement the method for preloading page resources as described in any one of examples one to seven above.

According to one or more embodiments of the present disclosure, [ example ten ] there is provided a storage medium containing computer-executable instructions for performing the page resource preloading method as described in any one of example one to example seven when executed by a computer processor.

The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the disclosure herein is not limited to the particular combination of features described above, but also encompasses other embodiments in which any combination of the features described above or their equivalents does not depart from the spirit of the disclosure. For example, the above features and (but not limited to) the features disclosed in this disclosure having similar functions are replaced with each other to form the technical solution.

Further, while operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Likewise, while several specific implementation details are included in the above discussion, these should not be construed as limitations on the scope of the disclosure. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.

Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.

Claims

1. A method for preloading page resources is characterized by comprising the following steps:

2. The method of claim 1, wherein determining a target page of a next time window from the function pages of the target application software according to the current page comprises:

taking a functional page contained in the target application software as a page to be jumped;

determining the jump probability of the current page jumping to each page to be jumped through a state transition model;

and determining the page to be jumped corresponding to the maximum jump probability as a target page of the next time window.

3. The method of claim 2, wherein determining, by a state transition model, a jump probability that the current page jumps to each of the pages to be jumped comprises:

4. The method of claim 1, wherein determining a target page of a next time window from the function pages of the target application software according to the current page comprises:

after the target application software is operated, setting a historical page set of historical pages presented in a period of time before the current time window;

forming a triggered page sequence by each historical page in the historical page set and the current page;

inputting the triggered page sequence serving as input data into a pre-trained circulating network model to obtain a state prediction sequence output by the circulating network model;

and determining a target page of the next time window from the functional pages of the target application software according to the state prediction sequence.

5. The method of claim 4, wherein determining the target page of the next time window from the functional pages of the target application software according to the state prediction sequence comprises:

6. The method of claim 1, wherein determining a target page of a next time window from the function pages of the target application software according to the current page comprises:

searching a function page association table obtained by updating in advance, and obtaining a reference prediction page matched with the current page from the function page association table;

taking the reference prediction page as a target page of the next time window;

and updating the function page association table by setting an updating period.

7. The method according to claim 6, wherein the updating determination step of the function page association table comprises:

8. A page resource preloading device, comprising:

9. An electronic device, characterized in that the electronic device comprises:

one or more processors;

a storage device for storing one or more programs,

when executed by the one or more processors, cause the one or more processors to implement the method of page resource preloading as recited in any one of claims 1-7.

10. A storage medium containing computer-executable instructions for performing the method of preloading page resources of any one of claims 1-7 when executed by a computer processor.