CN108008941A - The deep chain interface automatic generation method and deep chain of a kind of Android application perform method - Google Patents
The deep chain interface automatic generation method and deep chain of a kind of Android application perform method Download PDFInfo
- Publication number
- CN108008941A CN108008941A CN201711134577.1A CN201711134577A CN108008941A CN 108008941 A CN108008941 A CN 108008941A CN 201711134577 A CN201711134577 A CN 201711134577A CN 108008941 A CN108008941 A CN 108008941A
- Authority
- CN
- China
- Prior art keywords
- activity
- fragment
- target
- deep
- chain
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/958—Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Stored Programmes (AREA)
Abstract
The invention discloses a kind of deep chain interface automatic generation method of Android application and deep chain to perform method.The present invention deep chain interface creation method be：For each setting Activity in the code of target Android application program, the Intent sequences up to the Activity are got；The sequence of operation of its inner setting Fragment is reached for each selected target Activity, the entrance generated from the selected Activity in the code of the target Android application program；The deep chain template of each setting position in the target Android application program is formed according to the Intent sequences and the sequence of operation, that is, obtains the corresponding deep chain interface in each setting position.The present invention can be automatically the deep chain of Android application generation, save the workload of developer, the deep chain quantity of existing Android application can be greatly improved, promote the application of deep chain.
Description
Technical field
The method of deep chain interface and deep chain execution method are automatically generated for Android application the present invention relates to a kind of, belongs to software
Technical field.
Background technology
Android application is to be developed with Java language, operate in application software in Android operation system.One Android should
With being usually made of multiple Activity, each Activity provides the page that a user interacts with application, Yong Hu
The each function of being applied in Activity using the Android, is such as made a phone call, seen a film, read news, look into map.One
Activity can include multiple Fragment, and each Fragment shows a part of user interface.If should by an Android
With being compared to a Web site, then the example page of an Activity can analogize to a Web page, and
Fragment then can be using classification as the Frame in Web page.
Android is differed from using one with Web site：In Web site, each Web page has one entirely
The unique URL of office, its corresponding Web page can be directly opened by URL in a browser.In contrast, in Android application
Each Activity example pages there was only a home address, to enter a page in Android application, user must be first
The application is first opened, then can reach target pages by a series of page jumps.It is false by taking " masses' comment " application as an example
If the page in a user browsed dining room wherein, when the user desires access to the dining room page next time, he must beat
Popular comment is opened, browsed dining room before search, then can just eventually enter into the dining room page.A series of root of this troublesome operation
This reason is that the internal pages of Android application lack the globally unique address as webpage URL, and lacks and pass through this
Directly open the mechanism of corresponding page in address.
Deep chain (Deep Link) provides a kind of directly accessed from application outside based on URI (Uniform Resource Identifier) should
With the mechanism of an internal specific webpage.The domestic and international Internet firm such as Google, Facebook, Microsoft, Baidu is all energetically
Promote deep chain, it is desirable to which application developer can provide more deep chains in the application, with the needs for meeting search with sharing.So
And deep chain is not supported extensively in Android application at present.By analyzing 20,000 hot topics from pea pods using shop
Android application, it is found that wherein 73% application is not provided with any deep chain, 18% application only provides a kind of deep chain (i.e. only
A kind of page in application can be jumped to).
The reason for deep chain is not supported extensively is for the substantial amounts of manual work of Android application and development depth chain needs.In original
In reason, deep chain can be realized by the inter-application communication mechanism Intent of Android.It is two classes that Intent, which is divided to,：(1) show
Intent, provides the name of target Activity, and when Intent is performed, target Activity has been adjusted opening；(2) it is implicit
Intent, provides some screening conditions, including action, category, data etc., when Intent is performed, meets screening
The Activity of condition has been adjusted opening.When constructing Intent, parameter and other information for needing to transmit can be placed on
In the extra domains of Intent.When Activity P send an Intent I, Android system, which will be found, to be handled
The target Activity Q of this Intent, then load Q, and the switching from P to Q is realized with this.Deep chain is generally using implicit
Intent realizes that developer needs to support the Activity of deep chain to reconstruct its code and realize that processing is corresponding implicit each
The logic of Intent, this work often takes and easily error.Therefore it provides a kind of automation Core Generator of depth chain has
Important meaning and current demand.
The content of the invention
For technical problem existing in the prior art, it is an object of the invention to provide a kind of deep link of Android application
Mouth automatic generation method and deep chain perform method.
The method that the present invention is combined using static program analysis with dynamic routine analysis, in the participation of developer's minimum level
Under, it is automatically the deep chain interface of Android application generation.Idiographic flow is：Code (installation kit APK or the source of given Android application program
Code), acquired first by static analysis up to each Activity's (proper noun, is the class inside Android)
How Intent sequences, record from the entrance Activity of application reach the most short of each Activity by sending Intent
Path；And then for each selected target Activity, how obtained by dynamic analysis from specific Activity's
Entrance reaches the sequence of operation of specific Fragment inside Activity.Intent sequences and the sequence of operation form in application one
The deep chain template (i.e. the deep chain interface of correspondence position) of setting position, for example, for Activity m and Fragment therein
F, reaches the deep chain template of the Intent Sequence compositions m of m, and reaches the operation of the Intent sequences of m and the entrance arrival f from m
The deep chain template of Sequence composition f.After developer, which specifies, needs to generate the Activity and its inside Fragment of deep chain, its
Corresponding depth chain template (can find corresponding deep chain template according to the name of Activity and Fragment) and deep chain perform
Engine can automatically generate deep chain, and be packaged with former application code becoming a new Android application program installation kit.When
When one deep chain is requested, deep chain enforcement engine can be activated, the URI in being asked by deep chain come the parameter to corresponding template into
Row instantiation, the Intent that then enforcement engine can perform in masterplate successively jumps to target Activity, finally by execution
Sequence of operation control Activity in masterplate jumps to specified Fragment, so as to open target pages.
The technical scheme is that：
A kind of deep chain interface automatic generation method of Android application, its step include：
1) for each setting Activity in the code of target Android application program, get up to the Activity's
Intent sequences；
2) for each selected target Activity in the code of the target Android application program, generate selected from this
The entrance of Activity reaches the sequence of operation of its inner setting Fragment；
3) each setting position in the target Android application program is formed according to the Intent sequences and the sequence of operation
Deep chain template, that is, obtain the corresponding deep chain interface in each setting position.
Further, the method got up to the Intent sequences of the Activity is：Constructing the target Android first should
With the Activity navigation relation figures of program；Then according to the Activity navigation relation figures, obtain from using entrance
Activity reaches the path of the Activity, then chooses the Intent sequences corresponding to shortest path, enters as from application
Mouth Activity reaches the Intent sequences of the Activity.
Further, the method for generating the sequence of operation is：For every Fragment in the target Activity
The mark of generation one；Generate the Fragment switching figures FTG of the target Activity<P,D,p>；Wherein, P represents a vertex
Gather, the mark of every Fragment corresponds to a vertex in Activity；D is the set of directed edge, and each side is one three
Tuple e<s,t,i>, behalf source Fragment, t are target Fragment, and i represents the mark id for the control for triggering switching；P is
Starting point, i.e., homepage when Activity is just opened；Then switched according to the Fragment of the target Activity and schemed, will
Side from starting point to target Fragment is together in series, and obtains the sequence of operation of the Fragment of the target Activity.
Further, it is that the method that every Fragment generations one in the target Activity identify is：Obtain peace
Tall and erect system is the control tree that the target Android application program operationally constructs；The cryptographic Hash of the control tree is calculated, then using should
Cryptographic Hash identifies current Fragment.
Further, the method for calculating the cryptographic Hash of the control tree is：For a node q in the control tree, such as
Fruit node q does not have child node in control tree, then result corresponds to the tag characters string Hash of control for node q；If node q has
The Hash of child node, then all child nodes of recursive calculation egress q；Then according to the cryptographic Hash of the child node of node q to node q
Child node sort to ensure the uniformity of hash data structure, then the label of the cryptographic Hash of each child node and control is added up into shape
The character string new into one, most Hash of the cryptographic Hash of the new character string as node q at last.
Further, the method for obtaining the Fragment switchings figure is：First click on each control of current Fragment
Part checks whether Activity changes, if Activity changes, calling system function doback () directly returns previous
A state, continues to travel through after returning；If Activity changes, the state of current Fragment is checked, if currently
The mark of Fragment and difference before, and current Fragment is a new Fragment, then it adds Fragment
Switch in figure, and the information of writing edge is the control to switch；Continue to travel through if Fragment switchings do not occur；
After traversal search is completed, the Fragment switchings figure and the list of all Fragment are obtained.
A kind of deep chain based on above-mentioned deep chain interface performs method, it is characterised in that acting on behalf of Activity please according to deep chain
Ask and search corresponding deep chain template and to the example, construction one can jump to the foot of the corresponding target location of depth chain request
This；Then according to script, playback engine control Android is applied to be switched between Activity, and is operated on control, is reached
To target location；The required assignment of parameter in the deep deep chain template of chain correspondence is included in the depth chain request.
The method flow of the present invention is as shown in Figure 1, its specific steps includes：
1. being directed to target Android application program, the Intent sequences up to all Activity are generated to.
1) construct target Android application program Activity navigation relation figures, describe Activity between redirect pass
System.One Activity navigation relation figures G is a digraph, with a four-tuple G<V,E,r,L>Represent, wherein V is vertex
Collection, represents all Activity in an application；E is directed edge collection, each directed edge e (v1,v2) represent two
Activity v1To v2Redirect；R represents the entrance Activity of application, it is assumed that any top in V can be reached from starting point r
Point；L is the tag set of directed edge, and the mark of each directed edge is all parameters of Intent sequences.Activity
There may be multiple summits between two points in navigation relation figure, show that redirecting between two Activity may more than one road
Footpath.
2) shortcut is analyzed.After Activity navigation relation figures are established, it can analyze and be reached from application entrance Activity
The path of each Activity.The path P of one arrival Activity is one orderly since entrance Activity
Activity redirects sequence, { t1,t2,…,tk, the length of k delegated paths.In one path, t1Represent and open entrance
The Intent of Activity, path P may insure that all inside has all been initialised before relying on arrival Activity.
Reaching the path of an Activity may have a plurality of, in order to reach target Activity in a manner of most fast, should choose most short
Intent sequences corresponding to path.
2. the Activity specified for developer, is generated to up to the wherein sequence of operation of Fragment.
1) the Activity generations wherein mark of Fragment to specify.Have that distinguished name is different from Activity,
Fragment is not identified clearly.In order to ensure being switched to the Fragment specified after the activation, provided using Android
Control tree determines some Fragment.In Android system, all controls are organized into one tree, i.e. control tree.Transporting
Control tree is obtained during row, and (whenever the different Fragment of system operation, corresponding different control tree, i.e. control tree are changes
), the cryptographic Hash of this control tree is calculated by recursive algorithm, then identifies each Fragment with the cryptographic Hash.
The idiographic flow of recursive algorithm is：For a control q in control tree, if q does not have child node, result in control tree
Only q corresponds to label (tag) character string Hash of control.If q has child node, which goes out all sub- sections of q
The Hash of point.Then, the uniformity for being sorted to ensure hash data structure to the child node of q according to the cryptographic Hash of child node is (because of one
The order that the child node of a control not maintains like every time), then the tag of the cryptographic Hash of each child node and control is spelled
Connect, form a new character string, most Hash of the cryptographic Hash of the character string as q at last.When by the root section of a control tree
Input of the corresponding control of point as the algorithm, can obtain the hash data structure of the control tree, and cryptographic Hash can be used as
The mark of Fragment.
2) the Activity generation Fragment switching figures selected to developer.In order to obtain all of Activity
Fragment and the operation stream for reaching each Fragment, define Fragment switchings figure to represent Fragment at one
Switching in Activity, by triple FTG<P,D,p>Represent.P represents Fragment all in an Activity, group
Into all vertex of figure, by cryptographic Hash come uniquely tagged.D is the set of all directed edges in figure, and each side is one three
Tuple e<s,t,i>, s and t represent source and target Fragment, i and represent the mark id for the control view for triggering switching respectively.P is
Starting point, i.e., homepage when Activity is just opened.In order to obtain Fragment switching figures, instrument uses depth-first search
Mode travel through whole Activity.First, attempt to click on each control view of current Fragment to check Activity
Whether change, if Activity changes, calling system function doback () directly returns to preceding state, and what is returned is follow-up
Continuous traversal.Otherwise, the state of Fragment is checked.If the mark of current Fragment and difference before, show
Fragment is switched.Therefore, it is added into if it is a new Fragment in figure, and the letter of writing edge
Cease the control view to switch；Continue to travel through if Fragment switchings do not occur.The process of dynamic analysis is in fact
Similar to the Web reptiles for traveling through each webpage, only Android is provided solely for doback () function come before returning to
Activity, rather than back to Fragment.So need to track it by restarting application after Fragment switchings
Preceding Fragment.After a search has been completed, the list of Fragment switchings figure and all Fragment can be obtained.In order to obtain
Get the sequence of operation up to some Fragment, it is only necessary to will be together in series i.e. from starting point to the side of target Fragment
Can.
3. deep chain is added in Android application program.
After the most short-range missile bit path and the sequence of operation of Fragment for calculating Activity, you can generation is supported deep
The target Android application program installation file of chain.Since developer may only want to support deep chain in the portion of application.Cause
This, instrument allows developer only to add deep chain at the Activity or Fragment of needs.
After developer selects the Activity set of deep chain to be supported, the present invention can be the Activity lifes each chosen
The URI abstract into one.URI can follow " scheme:The form of //host/path " is so as to identified in Android system.For
Specific position is determined, by " http://host/targetForms of the parameter#fragment " as abstract URI,
Wherein using the backward string with application bag name as host domains, by the use of the class name of Activity as target domains, "" after be parameter
Part.Deep chain for being linked to Fragment, the name of target Fragment is behind " # ".
Attached drawing 2 describes structure and the generation of target apk.The present invention realizes the most light maintenance to original application using broker architecture
Change.Activity is acted on behalf of to handle all requests.Act on behalf of the Intent filter that Activity is configured as deferring to URI.When one
A Intent is passed to when acting on behalf of Activity, if Intent matches with one of URI forms, acting on behalf of Activity will
Manipulation playback engine repeats set operation to perform deep chain., will if cannot match with one URI form of any of which
Original source code processing can directly be given.
4. redirecting for deep chain is operationally performed by the operation before repetition
When deep chain is requested, the required assignment of parameter in deep chain corresponding templates can be included in solicited message, and then
Deep chain masterplate can be instantiated, so as to construct a script that can jump to specific location.According to script, playback engine with
Application software code communication originally, control application software switches between Activity, and is operated on control.Such as,
As deep chain http://anki.ichi2.com/NoteEditorWhen CALLER=3#tags is requested, it shows that user wishes
Reach the tags Fragment of the NoteEditor Activity in Anki applications.So ginseng in playback engine template first
Number CALLER is assigned a value of 3, then sends corresponding Intent sequences and reaches NoteEditor Activity, can then arrive
Simulate and click on up to the correspondence control of tags Fragment, end user can reach target location.
Compared with prior art, the positive effect of the present invention is：
This programme can be automatically the deep chain of Android application generation by tool of invention, save the workload of developer, can
The deep chain quantity of existing Android application is greatly improved, promote the application of deep chain.
Brief description of the drawings
Fig. 1 is flow chart of the method for the present invention.
Fig. 2 is the target APK structures for supporting deep chain.
Embodiment
The present invention is explained in further detail below in conjunction with the accompanying drawings.
Developer can select the source code of analyzed application.Then the static analysis of instrument can find out all Activity with
And relevant Activity most short-range missile bit paths.When an Activity is selected, the most short navigation route information meetings of Activity
Presented in interface.If to be the deep chain of Fragment generations in Activity, instrument allows developer to start simulator,
Then operated in simulator, be switched to the entry position of an Activity.Next, if developer selects to start
Dynamic analysis, implementing result can then be shown.Developer can check whether all Fragment are correct, and work can also be used
The control information that tool provides adds a Fragment manually.After the deep chain of Activity is generated, developer can
Output is used as using selection generation file destination.
Following code illustrates two deep chain masterplates of the instrument for Anki application additions.Code therein is
The deep chain masterplate of CardTemplateEditor and NoteEditor Activity.Before CardTemplateEditor is reached,
Two parameters of CALLER and modeId must be first passed to, thus jump to CardTemplateEditor deep chain must to this two
A parameter carries out assignment.Then Aladdin can find suitable Intent to be switched to target Activity.NoteEditor has
Fragment " tags ", the action to specific Fragment need the view that click source id is CardEditorTagButton.
Therefore, it is required for having to reach the value (#tags) of the value of target Fragment, Intents (CALLER=3) and fragment
Body assignment.
(1) CardTemplateEditor depths chain：
Call example：http://anki.ichi2.com/CardTemplateEditorCALLER=3＆modelId=
1472031370433
(2) NoteEditor depths chain：
Call example：http://anki.ichi2.com/NoteEditorCALLER=3#tags.
Implement to be merely illustrative of the technical solution of the present invention rather than be limited above, the ordinary skill people of this area
Member can be to technical scheme technical scheme is modified or replaced equivalently, without departing from the spirit and scope of the present invention, this hair
Bright protection domain should be subject to described in claims.
Claims (7)
1. a kind of deep chain interface automatic generation method of Android application, its step include：
1) for each setting Activity in the code of target Android application program, the Intent up to the Activity is got
Sequence；
2) for each selected target Activity in the code of the target Android application program, generate selected from this
The entrance of Activity reaches the sequence of operation of its inner setting Fragment；
3) depth of each setting position in the target Android application program is formed according to the Intent sequences and the sequence of operation
Chain template, that is, obtain the corresponding deep chain interface in each setting position.
2. the method as described in claim 1, it is characterised in that get the method up to the Intent sequences of the Activity
For：The Activity navigation relation figures of the target Android application program are constructed first；Then according to the Activity navigation relations
Figure, obtains from the path that the Activity is reached using entrance Activity, then chooses the Intent corresponding to shortest path
Sequence, as the Intent sequences that the Activity is reached from application entrance Activity.
3. the method as described in claim 1, it is characterised in that the method for generating the sequence of operation is：For the target
One mark of every Fragment generations in Activity；Generate the Fragment switching figures FTG of the target Activity<P,
D,p>；Wherein, P represents a vertex set, and the mark of every Fragment corresponds to a vertex in Activity；D is directed edge
Set, each side is a triple e<s,t,i>, behalf source Fragment, t are target Fragment, and i, which is represented, to be triggered
The mark id of the control of switching；P is starting point, i.e., homepage when Activity is just opened；Then according to the target
The Fragment switching figures of Activity, will be together in series from starting point to the side of target Fragment, obtain the target
The sequence of operation of the Fragment of Activity.
4. method as claimed in claim 3, it is characterised in that be every Fragment generations in the target Activity
One mark method be：It is the control tree that the target Android application program operationally constructs to obtain Android system；Calculate the control
The cryptographic Hash of part tree, then identifies current Fragment with the cryptographic Hash.
5. method as claimed in claim 4, it is characterised in that the method for calculating the cryptographic Hash of the control tree is：For this
A node q in control tree, if node q does not have child node in control tree, result corresponds to the label of control for node q
Character string Hash；If node q has child node, the Hash of all child nodes of recursive calculation egress q；Then according to node q
The cryptographic Hash of child node sort to the child node of node q to ensure the uniformity of hash data structure, then the Kazakhstan by each child node
The label of uncommon value and control is summed to form a new character string, most at last the cryptographic Hash of the new character string as node q
Hash.
6. method as claimed in claim 3, it is characterised in that the method for obtaining the Fragment switchings figure is：Point first
Each control of current Fragment is hit to check whether Activity changes, if Activity changes, calling system letter
Number doback () directly returns to preceding state, continues to travel through after returning；If Activity changes, check current
The state of Fragment, if the mark of current Fragment and difference before, and current Fragment would be one new
Fragment, then it is added in Fragment switching figures, and the information of writing edge is the control to switch；If do not send out
Raw Fragment switchings then continue to travel through；After traversal search is completed, obtain the Fragment switchings figure and own
The list of Fragment.
7. a kind of deep chain of the deep chain interface based on the generation of claim 1 the method performs method, it is characterised in that agency
Activity searches corresponding deep chain template and to the example according to the request of deep chain, and construction one can jump to depth chain request
The script of corresponding target location；Then according to script, playback engine control Android is applied to be switched between Activity, and is being controlled
Operated on part, reach target location；The parameter corresponded in the depth chain request comprising deep chain in deep chain template is required
Assignment.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711134577.1A CN108008941B (en) | 2017-11-16 | 2017-11-16 | A kind of deep chain interface automatic generation method and depth chain execution method of Android application |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711134577.1A CN108008941B (en) | 2017-11-16 | 2017-11-16 | A kind of deep chain interface automatic generation method and depth chain execution method of Android application |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108008941A true CN108008941A (en) | 2018-05-08 |
| CN108008941B CN108008941B (en) | 2019-06-21 |
Family
ID=62052642
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711134577.1A Active CN108008941B (en) | 2017-11-16 | 2017-11-16 | A kind of deep chain interface automatic generation method and depth chain execution method of Android application |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108008941B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111240957A (en) * | 2019-11-27 | 2020-06-05 | 广东电网有限责任公司信息中心 | Activity relationship graph generation method for Android application |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1755682A (en) * | 2004-09-30 | 2006-04-05 | 微软公司 | System and method for ranking search results using link distance |
| CN102591981A (en) * | 2011-01-06 | 2012-07-18 | 微软公司 | Providing deep links in association with toobars |
| CN105431844A (en) * | 2013-07-17 | 2016-03-23 | 谷歌公司 | Third party search applications for a search system |
| CN106663108A (en) * | 2014-06-25 | 2017-05-10 | 谷歌公司 | Deep links for native applications |
| US20170192987A1 (en) * | 2015-12-31 | 2017-07-06 | Quixey, Inc. | Transformation and Presentation of On-Demand Native Application Crawling Results |
| US20170249312A1 (en) * | 2016-02-27 | 2017-08-31 | Microsoft Technology Licensing, Llc | Dynamic deeplinks for navigational queries |
-
2017
- 2017-11-16 CN CN201711134577.1A patent/CN108008941B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1755682A (en) * | 2004-09-30 | 2006-04-05 | 微软公司 | System and method for ranking search results using link distance |
| CN102591981A (en) * | 2011-01-06 | 2012-07-18 | 微软公司 | Providing deep links in association with toobars |
| CN105431844A (en) * | 2013-07-17 | 2016-03-23 | 谷歌公司 | Third party search applications for a search system |
| CN106663108A (en) * | 2014-06-25 | 2017-05-10 | 谷歌公司 | Deep links for native applications |
| US20170192987A1 (en) * | 2015-12-31 | 2017-07-06 | Quixey, Inc. | Transformation and Presentation of On-Demand Native Application Crawling Results |
| US20170249312A1 (en) * | 2016-02-27 | 2017-08-31 | Microsoft Technology Licensing, Llc | Dynamic deeplinks for navigational queries |
Non-Patent Citations (2)
| Title |
|---|
| MARGI3: "《CSDN博客》", 13 October 2017 * |
| YUN MA，XUANZHE LIU，ZINIU HU等: "Aladdin: Automating Release of Android Deep Links to In-App Content", 《2017 IEEE/ACM 39TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING COMPANION (ICSE-C)》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111240957A (en) * | 2019-11-27 | 2020-06-05 | 广东电网有限责任公司信息中心 | Activity relationship graph generation method for Android application |
| CN111240957B (en) * | 2019-11-27 | 2023-09-15 | 广东电网有限责任公司信息中心 | Activity relation graph generation method of Android application |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108008941B (en) | 2019-06-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11150874B2 (en) | API specification generation | |
| US9158764B2 (en) | Method and apparatus for utilizing user feedback to improve signifier mapping | |
| JP6494609B2 (en) | Method and apparatus for generating a customized software development kit (SDK) | |
| CN102597993B (en) | Managing application state information by means of uniform resource identifier (URI) | |
| Steffan et al. | Collaborative attack modeling | |
| JP3295667B2 (en) | Method and system for accessing information on a network | |
| JP2009543167A (en) | Computer-implemented method, computer program, and data processing system for inheriting page layout for a page | |
| US20100228873A1 (en) | Protocol Agnostic Request Response Pattern | |
| CN107766344B (en) | Template rendering method and device and browser | |
| KR20060050608A (en) | Data sharing system, method and software tool | |
| Benjamin et al. | A strategy for efficient crawling of rich internet applications | |
| WO2014204984A1 (en) | Method and apparatus for code virtualization and remote process call generation | |
| WO2009059480A1 (en) | Url and anchor text analysis for focused crawling | |
| JP2005535032A (en) | Internal natural domain service system with local name server for flexible top level domain | |
| CN111949306A (en) | Pushing method and system supporting fragmented learning of open-source project | |
| US20060031771A1 (en) | Method and code module for facilitating navigation between webpages | |
| Sharma et al. | A novel architecture for deep web crawler | |
| CN108008941B (en) | A kind of deep chain interface automatic generation method and depth chain execution method of Android application | |
| Kowalczyk et al. | Enhancing SEO in single-page web applications in contrast with multi-page applications | |
| US20050102286A1 (en) | Method and system for responding to requests relating to complex data maintained in a structured form | |
| US7921104B2 (en) | Invoking actions on data via LDAP requests | |
| CN105912573A (en) | Data updating method and data updating device | |
| Choudhary | M-crawler: Crawling rich internet applications using menu meta-model | |
| Troelsen et al. | Introducing ASP. NET MVC | |
| JP2002342382A (en) | Method and device for automatically retrieving hypertext structure |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |