CN110196953B - Application point burying method and device, computing equipment and system - Google Patents
Application point burying method and device, computing equipment and system Download PDFInfo
- Publication number
- CN110196953B CN110196953B CN201910465342.3A CN201910465342A CN110196953B CN 110196953 B CN110196953 B CN 110196953B CN 201910465342 A CN201910465342 A CN 201910465342A CN 110196953 B CN110196953 B CN 110196953B
- Authority
- CN
- China
- Prior art keywords
- configuration information
- buried point
- elements
- point
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 79
- 238000009877 rendering Methods 0.000 claims abstract description 37
- 238000013507 mapping Methods 0.000 claims abstract description 5
- 238000012545 processing Methods 0.000 claims description 14
- 238000009933 burial Methods 0.000 claims description 11
- 238000003780 insertion Methods 0.000 claims description 5
- 230000037431 insertion Effects 0.000 claims description 5
- 238000004891 communication Methods 0.000 description 17
- 238000010586 diagram Methods 0.000 description 13
- 238000004364 calculation method Methods 0.000 description 12
- 230000004044 response Effects 0.000 description 7
- 238000011161 development Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000004458 analytical method Methods 0.000 description 3
- 230000002093 peripheral effect Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000004590 computer program Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000007723 transport mechanism Effects 0.000 description 2
- 230000001960 triggered effect Effects 0.000 description 2
- 238000012800 visualization Methods 0.000 description 2
- 230000006399 behavior Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000007667 floating Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000004806 packaging method and process Methods 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
- 230000000007 visual effect Effects 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
-
- 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/955—Retrieval from the web using information identifiers, e.g. uniform resource locators [URL]
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)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses an application point burying method which is suitable for being executed in computing equipment and comprises the following steps: acquiring rendering data of a target page in a terminal application from a mobile device integrating the function through a server, wherein the rendering data comprises page configuration information, node configuration information and embedded point configuration information; analyzing the page configuration information and the node configuration information into a view tree structure, and rendering a target page according to the view tree structure; determining corresponding buried point elements from the rendered target page according to the buried point configuration information, and mapping the buried point configuration information to the buried point elements; and determining a target buried point element and a homogeneous element of the target buried point element from the rendered target page, and generating new buried point configuration information to be sent to the client through the server so as to update the buried point configuration information at the terminal application of the client. The invention also discloses a corresponding application embedded point device, a computing device and a system.
Description
Technical Field
The invention relates to the field of data acquisition, in particular to an application point burying method, an application point burying device, computing equipment and an application point burying system.
Background
With the increasing popularization of mobile internet technology and mobile applications, developers generally need to perform data embedding operations such as visualization embedding in advance in order to better track the behavior of users and observe click data related to pages. While the rendering of the client end view is critical to the visualization of the buried points, it directly affects the definition of the event and the accuracy of the post data collection.
However, the development modes of the current mobile applications are increasingly diversified, and the development modes of the native applications, the web applications and the hybrid applications are mostly adopted. View rendering is performed on the applications in multiple modes, and conventional technical schemes such as direct parsing of NATIVE-end XML, non-hierarchical JSON configuration and the like cannot accurately restore a view layer, so that some views cannot perform point burying work, and further later data acquisition work is affected. In a technical aspect, inaccurate restoration of the view layer may also reduce accuracy of view layer data calculation in the buried point, thereby affecting data quality. Therefore, it is desirable to provide a method that can accurately restore and render cross-platform view layers to provide good buried point computing power.
Disclosure of Invention
To this end, the present invention provides an application site burying method, apparatus, computing device and system in an attempt to solve or at least alleviate the above-identified problems.
According to one aspect of the invention, there is provided a method of applying a site, adapted to be executed in a computing device, the method comprising the steps of: the method comprises the steps that rendering data of a target page in terminal application are obtained from a server, wherein the rendering data comprise page configuration information, node configuration information and buried point configuration information; analyzing the page configuration information and the node configuration information into a view tree structure, and rendering a target page according to the view tree structure; determining corresponding buried point elements from the rendered target page according to the buried point configuration information, and mapping the buried point configuration information to the buried point elements; and determining a target buried point element and a homogeneous element of the target buried point element from the rendered target page, and generating new buried point configuration information to be sent to the client through the server so as to update the buried point configuration information in the terminal application at the client.
Optionally, in the method according to the present invention, the step of determining homogeneous elements of the target buried point element includes: calculating attribute characteristics of each element in the target page and a hierarchy value from the attribute characteristics to a root node according to the node configuration information; selecting elements with the hierarchy value more than or equal to that of the target buried point element and the same attribute characteristics as the target buried point element as candidate similar elements; respectively calculating a first father element set of the target buried point element and a second father element set of each candidate similar element, wherein the first father element set and the second father element set both comprise one or more father elements, and the father elements are not root nodes and comprise at least two child elements; respectively calculating intersection elements of the second parent element sets and the first parent element sets, and selecting the intersection elements with the maximum hierarchical values as common parent elements; and selecting elements of which the parent elements comprise the common parent element from the candidate similar elements as the similar elements of the target buried point element.
Optionally, in the method according to the present invention, further comprising the step of: responding to a data pickup instruction of a user, and acquiring an element value, an element path and buried point data of a current element; and responding to a browsing mode instruction or a buried point mode instruction of a user, and switching between a normal page browsing mode and a page buried point mode.
Optionally, in the method according to the present invention, further comprising the step of: and responding to a stage mode instruction of a user, acquiring a current element or a current position where a pointer focus of the user is positioned, lighting the current element or the current position, and simultaneously lighting the similar element of the current element.
Optionally, in the method according to the present invention, the server includes an application server and a buried point server, and the step of obtaining rendering data of the target page in the terminal application from the server includes: the method comprises the steps of obtaining page configuration information and node configuration information of a target page from an application server, and obtaining buried point configuration information of the target page from a buried point server.
Optionally, in the method according to the present invention, the page configuration information includes at least one or more of a page unique identifier, a page screenshot, a window width, a window height, a window scaling, a native component address, a mixed element address, a client platform, a client version, and an application version.
Optionally, in the method according to the present invention, the node configuration information includes node tree data, and the node tree data includes one or more of an element type, an element path, an element position, an element path index, whether it is a leaf node, a buried point insertion point, whether a native element is a buried point, and element position information.
Optionally, in a method according to the invention, the element position information comprises one or more of element width and height, border distance relative to the window, coordinates relative to the parent element, element hierarchical position, and child node.
Optionally, in the method according to the present invention, the buried point configuration information includes a buried point trigger event, an identifier and a type of a buried point element, and corresponding buried point data; the new buried point configuration information comprises buried point triggering events, identification and types of target buried point elements, identification and types of similar elements of the target buried point elements and required buried point data.
Optionally, in the method according to the present invention, the terminal application is at least one of a native application, a hybrid application, and an HTML5 application, and the view tree structure is a DOM element view tree structure.
According to yet another aspect of the present invention, there is provided a method of using a buried point, comprising: the method comprises the steps that an application server obtains basic information of a target page in terminal application and generates corresponding page configuration information and node configuration information; the method comprises the steps that a buried point server obtains buried point configuration information of a target page in a terminal application, wherein the buried point configuration information comprises buried point trigger events, identifications and types of buried point elements and corresponding buried point data; the method comprises the steps that the computing equipment obtains page configuration information and node configuration information from an application server, analyzes the page configuration information and the node configuration information into a view tree structure, and renders a target page according to the view tree structure; the computing equipment acquires the buried point configuration information from the buried point server, determines a corresponding buried point element from the rendered target page according to the buried point configuration information, and maps the buried point configuration information to the buried point element; the computing equipment determines a target buried point element and the same kind element of the target buried point element from the rendered target page, generates new buried point configuration information and sends the new buried point configuration information to the client through the server; and the client analyzes the new buried point configuration information and updates the buried point configuration information in the terminal application.
According to yet another aspect of the present invention there is provided a method of operating a computing device, the method comprising: the data acquisition module is suitable for acquiring rendering data of a target page in the terminal application from the server, wherein the rendering data comprises page configuration information, node configuration information and embedded point configuration information; the page rendering module is suitable for analyzing the page configuration information and the node configuration information into a view tree structure and rendering a target page according to the view tree structure; the embedded point matching module is suitable for determining corresponding embedded point elements from the rendered target page according to the embedded point configuration information and mapping the embedded point configuration information to the embedded point elements; and the buried point updating module is suitable for determining a target buried point element and the same kind of element of the target buried point element from the rendered target page, generating new buried point configuration information and sending the new buried point configuration information to the client through the server so as to update the buried point configuration information in the terminal application at the client.
Optionally, in the apparatus according to the invention, the buried point updating module is adapted to: calculating attribute characteristics of each element in the target page and a hierarchy value from the attribute characteristics to the root node according to the node configuration information; selecting elements with the hierarchy value more than or equal to that of the target buried point element and the same attribute characteristics as the target buried point element as candidate similar elements; respectively calculating a first father element set of the target buried point element and a second father element set of each candidate similar element, wherein the first father element set and the second father element set comprise one or more father elements, and the father elements are not root nodes and comprise at least two child elements; respectively calculating intersection elements of the second parent element sets and the first parent element sets, and selecting the intersection elements with the maximum hierarchical values as common parent elements; and selecting elements of which the parent elements comprise the common parent element from the candidate similar elements as the similar elements of the target buried point element.
Optionally, in the apparatus according to the present invention, further comprising an instruction processing module adapted to: responding to a data pickup instruction of a user, and acquiring an element value, an element path and buried point data of a current element; and responding to a browsing mode instruction or a buried point mode instruction of a user, and switching between a normal page browsing mode and a page buried point mode.
Optionally, in the apparatus according to the present invention, the instruction processing module is further adapted to: in response to a stage mode instruction of a user, monitoring a current element or a current position where a pointer focus of the user is located, lighting the current element or the current position, and simultaneously lighting a similar element of the current element.
According to yet another aspect of the invention, there is provided a computing device comprising: at least one processor; and at least one memory including computer program instructions; the at least one memory and the computer program instructions are configured to, with the at least one processor, cause the computing device to perform an application burial method as described above.
According to yet another aspect of the present invention, there is provided a readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computing device, cause the computing device to perform an application burial point method as described above.
According to yet another aspect of the present invention, there is provided a system for using a buried point, comprising: the system comprises an application server, a buried point server, at least one client and the computing equipment, wherein the application server is suitable for acquiring basic information of a target page in terminal application and generating corresponding page configuration information and node configuration information; the embedded point server is suitable for acquiring embedded point configuration information of a target page in terminal application, wherein the embedded point configuration information comprises embedded point trigger events, and identification and types of embedded point elements and corresponding embedded point data; the client is suitable for receiving the new buried point configuration information sent by the computing device through the server and analyzing the new buried point configuration information so as to update the buried point configuration information in the terminal application of the client.
According to the technical scheme of the invention, the rendering engine can receive the page configuration information, the node configuration information and the buried point configuration information from different platforms, and analyze the page and node configuration information of different platforms into tree-structured data for preliminary rendering. And then, the data attribute of the node can be reserved, and the embedded point elements are calculated and matched according to the embedded point configuration information so as to carry out final mounting and rendering. And finally, determining the target buried point element and the similar element of the target buried point element to generate new buried point configuration information, and updating the buried point configuration information by the client according to the new buried point configuration information.
The cross-platform view tree data structure is analyzed and rendered, so that the view layer can be accurately restored and good buried point computing capability is provided. And the determination of the similar elements can greatly simplify the work of visual embedded points, the embedded point data of all the elements in the set can be collected and analyzed only by any element in the set of the similar elements of the embedded points, and the calculation resources and the data processing workload are saved.
Drawings
To the accomplishment of the foregoing and related ends, certain illustrative aspects are described herein in connection with the following description and the annexed drawings, which are indicative of various ways in which the principles disclosed herein may be practiced, and all aspects and equivalents thereof are intended to be within the scope of the claimed subject matter. The above and other objects, features and advantages of the present disclosure will become more apparent from the following detailed description read in conjunction with the accompanying drawings. Throughout this disclosure, like reference numerals generally refer to like parts or elements.
FIG. 1 illustrates a schematic diagram of an application site system 100 according to an embodiment of the present invention;
FIG. 2 illustrates a schematic structural diagram of a computing device 200, according to one embodiment of the invention;
FIG. 3 illustrates a flow diagram of an application burial method 300 performed in the computing device 200, in accordance with another embodiment of the present invention;
FIG. 4 illustrates a parsed view tree structure diagram according to one embodiment of the invention;
FIG. 5 illustrates a schematic view of a view rendering and burial point operation interface, in accordance with one embodiment of the present invention;
FIG. 6 illustrates a flow diagram of a homogeneous element identification method of a target element according to one embodiment of the present invention;
FIG. 7 shows a schematic diagram of a node tree according to one embodiment of the invention;
FIG. 8 illustrates a flow diagram of an application placement method 800 performed in the system 100, in accordance with another embodiment of the present invention; and
fig. 9 shows a block diagram of an application-site apparatus 900 according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
Fig. 1 shows a schematic diagram of an application site system 100 according to an embodiment of the invention. As shown in fig. 1, the application site-embedded system 100 includes an application server 110, a site-embedded server 120, a computing device 130, and at least one client 140 (e.g., clients 1-n), where both the application server 110 and the site-embedded server 120 are communicatively connected to the computing device 130, and to the plurality of clients 140. It should be noted that the application site system 100 of fig. 1 is merely exemplary, and in particular implementations, there may be different numbers of application servers 120, site servers 130, and computing devices 130 in the system 100, and the invention is not limited to the number of devices included in the system 100.
The application server 110 and the buried point server 120 may be one server, or may be a server cluster composed of a plurality of servers, or one cloud computing service center, and a plurality of servers for constituting the server cluster or the cloud computing service center may reside in a plurality of geographic locations.
Specifically, the application server 110 may collect application page information from different platforms and modes, and generate corresponding page configuration information and node configuration information. This information may be sent to the computing device 130 so that the computing device 130 renders the target page for the shading operation based on the information. The application server 110 may also receive the buried point configuration information generated in the computing device 130 and send the buried point configuration information to the client 140, so that the terminal application in the client 140 performs the buried point operation according to the buried point configuration information.
The buried point server 120 may obtain the buried point configuration information of each page in the terminal application, specifically, it may receive the buried point configuration information generated in the computing device 130, and may also receive the buried point data uploaded by the terminal application of the client 140. Typically, the buried point server 120 is a server of a third party tool, which provides a buried point service and a data statistical analysis service for application parties.
The client 140 may receive the new buried point configuration information sent by the computing device 130 via the application server 110 and parse the new buried point configuration information to update the buried point configuration information at its end application. Specifically, in the initial state, the client 140 may obtain the application information and the initial burial point information from the application server 110 to perform the initial burial point. After the new buried point configuration information is generated, the client 140 continues to obtain the new buried point configuration information from the application server 110 for analysis, and maps the analysis content to the corresponding target buried point element, thereby updating the buried point configuration information in the terminal application. After the embedded point operation is completed, the terminal reports the embedded point event to the embedded point server 120 every time the terminal triggers the embedded point trigger event; or the buried point data can be reported in a centralized manner after being triggered for multiple times, or the buried point data can be reported after the network signal is more stable, which is not limited by the invention.
It should be understood that the collection of the partial buried point data may also be implemented by the application server 110, for example, the buried point data of a simple service is collected by the application server 110 of a third party, and the buried point data of a complex service is collected by the buried point server 120. At this time, whether the receiving end of the different element or the different buried point data is the application server 110 or the buried point server 120 may be defined in the buried point configuration information. When the buried point event is triggered, the client 140 may report the buried point data to the corresponding receiving end according to the corresponding configuration information.
According to an embodiment of the present invention, the application server 110, the fixed point server 120, and the computing device 130 in the application fixed point system 100 can be implemented by the computing device 200 as described below.
FIG. 2 shows a block diagram of a computing device 200, according to one embodiment of the invention.
In a basic configuration 202, computing device 200 typically includes system memory 206 and one or more processors 204. A memory bus 208 may be used for communication between the processor 204 and the system memory 206.
Depending on the desired configuration, the processor 104 may be any type of processing, including but not limited to: a microprocessor (μ P), a microcontroller (μ C), a Digital Signal Processor (DSP), or any combination thereof. The processor 204 may include one or more levels of cache, such as a level one cache 210 and a level two cache 212, a processor core 214, and registers 216. Example processor cores 214 may include Arithmetic Logic Units (ALUs), Floating Point Units (FPUs), digital signal processing cores (DSP cores), or any combination thereof. The example memory controller 218 may be used with the processor 204, or in some implementations the memory controller 218 may be an internal part of the processor 204.
Depending on the desired configuration, system memory 206 may be any type of memory, including but not limited to: volatile memory (such as RAM), non-volatile memory (such as ROM, flash memory, etc.), or any combination thereof. System memory 106 may include an operating system 220, one or more applications 222, and program data 224. In some implementations, the application 222 can be arranged to operate with the program data 124 on an operating system. Program data 124 includes instructions and, in computing device 200 according to the present invention, program data 224 includes instructions for performing application landed method 300 and/or 800.
Computing device 200 may also include an interface bus 240 that facilitates communication from various interface devices (e.g., output devices 242, peripheral interfaces 244, and communication devices 246) to the basic configuration 202 via the bus/interface controller 230. The example output device 242 includes a graphics processing unit 248 and an audio processing unit 250. They may be configured to facilitate communication with various external devices, such as a display or speakers, via one or more a/V ports 252. Example peripheral interfaces 244 can include a serial interface controller 254 and a parallel interface controller 256, which can be configured to facilitate communications with external devices such as input devices (e.g., keyboard, mouse, pen, voice input device, touch input device) or other peripherals (e.g., printer, scanner, etc.) via one or more I/O ports 258. An example communication device 246 may include a network controller 260, which may be arranged to facilitate communications with one or more other computing devices 262 over a network communication link via one or more communication ports 264.
A network communication link may be one example of a communication medium. Communication media may typically be embodied by computer readable instructions, data structures, program modules, and may include any information delivery media, such as carrier waves or other transport mechanisms, in a modulated data signal. A "modulated data signal" may be a signal that has one or more of its data set or its changes made in such a manner as to encode information in the signal. By way of non-limiting example, communication media may include wired media such as a wired network or private-wired network, and various wireless media such as acoustic, Radio Frequency (RF), microwave, Infrared (IR), or other wireless media. The term computer readable media as used herein may include both storage media and communication media.
Computing device 200 may be implemented as a server, such as a file server, a database server, an application server, a WEB server, etc., or as part of a small-sized portable (or mobile) electronic device, such as a cellular telephone, a Personal Digital Assistant (PDA), a wireless WEB-watch device, an application specific device, or a hybrid device that include any of the above functions. Computing device 200 may also be implemented as a personal computer including both desktop and notebook computer configurations. In some embodiments, the computing device 200 is configured to perform the application burial point method 300 and/or 800.
FIG. 3 illustrates a flow diagram of an application burial point method 300, suitable for execution in the computing device 200, in accordance with one embodiment of the present invention. As shown in fig. 3, the method begins at step S310.
In step S310, rendering data of a target page in the terminal application is obtained from the server, where the rendering data includes page configuration information, node configuration information, and buried point configuration information.
Specifically, the page configuration information and the node configuration information of the target page may be obtained from the application server, and the buried point configuration information of the target page may be obtained from the buried point server. The terminal application is at least one of a native application, a hybrid application and an HTML5 application, and the method can realize good application view rendering and embedded point operation aiming at any cross-platform application.
According to one embodiment, the page configuration information may include, for example, page unique identification, page screen shots, window width, window height, window scaling, native component address, mixed element address, client platform, client version, and application version, among others. The following is an example of a piece of page configuration information:
according to another embodiment, the node configuration information mainly includes node tree data, which may include element type, element path, element position, element path index, whether it is a leaf node, buried point insertion point, whether the native element is a buried point, element position information, and the like. Wherein the element position information may include one or more of an element width and height, a boundary distance relative to the window, coordinates relative to a parent element, an element hierarchical position, and a child node. The following is an example of a piece of node configuration information:
according to yet another embodiment, the buried point configuration information may include, for example, a buried point trigger event, a buried point element identification, a buried point element type, a buried point element location, buried point data corresponding to a buried point element, etc., a page identification of a buried point insertion point, etc. The following is an example of a piece of buried point configuration information:
it can be seen that the data types mainly include export request direct [ "burning", "burned-match", "packaging up", "page" ]. Burning is relevant data of the buried point, and may include any one or more data of a current element, a current position and a similar element according to a calculation result; burning-match is matching result data, including corresponding buried point event data; pickup is pickup data, containing element values and element paths; the page is mainly related data of the webpage application and comprises page identification information and an application key.
Subsequently, in step S320, the page configuration information and the node configuration information are parsed into a view tree structure, and a target page is rendered according to the view tree structure.
The view tree structure may be, for example, a DOM element view tree structure, and the specific structure of the view tree structure may be as shown in fig. 4; the rendered target page may refer to the interface effect diagram in fig. 5, and a developer may perform a shading configuration on the rendered target page at the interface.
Subsequently, in step S330, a corresponding buried point element is determined from the rendered target page according to the buried point configuration information, and the buried point configuration information is mapped onto the buried point element. That is, it is determined which elements in the current target page have been subjected to the embedding and the corresponding embedding configuration.
Next, in step S340, a target buried point element and a homogeneous element of the target buried point element are determined from the rendered target page, and new buried point configuration information is generated to be sent to the client via the server to update the buried point configuration information in the terminal application at the client.
According to one embodiment, the new buried point configuration information includes, but is not limited to, a buried point trigger event, an identification and type of a target buried point element, an identification and type of a homogeneous element of the target buried point element, and required buried point data, etc. The elements under a column in the same list and the elements under other columns belong to the elements in a same element set in the list range. The required data of the buried point, that is, when the buried point trigger event occurs, collects data of the element, such as access number, visitor number, dwell time, page browsing number, jump rate, page identifier, component identifier, device information, time parameter, etc., for subsequent operations, such as page statistics and conversion rate statistics.
According to another embodiment, in step S340, referring to fig. 6, the homogeneous elements of the target buried point element may be determined according to the following method:
first, in step S341, the attribute characteristics of each element in the target page and the level value from the attribute characteristics to the root node are calculated according to the node configuration information.
According to one embodiment, the attribute features and hierarchy values may be calculated from node tree data, i.e., the attribute features and hierarchy values may be calculated by traversing the node tree of the target page. The attribute characteristics may include one or more of a component type of the element, whether the component has a value, and a component height, among others. In addition, information such as component identification of each element can be acquired. The elements may generally comprise native components or HTML elements of the application, and the corresponding node tree may be a view layer control tree or an HTML node tree. The level value from the element to the root node can be determined according to the XPATH path, and the XPATH path can be represented as a cascading style sheet CSS through regular and unified processing. For example, a list header element DT in HTML whose XPATH is BODY [0]/DIV [1]/DIV [0]/DIV [6]/UL [1]/LI [1]/DL [0]/DT [0], is determined to have a hierarchy value to the root node of 8 based on the number of hierarchy elements. This XPATH can be treated uniformly as CSS selection symbols by the rule. In general, the level value of the root node is the smallest, with the element level values further from the root node being larger.
Subsequently, in step S342, an element having a level value greater than or equal to that of the target buried-point element and having the same attribute characteristics as the target buried-point element is selected as a candidate homogeneous element.
In general, node selection may be performed through a Selector API, in the above example, an element having a hierarchical value of 8 or more and having the same attribute characteristics as the target buried-point element is selected as a candidate homogeneous element. The same attribute characteristics include, but are not limited to, the same component type, the same presence or absence of a value result, and the same component height. For the component height item, the height value may have a predetermined fault tolerance value (e.g., 5px) in consideration of DPI differences of different terminals, that is, the predetermined fault tolerance value may be fluctuated based on the height of the target buried-point element. Therefore, the situation that the height of the list-type components is screened excessively to miss part of real similar elements can be effectively avoided.
Subsequently, in step S343, a first parent element set of the target buried point element and a second parent element set of each candidate homogeneous element are respectively calculated, where the first parent element set and the second parent element set each include one or more parent elements, and the parent element is not a root node and includes at least two child elements.
That is, a parent element of an element cannot be a root node and contains at least two child elements. Here, the child parent element relationship refers to a hierarchical relationship in a specific tree structure, and the parent element of an element is found up along the branch of the element. The leaf node is a node without sub-nodes in a tree, and is called a leaf for short, namely a terminal node. Thus, the parent element may not be a leaf node.
FIG. 7 illustrates a node tree in which H is the root node, node C, F, G, N is a leaf node, A has one child element, L has three child elements, and M has two child elements, according to one embodiment of the present invention. If T1Is a target element, and the candidate homogeneous element of the target element has T2、T3、T4And searching T according to the principle that the T is not the root node and comprises at least two sub-elements1Get the parent elements S and L, then T1Is (L, S). In the same way, find T2、T3、T4Parent element set of, known as T2Is (L, S), T3Is (M, S), T4Is (M, S).
Subsequently, in step S344, intersection elements of the second parent element sets and the first parent element set are respectively calculated, and a level value of each intersection element is obtained.
Next, in step S345, the intersection element with the largest hierarchical value is selected as the common parent element, and the element whose parent element includes the common parent element is selected from the candidate similar elements as the similar element of the target buried point element.
In FIG. 7, T2Second parent element set of (2) and T1The intersection elements of the first parent element set of (1) are L and S, T3And T4Second parent element set of (2) and T1The intersection elements of the first parent element set of (1) are all S. The intersection elements thus finally determined share both L and S. According to the principle of closeness, selecting the intersection element closest to the target buried point element as a common parent element, namely the intersection element with the maximum hierarchical value (farthest from the root node), and determining that L is the common parent element. Because of T3And T4Does not contain the common parent element L, so T is added3And T4Excluding from candidate homogeneous elements only T whose parent element contains the L element2As element T1The same kind of elements of (1). The method can accurately identify the same type of elements belonging to the same column, the calculation result is accurate and precise without error, and the efficiency and the accuracy of data point burying can be effectively improved.
After the same-type elements are determined, only one of the same-type elements is subjected to point burying, and if only a target point burying element is subjected to point burying, all the point burying data of all the same-type elements can be synchronously obtained, so that manpower and material resources are saved, and computing resources are reduced. Specifically, the buried point data of the target buried point element and the similar elements thereof can be collected in response to a buried point trigger event of the user on the target buried point element. Of course, the target buried point element may not be buried, but one of the similar elements may be buried, and the buried point data of the target buried point element and all the similar elements may be obtained in the same manner.
According to an embodiment of the present invention, the method 300 may further obtain the element value, the element path, and the buried point data of the current element in response to a data pick instruction of a user, that is, enter a data pick mode. And, in response to a browsing mode instruction or a buried point mode instruction of a user, switching is performed between a normal page browsing mode and a page buried point mode. Generally, in fig. 5, a page dot embedding mode is shown, and when a user clicks to open a browsing mode, a lower black dot embedding bar is retracted, and only an upper target page is displayed; when the user starts the page buried point mode again, the system can display the buried point information of the corresponding element or position below the pointer focus of the user.
In addition, the method 300 may further parse and execute a page operation in the instruction in response to the stage mode instruction of the user, the page operation including at least one of lighting a current element, lighting a current location, lighting a similar element, and turning on/off a data pick mode. Therefore, the stage operation event of the user can be processed immediately, the instruction can directly trigger the calculation of the related buried point data, provide the related calculation data of the current position, the current element and the similar element, output the element calculation data according to the calculation model and support the service buried point. Specifically, in response to a stage mode instruction of a user, a current element or a current position where a pointer focus of the user is located may be acquired, the current element or the current position may be lighted, and a similar element of the current element may be lighted at the same time. That is, the element or location where the user pointer is located may be highlighted, while the same type of element of the element may also be highlighted. Wherein the current position is determined primarily from the element path; the current element is determined primarily based on the element value and the specific attribute.
It should be noted that the rendering data and the embedding point operation are performed in units of pages, and after a current target page is subjected to page rendering and embedding point configuration, other target pages and embedding point configurations can be continuously rendered to complete the embedding point work of the whole application.
Fig. 8 illustrates a point of application method 800, suitable for execution in the point of application system 100, in accordance with another embodiment of the present invention. As shown in fig. 8, the method begins at step S810.
In step S810, the application server obtains basic information of a target page in the terminal application, and generates corresponding page configuration information and node configuration information.
Meanwhile, in step S820, the buried point server obtains the buried point configuration information of the target page in the terminal application, where the buried point configuration information includes the buried point trigger event, and the identification, type and corresponding buried point data of the buried point element.
Subsequently, in step S830, the computing device obtains the page configuration information and the node configuration information from the application server, parses them into a view tree structure, and renders a target page according to the view tree structure.
Subsequently, in step S840, the computing device obtains the buried point configuration information from the buried point server, determines a corresponding buried point element from the rendered target page according to the buried point configuration information, and maps the buried point configuration information to the buried point element.
Subsequently, in step S850, the computing device determines a target buried point element and a homogeneous element of the target buried point element from the rendered target page, generates new buried point configuration information, and transmits the new buried point configuration information to the client via the server.
Next, in step S860, the client parses the new buried point configuration information and updates the buried point configuration information in the terminal application.
FIG. 9 illustrates a block diagram of an application site apparatus 900, suitable for residing in computing device 200, according to one embodiment of the invention. As shown in fig. 9, the apparatus includes a data acquisition module 910, a page rendering module 920, a buried point matching module 930, and a buried point updating module 940.
The data obtaining module 910 obtains rendering data of a target page in a terminal application from a server, where the rendering data includes page configuration information, node configuration information, and buried point configuration information.
The page rendering module 920 parses the page configuration information and the node configuration information into a view tree structure, and renders a target page according to the view tree structure.
The buried point matching module 930 determines a corresponding buried point element from the rendered target page according to the buried point configuration information, and maps the buried point configuration information to the buried point element.
The buried point updating module 940 determines a target buried point element and a similar element of the target buried point element from the rendered target page, generates new buried point configuration information, and sends the new buried point configuration information to the client through the server, so as to update the buried point configuration information in the terminal application at the client. The buried point updating module 940 may determine similar elements of the target buried point element according to the method described in fig. 6, which is not described herein again.
According to an embodiment of the present invention, the apparatus 900 may further include an instruction processing module (not shown in the figure), and the model may obtain the element value, the element path, and the buried point data of the current element in response to a data pickup instruction of the user; and responding to a browsing mode instruction or a point burying mode instruction of a user, and switching between a normal page browsing mode and a page point burying mode. In addition, the instruction processing module can also respond to a stage mode instruction of a user, acquire a current element or a current position where a pointer focus of the user is located, light the current element or the current position, and light the similar element of the current element at the same time.
The details of the application embedding method 800 and the application embedding device 900 according to the present invention are disclosed in detail in the description based on fig. 1 to 7, and are not repeated herein.
According to the technical scheme, the cross-platform view tree data structure analysis and rendering method based on typescript is provided, the cross-platform view layers can be restored and rendered accurately, and good buried point computing capability is provided. Meanwhile, the invention also provides more excellent element calculation support and unified interface specification and design, and the interface layer (interface) appoints the instruction type, rendering data structure, calculation model and the like supported by the stage event, so that the invention is very easy to integrate and expand and reduces the development and maintenance cost. And the cross-platform similar element calculation also calculates the similar element set according to the element depth level, the dimension characteristics and the proximity principle, simultaneously supports the application of the full control type, does not depend on specific controls and scenes, has wide application range and brings great convenience to the work of service embedding points and the like. When the service is used for embedding points, the embedded point data of all the similar elements can be obtained only by embedding points of any one of the similar elements, so that the embedded point workload is greatly simplified, and the data calculation efficiency is improved.
A6, the method of any one of A1-A5, wherein the page configuration information includes at least one or more of a page unique identification, a page screenshot, a window width, a window height, a window scale, a native component address, a mixed element address, a client platform, a client version, and an application version. A7, the method as in any one of a1-a6, wherein the node configuration information includes node tree data including one or more of element type, element path, element position, element path index, whether it is a leaf node, buried point insertion point, whether native element is buried point, and element position information. A8, the method as in A7, wherein the element position information includes one or more of element width and height, boundary distance relative to the window, coordinates relative to the parent element, element hierarchical position, and child node. A9, the method as in any one of a1-A8, wherein the buried point configuration information includes buried point trigger events, identities and types of buried point elements, and corresponding buried point data; the new buried point configuration information comprises buried point triggering events, identification and types of target buried point elements, identification and types of similar elements of the target buried point elements and required buried point data. 10. The method of claim 1, wherein the end application is at least one of a native application, a hybrid application, and an HTML5 application, and the view tree structure is a DOM element view tree structure.
B13, the apparatus as in B12, wherein the buried point updating module is adapted to: calculating attribute characteristics of each element in the target page and a hierarchy value from the attribute characteristics to a root node according to the node configuration information; selecting elements with the hierarchy value more than or equal to that of the target buried point element and the same attribute characteristics as the target buried point element as candidate similar elements; respectively calculating a first father element set of the target buried point element and a second father element set of each candidate similar element, wherein the first father element set and the second father element set respectively comprise one or more father elements, and the father elements are not root nodes and comprise at least two child elements; respectively calculating intersection elements of the second parent element sets and the first parent element sets, and selecting the intersection elements with the maximum hierarchical values as common parent elements; and selecting elements of which the parent elements comprise the common parent element from the candidate similar elements as the similar elements of the target buried point element. B14, the apparatus according to B12 or B13, further comprising a command processing module adapted to: responding to a data pickup instruction of a user, and acquiring an element value, an element path and buried point data of a current element; and responding to a browsing mode instruction or a point burying mode instruction of a user, and switching between a normal page browsing mode and a page point burying mode. B15, the apparatus of B14, wherein the instruction processing module is further adapted to: and responding to a stage mode instruction of a user, acquiring a current element or a current position where a pointer focus of the user is positioned, lighting the current element or the current position, and simultaneously lighting the similar element of the current element.
The various techniques described herein may be implemented in connection with hardware or software or, alternatively, with a combination of both. Thus, the methods and apparatus of the present invention, or certain aspects or portions thereof, may take the form of program code (i.e., instructions) embodied in tangible media, such as floppy diskettes, CD-ROMs, hard drives, or any other machine-readable storage medium, wherein, when the program is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the invention.
In the case of program code execution on programmable computers, the computing device will generally include a processor, a storage medium readable by the processor (including volatile and non-volatile memory and/or storage elements), at least one input device, and at least one output device. Wherein the memory is configured to store program code; the processor is configured to execute the present invention's application burial point method according to instructions in the program code stored in the memory.
By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer-readable media includes both computer storage media and communication media. Computer storage media store information such as computer readable instructions, data structures, program modules or other data. Communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. Combinations of any of the above are also included within the scope of computer readable media.
In the description provided herein, algorithms and displays are not inherently related to any particular computer, virtual system, or other apparatus. Various general purpose systems may also be used with examples of this invention. The required structure for constructing such a system will be apparent from the description above. Moreover, the present invention is not directed to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any descriptions of specific languages are provided above to disclose the best mode of the invention.
In the description provided herein, numerous specific details are set forth. It is understood, however, that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the invention, various features of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: that the invention as claimed requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.
Those skilled in the art will appreciate that the modules or units or components of the devices in the examples disclosed herein may be arranged in a device as described in this embodiment or alternatively may be located in one or more devices different from the devices in this example. The modules in the foregoing examples may be combined into one module or may be further divided into multiple sub-modules.
Those skilled in the art will appreciate that the modules in the device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except combinations where at least some of such features and/or processes or elements are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Furthermore, those skilled in the art will appreciate that while some embodiments described herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the following claims, any of the claimed embodiments may be used in any combination.
Furthermore, some of the described embodiments are described herein as a method or combination of method elements that can be performed by a processor of a computer system or by other means of performing the described functions. A processor having the necessary instructions for carrying out the method or method elements thus forms a means for carrying out the method or method elements. Further, the elements of the apparatus embodiments described herein are examples of the following apparatus: the apparatus is used to implement the functions performed by the elements for the purpose of carrying out the invention.
As used herein, unless otherwise specified the use of the ordinal adjectives "first", "second", "third", etc., to describe a common object, merely indicate that different instances of like objects are being referred to, and are not intended to imply that the objects so described must be in a given sequence, either temporally, spatially, in ranking, or in any other manner.
While the invention has been described with respect to a limited number of embodiments, those skilled in the art, having benefit of this description, will appreciate that other embodiments can be devised which do not depart from the scope of the invention as described herein. Furthermore, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter. Accordingly, many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the appended claims. The present invention has been disclosed in an illustrative rather than a restrictive sense with respect to the scope of the invention, as defined in the appended claims.
Claims (16)
1. An application burial point method, adapted to be executed in a computing device, the method comprising the steps of:
the method comprises the steps of obtaining rendering data of a target page in terminal application from a server, wherein the rendering data comprises page configuration information, node configuration information and buried point configuration information;
analyzing the page configuration information and the node configuration information into a view tree structure, and rendering a target page according to the view tree structure;
determining corresponding buried point elements from the rendered target page according to the buried point configuration information, and mapping the buried point configuration information to the buried point elements; and
determining a target buried point element and a similar element of the target buried point element from the rendered target page, and generating new buried point configuration information so as to be sent to a client through a server to update the buried point configuration information in a terminal application at the client; wherein, the similar elements of the target buried point elements are determined according to the following steps:
acquiring attribute characteristics of each element and a hierarchical value from the attribute characteristics to a root node according to the node configuration information;
selecting elements with the hierarchy value more than or equal to that of the target buried point element and the same attribute characteristics as the target buried point element as candidate similar elements;
respectively calculating a first father element set of the target buried point element and a second father element set of each candidate same-class element, wherein the first father element set and the second father element set respectively comprise one or more father elements, and the father elements are not root nodes and comprise at least two child elements;
respectively calculating intersection elements of the second parent element sets and the first parent element sets, and acquiring the level values of the intersection elements; and
and selecting the intersection element with the maximum hierarchical value as a common parent element, and selecting the elements of which the parent elements comprise the common parent element from the candidate similar elements as the similar elements of the target buried point element.
2. The method of claim 1, further comprising the steps of:
responding to a data pickup instruction of a user, and acquiring an element value, an element path and buried point data of a current element; and
and responding to a browsing mode instruction or a point burying mode instruction of a user, and switching between a normal page browsing mode and a page point burying mode.
3. The method of claim 2, further comprising the steps of:
and responding to a stage mode instruction of a user, acquiring a current element or a current position where a pointer focus of the user is positioned, lighting the current element or the current position, and simultaneously lighting the similar element of the current element.
4. The method of any one of claims 1-3, wherein the servers include an application server and a buried point server, and the step of obtaining rendering data of a target page in the terminal application from the servers comprises:
and acquiring page configuration information and node configuration information of the target page from the application server, and acquiring buried point configuration information of the target page from the buried point server.
5. The method of any one of claims 1-3,
the page configuration information comprises at least one or more of page unique identification, page screenshot, window width, window height, window scaling, native component address, mixed element address, client platform, client version and application version.
6. The method of any one of claims 1-3,
the node configuration information includes node tree data including one or more of an element type, an element path, an element position, an element path index, whether it is a leaf node, a buried point insertion point, whether a native element is a buried point, and element position information.
7. The method of claim 6, wherein,
the element position information includes one or more of an element width and height, a boundary distance relative to the window, coordinates relative to a parent element, an element hierarchical position, and a child node.
8. The method of any one of claims 1-3,
the buried point configuration information comprises buried point triggering events, identifications and types of buried point elements and corresponding buried point data;
the new buried point configuration information comprises buried point triggering events, identification and types of target buried point elements, identification and types of similar elements of the target buried point elements and required buried point data.
9. The method of claim 1, wherein the end application is at least one of a native application, a hybrid application, and an HTML5 application, and the view tree structure is a DOM element view tree structure.
10. A method of using a buried point, comprising:
the method comprises the steps that an application server obtains basic information of a target page in terminal application and generates corresponding page configuration information and node configuration information;
the embedded point server acquires embedded point configuration information of a target page in the terminal application, wherein the embedded point configuration information comprises embedded point triggering events, and identification and types of embedded point elements and corresponding embedded point data;
the computing equipment acquires the page configuration information and the node configuration information from the application server, analyzes the page configuration information and the node configuration information into a view tree structure, and renders a target page according to the view tree structure;
the computing equipment acquires the buried point configuration information from the buried point server, determines a corresponding buried point element from the rendered target page according to the buried point configuration information, and maps the buried point configuration information to the buried point element;
the computing equipment determines a target buried point element and the same kind element of the target buried point element from the rendered target page, generates new buried point configuration information and sends the new buried point configuration information to the client through the server; wherein, the similar elements of the target buried point elements are determined according to the following steps:
acquiring attribute characteristics of each element and a hierarchical value from the attribute characteristics to a root node according to the node configuration information; selecting elements with the hierarchy value more than or equal to that of the target buried point element and the same attribute characteristics as the target buried point element as candidate similar elements; respectively calculating a first father element set of the target buried point element and a second father element set of each candidate same-class element, wherein the first father element set and the second father element set respectively comprise one or more father elements, and the father elements are not root nodes and comprise at least two child elements; respectively calculating intersection elements of the second parent element sets and the first parent element sets, and acquiring the level values of the intersection elements; selecting the intersection element with the maximum hierarchical value as a common parent element, and selecting the elements of which the parent elements comprise the common parent element from the candidate similar elements as the similar elements of the target buried point element; and
and the client analyzes the new buried point configuration information and updates the buried point configuration information at the terminal application.
11. An application site apparatus adapted to reside in a computing device, the apparatus comprising:
the data acquisition module is suitable for acquiring rendering data of a target page in the terminal application from a server, wherein the rendering data comprises page configuration information, node configuration information and embedded point configuration information;
the page rendering module is suitable for analyzing the page configuration information and the node configuration information into a view tree structure and rendering a target page according to the view tree structure;
the buried point matching module is suitable for determining corresponding buried point elements from the rendered target page according to the buried point configuration information and mapping the buried point configuration information to the buried point elements; and
the embedded point updating module is suitable for determining a target embedded point element and the same type element of the target embedded point element from the rendered target page, generating new embedded point configuration information and sending the new embedded point configuration information to the client through the server so as to update the embedded point configuration information in the terminal application at the client; is further adapted to determine the homogeneous elements of the target buried point element according to the following steps:
calculating attribute characteristics of each element in the target page and a hierarchy value from the attribute characteristics to a root node according to the node configuration information;
selecting elements with the hierarchy value more than or equal to that of the target buried point element and the same attribute characteristics as the target buried point element as candidate similar elements;
respectively calculating a first father element set of the target buried point element and a second father element set of each candidate similar element, wherein the first father element set and the second father element set respectively comprise one or more father elements, and the father elements are not root nodes and comprise at least two child elements;
respectively calculating intersection elements of the second parent element sets and the first parent element sets, and selecting the intersection elements with the maximum hierarchical values as common parent elements; and
and selecting elements of which the parent elements comprise the common parent element from the candidate similar elements as the similar elements of the target buried point element.
12. The apparatus of claim 11, further comprising an instruction processing module adapted to:
responding to a data pickup instruction of a user, and acquiring an element value, an element path and buried point data of a current element;
and responding to a browsing mode instruction or a point burying mode instruction of a user, and switching between a normal page browsing mode and a page point burying mode.
13. The apparatus of claim 12, wherein the instruction processing module is further adapted to:
and responding to a stage mode instruction of a user, acquiring a current element or a current position where a pointer focus of the user is positioned, lighting the current element or the current position, and simultaneously lighting the similar element of the current element.
14. A computing device, comprising:
one or more processors;
a memory; and
one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs comprising instructions for performing any of the methods of claims 1-9.
15. A readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computing device, cause the computing device to perform any of the methods of claims 1-9.
16. A point of application system comprising:
an application server, a buried point server, at least one client, and the computing device of claim 14,
the application server is suitable for acquiring basic information of a target page in terminal application and generating corresponding page configuration information and node configuration information;
the embedded point server is suitable for acquiring embedded point configuration information of a target page in terminal application, wherein the embedded point configuration information comprises embedded point trigger events, and identification, types and corresponding embedded point data of embedded point elements;
the client is suitable for receiving the new buried point configuration information sent by the computing equipment through the server and analyzing the new buried point configuration information so as to update the buried point configuration information in the terminal application of the client.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110428416.3A CN113127771A (en) | 2019-05-30 | 2019-05-30 | Application point burying method and device, computing equipment and system |
| CN201910465342.3A CN110196953B (en) | 2019-05-30 | 2019-05-30 | Application point burying method and device, computing equipment and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910465342.3A CN110196953B (en) | 2019-05-30 | 2019-05-30 | Application point burying method and device, computing equipment and system |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110428416.3A Division CN113127771A (en) | 2019-05-30 | 2019-05-30 | Application point burying method and device, computing equipment and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110196953A CN110196953A (en) | 2019-09-03 |
| CN110196953B true CN110196953B (en) | 2021-03-19 |
Family
ID=67753568
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110428416.3A Pending CN113127771A (en) | 2019-05-30 | 2019-05-30 | Application point burying method and device, computing equipment and system |
| CN201910465342.3A Active CN110196953B (en) | 2019-05-30 | 2019-05-30 | Application point burying method and device, computing equipment and system |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110428416.3A Pending CN113127771A (en) | 2019-05-30 | 2019-05-30 | Application point burying method and device, computing equipment and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN113127771A (en) |
Families Citing this family (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110990619B (en) * | 2019-10-12 | 2023-09-01 | 平安银行股份有限公司 | Buried data query method, buried data query device, buried data query system, buried data query device and computer storage medium |
| CN110908879B (en) * | 2019-10-16 | 2023-10-20 | 陕西合友网络科技有限公司 | Reporting method, reporting device, reporting terminal and recording medium of buried point data |
| CN110795325B (en) * | 2019-10-30 | 2022-09-23 | 贵阳山恩科技有限公司 | Visual point burying method, device, equipment and storage medium |
| CN110888635B (en) * | 2019-11-28 | 2023-07-04 | 百度在线网络技术（北京）有限公司 | Same-layer rendering method and device, electronic equipment and storage medium |
| CN112883250A (en) * | 2019-11-29 | 2021-06-01 | 阿里巴巴集团控股有限公司 | Method and device for generating embedded point identification and embedded point method |
| CN111158998A (en) * | 2019-12-27 | 2020-05-15 | 北京达佳互联信息技术有限公司 | Display method and device of buried point data |
| CN111143184B (en) * | 2019-12-27 | 2023-11-07 | 北京达佳互联信息技术有限公司 | Data processing method, device and system |
| CN111241453B (en) * | 2020-01-20 | 2023-09-08 | 平安科技（深圳）有限公司 | Page access duration acquisition method and device, medium and electronic equipment |
| CN111562939A (en) * | 2020-04-26 | 2020-08-21 | 特瓦特能源科技有限公司 | Activity publishing method and device |
| CN111695064B (en) * | 2020-04-29 | 2023-08-18 | 北京城市网邻信息技术有限公司 | Buried point loading method and device |
| CN113626028A (en) * | 2020-05-07 | 2021-11-09 | 腾讯科技（深圳）有限公司 | Page element mapping method and device |
| CN114020589A (en) * | 2020-07-15 | 2022-02-08 | 腾讯科技（深圳）有限公司 | Embedded point processing method and device, computer equipment and storage medium |
| CN112162739A (en) * | 2020-09-25 | 2021-01-01 | 北京易观智库网络科技有限公司 | Visual point burying method and system based on JS-SDK |
| CN112162740A (en) * | 2020-09-25 | 2021-01-01 | 北京易观智库网络科技有限公司 | Visual data acquisition method and system based on IOS-SDK |
| CN112286501A (en) * | 2020-10-13 | 2021-01-29 | 北京易观智库网络科技有限公司 | Method and device for embedding point in page of terminal equipment and storage medium |
| CN113515715B (en) * | 2020-10-15 | 2024-03-15 | 腾讯科技（深圳）有限公司 | Buried point event code generation method, buried point event code processing method and related equipment |
| CN112394908A (en) * | 2020-11-19 | 2021-02-23 | 平安普惠企业管理有限公司 | Method and device for automatically generating embedded point page, computer equipment and storage medium |
| CN112799946A (en) * | 2021-01-29 | 2021-05-14 | 长沙市到家悠享网络科技有限公司 | Method, equipment and storage medium for embedding points and collecting data |
| CN113268687B (en) * | 2021-05-25 | 2023-11-28 | 北京达佳互联信息技术有限公司 | Method, device and storage medium for determining element rendering position |
| CN114924815A (en) * | 2022-03-31 | 2022-08-19 | 北京达佳互联信息技术有限公司 | Page rendering method and device, electronic equipment and storage medium |
| CN115659087B (en) * | 2022-11-28 | 2023-03-17 | 阿里巴巴（中国）有限公司 | Page rendering method, equipment and storage medium |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8499065B2 (en) * | 2010-09-30 | 2013-07-30 | The Nielsen Company (Us), Llc | Methods and apparatus to distinguish between parent and child webpage accesses and/or browser tabs in focus |
| CN104572043B (en) * | 2013-10-16 | 2018-01-19 | 阿里巴巴集团控股有限公司 | A kind of control to client application carries out burying method and device a little in real time |
| CN106776247B (en) * | 2016-11-23 | 2020-07-14 | 腾云天宇科技（北京）有限公司 | Method, server and system for monitoring control in application |
| CN107562620B (en) * | 2017-08-24 | 2020-06-30 | 阿里巴巴集团控股有限公司 | Automatic buried point setting method and device |
| CN109582548B (en) * | 2017-09-28 | 2022-04-12 | 北京国双科技有限公司 | Page element circle selection method and device based on non-buried points |
| CN109582305B (en) * | 2017-09-29 | 2022-04-12 | 阿里巴巴集团控股有限公司 | Encoding method and device for mobile application page elements and electronic equipment |
| CN107818163B (en) * | 2017-11-01 | 2019-03-29 | 平安科技（深圳）有限公司 | Page display method, device, computer equipment and storage medium |
| CN107818162B (en) * | 2017-11-01 | 2019-02-01 | 平安科技（深圳）有限公司 | Bury a processing method, device, computer equipment and storage medium |
| CN108304176B (en) * | 2017-12-14 | 2021-09-07 | 广东数果科技有限公司 | Visual point burying method of cross-platform mobile terminal |
| CN108182060B (en) * | 2018-01-31 | 2020-11-27 | 北京腾云天下科技有限公司 | Hybrid application point burying method, mobile terminal and system |
| CN109684571B (en) * | 2018-12-28 | 2021-02-05 | 咪咕文化科技有限公司 | Data acquisition method and device and storage medium |
-
2019
- 2019-05-30 CN CN202110428416.3A patent/CN113127771A/en active Pending
- 2019-05-30 CN CN201910465342.3A patent/CN110196953B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN110196953A (en) | 2019-09-03 |
| CN113127771A (en) | 2021-07-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110196953B (en) | Application point burying method and device, computing equipment and system | |
| CN106776247B (en) | Method, server and system for monitoring control in application | |
| CN108182060B (en) | Hybrid application point burying method, mobile terminal and system | |
| JP2021527260A (en) | Regular expression generation based on positive pattern matching examples and negative pattern matching examples | |
| CN110944048B (en) | Service logic configuration method and device | |
| CN110187880B (en) | Method and device for identifying similar elements and computing equipment | |
| CN103699389A (en) | Linux kernel module relation extracting method based on compiling options | |
| WO2019169723A1 (en) | Test case selection method, device and equipment, and computer-readable storage medium | |
| CN110580189A (en) | method and device for generating front-end page, computer equipment and storage medium | |
| CN109683858B (en) | Data processing method and device | |
| CN103744575A (en) | Method and equipment for providing input auxiliary areas of input applications | |
| CN112015468B (en) | Interface document processing method and device, electronic equipment and storage medium | |
| CN113805871A (en) | Front-end code generation method and device and computer equipment | |
| CN110909290B (en) | Method and system for combining multiple systems into large single-page application | |
| CN110007842A (en) | Web page contents choosing method and device | |
| CN111061478B (en) | Page form modification method, device and equipment and readable storage medium | |
| KR20200009858A (en) | Method, system, and non-transitory computer readable record medium for correcting typing error of virtual keyboard | |
| JP2019101889A (en) | Test execution device and program | |
| CN116339715A (en) | Front-end page construction method and device, electronic equipment and storage medium | |
| CN105912573A (en) | Data updating method and data updating device | |
| CN102323939A (en) | Method and device for determining background information of rearranged elements in page rearranging process | |
| CN114327611A (en) | Interface description document generation method and device, computer equipment and storage medium | |
| CN107451167A (en) | The click data acquisition methods and system of position are clicked in standing | |
| CN112464132A (en) | Page generation and configuration method and device | |
| CN114371982A (en) | Simulation test method, device, equipment and readable storage medium |
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 | ||
| CB02 | Change of applicant information |
Address after: 100027 302, 3 / F, aviation service building, Dongzhimen street, Dongcheng District, Beijing Applicant after: BEIJING TENDCLOUD TIANXIA TECHNOLOGY Co.,Ltd. Address before: 100027 1003a, 10th floor, 33 Suzhou street, Haidian District, Beijing Applicant before: BEIJING TENDCLOUD TIANXIA TECHNOLOGY Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: An applied buried point method, device, computing equipment and system Effective date of registration: 20220622 Granted publication date: 20210319 Pledgee: Beijing Yizhuang International Financing Guarantee Co.,Ltd. Pledgor: BEIJING TENDCLOUD TIANXIA TECHNOLOGY CO.,LTD. Registration number: Y2022980008462 |
|
| PC01 | Cancellation of the registration of the contract for pledge of patent right | ||
| PC01 | Cancellation of the registration of the contract for pledge of patent right |
Date of cancellation: 20230721 Granted publication date: 20210319 Pledgee: Beijing Yizhuang International Financing Guarantee Co.,Ltd. Pledgor: BEIJING TENDCLOUD TIANXIA TECHNOLOGY CO.,LTD. Registration number: Y2022980008462 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: A buried point method, device, computing equipment, and system for application Effective date of registration: 20230810 Granted publication date: 20210319 Pledgee: Beijing Yizhuang International Financing Guarantee Co.,Ltd. Pledgor: BEIJING TENDCLOUD TIANXIA TECHNOLOGY CO.,LTD. Registration number: Y2023980051562 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |