CN111737630A - Method for recording user access path - Google Patents
Method for recording user access path Download PDFInfo
- Publication number
- CN111737630A CN111737630A CN202010860569.0A CN202010860569A CN111737630A CN 111737630 A CN111737630 A CN 111737630A CN 202010860569 A CN202010860569 A CN 202010860569A CN 111737630 A CN111737630 A CN 111737630A
- Authority
- CN
- China
- Prior art keywords
- page
- user access
- level
- access path
- hierarchy
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 230000001960 triggered effect Effects 0.000 claims abstract description 26
- 238000004458 analytical method Methods 0.000 claims abstract description 15
- 230000005540 biological transmission Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 6
- 230000008901 benefit Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000006399 behavior Effects 0.000 description 3
- 101100534110 Bacillus subtilis (strain 168) spmA gene Proteins 0.000 description 2
- 101100534111 Bacillus subtilis (strain 168) spmB gene Proteins 0.000 description 2
- 238000004590 computer program Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 238000009933 burial Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/958—Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
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 Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a method for recording a user access path, which comprises the following steps: generating a hierarchy and a page identification associated with a page in a client; configuring a buried point in a page, wherein the buried point is used for recording a user access path related to the page of a client when being triggered, and the user access path comprises page level information of an accessed page and a corresponding page identifier; and when the embedded point is triggered when the first page enters the second page, updating the user access path according to the comparison between the hierarchy of the first page and the hierarchy of the second page. The user access path information according to the present invention may record key nodes having a hierarchical structure so that the size of such user access path information may be controlled for log analysis.
Description
Technical Field
The present disclosure relates to the field of internet technologies, and in particular, to a method and an apparatus for recording a user access path, an electronic device, and a computer-readable medium.
Background
In data processing and data analysis work, most of the situations need to analyze user paths and user source information, but because user behaviors are uncontrollable, the logs generally reported by an app end cannot report the information of all links of a user to each log, and the reported logs are generally difficult to accurately send in sequence, so when page browsing (pv) path statistics is needed, all logs must be sequenced and then analyzed in total, so that computing resources are consumed, and a certain log cannot be checked in real time on the current link.
In the prior art, the hyper location model (SPM) scheme in ali provides a method to count pv of access sources, which buries points in the client and sends a buried point log to the log server when each page is accessed. In the SPM scheme, each link is encoded. The SPM format is usually SPM = spmA. spmB. spmC. spmD. spmE, where spmA uniquely identifies a site, spmB uniquely identifies a page of a site, spmC uniquely identifies a block of a page, spmD uniquely identifies a specific location of a block, spmE is a randomly generated string that is related to time, a time sequence of clicking can be distinguished during cyclic page calculation, and specific codes and meanings thereof are configured by a unified management and control platform.
However, the method cannot record the pv of the user in the middle page circulation process, and only can know the access source nearest to the page; moreover, the scheme is only suitable for web pages, and parameters are inconvenient to add in the request process.
Disclosure of Invention
In view of the above, the present invention provides a user path recording method, which can be used to record each key node (entry) on the user's travel path and to transparently transfer the information they wish to transfer to each log through a dotting Software Development Kit (SDK), and since these key nodes are all hierarchically structured, these path information will not expand indefinitely due to uncontrollable user path.
According to a first aspect of the present invention, there is provided a method for recording a user access path, comprising: generating a hierarchy and a page identification associated with a page in a client; configuring a buried point in a page, wherein the buried point is used for recording a user access path related to the page of the client when being triggered, and the user access path comprises page level information of the accessed page and a corresponding page identifier; and when the embedded point is triggered when the embedded point enters a second page from a first page, updating the user access path according to the comparison of the hierarchy of the first page and the hierarchy of the second page.
In one embodiment, the method may further comprise sending the user access path to a log server via a log sending unit (e.g., message middleware) as a buried point log.
In one embodiment, the method may further comprise: and generating a path analysis map according to the buried point log.
In one embodiment, the user access path may further include source point location information on the accessed page.
In an embodiment, the updating the page identifier in the user access path may specifically include: when the level of the first page is higher than or equal to the level of the second page, updating the page identifier of the corresponding level by using the page identifier of the second page; and when the level of the first page is lower than that of the second page, updating the page identifier of the corresponding level by using the page identifier of the second page, and clearing all page identifiers below the level of the second page.
In one embodiment, the method may further comprise: and when the buried point is triggered from the second page to a third page, further updating the user access path according to the comparison between the hierarchy of the second page and the hierarchy of the third page.
According to a second aspect of the present invention, there is provided an apparatus for recording a user access path, comprising: the page configuration unit is used for generating a hierarchy and a page identifier which are associated with a page in the client; the embedded point configuration unit is used for configuring embedded points in the page, the embedded points are used for recording user access paths related to the page of the client when being triggered, and the user access paths comprise page level information of the accessed page and corresponding page identifiers; and the updating unit is used for updating the page identifier in the user access path according to the comparison between the hierarchy of the first page and the hierarchy of the second page when the buried point is triggered when the first page enters the second page.
In one embodiment, the apparatus further includes a log sending unit for sending the user access path to a log server as a buried point log.
In one embodiment, the apparatus may further include a log analysis unit for generating a path analysis graph from the buried point log.
In one embodiment, the user access path may further include source point location information on the accessed page.
In one embodiment, the updating unit may be further configured to: when the level of the first page is higher than or equal to the level of the second page, updating the page identifier of the corresponding level by using the page identifier of the second page; and when the level of the first page is lower than that of the second page, updating the page identifier of the corresponding level by using the page identifier of the second page, and clearing all page identifiers below the level of the second page.
In one embodiment, the updating unit may be further configured to: and when the buried point is triggered from the second page to a third page, further updating the user access path according to the comparison between the hierarchy of the second page and the hierarchy of the third page.
According to a third aspect of the present invention, there is also provided an electronic apparatus comprising: one or more processors; memory for storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method according to the first aspect.
According to a fourth aspect of the present invention, there is also provided a computer readable medium having stored thereon executable instructions which, when executed by a processor, cause the processor to perform the method as described in the above first aspect.
According to the above aspect of the present invention, the user access path information may record key nodes having a hierarchical structure so that the size of such user access path information is controllable for log analysis.
Additional features and advantages of the disclosure will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the embodiments of the disclosure. The objectives and other advantages of the disclosure may be realized and attained by the structure particularly pointed out in the written description and drawings.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings without creative efforts. The foregoing and other objects, features and advantages of the application will be apparent from the accompanying drawings. Like reference numerals refer to like parts throughout the drawings. The drawings are not intended to be to scale as practical, emphasis instead being placed upon illustrating the subject matter of the present application.
Fig. 1 shows a schematic diagram of an APP client pv transparent transmission scheme for searching a user fallback path according to an embodiment of the present invention.
Fig. 2 is a diagram illustrating transparent transmission of user access path parameters according to an embodiment of the present invention.
Fig. 3 shows a schematic flow chart of a method for recording a user access path according to an embodiment of the present invention.
Fig. 4 shows a schematic block diagram of an apparatus for recording a user access path according to an embodiment of the present invention.
Fig. 5 shows a schematic structural diagram of an electronic device for implementing an embodiment of the present disclosure.
Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The words "a", "an" and "the" and the like as used herein are also intended to include the meanings of "a plurality" and "the" unless the context clearly dictates otherwise. Furthermore, the terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
The invention aims to solve or relieve the technical problems that in the prior art, the pv of a user in the middle page circulation process cannot be recorded, only the access source closest to the page can be known, and the parameter is only adapted to the web page and is inconvenient to add in the request process.
According to an embodiment of the present invention, a method for recording a user access path is provided, including: generating a hierarchy and page identification associated with each page in the client; configuring a buried point in each page, wherein the buried point is used for recording a user access path related to the page of the client when being triggered, and the user access path comprises page level information of the accessed page and a corresponding page identifier; and when the embedded point is triggered when the embedded point enters a second page from a first page, updating the user access path according to the comparison of the hierarchy of the first page and the hierarchy of the second page.
Each page in the client has a corresponding hierarchy and page identification, and the page has a buried point. When a user accesses a page in a client APP (for example, clicking a link in a page to access another page), a buried point is triggered, and a transparent user access path is updated according to a hierarchical relationship between two triggered pages. Further, the user access path may be encapsulated by message middleware (e.g., kafka) and sent to a log server for subsequent generation of a path analysis graph.
Embodiments of the present invention are described in detail below with reference to fig. 1 to 5.
Fig. 1 shows a schematic diagram of an APP client pv transparent transmission scheme for searching a user fallback path according to an embodiment of the present invention.
First, at block 110, the data analyst may define a page identifier (page ID) for each page and/or an identifier (location ID) for each point location on the page on the buried point platform or recording platform. Here, the page ID may indicate, for example, a search page, a heat list page, a recommendation page, a certain question page, a certain answer page, or the like on APP; the identifiers of the points may indicate links on the page, such as interactive controls for favorites, comments, answers, and so on.
At block 120, logic for passing through fields between pages is provided by the client SDK. According to embodiments of the present invention, a field may be structured data such as a page ID, point location information, or other related information. For example, the page ID and its hierarchy, corresponding point location information, are used to define from which page, point/content comes in, for example: from which card of the top page entered, from which location on the previous page entered, etc. It is noted that the SDK may only provide logic for passing through fields between pages, without limiting the parameters included in the fields, and the parameters that need to be passed through may be subsequently dynamically configured (block 140).
At block 130, the buried point page information is added according to the page ID. The data analyst can develop the buried points at the corresponding positions of each event of the user behavior based on the service requirements or the product requirements, so that the data results of the buried points are reported through the SDK. For example, the buried point page information may include one or more of: the page to which the buried point belongs, the name of the buried point, the position to which the buried point button belongs, the type of event (exposure, click, browse, etc.), the value of the parameter, etc. According to the embodiment of the invention, when the embedded point of the page link is triggered, the message middleware (such as kafka) collects corresponding parameters (such as a user access path) and sends the parameters to the log server.
As mentioned above, the page has a hierarchy, and can start from a large entrance with the high hierarchy without adding all the buried points at one time. The large portal is usually referred to as a service portal page from which all content can be obtained, such as a search page; when entering from the personal page, the personal page is a large entrance, and examples thereof include recommendation, attention, and a heat list. In one embodiment, each page includes page entry information and hierarchy information, where the page entry information serves as a buried point for transparent transmission of user access paths.
At block 140, a page entry passthrough message is added. The page information on the user's access path will be transmitted in turn by means of the logic provided at block 120 for passing through fields between pages. According to the embodiment of the present invention, the transmitted user access path is related to the page hierarchy of the page, and the access path transmitted along the page visited by the user is updated based on the hierarchical relationship between the pages visited in sequence, which will be described specifically with reference to fig. 2.
At block 150, a user access path log is generated. After the operations and the deployment of the APPs described in the above blocks 110 to 140 are completed, when a user accesses a page in the APP and switches from one page to another page according to a link of the page to form a user access path, a corresponding user access path log may be generated. For example, when a user clicks a link in a first page to access a second page and triggers a corresponding embedded point, parameters related to the second page are added or updated in a transparent field; further, when the user clicks a link in the second page to access the third page and trigger the corresponding buried point, parameters related to the third page are added or updated in the transparent transmission field. In one embodiment, each time the burial point is triggered, the transparent field can be sent to the log server through the message middleware to serve as a user access path and saved to the log server. By analogy, the user access path and the access path log can be transmitted between the pages in sequence.
At block 160, the data warehouse may generate a path analysis graph based on the user access paths in the log server for use by the relevant business or product department.
As described above, pages have hierarchies, and user access paths transmitted between pages will be determined or updated based on the hierarchical relationships between pages. As will be described in detail below in connection with fig. 2. According to embodiments of the invention, the definition and use of the hierarchy may have the following rules.
1. Besides the large entry of the first level, the pages of other levels are determined by the service to which the pages belong. If the levels of all pages in the APP are uniformly specified, the phenomenon that services cannot be fused later occurs, and modification and expansion are not easy; by differentiating the hierarchy by traffic, it can be extended relatively easily.
2. When the low-level page is switched to the high-level page between the levels, the high-level page of the corresponding level is updated, and the access path information (also called rollback) of the low-level page is cleared. For example, for a user access path including the page IDs of the level three pages, if the level one and level two pages change, the level three pages are cleared. It will be appreciated that this is equivalent to replacing one portal, entering other services; when the high level is not changed, the page access information of the low level is transmitted all the way down.
3. The switching of the same-level entrance is service switching. And when the user browses under which service, the subsequent logs belong to the service, and meanwhile, the sub-service exists. For example, after the secondary list pages are changed from the first page to the question page, the topic page and the like, the switching between the secondary entry pages belongs to service switching, and only the secondary page entry is updated without returning and modifying the primary page. For example, a reply is entered from the home page and then browsed all the time, and then the user goes to the personal page, the entry is switched, the front log is the flow of the home page, and the back log is the flow of the personal page.
4. Between levels, the high level page is switched to the low level page, and the low level page is updated. For example, when entering a certain question editing page (secondary) from a hot list page (primary) of a first page, the page ID corresponding to the secondary page is modified to the page ID of the question editing page.
5. When there are multiple high-level pages that can enter a low-level page entry, the low-level page entry holds entry information for the last high-level page. It should be understood that pages within an APP need not be tree-structured, i.e., there may be links from multiple higher level pages to the same lower level page. In this case, the last high-level page entry information is retained when entering the low-level page entry.
In one embodiment, taking APP as an example, large entries such as recommendation, hot list, focus, search, personal page of the top page are used as primary entries, i.e. primary attributes, and other business pages may each have a hierarchy attribute defined according to business requirements, for example, the question editing page is a secondary entry, and the answer page is a tertiary entry. As mentioned above, the switching between the peers is not recorded, and compared with the recording of the behavior of the full link of the user, the method and the device can reduce the client pressure caused by the overlong link and reduce the log data volume. In addition, the invention has another advantage that the service flow can be clearly divided, and the user browses under which service, and the subsequent logs belong to the service. When the access path map analysis is carried out, all traffic under the service can be directly extracted through the ID of the service page.
Fig. 2 is a diagram illustrating transparent transmission of user access path parameters according to an embodiment of the present invention. In fig. 2, pages sequentially accessed by the user are from top to bottom, and include a home page, a question editing page, a response page, a question page, and a response page. Fig. 2 also shows the page level and page ID of each page filled out by the data analyst on the landed platform, for example, the page IDs of the home page, question editing page, answer page, question page, answer editing page, answer page are 1, 10, 111, 112, 11, 111, respectively, the page level/level is 1, 2, 3, 2, 3, and sets the landed points of these pages in the APP.
Here, the top page is determined as a one-level large entry, and the definition ID is 1. Defining a question editing page and an answer editing page as secondary pages according to the service rules; when a user enters question editing from a home page, parameters of the question are transmitted through: source1=1, source2= 10.
When entering the answer page from the question editing page, because the upper layer is changed, the lower layer is continuously transmitted and is assigned with source _3, and the parameters are transmitted through: source1=1, source2=10, and source _3= 111.
When a question page enters from an answer page and jumps among the same layers, the top layer is not changed and is reassigned to source _3, and the transparent transmission parameters are as follows: source1=1, source2=10, and source _3= 112.
When jumping from the answer page to the answer edit page, the layer 2 changes, and due to a backspacing mechanism, the third layer is assigned with NULL, and the parameter parameters are: source1=1, source2=11, source _3= NULL.
When the answer page is entered from the answer edit page, the parameter parameters are: source1=1, source2=11, and source _3= 111.
Fig. 2 shows that the user access path transparently transmitted between pages includes page levels and page identifiers, and further, the user access path may further include source point location information on the page, that is, record a link location or an interaction control linked to the current page on the source page.
Fig. 3 shows a schematic flow chart of a method 300 for recording a user access path according to an embodiment of the present invention.
The method 300 includes: at step 310, a hierarchy and page identification associated with each page in the client is generated. According to the embodiment of the invention, in an application program such as APP, a first page or a main business entry of the first page, such as search, hot list, attention and the like, can be taken as a page with the highest hierarchy. Furthermore, the hierarchy of other pages may be determined by each business segment itself, and it should be noted that the hierarchy of pages does not necessarily indicate that there is a tree structure relationship between pages, but rather is used to indicate the depth of business or page access.
In step 320, a buried point is configured in the page, and the buried point is used for recording a user access path related to the page of the client when being triggered, wherein the user access path comprises page level information and corresponding page identification of the accessed page. In one embodiment, the user access path as information passed through between pages may also include source point location information.
In step 330, when the buried point is triggered from the first page to the second page, the user access path is updated according to the comparison between the hierarchy of the first page and the hierarchy of the second page. In one embodiment, when the level of the first page is higher than or equal to the level of the second page, the page identifier of the corresponding level is updated by using the page identifier of the second page; and when the level of the first page is lower than that of the second page, updating the page identifier of the corresponding level by using the page identifier of the second page, and clearing all page identifiers below the level of the second page.
Further, when a user is about to access a third page from a second page, triggering a buried point with respect to the third page, the user access path is further updated according to a comparison of the hierarchy of the second page and the hierarchy of the third page. Similarly, when the level of the second page is higher than or equal to the level of the third page, updating the page identifier of the corresponding level by using the page identifier of the third page; and when the level of the second page is lower than that of the third page, updating the page identifier of the corresponding level by using the page identifier of the third page, and clearing all page identifiers below the level of the third page.
It can be seen that as the user accesses multiple pages, switching from one page to another, the user access path, including the page level, corresponding page ID (which may be NULL/NULL), is also transmitted in turn.
The method 300 further includes sending the user access path to a log server via message middleware as a buried point log at step 340. Whenever a buried point is triggered, the message middleware (e.g., kafka) encapsulates the updated user access path and sends it to the log server.
At step 350, the log server may generate a path analysis graph from the buried point log. In one embodiment, the log server may query the corresponding traffic data according to the page ID for a particular service in the buried point log. Because the log is updated and transmitted according to the page hierarchy, when the page is switched from the low-level page to the high-level page, the path information of the original low-level page (and the corresponding same-level page) is discarded, and it can be noticed that the size of the user path message related to each embedded point log is consistent, so that the storage capacity of the user access path can be effectively controlled.
Although the present invention describes updating user access paths in terms of page hierarchies, it should be understood that a data analyst may customize the content of the fields transmitted between pages, e.g., add parameters, and in particular may be implemented by configuring the buried points with corresponding rules.
Fig. 4 shows a schematic block diagram of an apparatus 400 for recording a user access path according to an embodiment of the present invention. The apparatus 400 comprises: a page configuration unit 410, a buried point configuration unit 420, an update unit 430, a log transmission unit 440, and a log analysis unit 450.
The page configuration unit 410 is used to generate a hierarchy and page identifications associated with pages in the client. A buried point configuration unit 420, configured to configure a buried point in a page, where the buried point is configured to record, when triggered, a user access path related to the page of the client, where the user access path includes page level information of an accessed page and a corresponding page identifier. An updating unit 430, configured to update a page identifier in the user access path according to a comparison between the level of the first page and the level of the second page when the buried point is triggered when the first page enters the second page.
The apparatus 400 may further include a log transmitting unit 440 for transmitting the user access path to a log server as a buried point log. The apparatus 400 may further include a log analysis unit 450 for generating a path analysis graph from the buried point log.
In one embodiment, the user access path may also include source point location information on the accessed page.
In one embodiment, the updating unit 430 is further configured to: when the level of the first page is higher than or equal to the level of the second page, updating the page identifier of the corresponding level by using the page identifier of the second page; and when the level of the first page is lower than that of the second page, updating the page identifier of the corresponding level by using the page identifier of the second page, and clearing all page identifiers below the level of the second page. Further, the updating unit 430 is further configured to: and when the buried point is triggered from the second page to a third page, further updating the user access path according to the comparison between the hierarchy of the second page and the hierarchy of the third page.
Fig. 5 shows a schematic structural diagram of an electronic device for implementing an embodiment of the present disclosure. As shown in fig. 5, the electronic apparatus 500 includes a Central Processing Unit (CPU) 501 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM) 502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data necessary for the operation of the electronic apparatus 500 are also stored. The CPU 501, ROM 502, and RAM 503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer-readable medium bearing instructions that, in such embodiments, may be downloaded and installed from a network via the communication section 509, and/or installed from the removable media 511. The various method steps described in this disclosure are performed when the instructions are executed by a Central Processing Unit (CPU) 501.
Although example embodiments have been described, it will be apparent to those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the disclosed concept. Accordingly, it should be understood that the above-described exemplary embodiments are not limiting, but illustrative.
Claims (14)
1. A method for recording user access paths, comprising:
generating a hierarchy and a page identification associated with a page in a client;
configuring a buried point in a page, wherein the buried point is used for recording a user access path related to the page of the client when being triggered, and the user access path comprises page level information of the accessed page and a corresponding page identifier; and
and when the embedded point is triggered when the embedded point enters a second page from a first page, updating the user access path according to the comparison of the hierarchy of the first page and the hierarchy of the second page.
2. The method of claim 1, further comprising sending the user access path to a log server via message middleware as a landed log.
3. The method of claim 2, further comprising: and generating a path analysis map according to the buried point log.
4. The method of claim 1, wherein the user access path further comprises origin point location information on the accessed page.
5. The method according to claim 1, wherein the updating of the page identifier in the user access path specifically includes:
when the level of the first page is higher than or equal to the level of the second page, updating the page identifier of the corresponding level by using the page identifier of the second page;
and when the level of the first page is lower than that of the second page, updating the page identifier of the corresponding level by using the page identifier of the second page, and clearing all page identifiers below the level of the second page.
6. The method of claim 1, further comprising:
and when the buried point is triggered from the second page to a third page, further updating the user access path according to the comparison between the hierarchy of the second page and the hierarchy of the third page.
7. An apparatus for recording user access paths, comprising:
the page configuration unit is used for generating a hierarchy and a page identifier which are associated with a page in the client;
the embedded point configuration unit is used for configuring embedded points in the page, the embedded points are used for recording user access paths related to the page of the client when being triggered, and the user access paths comprise page level information of the accessed page and corresponding page identifiers; and
and the updating unit is used for updating the page identifier in the user access path according to the comparison between the hierarchy of the first page and the hierarchy of the second page when the embedded point is triggered when the embedded point enters a second page from the first page.
8. The apparatus of claim 7, further comprising a log transmitting unit for transmitting the user access path to a log server as a buried point log.
9. The apparatus of claim 8, further comprising a log analysis unit to generate a path analysis graph from the buried point log.
10. The apparatus of claim 7, wherein the user access path further comprises origin point location information on the accessed page.
11. The apparatus of claim 7, the update unit to further:
when the level of the first page is higher than or equal to the level of the second page, updating the page identifier of the corresponding level by using the page identifier of the second page;
and when the level of the first page is lower than that of the second page, updating the page identifier of the corresponding level by using the page identifier of the second page, and clearing all page identifiers below the level of the second page.
12. The apparatus of claim 7, the update unit to further:
and when the buried point is triggered from the second page to a third page, further updating the user access path according to the comparison between the hierarchy of the second page and the hierarchy of the third page.
13. An electronic device, comprising:
one or more processors;
a memory for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-6.
14. A computer readable medium having stored thereon executable instructions which, when executed by a processor, cause the processor to perform the method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010860569.0A CN111737630B (en) | 2020-08-25 | 2020-08-25 | Method for recording user access path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010860569.0A CN111737630B (en) | 2020-08-25 | 2020-08-25 | Method for recording user access path |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111737630A true CN111737630A (en) | 2020-10-02 |
| CN111737630B CN111737630B (en) | 2021-06-25 |
Family
ID=72658847
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010860569.0A Active CN111737630B (en) | 2020-08-25 | 2020-08-25 | Method for recording user access path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111737630B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112181798A (en) * | 2020-11-27 | 2021-01-05 | 蚂蚁智信(杭州)信息技术有限公司 | Data recording method and device |
| CN112258295A (en) * | 2020-11-04 | 2021-01-22 | 支付宝(杭州)信息技术有限公司 | Recording processing method, device and equipment |
| CN112632446A (en) * | 2020-12-30 | 2021-04-09 | 江苏苏宁云计算有限公司 | Page access path construction method and system |
| CN113556391A (en) * | 2021-07-16 | 2021-10-26 | 北京达佳互联信息技术有限公司 | Page communication method and device, electronic equipment and readable storage medium |
| CN115473839A (en) * | 2021-06-11 | 2022-12-13 | 北京字跳网络技术有限公司 | Data processing method, device and equipment based on buried point and storage medium |
| CN116095137A (en) * | 2022-12-21 | 2023-05-09 | 北京隆道网络科技有限公司 | Intelligent data acquisition and pushing method and system based on supply chain management |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150347122A1 (en) * | 2014-05-27 | 2015-12-03 | Alibaba Group Holding Limited | Method and Apparatus of Prompting an Update of an Application |
| CN106874337A (en) * | 2016-08-31 | 2017-06-20 | 阿里巴巴集团控股有限公司 | The statistical query method and device of flow guiding relation |
| CN107346505A (en) * | 2016-05-06 | 2017-11-14 | 北京京东尚科信息技术有限公司 | Information-pushing method and device |
| CN109558561A (en) * | 2018-12-04 | 2019-04-02 | 深圳创维数字技术有限公司 | A kind of user behavior path acquisition method, device, equipment and medium |
| CN110399067A (en) * | 2019-07-31 | 2019-11-01 | 江苏满运软件科技有限公司 | Point methods, device, electronic equipment, storage medium are buried in visualization |
| CN111526065A (en) * | 2020-04-13 | 2020-08-11 | 苏宁云计算有限公司 | Website page flow analysis method and system |
-
2020
- 2020-08-25 CN CN202010860569.0A patent/CN111737630B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150347122A1 (en) * | 2014-05-27 | 2015-12-03 | Alibaba Group Holding Limited | Method and Apparatus of Prompting an Update of an Application |
| CN107346505A (en) * | 2016-05-06 | 2017-11-14 | 北京京东尚科信息技术有限公司 | Information-pushing method and device |
| CN106874337A (en) * | 2016-08-31 | 2017-06-20 | 阿里巴巴集团控股有限公司 | The statistical query method and device of flow guiding relation |
| CN109558561A (en) * | 2018-12-04 | 2019-04-02 | 深圳创维数字技术有限公司 | A kind of user behavior path acquisition method, device, equipment and medium |
| CN110399067A (en) * | 2019-07-31 | 2019-11-01 | 江苏满运软件科技有限公司 | Point methods, device, electronic equipment, storage medium are buried in visualization |
| CN111526065A (en) * | 2020-04-13 | 2020-08-11 | 苏宁云计算有限公司 | Website page flow analysis method and system |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112258295A (en) * | 2020-11-04 | 2021-01-22 | 支付宝(杭州)信息技术有限公司 | Recording processing method, device and equipment |
| CN112258295B (en) * | 2020-11-04 | 2024-05-14 | 蚂蚁胜信(上海)信息技术有限公司 | Recording processing method, device and equipment |
| CN112181798A (en) * | 2020-11-27 | 2021-01-05 | 蚂蚁智信(杭州)信息技术有限公司 | Data recording method and device |
| CN112632446A (en) * | 2020-12-30 | 2021-04-09 | 江苏苏宁云计算有限公司 | Page access path construction method and system |
| CN115473839A (en) * | 2021-06-11 | 2022-12-13 | 北京字跳网络技术有限公司 | Data processing method, device and equipment based on buried point and storage medium |
| CN115473839B (en) * | 2021-06-11 | 2024-03-05 | 北京字跳网络技术有限公司 | Buried point-based data processing method, device, equipment and storage medium |
| CN113556391A (en) * | 2021-07-16 | 2021-10-26 | 北京达佳互联信息技术有限公司 | Page communication method and device, electronic equipment and readable storage medium |
| CN113556391B (en) * | 2021-07-16 | 2023-11-21 | 北京达佳互联信息技术有限公司 | Page communication method, device, electronic equipment and readable storage medium |
| CN116095137A (en) * | 2022-12-21 | 2023-05-09 | 北京隆道网络科技有限公司 | Intelligent data acquisition and pushing method and system based on supply chain management |
| CN116095137B (en) * | 2022-12-21 | 2023-08-18 | 北京隆道网络科技有限公司 | Intelligent data acquisition and pushing method and system based on supply chain management |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111737630B (en) | 2021-06-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111737630B (en) | Method for recording user access path | |
| US11238033B1 (en) | Interactive location queries for raw machine data | |
| US10776447B2 (en) | Digital communications platform for webpage overlay | |
| US11670288B1 (en) | Generating predicted follow-on requests to a natural language request received by a natural language processing system | |
| US7139973B1 (en) | Dynamic information object cache approach useful in a vocabulary retrieval system | |
| US8549497B2 (en) | High-level hypermedia synthesis for adaptive web | |
| WO2019038588A1 (en) | Editing a database during preview of a virtual web page | |
| US20060020883A1 (en) | Web page personalization | |
| US20080065769A1 (en) | Method and apparatus for argument detection for event firing | |
| JP2020502610A (en) | Allow Semantic Mashups on the Internet of Things | |
| CN103443786A (en) | Machine learning method to identify independent tasks for parallel layout in web browsers | |
| CN102985922A (en) | Method and apparatus for managing distributed computations within a computation space | |
| CN109284435B (en) | Internet-oriented user interaction trace capturing, storing and retrieving system and method | |
| CN103858121B (en) | Web applications are made to obtain the method and system of database change | |
| CN108540351B (en) | Automatic testing method for distributed big data service | |
| Bejeck | Kafka Streams in Action | |
| CN104270257A (en) | Network element level network management service configuration adaptive system and method based on PB and XPATH | |
| CN109710220A (en) | Relevant database querying method, device, equipment and storage medium | |
| CN113485909B (en) | Test method, test device, computing equipment and medium | |
| JPWO2003060764A1 (en) | Information retrieval system | |
| CN117271460B (en) | Scientific research digital networking service method and system based on scientific research digital object language relation | |
| CN112970011A (en) | Recording pedigrees in query optimization | |
| Ishikawa et al. | Mobile agent system for Web service integration in pervasive network | |
| CN115168474B (en) | Internet of things central station system building method based on big data model | |
| US20190188063A1 (en) | Mapping computer programs to network protocol methods |
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 |