CN103440289B - The incompatible label parallel search of webpage method based on MapReduce - Google Patents
The incompatible label parallel search of webpage method based on MapReduce Download PDFInfo
- Publication number
- CN103440289B CN103440289B CN201310359420.4A CN201310359420A CN103440289B CN 103440289 B CN103440289 B CN 103440289B CN 201310359420 A CN201310359420 A CN 201310359420A CN 103440289 B CN103440289 B CN 103440289B
- Authority
- CN
- China
- Prior art keywords
- label
- incompatible
- code
- code block
- scanning
- 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.)
- Expired - Fee Related
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides the incompatible label parallel search of a kind of webpage based on MapReduce method, for incompatible label is located fast. The code that this method will scan is divided into n piece, uses the incompatible label in Map function parallel search code block on m computer, and the incompatible tag library using is Trie structure organization; In the time finding incompatible label, record line number, columns and the code block number at label place; Finally operate recorded result carried out to aggregation process by Reduce, by the position of all incompatible labels return to user. This method can be used for the multi-platform deployment of large Web application program, can locate fast incompatible label, with the incompatible label that needs to process in the quick locating source code of ancillary works teacher, the Web application of disposing can normally be shown on different browsers.
Description
Technical field
The invention belongs to the cross-platform migration of application software field, the incompatible label of especially a kind of webpage based on MapReduce alsoRow lookup method.
Background technology
The migration of Web system client has its unique feature with respect to the migration of other system client. In Web system, openThe scripts such as the javascript that hairnet page uses have professional platform independence, and the program of exploitation meets the technical specification of W3C, Linux,Browser in Windows operating system all can be supported preferably to WEB application system. But due to the browser difference using,Therefore after browser engine is resolved WEB application system webpage, can in user interface, present different demonstration effectsReally. For example, the label that some can normally show at MS internet explorer and attribute, in the time using the parsing of FireFox browser,There will be and show the problems such as abnormal or wrong.
In general, browser is made up of the rendering engine of browser and user interface. User interface, namely often saysBrowser shell is that user and browser carry out mutual platform. And as the rendering engine of the core of browser, be responsible for netExplanation (as HTML, JavaScript, XML, image etc.), the organize your messages of page grammer (for example add CSS(CascadingStyleSheet, Cascading Style Sheet) etc.) and calculate the display mode of webpage, finally can export display or printer to.Rendering engine has directly determined the analysis mode of web page files, so be also referred to as the kernel of browser. The difference of rendering engine,Directly cause same web page under different engines, to present different display modes. In IE browser with Windows, useThe Gecko rendering engine that FireFox browser under Trident rendering engine and Linux uses describes for example:
Trident is a kind of rendering engine of Microsoft's exploitation, and its first version is the Windows along with in October, 1997The issue that internetexplorer is the 4th edition and issuing. Subsequently, trident engine is along with the version of the IE browser of browser versionUpgrade and be constantly updated and perfect, and being in use to current IE9. The groundwork flow process of Trident engine is as follows: userAfter the address field INADD of browser, by obtain html file after browse request. Browser loads html fileTime, for external linkage CSS file, thereby sending the request of CSS file again, browser obtains corresponding CSS file. ?After this, browser starts to play up the page, and the process of playing up is that order is carried out, but plays up and be not all just to complete for one time,Sometimes the content running into below causes the result of playing up will make corresponding change above, now will get back to corresponding position againPlay up the page, this is reflow process namely.
The webpage rendering engine that Gecko is a set of open source code, write with C++. This software is by Netscape communication originallyCompany's exploitation, safeguarded by Mozilla foundation now. The workflow of Gecko engine is identical with Trident engine.But in Trident engine, the processing capacity of javascript is integrated among Trident engine. And for comprising GeckoAt interior most of engines, due to the problem of efficiency, outside engine, develop again a javascript engine placeReason, to improve processing speed.
Although the workflow of analytics engine is similar, different analytics engines is but not quite similar to the parsing of label, thisSample just makes to exist some label correctly to be identified by some browser, the phenomenon that but can not be identified by other browser,This is the problem of so-called browser-incompatible namely.
The compatibility issue of browser has just been decided determining while using different rendering engine, also cannot change afterwards,Unless rewriting kernel. This requires them in the Web of exploitation application, will take into account not also just for developer has proposed requirementWith the otherness between browser kernel, guarantee that as much as possible write web page files can normally show in different browsers.
Often scale is all larger for the WEB application system of moving due to needs, for example public resource transaction, the emergent finger of people's air defenseWave, the system such as financial synergetic office work, CPPCC's Bussiness office, each system comprises several subsystems, if each subsystem comprisesDry module, the whole system that need to be moved, the quantity of client terminal web page is huge, if manually complete to label search andAmendment, the workload of facing is very huge, is also very easy to occur the situations such as omission or erroneous judgement simultaneously. How across flatWhen platform migration Web application system, ensure that wherein the content of web displaying can be correct after migration by different browser resolvesAnd correctly show, be a problem demanding prompt solution.
Summary of the invention
The present invention is directed to the problem that cross-platform migration Web application system exists, proposed a kind of webpage based on MapReduce notCompatible label parallel search method, for incompatible label is located fast, to need in the quick locating source code of ancillary works teacherThe incompatible label of processing can normally show the Web application of disposing on different browsers.
The incompatible label parallel search of webpage based on MapReduce of the present invention method, comprises the steps:
Step 1: determine the code border that needs to carry out incompatible tag location in the source code of Web application;
Step 2: the code of needs scanning is divided into n piece closely equably, and n is integer, and every part of code is retouched by a tripleState<R B, F>, wherein R represents the total code line number of this code block, and B represents code block number, and F represents code block current state,F value 0 or 1,0 is for scanning or scanning, and 1 is the end of scan;
Step 3: the code after cutting apart is assigned randomly on m platform machine and is processed;
Step 4: initialize structure labelContext, comprise source code path in structure labelContext, intermediate fileStoring path, the number of map function, the number of reduce function, and the path of incompatible tag library;
Step 5: be that each code block creates map function, and the F arranging in the triple of code block is 0;
Step 6: every machine, to distributed code block, starts scanning label downwards;
Step 7: according to incompatible tag library, judge whether the label scanning is incompatible label, if so, performs step eight,Otherwise, execution step nine;
Step 8: record the position at incompatible label place in intermediate file, three Parametric Representations for the position at label place:Line number r, the columns c at label place and the code block b at label place, then perform step nine;
Step 9: judge the whether end of scan of current code block, if finish, the parameter F in this code block triple is set to 1;If no, return to step 6, continue to carry out;
Step 10: judge whether all code blocks have all finished scanning, if finish, execution step 11, otherwise wait for other generationThe end of scan of code block, and then execution step 11;
Step 11: all intermediate files, by Reduce function, according to the position at the incompatible label place of record, calculate eachThe physical location of incompatible label;
Step 12: the information that merges same label;
Step 13: the incompatible label after merging and the position at label place are put into Hash set container, and return to useFamily.
The advantage of the incompatible label parallel search of a kind of webpage based on MapReduce of the present invention method is:
(1) lookup method of the present invention is based on MapReduce, and MapReduce is a kind of multiple programming that can process mass dataPattern, for the large Web application of size of code, locating effect is more remarkable fast, is suitable for the many of large Web application programPlatform deployment;
(2) because Web web page code amount is numerous and diverse, the time of searching is long, and each incompatible label is separate, each other notRely on, therefore, be applicable to very much using parallel search method, the present invention is in carrying out incompatible tag location, by MapReducePattern be used in label lookup process, the search efficiency of incompatible label will improve;
(3) the incompatible tag library that the inventive method is used, is according to Trie structure organization, can reduce to greatest extent nothingThe character string comparison of meaning, search efficiency is higher than Hash table. This institutional framework is easier to expansion simultaneously.
Brief description of the drawings
Fig. 1 is the overall flow figure of parallel search method provided by the invention;
Fig. 2 is the structural representation of incompatible tag library;
Fig. 3 is that the parameter information of running example of the present invention arranges schematic diagram;
Fig. 4 be running example of the present invention the term of execution part running log hum pattern;
Fig. 5 is the operation result schematic diagram of running example of the present invention.
Detailed description of the invention
Below in conjunction with drawings and Examples, the present invention is described in further detail.
The present invention is the fast parallel lookup method of the incompatible label of quick webpage that design realizes based on MapReduce, in practiceCan locate fast incompatible label, prompting engineer need to carry out to this respective handling, makes the Web application of disposing can be in differenceOn browser, normally show.
The incompatible label parallel search of webpage based on MapReduce of the present invention method, first by the Web of pending analysisThe source code at interface is cut apart, and is divided into closely equably n piece, then, uses Map letter for the each code block after cutting apartNumber, judges in source code, whether label used is incompatible label, if so, records the position (line number at this label placeR, columns c), and the code block b at label place; Finally operate recorded result carried out to aggregation process by Reduce,Obtain incompatible labels all in source code, and each label occur (line number r, columns are c) in all positions. The present inventionThe incompatible label parallel search of webpage method, for the multi-platform deployment of large Web application program. And Web web page code amountNumerous and diverse, the time of searching is long, and each incompatible label is separate, does not rely on each other, is applicable to very much using parallel search sideMethod, therefore, in carrying out incompatible tag location, is used in the pattern of MapReduce in label lookup process, does not hold concurrentlyThe search efficiency that holds label will improve. MapReduce is a kind of programming model, can be used for large-scale dataset (being greater than 1TB)Concurrent operation. MapReduce is a kind of programming model, can be used for the large-scale dataset concurrent operation of (being greater than 1TB),Specify Map(mapping) function, be used for one group of key-value pair to be mapped to one group of new key-value pair, specify concurrent Reduce(abbreviation) function, is used for ensureing that each in the key-value pair of all mappings shares identical key group.
As shown in Figure 1, the incompatible label parallel search of the webpage based on MapReduce provided by the invention method, comprises as followsStep:
Step 1: determine the code border that needs to carry out incompatible tag location in the source code of Web application.
Step 2: by the code decile of needs scanning or be divided into closely equably n piece, n is integer, and occurrence can be referred to by userFixed.
B code block is respectively with a describe < R of tripleb,b,Fb>, wherein RbWhat represent is that the total code of this code block is capableNumber, what b represented is code block number, and F represents code block current state, and value 0 or 1,0 is for scanning or carrying outScanning, 1 is the end of scan.
For example a total line number of section is the code of 378 row, now need to be divided into 10 parts according to specifying, so front 9 parts of code blocksCode line is 38 row, and the total line number of code of last 1 code block is 36 row. For last 1 code block, total code is capableNumber R10Be 36, code block b is 10.
Step 3: the code after cutting apart is assigned randomly on m platform machine and is processed.
Step 4: initialize structure labelContext, be used for preserving the needed parameter of the inventive method, comprise source code roadFootpath, the storing path of intermediate file, the number of map function, the number of reduce function, the path of incompatible tag library etc.Intermediate file is used for preserving the result that on every machine, operation code obtains, and finally also needs to gather the result of intermediate file.
The key data structure of structure labelContext is as follows:
LPVOID is a pointer type that there is no type, and DWORD is the data type of double byte.
Step 5: for each code block creates map function, now the F in the triple of code block is all set to 0.
Step 6: every machine, to distributed code block, scans label downwards.
Step 7: according to incompatible tag library, judge whether the label scanning is incompatible label, if so, performs step eight,Otherwise, execution step nine.
Incompatible tag library, according to Trie(word lookup tree) structure organization, can reduce meaningless character string to greatest extentRelatively, search efficiency is higher than Hash table. This institutional framework is the common prefix of having utilized character string simultaneously, saves memory space,And all very simple for increasing newly, delete and searching of incompatible label, be conducive to the expansion of incompatible tag library.
Taking IE browser IE6.0 and FireFox4.0 as example, according to existing W3C specification, open source information, document etc.,The incompatible label of summing up on the basis of previous work, the typical incompatible label of part is listed below:
1. a label! Important, FireFox can identify, and IE can not identify;
2. label innerText, FireFox can identify, and IE can not correctly identify;
In 3.FireFox, object character constant allows to occur unnecessary comma, and this is not allow in IE;
4. label Rgba, FireFox can identify, and IE can not identify;
5. label H SLT, FireFox can identify, and IE can not identify;
6. label Multiplebackgrounds, FireFox can identify, and IE can not identify;
7. label Opacity, FireFox can identify, and IE can not identify;
8. label C anvas, FireFox can identify, and IE can not identify;
9.event.x and event.y can identify in IE, and in FireFox, can only identify event.pageX and event.pageY;
10. the label of same purposes can only be identified XMLHttpRequest, and can only identify in IE in FireFoxActiveXObject；
11. label attributes, the analysis result of IE and FireFox is different;
Discernible label oncopy in 12. other IE, oncut, onpasteondragenter, ondragover, ondragleave,Ondrop etc. can not be identified in FireFox;
The institutional framework of incompatible tag library as shown in Figure 2, is a tree structure. For example, listed is here the mark of mentioningSign! Important, oncopy and opacity.
Judge whether label is incompatible label, and concrete grammar is: traversal code, find the label in code, and set upLabel in incompatible tag library is compared, and comparing consistent is incompatible label, if compare unsuccessful, label compatibility.
Incompatible label of the present invention, refers to the difference due to the analytics engine of browser, causes Web to be applied in differenceWhile migration on platform, different browsers has different explanations, even exists part label not identify for part browserSituation, thus cause same interface on different browsers, to have different display effects.
Step 8: if incompatible label, record the position at this incompatible label place in intermediate file, label placeThree Parametric Representations for position: line number r, the columns c at label place and the code block b at label place; Then carry out stepRapid nine.
Step 9: judge the whether end of scan of current code block, if finish, the parameter F in this code block triple is set to 1;If no, return to step 6, continue to carry out.
Step 10: judge that whether all code blocks have all finished scanning, if finish, enter step 11, otherwise wait for other generationThe end of scan of code block, and then execution step 11.
Step 11: all intermediate files, by Reduce function, according to the position at the label place of record, calculate the reality of labelPosition, border.
The actual calculation of location method of each incompatible label is: the position of establishing certain incompatible label is (r, c, b), and this is notThe physical location of compatible label is (SUM (R1，R2，…，Rb-1, r), c). SUM represents summation, R1，R2，…，Rb-1Represent respectively the 1st code block, the 2nd code block ..., a b-1 code block lines of code.
Step 12: the information that merges same label;
Step 13: the incompatible label after merging and the position at label place are put into Hash set container hash_set, andReturn to user.
Below by a running example, method of the present invention is further described and is verified.
As shown in Figure 3, first required necessary parameter information is set, obtains after parameter information, program starts to carry out, Fig. 4Part running log (log) information sectional drawing term of execution of being. Below the partial log shown in Fig. 4 is described.
2011-11-2617:46:56org.apache.hadoop.mapred.MapTask$MapOutputBufferflush
Information: Startingflushofmapoutput
// information in buffer memory is write in the output of map
2011-11-2617:46:56org.apache.hadoop.mapred.MapTask$MapOutputBufferwriteIndexRecord
Information: Index:(0,2,6)
// label information
2011-11-2617:46:56org.apache.hadoop.mapred.Taskdone
Information: Task:attempt_local_0001_m_000033_0isdone.Andisintheproce ssofcommiting
// task attempt_local_0001_m_000033_0(note: the incompatible label of a certain block code of cutting apart is looked intoLook for) complete, in submit state
2011-11-2617:46:56org.apache.hadoop.mapred.LocalJobRunner$JobstatusUpdate
Information: file:/home/administrator/input/dao.html:0+1031
// transaction file state
2011-11-2617:46:56org.apache.hadoop.mapred.TasksendDone
Information: Task'attempt_local_0001_m_000033_0'done
// task attempt_local_0001_m_000033_0 finishes
More than be depicted as the complete of a code block.
After program is finished, because final result is HDFS(HadoopDistributedFileSystem) data of formForm, need to use HDFS order, and the Shell under use Linux carries out data to be checked.
Shown in Fig. 5 is operation result. Operation result document is stored under the part-00000 document under destination file folder, Chu GeFormula is the SequenceFile form of HDFS file system, is a kind of binary form. Can be by means of the document of HDFSViewing command :/bin/hadoopdfs – cat/ destination folder/part-00000, checks document. By calling the parsing of HDFSAbility, resolves destination document, and the form making it reading is presented under shell.
The form of the document in Shell is: the capable information of Label (line number, row number). Wherein label is the information of label, row letterBreath is the word content of the row at this label place.
For example, [<event></event>] xxx[572,16], wherein xxx information can be ignored, and the information of this row content representation is,The position that incompatible label event occurs is the 16th row of the 572nd row.
Claims (2)
1. the incompatible label parallel search of the webpage based on a MapReduce method, is characterized in that, described lookup methodComprise the steps:
Step 1: determine the code border that needs to carry out incompatible tag location in the source code of Web application;
Step 2: the code of needs scanning is divided into n piece closely equably, and n is integer, and every part of code is retouched by a tripleState<R B, F>, wherein R represents the total code line number of code block, and B represents code block number, and F represents code block current state, FValue 0 or 1,0 is for scanning or scanning, and 1 is the end of scan;
Step 3: the code after cutting apart is assigned randomly on m platform machine and is processed;
Step 4: initialize structure labelContext, comprise source code path in structure labelContext, intermediate fileStoring path, the number of map function, the number of reduce function, and the path of incompatible tag library;
Step 5: be that each code block creates map function, and the F arranging in the triple of code block is 0;
Step 6: every machine, to distributed code block, starts scanning label downwards;
Step 7: according to incompatible tag library, judge whether the label scanning is incompatible label, if so, performs step eight,Otherwise, execution step nine;
Step 8: record the position at incompatible label place in intermediate file, three Parametric Representations for the position at label place:Line number r, the columns c at label place and the code block b at label place, then perform step nine;
Step 9: judge the whether end of scan of current code block, if finish, the parameter F in this code block triple is set to 1;If no, return to step 6, continue to carry out;
Step 10: judge whether all code blocks have all finished scanning, if finish, execution step 11, otherwise wait for other generationThe end of scan of code block, and then execution step 11;
Step 11: all intermediate files, by Reduce function, according to the position at the incompatible label place of record, calculate eachThe physical location of incompatible label;
The computational methods of the physical location of each incompatible label are: the position of establishing certain incompatible label is (r, c, b), shouldThe physical location of incompatible label is (SUM (R1，R2，…，Rb-1, r), c); Wherein, SUM represents summation, R1，R2，…，Rb-1Represent respectively the 1st code block, the 2nd code block ..., a b-1 code block lines of code;
Step 12: the information that merges same label;
Step 13: the incompatible label after merging and the position at label place are put into Hash set container, and return to useFamily.
2. the incompatible label parallel search of the webpage based on MapReduce according to claim 1 method, its feature existsIn, the incompatible tag library in described step 7, according to the structure organization of word lookup tree.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310359420.4A CN103440289B (en) | 2013-08-16 | 2013-08-16 | The incompatible label parallel search of webpage method based on MapReduce |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310359420.4A CN103440289B (en) | 2013-08-16 | 2013-08-16 | The incompatible label parallel search of webpage method based on MapReduce |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103440289A CN103440289A (en) | 2013-12-11 |
| CN103440289B true CN103440289B (en) | 2016-05-18 |
Family
ID=49693981
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310359420.4A Expired - Fee Related CN103440289B (en) | 2013-08-16 | 2013-08-16 | The incompatible label parallel search of webpage method based on MapReduce |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103440289B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105989054A (en) * | 2015-02-06 | 2016-10-05 | 北京神州泰岳软件股份有限公司 | Method and device for managing client-side data |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102541533A (en) * | 2010-12-27 | 2012-07-04 | 北大方正集团有限公司 | Method and equipment for page display |
| CN102567366A (en) * | 2010-12-27 | 2012-07-11 | 盛乐信息技术（上海）有限公司 | Method for realizing webpage resetting |
| CN102637135A (en) * | 2011-02-09 | 2012-08-15 | 北京千橡网景科技发展有限公司 | Method and device for compiling CSS (cascading style sheet) |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7818681B2 (en) * | 2007-06-28 | 2010-10-19 | International Business Machines Corporation | Method and system for internally identifying a specific web browser for displaying a specific web page |
-
2013
- 2013-08-16 CN CN201310359420.4A patent/CN103440289B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102541533A (en) * | 2010-12-27 | 2012-07-04 | 北大方正集团有限公司 | Method and equipment for page display |
| CN102567366A (en) * | 2010-12-27 | 2012-07-11 | 盛乐信息技术（上海）有限公司 | Method for realizing webpage resetting |
| CN102637135A (en) * | 2011-02-09 | 2012-08-15 | 北京千橡网景科技发展有限公司 | Method and device for compiling CSS (cascading style sheet) |
Non-Patent Citations (2)
| Title |
|---|
| 基于模型的万维应用软件网页自动规范化的重构工具的设计与实现;陈耀森;《中国优秀硕士学位论文全文数据库（电子期刊）》;20120415;全文 * |
| 高校图书馆网站对浏览器兼容性测试;游强华等;《图书馆杂志》;20111031;第30卷(第10期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103440289A (en) | 2013-12-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108399256B (en) | Heterogeneous database content synchronization method and device and middleware | |
| US7720814B2 (en) | Repopulating a database with document content | |
| CN107766130A (en) | The method and apparatus that virtual machine migrates to container | |
| CN107122187A (en) | A kind of operation system OS accesses design method | |
| WO2020259141A1 (en) | File processing method and apparatus, and computer device | |
| CN112860777B (en) | Data processing method, device and equipment | |
| Andhavarapu | Learning Elasticsearch | |
| CN101251799B (en) | Apparatus and method for implementing management | |
| US7694315B2 (en) | Schema-based machine generated programming models | |
| CN113177168A (en) | Positioning method based on Web element attribute characteristics | |
| CN115935944A (en) | Cross-platform standard file tree structure generation method and display control | |
| CN111367890A (en) | Data migration method and device, computer equipment and readable storage medium | |
| CN103440289B (en) | The incompatible label parallel search of webpage method based on MapReduce | |
| US11010140B2 (en) | Integration of workflow and logical data objects using visual programming | |
| CN116400914A (en) | Method for quickly constructing web application based on data model | |
| US10649743B2 (en) | Application developing method and system | |
| CN113254455B (en) | Dynamic configuration method and device of database, computer equipment and storage medium | |
| CN114968725A (en) | Task dependency relationship correction method and device, computer equipment and storage medium | |
| CN114356403A (en) | Configuration data processing method, device and system based on low-code application development | |
| US8719693B2 (en) | Method for storing localized XML document values | |
| JP2018109898A (en) | Data migration system | |
| Collins | Pro HTML5 with Visual Studio 2015 | |
| EP2972666B1 (en) | Visualization interface for information object system | |
| CN113761040A (en) | Database and application program bidirectional mapping method, device, medium and program product | |
| CN115812198A (en) | Consistent entity tagging with multi-protocol data access |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB03 | Change of inventor or designer information |
Inventor after: Li Rui Inventor after: Lv Jianghua Inventor after: Ma Shilong Inventor before: Li Rui Inventor before: Ma Shilong |
|
| COR | Change of bibliographic data | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160518 Termination date: 20200816 |