CN101430657A - Continuous data protection method - Google Patents
Continuous data protection method Download PDFInfo
- Publication number
- CN101430657A CN101430657A CNA2008101976595A CN200810197659A CN101430657A CN 101430657 A CN101430657 A CN 101430657A CN A2008101976595 A CNA2008101976595 A CN A2008101976595A CN 200810197659 A CN200810197659 A CN 200810197659A CN 101430657 A CN101430657 A CN 101430657A
- Authority
- CN
- China
- Prior art keywords
- data
- snapshot
- time
- point
- circleplus
- 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
Images
Abstract
The invention discloses a continuous data protection method. In the method, the time cost and the space cost are compressively considered, and an exclusive or operation is carried out on all write operation data blocks of the previous version and the current versions. Most of data bit values of the data blocks are zero after the exclusive or operation according to a read-write principle of locality, and then a check value is compressed by a compression algorithm, which can greatly save a storage space recording write operation logs, and the storage space is 1/20 to 1/30 of that of a previous recording mode. In addition, a snapshot mechanism is periodically introduced during recording, which causes data to be recovered to a nearest snapshot point, and then to a given time point, thus significantly improving the data recovery efficiency, solving a 'pollution' problem as an exclusive or check data chain is too long, and improving the data recovery reliability. The method helps realize the continuous data protection at the data block levels in the true sense, is characterized by the block-level efficient recovery, and has the advantages of low storage space overhead and low system performance influence.
Description
Technical field
The invention belongs to field of data storage, be specifically related to a kind of continuous data protection method efficiently, this method can not only effectively realize other protection requirement of block level, and it is less to have data volume, the characteristics that release time is fast.
Background technology
Though system for computer is more and more stable, various accidents still inevitably can take place, and cause losing of data.How after accident takes place, to obtain correct data in the past, become the research contents of data protection.Traditional data guard method has periodic data backup and snapping technique, and the data degradation after these technology can accident take place is reduced in the certain limit, for example: can be reduced to the data volume that is no more than backup window at most.Traditional data guard method has advantages such as have wide range of applications and Restoration Mechanism is simple, can realize at piece level, file system level and application layer.But; under the very big situation of data volume, traditional data guard method can produce frequent backup and snapshot operation, can have a strong impact on the data-handling capacity of the regular traffic of system like this; and can produce huge storage space expense, therefore be not suitable as real-time data protection mechanism.Therefore, in order to ensure the greater security of data, the user must carry out online in real time to on-line system and duplicate, and adopts disk management technology such as snapshot to keep the high availability of data as much as possible, needs to increase expense greatly so again.
Another kind of data guard method commonly used is the FileVersion controlling mechanism; it is carried out in file-level; by the history of file operation (create, deletion, rewrite) is carried out log record, and file can be returned to the virgin state of indicated release by these daily records.But these mechanism all are relevant with specific file system, are not suitable for directly applying to the data platform of being made up of a plurality of file system and Database Systems.
Because the defective of traditional data method, many researchists wish to design a kind of continuous data protection truly.Continuous data protection (Continue Data Protect) be a kind of catch continuously and preserve data variation, and will change after data be independent of the method that primary data is preserved, and this method can realize over the data recovery of any one time point.According to the definition of CDP, all CDP solutions all should possess following basic characteristic: the change of (1) data is subjected to continuous catching and following the tracks of; (2) all data changes all are stored in the independent place different with the primary storage place; (3) recovery point objectives is arbitrarily, and need be before reality not be recovered predefined.CDP can provide faster data retrieval, stronger data protection and the business continuance ability of Geng Gao, and compares with traditional backup solution, and overall cost and the complicacy of CDP are all low.
Although the past has had the researchist to propose the number of C DP algorithm, there are following two main deficiencies in the existing C DP algorithm: (1) takes up room greatly.For example: each write operation is carried out full backup, and this is with the space of consume significant; (2) range of application is narrow.As the FileVersion controlling mechanism, it comes the modification of log file data by the method for artificial or automatic spanned file version, file can be returned to the virgin state of indicated release.But this all is relevant with specific file system, does not have the versatility that storage is used.
Summary of the invention
The object of the present invention is to provide a kind of continuous data protection method; this method can realize truly other continuous data protection of block level; both had the characteristics that piece level high-level efficiency is recovered, also had the advantage of low storage space expense, low system performance influence.
Continuous data protection method provided by the invention mainly comprises recording process and rejuvenation.Recording process comprises step (A1)～(A10), and rejuvenation comprises step (C1)～(C7).
(A1) read write command of interception system if write operation forwards step (A3) to, otherwise enters step (A2);
(A2) all read operations are carried out by former mode, changed over to (A10);
(A3) establishing the current time is T (m), and m is the internal system time, establishes this write operation to liking data block B, and the current content of writing is B
T (m), it is B that write operation is wanted the content of overlay area
T (m-1)Judge whether reach the snapshot trigger condition this moment, if reach, forward step (A8) to, otherwise enter step (A4);
(A4) read the content B that wants the overlay area
T (m-1), calculate exclusive or check value P
T (m), wherein,
(A5) to the data P after the computing in the step (A4)
T (m)Add time stamp T (m);
(A6) data that previous step is obtained are inserted the proof test value log chain by the timestamp order, forward step (A9) to;
(A8) with original write operation content B
T (m)After adding time stamp T (m), be inserted into snapshot log chain or described proof test value log chain;
(A9) carry out normal write operation;
(A10) if system also has read-write operation, change step (A1) over to, otherwise the end record process;
(C1) release time is put T (r) in input, and wherein, r is the internal system time of input;
(C2) judge and to put T (r) and to have or not the snapshot point input time that if snapshot is arranged, the time of establishing this snapshot point is T (k), k=r then, k is the internal system time of this snapshot point, enters step (C3), otherwise forwards step (C4) to;
(C3) find the pairing data B of snapshot time point T (k) (k), return to time point T (r), forward step (C7) to B (k);
(C4), definite from the nearest snapshot point B of some release time according to the length of r to nearest two the snapshot point time spans in front and back
T (k), when k＜r, promptly corresponding snapshot time point forwards step (C6) to, as k early than some release time〉and during r, promptly corresponding snapshot time point is later than when putting release time, enters step (C5);
(C5) at first return to resulting snapshot point B in the step (C4)
T (k), utilize formula (I) to carry out forward recovery again, the data block B when finally returning to user's fixed time point T (r)
T (r), forward step (C7) then to;
(C6) at first return to resulting snapshot point B in the step (C4)
T (k), utilize formula (II) oppositely to recover again, the data block B when finally returning to user's fixed time point T (r)
T (r), forward step (C7) then to;
(C7) rejuvenation is finished.
The present invention is a kind of continuous data protection algorithm of taking all factors into consideration time and space cost; its main thought is to utilize the locality of data block write operation; promptly for each data block, average data change amount is very little before and after writing usually, has only 5%～20% variation according to statistical average.Therefore, at first the data block of writing former and later two versions is carried out xor operation, most data bit are 0 among the XOR result, adopt compression algorithm that the XOR result is compressed then, can greatly save the storage space of record write operation daily record.Introduce regular snapshot mechanism in addition, can significantly improve the efficient of data recovery and the reliability of restore data.Be that with more existing data protection technology differences it has realized truly other continuous data protection of block level, both had the characteristics that piece level high-level efficiency is recovered, also have the advantage of low storage space expense, low system performance influence.
Description of drawings
The process synoptic diagram that Fig. 1 writes down for the inventive method;
The process synoptic diagram that Fig. 2 recovers for the inventive method;
Fig. 3 is for inserting the snapshot processes synoptic diagram;
Fig. 4 is that snapshot directly recovers used schematic diagram data;
Fig. 5 adds the used schematic diagram data of forward recovery for snapshot;
Fig. 6 is the used schematic diagram data of reverse recovery for snapshot adds.
Embodiment
The inventive method comprises recording process and rejuvenation, below in conjunction with accompanying drawing and example invention is described in further detail.
As shown in Figure 1, the recording process of the inventive method comprises the steps:
(A1) read write command of interception system if write operation forwards step (A3) to, otherwise enters step (A2).
(A2) all read operations are carried out by former mode, changed over to (A10).
(A3) establishing the current time is T (m), and m is the internal system time, and T is the function of m, the time of T (m) expression user perspective, establish this write operation to liking data block B, and the current content of writing is B
T (m), it is B that write operation is wanted the content of overlay area
T (m-1)Judge whether log chain reaches trigger condition d, reach and forward step (A8) to, otherwise enter step (A4).Wherein, d by requiring to determine jointly with release time between the log chain buffer empty, is adjustable parameter according to system loading conditions, is generally 60～90.When block size is 4k, when total memory capacity was 1T, the preferred value of d was 77.
(A4) read the content B that wants the overlay area
T (m-1), calculate exclusive or check value P
T (m), wherein,
(A5) to the data P after the computing in the step (A4)
T (m)Add time stamp T (m).
(A6) use compression algorithm that resulting data in the step (A5) are compressed, the data of establishing after the compression are P '
T (m)
Compression algorithm can adopt the compression algorithm zlib that increases income to realize, also can adopt other universal compressed algorithm.
(A7) with the data P ' that obtains in the step (A6)
T (m)Press the timestamp order and insert proof test value log chain P '
T (m), P '
T (m-1)..., P '
T (1), P '
T (0), forward step (A9) to
(A8) with original write operation content B
T (m)Add time stamp T (m), insert the proof test value log chain.As shown in Figure 3, B
T (m)For original write operation data are snapshot data, d is an indication trigger condition in (A3) among the t (d), and t is the function of d, and t (d) refers to reach once more the time that trigger condition d is experienced.B
T (m)-t (d)The piece of being write when referring to reach trigger condition last time.B
T (m), B
T (m)-t (d)In chronological sequence order is inserted in the log chain of being made up of proof test value P '.
(A9) carry out normal write operation;
(A10), change step (A1) over to, otherwise finish if system also has read-write operation.
Mode is formed in storage for log chain among (A7), (A8):
Preferably, check block data and snapshot data only need to keep corresponding relation, physically separate storage on time sequencing.Promptly have two chains, proof test value log chain and snapshot log chain are by corresponding relation, proof test value log chain and the snapshot log chain separate storage on two chain time sequencings of metadata maintenance.
As an alternative, can proof test value and snapshot data be placed on storage and uniform in the same log chain in strict accordance with time sequencing.
For the packed data selection on opportunity:
The present invention can be as shown in above recording process, is that unit compresses with the data block in processing procedure.
Preferably, can be that unit carries out reduced overall with the file to log chain when the storing daily record chain or behind the storing daily record chain.Can make recording process and compression process separately like this, improve the efficient of input-output operation.
As shown in Figure 2, the rejuvenation of the inventive method comprises the steps:
(C1) release time is put T (r) in input, and wherein together, r is the internal system time of input, and T is the function of r, the time of T (r) expression user perspective.
(C2) judge that putting T (r) input time has or not the snapshot point, if snapshot is arranged, the time of establishing this snapshot point is T (k), k=r then, k is the function of k for the internal system time of this snapshot point, T, the time of T (k) expression user perspective, enter step (C3), otherwise forward step (C4) to.
(C3) adopt the snapshot of time point T (k) to recover.As shown in Figure 4, find the data B (k) of corresponding snapshot time point T (k), return to time point T (r), forward step (C7) to B (k).
(C4) arrive nearest two snapshot point time span length according to r, definite from the nearest snapshot point B of some release time
T (k)When k＜r, promptly corresponding snapshot time point forwards step (C6) to, as k early than some release time〉during r, promptly corresponding snapshot time point is later than when putting release time, enters step (C5)
(C5) at first return to resulting snapshot point B in the step (C4)
T (k), utilize formula (1) to carry out forward recovery again, the data block B when finally returning to user's fixed time point T (r)
T (r), forward step (C7) then to.
As shown in Figure 5, return to nearest snapshot point B earlier
T (k), and then by recovering chain (P
T (k), P
T (k-1)..., P
T (r+2), P
T (r+1)) recover.
(C6) at first return to resulting snapshot point B in the step (C4)
T (k), utilize formula (2) oppositely to recover again, the data block B when finally returning to user's fixed time point T (r)
T (r)Forward step (C7) then to.
As shown in Figure 6, return to nearest snapshot point B earlier
T (k), and then by recovering chain (P
T (r), P
T (r-1)..., P
T (k+2), P
T (k+1)) recover.
(C7) recover to finish.
The above is preferred embodiment of the present invention, but the present invention should not be confined to the disclosed content of this embodiment and accompanying drawing.So everyly do not break away from the equivalence of finishing under the spirit disclosed in this invention or revise, all fall into the scope of protection of the invention.
Claims (3)
1, a kind of continuous data protection method comprises recording process and rejuvenation, and recording process comprises step (A1)～(A10), and rejuvenation comprises step (C1)～(C7);
(A1) read write command of interception system if write operation forwards step (A3) to, otherwise enters step (A2);
(A2) all read operations are carried out by former mode, changed over to (A10);
(A3) establishing the current time is T (m), and m is the internal system time, establishes this write operation to liking data block B, and the current content of writing is B
T (m), it is B that write operation is wanted the content of overlay area
T (m-1)Judge whether log chain reaches trigger condition, reach and forward step (A8) to, otherwise enter step (A4);
(A4) read the content B that wants the overlay area
T (m-1), calculate exclusive or check value P
T (m), wherein,
(A5) to the data P after the computing in the step (A4)
T (m)Add time stamp T (m);
(A6) data that previous step is obtained are inserted the proof test value log chain by the timestamp order, forward step (A9) to;
(A8) with original write operation content B
T (m)Add time stamp T (m), insert snapshot log chain or described proof test value log chain again;
(A9) carry out normal write operation;
(A10) if system also has read-write operation, change step (A1) over to, otherwise the end record process;
(C1) release time is put T (r) in input, and wherein, r is the internal system time of input;
(C2) judge and to put T (r) and to have or not the snapshot point input time that if snapshot is arranged, the time of establishing this snapshot point is T (k), k=r then, k is the internal system time of this snapshot point, enters step (C3), otherwise forwards step (C4) to;
(C3) find the data B (k) of corresponding snapshot time point T (k), return to time point T (r), forward step (C7) to B (k);
(C4) arrive nearest two snapshot point time span length according to r, definite from the nearest snapshot point B of some release time
T (k), when k＜r, promptly corresponding snapshot time point forwards step (C6) to, as k early than some release time〉and during r, promptly corresponding snapshot time point is later than when putting release time, enters step (C5);
(C5) at first return to resulting snapshot point B in the step (C4)
T (k), utilize formula (I) to carry out forward recovery again, the data block B when finally returning to user's fixed time point T (r)
T (r), forward step (C7) then to;
(C6) at first return to resulting snapshot point B in the step (C4)
T (k), utilize formula (II) oppositely to recover again, the data block B when finally returning to user's fixed time point T (r)
T (r), forward step (C7) then to;
(C7) rejuvenation is finished.
2, continuous data protection method according to claim 1 is characterized in that: data block in the recording process is carried out the proof test value log chain that XOR obtains, and insert original block formation snapshot log chain in the proof test value log chain.At last these two chains are compressed.
3, continuous data protection method according to claim 1 is characterized in that: after step (A5) is finished, use compression algorithm that resulting data in the step (A5) are compressed, the data after obtaining compressing are P '
T (m)Data as next step processing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101976595A CN101430657B (en) | 2008-11-17 | 2008-11-17 | Continuous data protection method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101976595A CN101430657B (en) | 2008-11-17 | 2008-11-17 | Continuous data protection method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101430657A true CN101430657A (en) | 2009-05-13 |
| CN101430657B CN101430657B (en) | 2011-10-26 |
Family
ID=40646064
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101976595A Expired - Fee Related CN101430657B (en) | 2008-11-17 | 2008-11-17 | Continuous data protection method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101430657B (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102193845A (en) * | 2011-05-30 | 2011-09-21 | 华中科技大学 | Data recovery method |
| CN102279778A (en) * | 2011-08-29 | 2011-12-14 | 华中科技大学 | File-level continuous data protection method having pre-recovery function |
| CN101777017B (en) * | 2010-02-08 | 2012-04-25 | 北京同有飞骥科技股份有限公司 | Rapid recovery method of continuous data protection system |
| CN101661415B (en) * | 2009-09-21 | 2012-07-11 | 中兴通讯股份有限公司 | Method for memorizing snapshot data and system for memorizing snapshot |
| CN103221925A (en) * | 2012-11-23 | 2013-07-24 | 华为技术有限公司 | Data processing method and storage equipment |
| CN103778030A (en) * | 2013-12-30 | 2014-05-07 | 上海晨思电子科技有限公司 | Write-in method, error tracking method and processor for blog subsystem |
| CN104102554A (en) * | 2013-04-07 | 2014-10-15 | 杭州信核数据科技有限公司 | Data backup method and data backup device |
| CN107798063A (en) * | 2017-09-20 | 2018-03-13 | 华为技术有限公司 | Snap processing method and snapshot processing unit |
| CN107967188A (en) * | 2016-10-18 | 2018-04-27 | 腾讯科技（深圳）有限公司 | Treating method and apparatus in data storage |
| CN108959614A (en) * | 2018-07-17 | 2018-12-07 | 郑州云海信息技术有限公司 | A kind of snapshot management method, system, device, equipment and readable storage medium storing program for executing |
| CN108959639A (en) * | 2018-07-26 | 2018-12-07 | 郑州云海信息技术有限公司 | A kind of data guard method, device, terminal and computer readable storage medium |
| CN109815303A (en) * | 2018-12-29 | 2019-05-28 | 哈尔滨工业大学（深圳） | A kind of location-based mobile data storage system |
| CN110134551A (en) * | 2019-05-21 | 2019-08-16 | 上海英方软件股份有限公司 | A kind of continuous data protection method and device |
| CN111338845A (en) * | 2020-02-16 | 2020-06-26 | 西安奥卡云数据科技有限公司 | Fine-grained local data protection method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7603392B2 (en) * | 2006-06-05 | 2009-10-13 | International Business Machines Corporation | System, method and computer program product for storing transient state information |
-
2008
- 2008-11-17 CN CN2008101976595A patent/CN101430657B/en not_active Expired - Fee Related
Cited By (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101661415B (en) * | 2009-09-21 | 2012-07-11 | 中兴通讯股份有限公司 | Method for memorizing snapshot data and system for memorizing snapshot |
| CN101777017B (en) * | 2010-02-08 | 2012-04-25 | 北京同有飞骥科技股份有限公司 | Rapid recovery method of continuous data protection system |
| CN102193845B (en) * | 2011-05-30 | 2012-12-19 | 华中科技大学 | Data recovery method |
| CN102193845A (en) * | 2011-05-30 | 2011-09-21 | 华中科技大学 | Data recovery method |
| CN102279778A (en) * | 2011-08-29 | 2011-12-14 | 华中科技大学 | File-level continuous data protection method having pre-recovery function |
| CN103221925A (en) * | 2012-11-23 | 2013-07-24 | 华为技术有限公司 | Data processing method and storage equipment |
| WO2014079028A1 (en) * | 2012-11-23 | 2014-05-30 | 华为技术有限公司 | Data processing method and storage device |
| CN104102554B (en) * | 2013-04-07 | 2017-05-03 | 杭州信核数据科技股份有限公司 | Data backup method and data backup device |
| CN104102554A (en) * | 2013-04-07 | 2014-10-15 | 杭州信核数据科技有限公司 | Data backup method and data backup device |
| US9727411B2 (en) | 2013-12-30 | 2017-08-08 | Mstar Semiconductor, Inc. | Method and processor for writing and error tracking in a log subsystem of a file system |
| CN103778030A (en) * | 2013-12-30 | 2014-05-07 | 上海晨思电子科技有限公司 | Write-in method, error tracking method and processor for blog subsystem |
| CN103778030B (en) * | 2013-12-30 | 2017-09-22 | 上海晨思电子科技有限公司 | Daily record subsystem wiring method, error tracking method and processor |
| CN107967188B (en) * | 2016-10-18 | 2020-06-16 | 腾讯科技（深圳）有限公司 | Processing method and device in data storage |
| CN107967188A (en) * | 2016-10-18 | 2018-04-27 | 腾讯科技（深圳）有限公司 | Treating method and apparatus in data storage |
| CN107798063A (en) * | 2017-09-20 | 2018-03-13 | 华为技术有限公司 | Snap processing method and snapshot processing unit |
| CN107798063B (en) * | 2017-09-20 | 2020-12-15 | 华为技术有限公司 | Snapshot processing method and snapshot processing device |
| CN108959614A (en) * | 2018-07-17 | 2018-12-07 | 郑州云海信息技术有限公司 | A kind of snapshot management method, system, device, equipment and readable storage medium storing program for executing |
| CN108959639A (en) * | 2018-07-26 | 2018-12-07 | 郑州云海信息技术有限公司 | A kind of data guard method, device, terminal and computer readable storage medium |
| CN109815303A (en) * | 2018-12-29 | 2019-05-28 | 哈尔滨工业大学（深圳） | A kind of location-based mobile data storage system |
| CN110134551A (en) * | 2019-05-21 | 2019-08-16 | 上海英方软件股份有限公司 | A kind of continuous data protection method and device |
| CN110134551B (en) * | 2019-05-21 | 2020-04-17 | 上海英方软件股份有限公司 | Continuous data protection method and device |
| CN111338845A (en) * | 2020-02-16 | 2020-06-26 | 西安奥卡云数据科技有限公司 | Fine-grained local data protection method |
| CN111338845B (en) * | 2020-02-16 | 2021-05-07 | 西安奥卡云数据科技有限公司 | Fine-grained local data protection method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101430657B (en) | 2011-10-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101430657B (en) | Continuous data protection method | |
| CN102521269B (en) | Index-based computer continuous data protection method | |
| US7457980B2 (en) | Data replication method over a limited bandwidth network by mirroring parities | |
| US8612707B2 (en) | Continuous data protection over intermittent connections, such as continuous data backup for laptops or wireless devices | |
| US11016858B2 (en) | Systems and methods for managing single instancing data | |
| US7676502B2 (en) | Recovery point data view shift through a direction-agnostic roll algorithm | |
| US11593217B2 (en) | Systems and methods for managing single instancing data | |
| CN102508785B (en) | A kind of abrasion equilibrium method and device | |
| CN103019887B (en) | Data back up method and device | |
| CN101453489B (en) | Network additive storage device, data backup and data restoration method thereof | |
| CN106407224B (en) | The method and apparatus of file compacting in a kind of key assignments storage system | |
| CN107678892B (en) | Continuous data protection method based on jump recovery chain | |
| CN106569748A (en) | Data processing method and device for Flash file system | |
| CN102779080B (en) | Method for generating snapshot, method and device for data recovery by using snapshot | |
| CN102799514A (en) | Method and system for managing log records | |
| CN109445702A (en) | A kind of piece of grade data deduplication storage | |
| US8527470B2 (en) | Recovery point data view formation with generation of a recovery view and a coalesce policy | |
| CN109683825B (en) | Storage system online data compression method, device and equipment | |
| CN104504116A (en) | Storage method of real-time database | |
| CN101707633A (en) | Message-oriented middleware persistent message storing method based on file system | |
| CN113626431A (en) | LSM tree-based key value separation storage method and system for delaying garbage recovery | |
| CN104050057B (en) | Historical sensed data duplicate removal fragment eliminating method and system | |
| US20100169281A1 (en) | Coalescing and capturing data between events prior to and after a temporal window | |
| CN105447168A (en) | Method for restoring and recombining fragmented files in MP4 format | |
| CN102981977A (en) | Data storage method capable of prolonging service life of abode flash player (FLASH) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| 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: 20111026 Termination date: 20211117 |