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

Page access method and page access device Download PDF

Info

Publication number
CN113779450B
CN113779450B CN202010898381.5A CN202010898381A CN113779450B CN 113779450 B CN113779450 B CN 113779450B CN 202010898381 A CN202010898381 A CN 202010898381A CN 113779450 B CN113779450 B CN 113779450B
Authority
CN
China
Prior art keywords
access
page
node
sequence
tree
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.)
Active
Application number
CN202010898381.5A
Other languages
Chinese (zh)
Other versions
CN113779450A (en
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/CN113779450B/en
Publication of CN113779450A publication Critical patent/CN113779450A/en
Application granted granted Critical
Publication of CN113779450B publication Critical patent/CN113779450B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Transfer Between Computers (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

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 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 utilizing 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 pretreatment on the target access page. According to the embodiment, when the user accesses the target access page, the target access page is directly obtained through the cache, so that 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 the 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 pages is long and the access performance is poor. Therefore, how to improve the access performance of the page and improve the access experience of the user is a 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, the source returning and the page rendering are carried out, then the rendered result is stored in the cache, and meanwhile, the page content is returned to the user.
However, in the implementation of the present invention, the inventor finds that at least the following problems exist in the prior art: the existing page cache is a passive cache, that is, the page cache is stored in the cache after the user accesses the page cache once, 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 the above, the embodiments of the present invention provide a page access method and a page access device, 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 an embodiment of the present invention, there is provided a page access method.
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 pretreatment 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 historical access page sequence; creating a root node, setting the node state of the root node as activation, and initializing a page access tree by using the root node; and traversing the history access page sequence, and updating the page access tree to obtain the target page access tree.
Optionally, the traversing the history access page sequence updates the page access tree to obtain the target page access tree, including: traversing the history access pages in the history 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 the historical access page; judging whether traversing of the history access pages in the history access page sequence is completed or not; if yes, determining the updated page access tree as the target page access tree, if not, continuing to traverse the historical access pages in the historical access page sequence, and updating 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 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 page, wherein the method comprises the following steps: traversing nodes in the page access tree to obtain an activated node, wherein the activated node is a node with an activated node state; acquiring a child node corresponding to the activated node, and judging whether the page identifier corresponding to the child node is the same as the page identifier of the historical access page; if yes, updating the node information of the child node, if not, newly adding the child node corresponding to the activated node, and setting the node information of the newly added child node; updating the node state of the active node to be inactive under the condition that the active node is a non-leaf node and the active node is a non-root node; judging whether traversing of the nodes in the page access tree is completed, if yes, completing 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 identifier corresponding to the new child node as the page identifier of the historical access page, increasing the page access times corresponding to the new child node once, and setting the node state of the new 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, based on the preset page access order, a specific access page sequence corresponding to the current access page includes: determining the number of the specific access page sequences and the number of the 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 according to the number of the specific access page sequences and the number of the access pages contained in each specific access page sequence by combining the current access page and the historical access pages corresponding to the current access page.
Optionally, the transition probability corresponding to the next access 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 determining the next access page corresponding to each specific access page sequence as the target access page under the condition that the transition probability of the next access page corresponding to each specific access page sequence is larger than the preset transition probability corresponding to each specific access page sequence.
Optionally, the access preprocessing on the target access page includes: rendering and caching the target access page; the method further comprises: and deleting the target access page from the cache based on a preset expiration time.
In order 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 generation 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; the determining module is used for determining a next access page corresponding to the specific access page sequence and a transition probability corresponding to the next access page by utilizing a target page access tree; 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 performing access pretreatment on the target access page.
Optionally, the determining module is further configured to: acquiring a historical access page sequence; creating a root node, setting the node state of the root node as activation, and initializing a page access tree by using the root node; and traversing the history 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 history access pages in the history 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 the historical access page; judging whether traversing of the history access pages in the history access page sequence is completed or not; if yes, determining the updated page access tree as the target page access tree, if not, continuing to traverse the historical access pages in the historical access page sequence, and updating 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 an activated node, wherein the activated node is a node with an activated node state; acquiring a child node corresponding to the activated node, and judging whether the page identifier corresponding to the child node is the same as the page identifier of the historical access page; if yes, updating the node information of the child node, if not, newly adding the child node corresponding to the activated node, and setting the node information of the newly added child node; updating the node state of the active node to be inactive under the condition that the active node is a non-leaf node and the active node is a non-root node; judging whether traversing of the nodes in the page access tree is completed, if yes, completing 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 identifier corresponding to the new child node as the page identifier of the historical access page, increasing the page access times corresponding to the new child node once, and setting the node state of the new 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 the 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 according to the number of the specific access page sequences and the number of the access pages contained in each specific access page sequence by combining the current access page and the historical access pages corresponding to the current access page.
Optionally, the transition probability corresponding to the next access 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 determining the next access page corresponding to each specific access page sequence as the target access page under the condition that the transition probability of the next access page corresponding to each specific access page sequence is larger than the preset transition probability corresponding to each specific access page sequence.
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 the 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; and the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors are enabled to realize the page access method of the embodiment of the invention.
To achieve the above object, according to a fourth aspect of the embodiments of the present invention, there is provided a computer-readable medium.
A computer readable medium of an embodiment of the present invention has stored thereon a computer program which, when executed by a processor, implements a page access method of an embodiment of the present invention.
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, then the specific access page sequence is analyzed, the next access page which is possibly accessed by a user is predicted, and the prediction precision of the target access page is improved; and 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 pretreatment, so that when a user accesses the target access page, the target access page can be directly obtained through a cache, 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 pages and the access times of each page, so that the transition probability among pages can be obtained through the target access page tree, and further the target access page can be obtained, thereby carrying out access pretreatment on the target access page, and enabling a user to directly acquire the target access page from a cache when accessing the target access page, thereby providing page access performance and better access experience for the user.
Further effects of the above-described non-conventional alternatives are 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 present invention;
FIG. 2 is a schematic diagram of the 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 schematic diagram of 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 present invention;
FIG. 6 is a schematic diagram of 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 applied;
fig. 8 is a schematic diagram of a computer system suitable for use in implementing an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, in which various details of the embodiments of the present invention are included to facilitate understanding, and are to be considered 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, a current access page is obtained, and a specific access page sequence corresponding to the current access page is generated 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 utilizing a target page access tree;
Step 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 pretreatment on the target access page.
The current access page refers to a page that the user is accessing, and in the embodiment of the invention, the next page that the user may access is predicted by analyzing the current access page. In the embodiment of the invention, the preset page access order is utilized to generate the specific access page sequence corresponding to the current access page, 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 history access page on which a next page likely to be accessed by the user is required to be predicted, for example, the page access order is 5, which indicates that 5 history access pages are required for the next page likely to be accessed by the user, that is, the current access page and the first 4 history access pages corresponding to the current access page.
Because the relations between two adjacent access pages are close, for example, the user accesses page abc successively, the current access page is c, then the relation between c and the next access page of the user is close, then b is next, and then a is next, that is, the more the historical access page of the current access page is close to, the more the influence on the accuracy of the prediction result is great, therefore, the obtained historical access page corresponding to the current access page and the current access page can be processed to obtain a corresponding specific access page sequence, and then the subsequent prediction is carried out by utilizing the specific access page sequence, so that the prediction precision is further improved. The specific access sequence is a page sequence which is generated according to the current access page and the preset page access order and is used for predicting the next page which is likely to be accessed by the user.
After the specific access page sequence is acquired, a target page access tree can be utilized to acquire a next access page corresponding to the specific access page sequence, and the transition probability corresponding to the next access page is calculated. The page cache in the prior art is a passive cache, namely, the page cache is stored in the cache after the user accesses, so that 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, 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 utilizing the target page access tree, then the target access page is selected from the next access pages according to the transition probability, and then the target access page can be loaded into the cache, which is equivalent to that after the user accesses the current access page, the target access page corresponding to the current access page can be preloaded into the cache, and when the user accesses the target access page, the target access page can be quickly obtained from the cache, the page loading time is slowed down, the page access performance is improved, and better access experience is brought to the user. 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 particular sequence of access pages to the next access page.
Through step S102, the probability of the next access page corresponding to the specific access page sequence and the probability of jumping from the specific access page sequence to the next access 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 pages according to the transition probabilities corresponding to the next access pages, and access preprocessing can be performed on the target access pages. For example, a preset transition probability is set, if the transition probability corresponding to the next access page is greater than the preset transition probability, the next access page can be determined to be the target access page, otherwise, if the transition probability corresponding to the next access page is not greater than the preset transition probability, the next access page is indicated to be not the target access page.
In a referenceable embodiment of the present invention, performing access preprocessing on a target access page may include: and rendering and caching the target access page. After rendering and caching the target access page, 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 the referenceable 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 can be set, for example, 10 minutes, if the target access page is not accessed within 10 minutes, the target access page can be deleted from the cache, and the utilization efficiency of the cache resource is improved.
According to the page access technical scheme 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, then the specific access page sequence is analyzed, the next access page which is possibly accessed by a user is predicted, and the prediction precision of the target access page is improved; and 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 pretreatment, so that when a user accesses the target access page, the target access page can be directly obtained through a cache, the access performance of the page is improved, and the user access experience is enhanced.
In a referenceable 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 the preset page access order; and generating at least one specific access page sequence according to the number of the specific access page sequences and the number of the access pages contained in each specific access page sequence by combining the current access page and the historical access pages corresponding to the current access page.
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 (sequenced according to the access order) corresponding to the current access page e are obtained, the page used for generating at least one specific access page sequence is abcde, the generated at least one specific access page sequence can be e, de, cde, bcde, abcde, it can be seen that each specific access page sequence obtained comprises the current access page, the number of pages contained in each specific access page sequence is different, and the method 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, so that the prediction accuracy 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 practical situations.
The target page access tree plays an important role in the embodiment of the invention, the target page access tree can be utilized to predict the transition probability of 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, thereby influencing 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 among pages and the access times of each page, so that the transition probability among pages can be obtained through the target access page tree. In the embodiment of the invention, the history access page sequence can be utilized to generate the target access page tree, and the specific implementation can be as follows: acquiring a historical access page sequence; creating a root node, setting the node state of the root node as activation, and initializing a page access tree by using the root node; and traversing the history 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 described. FIG. 2 is a schematic diagram of the structure of a page access tree. In fig. 2, root is the Root node, which represents the start of the tree, and the Root node is the 0 th order; node ij represents the ith node, the last layer is L, and the whole page access tree is L-level access tree. The node information corresponding to each node may be:
(page ij,countij,activeij) in which page ij represents an access page corresponding to a current node, count ij represents the number of page accesses corresponding to the current node, active ij represents whether the current node is activated, true is activated, false is not activated, so-called activation represents whether the page corresponding to the current node is exactly the accessed page, and the next access page is to be associated on the basis of the activated page. The arrow connecting the nodes indicates that there is an access relationship between pages corresponding to the nodes, that is, that another page is accessed after the page is accessed. From the above, the node information of each node may include: page identification corresponding to the node, page access times corresponding to the node, and 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, the access page corresponding to the node is indicated as a; the number of page access times corresponding to a node represents the number of times of access to a page corresponding to the node, for example, the page identifier corresponding to a node11 is a, and the number of times of access is 3, which indicates that the page a is accessed for 3 times; the node status may be active or inactive, for example, the page corresponding to a node11 is identified as a, if the node status is active, it indicates that the page a is just accessed, and if the node status is inactive, 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 in line with the actual condition of user access, thereby improving the accuracy of the target access page and further improving the page access performance. Generating the target page access tree is equivalent to generating the nodes contained in the target page access tree, so that the root node needs to be created first. The root node is a component part of the tree, also called tree root, and in all non-empty binary trees, there is only one root node, which is the ancestor of all nodes except itself in the same tree, and there is no father node. And then setting the node state of the root node to be active, and indicating that any page information can be accessed from the root node. That is, a Root node of the page access tree, that is, a level 0 node is created, node information corresponding to the Root node is set to (page=null, count=0, active=true), and the node state active of the node is always true, which means that any page information can be accessed from the node, and since the Root node does not represent 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 completed. And then, updating the page access tree by traversing the history access page sequence, and finally obtaining the target page access tree. In the referenceable embodiment of the present invention, the method for updating the page access tree to obtain the target page access tree may be: traversing history access pages in the history 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 the historical access page; judging whether traversing of the history access page in the history access page sequence is completed or not; if yes, determining the updated page access tree as a target page access tree, if not, continuing to traverse the history access pages in the history access page sequence, and updating the page access tree.
Specifically, the history access Page sequence page= { p 0,p1,…,pN }, according to the access sequence, each history access Page p i,pi epsilon Page is obtained, and the node information of each history access Page and the Page access tree is used for updating the Page access tree in turn.
In a referenceable embodiment of the present invention, traversing nodes in a page access tree, and updating the page access tree according to node information and history access pages of the nodes, including: traversing nodes in the page access tree, and acquiring an activated node, wherein the activated node is a node with an activated node state; acquiring a child node corresponding to the activated node, and judging whether the page identifier corresponding to the child node is the same as the page identifier of the historical access page; if yes, updating node information of the child nodes, if not, newly adding the child nodes corresponding to the activated nodes, and setting node information of the newly added child nodes; updating the node state of the active node to be inactive under the condition that the active node is a non-leaf node and the active node is a non-root node; and judging whether traversing of the nodes in the page access tree is completed, if so, completing updating of the page access tree.
For the history access page p i, the update procedure may be: firstly, traversing nodes in a page access tree, acquiring active nodes in the current page access tree, namely nodes with active node states, and explaining in the above node information that the node state of one node is active, wherein the page p k corresponding to the node is in an accessed state, so that the jump from the page p k to the page p i is needed, namely the connection from the node corresponding to the page p k to the node corresponding to the page p i is needed. After the active node is acquired, a child node corresponding to the active node, that is, a next layer node branched by the active node, or a next layer node pointed by an active node arrow may be acquired. Then, judging whether the page identification corresponding to the child node is the same as p i, if so, establishing a page jump relation from the page p k to the page p i, and updating the node information of the child node at this time, namely, increasing the page access times corresponding to the child node once and updating the node state of the child node to be activated. If the page access numbers are different, a page jump relation from the page p k to the page p i needs to be established, then the child node corresponding to the activated node needs to be newly added, and node information of the newly added child node is set, namely, page identification corresponding to the newly added child node can be set as page identification of the 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 activated.
It can be seen that the currently accessed page has changed from page p k to page p i, and then the node state corresponding to page p k needs to be updated. In the embodiment of the invention, after updating the node information of the child node corresponding to the active node or newly adding the child node corresponding to the active node, the node state of the active node can be updated to be inactive under the condition that the active node is a non-leaf node and the active node is a non-root node. Leaf nodes refer to the nodes of the lowest segment in the tree, and leaf nodes have no child nodes. Since the node state corresponding to the root node is always active, no update is required. Then, whether each node in the page access tree has been traversed is judged, if yes, updating of the page access tree by using the history access page p i is completed, and if not, node traversal needs to be continued.
After the page access tree is updated by using the history access page p i, the next history access page is used to update the page access tree until all the history access page sequences in the history access page sequence are traversed, and the updated page access tree finally obtained is the target access page 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. As shown in fig. 3, the main flow of the method for generating the target page access tree may include:
Step S301, acquiring a history access page sequence, creating a root node, setting the node state of the root node as activation, and initializing a page access tree by using the root node;
step S302, traversing history access pages in the history access page sequence according to the access sequence;
Step S303, traversing nodes in the page access tree, acquiring active nodes, acquiring child nodes corresponding to the active nodes, wherein the active nodes are nodes with active node states;
step S304, judging whether the page identification corresponding to the child node is the same as the page identification of the history access page, if so, executing step S305, otherwise, executing step S306;
Step S305, the page access times corresponding to the child nodes are increased once, and the node states of the child nodes are updated to be activated;
Step S306, newly adding a child node corresponding to the active node, and setting node information corresponding to the newly added child node, wherein the node information specifically comprises: setting page identifiers corresponding to the new child nodes as page identifiers of historical access pages, increasing the page access times corresponding to the new child nodes once, and setting the node states of the new child nodes as activation;
Step S307, when the active node is a non-leaf node and the active node is a non-root node, updating the node state of the active node to be inactive;
step S308, judging whether traversing of the nodes in the page access tree is completed, if yes, executing step S309, and if not, executing step S303;
Step S309, judging whether the traversal of the history access page in the history access page sequence is completed, if yes, executing step S310, otherwise, executing step S302;
step S310, determining the updated page access tree as a target page access tree.
For ease of understanding, a page access tree is constructed taking the historical access page sequence abcad as an example. Fig. 4 is a schematic diagram of a process for constructing a target page access tree according to an embodiment of the present invention. In fig. 4, a Root node (null, 0, true) is first constructed, for a first history access page is a, a page access tree is traversed, the obtained active node is the Root node, and no child node corresponding to the page a is located under the Root node Root, so that 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, wherein the obtained activated nodes are Root (null, 0, true) and node11 (a, 1, true), and the Root and node11 have no child nodes corresponding to the page b, so that child nodes node12 (b, 1, true) corresponding to the Root node are newly added, child nodes node21 (b, 1, true) corresponding to the node11 are newly added, and at the moment, it is determined that the node11 is neither a Root node nor a leaf node, and therefore, the node information of the node11 needs to be changed to be (a, 1, false); and by analogy, sequentially analyzing the historical access pages cad to finally 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 pages and the access times of each page, so that the transition probability among pages can be obtained through 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 then 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 referenceable embodiment of the present invention, determining, using a target page access tree, a next access page corresponding to a specific access page sequence and a transition probability corresponding to the next access page 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 sequence of the pages, the 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 can be queried to be a from the target page access tree shown in fig. 4, that is, after the abc is accessed, the page a is accessed.
The target page access tree records the page access times in addition to the 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 using the recorded page access times. Specifically, the first access times of the specific access page sequence, that is, the times of accessing the specific access page sequence, can 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 queried, namely, after the specific access page sequence is accessed, the times of the next access page are accessed; the ratio of the second access times to the first access times is then used as a probability of jumping from a particular sequence of access pages to the next access page. For example, if the specific access page sequence is badc, the first access times are 10, the corresponding next access pages are e, d and b, and the corresponding second access times 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, from the target page access tree shown in fig. 4, it can be queried that the first access number 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 that in fig. 4, it can be considered that 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 next access page is a.
In consideration of the embodiment of the invention, the number of the specific access page sequences and the number of the access pages contained in each specific access page sequence can be determined according to the 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 contained in each specific access page sequence and by combining the current access page and the historical access pages 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: the transition probability of the next access page corresponding to each specific access page sequence. In a referenceable embodiment of the present invention, selecting a target access page from a next access page according to a transition probability corresponding to the next access page may include: acquiring a preset transition probability corresponding to each specific access page sequence; and determining the next access page corresponding to each specific access page sequence as a target access page under the condition that the transition probability of the next access page corresponding to each specific access page sequence is larger than the preset transition probability corresponding to each specific access page sequence.
For example, the generated specific access page sequences are e and de, the corresponding preset transition probabilities are y1 and y2 respectively, the obtained next access page sequence is a and d respectively, the transition probabilities corresponding to a and d are calculated to be x1 and x2 respectively, then y1 is compared with x1, y2 is compared with x2, if x1 is larger than y1, a is indicated as a target access page, if x2 is larger than y2, d is indicated as a target access page, and access pretreatment is carried out on both a and d. It should be noted that the number of next access pages corresponding to each specific access page sequence may be plural, and at this time, it is necessary to calculate the transition probability corresponding to each next access page separately, and then determine whether it 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, obtaining 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 the preset page access order;
step S503, according to the number of the specific access page sequences and the number of the access pages contained in each specific access page sequence, combining the current access page and the historical access pages corresponding to the current access page to generate at least one specific access page sequence;
Step S504, selecting a specific access page sequence from at least one specific access page sequence;
Step S505, searching the next access page corresponding to the specific access page sequence from the target page access tree;
Step S506, determining the first access times of the specific access page sequence and the second access times of the 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, judging whether the calculated transition probability between the specific access page sequence and the next access page is greater than the preset transition probability corresponding to the specific access page sequence, if yes, executing step S510, and if no, executing step S511;
step S510, determining the next access page corresponding to the specific access page sequence as a target access page;
step S511, whether the specific access page sequence in the at least one specific access page sequence has been traversed, if yes, step S512 is executed, and if not, step S504 is executed;
Step S512, rendering and buffering are performed on the target access page.
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 the traversed specific access page sequence, that is, the 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 may be generated by the above embodiments and will not be further described herein. In addition, in the page access method of the embodiment of the invention, the expiration time of the target access page can be set, and specifically, if the target access page is not accessed within a certain time, the target access page can 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, then the specific access page sequence is analyzed, the next access page which is possibly accessed by a user is predicted, and the prediction precision of the target access page is improved; and 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 pretreatment, so that when a user accesses the target access page, the target access page can be directly obtained through a cache, 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 pages and the access times of each page, so that the transition probability among pages can be obtained through the target access page tree, and further the target access page can be obtained, thereby carrying out access pretreatment on the target access page, and enabling a user to directly acquire the target access page from a cache when accessing the target access page, thereby providing page access performance and better access experience 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, 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 pages according to the transition probability corresponding to the next access page, and perform access preprocessing on the target access page.
In an embodiment of the present invention, the determining module 602 may further be configured to: acquiring a historical access page sequence; creating a root node, setting the node state of the root node as activation, and initializing a page access tree by using the root node; and traversing the history access page sequence, and updating the page access tree to obtain a target page access tree.
In an embodiment of the present invention, the determining module 602 may further be configured to: traversing history access pages in the history 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 the historical access page; judging whether traversing of the history access page in the history access page sequence is completed or not; if yes, determining the updated page access tree as a target page access tree, if not, continuing to traverse the history access pages in the history access page sequence, and updating the page access tree.
In the embodiment of the present invention, the node information may include: page identification corresponding to the node, page access times corresponding to the node, and node state. And, the determination module 602 is further operable to further: traversing nodes in the page access tree, and acquiring an activated node, wherein the activated node is a node with an activated node state; acquiring a child node corresponding to the activated node, and judging whether the page identifier corresponding to the child node is the same as the page identifier of the historical access page; if yes, updating node information of the child nodes, if not, newly adding the child nodes corresponding to the activated nodes, and setting node information of the newly added child nodes; updating the node state of the active node to be inactive under the condition that the active node is a non-leaf node and the active node is a non-root node; and judging whether traversing of the nodes in the page access tree is completed, if so, completing updating of the page access tree.
In an 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 state of the child nodes to be activated.
In an embodiment of the present invention, the determining module 602 may further be configured to: setting page identification corresponding to the new child node as page identification of a historical access page, increasing the page access times corresponding to the new child node once, and setting the node state of the new child node as activation.
In an 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 the 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 the preset page access order; and generating at least one specific access page sequence according to the number of the specific access page sequences and the number of the access pages contained in each specific access page sequence by combining the current access page and the historical access pages corresponding to the current access page.
In the embodiment of the present invention, the transition probability corresponding to the next access page may include: the transition probability of the next access page corresponding to each specific access page sequence. And, the access module 603 may also be configured to: acquiring a preset transition probability corresponding to each specific access page sequence; and determining the next access page corresponding to each specific access page sequence as a target access page under the condition that the transition probability of the next access page corresponding to each specific access page sequence is larger than the preset transition probability corresponding to each specific access page sequence.
In the 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 a preset expiration time.
From the above description, it can be seen that 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, then analyze the specific access page sequence, predict a next access page that a user may access, and improve the prediction accuracy of a target access page; and 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 pretreatment, so that when a user accesses the target access page, the target access page can be directly obtained through a cache, 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 pages and the access times of each page, so that the transition probability among pages can be obtained through the target access page tree, and further the target access page can be obtained, thereby carrying out access pretreatment on the target access page, and enabling a user to directly acquire the target access page from a cache when accessing the target access page, thereby providing page access performance and better access experience for the user.
Fig. 7 illustrates an exemplary system architecture 700 to which the page access method or page access apparatus of embodiments of the present invention may be applied.
As shown in fig. 7, a system architecture 700 may include terminal devices 701, 702, 703, a network 704, and a server 705. The network 704 is the medium used to provide communication links between the terminal devices 701, 702, 703 and the server 705. The network 704 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
A user may interact with the server 705 via the network 704 using the terminal devices 701, 702, 703 to receive or send messages or the like. Various communication client applications such as shopping class applications, web browser applications, search class applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only) may be installed on the terminal devices 701, 702, 703.
The terminal devices 701, 702, 703 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smartphones, tablets, laptop and desktop computers, and the like.
The server 705 may be a server providing various services, such as a background management server (by way of example only) providing support for shopping-type websites browsed by users using the terminal devices 701, 702, 703. The background management server may analyze and process the received data such as the product information query request, and feedback the processing result (e.g., the target push information, the product information—only an example) to the terminal device.
It should be noted that, the page access method provided in the embodiment of the present invention is generally executed by the server 705, and accordingly, the page access device 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, there is illustrated a schematic diagram of a computer system 800 suitable for use in implementing an embodiment of the present invention. The terminal device shown in fig. 8 is only an example, and should not impose any limitation on the functions and the scope of use of the embodiment 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 according to 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 required for the operation of the system 800 are also stored. The CPU 801, ROM 802, and RAM 803 are connected to each other by a bus 804. An input/output (I/O) interface 805 is also connected to the bus 804.
The following components are connected to the I/O interface 805: an input portion 806 including a keyboard, mouse, etc.; an output portion 807 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and a speaker; a storage section 808 including a hard disk or 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. The drive 810 is also connected to the I/O interface 805 as needed. 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 needed so that a computer program read out therefrom is mounted into the storage section 808 as needed.
In particular, according to embodiments of the present disclosure, the processes described above with reference to 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 shown in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication section 809, and/or installed from the removable media 811. The above-described functions defined in the system of the present invention are performed when the computer program is executed by a Central Processing Unit (CPU) 801.
The computer readable medium shown in the present invention may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any 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 context of this document, 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, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. 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 flowcharts 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 involved in the embodiments of the present invention may be implemented in software or in hardware. The described modules may also be provided in a processor, for example, as: a processor includes a generation module, a determination module, and an access module. The names of these modules do not limit the module itself in some cases, for example, the generating module may also be described as "a module 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".
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 present alone without being fitted into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to include: 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 utilizing 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 pretreatment on the target access page.
According to the technical scheme 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, then the specific access page sequence is analyzed, the next access page which is possibly accessed by a user is predicted, and the prediction precision of the target access page is improved; and 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 pretreatment, so that when a user accesses the target access page, the target access page can be directly obtained through a cache, 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 pages and the access times of each page, so that the transition probability among pages can be obtained through the target access page tree, and further the target access page can be obtained, thereby carrying out access pretreatment on the target access page, and enabling a user to directly acquire the target access page from a cache when accessing the target access page, thereby providing page access performance and better access experience for the user.
The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives can occur depending upon design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.

Claims (11)

1. A method of 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, wherein the specific access page sequence comprises the following steps: determining the number of the specific access page sequences and the number of the access pages contained in each specific access page sequence according to the preset page access order; generating at least one specific access page sequence according to the number of the specific access page sequences and the number of the access pages contained in each specific access page sequence and combining the current access page and the historical access pages corresponding to the current access page; wherein the page access order indicates a history access page for predicting that a next page likely to be accessed by the user needs to depend on, the history access page including a current access page;
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; the target page access tree is a tree model constructed by utilizing historical access pages, and the generation process comprises the following steps: acquiring a historical access page sequence; creating a root node, setting the node state of the root node as activation, and initializing a page access tree by using the root node; traversing the history access page sequence, and updating the page access tree to obtain 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.
2. The method of claim 1, wherein traversing the sequence of historically accessed pages, updating the page access tree, obtaining the target page access tree, comprises:
Traversing the history access pages in the history 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 the historical access page;
judging whether traversing of the history access pages in the history access page sequence is completed or not;
If yes, determining the updated page access tree as the target page access tree, if not, continuing to traverse the historical access pages in the historical access page sequence, and updating the page access tree.
3. The method of claim 2, wherein the node information comprises: page identification corresponding to the node, page access times corresponding to the node and node state; and
The 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 page, comprising:
Traversing nodes in the page access tree to obtain an activated node, wherein the activated node is a node with an activated node state;
acquiring a child node corresponding to the activated node, and judging whether the page identifier corresponding to the child node is the same as the page identifier of the historical access page;
if yes, updating the node information of the child node, if not, newly adding the child node corresponding to the activated node, and setting the node information of the newly added child node;
updating the node state of the active node to be inactive under the condition that the active node is a non-leaf node and the active node is a non-root node;
Judging whether traversing of the nodes in the page access tree is completed, if yes, completing updating of the page access tree.
4. A method according to claim 3, wherein said updating node information of said 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.
5. The method of claim 3, wherein the setting node information of the new child node comprises:
Setting the page identifier corresponding to the new child node as the page identifier of the historical access page, increasing the page access times corresponding to the new child node once, and setting the node state of the new child node as activation.
6. The method of claim 1, wherein determining, using a target page access tree, a next access page corresponding to the particular sequence of access pages and a transition probability corresponding to the next access page 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.
7. The method of claim 1, wherein the transition probabilities corresponding to the next access page comprise: the transition probability of the next access page corresponding to each specific access page sequence; and
The selecting a target access page from the next access page according to the transition probability corresponding to the next access page includes:
acquiring a preset transition probability corresponding to each specific access page sequence;
And determining the next access page corresponding to each specific access page sequence as the target access page under the condition that the transition probability of the next access page corresponding to each specific access page sequence is larger than the preset transition probability corresponding to each specific access page sequence.
8. The method of claim 1, wherein the access preprocessing the target access page comprises:
rendering and caching the target access page; and
The method further comprises the steps of: and deleting the target access page from the cache based on a preset expiration time.
9. A page access apparatus, comprising:
The generation module is used for acquiring a current access page, generating a specific access page sequence corresponding to the current access page based on a preset page access order, and comprises the following steps: determining the number of the specific access page sequences and the number of the access pages contained in each specific access page sequence according to the preset page access order; generating at least one specific access page sequence according to the number of the specific access page sequences and the number of the access pages contained in each specific access page sequence and combining the current access page and the historical access pages corresponding to the current access page; wherein the page access order indicates a history access page for predicting that a next page likely to be accessed by the user needs to depend on, the history access page including a current access page;
The determining module is used for determining a next access page corresponding to the specific access page sequence and a transition probability corresponding to the next access page by utilizing a target page access tree; the target page access tree is a tree model constructed by utilizing historical access pages, and the generation process comprises the following steps: acquiring a historical access page sequence; creating a root node, setting the node state of the root node as activation, and initializing a page access tree by using the root node; traversing the history access page sequence, and updating the page access tree to obtain the target page access tree;
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 performing access pretreatment on the target access page.
10. An electronic device, comprising:
One or more processors;
Storage means for storing one or more programs,
When executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-8.
11. A computer readable medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any of claims 1-8.
CN202010898381.5A 2020-08-31 2020-08-31 Page access method and page access device Active CN113779450B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010898381.5A CN113779450B (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 CN113779450B (en) 2020-08-31 2020-08-31 Page access method and page access device

Publications (2)

Publication Number Publication Date
CN113779450A CN113779450A (en) 2021-12-10
CN113779450B true CN113779450B (en) 2024-08-16

Family

ID=78834952

Family Applications (1)

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

Country Status (1)

Country Link
CN (1) CN113779450B (en)

Citations (2)

* 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
CN105677327A (en) * 2015-12-30 2016-06-15 合一网络技术(北京)有限公司 Page information preloading method and system

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101751437A (en) * 2008-12-17 2010-06-23 中国科学院自动化研究所 Web active retrieval system based on reinforcement learning
CN102123168B (en) * 2011-01-14 2012-07-18 广州市动景计算机科技有限公司 Web page pre-reading and integration method and system based on relay server
CN110007978A (en) * 2018-11-20 2019-07-12 阿里巴巴集团控股有限公司 A kind of method, device and equipment preloading the page

Patent Citations (2)

* 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
CN105677327A (en) * 2015-12-30 2016-06-15 合一网络技术(北京)有限公司 Page information preloading method and system

Also Published As

Publication number Publication date
CN113779450A (en) 2021-12-10

Similar Documents

Publication Publication Date Title
CN107729570B (en) Data migration method and device for server
US10936645B2 (en) Method and apparatus for generating to-be-played multimedia content
CN109992719B (en) Method and apparatus for determining push priority information
CN111340220A (en) Method and apparatus for training a predictive model
CN112783887B (en) Data processing method and device based on data warehouse
CN108011936B (en) Method and device for pushing information
CN113761565B (en) Data desensitization method and device
CN111125503A (en) Method and apparatus for generating information
CN110109912B (en) Identifier generation method and device
CN109213815B (en) Method, device, server terminal and readable medium for controlling execution times
CN113779450B (en) Page access method and page access device
CN113722007B (en) Configuration method, device and system of VPN branch equipment
CN113282489B (en) Interface testing method and device
CN112052152A (en) Simulation test method and device
CN113362097B (en) User determination method and device
CN112711572B (en) Online capacity expansion method and device suitable for database and table division
CN113138943B (en) Method and device for processing request
CN111131354B (en) Method and apparatus for generating information
CN111737218A (en) File sharing method and device
CN112749204A (en) Method and device for reading data
CN113127416B (en) Data query method and device
CN110555053A (en) method and apparatus for outputting information
CN113760483B (en) Method and device for executing tasks
CN117170821B (en) Service processing method, device, electronic equipment and computer readable medium
CN113010405B (en) Application program testing 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
GR01 Patent grant
GR01 Patent grant