CN107122389A - It is a kind of to realize the method that streaming and multi-mode quickly search URL link in webpage - Google Patents
It is a kind of to realize the method that streaming and multi-mode quickly search URL link in webpage Download PDFInfo
- Publication number
- CN107122389A CN107122389A CN201710123247.6A CN201710123247A CN107122389A CN 107122389 A CN107122389 A CN 107122389A CN 201710123247 A CN201710123247 A CN 201710123247A CN 107122389 A CN107122389 A CN 107122389A
- Authority
- CN
- China
- Prior art keywords
- label
- data
- matched
- keyword
- link
- 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
- 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]
- G06F16/9566—URL specific, e.g. using aliases, detecting broken or misspelled links
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The method that streaming and multi-mode quickly search URL link in webpage is realized the invention discloses a kind of.The present invention creates link tag match keyword dictionary first, and link label matching keywords record to be processed is added in dictionary.Secondly the response data packet that reading Web service device is returned, data processing starting point is set to by the first character of the response data packet location that saves land.The current byte of reading is matched with the left boundary or right boundary of a label keyword in link label keyword dictionary；If non-label buffering area is not sky after all processing data packets of the response are finished, non-label buffer data is sent to client.The present invention utilizes streaming thought, and the packet received can be operated and forwarded, it is not necessary to which carrying out caching to all data could be operated, and the burden of proxy server is also mitigated while improving time efficiency, the robustness of system is enhanced.
Description
Technical field
The invention belongs to field of computer technology, it is related to one kind and realizes that streaming and multi-mode quickly search URL chains in webpage
The method connect.
Background technology
URL, URL, for uniquely identifying some resource on WWW.Generally, URL is true in webpage
It is constant, such as " http after fixed://xxx.xxx.xxx/xxx/xxx.html”、“/xxx/xxx/xxx/”、“./xxx/xxx”、
" ../../xxx/xxx.css " etc..URL consistency allows hacker to construct correlation attack to Web application attacks in webpage
Load, carries out various attacks.If parsing the URL that webpage is included in return response after user's request to server by acting on behalf of
Link carries out dynamic random change, can effectively defend the attack applied for Web.Generally, the URL in webpage is placed in
" href ", " imgsrc ", " form ", " backgorund ", " in the label such as embed src " or after keyword.It is obvious that fast
Speed finds the link that webpage is included in response and replaced, and can effectively reduce URL dynamic change defence methods to systematicness
The influence of energy.
At present, conventional web page interlinkage lookup method has：(1) based in full using regular expression method or using quickly
Character string matching method, such as KMP algorithms；(2) character string matching method based on streaming, is such as used to handle at the sax of xml document
Reason method.
Wherein the method based on full text needs cache web pages data, requires higher to the space complexity of proxy server.
General character string matching method lacks the consideration of streaming data and multi-pattern match, can not directly apply.sax
Processing method then considers excessive to various labels, and it is not very good to cause its performance.
The content of the invention
The invention aims to solve quick, stream in current URL dynamic changes defence method to being linked in webpage
The requirement that formula and multi-mode are searched, it is proposed that a kind of to realize the method that streaming and multi-mode quickly search URL link in webpage.
The technical solution adopted for the present invention to solve the technical problems comprises the following steps：
Step 1：Initialization system：Link tag match keyword dictionary is created, link to be processed is added in dictionary
Tag match keyword is recorded.
Each link label matching keywords record includes left boundary, right boundary, a left end side
Boundary needs matched position, a right boundary to need matched position and the processing function of the link label matching keywords.
If the current link label matching keywords matched are sky, while being marked with label across data block labeled as vacation.
Step 2：The response data packet that reading Web service device is returned, the first character of response data packet is saved land location
It is set to data processing starting point.
Step 2.1：The current byte in response data packet is read, response data packet end mark is determined whether.If
The byte is not in response to the end mark of packet, jumps to step 2.2；Otherwise step 3 is jumped to.
Step 2.2：Whether be empty, if do not jumped to for sky if checking the current link label matching keywords matched
Step 2.6.Otherwise, step 2.3 is jumped to.
Step 2.3：By the left end side of all label keywords in the current byte of reading and link label keyword dictionary
Boundary is matched.
The left boundary of a label keyword in the current byte of reading and link label keyword dictionary is carried out
The flow of matching is：
If the current byte read needs the corresponding byte of matched position equal with the left boundary of the label keyword,
The left boundary of the label keyword is needed to move a position after matched position.Otherwise, by the left boundary of the label keyword
Need matched position to be reset to initial position, and check again for the left boundary of the label keyword to need the corresponding byte of matched position
It is whether identical with the byte of reading, as identical, the left boundary of the label keyword is needed to move a position after matched position.
If the left boundary of a certain label keyword is matched completely, set the label keyword for it is current just
In the label keyword of matching, step 2.4 is jumped to.Otherwise by a label in the byte of reading and label keyword dictionary
The flow that the left boundary of keyword is matched repeats, until all label keywords are all carried out with the byte of the reading
Overmatching, then branches to step 2.5.
Step 2.4：The data between data processing starting point and the data currently read are extracted, and the data of extraction are put
Enter in non-label data buffer zone.
Step 2.5：The currently processed byte location of packet is moved rearwards by a position, step 2.1 is jumped to.
Step 2.6：The byte of reading is matched with the right boundary of the current label keyword matched.If
The byte currently read needs the corresponding byte of matched position equal with the right boundary of the current label keyword matched, will
The right boundary of the current label keyword matched needs to move a position after matched position.Otherwise, by the label keyword
Right boundary need matched position to move on to original position, and check that the right boundary of the label keyword needs matched position corresponding
Whether byte is identical with the byte currently read, as identical, and the right boundary of the label keyword is needed to move one after matched position
Individual position.If the right boundary of the label keyword is matched completely, step 2.7 is jumped to.Otherwise, step is jumped to
3。
Step 2.7：If label is false across packet marking, by the data between label left boundary and right boundary
It is added in pending link buffering area；Otherwise, by between data processing starting point and currently processed keyword right boundary
Data are added among pending link data buffer zone.Jump to step 2.8.
Step 2.8：The corresponding transfer function of the label keyword is called to handle the number in pending link data buffer zone
According to, client is sent to after then the pending label buffer area data after non-label buffer data and processing are merged, then
Data processing starting point is navigated to after right boundary, while emptying non-label buffering area and pending link number of buffer
According to reset all label keyword left boundaries and right boundary needs matched position to original position, resets label across data
Packet making is false.Jump to step 2.5.
Step 3：If not matching left boundary completely also, step 3.1 is jumped to；Otherwise, to step 3.2.
Step 3.1：Content between data processing starting point and the packet end position is added to non-tag buffer
Qu Zhong, jumps to step 4.
Step 3.2：If label is false across packet marking, between the data by left boundary and currently read in
Appearance be added to it is pending link buffering area among, if or right boundary is true, jump to step 4；Otherwise, step 3.3 is jumped to.
Step 3.3：Data between data processing starting point and current reading byte location are added to pending link
Buffering area, jumps to step 4.
Step 4：Repeat step 2-3, until all processing data packets of the response are finished, then branches to step 5：
Step 5：If non-label buffering area is not sky, non-label buffer data is sent to client.
The present invention has the beneficial effect that：
The quick look-up system linked in a kind of html web page of the present invention can realize that the URL link in webpage is checked quickly soon
Look for extraction.After URL link is extracted, individual operation can be carried out to the URL extracted.
This method effectively reduces the lookup time, and copes with the extraction of multi-mode.To solve the defence of URL dynamic changes
Efficiency is improved etc. method, so as to more efficiently solve the attacks such as XSS, code injection, link fishing.
Using streaming thought, the packet received can be operated and forwarded, it is not necessary to which all data are delayed
Depositing to be operated, and the burden of proxy server is also mitigated while improving time efficiency.
Backtracking will not be produced when causing using the preliminary lookup method similar to automatic machine and search and extract URL, is greatly carried
High lookup extraction efficiency.
In addition, the system can be matched when carrying out to URL link and searching and extract to multiple keywords, and can be certainly
Row modification keyword dictionary, will not be extracted just for a kind of specific keyword, enhance the robustness of system.
To sum up, URL quick look-up systems can effectively improve the efficiency searched URL link in webpage, to solving current URL
Preferable help is provided to the requirement that quick, streaming and the multi-mode that are linked in webpage are searched in dynamic change defence method.
Brief description of the drawings
Fig. 1 is URL link extraction system Organization Chart.
Fig. 2 accesses the business process map of website for user after deployment URL link extraction system.
Fig. 3 extracts URL link flow chart to be preliminary.
Fig. 4 (a) is matching left boundary flow chart.
Fig. 4 (b) is matching right boundary flow chart.
Embodiment
Specific embodiments of the present invention are described in further detail with reference to the accompanying drawings and detailed description into
One step explanation.
It is a kind of to realize the method that streaming and multi-mode quickly search URL link in webpage, as Figure 1-3, idiographic flow
It is as follows：
Step 1：Initialization system, creates link tag match keyword dictionary, adds link label matching to be processed
Keyword is recorded.Each link label matching keywords record includes left boundary, right boundary, a left end
Border needs matched position, a right boundary to need matched position and the processing function of the label keyword.Href is added herein to close
Keyword, left boundary is href=, and right boundary is>, processing function is ProcessHref；Imgsrc keywords, left boundary
For imgsrc=, right boundary is>, processing function is ProcessHref；Form keywords, left boundary is<Form, right-hand member
Border is>, processing function is ProcessForm；Background keywords, left boundary is background=, right-hand member side
Boundary is>, processing function is ProcessHref；Embed src keywords, left boundary is embed src=, and right boundary is
>, processing function is ProcessHref.If the current label keyword matched is sky, while being marked with across the data block mark of label
It is false.
Step 2：The response data packet that reading Web service device is returned.The first character of response data packet is saved land location
It is set to data processing starting point.
Step 2.1：Current byte in read data packet, determines whether packet end mark.If the byte is non-
Packet end mark, jumps to step 2.2.Otherwise, step 3 is jumped to.
Step 2.2：Whether be empty, if not jumping to step 2.6 for sky if checking the current label keyword matched.
Otherwise, step 2.3 is jumped to.
Step 2.3：The byte of reading and the left boundary of all label keywords in link label keyword dictionary are entered
Row matching.
As shown in Fig. 4 (a), by the left end of a label keyword in the byte of reading and link label keyword dictionary
The flow that border is matched is：
If the byte read needs the corresponding byte of matched position equal with the left boundary of the label keyword, should
The left boundary of label keyword needs to move a position after matched position.Otherwise, by the left boundary need of the label keyword
Be reset to initial position with position, and check the label keyword left boundary need the corresponding byte of matched position whether with reading
The byte taken is identical, as identical, and the left boundary of the label keyword is needed to move a position after matched position.
If the left boundary of a certain label keyword is matched completely, set the label keyword for it is current just
In the label keyword of matching, step 2.4 is jumped to.Otherwise repeat one in the byte of reading and label keyword dictionary
A flow that the left boundary of label keyword is matched, until all label keywords were all carried out with the byte of the reading
Match somebody with somebody, then branch to step 2.5.
Step 2.4：Data between data processing starting point and the data currently read place are extracted, non-label data is put into
In buffering area.
Step 2.5：The currently processed byte location of packet is moved rearwards by a position, step 2.1 is jumped to.
Step 2.6：The byte of reading is matched with the right boundary of the current label keyword matched.As schemed
Shown in 4 (b), if the byte currently read needs matched position corresponding with the right boundary of the current label keyword matched
Byte it is equal, by the right boundary of the label keyword currently matched need after matched position move a position.Otherwise, will
The right boundary of the label keyword needs matched position to reset to initial position, and checks that the right boundary of the label keyword is needed
Whether the corresponding byte of matched position is identical with the byte currently read, needs the right boundary of the label keyword if identical
A position is moved after matched position.If the right boundary of the label keyword is matched completely, step 2.7 is jumped to.
Otherwise, step 3 is jumped to.
Step 2.7：If label is false across packet marking, the data between left right boundary are added to pending
Link in buffering area；Otherwise, the data between data processing starting point and currently processed keyword right boundary are added to and treated
Among processing link data buffer zone.Jump to step 2.8.
Step 2.8：The corresponding transfer function of label keyword is called to treat the data in processing link data buffer zone
Handled.If the left boundary of the label keyword is " href=", " imgsrc=", " background=", "
Embed src=", jump to step 2.9；If "<Form ", jumps to step 2.10.
Step 2.9：The URL of such label keyword is located in first after the left boundary of these label keywords
Between quotation marks and second correspondence quotation marks, therefore find out the position of first quotation marks and second correspondence quotation marks, two quotation marks it
Between data be accurate URL.By the data before URL and data buffer storage afterwards.Jump to step 2.11.
Step 2.10：First quotation marks and second of the URL of such label keyword after keyword action
Between correspondence quotation marks, therefore the action keywords in pending link buffering area are first found out, then found out after action
Two quotation marks position, the data between two quotation marks are accurate URL.By the data before URL and data afterwards
Caching.Jump to step 2.11.
Step 2.11：Real URL is converted into virtual URL.Then the data cached before are merged with virtual URL, replaced
Change the data of pending link buffering area.Jump to step 2.12.
Step 2.12：It is sent to after pending label buffer area data after non-label buffer data and processing are merged
Client, then data processing starting point is navigated to after right boundary, while emptying non-label buffering area and pending chain
Connect buffer data, reset all label keyword left boundaries and right boundary needs matched position to initial position, resets
Label is false across packet marking.Jump to step 2.5.
Step 3：If not matching left boundary completely also, step 3.1 is jumped to；Otherwise, to step 3.2.
Step 3.1：Content between data processing starting point and the packet end position is added to non-tag buffer
Qu Zhong, jumps to step 4.
Step 3.2：If label is false across packet marking, between the data by left boundary and currently read in
Appearance be added to it is pending link buffering area among, if or right boundary is true, jump to step 4；Otherwise, step 3.3 is jumped to.
Step 3.3：Data between data processing starting point and current reading byte location are added to pending link
Buffering area, jumps to step 4.
Step 4：Repeat step 2-3, until all processing data packets of the response are finished, then branches to step 5：
Step 5：If non-label buffering area is not sky, non-label buffer data is sent to client.
The invention is not limited in above-mentioned implementation steps, those skilled in the art can also make a variety of changes accordingly, but appoint
What change equivalent or similar with the present invention should all be covered within the scope of the claims.
Claims (3)
1. a kind of realize the method that streaming and multi-mode quickly search URL link in webpage, it is characterised in that comprises the following steps：
Step 1：Initialization system：Link tag match keyword dictionary is created, link label to be processed is added in dictionary
Matching keywords are recorded；
Each link label matching keywords record is needed comprising a left boundary, right boundary, a left boundary
Matched position, a right boundary need matched position and the processing function of the link label matching keywords；
If the current link label matching keywords matched are sky, while being marked with label across data block labeled as vacation；
Step 2：The response data packet that reading Web service device is returned, the first character of the response data packet location that saves land is set to
Data processing starting point；
Step 2.1：The current byte in response data packet is read, response data packet end mark is determined whether；If the word
Section is not in response to the end mark of packet, jumps to step 2.2；Otherwise step 3 is jumped to；
Step 2.2：Whether be empty, if not jumping to step for sky if checking the current link label matching keywords matched
2.6；Otherwise, step 2.3 is jumped to；
Step 2.3：The left boundary of the current byte of reading and all label keywords in link label keyword dictionary is entered
Row matching；
If the left boundary of a certain label keyword is matched completely, set the label keyword for it is current
The label keyword matched somebody with somebody, jumps to step 2.4；Otherwise by a label key in the byte of reading and label keyword dictionary
The flow that the left boundary of word is matched repeats, until all label keywords were all carried out with the byte of the reading
Match somebody with somebody, then branch to step 2.5；
Step 2.4：The data between data processing starting point and the data that currently read are extracted, and the data of extraction are put into non-
In label data buffering area；
Step 2.5：The currently processed byte location of packet is moved rearwards by a position, step 2.1 is jumped to；
Step 2.6：The byte of reading is matched with the right boundary of the current label keyword matched；
If the right boundary of the label keyword is matched completely, step 2.7 is jumped to；Otherwise, step 3 is jumped to；
Step 2.7：If label is false across packet marking, the data between label left boundary and right boundary are added
Into pending link buffering area；Otherwise, by the data between data processing starting point and currently processed keyword right boundary
It is added among pending link data buffer zone；Jump to step 2.8；
Step 2.8：The corresponding transfer function of the label keyword is called to handle the data in pending link data buffer zone, so
Client is sent to after the pending label buffer area data after non-label buffer data and processing are merged afterwards, then by data
Processing starting point is navigated to after right boundary, while non-label buffering area and pending link buffer data are emptied, weight
That puts all label keyword left boundaries and right boundary needs matched position to original position, resets label across packet marking
It is false；Jump to step 2.5；
Step 3：If not matching left boundary completely also, step 3.1 is jumped to；Otherwise, to step 3.2；
Step 3.1：Content between data processing starting point and the packet end position is added in non-label buffering area,
Jump to step 4；
Step 3.2：If label is false across packet marking, the content between the data by left boundary and currently read adds
Be added to it is pending link buffering area among, if or right boundary is true, jump to step 4；Otherwise, step 3.3 is jumped to；
Step 3.3：Data processing starting point and the current data read between byte location are added to and pending link buffering
Area, jumps to step 4；
Step 4：Repeat step 2-3, until all processing data packets of the response are finished, then branches to step 5：
Step 5：If non-label buffering area is not sky, non-label buffer data is sent to client.
2. it is according to claim 1 it is a kind of realize the method that streaming and multi-mode quickly search URL link in webpage, it is special
Levy the left side for being the current byte and a label keyword in link label keyword dictionary by reading described in step 2.3
The flow that end edge circle is matched is：
If the current byte read needs the corresponding byte of matched position equal with the left boundary of the label keyword, should
The left boundary of label keyword needs to move a position after matched position；Otherwise, by the left boundary need of the label keyword
Initial position is reset to position, and checks again for whether the left boundary of the label keyword needs the corresponding byte of matched position
It is identical with the byte of reading, as identical, the left boundary of the label keyword is needed to move a position after matched position.
3. it is according to claim 1 it is a kind of realize the method that streaming and multi-mode quickly search URL link in webpage, it is special
Levy and be that the byte by reading described in step 2.6 is matched with the right boundary of the current label keyword matched,
Idiographic flow is as follows：
If the byte currently read and the right boundary of the current label keyword matched need the corresponding word of matched position
Section is equal, and the right boundary of the label keyword currently matched is needed to move a position after matched position；Otherwise, this is marked
The right boundary of label keyword needs matched position to move on to original position, and checks that the right boundary of the label keyword needs match bit
Whether identical with the byte currently read put corresponding byte, as identical, the right boundary of the label keyword is needed into match bit
Postpone one position of shifting.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710123247.6A CN107122389B (en) | 2017-03-03 | 2017-03-03 | A kind of method realized streaming and multi-mode and quickly search URL link in webpage |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710123247.6A CN107122389B (en) | 2017-03-03 | 2017-03-03 | A kind of method realized streaming and multi-mode and quickly search URL link in webpage |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107122389A true CN107122389A (en) | 2017-09-01 |
| CN107122389B CN107122389B (en) | 2018-05-04 |
Family
ID=59717194
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710123247.6A Active CN107122389B (en) | 2017-03-03 | 2017-03-03 | A kind of method realized streaming and multi-mode and quickly search URL link in webpage |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107122389B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110022354A (en) * | 2019-03-03 | 2019-07-16 | 云南电网有限责任公司信息中心 | Mobile application integrated approach, device, computer equipment and storage medium based on http protocol |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2456049A (en) * | 2007-11-12 | 2009-07-08 | Javid Zeeshan | Visual web crawler |
| CN101582075A (en) * | 2009-06-24 | 2009-11-18 | 大连海事大学 | Web information extraction system |
| CN105843965A (en) * | 2016-04-20 | 2016-08-10 | 广州精点计算机科技有限公司 | Deep web crawler form filling method and device based on URL (uniform resource locator) subject classification |
-
2017
- 2017-03-03 CN CN201710123247.6A patent/CN107122389B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2456049A (en) * | 2007-11-12 | 2009-07-08 | Javid Zeeshan | Visual web crawler |
| CN101582075A (en) * | 2009-06-24 | 2009-11-18 | 大连海事大学 | Web information extraction system |
| CN105843965A (en) * | 2016-04-20 | 2016-08-10 | 广州精点计算机科技有限公司 | Deep web crawler form filling method and device based on URL (uniform resource locator) subject classification |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110022354A (en) * | 2019-03-03 | 2019-07-16 | 云南电网有限责任公司信息中心 | Mobile application integrated approach, device, computer equipment and storage medium based on http protocol |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107122389B (en) | 2018-05-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8156429B2 (en) | Method and system for accelerating downloading of web pages | |
| CA2640025C (en) | Methods and devices for post processing rendered web pages and handling requests of post processed web pages | |
| US8661090B2 (en) | Systems and methods thereto for acceleration of web pages access using next page optimization, caching and pre-fetching techniques | |
| CN102075570B (en) | Method for implementing HTTP (hyper text transport protocol) message caching mechanism based on keywords | |
| US20090089278A1 (en) | Techniques for keyword extraction from urls using statistical analysis | |
| US20080222244A1 (en) | Method and apparatus for acceleration by prefetching associated objects | |
| US20120233199A1 (en) | Intelligent Web Caching | |
| US20080168049A1 (en) | Automatic acquisition of a parallel corpus from a network | |
| EP2038767A2 (en) | Aligning hierarchal and sequential document trees to identify parallel data | |
| US8086953B1 (en) | Identifying transient portions of web pages | |
| US20150100563A1 (en) | Method for retaining search engine optimization in a transferred website | |
| CN102880679B (en) | A kind of info web storage means and device | |
| CN106022126A (en) | A webpage feature extracting method for WEB Trojan horse detection | |
| CN101727471A (en) | Website content retrieval system and method | |
| WO2022179128A1 (en) | Crawler-based data crawling method and apparatus, computer device, and storage medium | |
| WO2017000659A1 (en) | Enriched uniform resource locator (url) identification method and apparatus | |
| CN104462390B (en) | A kind of method and system for improving webpage self-adaptive layout efficiency | |
| CN104778232B (en) | Searching result optimizing method and device based on long query | |
| CN107122389B (en) | A kind of method realized streaming and multi-mode and quickly search URL link in webpage | |
| CN102333123B (en) | File storage method and device, searching method and device and network device | |
| CN105930385A (en) | Data crawling method and system | |
| WO2015074455A1 (en) | Method and apparatus for computing url pattern of associated webpage | |
| CN104881453B (en) | A kind of method and apparatus identifying type of webpage | |
| CN110969469B (en) | Data acquisition method and device | |
| CN106612336A (en) | Picture preloading method and picture preloading device |
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 |