CN109508282A - Bury the setting method and device, computer storage medium, electronic equipment of point identification - Google Patents
Bury the setting method and device, computer storage medium, electronic equipment of point identification Download PDFInfo
- Publication number
- CN109508282A CN109508282A CN201811116238.5A CN201811116238A CN109508282A CN 109508282 A CN109508282 A CN 109508282A CN 201811116238 A CN201811116238 A CN 201811116238A CN 109508282 A CN109508282 A CN 109508282A
- Authority
- CN
- China
- Prior art keywords
- page
- point identification
- tree structure
- setting method
- disclosure
- 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
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
- G06F11/3438—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment monitoring of user actions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
- G06F11/3466—Performance evaluation by tracing or monitoring
- G06F11/3471—Address tracing
Abstract
The disclosure belongs to technical field of data processing, is related to a kind of setting method for burying point identification and device, computer readable storage medium, electronic equipment, which includes: to obtain the page address of each page in application program；Tree structure is formed according to the page address；Digital coding is carried out to the corresponding page of node each in the tree structure and page elements, buries point identification to be formed.On the one hand the disclosure by burying point identification to the formation of each page Unified coding of application program, improves the accuracy and consistency of data, reduces the complexity of data analysis；On the other hand, the data encoding in the disclosure buries point identification suitable for various operating systems, improves the compatibility of different operating system.
Description
Technical field
This disclosure relates to which technical field of data processing, in particular to a kind of setting method for burying point identification, buries a mark
Setting device, computer readable storage medium and the electronic equipment of knowledge.
Background technique
With the development of science and technology, the intelligent terminals such as computer, smart phone progress into people's lives, lead to
Crossing using the various application programs (APP) in intelligent terminal is that people's lives bring convenience.
In order to assess APP platform, there are the demand of acquisition user browsing behavior in many websites, according to the clear of user
The parameters such as record, purchaser record of looking at optimize APP platform, further increase the activity of the user.For example, use can be collected
Some button in the page or the number of link are clicked in family, and analyze user behavior accordingly, using as further marketing or net
It stands improved foundation.The behavior buried point tracking and record user is generallyd use, and the data transmission that real-time collecting is arrived is to from the background
Database is for analysis.But the coding that buries at present on the market is all based on Page Name or url, for the same function
Button, the coding that PC, Android operation system, IOS operating system report may be entirely different；And IOS is operated
The coding that the different editions of system report same function button is also likely to be entirely different, therefore buries a difference for same
System can there are problems that poor compatibility, and when according to burying information and carrying out data analysis, data analysis can be reduced
Accuracy.
Accordingly, it is desirable to provide a kind of setting method for burying point identification and device.
It should be noted that information is only used for reinforcing the reason to the background of the disclosure disclosed in above-mentioned background technology part
Solution, therefore may include the information not constituted to the prior art known to persons of ordinary skill in the art.
Summary of the invention
Setting device, the computer for being designed to provide a kind of setting method for burying point identification, burying point identification of the disclosure
Readable storage medium storing program for executing and electronic equipment, and then the not compatibility of homologous ray, reduction data dimension are improved at least to a certain extent
The cost of shield, the accuracy for improving data analysis.
According to one aspect of the disclosure, a kind of setting method for burying point identification is provided characterized by comprising
Obtain the page address of each page in application program；
Tree structure is formed according to the page address；
Digital coding is carried out to the corresponding page of node each in the tree structure and page elements, to bury a little described in formation
Mark.
In an exemplary embodiment of the disclosure, the page address for obtaining each page in application program, comprising:
The uniform resource locator for obtaining each page in the application program, by the uniform resource locator
It is parsed to obtain the page address corresponding with each page.
It is in an exemplary embodiment of the disclosure, described that tree structure is formed according to the page address, comprising:
The hierarchical relationship of the page is obtained according to the page address；
The tree structure is formed according to the hierarchical relationship of the page.
In an exemplary embodiment of the disclosure, the hierarchical relationship according to the page forms the tree structure,
Include:
Using the homepage face of the application program as root node, subpage frames at different levels are that leaf node forms the tree structure.
In an exemplary embodiment of the disclosure, described using the homepage face of the application program as root node, subpages at different levels
Face is that leaf node forms the tree structure, comprising:
Using multiple level-one subpage frames as the first leaf node, the N grade subpage frame under the level-one subpage frame is as N grades of leaves
Node, wherein N >=2, and N are integer.
In an exemplary embodiment of the disclosure, described first to the corresponding page of node each in the tree structure and the page
Element carries out digital coding, comprising:
The corresponding digitally coded length of root node in the tree structure is 1, the corresponding digital coding of leaf node
Length be 2.
In an exemplary embodiment of the disclosure, the setting method for burying point identification further include:
When same leaf node corresponds to multiple secondary leaf nodes, the corresponding number of each secondary leaf node buries point identification tool
There is identical prefix, and mantissa is incremented by.
According to one aspect of the disclosure, a kind of setting device burying point identification is provided characterized by comprising
Module is obtained, for obtaining the page address of each page in application program；
Module is constructed, for forming tree structure according to the page address；
Coding module, for carrying out digital coding to the corresponding page of node each in the tree structure and page elements,
To bury point identification described in formation.
According to one aspect of the disclosure, a kind of computer readable storage medium is provided, computer program is stored thereon with,
The computer program realizes the setting method that point identification is buried described in above-mentioned any one when being executed by processor.
According to one aspect of the disclosure, a kind of electronic equipment is provided, comprising:
Processor；And
Memory, for storing the executable instruction of the processor；
Wherein, the processor is configured to bury described in above-mentioned any one via the execution executable instruction to execute
The setting method of point identification.
The setting method for burying point identification of the disclosure passes through the page address of each page in parsing application program, according to each page
The set membership in face forms tree structure；Then digital coding formation is carried out for each node in tree structure bury a mark
Know.The disclosure on the one hand by each page Unified coding of application program formation bury point identification, improve data accuracy and
Consistency reduces the computational complexity of data analysis；On the other hand, the data encoding in the disclosure buries point identification and is suitable for respectively
Kind operating system, improves compatibility.
It should be understood that above general description and following detailed description be only it is exemplary and explanatory, not
The disclosure can be limited.
Detailed description of the invention
The drawings herein are incorporated into the specification and forms part of this specification, and shows the implementation for meeting the disclosure
Example, and together with specification for explaining the principles of this disclosure.It should be evident that the accompanying drawings in the following description is only the disclosure
Some embodiments for those of ordinary skill in the art without creative efforts, can also basis
These attached drawings obtain other attached drawings.
Fig. 1 schematically shows a kind of flow chart of setting method for burying point identification；
Fig. 2 schematically shows a kind of Application Scenarios-Example figure of setting method for burying point identification；
Fig. 3 schematically shows a kind of structural schematic diagram of tree structure；
Fig. 4 schematically shows that a kind of tree structure is corresponding to bury point identification structural schematic diagram；
Fig. 5 schematically shows a kind of block diagram of setting device for burying point identification；
Fig. 6 schematically shows a kind of electronic equipment example block diagram for realizing the above-mentioned setting method for burying point identification；
Fig. 7 schematically shows a kind of computer readable storage medium for realizing the above-mentioned setting method for burying point identification.
Specific embodiment
Example embodiment is described more fully with reference to the drawings.However, example embodiment can be with a variety of shapes
Formula is implemented, and is not understood as limited to example set forth herein；On the contrary, thesing embodiments are provided so that the disclosure will more
Fully and completely, and by the design of example embodiment comprehensively it is communicated to those skilled in the art.Described feature, knot
Structure or characteristic can be incorporated in any suitable manner in one or more embodiments.In the following description, it provides perhaps
More details fully understand embodiment of the present disclosure to provide.It will be appreciated, however, by one skilled in the art that can
It is omitted with technical solution of the disclosure one or more in the specific detail, or others side can be used
Method, constituent element, device, step etc..In other cases, be not shown in detail or describe known solution to avoid a presumptuous guest usurps the role of the host and
So that all aspects of this disclosure thicken.
In addition, attached drawing is only the schematic illustrations of the disclosure, it is not necessarily drawn to scale.Identical attached drawing mark in figure
Note indicates same or similar part, thus will omit repetition thereof.Some block diagrams shown in the drawings are function
Energy entity, not necessarily must be corresponding with physically or logically independent entity.These function can be realized using software form
Energy entity, or these functional entitys are realized in one or more hardware modules or integrated circuit, or at heterogeneous networks and/or place
These functional entitys are realized in reason device device and/or microcontroller device.
A kind of setting method for burying point identification is provided firstly in this example embodiment, this buries the setting method of point identification
Server can be run on, server cluster or Cloud Server etc. can also be run on, certainly, those skilled in the art can also be with
Disclosed method is run in other platforms according to demand, does not do particular determination to this in the present exemplary embodiment.With reference to Fig. 1 institute
Show, which may comprise steps of:
Step S110. obtains the page address of each page in application program；
Step S120. forms tree structure according to the page address；
Step S130. carries out digital coding to the corresponding page of node each in the tree structure and page elements, with shape
At burying point identification.
In an exemplary embodiment of the disclosure, application program be loaded in terminal device for complete it is a certain or more
The computer program of item particular job；Page address is the corresponding chained address of the page each in application program；What tree structure referred to
It is that there is the data structures of the tree-like relationship of " one-to-many " between data element, is a kind of important nonlinear data structure；
Digital coding is the coding for indicating data and instruction only with number and related spcial character.In the disclosure, pass through acquisition
The corresponding uniform resource locator of the page, and uniform resource locator is parsed can obtain the page corresponding with each page
Address；Since the page address of each page mutually has connection, the address of usual secondary page includes the address of higher level's page, because
This can form a tree structure by the incidence relation between the analysis page；It is finally corresponding to node each in tree structure
The page and page elements carry out digital coding and bury point identification to be formed.
In the above-mentioned setting method for burying point identification, by obtaining each page address in application program, and according to each page
Address forms tree structure, finally carries out data encoding formation to each node in tree structure and buries point identification.On the one hand, guarantee
The consistency and stability for burying point identification structure, reduce the cost of data maintenance, improve the accuracy of data analysis；Separately
On the one hand, number buries point identification suitable for various intelligent terminals and various operating systems, improves compatibility.
In the following, Application Scenarios-Example figure as shown in connection with fig. 2, to the setting for burying point identification above-mentioned in this example embodiment
Each step in method carries out detailed explanation and explanation.
In step s 110, the page address of each page in application program is obtained.
It in an exemplary embodiment of the disclosure, can correspondingly when application program of the user in using terminal equipment 202
Access log is generated, server 201 can then obtain the access log of user from terminal device 202.The wherein terminal device
202 can be the intelligent terminals such as browser, smart phone, iPad, and the disclosure is not specifically limited in this embodiment.Meanwhile the access day
Will includes uniform resource locator corresponding to user to access pages, the type of terminal device 202 and its operation system
It unites, in acquisition application program after the uniform resource locator of each page, uniform resource locator can be parsed to obtain
The corresponding page address of each page.Also, the operating system can be the operating systems such as Android, IOS, Windows, the disclosure pair
This is not specifically limited.
In the step s 120, tree structure is formed according to the page address.
In an exemplary embodiment of the disclosure, it obtains in application program behind the page address of each page, it can be to each page
The address in face is analyzed, to obtain the hierarchical relationship between each page address；Then according to the hierarchical relationship shape between the page
At tree structure.
It in an exemplary embodiment of the disclosure, can be with the homepage of application program during forming tree structure
Root node of the face as tree structure, subpage frame corresponding to the multiple page links for including in homepage face is as tree structure
Leaf node.Further, multiple secondary page links, while the link pair of multiple secondary pages be may also contain in each subpage frame
Multiple secondary pages may be also equipped under the secondary page answered, it, can be by level-one subpage during forming tree structure
Face as first order leaf node, second level subpage frame under level-one subpage frame as second level leaf node, and so on, N grades of sons
The page is as N grades of leaf nodes, and wherein N is positive integer, until all pages are formed tree structure.Fig. 3 shows one kind
The structural schematic diagram of tree structure, as shown in figure 3, the partial page formation being shown in safety gold house keeper APP is tree-like
Structure, user click the homepage for entering APP after " logins " page, include three page links: declaration form service, prosperous wealth in the homepage
With lairage.Wherein, " common service ", " trilogy of insuring " and " Claims Resolution prefecture " three subpages are respectively equipped under " declaration form service "
Face link；" prosperous wealth " has " understanding prosperous wealth " subpage links；" lairage son " has " health circle " and " financing is enclosed " two
Subpage links, therefore the root node of the tree structure formed as " logs in " page, first order leaf node be " declaration form service ",
" prosperous wealth " and " lairage ", the second level leaf node under " declaration form service " is " common service ", " trilogy of insuring " and " Claims Resolution is special
Area ", second level leaf node under " prosperous wealth " are " understanding prosperous wealth ", the second level leaf node under " lairage " be " health circle " and
" financing circle ".
In step s 130, digital coding is carried out to the corresponding page of node each in the tree structure and page elements,
Point identification is buried to be formed.
In an exemplary embodiment of the disclosure, each page in application program is formed into tree-like knot according to hierarchical relationship
After structure, digital coding can be carried out to the nodes at different levels in tree structure.Include multiple page elements in each page, such as wraps
Various keys, the link path etc. being contained in the page belong to page elements.It, can be to institute during carrying out digital coding
Some page elements are encoded.
In an exemplary embodiment of the disclosure, when forming digital coding, the digitally coded length of root node is 1
Position, the digitally coded length of leaf nodes at different levels are 2, and the secondary subpage frame under same subpage frame is in coding, can be with
Each secondary subpage frame prefix having the same is set, and mantissa is incremented by.Fig. 4 shows to form digitally coded flow diagram,
As shown in figure 4, digital coding corresponding with root node is 1, declaration form service, prosperous wealth and lairage are corresponding in first order leaf node
Digital coding is respectively 01,02,03, and three second level leaf nodes pair of declaration form service subpage frame are subordinated in the leaf node of the second level
The digital coding answered is respectively 01,02,03, and the corresponding digital coding of second level leaf node for being subordinated to prosperous wealth subpage frame is 01,
The corresponding digital coding of second level leaf node for being subordinated to the sub- subpage frame of lairage is respectively 01,02.That is first order leaf segment
The corresponding digital coding of prosperous wealth subpage frame is 102 in point, correspondingly, the corresponding number of the healthy circle page in the leaf node of the second level
It is encoded to 10301.
In an exemplary embodiment of the disclosure, it when updating the version of application program in terminal device 202, can continue to use
What original digital coding was formed buries point identification, and to guarantee the operating system for different editions, the same point identification that buries corresponds to phase
Same function, to reduce the complexity of data analysis, improve the compatibility of different operating system.
In an exemplary embodiment of the disclosure, the page can be divided into dynamic page and static page, when the page is dynamic
The page, and when page elements change, such as when increasing, subtracting page elements, tree structure can be changed according to increasing, subtracting details,
Correspondingly change the page buries point identification, such as increases " vehicle insurance circle " subpage frame in " lairage ", then can be in tree structure
Increase a node in the leaf node of the second level, and is arranged and buries point identification as " 03 ".
The disclosure additionally provides a kind of setting device for burying point identification.Refering to what is shown in Fig. 5, this buries the setting device of point identification
It may include obtaining module 510, building module 520 and coding module 530.Wherein:
Module 510 is obtained, for obtaining the page address of each page in application program；
Module 520 is constructed, for forming tree structure according to the page address；
Coding module 530, for carrying out digital volume to the corresponding page of node each in the tree structure and page elements
Code, to bury point identification described in formation.
The detail of each module is in the corresponding setting side for burying point identification in the above-mentioned setting device for burying point identification
It is described in detail in method, therefore details are not described herein again.
It should be noted that although being referred to several modules or list for acting the equipment executed in the above detailed description
Member, but this division is not enforceable.In fact, according to embodiment of the present disclosure, it is above-described two or more
Module or the feature and function of unit can embody in a module or unit.Conversely, an above-described mould
The feature and function of block or unit can be to be embodied by multiple modules or unit with further division.
In addition, although describing each step of method in the disclosure in the accompanying drawings with particular order, this does not really want
These steps must be executed in this particular order by asking or implying, or having to carry out step shown in whole could realize
Desired result.Additional or alternative, it is convenient to omit multiple steps are merged into a step and executed by certain steps, and/
Or a step is decomposed into execution of multiple steps etc..
Through the above description of the embodiments, those skilled in the art is it can be readily appreciated that example described herein is implemented
Mode can also be realized by software realization in such a way that software is in conjunction with necessary hardware.Therefore, according to the disclosure
The technical solution of embodiment can be embodied in the form of software products, which can store non-volatile at one
Property storage medium (can be CD-ROM, USB flash disk, mobile hard disk etc.) in or network on, including some instructions are so that a calculating
Equipment (can be personal computer, server, mobile terminal or network equipment etc.) is executed according to disclosure embodiment
Method.
In an exemplary embodiment of the disclosure, a kind of electronic equipment that can be realized the above method is additionally provided.
Person of ordinary skill in the field it is understood that various aspects of the disclosure can be implemented as system, method or
Program product.Therefore, various aspects of the disclosure can be with specific implementation is as follows, it may be assumed that complete hardware embodiment, complete
The embodiment combined in terms of full Software Implementation (including firmware, microcode etc.) or hardware and software, can unite here
Referred to as circuit, " module " or " system ".
The electronic equipment 600 of this embodiment according to the disclosure is described referring to Fig. 6.The electronics that Fig. 6 is shown
Equipment 600 is only an example, should not function to the embodiment of the present disclosure and use scope bring any restrictions.
As shown in fig. 6, electronic equipment 600 is showed in the form of universal computing device.The component of electronic equipment 600 can wrap
It includes but is not limited to: at least one above-mentioned processing unit 610, at least one above-mentioned storage unit 620, the different system components of connection
The bus 630 of (including storage unit 620 and processing unit 610).
Wherein, the storage unit is stored with program code, and said program code can be held by the processing unit 610
Row, so that various according to the disclosure described in the execution of the processing unit 610 above-mentioned " illustrative methods " part of this specification
The step of illustrative embodiments.For example, the processing unit 610 can execute step S110 as shown in fig. 1: acquisition is answered
With the page address of the page each in program；Step S120: tree structure is formed according to the page address；Step S130: to institute
It states the corresponding page of each node in tree structure and page elements carries out digital coding, to bury point identification described in being formed.
Storage unit 620 may include the readable medium of volatile memory cell form, such as Random Access Storage Unit
(RAM) 6201 and/or cache memory unit 6202, it can further include read-only memory unit (ROM) 6203.
Storage unit 620 can also include program/utility with one group of (at least one) program module 6205
6204, such program module 6205 includes but is not limited to: operating system, one or more application program, other program moulds
It may include the realization of network environment in block and program data, each of these examples or certain combination.
Bus 630 can be to indicate one of a few class bus structures or a variety of, including storage unit bus or storage
Cell controller, peripheral bus, graphics acceleration port, processing unit use any bus structures in a variety of bus structures
Local bus.
Electronic equipment 600 can also be with one or more external equipments 1100 (such as keyboard, sensing equipment, bluetooth equipment
Deng) communication, can also be enabled a user to one or more equipment interact with the electronic equipment 600 communicate, and/or with make
Any equipment (such as the router, modulation /demodulation that the electronic equipment 600 can be communicated with one or more of the other calculating equipment
Device etc.) communication.This communication can be carried out by input/output (I/O) interface 650.Also, electronic equipment 600 can be with
By network adapter 660 and one or more network (such as local area network (LAN), wide area network (WAN) and/or public network,
Such as internet) communication.As shown, network adapter 660 is communicated by bus 630 with other modules of electronic equipment 600.
It should be understood that although not shown in the drawings, other hardware and/or software module can not used in conjunction with electronic equipment 600, including but not
Be limited to: microcode, device driver, redundant processing unit, external disk drive array, RAID system, tape drive and
Data backup storage system etc..
Through the above description of the embodiments, those skilled in the art is it can be readily appreciated that example described herein is implemented
Mode can also be realized by software realization in such a way that software is in conjunction with necessary hardware.Therefore, according to the disclosure
The technical solution of embodiment can be embodied in the form of software products, which can store non-volatile at one
Property storage medium (can be CD-ROM, USB flash disk, mobile hard disk etc.) in or network on, including some instructions are so that a calculating
Equipment (can be personal computer, server, terminal installation or network equipment etc.) is executed according to disclosure embodiment
Method.
In an exemplary embodiment of the disclosure, a kind of computer readable storage medium is additionally provided, energy is stored thereon with
Enough realize the program product of this specification above method.In some possible embodiments, various aspects of the disclosure may be used also
In the form of being embodied as a kind of program product comprising program code, when described program product is run on the terminal device, institute
Program code is stated for executing the terminal device described in above-mentioned " illustrative methods " part of this specification according to this public affairs
The step of opening various illustrative embodiments.
Refering to what is shown in Fig. 7, describing the program product for realizing the above method according to embodiment of the present disclosure
700, can using portable compact disc read only memory (CD-ROM) and including program code, and can in terminal device,
Such as it is run on PC.However, the program product of the disclosure is without being limited thereto, in this document, readable storage medium storing program for executing can be with
To be any include or the tangible medium of storage program, the program can be commanded execution system, device or device use or
It is in connection.
Described program product can be using any combination of one or more readable mediums.Readable medium can be readable letter
Number medium or readable storage medium storing program for executing.Readable storage medium storing program for executing for example can be but be not limited to electricity, magnetic, optical, electromagnetic, infrared ray or
System, device or the device of semiconductor, or any above combination.The more specific example of readable storage medium storing program for executing is (non exhaustive
List) include: electrical connection with one or more conducting wires, portable disc, hard disk, random access memory (RAM), read-only
Memory (ROM), erasable programmable read only memory (EPROM or flash memory), optical fiber, portable compact disc read only memory
(CD-ROM), light storage device, magnetic memory device or above-mentioned any appropriate combination.
Computer-readable signal media may include in a base band or as carrier wave a part propagate data-signal,
In carry readable program code.The data-signal of this propagation can take various forms, including but not limited to electromagnetic signal,
Optical signal or above-mentioned any appropriate combination.Readable signal medium can also be any readable Jie other than readable storage medium storing program for executing
Matter, the readable medium can send, propagate or transmit for by instruction execution system, device or device use or and its
The program of combined use.
The program code for including on readable medium can transmit with any suitable medium, including but not limited to wirelessly, have
Line, optical cable, RF etc. or above-mentioned any appropriate combination.
Can with any combination of one or more programming languages come write for execute the disclosure operation program
Code, described program design language include object oriented program language-Java, C++ etc., further include conventional
Procedural programming language-such as " C " language or similar programming language.Program code can be fully in user
It calculates and executes in equipment, partly executes on a user device, being executed as an independent software package, partially in user's calculating
Upper side point is executed on a remote computing or is executed in remote computing device or server completely.It is being related to far
Journey calculates in the situation of equipment, and remote computing device can pass through the network of any kind, including local area network (LAN) or wide area network
(WAN), it is connected to user calculating equipment, or, it may be connected to external computing device (such as utilize ISP
To be connected by internet).
In addition, above-mentioned attached drawing is only the schematic theory of the processing according to included by the method for disclosure exemplary embodiment
It is bright, rather than limit purpose.It can be readily appreciated that the time that above-mentioned processing shown in the drawings did not indicated or limited these processing is suitable
Sequence.In addition, be also easy to understand, these processing, which can be, for example either synchronously or asynchronously to be executed in multiple modules.
Those skilled in the art after considering the specification and implementing the invention disclosed here, will readily occur to its of the disclosure
His embodiment.The disclosure is intended to cover any variations, uses, or adaptations of the disclosure, these modifications, purposes or
Adaptive change follow the general principles of this disclosure and including the undocumented common knowledge in the art of the disclosure or
Conventional techniques.The description and examples are only to be considered as illustrative, and the true scope and spirit of the disclosure are by claim
It points out.
Claims (10)
1. a kind of setting method for burying point identification characterized by comprising
Obtain the page address of each page in application program；
Tree structure is formed according to the page address；
Digital coding is carried out to the corresponding page of node each in the tree structure and page elements, to bury a mark described in formation
Know.
2. the setting method according to claim 1 for burying point identification, which is characterized in that each page in the acquisition application program
The page address in face, comprising:
The uniform resource locator for obtaining each page in the application program, by being carried out to the uniform resource locator
Parsing is to obtain the page address corresponding with each page.
3. the setting method according to claim 1 for burying point identification, which is characterized in that described according to the page address shape
At tree structure, comprising:
The hierarchical relationship of each page is obtained according to the page address；
The tree structure is formed according to the hierarchical relationship of each page.
4. the setting method according to claim 3 for burying point identification, which is characterized in that the layer according to each page
Grade relationship forms the tree structure, comprising:
Using the homepage face of the application program as root node, subpage frames at different levels are that leaf node forms the tree structure.
5. the setting method according to claim 4 for burying point identification, which is characterized in that the head with the application program
The page is root node, and subpage frames at different levels are that leaf node forms the tree structure, comprising:
Using multiple level-one subpage frames as first order leaf node, the N grade subpage frame under the level-one subpage frame is as N grades of leaf segments
Point, wherein N >=2, and N are integer.
6. the setting method according to claim 1 for burying point identification, which is characterized in that described to each in the tree structure
The corresponding page of node and page elements carry out digital coding, comprising:
The corresponding digitally coded length of root node in the tree structure is 1, the corresponding digitally coded length of leaf node
Degree is 2.
7. the setting method according to claim 6 for burying point identification, which is characterized in that the setting method for burying point identification
Further include:
When same leaf node corresponds to multiple secondary leaf nodes, the corresponding number of each secondary leaf node buries point identification with phase
Same prefix, and mantissa is incremented by.
8. a kind of setting device for burying point identification characterized by comprising
Module is obtained, for obtaining the page address of each page in application program；
Module is constructed, for forming tree structure according to the page address；
Coding module, for carrying out digital coding to the corresponding page of node each in the tree structure and page elements, with shape
Point identification is buried at described.
9. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program quilt
Claim 1-7 described in any item setting methods for burying point identification are realized when processor executes.
10. a kind of electronic equipment characterized by comprising
Processor；And
Memory, for storing the executable instruction of the processor；
Wherein, the processor is configured to require 1-7 described in any item via executing the executable instruction and carry out perform claim
Bury the setting method of point identification.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811116238.5A CN109508282A (en) | 2018-09-25 | 2018-09-25 | Bury the setting method and device, computer storage medium, electronic equipment of point identification |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811116238.5A CN109508282A (en) | 2018-09-25 | 2018-09-25 | Bury the setting method and device, computer storage medium, electronic equipment of point identification |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109508282A true CN109508282A (en) | 2019-03-22 |
Family
ID=65746131
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811116238.5A Pending CN109508282A (en) | 2018-09-25 | 2018-09-25 | Bury the setting method and device, computer storage medium, electronic equipment of point identification |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109508282A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110119336A (en) * | 2019-04-04 | 2019-08-13 | 微民保险代理有限公司 | Data processing method, device, computer readable storage medium and computer equipment |
| CN110187880A (en) * | 2019-05-30 | 2019-08-30 | 北京腾云天下科技有限公司 | A kind of similar elemental recognition method, apparatus and calculate equipment |
| CN111124213A (en) * | 2019-12-11 | 2020-05-08 | 维沃移动通信有限公司 | Application function display method and electronic equipment |
| CN114721915A (en) * | 2021-01-04 | 2022-07-08 | 腾讯科技（深圳）有限公司 | Point burying method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170099064A1 (en) * | 2015-10-05 | 2017-04-06 | Fujitsu Limited | Non-transitory computer-readable recording medium, encoding method, encoding device, decoding method, and decoding device |
| CN107368294A (en) * | 2017-05-25 | 2017-11-21 | 阿里巴巴集团控股有限公司 | Using Prototype, template training method, apparatus and system |
| CN107562620A (en) * | 2017-08-24 | 2018-01-09 | 阿里巴巴集团控股有限公司 | One kind buries an automatic setting method and device |
| CN107818163A (en) * | 2017-11-01 | 2018-03-20 | 平安科技（深圳）有限公司 | Page display method, device, computer equipment and storage medium |
-
2018
- 2018-09-25 CN CN201811116238.5A patent/CN109508282A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170099064A1 (en) * | 2015-10-05 | 2017-04-06 | Fujitsu Limited | Non-transitory computer-readable recording medium, encoding method, encoding device, decoding method, and decoding device |
| CN107368294A (en) * | 2017-05-25 | 2017-11-21 | 阿里巴巴集团控股有限公司 | Using Prototype, template training method, apparatus and system |
| CN107562620A (en) * | 2017-08-24 | 2018-01-09 | 阿里巴巴集团控股有限公司 | One kind buries an automatic setting method and device |
| CN107818163A (en) * | 2017-11-01 | 2018-03-20 | 平安科技（深圳）有限公司 | Page display method, device, computer equipment and storage medium |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110119336A (en) * | 2019-04-04 | 2019-08-13 | 微民保险代理有限公司 | Data processing method, device, computer readable storage medium and computer equipment |
| CN110187880A (en) * | 2019-05-30 | 2019-08-30 | 北京腾云天下科技有限公司 | A kind of similar elemental recognition method, apparatus and calculate equipment |
| CN110187880B (en) * | 2019-05-30 | 2022-12-16 | 北京腾云天下科技有限公司 | Method and device for identifying similar elements and computing equipment |
| CN111124213A (en) * | 2019-12-11 | 2020-05-08 | 维沃移动通信有限公司 | Application function display method and electronic equipment |
| CN111124213B (en) * | 2019-12-11 | 2021-06-08 | 维沃移动通信有限公司 | Application function display method and electronic equipment |
| CN114721915A (en) * | 2021-01-04 | 2022-07-08 | 腾讯科技（深圳）有限公司 | Point burying method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10942708B2 (en) | Generating web API specification from online documentation | |
| CN112084383B (en) | Knowledge graph-based information recommendation method, device, equipment and storage medium | |
| US9910913B2 (en) | Ingestion planning for complex tables | |
| CN109508282A (en) | Bury the setting method and device, computer storage medium, electronic equipment of point identification | |
| CN111695674B (en) | Federal learning method, federal learning device, federal learning computer device, and federal learning computer readable storage medium | |
| CN109242164B (en) | Method and device for optimizing product path, computer storage medium and electronic equipment | |
| US11888855B2 (en) | Website verification platform | |
| CN107608801A (en) | The primary page and HTML5 page communication methods, device, medium and equipment | |
| CN104598218A (en) | Method and system for consolidating and reusing portal information | |
| CN109857575A (en) | Interface call method, device, electronic equipment and storage medium | |
| CN111242462B (en) | Data processing method and device, computer storage medium and electronic equipment | |
| US10884713B2 (en) | Transformations of a user-interface modality of an application | |
| CN115019237A (en) | Multi-modal emotion analysis method and device, electronic equipment and storage medium | |
| CN115438232A (en) | Knowledge graph construction method and device, electronic equipment and storage medium | |
| CN109284450A (en) | Order is at the determination method and device of single path, storage medium, electronic equipment | |
| US20200302350A1 (en) | Natural language processing based business domain modeling | |
| CN110348581B (en) | User feature optimizing method, device, medium and electronic equipment in user feature group | |
| US20230161948A1 (en) | Iteratively updating a document structure to resolve disconnected text in element blocks | |
| CN115238009A (en) | Metadata management method, device and equipment based on blood vessel margin analysis and storage medium | |
| CN108768742A (en) | Network establishing method and device, electronic equipment, storage medium | |
| CN114297475A (en) | Object recommendation method and device, electronic equipment and storage medium | |
| CN116685989A (en) | Learning unpaired multimodal feature matching for semi-supervised learning | |
| US20220365762A1 (en) | Neural network model conversion method server, and storage medium | |
| US20190057087A1 (en) | Onboarding services | |
| CN109634661A (en) | Server bottom data variation, device, computer equipment and 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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190322 |
|
| RJ01 | Rejection of invention patent application after publication |