CN112948386A - Simple indexing and encryption tray-dropping mechanism for ETL abnormal data - Google Patents
Simple indexing and encryption tray-dropping mechanism for ETL abnormal data Download PDFInfo
- Publication number
- CN112948386A CN112948386A CN202110241032.0A CN202110241032A CN112948386A CN 112948386 A CN112948386 A CN 112948386A CN 202110241032 A CN202110241032 A CN 202110241032A CN 112948386 A CN112948386 A CN 112948386A
- Authority
- CN
- China
- Prior art keywords
- data
- index
- information
- page
- compression
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/25—Integrating or interfacing systems involving database management systems
- G06F16/254—Extract, transform and load [ETL] procedures, e.g. ETL data flows in data warehouses
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Document Processing Apparatus (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses a simple indexing and encryption tray-dropping mechanism for ETL (extract transform load) abnormal data, which is applied to abnormal data tray-dropping in the operation process of data ETL and comprises the steps of establishing an index, carrying out encryption compression on the data and inquiring and accessing the data on the tray-dropping. The invention adopts the method comprising global index, page index and row index to simply index the landing data, so that the efficiency of inquiring the landing data is greatly improved, and even under the situation of large data volume of the landing data, the target data can be quickly inquired; the simple data compression encryption mode is adopted, displacement compression, dictionary compression and bitmap compression are included, data are compressed and encrypted, and data information leakage caused by plaintext data is prevented.
Description
Technical Field
The invention belongs to the field of big data storage, and particularly relates to a simple indexing and encryption disk dropping mechanism for ETL (extract transform load) abnormal data.
Background
When an ETL (Extract-Transform-Load) model is designed, all types of data and special case data are always attempted to be covered, but when a mass data source is faced, some abnormal data caused by unreasonable design cannot be avoided, and the abnormal data needs to be landed for a service staff to conveniently check.
In the current big data ETL process, even though designers carefully investigate and design in detail, the data anomaly problem inevitably occurs in the actual use process due to reasons such as mismatch between the design and the actual scene, abnormal network communication, and service change, as shown in fig. 1. In a production environment, the abnormal data cannot be directly discarded, and generally fall off a tray to wait for a service staff to check, for example, the ultra-long data is always a problem that an ETL engineer is very painful; because in the complete ETL process, a plurality of servers are involved, generally the servers reuse other services, the services involve a plurality of users, and even abnormal data are not expected to be viewed by other users; on the other hand, in the ETL software upgrading process, many data are performing ETL, hundreds of thousands or even millions of pieces of data to be processed may be stored in the memory, and the data need to be off-disk first and then software upgrading is performed, otherwise hundreds of thousands or even millions of pieces of data in the memory have a risk of being lost.
The existing tray falling mode is basically a plaintext tray falling mode, so that a salesman can directly check abnormal data by using a text editor to search error reasons, but the common ETL server is a multiplexing server, a plurality of people can use the server by hands, the data are directly tray falling on the server in the plaintext mode, and the risk of data leakage exists.
Disclosure of Invention
The invention aims to solve the problems and provides a simple indexing and encryption tray dropping mechanism for ETL abnormal data, which is applied to abnormal data tray dropping in the operation process of the ETL of data and comprises the steps of establishing an index, carrying out encryption compression on the data and inquiring and accessing the data of the tray dropping;
establishing an index comprises establishing a global index, a page index and a row index; the global index is used for recording basic information of the complete data file; the page index is used for recording the index information of the current index page; the row index is used for recording row index information of a current data row;
carrying out encryption compression on data, including displacement compression, dictionary compression and bitmap compression;
and (4) seeking and accessing the data on the disk, which comprises seeking the global index, seeking the index page according to the global index, decompressing the data of the index page, and seeking the index information of the line and the key information of the current data line.
The invention has the beneficial effects that: according to the method, global indexes are adopted to index global data, page indexes are adopted to index all data rows of a current page, and row indexes are adopted to index single data, namely simple indexes including the global indexes, the page indexes and the row indexes are adopted to index the landing data, so that the efficiency of inquiring the landing data is greatly improved, and even under the condition that the landing data is large in data volume, the target data can be quickly inquired; and a simple data compression encryption mode is adopted, including displacement compression, dictionary compression and bitmap compression, and the data is compressed and encrypted at the same time, so that data information leakage caused by plaintext data is prevented.
Drawings
FIG. 1 is a schematic diagram of an application scenario of the present invention;
FIG. 2 is a logical framework diagram of the present invention;
FIG. 3 is a schematic diagram of an indexing structure;
FIG. 4 is a diagram of a global index;
FIG. 5 is a schematic view of a page index;
FIG. 6 is a schematic diagram of a row index;
FIG. 7 is a schematic view of displacement compression;
FIG. 8 is a schematic diagram of dictionary compression;
FIG. 9 is a schematic diagram of bitmap compression;
FIG. 10 is a data-dropping flow diagram;
FIG. 11 is a flow chart of a landing data query.
Detailed Description
The invention will be further described with reference to the accompanying drawings in which:
as shown in fig. 2, the simple indexing and encryption destaging mechanism for ETL abnormal data of the present invention is applied to destaging abnormal data in the operation process of data ETL, and includes index establishment, data encryption compression, and destaging data query access;
establishing an index comprises establishing a global index, a page index and a row index; the global index is used for recording basic information of the complete data file; the page index is used for recording the index information of the current index page; the row index is used for recording row index information of a current data row;
carrying out encryption compression on data, including displacement compression, dictionary compression and bitmap compression;
and (4) seeking and accessing the data on the disk, which comprises seeking the global index, seeking the index page according to the global index, decompressing the data of the index page, and seeking the index information of the line and the key information of the current data line.
Specifically, the basic information of the complete data file includes: the method comprises the steps of unique ID of a total index, creation timestamp, derivation timestamp, total number of data pages, an overall compression algorithm for compressing data, data size before compression, data size after compression, a total index check value and basic information of each data page.
Specifically, the data page basic information includes offset positions of the data pages in the whole storage file, data page content keyword information, and data line position information of important keywords.
Specifically, the index page comprises an index area and a data area; the index area is used for storing index header information; the index header information comprises a page number, a data number, an index header size, a data size before compression, a data size after compression, a data check bit and each data line offset; the data area comprises data row index, data information and data row check information.
Specifically, the row index is used for indexing a single piece of data, and the key information of the current data row includes an index row unique address, key word information, and data compression information.
Specifically, the displacement compression is used for recording character string information and character string offset information, and when the occurrence frequency of the character string information and the character string offset information exceeds the set times, the displacement compression is carried out; the dictionary compression is used for setting a keyword information base and replacing and storing keywords by symbolic addresses; the bitmap compression is used for storing keywords exceeding a set character string length according to a plurality of symbol addresses with set byte size.
Specifically, the key information of the current data line includes data information and a data check bit.
Specifically, when the data size of the newly added data plus the current index page is smaller than a set value, the newly added data plus the current index page is added to the current index page, and when the data size of the newly added data plus the current index page is larger than the set value, the newly added index page is newly created and added to the newly added index page; and when the single newly added data is smaller than the set value, newly creating an index page, and updating the single newly added data to the last index page.
As shown in FIG. 3, the index structure includes a global index, a page index, and a line index. The global index records basic information of a complete data file, the page index records index information of a current index page, and the line index records key information of a current data line.
As shown in fig. 4, the global index record information includes: the total index is unique ID, a time stamp is created, a time stamp is derived, the total number of data pages, an overall compression algorithm, the size of data before compression, the size of data after compression, a total index check value and basic information of each data page. Wherein the overall compression algorithm adopts an open source compression algorithm. The complete data is compressed.
As shown in fig. 5, the page index diagram includes an index area and a data area, and the index area is used for storing index header information; the index header information includes a page number, a number of data pieces, an index header size, a data size before compression, a data size after compression, data check bits, and an offset of each data line. The data area comprises data row index, data information and data row check information.
And the size of each index page is 4G, when the data size of the newly added data and the current index page is smaller than 4G, the newly added data and the current index page are added to the current index page, and when the data size of the newly added data and the current index page is larger than 4G, the newly added index page is newly built and added to the newly added index page. And when the single piece of newly added data is larger than 4G, an index page is newly created, and the single piece of data independently generates the index page.
As shown in fig. 6, the row index is used to index a single piece of data, and record key information and data compression information of the single piece of index.
As shown in FIG. 7, displacement compression is used if a string (e.g., "ABC") occurs frequently, where ID is a feature unique key (e.g., unused "%" or "@" plus a string of unique values of numbers). The formula "XXXACXXABCXXXXABCXX" above can be recorded as "XXX% 20 XXXXXXX% 20 XXX" and "% 20, ABC,3,8, 16". The character string comprises 20 characters, the address of each character is 0-20, the address number of the first ABC is 3, the address number of the second ABC is 8, and the address number of the third ABC is 16. The displacement compression is used for recording character string information and character string offset information.
As shown in fig. 8, in the dictionary compression diagram, if key information such as place name, country, person name, sensitive entry frequently appears, symbolic addresses are used for replacement storage, for example, for "Chongqing", a first address ID1 is used, for "university", a second address ID2 is used, and for "Longzhong", a third address ID3 is used for replacement storage.
As shown in fig. 9, for some common phrases, if the occupied space of the ID string of the dictionary compression replacement is still large, the bitmap compression is adopted, for example, 64 bits exist in one long data, the data of the bits are defined according to the information category, the data of the bits represent first-class information, the data of the bits represent second-class information, and the like, if "male", "female", "beijing", "Chongqing" and "Chengdu" appear in the ID string, the addresses of the "male" and "female" belonging to the same-class information are put into the bits, and the addresses of the data ("beijing", "Chongqing" and "Chengdu") belonging to the same-class information are put into the bits.
The data dropping flow chart shown in fig. 10 includes the following steps:
starting an ETL program; data acquisition, data conversion and data loading program operation; judging whether the newly added data is abnormal data, if so, performing tray dropping, otherwise, not performing tray dropping, and returning to the running processes of the data acquisition, data conversion and data loading programs; judging whether the sizes of the newly added data and the last index page are larger than a set value, if so, newly creating an index page, otherwise, updating the newly added data to the last index page; updating the row index of the newly added data index; and updating the global index information.
Fig. 11 shows a flow chart of the landing data query, which includes the steps of: starting the data query software; querying a global index; inquiring a specific index page according to the global index; decompressing index page data; inquiring the row index information and the data information; and returning the inquired data.
According to the method, global indexes are adopted to index global data, page indexes are adopted to index all data rows of a current page, and row indexes are adopted to index single data, namely simple indexes including the global indexes, the page indexes and the row indexes are adopted to index the landing data, so that the efficiency of inquiring the landing data is greatly improved, and even under the condition that the landing data is large in data volume, the target data can be quickly inquired; and a simple data compression encryption mode is adopted, including displacement compression, dictionary compression and bitmap compression, and the data is compressed and encrypted at the same time, so that data information leakage caused by plaintext data is prevented.
The technical solution of the present invention is not limited to the limitations of the above specific embodiments, and all technical modifications made according to the technical solution of the present invention fall within the protection scope of the present invention.
Claims (8)
1. A simple indexing and encryption tray-dropping mechanism for ETL abnormal data is applied to abnormal data tray-dropping in the operation process of the ETL of the data, and is characterized by comprising the steps of establishing an index, carrying out encryption compression on the data and inquiring and accessing the data of the tray-dropping;
establishing an index comprises establishing a global index, a page index and a row index; the global index is used for recording basic information of the complete data file; the page index is used for recording the index information of the current index page; the row index is used for recording row index information of a current data row;
carrying out encryption compression on data, including displacement compression, dictionary compression and bitmap compression;
and (4) seeking and accessing the data on the disk, which comprises seeking the global index, seeking the index page according to the global index, decompressing the data of the index page, and seeking the index information of the line and the key information of the current data line.
2. The easy indexing and encryption destaging mechanism for ETL abnormal data as claimed in claim 1, wherein the basic information of the complete data file comprises: the method comprises the steps of unique ID of a total index, creation timestamp, derivation timestamp, total number of data pages, an overall compression algorithm for compressing data, data size before compression, data size after compression, a total index check value and basic information of each data page.
3. The easy indexing and encryption destaging mechanism for ETL abnormal data as claimed in claim 2, wherein the data page basic information comprises offset position of data page in whole storage file, data page content key word information and data line position information of important key word.
4. The easy indexing and encryption destaging mechanism for ETL exception data as recited in claim 1, wherein the index page comprises an index area and a data area; the index area is used for storing index header information;
the index header information comprises a page number, a data number, an index header size, a data size before compression, a data size after compression, a data check bit and each data line offset;
the data area comprises data row index, data information and data row check information.
5. The easy indexing and encryption destaging mechanism for ETL abnormal data as claimed in claim 1, wherein said row index is used to index a single piece of data, and the key information of the current data row comprises index row unique address, key information and data compression information.
6. The easy indexing and encryption destaging mechanism for ETL abnormal data as claimed in claim 1, wherein the displacement compression is used to record character string information and character string offset information, and when the occurrence frequency of the character string information and the character string offset information exceeds a set number of times, the displacement compression is performed; the dictionary compression is used for setting a keyword information base and replacing and storing keywords by symbolic addresses; the bitmap compression is used for storing keywords exceeding a set character string length according to a plurality of symbol addresses with set byte size.
7. The mechanism of claim 1, wherein the key information of the current data row comprises data information and data check bits.
8. The easy indexing and encryption destaging mechanism for ETL abnormal data as claimed in claim 1, wherein when the data size of the new data plus the current index page is smaller than a set value, the new data plus the current index page is appended to the current index page, and when the data size of the new data plus the current index page is larger than the set value, the new index page is created and appended to the new index page; and when the single piece of newly added data is larger than the set value, an index page is newly created, and the single piece of newly added data independently generates the index page.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110241032.0A CN112948386B (en) | 2021-03-04 | 2021-03-04 | Simple indexing and encrypting disk-dropping mechanism for ETL abnormal data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110241032.0A CN112948386B (en) | 2021-03-04 | 2021-03-04 | Simple indexing and encrypting disk-dropping mechanism for ETL abnormal data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112948386A true CN112948386A (en) | 2021-06-11 |
| CN112948386B CN112948386B (en) | 2023-09-22 |
Family
ID=76247670
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110241032.0A Active CN112948386B (en) | 2021-03-04 | 2021-03-04 | Simple indexing and encrypting disk-dropping mechanism for ETL abnormal data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112948386B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080162521A1 (en) * | 2006-12-28 | 2008-07-03 | James Browning | Compression of encrypted data in database management systems |
| US20130332484A1 (en) * | 2012-06-06 | 2013-12-12 | Rackspace Us, Inc. | Data Management and Indexing Across a Distributed Database |
| CN105354247A (en) * | 2015-10-13 | 2016-02-24 | 武汉大学 | Geographical video data organization management method supporting storage and calculation linkage |
| CN105471856A (en) * | 2015-11-19 | 2016-04-06 | 中国电子科技网络信息安全有限公司 | System and method used for retrieving and sharing large data center platform encryption files |
| CN105701096A (en) * | 2014-11-25 | 2016-06-22 | 腾讯科技（深圳）有限公司 | Index generation method, data inquiry method, index generation device, data inquiry device and system |
| CN106599040A (en) * | 2016-11-07 | 2017-04-26 | 中国科学院软件研究所 | Layered indexing method and search method for cloud storage |
| CN108040074A (en) * | 2018-01-26 | 2018-05-15 | 华南理工大学 | A kind of real-time network unusual checking system and method based on big data |
| CN109299106A (en) * | 2018-10-31 | 2019-02-01 | 中国联合网络通信集团有限公司 | Data query method and apparatus |
| EP3442158A1 (en) * | 2017-08-11 | 2019-02-13 | Palo Alto Research Center Incorporated | System and architecture for supporting analytics on encrypted databases |
| CN109492410A (en) * | 2018-10-09 | 2019-03-19 | 华南农业大学 | Data can search for encryption and keyword search methodology, system and terminal, equipment |
| CN109639811A (en) * | 2018-12-21 | 2019-04-16 | 北京金山云网络技术有限公司 | Data transmission method, date storage method, device, server and storage medium |
| CN111782661A (en) * | 2020-07-21 | 2020-10-16 | 杭州海康威视数字技术股份有限公司 | Data storage method, data query method and device |
-
2021
- 2021-03-04 CN CN202110241032.0A patent/CN112948386B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080162521A1 (en) * | 2006-12-28 | 2008-07-03 | James Browning | Compression of encrypted data in database management systems |
| US20130332484A1 (en) * | 2012-06-06 | 2013-12-12 | Rackspace Us, Inc. | Data Management and Indexing Across a Distributed Database |
| CN105701096A (en) * | 2014-11-25 | 2016-06-22 | 腾讯科技（深圳）有限公司 | Index generation method, data inquiry method, index generation device, data inquiry device and system |
| CN105354247A (en) * | 2015-10-13 | 2016-02-24 | 武汉大学 | Geographical video data organization management method supporting storage and calculation linkage |
| CN105471856A (en) * | 2015-11-19 | 2016-04-06 | 中国电子科技网络信息安全有限公司 | System and method used for retrieving and sharing large data center platform encryption files |
| CN106599040A (en) * | 2016-11-07 | 2017-04-26 | 中国科学院软件研究所 | Layered indexing method and search method for cloud storage |
| EP3442158A1 (en) * | 2017-08-11 | 2019-02-13 | Palo Alto Research Center Incorporated | System and architecture for supporting analytics on encrypted databases |
| CN108040074A (en) * | 2018-01-26 | 2018-05-15 | 华南理工大学 | A kind of real-time network unusual checking system and method based on big data |
| CN109492410A (en) * | 2018-10-09 | 2019-03-19 | 华南农业大学 | Data can search for encryption and keyword search methodology, system and terminal, equipment |
| CN109299106A (en) * | 2018-10-31 | 2019-02-01 | 中国联合网络通信集团有限公司 | Data query method and apparatus |
| CN109639811A (en) * | 2018-12-21 | 2019-04-16 | 北京金山云网络技术有限公司 | Data transmission method, date storage method, device, server and storage medium |
| CN111782661A (en) * | 2020-07-21 | 2020-10-16 | 杭州海康威视数字技术股份有限公司 | Data storage method, data query method and device |
Non-Patent Citations (3)
| Title |
|---|
| FEI WU等: "A low cost and inner-round pipelined design of ECB-AES-256 crypto engine for solid state disk", 《PROCEEDINGS OF THE 2010 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, ARCHITECTURE, AND STORAGE》, pages 485 - 491 * |
| 张泽军: "基于Ceph块存储的高可用ISCSI研究与应用", 《中国优秀硕士学位论文全文数据库 信息科技辑》, pages 137 - 34 * |
| 李德文: "流程工业分布式实时数据库研究与应用", 《中国优博士学位论文全文数据库 信息科技辑》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112948386B (en) | 2023-09-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2443564B1 (en) | Data compression for reducing storage requirements in a database system | |
| CN111339103B (en) | Data exchange method and system based on full-quantity fragmentation and incremental log analysis | |
| Hoffer et al. | The use of cluster analysis in physical data base design | |
| EP1866776B1 (en) | Method for detecting the presence of subblocks in a reduced-redundancy storage system | |
| US20080091698A1 (en) | Optimal data storage and access for clustered data in a relational database | |
| US20100284532A1 (en) | Systems for embedding information in data strings | |
| CN103685589B (en) | Binary coding-based domain name system (DNS) data compression and decompression methods and systems | |
| CN101676899A (en) | Profiling and inquiring method for massive database records | |
| US11593373B2 (en) | Compression, searching, and decompression of log messages | |
| WO2013136418A1 (en) | Log management computer and log management method | |
| US20110040761A1 (en) | Estimation of postings list length in a search system using an approximation table | |
| CN109388523A (en) | A method of based on binary log file access pattern MySQL database | |
| CN111291235A (en) | Metadata storage method and device based on time sequence database | |
| CN108984626B (en) | Data processing method and device and server | |
| US7676487B2 (en) | Method and system for formatting and indexing data | |
| CN112262379A (en) | Storing data items and identifying stored data items | |
| CN105912696A (en) | DNS (Domain Name System) index creating method and query method based on logarithm merging | |
| US7587513B1 (en) | Efficient storage of network and application data | |
| CN111008183A (en) | Storage method and system for business wind control log data | |
| Hua et al. | An enhanced wildcard-based fuzzy searching scheme in encrypted databases | |
| CN112948386A (en) | Simple indexing and encryption tray-dropping mechanism for ETL abnormal data | |
| CN101937464A (en) | Ciphertext search method based on word-for-word indexing | |
| US8918374B1 (en) | Compression of relational table data files | |
| JP4212615B2 (en) | Structured document search system, structured document search method, search device, and document management device | |
| KR100645513B1 (en) | Performance Management Data Processor for single table and Method thereof |
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 |