CN112799872B - Erasure code encoding method and device based on key value pair storage system - Google Patents
Erasure code encoding method and device based on key value pair storage system Download PDFInfo
- Publication number
- CN112799872B CN112799872B CN202110191784.0A CN202110191784A CN112799872B CN 112799872 B CN112799872 B CN 112799872B CN 202110191784 A CN202110191784 A CN 202110191784A CN 112799872 B CN112799872 B CN 112799872B
- Authority
- CN
- China
- Prior art keywords
- data
- key
- storage system
- strong
- value pair
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F11/1004—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's to protect a block of data words, e.g. CRC or checksum
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1448—Management of the data involved in backup or backup restore
Abstract
The application discloses an erasure code coding method and device based on a key value pair storage system, wherein the method comprises the following steps: acquiring an incidence relation between keywords in a key value pair storage system; acquiring at least two corresponding target data with strong relevance or strong time limitation from the key value pair storage system according to the incidence relation between the keywords; dividing at least two target data into the same coding group for coding to obtain corresponding data blocks and check blocks; and writing the obtained data block and the check block into corresponding storage nodes by adopting load balancing. Through implementing this application, can combine the design with traditional erasure coding technique and novel key value to storage system, combine simultaneously to consider the relation between the data in the key value to storage system to reduce data access's number of times and time, promote data recovery efficiency.
Description
Technical Field
The application relates to the technical field of cloud storage, in particular to an erasure code encoding method and device based on a key value pair storage system.
Background
With the emergence of emerging storage technologies and hardware, and the performance improvement of key-value storage systems for application programs by the underlying design of key-value storage systems, more and more server clusters start to use key-value storage systems to store data. To ensure reliability and availability of data, erasure coding techniques are typically used to store the data.
However, the conventional erasure code technology mainly aims at the conventional fixed-length block storage device, and when the background of the non-fixed-length block storage of the novel key value pair storage system is faced, the conventional erasure code technology cannot be well adapted to the key value pair storage system and provide technical support. And the key value pair storage system always has an association relationship between different blocks, which is difficult to embody and utilize in the traditional erasure code technology.
Therefore, it is desirable to provide an erasure coding scheme suitable for key-value pair storage systems.
Disclosure of Invention
In order to overcome the defects in the prior art, the application aims to provide an erasure code coding method and device based on a key value pair storage system, the traditional erasure code technology and the novel key value pair storage system are combined, the relation among data in the key value pair storage system is considered, the times and time of data access can be reduced, and the data recovery efficiency is improved.
To achieve the above and other objects, the present application provides an erasure coding method for a key-value-pair-based storage system, comprising the following steps:
acquiring an incidence relation between keywords in a key-value pair storage system, wherein the incidence relation is used for indicating that data corresponding to the keywords have strong incidence or strong time locality, and the key-value pair storage system stores the data in a key-value pair form;
acquiring at least two corresponding target data with strong relevance or strong time limitation from the key value pair storage system according to the incidence relation between the keywords;
dividing at least two target data into the same coding group for coding to obtain corresponding data blocks and check blocks;
and writing the obtained data block and the check block into corresponding storage nodes by adopting load balancing.
Optionally, the association relationship includes at least one of the following: parent and child contain relationships, relationships with strong access relevance, or relationships with strong access precedence.
Optionally, the data with strong time limitation is obtained by analyzing data access characteristics, and the data with strong relevance is obtained by analyzing attribute information of the data.
Optionally, the key value pair storage system stores a key word, a value corresponding to the key word, a correspondence between the key word and the value, and an association between the key words.
Optionally, the data block stores therein associated data of at least two target data, and the method further includes:
receiving a data recovery request, wherein the data recovery request is used for requesting to read a data block or a check block in a target node so as to realize recovery of lost data based on the data block or the check block, and the lost data is partial data in any one of the target data;
and responding to the data recovery request, performing recovery calculation on the read data block or check block in the target node to obtain the lost data, and preparing for accessing the next target data which has strong relevance or strong time limitation with any one of the target data according to the associated data.
To achieve the above and other objects, the present application also provides an erasure coding apparatus for a key-value-pair-based storage system, including:
the device comprises an acquisition unit, a storage unit and a processing unit, wherein the acquisition unit is used for acquiring an incidence relation between keywords in a key-value pair storage system, the incidence relation is used for indicating that data corresponding to the keywords have strong incidence or strong time locality, and the key-value pair storage system stores the data in a key-value pair form;
the acquiring unit is further configured to acquire at least two corresponding target data with strong relevance or strong time limitation from the key value pair storage system according to the association relationship between the keywords;
the encoding unit is used for dividing at least two target data into the same encoding group for encoding to obtain a corresponding data block and a corresponding check block;
and the writing unit is used for writing the obtained data block and the check block into the corresponding storage node by adopting load balancing.
Optionally, the association relationship includes at least one of the following: parent and child contain relationships, relationships with strong access relevance, or relationships with strong access precedence.
Optionally, the data with strong time limitation is obtained by analyzing data access characteristics, and the data with strong relevance is obtained by analyzing attribute information of the data.
Optionally, the key value pair storage system stores a key word, a value corresponding to the key word, a correspondence between the key word and the value, and an association between the key words.
Optionally, the data block stores therein associated data of at least two of the target data, the apparatus further includes a receiving unit and a recovery unit,
the receiving unit is further configured to receive a data recovery request, where the data recovery request is used to request to read a data block or a check block in a target node, so as to implement recovery of lost data based on the data block or the check block, where the lost data is partial data in any one of the target data;
the recovery unit is further configured to perform recovery calculation on the read data block or check block in the target node in response to the data recovery request to obtain the lost data, and prepare for access of next target data having strong association or strong time limitation with any one of the target data according to the associated data.
It can be seen from the above that the application provides an erasure code encoding method and apparatus based on key-value pair storage system, which can achieve the following beneficial effects: this application combines traditional erasure code technique and neotype key value to storage system to design, has introduced the design consideration with the relation between key value to storage system's data simultaneously for key value to storage system also can use erasure code technique to carry out data recovery, can resume out strong relevant data together sooner like this when data recovery, compares in prior art, has promoted data recovery's efficiency, in order to ensure the better quality of service of user. In addition, because the data with strong relevance or strong time limitation are put into the same coding group for coding, the access times of the nodes and the access time of the whole data access can be reduced during data access.
Drawings
Fig. 1 is a schematic flowchart of an erasure coding method for a storage system based on key-value pairs according to an embodiment of the present application.
Fig. 2 is a schematic structural diagram of an erasure code encoding apparatus based on a key-value pair storage system according to an embodiment of the present application.
Fig. 3 is a schematic structural diagram of another erasure coding apparatus for a key-value pair-based storage system according to an embodiment of the present application.
Detailed Description
Other advantages and effects of the present application will become apparent to those skilled in the art from the present disclosure, which is made apparent from the following detailed description of the embodiments given by way of example only and taken in conjunction with the accompanying drawings. The present application is capable of other and different embodiments and its several details are capable of modification in various other respects, all without departing from the spirit and scope of the present application.
Fig. 1 is a schematic flowchart of an erasure coding method for a storage system based on key-value pairs according to an embodiment of the present application. The method as shown in fig. 1 comprises the following implementation steps.
S101, obtaining an incidence relation between keywords in a key value pair storage system, wherein the incidence relation is used for indicating that data corresponding to the keywords have strong incidence or strong time locality, and the key value pair storage system stores the data in a key value pair mode.
The key-value pair (key-value) storage system stores data in the form of key-value pairs. The key-value pair storage system stores therein a lot of data contents, which may include, but are not limited to, a key (key), a value (value) corresponding to the key (key), a correspondence relationship between the key (key) and the value, an association relationship between the key (key) and the key (key), and the like.
In an alternative embodiment, the system can determine or obtain at least one associated data with strong temporal locality to the data by analyzing access characteristics of the data at the time of data storage; at least one piece of associated data with strong relevance to the data is obtained by analyzing the attribute information of the data, then the data is stored in the form of key value pairs, and the corresponding association relationship between the key word corresponding to the data and the key word corresponding to each piece of associated data is established, and the data and the key word are stored in a key value pair storage system. And the subsequent processing of acquiring corresponding data from the key value pair storage system is facilitated.
The association relationship between keywords referred to in the present application includes, but is not limited to, any one or combination of the following relationships: parent-child containment relationships, relationships with strong access relevancy, or relationships with strong access precedence, and the like.
S102, acquiring at least two corresponding target data with strong relevance or strong time limitation from the key value pair storage system according to the incidence relation between the keywords.
The erasure code system performs a segmentation operation on data when storing the data, and specifically, according to an association relationship between keywords (for example, a parent-child inclusion relationship, or a strong association or strong sequential access relationship of corresponding data of two keys during access), at least two target data corresponding to the association relationship and having strong association or strong time limitation are obtained.
S103, dividing at least two target data into the same coding group for coding to obtain corresponding data blocks and check blocks.
According to the method and the device, at least two target data with strong relevance or strong time limitation can be divided into the same coding group, and then coding operation is carried out, so that the corresponding data block and the corresponding check block are obtained through coding. In other words, when erasure code encoding is performed, at least two target data with a relatively close relationship can be placed in the same encoding group for encoding according to the relationship between the data.
And S04, writing the obtained data block and the check block into the corresponding storage node by adopting load balancing.
Finally, the data block and the check block obtained by encoding can be written into corresponding different storage nodes (such as disks) by adopting a load balancing technology. Optionally, associated data for the at least two target data is included in any data block obtained after encoding, and the associated data is used to indicate that a strong association or a strong time limitation exists between the two target data.
It should be noted that, because data is requested to be accessed from different storage receivers when data is accessed in the erasure code system, after data with relevance is divided into the same coding group for coding storage, the access times to storage nodes can be reduced/reduced when data is accessed, and the data access time is reduced. For example, taking data a and data B having a correlation as an example, when a certain data a is accessed, data B is accessed immediately with a high probability. This is not taken into account by conventional erasure coding schemes, which consider that data a and data B are encoded and stored in the same erasure coding packet. Therefore, the data block related to the access data B can be obtained when the data A is accessed, and preparation is made in advance for accessing the data B, so that the data B which is possibly required to be accessed immediately in a short time period can be better obtained, and the data access efficiency is improved.
In an optional embodiment, because the erasure coding scheme designed by the application introduces and considers the relationship between data, strongly-related data can be recovered at the same time more quickly during data recovery, and compared with the traditional random grouping technology, the erasure coding scheme has higher data recovery efficiency and provides better service quality for users. In specific implementation, the data recovery request can be received, and the data recovery request is used for requesting recovery of the missing book data in the damaged node, and specifically used for requesting reading of the corresponding data block or check block from the corresponding target node, and then calculation is performed by using the read data block and check block, so as to recover the corresponding lost data. And further responding to the data recovery request, reading corresponding data blocks and check blocks from corresponding target nodes, and then performing recovery calculation on the data blocks and the check blocks to obtain the lost data. And meanwhile, preparing for accessing the next target data which has strong relevance or strong time limitation with the current data according to the associated data in the read data block.
Through implementing this application, this application combines traditional erasure coding technique and neotype key value to storage system to design, has introduced the design consideration with the relation between key value to storage system's data simultaneously for key value to storage system also can use erasure coding technique to carry out data recovery, can recover out strong relevant data together sooner like this when data recovery, compares in prior art, has promoted data recovery's efficiency, in order to ensure the better quality of service of user. In addition, because the data with strong relevance or strong time limitation are put into the same coding group for coding, the access times of the nodes and the access time of the whole data access can be reduced during data access.
Fig. 2 is a schematic structural diagram of an erasure code encoding apparatus based on a key-value pair storage system according to an embodiment of the present application. The apparatus shown in fig. 2 comprises an obtaining unit 201, an encoding unit 202 and a writing unit, wherein:
the obtaining unit 201 is configured to obtain an association relationship between keywords in a key-value pair storage system, where the association relationship is used to indicate that data corresponding to the keywords have strong association or strong temporal locality, and the key-value pair storage system stores the data in a key-value pair form;
the obtaining unit 201 is further configured to obtain at least two corresponding target data with strong relevance or strong time limitation from the key-value pair storage system according to the association relationship between the keywords;
the encoding unit 202 is configured to divide at least two target data into the same encoding group for encoding, so as to obtain a corresponding data block and a corresponding check block;
the writing unit 203 is configured to write the obtained data block and the check block into corresponding storage nodes by using load balancing.
Optionally, the association relationship includes at least one of the following: parent and child contain relationships, relationships with strong access relevance, or relationships with strong access precedence.
Optionally, the data with strong time limitation is obtained by analyzing data access characteristics, and the data with strong relevance is obtained by analyzing attribute information of the data.
Optionally, the key value pair storage system stores a key word, a value corresponding to the key word, a correspondence between the key word and the value, and an association between the key words.
Optionally, the data block stores therein associated data of at least two target data, the apparatus further includes a receiving unit 204 and a recovering unit 205,
the receiving unit 204 is further configured to receive a data recovery request, where the data recovery request is used to request to read a data block or a check block in a target node, so as to implement recovery of lost data based on the data block or the check block, where the lost data is partial data in any one of the target data;
the recovery unit 205 is further configured to respond to the data recovery request, perform recovery calculation on the read data block or check block in the target node to obtain the lost data, and prepare for access of the next target data having strong association or strong time limitation with any one of the target data according to the associated data.
Through implementing this application, this application combines traditional erasure coding technique and neotype key value to storage system to design, has introduced the design consideration with the relation between key value to storage system's data simultaneously for key value to storage system also can use erasure coding technique to carry out data recovery, can recover strong relevant data in the lump so when data recovery sooner, compares in prior art, has promoted data recovery's efficiency, in order to ensure the better quality of service of user. In addition, because the data with strong relevance or strong time limitation are put into the same coding group for coding, the access times of the nodes and the access time of the whole data access can be reduced during data access.
The above embodiments are merely illustrative of the principles and utilities of the present application and are not intended to limit the application. Modifications and variations can be made to the above-described embodiments by those skilled in the art without departing from the spirit and scope of the present application. Therefore, the protection scope of the present application should be as set forth in the claims.
Claims (8)
1. An erasure code encoding method based on a key-value pair storage system, comprising:
acquiring an incidence relation between keywords in a key-value pair storage system, wherein the incidence relation is used for indicating that data corresponding to the keywords have strong incidence or strong time locality, and the key-value pair storage system stores the data in a key-value pair form;
acquiring at least two corresponding target data with strong relevance or strong time limitation from the key value pair storage system according to the incidence relation between the keywords;
dividing at least two target data into the same coding group for coding to obtain corresponding data blocks and check blocks;
writing the obtained data block and the check block into corresponding storage nodes by adopting load balancing;
the association relationship includes at least one of: parent and child contain relationships, relationships with strong access relevance, or relationships with strong access precedence.
2. The erasure code encoding method for key-value pair-based storage systems according to claim 1, wherein the data having a strong time limitation therebetween is obtained by analyzing data access characteristics, and the data having a strong correlation therebetween is obtained by analyzing attribute information of the data.
3. The erasure coding method based on the key-value pair storage system of claim 1, wherein the key-value pair storage system stores therein a key, a value corresponding to the key, a correspondence between the key and the value, and an association between the keys.
4. The key-value pair storage system based erasure coding method according to any one of claims 1-3, wherein the data block stores therein associated data of at least two of the target data, the method further comprising:
receiving a data recovery request, wherein the data recovery request is used for requesting to read a data block or a check block in a target node so as to realize recovery of lost data based on the data block or the check block, and the lost data is partial data in any target data;
and responding to the data recovery request, performing recovery calculation on the read data block or check block in the target node to obtain the lost data, and preparing for accessing the next target data which has strong relevance or strong time limitation with any one of the target data according to the associated data.
5. An erasure code encoding apparatus for a key-value-pair-based storage system, comprising:
the device comprises an acquisition unit, a storage unit and a processing unit, wherein the acquisition unit is used for acquiring an incidence relation between keywords in a key-value pair storage system, the incidence relation is used for indicating that data corresponding to the keywords have strong incidence or strong time locality, and the key-value pair storage system stores the data in a key-value pair form;
the acquiring unit is further configured to acquire at least two corresponding target data with strong relevance or strong time limitation from the key value pair storage system according to the association relationship between the keywords;
the encoding unit is used for dividing at least two target data into the same encoding group for encoding to obtain a corresponding data block and a corresponding check block;
the writing unit is used for writing the obtained data block and the check block into corresponding storage nodes by adopting load balancing;
the association relationship includes at least one of: parent and child contain relationships, relationships with strong access relevance, or relationships with strong access precedence.
6. The erasure code encoding apparatus for key-value pair-based storage systems according to claim 5, wherein the data having a strong time limitation therebetween is obtained by analyzing data access characteristics, and the data having a strong correlation therebetween is obtained by analyzing attribute information of the data.
7. The erasure coding apparatus according to claim 5, wherein the key-value pair storage system stores therein a key, a value corresponding to the key, a correspondence between the key and the value, and an association between the keys.
8. The erasure coding apparatus for key-value pair-based storage system according to any one of claims 5-7, wherein the data block stores therein associated data of at least two of the target data, the apparatus further comprising a receiving unit and a restoring unit,
the receiving unit is further configured to receive a data recovery request, where the data recovery request is used to request to read a data block or a check block in a target node, so as to implement recovery of lost data based on the data block or the check block, where the lost data is partial data in any one of the target data;
the recovery unit is further configured to perform recovery calculation on the read data block or check block in the target node in response to the data recovery request to obtain the lost data, and prepare for access of next target data having strong association or strong time limitation with any one of the target data according to the associated data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110191784.0A CN112799872B (en) | 2021-02-19 | 2021-02-19 | Erasure code encoding method and device based on key value pair storage system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110191784.0A CN112799872B (en) | 2021-02-19 | 2021-02-19 | Erasure code encoding method and device based on key value pair storage system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112799872A CN112799872A (en) | 2021-05-14 |
| CN112799872B true CN112799872B (en) | 2022-08-12 |
Family
ID=75815252
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110191784.0A Active CN112799872B (en) | 2021-02-19 | 2021-02-19 | Erasure code encoding method and device based on key value pair storage system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112799872B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113190384B (en) * | 2021-05-21 | 2022-07-22 | 重庆紫光华山智安科技有限公司 | Data recovery control method, device, equipment and medium based on erasure codes |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106528844A (en) * | 2016-11-24 | 2017-03-22 | 腾讯科技（深圳）有限公司 | Data request method and apparatus, and data storage system |
| CN106844098A (en) * | 2016-12-29 | 2017-06-13 | 中国科学院计算技术研究所 | A kind of fast data recovery method and system based on right-angled intersection erasure code |
| CN111444042A (en) * | 2020-03-24 | 2020-07-24 | 哈尔滨工程大学 | Block chain data storage method based on erasure codes |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105677508B (en) * | 2015-12-16 | 2018-12-18 | 浪潮(北京)电子信息产业有限公司 | The amending method and system of correcting and eleting codes data in a kind of cloud storage |
| CN108874950B (en) * | 2018-06-05 | 2022-04-12 | 亚信科技（中国）有限公司 | Data distribution storage method and device based on ER relationship |
| CN110442535B (en) * | 2019-07-19 | 2021-06-11 | 华中科技大学 | Method and system for improving reliability of distributed solid-state disk key value cache system |
| US11775193B2 (en) * | 2019-08-01 | 2023-10-03 | Dell Products L.P. | System and method for indirect data classification in a storage system operations |
| CN111444036B (en) * | 2020-03-19 | 2021-04-20 | 华中科技大学 | Data relevance perception erasure code memory replacement method, equipment and memory system |
| CN111831223B (en) * | 2020-06-19 | 2021-06-11 | 华中科技大学 | Fault-tolerant coding method, device and system for improving expandability of data deduplication system |
-
2021
- 2021-02-19 CN CN202110191784.0A patent/CN112799872B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106528844A (en) * | 2016-11-24 | 2017-03-22 | 腾讯科技（深圳）有限公司 | Data request method and apparatus, and data storage system |
| CN106844098A (en) * | 2016-12-29 | 2017-06-13 | 中国科学院计算技术研究所 | A kind of fast data recovery method and system based on right-angled intersection erasure code |
| CN111444042A (en) * | 2020-03-24 | 2020-07-24 | 哈尔滨工程大学 | Block chain data storage method based on erasure codes |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112799872A (en) | 2021-05-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109254733B (en) | Method, device and system for storing data | |
| US11614867B2 (en) | Distributed storage system-based data processing method and storage device | |
| US8843454B2 (en) | Elimination of duplicate objects in storage clusters | |
| EP4068070A1 (en) | Data storage method and apparatus, and storage system | |
| US10685037B2 (en) | Volume cohorts in object-redundant storage systems | |
| EP2863310B1 (en) | Data processing method and apparatus, and shared storage device | |
| CN107436725A (en) | A kind of data are write, read method, apparatus and distributed objects storage cluster | |
| US20150213100A1 (en) | Data synchronization method and system | |
| CN107515874B (en) | Method and equipment for synchronizing incremental data in distributed non-relational database | |
| US20110235908A1 (en) | Partition min-hash for partial-duplicate image determination | |
| CN111400083B (en) | Data storage method and system and storage medium | |
| CN107590019B (en) | Data storage method and device | |
| CN105824846B (en) | Data migration method and device | |
| CN110764706A (en) | Storage system, data management method, and storage medium | |
| EP2590078A2 (en) | Shadow paging based log segment directory | |
| CN112380071B (en) | Method for quickly backing up NTFS file system | |
| KR20090063733A (en) | Method recovering data server at the applying multiple reproduce dispersion file system and metadata storage and save method thereof | |
| CN111367926A (en) | Data processing method and device for distributed system | |
| CN104965835A (en) | Method and apparatus for reading and writing files of a distributed file system | |
| CN112799872B (en) | Erasure code encoding method and device based on key value pair storage system | |
| CN109947730A (en) | Metadata restoration methods, device, distributed file system and readable storage medium storing program for executing | |
| US20170315869A1 (en) | Fault-tolerant Enterprise Object Storage System for Small Objects | |
| CN111444046B (en) | Data recovery method and distributed data recovery system | |
| CN103425694A (en) | Relational data searching method and device | |
| CN111913913A (en) | Access request processing method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |