Note : Les descriptions sont présentées dans la langue officielle dans laquelle elles ont été soumises.
METHOD OF AND SYSTEM FOR CONSTRUCTING PAGE ACCESS PATH
BACKGROUND OF THE INVENTION
Technical Field
[0001] The present invention relates to the field of internet technology, and
more particularly to
a method of and a system for constructing a page access page.
Description of Related Art
[0002] It is required in the businesses of website operations and website
analyses to learn what
the user behavior is from the time the user enters a website to the time of
departure, for
instance, to learn whether the user browses and accesses according to paths of
navigations
designed by the website, how the circumstance of users loss is on each
browsing step,
what the actual access is after the user has departed from the corresponding
page, and so
on, as it is required to summarize link analyses of key paths of a website
with respect to
the user access, to count the origin/skip and exiting indices of each page, to
recognize and
optimize the structure of the website, to enhance website accesses and order
conversion
rate, and to enhance user experience.
[0003] While analyzing the path behavior track of a user in the state of the
art, it is required to
traverse all behavior track data of the user, and to perform many rounds of
associated
traversing operations on all behaviors before path information of the user
could be
obtained. When the access volume of the website is huge, such traversing will
be
extremely time-consuming and consume great quantities of computational
resources.
SUMMARY OF THE INVENTION
1
Date Recue/Date Received 2021-12-29
[0004] An objective of the present invention is to provide a method of and a
system for
constructing a page access path, whereby consumption of computational
resources is
reduced at the same time of enhancing construction efficiency by optimizing a
page
access path tree.
[0005] In order to achieve the above objective, according to the first aspect,
the present invention
provides a method of constructing a page access path, which method comprises:
[0006] obtaining an access session of a user, the access session including a
plurality of different
access pages;
[0007] page-cleaning and serially numbering according to collection time the
access pages in the
access session;
[0008] sequentially recognizing ingress access pages of each path from the
plurality of access
pages, taking each ingress access page as a head node of the corresponding
path, and
recording path information of each head node;
[0009] partitioning, based on a numbering interval of adjacent ingress access
pages, the access
pages within the interval into a corresponding path partition if there are
plural paths;
alternatively partitioning the entire access pages as one path partition if
there is one path;
[0010] matching, for redirecting pages, one by one the access pages pertaining
to each path
partition sequentially in an increasing order, obtaining a matching relation
of each access
page and constructing path nodes, and simultaneously recording path
information of the
path nodes; and
[0011] constructing a page access path tree based on the head node and the
path information of
the path nodes.
[0012] Preferably, the step of obtaining an access session of a user, the
access session including
a plurality of different access pages includes:
[0013] obtaining a plurality of access pages browsed by the user through a
terminal within a
preset time period when accessing a website, and summarizing the plurality of
access
pages chronologically to constitute the access session.
2
Date Recue/Date Received 2021-12-29
[0014] Preferably, the step of page-cleaning and serially numbering according
to collection time
the access pages in the access session includes:
[0015] recognizing any noise access page engendered by crawlers and/or cheats
from the access
pages, and preliminarily cleaning and eliminating the noise access page; and
[0016] serially numbering according to collection time the remaining access
pages in the same
access session.
[0017] Further, the method further comprises, after the step of preliminarily
cleaning and
eliminating the noise access page:
[0018] if it is compared in the same access session that two consecutive
access pages are identical
access pages, then secondarily cleaning and eliminating the later access page.
[0019] Preferably, the method further comprises, prior to the step of
sequentially recognizing
ingress access pages of each path from the plurality of access pages, taking
each ingress
access page as a head node of the corresponding path, and recording path
information of
each head node:
[0020] constructing a page breakpoint dimension table, the page breakpoint
dimension table
including at least one access page breakpoint page.
[0021] Preferably, the step of sequentially recognizing ingress access pages
of each path from
the plurality of access pages, taking each ingress access page as a head node
of the
corresponding path, and recording path information of each head node includes:
[0022] comparing the access pages in the access session sequentially with the
page breakpoint
dimension table on a one-by-one basis, and defining any matched access page as
the
ingress access page of a new path; and
[0023] taking each ingress access page as a head node of the corresponding
path, and recording
path information of each head node as void; wherein
[0024] the number of paths is the number of the ingress access pages.
3
Date Recue/Date Received 2021-12-29
[0025] Further, the step of matching, for redirecting pages, one by one the
access pages
pertaining to each path partition sequentially in an increasing order,
obtaining a matching
relation of each access page and constructing path nodes, and simultaneously
recording
path information of the path nodes includes:
[0026] sequentially searching for redirected pages of each access page in the
path partition in an
increasing order;
[0027] drawing a path matching relation between the various access pages in
the path partition
based on a matching relation between each access page and the corresponding
redirected
page, expressing the access pages in the form of path nodes in a path
relation, and
recording a path matching relation of each path node through the path
information, the
path information further including pit click information of the redirected
page; and
[0028] serially connecting the head nodes and the path nodes to form a path
according to the path
matching relation.
[0029] Further, the step of constructing a page access path tree includes:
[0030] summarizing each path in the access session, and constructing the page
access path tree.
[0031] In comparison with prior-art technology, the method of constructing a
page access path
provided by the present invention achieves the following advantageous effects.
[0032] In the method of constructing a page access path provided by the
present invention, a
plurality of access pages browsed by the user through a terminal within a
preset time
period when accessing a website are obtained, the plurality of access pages
are
summarized chronologically to constitute the access session, thereafter the
access pages
in the access session are page-cleaned and serially numbered according to
collection time,
subsequently ingress access pages of each path are sequentially recognized
from the
plurality of access pages, each ingress access page is taken as a head node of
the
corresponding path, and path information of each head node is simultaneously
recorded;
4
Date Recue/Date Received 2021-12-29
if there are plural recognized paths, a numbering interval of adjacent ingress
access pages
can be based on to partition the access pages within the interval into a
corresponding path
partition; alternatively, if there is one path, the entire access pages are
partitioned as one
path partition, thereafter the access pages pertaining to each path partition
are matched,
for redirecting pages, one by one sequentially in an increasing order, a
matching relation
of each access page is obtained and path nodes are constructed, path
information of the
path nodes is simultaneously recorded, and a page access path tree is finally
constructed
based on the head node and the path information of the path nodes.
[0033] Seen as such, by page-cleaning the access session, the present
invention makes it possible
to perform noise reduction treatment on consecutively repetitive access pages,
and thus
prevent the repetitive access pages from interfering with path analysis.
Moreover, in
comparison with the prior-art solution in which the mode of access page
details is used
to associate the table itself for many times to take the information of the
next access page,
and the next following the next access page to construct the path, the present
invention
reduces the consumption of system computational resources at the same time of
enhancing the path tree construction efficiency by optimizing the path of the
access pages.
[0034] According to the second aspect, the present invention provides a system
for constructing
a page access path, the system is applied to the method of constructing a page
access path
as recited in the aforementioned technical solution, and the system comprises:
[0035] an obtaining unit, for obtaining an access session of a user, the
access session including
a plurality of different access pages;
[0036] a cleaning unit, for page-cleaning and serially numbering according to
collection time the
access pages in the access session;
[0037] a recognizing unit, for sequentially recognizing ingress access pages
of each path from
the plurality of access pages, taking each ingress access page as a head node
of the
corresponding path, and recording path information of each head node;
[0038] a judging unit, for partitioning, based on a numbering interval of
adjacent ingress access
Date Recue/Date Received 2021-12-29
pages, the access pages within the interval into a corresponding path
partition if there are
plural paths; alternatively partitioning the entire access pages as one path
partition if there
is one path;
[0039] a path matching unit, for matching, for redirecting pages, one by one
the access pages
pertaining to each path partition sequentially in an increasing order,
obtaining a matching
relation of each access page and constructing path nodes, and simultaneously
recording
path information of the path nodes; and
[0040] a path tree constructing unit, for constructing a page access path tree
based on the head
node and the path information of the path nodes.
[0041] In comparison with prior-art technology, the advantageous effects
achieved by the system
for constructing a page access path provided by the present invention are
identical with
the advantageous effects achieved by the method of constructing a page access
path
provided by the aforementioned technical solution, while no repetition is made
in this
context.
[0042] According to the third aspect, the present invention provides a
computer-readable storage
medium storing thereon a computer program that executes the steps of the
aforementioned method of constructing a page access path when it is run by a
processor.
[0043] In comparison with prior-art technology, the advantageous effects
achieved by the
computer-readable storage medium provided by the present invention are
identical with
the advantageous effects achieved by the method of constructing a page access
path
provided by the aforementioned technical solution, while no repetition is made
in this
context.
BRIEF DESCRIPTION OF THE DRAWINGS
[0044] The accompanying drawings herein described are employed to provide
further
6
Date Recue/Date Received 2021-12-29
comprehension to the present invention, and constitute a part of the present
invention,
and exemplary embodiments of the present invention and their descriptions are
meant to
explain the present invention, rather than to restrict the present invention.
In the drawings:
[0045] Fig. 1 is a flowchart schematically illustrating the method of
constructing a page access
path in an embodiment of the present invention; and
[0046] Fig. 2 is a view schematically illustrating an example of a page access
path tree in an
embodiment of the present invention.
DETAILED DESCRIPTION OF THE INVENTION
[0047] To make more lucid and clear the aforementioned objectives,
characteristics and
advantages of the present invention, the technical solutions in the
embodiments of the
present invention will be clearly and comprehensively described below with
reference to
the accompanying drawings in the embodiments of the present invention.
Apparently, the
embodiments as described are merely partial, rather than the entire,
embodiments of the
present invention. Any other embodiments makeable by persons ordinarily
skilled in the
art on the basis of the embodiments in the present invention without creative
effort shall
all fall within the protection scope of the present invention.
[0048] Embodiment 1
[0049] Referring to Fig. 1, this embodiment provides a method of constructing
a page access
path, and the method comprises:
[0050] obtaining an access session of a user, the access session including a
plurality of different
access pages; page-cleaning and serially numbering according to collection
time the
access pages in the access session; sequentially recognizing ingress access
pages of each
path from the plurality of access pages, taking each ingress access page as a
head node of
7
Date Recue/Date Received 2021-12-29
the corresponding path, and recording path information of each head node;
partitioning,
based on a numbering interval of adjacent ingress access pages, the access
pages within
the interval into a corresponding path partition if there are plural paths;
alternatively
partitioning the entire access pages as one path partition if there is one
path; matching,
for redirecting pages, one by one the access pages pertaining to each path
partition
sequentially in an increasing order, obtaining a matching relation of each
access page and
constructing path nodes, and simultaneously recording path information of the
path nodes;
and constructing a page access path tree based on the head node and the path
information
of the path nodes.
[0051] In the method of constructing a page access path provided by this
embodiment, a plurality
of access pages browsed by the user through a terminal within a preset time
period when
accessing a website are obtained, the plurality of access pages are summarized
chronologically to constitute the access session, thereafter the access pages
in the access
session are page-cleaned and serially numbered according to collection time,
subsequently ingress access pages of each path are sequentially recognized
from the
plurality of access pages, each ingress access page is taken as a head node of
the
corresponding path, and path information of each head node is simultaneously
recorded;
if there are plural recognized paths, a numbering interval of adjacent ingress
access pages
can be based on to partition the access pages within the interval into a
corresponding path
partition; alternatively, if there is one path, the entire access pages are
partitioned as one
path partition, thereafter the access pages pertaining to each path partition
are matched,
for redirecting pages, one by one sequentially in an increasing order, a
matching relation
of each access page is obtained and path nodes are constructed, path
information of the
path nodes is simultaneously recorded, and a page access path tree is finally
constructed
based on the head node and the path information of the path nodes.
[0052] Seen as such, by page-cleaning the access session, this embodiment
makes it possible to
perform noise reduction treatment on consecutively repetitive access pages,
and thus
8
Date Recue/Date Received 2021-12-29
prevent the repetitive access pages from interfering with path analysis.
Moreover, in
comparison with the prior-art solution in which the mode of access page
details is used
to associate the table itself for many times to take the information of the
next access page,
and the next following the next access page to construct the path, this
embodiment
reduces the consumption of system computational resources at the same time of
enhancing the path tree construction efficiency by optimizing the path of the
access pages.
[0053] In the aforementioned embodiment, the step of obtaining an access
session of a user, the
access session including a plurality of different access pages includes:
[0054] obtaining a plurality of access pages browsed by the user through a
terminal within a
preset time period when accessing a website, and summarizing the plurality of
access
pages chronologically to constitute the access session.
[0055] During specific implementation, the solution of this embodiment is
applicable to multiple
ends, such as the APP end, the PC end, a small program end, etc., an access
session is
generated by a user browsing a plurality of access pages through any end
within a preset
time period when accessing a website, and during summarization it is required
to sort the
pages chronologically according to the access times of the user to form the
access session.
[0056] In the aforementioned embodiment, the step of page-cleaning and
serially numbering
according to collection time the access pages in the access session includes:
[0057] recognizing any noise access page engendered by crawlers and/or cheats
from the access
pages, and preliminarily cleaning and eliminating the noise access page; and
serially
numbering according to collection time the remaining access pages in the same
access
session.
[0058] During specific implementation, a currently available algorithm program
is employed to
recognize the visitor list of crawlers and/or cheats to recognize any noise
access page in
the access pages, these noise access pages are cleaned and eliminated, and
only the access
9
Date Recue/Date Received 2021-12-29
pages remaining in the access session are serially numbered according to
collection time.
[0059] In the aforementioned embodiment, the method further comprises, after
the step of
preliminarily cleaning and eliminating the noise access page:
[0060] if it is compared in the same access session that two consecutive
access pages are identical
access pages, then secondarily cleaning and eliminating the later access page.
[0061] During specific implementation, if it is determined that two
consecutive access pages in
the same access session are identical access pages, this indicates that the
user might have
continuously refreshed the access page or that the later access page might
have been
generated in a certain page turning scenario; since this type of repetitive
access pages is
meaningless to path analysis, there is a need to remove the duplicate, namely
to filter out
and eliminate the later repetitive access page. Understandably, it is also
possible in the
actual operational process to firstly serially number the access pages in the
access session,
then to perform preliminary cleaning and secondary cleaning on the access
pages, and
finally to update the numberings again. None of the two numbering schemes
affects the
specific implementation of the solution, so no restriction is made thereto.
[0062] In addition, the method of judging whether two consecutive access pages
are repetitive is
to judge through one or more of page information comparison, url information
comparison, and page name information comparison; if the comparison results of
any
information in the page information comparison, url information comparison,
and page
name information comparison of two consecutive access pages are identical,
this
indicates that the two consecutive access pages are repetitive of each other,
and it is
required in this case to eliminate the later repetitive access page.
[0063] In the aforementioned embodiment, the method further comprises, prior
to the step of
sequentially recognizing ingress access pages of each path from the plurality
of access
pages, taking each ingress access page as a head node of the corresponding
path, and
Date Recue/Date Received 2021-12-29
recording path information of each head node:
[0064] constructing a page breakpoint dimension table, the page breakpoint
dimension table
including at least one access page breakpoint page.
[0065] In the aforementioned embodiment, the step of sequentially recognizing
ingress access
pages of each path from the plurality of access pages, taking each ingress
access page as
a head node of the corresponding path, and recording path information of each
head node
includes:
[0066] comparing the access pages in the access session sequentially with the
page breakpoint
dimension table on a one-by-one basis, and defining any matched access page as
the
ingress access page of a new path; and taking each ingress access page as a
head node of
the corresponding path, and recording path information of each head node as
void;
wherein the number of paths is the number of the ingress access pages.
[0067] During specific implementation, the page breakpoint dimension table
records therein
breakpoint pages, such as a homepage of website pages, a tab page, etc.;
usually speaking,
a breakpoint page is precisely an ingress access page (the first access page)
of a new path,
and it is also taken as the head node of the new path; the access pages
remaining in the
access session are compared one by one with breakpoint pages in the breakpoint
dimension table, when comparison is successful, this indicates that the
corresponding
access page is an ingress access page, it is now taken as the head node of the
new path,
and the number of corresponding paths can be finally known by counting the
number of
the ingress access pages. Understandably, since there is no path node
occurring before the
head node, the path relation recorded of the path information of the head node
is void.
[0068] In the aforementioned embodiment, the step of matching, for redirecting
pages, one by
one the access pages pertaining to each path partition sequentially in an
increasing order,
obtaining a matching relation of each access page and constructing path nodes,
and
simultaneously recording path information of the path nodes includes:
11
Date Recue/Date Received 2021-12-29
[0069] sequentially searching for redirected pages of each access page in the
path partition in an
increasing order; drawing a path matching relation between the various access
pages in
the path partition based on a matching relation between each access page and
the
corresponding redirected page, expressing the access pages in the form of path
nodes in
a path relation, and recording a path matching relation of each path node
through the path
information, the path information further including pit click information of
the redirected
page; and serially connecting the head nodes and the path nodes to form a path
according
to the path matching relation.
[0070] During specific implementation, the access pages in the path partition
are sequentially
relationally matched with their redirected pages, a path matching relation
between head
nodes and path nodes in the path partition is obtained, and path information
of each path
node is recorded, which path information includes not only the relational
matching
between access page path nodes and redirected page path nodes, but also
records pit click
information when the access page is entered through the redirected page.
Access path
fields of the user are designed using a dynamic array, starting with the first
access page
as the path, the user path is labeled with pit information of corresponding
clicks on the
redirected page for value transformation analysis of pits, so as to analyze
website
browsing habits of users more precisely and more thoroughly, and to enhance
value
analysis effect. As should be emphasized, path information of later path nodes
subsumes
path information of path nodes matched and associated with the former, in
other words,
from the path information of later path nodes can be restored the path of path
nodes
directly or indirectly related thereto.
[0071] To facilitate comprehension, the aforementioned embodiment is
exemplarily explained
below.
[0072] Step 1 ¨ obtaining an access session, associating a cheating algorithm
with a crawler
algorithm to recognize noise access pages, performing preliminary cleaning and
12
Date Recue/Date Received 2021-12-29
eliminating, and simultaneously performing secondary cleaning and eliminating
on
repetitive access pages;
[0073] Step 2 ¨ recognizing all paths in the access session ¨ explanation is
made with one path
for example, a homepage access page A numbering 1 is taken as the head node,
path
information of the head node is marked as void, and other access pages serve
as path
nodes.
[0074] A search access page B numbering 2 is compared with the page breakpoint
dimension
table, when comparison succeeds, this indicates that the search access page B
is a
breakpoint page, and now its path information is recorded as void; when
comparison fails,
this indicates that the search access page B is a path node, it is required
now to match as
to whether its redirected page is the homepage access page A, if not, a path
relation
between the search access page B and the homepage access page A is recorded in
the path
information of the search access page B, and the pit click information of the
homepage
access page A is simultaneously recorded, namely to record as to which pit of
the
homepage access page A should be clicked in order to skip to the search access
page B.
[0075] An Apple 5S quaternary access page C numbering 3 is compared with the
page breakpoint
dimension table, when comparison succeeds, this indicates that the search
access page C
is a breakpoint page, and now its path information is recorded as void; when
comparison
fails, this indicates that the search access page C is a path node, it is
required now to
match as to whether its redirected page is the search access page B, if yes,
the path
information of the search access page C will be: path information of the
search access
page B + name and pit click information of the search access page B; if not,
it is continued
to judge whether the redirected page of the search access page C is the
homepage access
page A, if yes, the path information of the search access page C will be: path
information
of the homepage access page A + name and pit click information of the homepage
access
page A; if not, the path information of the search access page C will be void.
13
Date Recue/Date Received 2021-12-29
[0076] An Apple 11 quaternary access page D numbering 4 is compared with the
page breakpoint
dimension table, when comparison succeeds, this indicates that the quaternary
access
page D is a breakpoint page, and now its path information is recorded as void;
when
comparison fails, this indicates that the quaternary access page D is a path
node, it is
required now to sequentially match its path matching relations with the search
access
page C, the search access page B, and the homepage access page A, whose
specific
matching process can be inferred from the aforementioned logic, and the path
information
of the quaternary access page D is finally obtained.
[0077] Taking for example, the following operations are included as seen from
an access
behavior record of a user: the user opening the homepage of the website ¨
searching for
page (mobile phones) ¨Apple 5S quaternary page ¨Apple 11 quaternary page ¨
searching
for page (mobile phones) ¨Huawei mate30 quaternary page ¨ submitting order ¨
payment
page. Access session data collected is as follows:
14
Date Recue/Date Received 2021-12-29
[0078]
Collection pv_id Access Application Access Page Redirected Click Pit
No.
Time Session Name Page Name
2020-09-27 cal va App. T homepage 1
16:22:20
2020-09-27 ca2 va App. T search page homepage dl 2
16:22:21 (mobile phones)
2020-09-27 ca3 va App. T Apple 5S search page c12
3
16:22:22 quaternary page (mobile phones)
2020-09-27 ca4 va App. T Apple 11 Apple 5S c13 4
16:22:23 quaternary page quaternary page
2020-09-27 ca6 va App. T Huawei p20 search page c15
5
16:22:25 quaternary page (mobile phones)
2020-09-27 ca7 va App. T homepage Huawei p20 c16 6
16:22:26 quaternary page
2020-09-27 ca8 va App. T shopping cart homepage c17 7
16:22:27 page
2020-09-27 ca9 va App. T order Shopping cart
c18 8
16:22:28 submission page
page
2020-09-27 call) va App. T payment page order c19
9
16:22:29 submission page
[0079] As shown in Fig. 2, website browsing behaviors of the user are
sequentially: opening the
homepage of the website, searching for page (mobile phones), Apple 5S
quaternary page,
Apple 11 quaternary page, searching for page (mobile phones), Huawei P20
quaternary
page, website homepage, shopping cart page, order submission page, and payment
succeeded page.
[0080] The following path information data can be obtained by processing the
above access
session with the method according to the present embodiment, and a page access
path
tree of access session va can be drawn through the path information data.
Date Recue/Date Received 2021-12-29
[0081]
Collection pv_id Access Application Page Redirected Click No. Path
Time Session Name Page Name Pit
2020-09-27 cal va App. T homepage 1
16:22:20
2020-09-27 ca2 va App. T search homepage ell 2 homepage,
ell
16:22:21 page
(mobile
phones)
2020-09-27 ca3 va App. T Apple 5S search page e12 3
homepage, -- ell;
16:22:22 quaternary (mobile search
page
page phones)
(mobile phones),
el2
2020-09-27 ca4 va App. T Apple 11 Apple 5S e13 4
homepage, ell;
16:22:23 quaternary quaternary search
page
page page
(mobile phones),
e12; Apple 5S
quaternary page
2020-09-27 ca6 va App. T Huawei search page e15 5
homepage, c11;
16:22:25 p20 (mobile search
page
quaternary phones)
(mobile phones),
page el5
2020-09-27 ca7 va App. T homepage Huawei p20 e16 6
16:22:26 quaternary
page
2020-09-27 ca8 va App. T shopping homepage e17 7
homepage, e17
16:22:27 cart page
2020-09-27 ca9 va App. T order shopping cart e18 8
.. homepage, e17;
16:22:28 submission page shopping
cart
page page, e18
2020-09-27 ca 1 0 va App. T payment order e 1 9 9
homepage, c17;
16:22:29 page submission shopping
cart
page
page, e18; order
submission page,
el9
[0082] To sum it up, the present embodiment achieves the following
advantageous effects.
[0083] The solution according to this embodiment is advantageous in quick
computation, in
16
Date Recue/Date Received 2021-12-29
economical computing capabilities, and in its applicability to multiple ends.
[0084] The solution according to this embodiment makes it possible to realize
transformation
analysis of paths self-defined by the user and to monitor flow loss and
transformation of
key nodes as long as the page types required by the user to analyze are well
configured.
[0085] The solution according to this embodiment makes it possible to analyze
website page
access paths and such paths as fishbone diagrams and flow funnel diagrams of
page pits,
and to find through path analysis whether the user browses the website
according to
navigation paths designed for products, whereby there will be direction and
improvement
for readjustment of the products.
[0086] The solution according to this embodiment makes it possible to more
precisely realize
value calculation of commodities or activities of pits on website pages,
whereby in-site
advertisements and sales by operations can be guided.
[0087] Embodiment 2
[0088] This embodiment provides a system for constructing a page access path,
and the system
comprises:
[0089] an obtaining unit, for obtaining an access session of a user, the
access session including
a plurality of different access pages;
[0090] a cleaning unit, for page-cleaning and serially numbering according to
collection time the
access pages in the access session;
[0091] a recognizing unit, for sequentially recognizing ingress access pages
of each path from
the plurality of access pages, taking each ingress access page as a head node
of the
corresponding path, and recording path information of each head node;
[0092] a judging unit, for partitioning, based on a numbering interval of
adjacent ingress access
pages, the access pages within the interval into a corresponding path
partition if there are
17
Date Recue/Date Received 2021-12-29
plural paths; alternatively partitioning the entire access pages as one path
partition if there
is one path;
[0093] a path matching unit, for matching, for redirecting pages, one by one
the access pages
pertaining to each path partition sequentially in an increasing order,
obtaining a matching
relation of each access page and constructing path nodes, and simultaneously
recording
path information of the path nodes; and
[0094] a path tree constructing unit, for constructing a page access path tree
based on the head
node and the path information of the path nodes.
[0095] In comparison with prior-art technology, the advantageous effects
achieved by the system
for constructing a page access path provided by this embodiment of the present
invention
are identical with the advantageous effects achieved by the method of
constructing a page
access path provided by the aforementioned Embodiment 1, while no repetition
is made
in this context.
[0096] Embodiment 3
[0097] This embodiment provides a computer-readable storage medium storing
thereon a
computer program that executes the steps of the aforementioned method of
constructing
a page access path when it is run by a processor.
[0098] In comparison with prior-art technology, the advantageous effects
achieved by the
computer-readable storage medium provided by this embodiment are identical
with the
advantageous effects achieved by the method of constructing a page access path
provided
by the aforementioned technical solution, while no repetition is made in this
context.
[0099] As comprehensible to persons ordinarily skilled in the art, the entire
or partial steps in the
method realizing the present invention can be completed via a program that
instructs
relevant hardware, the program can be stored in a computer-readable storage
medium and
18
Date Recue/Date Received 2021-12-29
subsume the various steps in the aforementioned method embodiment when
executed,
and the storage medium can be an ROM/RAM, a magnetic disk, an optical disk, a
memory
card, etc.
[0100] What is described above is merely directed to specific modes of
execution of the present
invention, but the protection scope of the present invention is not restricted
thereby, as
any modification and replacement easily conceivable to persons skilled in the
art within
the technical range disclosed by the present invention should be covered by
the protection
scope of the present invention. Accordingly, the protection scope of the
present invention
shall be based on the protection scope claimed in the Claims.
19
Date Recue/Date Received 2021-12-29
