CN111597422A - Buried point mapping method and device, computer equipment and storage medium - Google Patents

Buried point mapping method and device, computer equipment and storage medium Download PDF

Info

Publication number
CN111597422A
CN111597422A CN202010406915.8A CN202010406915A CN111597422A CN 111597422 A CN111597422 A CN 111597422A CN 202010406915 A CN202010406915 A CN 202010406915A CN 111597422 A CN111597422 A CN 111597422A
Authority
CN
China
Prior art keywords
target
data
buried point
page
text
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202010406915.8A
Other languages
Chinese (zh)
Inventor
罗嘉辉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tencent Technology Shenzhen Co Ltd
Original Assignee
Tencent Technology Shenzhen 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 Tencent Technology Shenzhen Co Ltd filed Critical Tencent Technology Shenzhen Co Ltd
Priority to CN202010406915.8A priority Critical patent/CN111597422A/en
Publication of CN111597422A publication Critical patent/CN111597422A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/951—Indexing; Web crawling techniques
    • 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 Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The application relates to a buried point mapping method, a buried point mapping device, computer equipment and a storage medium. The method comprises the following steps: acquiring a target page, and acquiring a page snapshot corresponding to the target page based on the target page; acquiring a target buried point in a page snapshot and data of a first element where the target buried point is located; when the buried point corresponding to the target buried point does not exist in the target page is judged based on the data of the first element, the data of each second element in the target page is obtained; matching the data of the first element with the data of each second element respectively, and determining the similarity between each second element and the first element respectively; and determining a target element from each second element based on the similarity between each second element and the first element, and mapping the target buried point to the target element in the target page. By adopting the method, the target buried point in the page snapshot can be mapped to the target page.

Description

Buried point mapping method and device, computer equipment and storage medium
Technical Field
The present application relates to the field of computer technologies, and in particular, to a method and an apparatus for buried point mapping, a computer device, and a storage medium.
Background
With the development of network and computer technologies, more and more user information is generated. Enterprises can collect the user information for analysis, so that products which meet the requirements of users better are produced. In a conventional information acquisition method, a buried point is usually added in a web page, and information of a user is acquired through the buried point.
However, when a new web page is obtained by changing the web page, the buried point in the web page will also fail, and there is a problem that the buried point cannot be mapped to the new web page.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a method, an apparatus, a computer device and a storage medium for mapping a buried point to a new page.
A method of buried point mapping, the method comprising:
acquiring a target page, and acquiring a page snapshot corresponding to the target page based on the target page;
acquiring a target buried point in the page snapshot and data of a first element where the target buried point is located;
when it is judged that the buried point corresponding to the target buried point does not exist in the target page based on the data of the first element, acquiring data of each second element in the target page;
matching the data of the first element with the data of each second element respectively, and determining the similarity between each second element and the first element respectively;
determining a target element from each of the second elements based on a similarity between the respective second element and the first element, and mapping the target buried point to the target element in the target page.
A buried point mapping apparatus, the apparatus comprising:
the target page and page snapshot obtaining module is used for obtaining a target page and obtaining a page snapshot corresponding to the target page based on the target page;
the data acquisition module of the first element is used for acquiring a target buried point in the page snapshot and data of the first element where the target buried point is located;
the data acquisition module of the second element is used for acquiring data of each second element in the target page when judging that the buried point corresponding to the target buried point does not exist in the target page based on the data of the first element;
a similarity determining module, configured to match the data of the first element with the data of each second element, and determine a similarity between each second element and the first element;
and the buried point mapping module is used for determining a target element from each second element based on the similarity between each second element and the first element and mapping the target buried point to the target element in the target page.
A computer device comprising a memory storing a computer program and a processor implementing the steps of the method described above when executing the computer program.
A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the above-mentioned method.
According to the buried point mapping method, the buried point mapping device, the computer equipment and the storage medium, the target page is obtained, and the page snapshot corresponding to the target page is obtained based on the target page; acquiring a target buried point in a page snapshot and data of a first element where the target buried point is located; when the buried point corresponding to the target buried point does not exist in the target page is judged based on the data of the first element, the data of each second element in the target page is obtained; matching the data of the first element with the data of each second element respectively, and determining the similarity between each second element and the first element respectively; through the similarity between the second elements and the first elements, the similarity between the second elements and the first elements where the target embedded points are located can be obtained, so that the target elements can be determined from the second elements based on the similarity between the second elements and the first elements, and the target embedded points are mapped to the target elements in the target page, so that the target embedded points in the page snapshot can be mapped to the target page, the target embedded points can be more accurately mapped to the target elements in the target page, the embedded points can be reused, and the utilization rate of the embedded points is improved.
Drawings
FIG. 1 is a diagram of an exemplary environment in which the method for buried point mapping is implemented;
FIG. 2 is a schematic flow chart diagram illustrating a method for buried point mapping in one embodiment;
FIG. 3 is a schematic diagram of a visual site configuration system in one embodiment;
FIG. 4 is an architecture diagram of a visual buried point configuration system in one embodiment;
FIG. 5 is an interface diagram of a new Web crawling task in one embodiment;
FIG. 6 is an architecture diagram of a service layer of a crawler in one embodiment;
FIG. 7 is a diagram illustrating a method for buried point mapping in accordance with one embodiment;
FIG. 8 is a flowchart illustrating the step of determining similarity between a text element and a first element in one embodiment;
FIG. 9 is a schematic diagram of a buried point mapping method in another embodiment;
FIG. 10 is a block diagram of an exemplary embodiment of a buried point mapping device;
FIG. 11 is a diagram illustrating an internal structure of a computer device in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
The buried point mapping method provided by the application can be applied to the application environment shown in fig. 1. Wherein the terminal 102 communicates with the server 104 via a network. The terminal 102 sends the target page to the server 104, and the server 104 obtains the target page and obtains a page snapshot corresponding to the target page based on the target page; acquiring a target buried point in a page snapshot and data of a first element where the target buried point is located; when the buried point corresponding to the target buried point does not exist in the target page is judged based on the data of the first element, the data of each second element in the target page is obtained; matching the data of the first element with the data of each second element respectively, and determining the similarity between each second element and the first element respectively; and determining a target element from each second element based on the similarity between each second element and the first element, and mapping the target buried point to the target element in the target page. The terminal 102 may be, but not limited to, various personal computers, notebook computers, smart phones, tablet computers, and portable wearable devices, and the server 104 may be implemented by an independent server or a server cluster formed by a plurality of servers.
In one embodiment, as shown in fig. 2, there is provided a method for buried point mapping, which is applied in a computer device, where the computer device may be one of a server, a terminal, or other devices, and includes the following steps:
step 202, a target page is obtained, and a page snapshot corresponding to the target page is obtained based on the target page.
A page snapshot refers to a copy of a page at a certain point in time. Elements such as text, buttons, input boxes, navigation bars, pictures, links, video, audio, etc. may be included in the page snapshot. Likewise, in the target page, elements such as text, buttons, input boxes, navigation bars, pictures, links, video, audio, and the like may be included.
Specifically, the computer device obtains a target page, obtains an identifier of the target page, and obtains a page snapshot matched with the identifier of the target page from a memory based on the identifier of the target page. The identifier of the target page may include at least one of a number, a character string, a network address of the target page, and the like.
For example, the computer device obtains a target page and a network address of the target page, matches the network address of the target page with the network addresses of the page snapshots in the memory in sequence, and when a page snapshot consistent with the network address of the target page exists, the page snapshot is a page snapshot corresponding to the target page.
In one embodiment, a computer device may receive a destination page sent by another computer device. In another embodiment, the computer device may also obtain a target page accessed by the access instruction input by the user.
Step 204, acquiring a target buried point in the page snapshot and data of a first element where the target buried point is located.
A buried point refers to program code that captures, processes, and transmits for a particular user behavior or event. The target buried point refers to a buried point in the page snapshot. The number of target buried points in the page snapshot is not limited, and may be one or at least two.
The target buried point has a specific identifier, and the computer device may obtain the target buried point from the page snapshot based on the specific identifier. Wherein, the specific mark of the target buried point can be set according to the user requirement.
The first element in the page snapshot may be at least one of text, buttons, input boxes, navigation bars, pictures, links, video, audio, and the like. When the first element where the target buried point is located is a button, data such as the number of times the button is clicked and the clicked time can be collected through the target buried point. When the first element where the target buried point is located is a text, data such as the browsing times, the browsing duration and the browsing frequency of the text can be acquired through the target buried point. When the first element where the target embedded point is located is the input box, data such as the content input in the input box and the duration of the content input in the input box can be acquired through the target embedded point. When the first element where the target buried point is located is a video, data such as the number of times the video is watched and the watched time length of the video can be acquired through the target buried point.
The data of the first element where the target buried point is located refers to data related to the first element, and may include an attribute of the first element, a tag of the first element, a first element structure of the first element in a page structure of the page snapshot, and the like.
Wherein the attribute (classname) of the first element is, for example, the position of the first element, the color of the first element, the size of the font in the first element, the color of the font in the first element, etc.
The type of the first element can be obtained through the semantic of the tag of the first element, for example, if the tag of the first element is "article", and the semantic represents an article, it can be known that the first element is an article; the label of the first element is "button", and the semantic representation button can know that the first element is a button.
The first element structure of the first element in the page structure of the page snapshot refers to a structural relationship of the first element in a DOM (Document Object Model) tree of the page snapshot. The page snapshot comprises a DOM tree, and the structural relationship of the first element in the page structure can be obtained by analyzing the DOM tree. For example, if the first element a is an article, the first element B is a picture in the article, and the first element C is a link in the article, then the structural relationship among the first element a, the first element B, and the first element C is: the first element B and the first element C are child nodes in the first element A, and the first element B and the first element C are in parallel relation.
For example, when the first element where the target buried point is located is text, the data of the first element may be content of the text, font of the text, color of the text, position of the text, size of an area occupied by the text in the page snapshot, first element structure of the text in a page structure of the page snapshot, and the like. When the first element where the target buried point is located is a button, the data of the first element may be the position of the button, the size of the button, the first element structure of the button in the page structure of the page snapshot, and the like. When the first element where the target buried point is located is a picture, the data of the first element may be data of the size of the picture, the position of the picture, the address of the picture, the first element structure of the picture in the page structure of the page snapshot, and the like.
And step 206, when the buried points corresponding to the target buried points do not exist in the target page based on the data of the first elements, acquiring the data of each second element in the target page.
It can be understood that when the page structure of the page is changed, the buried point in the page is invalid, and thus the operations of data acquisition, data processing and transmission cannot be completed. For example, a target buried point a exists in the page snapshot, the first element where the target buried point a is located is a text, that is, < div id > </div >, and when the structure of the page corresponding to the page snapshot is changed, if the < div id > </div > is adjusted to be the < article > </article > structure, the target page is obtained, then the target buried point a fails, the target page does not have a buried point corresponding to the target buried point a, and data of the text cannot be acquired.
The second element in the target page may be at least one of text, buttons, input boxes, navigation bars, pictures, links, video, audio, and the like. The data of the second element refers to data related to the second element, and may include an attribute of the second element, a tag of the second element, a second element structure of the second element in a page structure of the target page, and the like.
Wherein the attribute (classname) of the second element is, for example, the position of the second element, the color of the second element, the size of the font in the second element, the color of the font in the second element, etc.
The type of the second element can be obtained through the semantic of the tag of the second element, for example, if the tag of the second element is "article", and the semantic represents an article, it can be known that the second element is an article; the label of the second element is "button", and the semantic representation button can know that the second element is a button.
The second element structure of the second element in the page structure of the target page refers to a structural relationship of the second element in the DOM tree of the target page. The target page comprises a DOM tree, and the structural relationship of the second element in the page structure can be obtained by analyzing the DOM tree. For example, if the second element a is an article, the second element B is a picture in the article, and the second element C is a link in the article, the structural relationship among the second element a, the second element B, and the second element C is: the second element B and the second element C are child nodes in the second element A, and the second element B and the second element C are in parallel relation.
For example, when the second element where the target buried point is located is text, the data of the second element may be content of the text, font of the text, color of the text, position of the text, size of an area occupied by the text in the target page, second element structure of the text in the page structure of the target page, and the like. When the second element where the target buried point is located is a button, the data of the second element may be the position of the button, the size of the button, the second element structure of the button in the page structure of the target page, and the like. When the second element where the target buried point is located is a picture, the data of the second element may be data of the size of the picture, the position of the picture, the address of the picture, the second element structure of the picture in the page structure of the target page, and the like.
In one embodiment, the computer device may query whether a buried point corresponding to the target buried point exists in the target page through a puppeteer $ eval interface.
And step 208, respectively matching the data of the first element with the data of each second element, and respectively determining the similarity between each second element and the first element.
The similarity between the second element and the first element refers to the degree of similarity between the second element and the first element. The higher the similarity, the more similar the second element is to the first element.
The data of the first element may include data of at least one dimension, the data of the second element may also include data of at least one dimension, for each dimension, the data of the first element and the data of the same dimension of the second element are matched through a diff command to obtain a matching result of each dimension, and then the similarity between the second element and the first element is determined according to the matching result of each dimension.
For example, the data of the first element and the data of the second element include two dimensions, which are size and position, respectively, and for the dimension of the size, the size of the first element and the size of the second element are matched through a diff command to obtain a matching result; and matching the position of the first element with the position of the second element by a diff command according to the dimension of the position to obtain a matching result, and determining the similarity between the second element and the first element according to the matching result obtained by the dimension of the size and the matching result obtained by the dimension of the position.
It should be noted that, when the second element does not have data of a certain dimension, and the first element has data of the dimension, the data of which the matching result is that the second element does not have the element can be directly generated. Similarly, when a first element does not have data of a certain dimension, and a second element does have data of the dimension, the matching result can be directly generated as the data of the element does not exist in the first element.
And step 210, determining a target element from each second element based on the similarity between each second element and the first element, and mapping the target buried point to the target element in the target page.
In one embodiment, the computer device may determine the second element with the highest similarity as the target element. In another embodiment, the computer device may also determine a second element with the second highest degree of similarity as the target element. In other embodiments, the computer device may also determine second elements of other similarities as the target element, without limitation.
Specifically, the computer device adds the target buried point in a target element in a target page; and updating the buried point information of the target page based on the target page after the target buried point is added. In the memory of the computer device, the buried point information of the target page is stored. The buried point information may include information of a second element where the buried point is located, an event monitored by the buried point, a time of creation of the buried point, and the like.
In one embodiment, after adding the target buried point in the target element in the target page, the computer device acquires the buried point information of the target page after adding the target buried point, and replaces the buried point information of the target page with the buried point information in the memory.
In another embodiment, after adding the target buried point in the target element in the target page, the computer device obtains the buried point information of the target buried point in the target page after adding the target buried point, and adds the buried point information of the target buried point to the memory.
The buried point mapping method comprises the steps of obtaining a target page and obtaining a page snapshot corresponding to the target page based on the target page; acquiring a target buried point in a page snapshot and data of a first element where the target buried point is located; when the buried point corresponding to the target buried point does not exist in the target page is judged based on the data of the first element, the data of each second element in the target page is obtained; matching the data of the first element with the data of each second element respectively, and determining the similarity between each second element and the first element respectively; through the similarity between the second elements and the first elements, the similarity between the second elements and the first elements where the target embedded points are located can be obtained, so that the target elements are determined from the second elements based on the similarity between the second elements and the first elements, and the target embedded points are mapped to the target elements in the target page, so that the target embedded points in the page snapshot can be mapped to the target page, the target embedded points can be more accurately mapped to the target elements in the target page, the embedded points can be reused, and the utilization rate of the embedded points is improved.
In addition, in the computer device, there are other functions related to the embedded point, such as embedded point testing, embedded point configuration, embedded point data reporting, etc., and the target embedded point is mapped to the target element through the embedded point mapping, so that the functions related to the embedded point in the computer device can be further improved.
In another embodiment, when the page snapshot corresponding to the target page is not found based on the target page, indicating that the target page is opened for the first time, the target page is stored in the memory of the computer device as the page snapshot for performing the subsequent buried point mapping.
In another embodiment, when it is determined that there is a buried point corresponding to the target buried point in the target page based on the data of the first element, the computer device may perform data collection, processing, and transmission through the buried point in the target page.
In an embodiment, when the similarity between each second element and the first element is lower than a preset threshold, it indicates that the target element corresponding to the target buried point cannot be found in the target page, and it may be determined that the target buried point is permanently lost, so as to generate the alarm information.
In one embodiment, a computer device may obtain a buried point configuration request and configure a buried point in a target page according to the buried point configuration request. The embedded point configuration request may include a location of embedded point configuration, an element of embedded point configuration, an event monitored by the embedded point, a location of data storage acquired by the embedded point, and the like. The buried point configuration request may be generated by a visual buried point configuration system.
FIG. 3 is a schematic diagram of a visual site configuration system in one embodiment. As shown in fig. 3, in the item list, an item a is included, and the user can check the buried point configured in the item a by clicking a button where the item a is located. The user can also configure the embedded point in the newly added item by clicking the button of the newly added item, so as to generate the embedded point configuration request.
FIG. 4 is an architecture diagram of a visual buried point configuration system in one embodiment. In fig. 4, the visual site deployment system includes three modules, which are an SDK (Software Development Kit) module 402, a deployment module 404, and a reporting module 406.
The SDK module 402 includes a unique id generator, which can generate a unique id of the buried point. The SDK module 402 further performs different operations according to different policies, for example, according to a buried point configuration instruction input by a user, the buried point configuration instruction is sent to the configuration module 404, the configuration module 404 communicates with the embedded point configuration instruction, and then receives a buried point configuration request sent by the configuration module 404, and sends the buried point configuration request to the computer device; for example, the data reporting instruction is sent to the reporting module 406 according to the data reporting instruction input by the user, and then the data pulled by the reporting module 406 is received.
After receiving the embedded point configuration instruction sent by the SDK module, the configuration module 404 may generate an embedded point configuration request through operations such as configuration pull and configuration service, and send the embedded point configuration request to the SDK module 402. Cache may also be provided in the configuration module 404 to relieve server stress. The configuration module may also store ckv the buried point configuration request. The ckv system is a key-value memory system. The configuration module 404 may also display data of the burial point configured in the burial point configuration request, and provide a visual interface for the user.
The reporting module 406 may receive a data reporting instruction of the SDK module 402, pull data from a buried point according to the data reporting instruction, perform data analysis service on the pulled data, report the pulled data, and send the data to the SDK module 402. The reporting module 406 may also store the pulled data to the tdw system. the tdw system is a storage system for distributed databases.
In one embodiment, the computer device may include a crawler program, the crawler program obtains a target page, and obtains a page snapshot corresponding to the target page based on the target page; acquiring a target buried point in a page snapshot and data of a first element where the target buried point is located; when the buried point corresponding to the target buried point does not exist in the target page is judged based on the data of the first element, the data of each second element in the target page is obtained; matching the data of the first element with the data of each second element respectively, and determining the similarity between each second element and the first element respectively; and determining the target elements from the second elements based on the similarity between the second elements and the first elements. The crawler program refers to a program that automatically executes preset operations according to certain rules. For example, a crawler may crawl data, may intercept interface functions called by a computer device, and so on.
In one embodiment, as shown in FIG. 5, a computer device can create a Web crawling task via a crawler. The newly-built Web crawling task is divided into three steps, namely website input, data grabbing and setting. In the step of inputting the website, the information of a webpage address to be crawled, a task name, a project name, whether to log in and the like needs to be input, and the step of capturing data can be executed by clicking a 'next' button. After the data is grabbed, the grabbed data may be set.
In one embodiment, an architecture diagram of the service layer of a crawler is shown in FIG. 6. The crawler program can provide scheduling service, and the scheduling service is managed in a distributed mode and supports large-scale crawling of data. The scheduling service comprises a timing scheduling function and can perform task configuration and agent configuration from the configuration module at regular time; then, authority management is carried out through an authority module, and authority is verified; after the verification is passed, a crawling module can be called to perform anti-crawling, browser instance management, preprocessing, content identification and other operations are performed through a browser engine, and therefore data are crawled; sending the crawled data to a cleaning module, and performing operations such as duplicate removal verification, sensitive word cleaning, general cleaning and the like; and sending the clear data to a warehousing module for warehousing configuration and warehousing distribution operation. The scheduling service also includes a machine monitoring function and a task monitoring keep-alive function.
The crawler program further comprises a Web interface, an external calling interface, a service interface, a storage interface and the like, the Web service can be accessed through the Web interface, data can be called from the outside through the external calling interface, each service module of the crawler program can be called through the service interface, and the data can be stored in the storage or acquired from the storage through the storage interface.
The crawler program can perform visual task configuration through a visual task configuration platform, and can analyze and monitor data through a data analysis monitoring platform. The crawler also includes an interface service. The crawler program further includes a Remote Dictionary Server (Redis) service, and an Elasticissearch service; the Elasticsearch is a Lucene-based search server.
In one embodiment, the data of the first element includes a first element structure of the first element in a page structure of the page snapshot; the method for judging whether the buried point corresponding to the target buried point exists in the target page based on the data of the first element comprises the following steps: comparing the first element structure with second element structures of all second elements included in the target page respectively, and when second elements consistent with the first element structures exist, the target page has buried points corresponding to the target buried points; when the second element structure of each second element included in the target page is not consistent with the first element structure, the target page does not have a buried point corresponding to the target buried point.
The first element structure of the first element in the page structure of the page snapshot refers to a structural relationship of the first element in a DOM tree of the page snapshot. The target page comprises data of a second element, and the data of the second element comprises a second element structure of the second element in a page structure of the target page. The second element structure of the second element in the target page of the page snapshot refers to a structural relationship of the second element in a DOM tree of the target page.
The computer equipment compares the first element structure with the second element structures of the second elements included in the target page respectively, and when the second elements consistent with the first element structures exist, the second element structures of the second elements in the target page are not changed, the buried points corresponding to the target buried points exist in the target page, and the buried points corresponding to the second elements, namely the target buried points in the page snapshot, are still effective.
When the second element structures of the second elements included in the target page are all inconsistent with the first element structures, the second element structures of the second elements in the target page are changed, the buried points corresponding to the target buried points do not exist in the target page, and the target buried points in the page snapshot are invalid in the target page.
In this embodiment, by comparing the first element structure with the second element structures of the second elements included in the target page, it can be more accurately determined whether a buried point corresponding to the target buried point exists in the target page, that is, whether the target buried point in the page snapshot is valid in the target page is more accurately determined.
In one embodiment, the data of the first element includes an attribute of the first element and a tag of the first element, and the data of the second element includes an attribute of the second element and a tag of the second element; matching the data of the first element with the data of each second element respectively, and determining the similarity between each second element and the first element respectively, wherein the matching comprises the following steps: matching the attributes of the first elements with the attributes of the second elements respectively, and determining the first numerical values of the second elements respectively according to the matching results; matching the labels of the first elements with the labels of the second elements respectively, and determining second numerical values of the second elements respectively according to matching results; for each second element, a similarity between the second element and the first element is determined based on the first value and the second value.
The attribute of the first element is, for example, the size of the area occupied by the first element, the color of the first element, the font size of the text in the first element, the font color of the text in the first element, and the like. The attribute of the second element is, for example, the size of the area occupied by the second element, the color of the second element, the font size of the text in the second element, the font color of the text in the second element, and the like.
The label of the first element indicates the type of the first element, and the label of the second element indicates the type of the second element. For example, "avatar" represents an article, "title" represents a title, "button" represents a button, "paragraph" represents a paragraph, and so on.
The computer equipment matches the attribute of the first element with the attribute of the second element, when the attribute of the first element is consistent with the attribute of the second element, the matching result is successful, and a first numerical value corresponding to the successful matching can be obtained; when the attribute of the first element is inconsistent with the attribute of the second element, the matching result is unsuccessful, and a first numerical value corresponding to the unsuccessful matching can be obtained. The first numerical values corresponding to different matching results can be set according to the needs of the user.
The computer equipment matches the label of the first element with the label of the second element, when the label of the first element is consistent with the label of the second element, the matching result is successful, and a second numerical value corresponding to the successful matching can be obtained; when the label of the first element is inconsistent with the label of the second element, the matching result is unsuccessful, and a second numerical value corresponding to the unsuccessful matching can be obtained. The second numerical values corresponding to different matching results can be set according to the user requirements.
In one embodiment, for each second element, the first value and the second value are added, and the sum obtained by the addition is taken as the similarity between the second element and the first element.
For example, the attribute of the first element is a1, the tag is B1, when the attribute of the second element is a1, the first value of the second element is 10, and when the tag of the second element is B1, the second value of the second element is 10, so that the similarity between the second element and the first element is 10+10 ═ 20.
In another embodiment, a first weighting factor corresponding to the attribute of the second element is obtained, a second weighting factor corresponding to the tag of the second element is obtained, the first numerical value and the first weighting factor are multiplied for each second element, the second numerical value and the second weighting factor are multiplied, the obtained products are added, and finally, the sum obtained by the addition is used as the similarity between the second element and the first element.
For example, the first weighting factor corresponding to the attribute of the second element is 0.4, the second weighting factor corresponding to the label of the second element is 0.6, the first value of the second element a is 10, the second value is 20, the first value of the second element B is 20, and the first value is 15, so that the similarity between the second element a and the first element is 0.4 × 10+0.6 × 20 — 16, and the similarity between the second element B and the first element is 0.4 × 20+0.6 × 15 — 17.
In this embodiment, the attributes of the first element are respectively matched with the attributes of each second element, and the first numerical value of each second element is respectively determined according to the matching result; matching the labels of the first elements with the labels of the second elements respectively, and determining second numerical values of the second elements respectively according to matching results; for each second element, based on the first and second values, the similarity between the second element and the first element can be determined more accurately.
In one embodiment, the data of the first element includes a first element structure of the first element in a page structure of the page snapshot; comparing the first element structure with second element structures of all second elements included in the target page respectively, and when second elements consistent with the first element structures exist, the target page has buried points corresponding to the target buried points; when the second element structures of the second elements included in the target page are not consistent with the first element structures, the target page does not have buried points corresponding to the target buried points; the data of the first element comprises the attribute of the first element and the label of the first element, and the data of the second element comprises the attribute of the second element and the label of the second element; when the buried point corresponding to the target buried point does not exist in the target page is judged based on the data of the first element, the data of each second element in the target page is obtained; matching the attributes of the first elements with the attributes of the second elements respectively, and determining the first numerical values of the second elements respectively according to the matching results; matching the labels of the first elements with the labels of the second elements respectively, and determining second numerical values of the second elements respectively according to matching results; for each second element, a similarity between the second element and the first element is determined based on the first value and the second value.
In this embodiment, whether a buried point corresponding to the target buried point exists in the target page can be more accurately determined through the first element structure and the second element structures of the second elements included in the target page, when a buried point corresponding to the target buried point does not exist in the target page, the attributes of the first elements are further respectively matched with the attributes of the second elements, and the tags of the first elements are respectively matched with the tags of the second elements, so that the target elements corresponding to the target buried point can be more accurately determined from the target page.
As shown in fig. 7, the buried point mapping algorithm of this embodiment combines DOM structure analysis, attribute analysis, and tag analysis, and can more accurately determine the target elements corresponding to the target buried points in the target page, thereby more accurately performing buried point mapping.
In one embodiment, as shown in fig. 8, matching the data of the first element with the data of each second element, and determining the similarity between each second element and the first element respectively includes:
and step 802, when the content of the first element comprises text, screening out text elements of which the content comprises the text from each second element of the target page.
When the first element is an input box, an article, a comment, or the like, then the content of the first element includes text. The text element refers to a second element of the target page whose content includes text.
And 804, respectively matching the texts included in the contents of the first elements with the texts included in the contents of the text elements, and respectively determining the similarity between each text element and the first element.
The content of the first element includes text including data of the text itself, the number of words of the text, the font of the text, and the like. Likewise, the content of the text element includes text which also includes data such as the content of the text itself, the number of words of the text, the font of the text, and the like.
Specifically, for each dimension of the text included in the content of the first element and the text included in the content of the text element, data of the same dimension are matched, and the similarity between the text element and the first element is determined according to the matching result.
Determining a target element from the second elements based on the similarity between the second elements and the first element, including:
step 806, determining a target element from the respective text elements based on the similarity between the respective text elements and the first element.
In this embodiment, when the content of the first element includes a text, text elements whose content includes the text are screened from each second element of the target page, and then the text included in the content of the first element is respectively matched with the text included in the content of each text element, so as to respectively determine the similarity between each text element and the first element; the matching of the first element and all the second elements is avoided, and the matching efficiency can be improved, so that the target element can be found more quickly, and the target buried point can be mapped to the target element more quickly.
In one embodiment, the method further comprises: determining a first text intensity of the first element based on text included in content of the first element; the first text density is positively correlated with the number of texts included in the content of the first element; determining a second text intensity of the text element based on text included in the content of the text element; the second text intensity positively correlates with the amount of text included in the content of the text element. Matching texts included in the content of the first element with texts included in the content of each text element, and respectively determining the similarity between each text element and the first element, wherein the matching comprises the following steps: and respectively matching the first text intensity of the first element with the second text intensity of each text element, and respectively determining the similarity between each text element and the first element.
Text density refers to the degree to which text is dense. When the content of an element includes more text, the greater the text intensity of the element. The first text intensity refers to the intensity of the text included in the content of the first element. The second text intensity refers to the intensity of the text included in the content of the second element.
For example, if the first element is an article, the content of the article includes 1000 words of text, the second element is a comment, and the content of the comment includes 100 words of text, the first element has a high text density and the second element has a low text density.
It can be understood that, the text included in the content of the text element in the page is usually input by the user, the developer usually modifies the page structure of the page, but does not modify the content included in the text element in the page, so the number of texts included in the content of the text element does not change, that is, the second text density of the text element does not change, and by matching the first text density of the first element with the second text density of the text element, the similarity between the first element and each text element can be more accurate, and thus the target element can be more accurately determined.
In one embodiment, the data of the first element comprises visual data of the first element; the data of the second element includes visual data of the second element. Matching the data of the first element with the data of each second element respectively, and determining the similarity between each second element and the first element respectively, wherein the matching comprises the following steps: and respectively matching the visual data of the first element with the visual data of each second element, and respectively determining the similarity between each second element and the first element.
Visual data includes data such as the color of an element, the size of an element, font size, font color, etc.
In a simple ui (user interface) page, two elements are respectively a title and a text, and after the position of the title and the id of the element are adjusted, the buried point where the title is located is invalid. By respectively matching the visual data of the first element with the visual data of each second element in the embodiment, the target element, namely the title, can be quickly found, and the target buried point is mapped to the title. For the UI test system, after the change of the page is detected, the change content can be further analyzed by a buried point mapping method.
In one embodiment, when it is determined that there is no buried point corresponding to the target buried point in the target page based on the data of the first element, after acquiring the data of each second element in the target page, the method further includes: acquiring second terminal identifications of second terminals connected with the server; the second terminal identification is the identification of other terminals except the first terminal identification, and the first terminal identification is the identification of the terminal for sending the target page to the server; generating a buried point failure instruction, and respectively sending the buried point failure instruction to the second terminal where each second terminal identification is located; and the buried point failure instruction is used for indicating the second terminal to intercept the buried point mapping request.
The first terminal identification is an identification of a terminal that sends the target page to the server. And when the server acquires the target page and judges that the buried point corresponding to the target buried point does not exist in the target page, acquiring each second terminal identification connected with the server. The second terminal identity is an identity of the other terminal than the first terminal identity.
It can be understood that, when there is no buried point corresponding to the target buried point in the target page, the server needs to process the target page every time it receives the target page sent by one terminal, which increases the processing pressure of the server. In this embodiment, when the server receives the target page sent by the first terminal and determines that no target buried point exists in the target page, a buried point failure instruction is generated and sent to each second terminal, and the buried point failure instruction is used to instruct the second terminal to intercept the buried point mapping request, which indicates that the target buried point of the target page is being updated, and the buried point mapping request does not need to be sent repeatedly, so that the processing pressure of the server can be reduced.
Further, after the server maps the target buried point to the target element in the target page, the method further includes: generating a buried point effective instruction, and respectively sending the buried point effective instruction to the second terminals where the second terminal identifications are located; and the buried point effective instruction is used for indicating the second terminal to remove the interception of the buried point mapping request. The buried point mapping request includes a target page.
It can be understood that after the target buried point is mapped to the target element in the target page, the target buried point in the target page is valid, and operations such as collecting data, monitoring a specific event, and the like can be performed through the target buried point. The server sends the embedded point effective instruction to each second terminal, and instructs the second terminals to remove the interception of the embedded point mapping request, so that the server can receive the embedded point mapping request sent by the second terminals.
In one embodiment, as shown in fig. 9, in step 1, the first terminal sends a target page to the server; step 2, the server compares the target page with the corresponding page snapshot through a diff command; step 3, when the buried points corresponding to the target buried points do not exist in the target page, respectively calculating the similarity of the first elements and each second element; step 4, storing the similarity of each second element in a queue; and 5, determining the second element with the highest similarity in the queue as the target element.
In step 1, when the first terminal detects that the target page is opened, the target page is sent to the server. Further, the DOM tree of the target page may be sent to the server as a parameter. The target page may be a page in a browser.
In one embodiment, a buried point mapping method is provided, comprising the steps of:
step 1, a target page is obtained, and a page snapshot corresponding to the target page is obtained based on the target page.
And 2, acquiring a target buried point in the page snapshot and data of a first element where the target buried point is located.
Step 3, the data of the first element comprises a first element structure of the first element in the page structure of the page snapshot; and comparing the first element structure with the second element structures of the second elements included in the target page respectively, wherein when the second elements consistent with the first element structures exist, the target page has the buried points corresponding to the target buried points.
And 4, when the second element structures of the second elements included in the target page are not consistent with the first element structures, the target page does not have the buried points corresponding to the target buried points.
And 5, when the buried points corresponding to the target buried points do not exist in the target page based on the data of the first elements, acquiring the data of each second element in the target page.
Step 6, the data of the first element comprises the attribute of the first element and the label of the first element, and the data of the second element comprises the attribute of the second element and the label of the second element; matching the attributes of the first elements with the attributes of the second elements respectively, and determining the first numerical values of the second elements respectively according to the matching results;
and 7, matching the labels of the first elements with the labels of the second elements respectively, and determining the second numerical values of the second elements respectively according to the matching results.
Step 8, the data of the first element comprises visual data of the first element; the data of the second element comprises visual data of the second element; and matching the visual data of the first element with the visual data of each second element respectively, and determining a third numerical value of each second element respectively according to the matching result.
And 9, determining the similarity between the second element and the first element according to the first value, the second value and the third value aiming at each second element.
In one embodiment, the first value, the second value and the third value may be added, and the sum obtained by the addition may be taken as the similarity between the second element and the first element. In another embodiment, a first weighting factor corresponding to the attribute of the second element, a second weighting factor corresponding to the tag of the second element, and a third weighting factor corresponding to the visual data of the second element may be obtained, for each second element, the first value and the first weighting factor are multiplied, the second value and the second weighting factor, and the third value and the third weighting factor are multiplied, the obtained products are added, and finally, the sum obtained by the addition is used as the similarity between the second element and the first element.
And step 10, determining target elements from the second elements based on the similarity between the second elements and the first elements, and mapping the target buried points to the target elements in the target page.
And 11, when the content of the first element comprises the text, screening out the text element of which the content comprises the text from each second element of the target page.
Step 12, determining a first text intensity of the first element based on the text included in the content of the first element; the first text intensity positively correlates with the amount of text included in the content of the first element.
Step 13, determining a second text intensity of the text element based on the text included in the content of the text element; the second text intensity positively correlates with the amount of text included in the content of the text element.
And 14, respectively matching the first text intensity of the first element with the second text intensity of each text element, respectively matching the attribute of the first element with the attribute of each second element, respectively matching the label of the first element with the label of each second element, respectively matching the visual data of the first element with the visual data of each second element, and respectively determining the similarity between each text element and the first element.
And step 15, determining a target element from each text element based on the similarity between each text element and the first element, and mapping the target buried point to the target element in the target page.
Step 16, acquiring a second terminal identifier of each second terminal connected with the server; the second terminal identification is the identification of other terminals except the first terminal identification, and the first terminal identification is the identification of the terminal which sends the target page to the server.
Step 17, generating a buried point failure instruction, and respectively sending the buried point failure instruction to the second terminals where the second terminal identifications are located; and the buried point failure instruction is used for indicating the second terminal to intercept the buried point mapping request.
It should be understood that although the steps in the flowcharts of fig. 2 and 8 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 2 and 8 may include multiple steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, which are not necessarily performed in sequence, but may be performed in turn or alternately with other steps or at least some of the other steps.
In one embodiment, as shown in fig. 10, there is provided a buried point mapping apparatus 1000, which may be a part of a computer device using a software module or a hardware module, or a combination of the two, the apparatus specifically includes: a target page and page snapshot obtaining module 1002, a first element data obtaining module 1004, a second element data obtaining module 1006, a similarity determining module 1008, and a buried point mapping module 1010, wherein:
the target page and page snapshot obtaining module 1002 is configured to obtain a target page and obtain a page snapshot corresponding to the target page based on the target page.
The data obtaining module 1004 of the first element is configured to obtain a target buried point in the page snapshot and data of the first element where the target buried point is located.
And a data acquisition module 1006 of the second elements, configured to acquire data of each second element in the target page when it is determined that there is no buried point corresponding to the target buried point in the target page based on the data of the first element.
And a similarity determining module 1008, configured to match the data of the first element with the data of each second element, and determine a similarity between each second element and the first element.
And a buried point mapping module 1010, configured to determine a target element from each second element based on the similarity between each second element and the first element, and map the target buried point to the target element in the target page.
The buried point mapping device acquires a target page and acquires a page snapshot corresponding to the target page based on the target page; acquiring a target buried point in a page snapshot and data of a first element where the target buried point is located; when the buried point corresponding to the target buried point does not exist in the target page is judged based on the data of the first element, the data of each second element in the target page is obtained; matching the data of the first element with the data of each second element respectively, and determining the similarity between each second element and the first element respectively; through the similarity between the second elements and the first elements, the similarity between the second elements and the first elements where the target embedded points are located can be obtained, so that the target elements are determined from the second elements based on the similarity between the second elements and the first elements, and the target embedded points are mapped to the target elements in the target page, so that the target embedded points in the page snapshot can be mapped to the target page, the target embedded points can be more accurately mapped to the target elements in the target page, the embedded points can be reused, and the utilization rate of the embedded points is improved.
In one embodiment, the data of the first element includes a first element structure of the first element in a page structure of the page snapshot. The buried point mapping device further comprises a judging module, which is used for comparing the first element structure with the second element structures of all the second elements included in the target page respectively, and when the second elements consistent with the first element structures exist, buried points corresponding to the target buried points exist in the target page; when the second element structure of each second element included in the target page is not consistent with the first element structure, the target page does not have a buried point corresponding to the target buried point.
In one embodiment, the data of the first element includes an attribute of the first element and a tag of the first element, and the data of the second element includes an attribute of the second element and a tag of the second element. The similarity determination module 1008 is further configured to match the attributes of the first elements with the attributes of the second elements, and determine first values of the second elements according to matching results; matching the labels of the first elements with the labels of the second elements respectively, and determining second numerical values of the second elements respectively according to matching results; for each second element, a similarity between the second element and the first element is determined based on the first value and the second value.
In one embodiment, the similarity determination module 1008 is further configured to, when the content of the first element includes text, screen out text elements whose content includes text from respective second elements of the target page; and respectively matching the texts included in the content of the first element with the texts included in the content of each text element, and respectively determining the similarity between each text element and the first element. The above-mentioned buried point mapping module 1010 is further configured to determine a target element from each text element based on the similarity between each text element and the first element.
In one embodiment, the above-mentioned buried point mapping apparatus further includes a text density obtaining module, configured to determine a first text density of the first element based on a text included in the content of the first element; the first text density is positively correlated with the number of texts included in the content of the first element; determining a second text intensity of the text element based on text included in the content of the text element; the second text intensity positively correlates with the amount of text included in the content of the text element. The similarity determining module 1008 is further configured to match the first text intensity of the first element with the second text intensity of each text element, and determine similarity between each text element and the first element.
In one embodiment, the data of the first element comprises visual data of the first element; the data of the second element includes visual data of the second element. The similarity determination module 1008 is further configured to match the visual data of the first element with the visual data of each second element, and determine a similarity between each second element and the first element.
In one embodiment, the embedded point mapping module is applied to a server, and further includes an embedded point failure instruction generation module, configured to obtain a second terminal identifier of each second terminal connected to the server; the second terminal identification is the identification of other terminals except the first terminal identification, and the first terminal identification is the identification of the terminal for sending the target page to the server; generating a buried point failure instruction, and respectively sending the buried point failure instruction to the second terminal where each second terminal identification is located; and the buried point failure instruction is used for indicating the second terminal to intercept the buried point mapping request.
For the specific definition of the buried point mapping device, reference may be made to the above definition of the buried point mapping method, which is not described herein again. The modules in the above-mentioned buried point mapping device can be wholly or partially implemented by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be as shown in fig. 11. The computer device includes a processor, a memory, and a network interface connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database of the computer device is used for storing the buried point mapping data. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a buried point mapping method.
Those skilled in the art will appreciate that the architecture shown in fig. 11 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, a computer device is further provided, which includes a memory and a processor, the memory stores a computer program, and the processor implements the steps of the above method embodiments when executing the computer program.
In an embodiment, a computer-readable storage medium is provided, in which a computer program is stored which, when being executed by a processor, carries out the steps of the above-mentioned method embodiments.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database or other medium used in the embodiments provided herein can include at least one of non-volatile and volatile memory. Non-volatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical storage, or the like. Volatile Memory can include Random Access Memory (RAM) or external cache Memory. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM), among others.
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims (10)

1. A method for buried point mapping, the method comprising:
acquiring a target page, and acquiring a page snapshot corresponding to the target page based on the target page;
acquiring a target buried point in the page snapshot and data of a first element where the target buried point is located;
when it is judged that the buried point corresponding to the target buried point does not exist in the target page based on the data of the first element, acquiring data of each second element in the target page;
matching the data of the first element with the data of each second element respectively, and determining the similarity between each second element and the first element respectively;
determining a target element from each of the second elements based on a similarity between the respective second element and the first element, and mapping the target buried point to the target element in the target page.
2. The method of claim 1, wherein the data of the first element comprises a first element structure of the first element in a page structure of the page snapshot;
judging whether a buried point corresponding to the target buried point exists in the target page based on the data of the first element, wherein the judging comprises the following steps:
comparing the first element structure with second element structures of all second elements included in the target page respectively, wherein when second elements consistent with the first element structures exist, buried points corresponding to the target buried points exist in the target page;
and when the second element structures of the second elements included in the target page are all inconsistent with the first element structures, the target page does not have the buried points corresponding to the target buried points.
3. The method of claim 1, wherein the data of the first element comprises an attribute of the first element and a tag of the first element, and the data of the second element comprises an attribute of the second element and a tag of the second element;
the matching the data of the first element with the data of each second element to determine the similarity between each second element and the first element respectively includes:
matching the attributes of the first elements with the attributes of the second elements respectively, and determining first numerical values of the second elements respectively according to matching results;
matching the label of the first element with the label of each second element respectively, and determining a second numerical value of each second element according to the matching result;
for each of the second elements, determining a similarity between the second element and the first element based on the first and second numerical values.
4. The method according to claim 1, wherein the matching the data of the first element with the data of each of the second elements, respectively, and the determining the similarity between each of the second elements and the first element, respectively, comprises:
when the content of the first element comprises text, screening out text elements of which the content comprises the text from each second element of the target page;
respectively matching texts included in the content of the first element with texts included in the content of each text element, and respectively determining the similarity between each text element and the first element;
the determining a target element from each of the second elements based on the similarity between each of the second elements and the first element includes:
determining a target element from each of the text elements based on a similarity between the respective text element and the first element.
5. The method of claim 4, further comprising:
determining a first text intensity of the first element based on text included with content of the first element; the first text intensity is positively correlated with the amount of text included in the content of the first element;
determining a second text intensity of the text element based on text included in the content of the text element; the second text intensity is positively correlated with the number of texts included in the content of the text element;
the matching the texts included in the content of the first element with the texts included in the content of each text element, and determining the similarity between each text element and the first element respectively, includes:
and respectively matching the first text intensity of the first element with the second text intensity of each text element, and respectively determining the similarity between each text element and the first element.
6. The method of claim 1, wherein the data of the first element comprises visual data of the first element; the data of the second element comprises visual data of the second element;
the matching the data of the first element with the data of each second element to determine the similarity between each second element and the first element respectively includes:
and matching the visual data of the first element with the visual data of each second element respectively, and determining the similarity between each second element and the first element respectively.
7. The method of claim 1, applied to a server, after acquiring data of each second element in the target page when it is determined that there is no buried point corresponding to the target buried point in the target page based on the data of the first element, further comprising:
acquiring second terminal identifications of second terminals connected with the server; the second terminal identification is the identification of other terminals except the first terminal identification, and the first terminal identification is the identification of the terminal for sending the target page to the server;
generating a buried point failure instruction, and respectively sending the buried point failure instruction to the second terminal where each second terminal identification is located; and the buried point failure instruction is used for indicating the second terminal to intercept the buried point mapping request.
8. A buried point mapping apparatus, the apparatus comprising:
the target page and page snapshot obtaining module is used for obtaining a target page and obtaining a page snapshot corresponding to the target page based on the target page;
the data acquisition module of the first element is used for acquiring a target buried point in the page snapshot and data of the first element where the target buried point is located;
the data acquisition module of the second element is used for acquiring data of each second element in the target page when judging that the buried point corresponding to the target buried point does not exist in the target page based on the data of the first element;
a similarity determining module, configured to match the data of the first element with the data of each second element, and determine a similarity between each second element and the first element;
and the buried point mapping module is used for determining a target element from each second element based on the similarity between each second element and the first element and mapping the target buried point to the target element in the target page.
9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor, when executing the computer program, implements the steps of the method of any of claims 1 to 7.
10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 7.
CN202010406915.8A 2020-05-14 2020-05-14 Buried point mapping method and device, computer equipment and storage medium Pending CN111597422A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010406915.8A CN111597422A (en) 2020-05-14 2020-05-14 Buried point mapping method and device, computer equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010406915.8A CN111597422A (en) 2020-05-14 2020-05-14 Buried point mapping method and device, computer equipment and storage medium

Publications (1)

Publication Number Publication Date
CN111597422A true CN111597422A (en) 2020-08-28

Family

ID=72187359

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010406915.8A Pending CN111597422A (en) 2020-05-14 2020-05-14 Buried point mapping method and device, computer equipment and storage medium

Country Status (1)

Country Link
CN (1) CN111597422A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112948226A (en) * 2021-02-05 2021-06-11 中国建设银行股份有限公司 User portrait drawing method and device
CN112988532A (en) * 2021-01-27 2021-06-18 腾讯科技（深圳）有限公司 Reporting method and device of embedded point event, server and storage medium
CN113127373A (en) * 2021-05-18 2021-07-16 爱驰汽车有限公司 Visual point burying method, system, device, equipment and storage medium

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112988532A (en) * 2021-01-27 2021-06-18 腾讯科技（深圳）有限公司 Reporting method and device of embedded point event, server and storage medium
CN112988532B (en) * 2021-01-27 2022-07-29 腾讯科技（深圳）有限公司 Reporting method and device of embedded point event, server and storage medium
CN112948226A (en) * 2021-02-05 2021-06-11 中国建设银行股份有限公司 User portrait drawing method and device
CN112948226B (en) * 2021-02-05 2024-04-02 中国建设银行股份有限公司 User portrait drawing method and device
CN113127373A (en) * 2021-05-18 2021-07-16 爱驰汽车有限公司 Visual point burying method, system, device, equipment and storage medium

Similar Documents

Publication Publication Date Title
US9614862B2 (en) System and method for webpage analysis
CN112564988B (en) Alarm processing method and device and electronic equipment
KR101099152B1 (en) Automatic task generator method and system
CN111310427A (en) Service data configuration processing method and device, computer equipment and storage medium
US20110307436A1 (en) Pattern tree-based rule learning
CN111597422A (en) Buried point mapping method and device, computer equipment and storage medium
US10735492B2 (en) Reporting un-deployed application features
CN108809718B (en) Network access method, system, computer device and medium based on virtual resources
KR102362516B1 (en) Apparatus for processing cyber threat information, method for processing cyber threat information, and medium for storing a program processing cyber threat information
CN114528457A (en) Web fingerprint detection method and related equipment
CN115033876A (en) Log processing method, log processing device, computer device and storage medium
CN111371757B (en) Malicious communication detection method and device, computer equipment and storage medium
CN115150261B (en) Alarm analysis method, device, electronic equipment and storage medium
US20220237240A1 (en) Method and apparatus for collecting information regarding dark web
CN105184156A (en) Security threat management method and system
CN114205216A (en) Root cause positioning method and device for micro-service fault, electronic equipment and medium
KR20230103275A (en) Apparatus for processing cyber threat information, method for processing cyber threat information, and medium for storing a program processing cyber threat information
CN111666298A (en) Method and device for detecting user service class based on flink, and computer equipment
KR102411383B1 (en) Apparatus for processing cyber threat information, method for processing cyber threat information, and medium for storing a program processing cyber threat information
CN115544007A (en) Label preprocessing method and device, computer equipment and storage medium
CN114610973A (en) Information search matching method and device, computer equipment and storage medium
CN113722646A (en) Multi-level fingerprint identification method for multiple browser extensions
CN111694737A (en) Container influence measuring method and device based on mirror image dependency network
KR102447279B1 (en) Apparatus for processing cyber threat information, method for processing cyber threat information, and medium for storing a program processing cyber threat information
KR102447278B1 (en) Apparatus for processing cyber threat information, method for processing cyber threat information, and medium for storing a program processing cyber threat information

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