CN113779450A - Page access method and page access device - Google Patents

Page access method and page access device Download PDF

Info

Publication number
CN113779450A
CN113779450A CN202010898381.5A CN202010898381A CN113779450A CN 113779450 A CN113779450 A CN 113779450A CN 202010898381 A CN202010898381 A CN 202010898381A CN 113779450 A CN113779450 A CN 113779450A
Authority
CN
China
Prior art keywords
page
access
node
sequence
target
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202010898381.5A
Other languages
Chinese (zh)
Inventor
龚小冬
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jingdong Century Trading Co Ltd
Beijing Wodong Tianjun Information Technology Co Ltd
Original Assignee
Beijing Jingdong Century Trading Co Ltd
Beijing Wodong Tianjun Information Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Jingdong Century Trading Co Ltd, Beijing Wodong Tianjun Information Technology Co Ltd filed Critical Beijing Jingdong Century Trading Co Ltd
Priority to CN202010898381.5A priority Critical patent/CN113779450A/en
Publication of CN113779450A publication Critical patent/CN113779450A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/957—Browsing optimisation, e.g. caching or content distillation
    • G06F16/9574—Browsing optimisation, e.g. caching or content distillation of access to content, e.g. by caching
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/957—Browsing optimisation, e.g. caching or content distillation

Abstract

The invention discloses a page access method and a page access device, and relates to the technical field of computers. One embodiment of the method comprises: acquiring a current access page, and generating a specific access page sequence corresponding to the current access page based on a preset page access order; determining a next access page corresponding to the specific access page sequence and a transition probability corresponding to the next access page by using the target page access tree; and selecting a target access page from the next access page according to the transition probability corresponding to the next access page, and performing access pretreatment on the target access page. According to the implementation method, when the user accesses the target access page, the target access page can be directly obtained through the cache, the access performance of the page is improved, and the user access experience is enhanced.

Description

Page access method and page access device
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a page access method and a page access device.
Background
In order to attract a large number of users to browse pages provided by a network platform, the platform usually decorates various effects and a large amount of information on the pages, but the content of the whole page is very large, so that the loading time of the page is long, and the access performance is poor. Therefore, how to improve the access performance of the page and improve the user access experience is an urgent problem to be solved.
In the prior art, when a user accesses a certain page, the page is firstly obtained in a cache, if the page is not in the cache, source return and page rendering are carried out, then a rendered result is stored in the cache, and simultaneously page content is returned to the user.
However, in the process of implementing the invention, the inventor finds that the prior art has at least the following problems: the existing page cache is a passive cache, that is, a user needs to access once before storing the page cache, and if a series of pages accessed by the user do not exist in the cache, the series of pages need to be rendered in real time, so that the overall access performance is poor.
Disclosure of Invention
In view of this, embodiments of the present invention provide a page access method and a page access apparatus, which can directly obtain a target access page through a cache when a user accesses the target access page, so as to improve the access performance of the page and enhance the user access experience.
To achieve the above object, according to a first aspect of the embodiments of the present invention, a page access method is provided.
The page access method of the embodiment of the invention comprises the following steps: acquiring a current access page, and generating a specific access page sequence corresponding to the current access page based on a preset page access order; determining a next access page corresponding to the specific access page sequence and a transition probability corresponding to the next access page by using a target page access tree; and selecting a target access page from the next access page according to the transition probability corresponding to the next access page, and performing access preprocessing on the target access page.
Optionally, before determining, by using the target page access tree, a next access page corresponding to the specific access page sequence and a transition probability corresponding to the next access page, the method further includes: acquiring a history access page sequence; creating a root node, setting the node state of the root node as activated, and initializing a page access tree by using the root node; and traversing the historical access page sequence, and updating the page access tree to obtain the target page access tree.
Optionally, traversing the historical access page sequence, updating the page access tree, and obtaining the target page access tree includes: traversing the historical access pages in the historical access page sequence according to the access sequence; traversing nodes in the page access tree, and updating the page access tree according to the node information of the nodes and the historical access pages; judging whether the traversal of the historical access pages in the historical access page sequence is finished or not; if so, determining the updated page access tree as the target page access tree, and if not, continuously traversing the historical access pages in the historical access page sequence to update the page access tree.
Optionally, the node information includes: page identification corresponding to the node, page access times corresponding to the node and node state; and traversing nodes in the page access tree, and updating the page access tree according to the node information of the nodes and the historical access pages, wherein the steps of traversing the nodes in the page access tree comprise: traversing nodes in the page access tree to obtain activated nodes, wherein the activated nodes are nodes with activated node states; acquiring a child node corresponding to the active node, and judging whether a page identifier corresponding to the child node is the same as the page identifier of the historical access page; if so, updating the node information of the child node, otherwise, adding the child node corresponding to the active node and setting the node information of the newly added child node; updating the node state of the activated node to be inactive when the activated node is a non-leaf node and the activated node is a non-root node; and judging whether the traversal of the nodes in the page access tree is finished or not, and if so, finishing the updating of the page access tree.
Optionally, the updating the node information of the child node includes: and increasing the page access times corresponding to the child nodes once, and updating the node states of the child nodes to be activated.
Optionally, the setting node information of the new child node includes: setting the page identification corresponding to the newly added child node as the page identification of the historical access page, increasing the page access times corresponding to the newly added child node once, and setting the node state of the newly added child node as activation.
Optionally, the determining, by using the target page access tree, a next access page corresponding to the specific access page sequence and a transition probability corresponding to the next access page includes: searching a next access page corresponding to the specific access page sequence from the target page access tree; determining a first access frequency of the specific access page sequence and a second access frequency of the next access page according to the target page access tree; and calculating the transition probability between the specific access page sequence and the next access page according to the first access times and the second access times.
Optionally, the generating a specific access page sequence corresponding to the current access page based on a preset page access order includes: determining the number of the specific access page sequences and the number of access pages contained in each specific access page sequence according to the preset page access order; and generating at least one specific access page sequence by combining the current access page and the historical access page corresponding to the current access page according to the number of the specific access page sequences and the number of the access pages contained in each specific access page sequence.
Optionally, the transition probability corresponding to the next visited page includes: the transition probability of the next access page corresponding to each specific access page sequence; and selecting a target access page from the next access page according to the transition probability corresponding to the next access page, including: acquiring a preset transition probability corresponding to each specific access page sequence; and under the condition that the transition probability of the next access page corresponding to each specific access page sequence is greater than the preset transition probability corresponding to each specific access page sequence, determining that the next access page corresponding to each specific access page sequence is the target access page.
Optionally, the performing access preprocessing on the target access page includes: rendering and caching the target access page; and the method further comprises: and deleting the target access page from the cache based on a preset expiration time.
To achieve the above object, according to a second aspect of the embodiments of the present invention, there is provided a page access apparatus.
The page access device of the embodiment of the invention comprises: the generating module is used for acquiring a current access page and generating a specific access page sequence corresponding to the current access page based on a preset page access order; a determining module, configured to determine, by using a target page access tree, a next access page corresponding to the specific access page sequence and a transition probability corresponding to the next access page; and the access module is used for selecting a target access page from the next access page according to the transition probability corresponding to the next access page and carrying out access pretreatment on the target access page.
Optionally, the determining module is further configured to: acquiring a history access page sequence; creating a root node, setting the node state of the root node as activated, and initializing a page access tree by using the root node; and traversing the historical access page sequence, and updating the page access tree to obtain the target page access tree.
Optionally, the determining module is further configured to: traversing the historical access pages in the historical access page sequence according to the access sequence; traversing nodes in the page access tree, and updating the page access tree according to the node information of the nodes and the historical access pages; judging whether the traversal of the historical access pages in the historical access page sequence is finished or not; if so, determining the updated page access tree as the target page access tree, and if not, continuously traversing the historical access pages in the historical access page sequence to update the page access tree.
Optionally, the node information includes: page identification corresponding to the node, page access times corresponding to the node and node state; and the determining module is further configured to: traversing nodes in the page access tree to obtain activated nodes, wherein the activated nodes are nodes with activated node states; acquiring a child node corresponding to the active node, and judging whether a page identifier corresponding to the child node is the same as the page identifier of the historical access page; if so, updating the node information of the child node, otherwise, adding the child node corresponding to the active node and setting the node information of the newly added child node; updating the node state of the activated node to be inactive when the activated node is a non-leaf node and the activated node is a non-root node; and judging whether the traversal of the nodes in the page access tree is finished or not, and if so, finishing the updating of the page access tree.
Optionally, the determining module is further configured to: and increasing the page access times corresponding to the child nodes once, and updating the node states of the child nodes to be activated.
Optionally, the determining module is further configured to: setting the page identification corresponding to the newly added child node as the page identification of the historical access page, increasing the page access times corresponding to the newly added child node once, and setting the node state of the newly added child node as activation.
Optionally, the determining module is further configured to: searching a next access page corresponding to the specific access page sequence from the target page access tree; determining a first access frequency of the specific access page sequence and a second access frequency of the next access page according to the target page access tree; and calculating the transition probability between the specific access page sequence and the next access page according to the first access times and the second access times.
Optionally, the generating module is further configured to: determining the number of the specific access page sequences and the number of access pages contained in each specific access page sequence according to the preset page access order; and generating at least one specific access page sequence by combining the current access page and the historical access page corresponding to the current access page according to the number of the specific access page sequences and the number of the access pages contained in each specific access page sequence.
Optionally, the transition probability corresponding to the next visited page includes: the transition probability of the next access page corresponding to each specific access page sequence; and the access module is further configured to: acquiring a preset transition probability corresponding to each specific access page sequence; and under the condition that the transition probability of the next access page corresponding to each specific access page sequence is greater than the preset transition probability corresponding to each specific access page sequence, determining that the next access page corresponding to each specific access page sequence is the target access page.
Optionally, the access module is further configured to: rendering and caching the target access page; and deleting the target access page from the cache based on a preset expiration time.
To achieve the above object, according to a third aspect of embodiments of the present invention, there is provided an electronic apparatus.
An electronic device of an embodiment of the present invention includes: one or more processors; the storage device is used for storing one or more programs, and when the one or more programs are executed by one or more processors, the one or more processors realize the page access method of the embodiment of the invention.
To achieve the above object, according to a fourth aspect of embodiments of the present invention, there is provided a computer-readable medium.
A computer-readable medium of an embodiment of the present invention stores thereon a computer program, and the program implements a page access method of an embodiment of the present invention when executed by a processor.
One embodiment of the above invention has the following advantages or benefits: according to the page access method provided by the embodiment of the invention, the specific access page sequence corresponding to the current access page can be generated by utilizing the preset page access order, and then the specific access page sequence is analyzed, so that the next access page which is possibly accessed by a user is predicted, and the prediction precision of the target access page is improved; in addition, the specific access page sequence can be analyzed based on the target access page tree to obtain a target access page, and then the target access page can be subjected to access preprocessing, so that when a user accesses the target access page, the target access page can be directly obtained through caching, the access performance of the page is improved, and the user access experience is enhanced. In addition, in the embodiment of the invention, the target page access tree can be generated according to the historical access page sequence, and the generated target page access tree records the access relation among the pages and the access times of each page, so that the transition probability among the pages can be obtained through the target access page tree, and further the target access page can be obtained, so that the access pretreatment can be carried out on the target access page, and when a user accesses the target access page, the target access page can be directly obtained from the cache, the page access performance is provided, and better access experience is provided for the user.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic diagram of the main steps of a page access method according to an embodiment of the invention;
FIG. 2 is a schematic diagram of a structure of a page access tree;
FIG. 3 is a schematic diagram of the main flow of a method of generating a target page access tree according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating a process for building a target page access tree according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of the main flow of a page access method according to an embodiment of the invention;
FIG. 6 is a schematic diagram of the main modules of a page access apparatus according to an embodiment of the present invention
FIG. 7 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 8 is a schematic structural diagram of a computer system suitable for implementing a terminal device or a server according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
Fig. 1 is a schematic diagram of main steps of a page access method according to an embodiment of the present invention, and as shown in fig. 1, the main steps of the page access method may include:
step S101, acquiring a current access page, and generating a specific access page sequence corresponding to the current access page based on a preset page access order;
step S102, determining a next access page corresponding to a specific access page sequence and a transition probability corresponding to the next access page by using a target page access tree;
and S103, selecting a target access page from the next access page according to the transition probability corresponding to the next access page, and performing access preprocessing on the target access page.
The current access page refers to a page which is accessed by a user, and the next page which is possibly accessed by the user is predicted by analyzing the current access page in the embodiment of the invention. In view of the fact that only the current access page is analyzed, the prediction precision is low, and therefore in the embodiment of the invention, the specific access page sequence corresponding to the current access page is generated by using the preset page access order, and then the specific access page sequence is analyzed to obtain the next page which is possibly accessed by the user. The page access order indicates a historical access page on which a next page possibly accessed by the user needs to be predicted, for example, if the page access order is 5, it is stated that the next page possibly accessed by the user needs 5 historical access pages, that is, the current access page and the previous 4 historical access pages corresponding to the current access page.
Because the two adjacent access pages have close relationship, for example, the user accesses the page abc in sequence, and the current access page is c, it is indicated that the relationship between c and the next access page of the user is close, then b is b, then a is a, that is, the more adjacent to the historical access page of the current access page, the greater the influence on the accuracy of the prediction result is, so that the historical access page corresponding to the current access page and the current access page can be obtained, the corresponding specific access page sequence can be obtained, and then the specific access page sequence is utilized to perform subsequent prediction, thereby further improving the prediction accuracy. The specific access sequence is a page sequence which is generated according to a current access page and a preset page access order and used for predicting a next page which is possibly accessed by a user.
After the specific access page sequence is obtained, a next access page corresponding to the specific access page sequence can be obtained by using the target page access tree, and the transition probability corresponding to the next access page is calculated. The page cache in the prior art is a passive cache, that is, a user accesses the page cache and then stores the page cache into the cache, so that if a series of pages accessed by the user do not exist in the cache, the series of pages all need to be rendered in real time, and the technical problem of poor overall access performance is caused. In the embodiment of the invention, after the specific access page sequence corresponding to the current access page is obtained, the next access page corresponding to the specific access page sequence can be obtained by using the target page access tree, then the target access page is selected from the next access page according to the transition probability, and then the target access page can be loaded into the cache. The target page access tree is a tree model constructed by utilizing historical access pages; the transition probability corresponding to the next access page refers to the probability of jumping from a specific access page sequence to the next access page.
Through step S102, a next visited page corresponding to the specific visited page sequence and a probability of jumping from the specific visited page sequence to the next visited page may be determined using the target page access tree. Next, in step S103, a target access page can be selected from the next access page according to the transition probability corresponding to the next access page, and access preprocessing is performed on the target access page. For example, a preset transition probability is set, if the transition probability corresponding to the next visited page is greater than the preset transition probability, it may be determined that the next visited page is the target visited page, otherwise, if the transition probability corresponding to the next visited page is not greater than the preset transition probability, it is determined that the next visited page is not the target visited page.
In a reference embodiment of the present invention, the access preprocessing on the target access page may include: and performing rendering processing and caching processing on the target access page. After the target access page is rendered and cached, when a user accesses the target access page, the target access page can be directly obtained from the cache, and the page access performance is improved. In addition, in a referential embodiment of the present invention, the page access method may further include: and deleting the target access page from the cache based on the preset expiration time. In order to release the cache pressure, the expiration time of the target access page may be set, for example, 10 minutes, and if the target access page is not accessed within 10 minutes, the target access page may be deleted from the cache, so as to improve the utilization efficiency of the cache resource.
According to the page access technical scheme provided by the embodiment of the invention, a specific access page sequence corresponding to the current access page can be generated by utilizing a preset page access order, and then the specific access page sequence is analyzed, so that the next access page which is possibly accessed by a user is predicted, and the prediction precision of the target access page is improved; in addition, the specific access page sequence can be analyzed based on the target access page tree to obtain a target access page, and then the target access page can be subjected to access preprocessing, so that when a user accesses the target access page, the target access page can be directly obtained through caching, the access performance of the page is improved, and the user access experience is enhanced.
In a referential embodiment of the present invention, generating a specific access page sequence corresponding to a current access page based on a preset page access order may include: determining the number of specific access page sequences and the number of access pages contained in each specific access page sequence according to a preset page access order; and generating at least one specific access page sequence by combining the current access page and the historical access page corresponding to the current access page according to the number of the specific access page sequences and the number of the access pages contained in each specific access page sequence.
For ease of understanding, specific examples are provided below to illustrate the form of a particular sequence of access pages. Assuming that the current access page is e, the preset page access order is 5, the first 4 historical access pages abcd (ordered according to the access order) corresponding to the current access page e are obtained, the page for generating at least one specific access page sequence is abcde, the generated at least one specific access page sequence may be e, de, cde, bcde, abcde, it can be seen that each obtained specific access page sequence includes the current access page, and the number of pages included in each specific access page sequence is different, which is equivalent to respectively predicting by using 5 historical access pages, predicting by using 4 historical access pages, predicting by using 3 historical access pages, predicting by using 2 historical access pages, predicting by using 1 historical access page, and then analyzing all prediction results, the prediction precision can be improved, the page access performance is further improved, and the user experience is better. In addition, the preset page access order in the above example is set to 5, which is not limited in the embodiment of the present invention and may be set according to an actual situation.
The target page access tree plays an important role in the embodiment of the invention, the target page access tree can be used for predicting the next access page of the user and the corresponding transition probability of the next access page, and the selection of the next access page directly influences the accuracy of the target access page and further influences the page access performance, so that the generation of the target page access tree is an important component in the embodiment of the invention. The target access page tree records the access relation between the pages and the access times of each page, so that the transition probability between the pages can be obtained by the target access page tree. In the embodiment of the present invention, a target access page tree may be generated by using a historical access page sequence, and the specific implementation may be: acquiring a history access page sequence; establishing a root node, setting the node state of the root node as activated, and initializing a page access tree by using the root node; and traversing the historical access page sequence, and updating the page access tree to obtain a target page access tree.
For ease of understanding, the composition of the target page access tree is first introduced. Fig. 2 is a schematic diagram of a structure of a page access tree. In FIG. 2, Root is the Root node, representing the beginning of the tree, the Root node being order 0; node(s)ijAnd the j node of the ith level is represented, the last layer is L, and the whole page access tree is represented as an L level access tree. The node information corresponding to each node may be:
(pageij,countij,activeij) Wherein pageijIndicating the visited page, count, corresponding to the current nodeijIndicating the number of page accesses, active, corresponding to the current nodeijIndicating whether the current node is activated, true is activated, and false is inactivated), so that activation indicates whether the page corresponding to the current node is just the page to be accessed, and the next page to be accessed is associated on the basis of the activated page. The arrows connected between the nodes indicate that an access relationship exists between the pages corresponding to the nodes, namely that another page is accessed after the page is accessed. In summary, the node information of each node may include: the page identification corresponding to the node, the page access times corresponding to the node and the node state. The page identifier corresponding to the node indicates an access page corresponding to the node, for example, if the page identifier corresponding to a certain node11 is a, it indicates that the access page corresponding to the node is accessedAsking the page a; the page access times corresponding to the node indicate the access times of the access page corresponding to the node, for example, if the page identifier corresponding to a certain node11 is a, and the access times are 3, it indicates that the page a is accessed 3 times; the node status may be activated or inactivated, for example, a page identifier corresponding to a certain node11 is a, if the node status is activated, it indicates that the page a is just accessed, and if the node status is inactivated, it indicates that the page a is not accessed.
In the embodiment of the invention, the target page access tree is generated by utilizing the historical access page sequence, so that the generated target page access tree is more consistent with the actual condition of user access, the accuracy of the target access page is improved, and the page access performance can be improved. The generation of the target page access tree corresponds to the node included in the generation of the target page access tree, and therefore, a root node needs to be created first. The root node is a component of the tree, also called the tree root, and all non-empty binary trees have one root node, which is an ancestor of all nodes except the root node in the same tree and has no father node. Then, the node state of the root node is set to be active, which indicates that any page information can be accessed from the root node. That is, a Root node, that is, a level 0 node of the page access tree is created, node information corresponding to the Root node is set to (page _ null, count _ 0, active _ true), a node status active of the node is always true, which indicates that arbitrary page information can be accessed from the node, and since the Root node does not indicate any page, page _ null and count _ 0 can be set.
After the root node is created, the initialization process of the page access tree is equivalently completed. And then, updating the page access tree by traversing the historical access page sequence to finally obtain the target page access tree. In a referential embodiment of the present invention, the method for updating the page access tree to obtain the target page access tree may be: traversing the historical access pages in the historical access page sequence according to the access sequence; traversing nodes in the page access tree, and updating the page access tree according to node information of the nodes and historical access pages; judging whether the traversal of the historical access pages in the historical access page sequence is finished or not; if so, determining the updated page access tree as a target page access tree, and if not, continuously traversing the historical access pages in the historical access page sequence to update the page access tree.
Specifically, the traversal history access Page sequence Page ═ { p ═ p0,p1,…,pNAcquiring each historical access page p according to the access sequencei,piAnd e, the Page belongs to the Page, and the Page access tree is updated by sequentially utilizing the historical access pages and the node information of the Page access tree.
In a referential embodiment of the present invention, traversing nodes in a page access tree, updating the page access tree according to node information of the nodes and historical access pages, includes: traversing nodes in a page access tree, and acquiring activated nodes, wherein the activated nodes are nodes with activated node states; acquiring a child node corresponding to the active node, and judging whether a page identifier corresponding to the child node is the same as a page identifier of a historical access page or not; if so, updating the node information of the child nodes, otherwise, adding the child nodes corresponding to the active node and setting the node information of the newly added child nodes; under the condition that the activated node is a non-leaf node and the activated node is a non-root node, updating the node state of the activated node to be inactive; and judging whether the traversal of the nodes in the page access tree is finished or not, and if so, finishing the updating of the page access tree.
For historical access page piThe updating process may be: firstly, traversing nodes in a page access tree, acquiring an activated node in the current page access tree, namely a node with an activated node state, explaining in the above node information that the node state of one node is activated, indicating that a page p corresponding to the node is activatedkIs in an accessed state and therefore needs to be accessed from page pkJump to page piI.e. needs to be read from page pkThe corresponding node is connected to page piA corresponding node. After the activated node is obtained, the child node corresponding to the activated node, namely the child node branched from the activated node, can be obtainedThe next level node, or the next level node pointed to by the active node arrow. Then, judging the page identification and p corresponding to the child nodeiWhether the same is found or not, if so, the slave page p is already establishedkTo page piThe node information of the child node is updated at this time, that is, the number of page accesses corresponding to the child node can be increased once, and the node state of the child node is updated to be activated. If not, the slave page p needs to be establishedkTo page piThe page jump relationship of (2) needs to newly add a child node corresponding to the active node and set node information of the newly added child node, that is, a page identifier corresponding to the newly added child node can be set as a page identifier of a history access page, the page access times corresponding to the newly added child node are increased once, and the node state of the newly added child node is set as active.
It can be found that the currently visited page has been selected from page pkBecome page piThen the page p needs to be updatedkThe corresponding node state. In the embodiment of the present invention, after the node information of the child node corresponding to the active node is updated or the child node corresponding to the active node is newly added, the node state of the active node may be updated to be inactive when the active node is a non-leaf node and the active node is a non-root node. A leaf node refers to the node at the bottom of the tree, and a leaf node has no children. The node state corresponding to the root node is always in an activated state, so that updating is not needed. Then, whether each node in the page access tree is traversed or not is judged, if yes, the page p is accessed by using the historyiAnd updating the page access tree, and if not, continuing node traversal.
Accessing page p using historyiAnd after the page access tree is updated, updating the page access tree by using the next historical access page until all historical access page sequences in the historical access page sequences are traversed, and finally obtaining an updated page access tree as a target access page tree.
Fig. 3 is a schematic diagram of a main flow of a method for generating a target page access tree according to an embodiment of the present invention. As shown in fig. 3, the main flow of the method for generating the target page access tree may include:
step S301, acquiring a historical access page sequence, creating a root node, setting the node state of the root node as activated, and initializing a page access tree by using the root node;
step S302, traversing the historical access pages in the historical access page sequence according to the access sequence;
step S303, traversing nodes in the page access tree, acquiring activated nodes, and acquiring child nodes corresponding to the activated nodes, wherein the activated nodes are the nodes with activated node states;
step S304, judging whether the page identification corresponding to the child node is the same as the page identification of the historical access page, if so, executing step S305, otherwise, executing step S306;
step S305, increasing the page access times corresponding to the child nodes once, and updating the node states of the child nodes to be activated;
step S306, adding the corresponding sub-node of the active node newly, and setting the node information corresponding to the newly added sub-node, specifically: setting a page identifier corresponding to the newly added child node as a page identifier of a historical access page, increasing the page access times corresponding to the newly added child node once, and setting the node state of the newly added child node as activation;
step S307, under the condition that the activated node is a non-leaf node and the activated node is a non-root node, updating the node state of the activated node to be inactive;
step S308, judging whether the traversal of the nodes in the page access tree is finished, if so, executing step S309, and if not, executing step S303;
step S309, judging whether the traversal of the historical access pages in the historical access page sequence is completed, if so, executing step S310, and if not, executing step S302;
step S310, the updated page access tree is determined as a target page access tree.
For the convenience of understanding, the page access tree is constructed by taking the history access page sequence as abcad as an example. Fig. 4 is a schematic diagram of a process for building a target page access tree according to an embodiment of the present invention. In fig. 4, first, a Root node Root (null,0, true) is constructed, a page access tree is traversed for a first historical access page a, the obtained activated node is the Root node Root, and there is no child node corresponding to the page a under the Root node Root, so that a child node11(a,1, true) corresponding to the Root node Root is newly added; then, for the second history access page b, traversing the page access tree, and obtaining activated nodes as Root nodes Root (null,0, true) and node11(a,1, true), and there are no child nodes corresponding to page b under Root node Root and node11, so that child nodes 12(b,1, true) corresponding to the newly added Root node and child nodes 21(b,1, true) corresponding to the newly added node11 are determined, at this time, it is determined that node11 is neither Root node nor leaf node, and therefore the node information of node11 needs to be changed to (a,1, false); and by parity of reasoning, analyzing the historical access page cad in sequence to obtain the target page access tree.
In the embodiment of the invention, the target page access tree is generated according to the historical access page sequence, and the generated target page access tree records the access relation among the pages and the access times of each page, so that the transition probability among the pages can be obtained by the target access page tree. Therefore, the target page access tree can be utilized to determine the next access page corresponding to the specific access page sequence and the transition probability corresponding to the next access page, and further the target access page can be obtained, so that the target access page can be subjected to access preprocessing, and when a user accesses the target access page, the target access page can be directly obtained from the cache, the page access performance is provided, and better access experience is provided for the user.
In a referential embodiment of the present invention, determining a next visited page corresponding to a specific visited page sequence and a transition probability corresponding to the next visited page by using a target page visited tree may include: searching a next access page corresponding to the specific access page sequence from the target page access tree; determining a first access frequency of a specific access page sequence and a second access frequency of a next access page according to the target page access tree; and calculating the transition probability between the specific access page sequence and the next access page according to the first access times and the second access times.
Since the target page access tree records the access relationship of the pages, that is, the access order of the pages, a next access page corresponding to the specific access page sequence can be obtained from the target page access tree, for example, the specific access page sequence is abc, and then the corresponding next access page is a, that is, after the abc is accessed, the page a is accessed.
The target page access tree records page access times besides page access sequence, so that the transition probability of jumping from a specific access page sequence to the next access page can be obtained by utilizing the recorded page access times. Specifically, a first access frequency of a specific access page sequence, that is, a frequency of accessing the specific access page sequence, may be queried from the target page access tree; the second access times of the next access page corresponding to the specific access page sequence can be inquired, namely, the times of accessing the next access page after accessing the specific access page sequence; the ratio of the second access times to the first access times is then used as the probability of jumping from the sequence of specific access pages to the next access page. For example, if the specific access page sequence is badc, the first access frequency is 10, the corresponding next access pages are e, d and b, and the corresponding second access frequencies are 2, 5 and 3, respectively, then the probability of accessing e after accessing badc is 0.2, the probability of accessing d after accessing badc is 0.5, and the probability of accessing b after accessing badc is 0.3. For another example, if the specific access page sequence is abc, it may be queried from the target page access tree shown in fig. 4 that the first access frequency corresponding to the specific access page sequence abc is 1, and after the specific access page sequence abc is accessed, page a is accessed, so it may be considered that in fig. 4, the transition probability between the specific access page sequence abc and the next access page a is 1, that is, in the access page abc, the page to be accessed next time is a.
In consideration of the embodiment of the present invention, the number of the specific access page sequences and the number of the access pages included in each specific access page sequence may be determined according to a preset page access order, and then at least one specific access page sequence is generated according to the number of the specific access page sequences and the number of the access pages included in each specific access page sequence, and by combining the current access page and the historical access page corresponding to the current access page.
It is known that the number of the generated specific access page sequences may be at least one, so the transition probability corresponding to the next access page may include: transition probabilities of a next visited page corresponding to each particular sequence of visited pages. In a reference embodiment of the present invention, selecting a target access page from next access pages according to transition probabilities corresponding to the next access pages may include: acquiring a preset transition probability corresponding to each specific access page sequence; and under the condition that the transition probability of the next access page corresponding to each specific access page sequence is greater than the preset transition probability corresponding to each specific access page sequence, determining the next access page corresponding to each specific access page sequence as a target access page.
For example, the generated specific access page sequences are e and de, the corresponding preset transition probabilities are y1 and y2, the obtained next access page sequence is a and d, the transition probabilities corresponding to a and d are x1 and x2 through calculation, then y1 is compared with x1, y2 is compared with x2, if x1 is greater than y1, a is indicated as a target access page, if x2 is greater than y2, d is indicated as a target access page, and access preprocessing is performed on a and d. It should be noted that the number of next access pages corresponding to each specific access page sequence may be multiple, and at this time, the transition probability corresponding to each next access page needs to be calculated respectively, and then it is determined whether the next access page is the target access page.
Fig. 5 is a schematic diagram of a main flow of a page access method according to an embodiment of the present invention. As shown in fig. 5, the main flow of the page access method may include:
step S501, acquiring a current access page;
step S502, determining the number of specific access page sequences and the number of access pages contained in each specific access page sequence according to a preset page access order;
step S503, generating at least one specific access page sequence according to the number of specific access page sequences and the number of access pages contained in each specific access page sequence and by combining the current access page and the historical access page corresponding to the current access page;
step S504, selecting a specific access page sequence from at least one specific access page sequence;
step S505, searching a next access page corresponding to the specific access page sequence from the target page access tree;
step S506, determining a first access frequency of the specific access page sequence and a second access frequency of a next access page according to the target page access tree;
step S507, calculating the transition probability between the specific access page sequence and the next access page according to the first access times and the second access times;
step S508, obtaining a preset transition probability corresponding to the specific access page sequence;
step S509, determining whether the calculated transition probability between the specific access page sequence and the next access page is greater than a preset transition probability corresponding to the specific access page sequence, if so, performing step S510, and if not, performing step S511;
step S510, determining a next access page corresponding to the specific access page sequence as a target access page;
step S511, determining whether a specific access page sequence of the at least one specific access page sequence has been traversed, if yes, performing step S512, and if no, performing step S504;
step S512, the target access page is rendered and cached.
It should be noted that, in step S504, the specific access page sequence selected from the at least one specific access page sequence needs to be a specific access page sequence for traversal, that is, a next access page sequence corresponding to the specific access page sequence has not been analyzed yet. Also, the target page access tree utilized in the above steps can be generated by the above embodiments, and will not be described in detail herein. In addition, in the page access method of the embodiment of the present invention, the expiration time of the target access page may also be set, and specifically, if the target access page is not accessed within a certain time, the target access page may be deleted from the cache. According to the page access method provided by the embodiment of the invention, the specific access page sequence corresponding to the current access page can be generated by utilizing the preset page access order, and then the specific access page sequence is analyzed, so that the next access page which is possibly accessed by a user is predicted, and the prediction precision of the target access page is improved; in addition, the specific access page sequence can be analyzed based on the target access page tree to obtain a target access page, and then the target access page can be subjected to access preprocessing, so that when a user accesses the target access page, the target access page can be directly obtained through caching, the access performance of the page is improved, and the user access experience is enhanced. In addition, in the embodiment of the invention, the target page access tree can be generated according to the historical access page sequence, and the generated target page access tree records the access relation among the pages and the access times of each page, so that the transition probability among the pages can be obtained through the target access page tree, and further the target access page can be obtained, so that the access pretreatment can be carried out on the target access page, and when a user accesses the target access page, the target access page can be directly obtained from the cache, the page access performance is provided, and better access experience is provided for the user.
Fig. 6 is a schematic diagram of main modules of a page access apparatus according to an embodiment of the present invention. As shown in fig. 6, the main modules of the page access apparatus 600 may include: a generation module 601, a determination module 602 and an access module 603.
The generating module 601 may be configured to obtain a current access page, and generate a specific access page sequence corresponding to the current access page based on a preset page access order; the determining module 602 may be configured to determine, by using the target page access tree, a next access page corresponding to the specific access page sequence and a transition probability corresponding to the next access page; the access module 603 may be configured to select a target access page from the next access page according to the transition probability corresponding to the next access page, and perform access preprocessing on the target access page.
In this embodiment of the present invention, the determining module 602 may further be configured to: acquiring a history access page sequence; establishing a root node, setting the node state of the root node as activated, and initializing a page access tree by using the root node; and traversing the historical access page sequence, and updating the page access tree to obtain a target page access tree.
In this embodiment of the present invention, the determining module 602 may further be configured to: traversing the historical access pages in the historical access page sequence according to the access sequence; traversing nodes in the page access tree, and updating the page access tree according to node information of the nodes and historical access pages; judging whether the traversal of the historical access pages in the historical access page sequence is finished or not; if so, determining the updated page access tree as a target page access tree, and if not, continuously traversing the historical access pages in the historical access page sequence to update the page access tree.
In this embodiment of the present invention, the node information may include: the page identification corresponding to the node, the page access times corresponding to the node and the node state. And, the determining module 602 may be further operable to: traversing nodes in a page access tree, and acquiring activated nodes, wherein the activated nodes are nodes with activated node states; acquiring a child node corresponding to the active node, and judging whether a page identifier corresponding to the child node is the same as a page identifier of a historical access page or not; if so, updating the node information of the child nodes, otherwise, adding the child nodes corresponding to the active node and setting the node information of the newly added child nodes; under the condition that the activated node is a non-leaf node and the activated node is a non-root node, updating the node state of the activated node to be inactive; and judging whether the traversal of the nodes in the page access tree is finished or not, and if so, finishing the updating of the page access tree.
In this embodiment of the present invention, the determining module 602 may further be configured to: and increasing the page access times corresponding to the child nodes once, and updating the node states of the child nodes to be activated.
In this embodiment of the present invention, the determining module 602 may further be configured to: setting the page identification corresponding to the newly added child node as the page identification of the historical access page, increasing the page access times corresponding to the newly added child node once, and setting the node state of the newly added child node as activation.
In this embodiment of the present invention, the determining module 602 may further be configured to: searching a next access page corresponding to the specific access page sequence from the target page access tree; determining a first access frequency of a specific access page sequence and a second access frequency of a next access page according to the target page access tree; and calculating the transition probability between the specific access page sequence and the next access page according to the first access times and the second access times.
In this embodiment of the present invention, the generating module 601 may further be configured to: determining the number of specific access page sequences and the number of access pages contained in each specific access page sequence according to a preset page access order; and generating at least one specific access page sequence by combining the current access page and the historical access page corresponding to the current access page according to the number of the specific access page sequences and the number of the access pages contained in each specific access page sequence.
In this embodiment of the present invention, the transition probability corresponding to the next visited page may include: transition probabilities of a next visited page corresponding to each particular sequence of visited pages. And, the access module 603 may be further operable to: acquiring a preset transition probability corresponding to each specific access page sequence; and under the condition that the transition probability of the next access page corresponding to each specific access page sequence is greater than the preset transition probability corresponding to each specific access page sequence, determining the next access page corresponding to each specific access page sequence as a target access page.
In this embodiment of the present invention, the access module 603 may further be configured to: rendering and caching the target access page; and deleting the target access page from the cache based on the preset expiration time.
As can be seen from the above description, the page access device according to the embodiment of the present invention can generate a specific access page sequence corresponding to a current access page by using a preset page access order, and then analyze the specific access page sequence to predict a next access page that a user may access, thereby improving the prediction accuracy of a target access page; in addition, the specific access page sequence can be analyzed based on the target access page tree to obtain a target access page, and then the target access page can be subjected to access preprocessing, so that when a user accesses the target access page, the target access page can be directly obtained through caching, the access performance of the page is improved, and the user access experience is enhanced. In addition, in the embodiment of the invention, the target page access tree can be generated according to the historical access page sequence, and the generated target page access tree records the access relation among the pages and the access times of each page, so that the transition probability among the pages can be obtained through the target access page tree, and further the target access page can be obtained, so that the access pretreatment can be carried out on the target access page, and when a user accesses the target access page, the target access page can be directly obtained from the cache, the page access performance is provided, and better access experience is provided for the user.
Fig. 7 illustrates an exemplary system architecture 700 of a page access method or page access apparatus to which embodiments of the invention may be applied.
As shown in fig. 7, the system architecture 700 may include terminal devices 701, 702, 703, a network 704, and a server 705. The network 704 serves to provide a medium for communication links between the terminal devices 701, 702, 703 and the server 705. Network 704 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
A user may use the terminal devices 701, 702, 703 to interact with a server 705 over a network 704, to receive or send messages or the like. The terminal devices 701, 702, 703 may have installed thereon various communication client applications, such as a shopping-like application, a web browser application, a search-like application, an instant messaging tool, a mailbox client, social platform software, etc. (by way of example only).
The terminal devices 701, 702, 703 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 705 may be a server providing various services, such as a background management server (for example only) providing support for shopping websites browsed by users using the terminal devices 701, 702, 703. The backend management server may analyze and perform other processing on the received data such as the product information query request, and feed back a processing result (for example, target push information, product information — just an example) to the terminal device.
It should be noted that the page access method provided by the embodiment of the present invention is generally executed by the server 705, and accordingly, the page access apparatus is generally disposed in the server 705.
It should be understood that the number of terminal devices, networks, and servers in fig. 7 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 8, shown is a block diagram of a computer system 800 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 8 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 8, the computer system 800 includes a Central Processing Unit (CPU)801 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage section 808 into a Random Access Memory (RAM) 803. In the RAM 803, various programs and data necessary for the operation of the system 800 are also stored. The CPU 801, ROM 802, and RAM 803 are connected to each other via a bus 804. An input/output (I/O) interface 805 is also connected to bus 804.
The following components are connected to the I/O interface 805: an input portion 806 including a keyboard, a mouse, and the like; an output section 807 including a signal such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 808 including a hard disk and the like; and a communication section 809 including a network interface card such as a LAN card, a modem, or the like. The communication section 809 performs communication processing via a network such as the internet. A drive 810 is also connected to the I/O interface 805 as necessary. A removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 810 as necessary, so that a computer program read out therefrom is mounted on the storage section 808 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 809 and/or installed from the removable medium 811. The computer program executes the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 801.
It should be noted that the computer readable medium shown in the present invention 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 invention, 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 the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, 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: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
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 invention. 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 or flowchart illustration, and combinations of blocks in the block diagrams 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 modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor includes a generation module, a determination module, and an access module. For example, the generation module may also be described as a module that acquires a current access page and generates a specific access page sequence corresponding to the current access page based on a preset page access order.
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: acquiring a current access page, and generating a specific access page sequence corresponding to the current access page based on a preset page access order; determining a next access page corresponding to the specific access page sequence and a transition probability corresponding to the next access page by using the target page access tree; and selecting a target access page from the next access page according to the transition probability corresponding to the next access page, and performing access pretreatment on the target access page.
According to the technical scheme of the embodiment of the invention, the specific access page sequence corresponding to the current access page can be generated by utilizing the preset page access order, and then the specific access page sequence is analyzed to predict the next access page which is possibly accessed by the user, so that the prediction precision of the target access page is improved; in addition, the specific access page sequence can be analyzed based on the target access page tree to obtain a target access page, and then the target access page can be subjected to access preprocessing, so that when a user accesses the target access page, the target access page can be directly obtained through caching, the access performance of the page is improved, and the user access experience is enhanced. In addition, in the embodiment of the invention, the target page access tree can be generated according to the historical access page sequence, and the generated target page access tree records the access relation among the pages and the access times of each page, so that the transition probability among the pages can be obtained through the target access page tree, and further the target access page can be obtained, so that the access pretreatment can be carried out on the target access page, and when a user accesses the target access page, the target access page can be directly obtained from the cache, the page access performance is provided, and better access experience is provided for the user.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (13)

1. A method for page access, comprising:
acquiring a current access page, and generating a specific access page sequence corresponding to the current access page based on a preset page access order;
determining a next access page corresponding to the specific access page sequence and a transition probability corresponding to the next access page by using a target page access tree;
and selecting a target access page from the next access page according to the transition probability corresponding to the next access page, and performing access preprocessing on the target access page.
2. The method of claim 1, wherein prior to determining a next access page corresponding to the particular sequence of access pages and transition probabilities corresponding to the next access page using a target page access tree, the method further comprises:
acquiring a history access page sequence;
creating a root node, setting the node state of the root node as activated, and initializing a page access tree by using the root node;
and traversing the historical access page sequence, and updating the page access tree to obtain the target page access tree.
3. The method of claim 2, wherein traversing the sequence of historical access pages, updating the page access tree, and obtaining the target page access tree comprises:
traversing the historical access pages in the historical access page sequence according to the access sequence;
traversing nodes in the page access tree, and updating the page access tree according to the node information of the nodes and the historical access pages;
judging whether the traversal of the historical access pages in the historical access page sequence is finished or not;
if so, determining the updated page access tree as the target page access tree, and if not, continuously traversing the historical access pages in the historical access page sequence to update the page access tree.
4. The method of claim 3, wherein the node information comprises: page identification corresponding to the node, page access times corresponding to the node and node state; and
the step of traversing the nodes in the page access tree and updating the page access tree according to the node information of the nodes and the historical access pages comprises the following steps:
traversing nodes in the page access tree to obtain activated nodes, wherein the activated nodes are nodes with activated node states;
acquiring a child node corresponding to the active node, and judging whether a page identifier corresponding to the child node is the same as the page identifier of the historical access page;
if so, updating the node information of the child node, otherwise, adding the child node corresponding to the active node and setting the node information of the newly added child node;
updating the node state of the activated node to be inactive when the activated node is a non-leaf node and the activated node is a non-root node;
and judging whether the traversal of the nodes in the page access tree is finished or not, and if so, finishing the updating of the page access tree.
5. The method of claim 4, wherein the updating the node information of the child node comprises:
and increasing the page access times corresponding to the child nodes once, and updating the node states of the child nodes to be activated.
6. The method according to claim 4, wherein the setting of the node information of the new child node comprises:
setting the page identification corresponding to the newly added child node as the page identification of the historical access page, increasing the page access times corresponding to the newly added child node once, and setting the node state of the newly added child node as activation.
7. The method of claim 1, wherein determining a next access page corresponding to the specific access page sequence and a transition probability corresponding to the next access page using the target page access tree comprises:
searching a next access page corresponding to the specific access page sequence from the target page access tree;
determining a first access frequency of the specific access page sequence and a second access frequency of the next access page according to the target page access tree;
and calculating the transition probability between the specific access page sequence and the next access page according to the first access times and the second access times.
8. The method according to claim 1, wherein the generating a specific access page sequence corresponding to the current access page based on a preset page access order comprises:
determining the number of the specific access page sequences and the number of access pages contained in each specific access page sequence according to the preset page access order;
and generating at least one specific access page sequence by combining the current access page and the historical access page corresponding to the current access page according to the number of the specific access page sequences and the number of the access pages contained in each specific access page sequence.
9. The method of claim 8, wherein the transition probability for the next visited page comprises: the transition probability of the next access page corresponding to each specific access page sequence; and
selecting a target access page from the next access page according to the transition probability corresponding to the next access page, including:
acquiring a preset transition probability corresponding to each specific access page sequence;
and under the condition that the transition probability of the next access page corresponding to each specific access page sequence is greater than the preset transition probability corresponding to each specific access page sequence, determining that the next access page corresponding to each specific access page sequence is the target access page.
10. The method of claim 1, wherein the access preprocessing of the target access page comprises:
rendering and caching the target access page; and
the method further comprises the following steps: and deleting the target access page from the cache based on a preset expiration time.
11. A page access apparatus, comprising:
the generating module is used for acquiring a current access page and generating a specific access page sequence corresponding to the current access page based on a preset page access order;
a determining module, configured to determine, by using a target page access tree, a next access page corresponding to the specific access page sequence and a transition probability corresponding to the next access page;
and the access module is used for selecting a target access page from the next access page according to the transition probability corresponding to the next access page and carrying out access pretreatment on the target access page.
12. An electronic device, comprising:
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 any one of claims 1-10.
13. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-10.
CN202010898381.5A 2020-08-31 2020-08-31 Page access method and page access device Pending CN113779450A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010898381.5A CN113779450A (en) 2020-08-31 2020-08-31 Page access method and page access device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010898381.5A CN113779450A (en) 2020-08-31 2020-08-31 Page access method and page access device

Publications (1)

Publication Number Publication Date
CN113779450A true CN113779450A (en) 2021-12-10

Family

ID=78834952

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010898381.5A Pending CN113779450A (en) 2020-08-31 2020-08-31 Page access method and page access device

Country Status (1)

Country Link
CN (1) CN113779450A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102262661A (en) * 2011-07-18 2011-11-30 南京大学 Web page access forecasting method based on k-order hybrid Markov model
US20120317244A1 (en) * 2011-01-14 2012-12-13 Guangzhou Ucweb Computer Technology Co., Ltd Webpage pre-reading method, transfer server and webpage pre-reading system
CN105677327A (en) * 2015-12-30 2016-06-15 合一网络技术(北京)有限公司 Page information preloading method and system
CN110007978A (en) * 2018-11-20 2019-07-12 阿里巴巴集团控股有限公司 A kind of method, device and equipment preloading the page

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120317244A1 (en) * 2011-01-14 2012-12-13 Guangzhou Ucweb Computer Technology Co., Ltd Webpage pre-reading method, transfer server and webpage pre-reading system
CN102262661A (en) * 2011-07-18 2011-11-30 南京大学 Web page access forecasting method based on k-order hybrid Markov model
CN105677327A (en) * 2015-12-30 2016-06-15 合一网络技术(北京)有限公司 Page information preloading method and system
CN110007978A (en) * 2018-11-20 2019-07-12 阿里巴巴集团控股有限公司 A kind of method, device and equipment preloading the page

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
林文龙;刘业政;姜元春;: "Web浏览预测的Markov模型综述", 计算机科学, no. 01, 25 January 2008 (2008-01-25) *

Similar Documents

Publication Publication Date Title
CN107729570B (en) Data migration method and device for server
CN113590974B (en) Recommendation page configuration method and device, electronic equipment and computer readable medium
CN109992719B (en) Method and apparatus for determining push priority information
CN112783887A (en) Data processing method and device based on data warehouse
CN113190517B (en) Data integration method and device, electronic equipment and computer readable medium
CN110928594A (en) Service development method and platform
CN112783447A (en) Method, apparatus, device, medium, and article of manufacture for processing snapshots
CN113590985B (en) Page jump configuration method and device, electronic equipment and computer readable medium
CN113282489B (en) Interface testing method and device
CN112052152A (en) Simulation test method and device
CN111026629A (en) Method and device for automatically generating test script
CN112711572B (en) Online capacity expansion method and device suitable for database and table division
CN113779450A (en) Page access method and page access device
CN115080154A (en) Page display method and device, storage medium and electronic equipment
US11301498B2 (en) Multi-cloud object store access
CN113760928A (en) Cache data updating system and method
CN110888583B (en) Page display method, system and device and electronic equipment
CN113722007A (en) Configuration method, device and system of VPN branch equipment
CN109213815B (en) Method, device, server terminal and readable medium for controlling execution times
CN113656533A (en) Tree control processing method and device and electronic equipment
CN111131354B (en) Method and apparatus for generating information
CN113127416A (en) Data query method and device
CN112395510A (en) Method and device for determining target user based on activity
CN112749204A (en) Method and device for reading data
CN111782351A (en) Distributed task scheduling method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination