CN103761167A - Method and device for achieving data center backup - Google Patents
Method and device for achieving data center backup Download PDFInfo
- Publication number
- CN103761167A CN103761167A CN201410032550.1A CN201410032550A CN103761167A CN 103761167 A CN103761167 A CN 103761167A CN 201410032550 A CN201410032550 A CN 201410032550A CN 103761167 A CN103761167 A CN 103761167A
- Authority
- CN
- China
- Prior art keywords
- cryptographic hash
- back end
- frame
- data block
- physical address
- 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 provides a method and device for achieving data center backup. The method for achieving data center backup comprises the steps that according to the name of a table where a data block to be backed up is located and the name of a column family where the data block is located, the storage range of the data block in a target data center is determined; the data block is stored in one data node selected from the determined storage range. The method and device for achieving data center backup solve the problem that when Hbase data backup across data centers is conducted, the data blocks with the same column family name are stored in a dispersed mode, so that storage of the data blocks which are backed up to the target data center and have the same column family name is concentrated better, and therefore the reading speed is improved.
Description
Technical field
The present invention relates to large data field, relate in particular to a kind of backup method and device of the data center based on Hbase.
Background technology
The data storage of Hbase is the storage of the distributed document based on Hadoop (HDFS normally, Hadoop Distributed File System), while carrying out data storage in HDFS Yuan data center, conventionally to back up, three parts of acquiescence backups, wherein, two parts of backups are in belonging to two different back end of same machine frame, and a backup is in belonging to a back end of other frames different from above-mentioned frame in addition., when guaranteeing that data center breaks down, still can normally work meanwhile, need to back up data center.
The existing method that realizes data center's backup comprises:
Obtain data block to be backed up in former data center; In target data, select at random 1 back end to data block backup in the heart in target data in the heart, then according to existing backup method, select two other back end to back up.
Above-mentioned date storage method is due to when carrying out data center's backup, 1 back end at target data center is random selection, and the storage of the data of Hbase is stored based on row family data, in Ji Yuan data center, by belonging in form in the set of data blocks of same row family data, be stored in same back end or contiguous several back end, like this when carrying out data while reading, need to search all back end at this row Praenomen place according to the data column Praenomen reading, the back end finding is likely distributed in all back end at target data center.While making to adopt said method to carry out Hbase across data center's data backup, can not make full use of the feature of row family storage, cause in target data in the heart, the problem such as the storage of the data block of same row Praenomen disperses, discontinuous, thus cause reading speed slower.
Summary of the invention
In order to solve the problems of the technologies described above, the present invention proposes a kind of backup method and device of data center, can make full use of the feature of row family storage, the data block storage of same row Praenomen that makes to backup to destination data center is more concentrated, thereby improves reading speed.
In order to achieve the above object, the present invention proposes a kind of method that realizes data center's backup, comprising:
According to data block place table name to be backed up and row Praenomen, determine this data block memory range in the heart in target data;
In definite memory range, choose a back end storage data block.
Preferably, the described data block place table name backing up as required and row Praenomen, determine that this data block memory range in the heart in target data comprises:
According to described table name, determine the scope of the back end place frame of described data block storage;
According to described row Praenomen, determine the range of physical addresses of described back end;
Described one of them back end storage data block of choosing from memory range comprises:
From the scope of described frame, select a frame, from described range of physical addresses, select a physical address.
Preferably, describedly according to described table name, determine that the scope of the back end place frame of described data block storage comprises:
Calculate the cryptographic hash of described table name, and calculate respectively in target data the cryptographic hash of all frames in the heart;
The scope of determining the cryptographic hash of described frame is: the absolute value of the difference between the cryptographic hash of described frame and the cryptographic hash of described table name is less than or equal in target data the peaked preset ratio of the cryptographic hash of all frames in the heart;
Wherein, in former data center the maximal value of the cryptographic hash of all table names with in target data in the heart the maximal value of the cryptographic hash of all frames equate.
Preferably, described one of them back end storage data block of choosing from memory range comprises:
A frame of random selection from the scope of described frame, or the selection frame corresponding with the cryptographic hash of the absolute value minimum of the difference of the cryptographic hash of described table name.
Preferably, describedly according to described row Praenomen, determine that the range of physical addresses of described back end comprises:
Calculate the cryptographic hash of described row Praenomen, and calculate respectively the cryptographic hash of the physical address of all back end in selected frame;
The scope of determining the cryptographic hash of described physical address is: the absolute value of the difference between the cryptographic hash of described physical address and the cryptographic hash of described row Praenomen is less than or equal to the peaked preset ratio of the cryptographic hash of the physical address of all back end in selected frame; Wherein, in the table that described table name is corresponding, the maximal value of the cryptographic hash of all row Praenomens equates with the maximal value of the cryptographic hash of the physical address of all back end in selected frame.
Preferably, described one of them back end storage data block of choosing from memory range comprises:
A back end that physical address is corresponding of random selection from described range of physical addresses, or selection back end corresponding to physical address corresponding with the cryptographic hash of the absolute value minimum of the difference of the cryptographic hash of described row Praenomen.
Preferably, described maximal value is 2 π.
The invention allows for a kind of device of realizing data center's backup, at least comprise:
Determination module, for according to data block place table name to be backed up and row Praenomen, determines this data block memory range in the heart in target data;
Select module, for choose a back end storage data block at definite memory range.
Preferably, described determination module, specifically for:
According to described table name, determine the scope of the back end place frame of described data block storage; According to described row Praenomen, determine the range of physical addresses of described back end;
Described selection module, specifically for:
From the scope of described frame, select a frame, from described range of physical addresses, select a physical address.
Preferably, described determination module, specifically for:
Calculate the cryptographic hash of described table name, and calculate respectively in target data the cryptographic hash of all frames in the heart;
The scope of determining the cryptographic hash of described frame is: the absolute value of the difference between the cryptographic hash of described frame and the cryptographic hash of described table name is less than or equal in target data the peaked preset ratio of the cryptographic hash of all frames in the heart;
Wherein, in former data center the maximal value of the cryptographic hash of all table names with in target data in the heart the maximal value of the cryptographic hash of all frames equate.
Preferably, described determination module, specifically for:
Calculate the cryptographic hash of described row Praenomen, and calculate respectively the cryptographic hash of the physical address of all back end in selected frame;
The scope of determining the cryptographic hash of described physical address is: the absolute value of the difference between the cryptographic hash of described physical address and the cryptographic hash of described row Praenomen is less than or equal to the peaked preset ratio of the cryptographic hash of the physical address of all back end in selected frame; Wherein, in the table that described table name is corresponding, the maximal value of the cryptographic hash of all row Praenomens equates with the maximal value of the cryptographic hash of the physical address of all back end in selected frame.
Compared with prior art, the present invention includes: according to data block place table name to be backed up and row Praenomen, determine this data block memory range in the heart in target data; In definite memory range, choose a back end storage data block.By technical scheme of the present invention, take full advantage of the feature of row family storage, the problem that while having solved Hbase across data center's data backup, the storage of the data block of same row Praenomen disperses, the data block storage of same row Praenomen that makes to backup to target data center is more concentrated, thereby has improved reading speed.
Accompanying drawing explanation
Below the accompanying drawing in the embodiment of the present invention is described, the accompanying drawing in embodiment is for a further understanding of the present invention, is used from explanation the present invention with instructions one, does not form limiting the scope of the invention.
Fig. 1 is the process flow diagram of realizing the method for data center's backup of the present invention;
Fig. 2 is the process flow diagram of the embodiment of the method that realizes data center backup of the present invention;
Fig. 3 is that the structure that realizes the device of data center's backup of the present invention forms schematic diagram.
Embodiment
For the ease of those skilled in the art's understanding, below in conjunction with accompanying drawing, the invention will be further described, can not be used for limiting the scope of the invention.
Referring to Fig. 1, the present invention proposes a kind of method that realizes data center's backup, comprising:
In this step, can be according to the scope of the back end place frame of table name specified data piece storage; According to the range of physical addresses of row Praenomen specified data node.Wherein,
According to the scope of the back end place frame of table name specified data piece storage, comprise:
Calculate the cryptographic hash of table name, and calculate respectively in target data the cryptographic hash of all frames in the heart; The scope of determining the cryptographic hash of frame is: the absolute value of the difference between the cryptographic hash of frame and the cryptographic hash of table name is less than or equal in target data the peaked preset ratio of the cryptographic hash of all frames in the heart; Wherein, in former data center the maximal value of the cryptographic hash of all table names with in target data in the heart the maximal value of the cryptographic hash of all frames equate.
According to the range of physical addresses of row Praenomen specified data node, comprise:
The cryptographic hash of calculated column Praenomen, and calculate respectively the cryptographic hash of the physical address of all back end in selected frame; The scope of determining the cryptographic hash of physical address is: the absolute value of the difference between the cryptographic hash of physical address and the cryptographic hash of row Praenomen is less than or equal to the peaked preset ratio of the cryptographic hash of the physical address of all back end in selected frame; Wherein, in the table that table name is corresponding, the maximal value of the cryptographic hash of all row Praenomens equates with the maximal value of the cryptographic hash of the physical address of all back end in selected frame.
Wherein, it is 2 π that maximal value can be, but not limited to, and in table corresponding to the maximal value of the cryptographic hash of all table names and table name, the maximal value of the cryptographic hash of all row Praenomens can equate, also can be unequal.
In this step, a frame can be selected from the scope of frame at random, a physical address of random selection from range of physical addresses.The back end that selected frame and physical address are corresponding is the memory location of data block, after data block storage, then selects two outer two back end to back up according to existing backup method.
In this step, also can from the scope of frame, select the frame corresponding with the cryptographic hash of the absolute value minimum of the difference of the cryptographic hash of table name, from range of physical addresses, select back end corresponding to physical address corresponding with the cryptographic hash of the absolute value minimum of the difference of the cryptographic hash of row Praenomen.
The present invention is stored in the data block of same table name and same row Praenomen in identical memory range, makes the database storage of same row Praenomen comparatively concentrated, thereby has improved reading speed.
Below by a specific embodiment explanation How to choose back end, back up.
In this step, how to obtain database place table name to be backed up and column Praenomen and belong to prior art, can not be used for limiting the scope of the invention.For example, when data block is upgraded, frame can record more table name and the row Praenomen of new data block, when backing up, just can directly obtain table name and the row Praenomen of data block to be backed up.
In this step, a bit representing with two coordinate figures on sphere: the projection of line in XoY plane and the angle of X-axis at the point on the point on sphere and the line at coordinate center and the angle theta of Z axis, sphere and coordinate center
In this step, the point on employing sphere represents the position in data block Yuan data center, gets place table name and is
getting column Praenomen is θ.
Wherein,
can be the cryptographic hash of table name, θ can be the cryptographic hash of row Praenomen.How to calculate each cryptographic hash and can adopt existing method to realize, such as, adopt existing hash algorithm to calculate, the protection domain that its specific implementation is not intended to limit the present invention, repeats no more here.
In this step, suppose to take that the some P of data on sphere and the line OP of coordinate center O are axle, got O point and with the angle of the OP straight line that is γ around the rotate a circle area of the sphere that the conical region that obtains intercepts of OP, be the corresponding (cryptographic hash of table name, the cryptographic hash of row Praenomen) corresponding storage area, by conical region projection in YoZ plane, the scope that obtains θ ' is θ ' ∈ [θ-γ, θ+γ]; By conical region projection in XoY plane, obtain formula (1):
Wherein, b be O point and with the intersection point of the angle of the OP straight line that is γ and the sphere distance to OP, the length that r is OP, γ ' for got O point and with the angle of the angle of the OP straight line projection in XoY plane XoY plane upslide movie queen and OP that is γ.
The ratio of the area of the sphere that conical region intercepts and the total area of sphere is as shown in Equation (3):
Obtain the value of γ ' as shown in Equation (4):
In this step, adopt point on sphere to represent back end position in the heart in target data, get frame and be
getting physical address is θ.
Wherein,
can be the cryptographic hash of frame, θ can be the cryptographic hash of physical address.How to calculate each cryptographic hash and belong to prior art, can not be used for limiting the scope of the invention.
In this step, back end corresponding to the nearest point of can chosen distance data block corresponding point is as the memory location of data block.
Referring to Fig. 3, the invention allows for a kind of device of realizing data center's backup, at least comprise:
Determination module, for according to data block place table name to be backed up and row Praenomen, determines this data block memory range in the heart in target data;
Select module, for choose a back end storage data block at definite memory range.
In device of the present invention, determination module, specifically for:
According to the scope of the back end place frame of table name specified data piece storage; According to the range of physical addresses of row Praenomen specified data node;
Select module, specifically for:
From the scope of frame, select a frame, from range of physical addresses, select a physical address.
In device of the present invention, determination module, specifically for:
Calculate the cryptographic hash of described table name, and calculate respectively in target data the cryptographic hash of all frames in the heart;
The scope of determining the cryptographic hash of frame is: the absolute value of the difference between the cryptographic hash of frame and the cryptographic hash of table name is less than or equal in target data the peaked preset ratio of the cryptographic hash of all frames in the heart;
Wherein, in former data center the maximal value of the cryptographic hash of all table names with in target data in the heart the maximal value of the cryptographic hash of all frames equate.
In back-up device of the present invention, determination module, specifically for:
Calculate the cryptographic hash of described row Praenomen, and calculate respectively the cryptographic hash of the physical address of all back end in selected frame;
The scope of determining the cryptographic hash of physical address is: the absolute value of the difference between the cryptographic hash of physical address and the cryptographic hash of row Praenomen is less than or equal to the peaked preset ratio of the cryptographic hash of the physical address of all back end in selected frame; Wherein, in the table that table name is corresponding, the maximal value of the cryptographic hash of all row Praenomens equates with the maximal value of the cryptographic hash of the physical address of all back end in selected frame.
It should be noted that; above-described embodiment understands for the ease of those skilled in the art; be not limited to protection scope of the present invention; do not departing under the prerequisite of inventive concept of the present invention, any apparent replacement that those skilled in the art make the present invention and improvement etc. are all within protection scope of the present invention.
Claims (11)
1. a method that realizes data center's backup, is characterized in that, comprising:
According to data block place table name to be backed up and row Praenomen, determine this data block memory range in the heart in target data;
In definite memory range, choose a back end storage data block.
2. method according to claim 1, is characterized in that, the described data block place table name backing up as required and row Praenomen determine that this data block memory range in the heart in target data comprises:
According to described table name, determine the scope of the back end place frame of described data block storage;
According to described row Praenomen, determine the range of physical addresses of described back end;
Described one of them back end storage data block of choosing from memory range comprises:
From the scope of described frame, select a frame, from described range of physical addresses, select a physical address.
3. method according to claim 2, is characterized in that, describedly according to described table name, determines that the scope of the back end place frame of described data block storage comprises:
Calculate the cryptographic hash of described table name, and calculate respectively in target data the cryptographic hash of all frames in the heart;
The scope of determining the cryptographic hash of described frame is: the absolute value of the difference between the cryptographic hash of described frame and the cryptographic hash of described table name is less than or equal in target data the peaked preset ratio of the cryptographic hash of all frames in the heart;
Wherein, in former data center the maximal value of the cryptographic hash of all table names with in target data in the heart the maximal value of the cryptographic hash of all frames equate.
4. method according to claim 3, is characterized in that, described one of them back end storage data block of choosing from memory range comprises:
A frame of random selection from the scope of described frame, or the selection frame corresponding with the cryptographic hash of the absolute value minimum of the difference of the cryptographic hash of described table name.
5. method according to claim 3, is characterized in that, describedly according to described row Praenomen, determines that the range of physical addresses of described back end comprises:
Calculate the cryptographic hash of described row Praenomen, and calculate respectively the cryptographic hash of the physical address of all back end in selected frame;
The scope of determining the cryptographic hash of described physical address is: the absolute value of the difference between the cryptographic hash of described physical address and the cryptographic hash of described row Praenomen is less than or equal to the peaked preset ratio of the cryptographic hash of the physical address of all back end in selected frame; Wherein, in the table that described table name is corresponding, the maximal value of the cryptographic hash of all row Praenomens equates with the maximal value of the cryptographic hash of the physical address of all back end in selected frame.
6. method according to claim 5, is characterized in that, described one of them back end storage data block of choosing from memory range comprises:
A back end that physical address is corresponding of random selection from described range of physical addresses, or selection back end corresponding to physical address corresponding with the cryptographic hash of the absolute value minimum of the difference of the cryptographic hash of described row Praenomen.
7. according to the method described in claim 3~6 any one, described maximal value is 2 π.
8. a device of realizing data center's backup, is characterized in that, at least comprises:
Determination module, for according to data block place table name to be backed up and row Praenomen, determines this data block memory range in the heart in target data;
Select module, for choose a back end storage data block at definite memory range.
9. device according to claim 8, is characterized in that, described determination module, specifically for:
According to described table name, determine the scope of the back end place frame of described data block storage; According to described row Praenomen, determine the range of physical addresses of described back end;
Described selection module, specifically for:
From the scope of described frame, select a frame, from described range of physical addresses, select a physical address.
10. device according to claim 9, is characterized in that, described determination module, specifically for:
Calculate the cryptographic hash of described table name, and calculate respectively in target data the cryptographic hash of all frames in the heart;
The scope of determining the cryptographic hash of described frame is: the absolute value of the difference between the cryptographic hash of described frame and the cryptographic hash of described table name is less than or equal in target data the peaked preset ratio of the cryptographic hash of all frames in the heart;
Wherein, in former data center the maximal value of the cryptographic hash of all table names with in target data in the heart the maximal value of the cryptographic hash of all frames equate.
11. devices according to claim 10, is characterized in that, described determination module, specifically for:
Calculate the cryptographic hash of described row Praenomen, and calculate respectively the cryptographic hash of the physical address of all back end in selected frame;
The scope of determining the cryptographic hash of described physical address is: the absolute value of the difference between the cryptographic hash of described physical address and the cryptographic hash of described row Praenomen is less than or equal to the peaked preset ratio of the cryptographic hash of the physical address of all back end in selected frame; Wherein, in the table that described table name is corresponding, the maximal value of the cryptographic hash of all row Praenomens equates with the maximal value of the cryptographic hash of the physical address of all back end in selected frame.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410032550.1A CN103761167B (en) | 2014-01-23 | 2014-01-23 | A kind of method and apparatus for realizing data center backup |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410032550.1A CN103761167B (en) | 2014-01-23 | 2014-01-23 | A kind of method and apparatus for realizing data center backup |
Publications (2)
Publication Number | Publication Date |
---|---|
CN103761167A true CN103761167A (en) | 2014-04-30 |
CN103761167B CN103761167B (en) | 2017-04-05 |
Family
ID=50528409
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201410032550.1A Active CN103761167B (en) | 2014-01-23 | 2014-01-23 | A kind of method and apparatus for realizing data center backup |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103761167B (en) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105511801A (en) * | 2015-11-12 | 2016-04-20 | 长春理工大学 | Data storage method and apparatus |
CN105592178A (en) * | 2015-09-17 | 2016-05-18 | 杭州华三通信技术有限公司 | Method and device for determining position of data node |
CN107463342A (en) * | 2017-08-28 | 2017-12-12 | 北京奇艺世纪科技有限公司 | A kind of storage method and device of CDN fringe nodes file |
CN112379840A (en) * | 2020-11-17 | 2021-02-19 | 海光信息技术股份有限公司 | Terminal data protection method and device and terminal |
CN114780298A (en) * | 2022-06-16 | 2022-07-22 | 深圳市慧为智能科技股份有限公司 | File data processing method and device, computer terminal and storage medium |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102750356A (en) * | 2012-06-11 | 2012-10-24 | 清华大学 | Construction and management method for secondary indexes of key value library |
CN103281291A (en) * | 2013-02-19 | 2013-09-04 | 电子科技大学 | Application layer protocol identification method based on Hadoop |
-
2014
- 2014-01-23 CN CN201410032550.1A patent/CN103761167B/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102750356A (en) * | 2012-06-11 | 2012-10-24 | 清华大学 | Construction and management method for secondary indexes of key value library |
CN103281291A (en) * | 2013-02-19 | 2013-09-04 | 电子科技大学 | Application layer protocol identification method based on Hadoop |
Non-Patent Citations (1)
Title |
---|
王开煊: "《多数据中心非结构化数据复制方法研究》", 《中国优秀硕士学位论文全文数据库信息科技辑》, no. 10, 15 October 2012 (2012-10-15) * |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105592178A (en) * | 2015-09-17 | 2016-05-18 | 杭州华三通信技术有限公司 | Method and device for determining position of data node |
CN105592178B (en) * | 2015-09-17 | 2018-12-25 | 新华三技术有限公司 | A kind of back end method for determining position and device |
CN105511801A (en) * | 2015-11-12 | 2016-04-20 | 长春理工大学 | Data storage method and apparatus |
CN105511801B (en) * | 2015-11-12 | 2018-11-16 | 长春理工大学 | The method and apparatus of data storage |
CN107463342A (en) * | 2017-08-28 | 2017-12-12 | 北京奇艺世纪科技有限公司 | A kind of storage method and device of CDN fringe nodes file |
CN107463342B (en) * | 2017-08-28 | 2021-04-20 | 北京奇艺世纪科技有限公司 | CDN edge node file storage method and device |
CN112379840A (en) * | 2020-11-17 | 2021-02-19 | 海光信息技术股份有限公司 | Terminal data protection method and device and terminal |
CN114780298A (en) * | 2022-06-16 | 2022-07-22 | 深圳市慧为智能科技股份有限公司 | File data processing method and device, computer terminal and storage medium |
CN114780298B (en) * | 2022-06-16 | 2022-09-06 | 深圳市慧为智能科技股份有限公司 | File data processing method and device, computer terminal and storage medium |
Also Published As
Publication number | Publication date |
---|---|
CN103761167B (en) | 2017-04-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103761167A (en) | Method and device for achieving data center backup | |
US11347402B2 (en) | Performing wear leveling operations in a memory based on block cycles and use of spare blocks | |
US10082982B2 (en) | Data backup method and apparatus, data restoration method and apparatus, and server | |
DE102018128775A1 (en) | An extensible tree-based indexing framework that enables expansion of the Hadoop Distributed File System | |
US20180025029A1 (en) | Generating road segment attributes based on spatial referencing | |
DE202014010903U1 (en) | System for specifying the user location and the viewing direction of a digital map | |
RU2015115745A (en) | SYSTEM AND METHOD FOR MANAGING PARKING VEHICLES | |
US20150121023A1 (en) | Operating A Memory Management Controller | |
CN103747073A (en) | Distributed caching method and system | |
DE202014010949U1 (en) | A suggestion device based on favorites nearby | |
US9697358B2 (en) | Non-volatile memory operations | |
DE202015009195U1 (en) | Virtual geographic scopes, consisting of several component forms | |
CN109719137A (en) | Steel plate corner control method, device, equipment and storage medium for angular rolling | |
CN106776612B (en) | Display method and device of geographical thermodynamic diagram | |
CN111062658A (en) | Distribution range generation method and device, computer equipment and storage medium | |
CN107113324A (en) | Data backup device and method, system | |
DE102013112897B4 (en) | Non-volatile memory and method of operating a non-volatile memory | |
CN105677252A (en) | Data reading method, data processing method and related storage device | |
CN107851053A (en) | For the method and apparatus for the damage for managing flash memory contents | |
CN104598463A (en) | Method and method for switching database | |
CN103902371B (en) | A kind of User space program obtains kernel jiffies method and system | |
CN107783982B (en) | Data processing method and data processing device | |
CN110082794B (en) | Vehicle GPS track data filtering method | |
CN105574425B (en) | Access the method and device of storage data | |
CN105635236B (en) | A kind of page rendering method, apparatus and system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |