CN107741968B - Method, system and device for file retrieval and computer readable storage medium - Google Patents

Method, system and device for file retrieval and computer readable storage medium Download PDF

Info

Publication number
CN107741968B
CN107741968B CN201710929757.2A CN201710929757A CN107741968B CN 107741968 B CN107741968 B CN 107741968B CN 201710929757 A CN201710929757 A CN 201710929757A CN 107741968 B CN107741968 B CN 107741968B
Authority
CN
China
Prior art keywords
file
hash value
subdirectory
searched
directory
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
Application number
CN201710929757.2A
Other languages
Chinese (zh)
Other versions
CN107741968A (en
Inventor
玄加林
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhengzhou Yunhai Information Technology Co Ltd
Original Assignee
Zhengzhou Yunhai Information Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Zhengzhou Yunhai Information Technology Co Ltd filed Critical Zhengzhou Yunhai Information Technology Co Ltd
Priority to CN201710929757.2A priority Critical patent/CN107741968B/en
Publication of CN107741968A publication Critical patent/CN107741968A/en
Application granted granted Critical
Publication of CN107741968B publication Critical patent/CN107741968B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/13File access structures, e.g. distributed indices
    • G06F16/137Hash-based

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a file retrieval method, which comprises the steps of establishing a plurality of subdirectories under a top directory, respectively calculating the hash value of each file in the top directory, and respectively storing each file into the subdirectory corresponding to the hash value of each file; and calculating the hash value of the file to be searched, and determining a subdirectory where the file to be searched is located according to the hash value of the file to be searched so that the upper application program can call the file to be searched in the subdirectory. The invention reduces the range of file retrieval, improves the retrieval speed, reduces the waiting time of upper application programs, and obviously improves the user experience under the condition of large data volume. The invention also discloses a system and a device for file retrieval and a computer readable storage medium, which have the beneficial effects.

Description

Method, system and device for file retrieval and computer readable storage medium
Technical Field
The present invention relates to the field of retrieval, and in particular, to a method, system, apparatus, and computer-readable storage medium for retrieving a file.
Background
With the development of big data, the data has a longer and longer validity period, and in order to store the data, various manufacturers and research organizations propose various storage modes, such as disk arrays, distributed storage and the like. However, in any storage method, data needs to be saved as individual files in a file system at the operating system level. With the increasing of data volume, the number of files stored in the same top directory in the file system is gradually increased, and if an upper application program wants to call one or a group of files in the top directory to realize a certain function, the operating system needs to acquire information of all files in the top directory first, then search files meeting conditions from all file information, and finally return the searched one or a group of files to the upper application program for subsequent operation. When the data volume is large, the operating system will read a large amount of invalid data, which reduces the speed of file retrieval and increases the waiting time of the upper application program.
Therefore, how to provide a solution to the above-mentioned ending problem is a problem that needs to be solved by those skilled in the art.
Disclosure of Invention
The invention aims to provide a file retrieval method, which reduces the file retrieval range, improves the retrieval speed, reduces the waiting time of an upper application program, and obviously improves the user experience under the condition of large data volume; it is another object of the present invention to provide a system, apparatus and computer-readable storage medium for document retrieval.
In order to solve the above technical problem, the present invention provides a method for retrieving a file, comprising:
creating a plurality of subdirectories under a top directory, respectively calculating the hash value of each file in the top directory, and respectively storing each file into the subdirectory corresponding to the hash value of each file;
calculating the hash value of the file to be searched, and determining the subdirectory where the file to be searched is located according to the hash value of the file to be searched, so that an upper application program can call the file to be searched in the subdirectory.
Preferably, the process of respectively calculating the hash value of each file in the top-level directory specifically includes:
and respectively calculating the hash value of each file according to the file name of each file in the top-level directory.
Preferably, the process of respectively calculating the hash value of each file in the top-level directory specifically includes:
and respectively coding the file information of each file in the top-level directory, and respectively calculating the hash value of each file according to the code corresponding to each file, wherein the file information comprises a file name, a file size, a file creation date and a file modification date.
Preferably, the process of storing each file into the subdirectory corresponding to the hash value thereof is specifically as follows:
and respectively storing each file into the subdirectory corresponding to the lowest hash value of the file.
Preferably, the process of determining the subdirectory of the file to be searched according to the hash value of the file to be searched specifically includes:
step 11: entering a subdirectory corresponding to the lowest bit of the hash value of the file to be searched, and setting the subdirectory as a current directory, wherein the lowest bit is set as the current bit;
step 12: judging whether the current directory has a next level subdirectory, if so, entering a step 13, and if not, entering a step 14;
step 13: entering a next-level subdirectory corresponding to the current higher digit of the hash value of the file to be searched, taking the next-level subdirectory as a current directory, and taking the digit of the hash value corresponding to the current directory as the current digit, and entering step 12;
step 14: and determining the current directory as the subdirectory of the file to be searched.
In order to solve the above technical problem, the present invention further provides a system for retrieving a document, including:
the storage module is used for creating a plurality of subdirectories in a top directory, calculating the hash value of each file in the top directory respectively and storing each file into the subdirectory corresponding to the hash value of the file;
and the searching module is used for calculating the hash value of the file to be searched and determining the subdirectory where the file to be searched is located according to the hash value of the file to be searched so that an upper application program can call the file to be searched in the subdirectory.
Preferably, the storage module is specifically configured to calculate a hash value of each file according to a file name of each file in the top-level directory.
Preferably, the storage module is specifically configured to store each file into a subdirectory corresponding to the lowest hash value of the file.
In order to solve the above technical problem, the present invention further provides a file retrieving apparatus, including:
a memory for storing a computer program;
a processor for implementing the steps of the file retrieval method as described in any one of the above when the computer program is executed.
To solve the above technical problem, the present invention further provides a computer-readable storage medium, having a computer program stored thereon, where the computer program, when executed by a processor, implements the steps of the file retrieval method as described in any one of the above.
The invention provides a method for searching files, which comprises the steps of establishing a plurality of subdirectories under a top-level directory, respectively calculating the hash value of each file in the top-level directory, and respectively storing each file into the subdirectory corresponding to the hash value of each file; and calculating the hash value of the file to be searched, and determining a subdirectory where the file to be searched is located according to the hash value of the file to be searched so that the upper application program can call the file to be searched in the subdirectory.
Therefore, in practical application, by adopting the scheme of the invention, each file is stored in the subdirectory corresponding to the hash value of each file by creating the plurality of subdirectories in the top directory, when the file is searched, the accurate position of the file to be searched can be determined only according to the hash value of the file to be searched, the calling of an upper application program is facilitated, the file searching range is narrowed, the searching speed is improved, the waiting time of the upper application program is reduced, and the user experience is obviously improved under the condition of large data volume.
The invention also provides a system, a device and a computer readable storage medium for file retrieval, which have the same beneficial effects as the file retrieval method.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed in the prior art and the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.
FIG. 1 is a flow chart of a document retrieval method according to the present invention;
fig. 2 is a schematic structural diagram of a document retrieval system provided by the present invention.
Detailed Description
The core of the invention is to provide a method for retrieving files, which reduces the scope of retrieving files, improves the retrieving speed, reduces the waiting time of upper application programs, and obviously improves the user experience under the condition of large data volume; another core of the invention is to provide a system, a device and a computer readable storage medium for file retrieval.
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, fig. 1 is a flowchart of a file retrieval method provided by the present invention, including:
step 1: creating a plurality of subdirectories under a top-level directory;
step 2: respectively calculating the hash value of each file in the top directory, and respectively storing each file into the subdirectory corresponding to the hash value of each file;
specifically, when the total number of files in the top directory reaches a certain threshold, a plurality of subdirectories are created under the top directory, since the hash value calculated by the method is a 16-system number, the number of the subdirectories is 16, the corresponding naming mode can be DIR _0-DIR _ F, each file is stored in the subdirectory corresponding to the hash value according to the hash value calculated by each file, specifically, if the hash value of one file is 1234, the file can be stored in DIR _1 or DIR _4 according to different rules, the file is stored according to the method, a basis is provided for subsequent retrieval speed improvement, and the actual situation of the storage rule data is determined without limitation.
And step 3: and calculating the hash value of the file to be searched, and determining a subdirectory where the file to be searched is located according to the hash value of the file to be searched so that the upper application program can call the file to be searched in the subdirectory.
Specifically, the hash value of the file to be searched is calculated, the subdirectory where the file to be searched is located is found according to the hash value of the file to be searched, calling of an upper application program is facilitated, the file searching range is narrowed, the searching speed is improved, the waiting time of the upper application program is shortened, and user experience is remarkably improved under the condition of large data volume.
The invention provides a method for searching files, which comprises the steps of establishing a plurality of subdirectories under a top-level directory, respectively calculating the hash value of each file in the top-level directory, and respectively storing each file into the subdirectory corresponding to the hash value of each file; and calculating the hash value of the file to be searched, and determining a subdirectory where the file to be searched is located according to the hash value of the file to be searched so that the upper application program can call the file to be searched in the subdirectory.
Therefore, in practical application, by adopting the scheme of the invention, each file is stored in the subdirectory corresponding to the hash value of each file by creating the plurality of subdirectories in the top directory, when the file is searched, the accurate position of the file to be searched can be determined only according to the hash value of the file to be searched, the calling of an upper application program is facilitated, the file searching range is narrowed, the searching speed is improved, the waiting time of the upper application program is reduced, and the user experience is obviously improved under the condition of large data volume.
On the basis of the above-described embodiment:
as a preferred embodiment, the process of respectively calculating the hash value of each file in the top directory specifically includes:
and respectively calculating the hash value of each file according to the file name of each file in the top-level directory.
As a preferred embodiment, the process of respectively calculating the hash value of each file in the top directory specifically includes:
and respectively coding the file information of each file in the top directory, and respectively calculating the hash value of each file according to the code corresponding to each file, wherein the file information comprises a file name, a file size, a file creation date and a file modification date.
Specifically, when a file is searched, a hash value corresponding to the file is calculated according to the attribute of the file, a basis is provided for improving the operation speed, a commonly used method for calculating the hash value is to calculate according to the file name of the file, and in order to enable the hash value of the file to be more accurate and representative, the file name, the file size, the file creation date and the file modification date of the file are encoded, and the encoded hash value is calculated to serve as the hash value of the file.
Of course, the method for calculating the hash value may be other than the two methods described above, and the present invention is not limited herein.
As a preferred embodiment, the process of storing each file in the subdirectory corresponding to the hash value thereof is specifically as follows:
and storing each file in the subdirectory corresponding to the lowest hash value of each file.
Specifically, assuming that the hash value of a file is 0XA4CEE0D2, the file is stored in/root/DIR _2, where a root is a top-level directory, it can be understood that, if the number of files in the subdirectory DIR _2 also meets a preset threshold, the subdirectory DIR _2 is also split into 16 new next-level subdirectories, and the file is stored in/root/DIR _2/DIR _ D and so on according to the hash value of the file.
Of course, the storage rule of the document may be that the document is stored forward according to the lowest position, or may be stored backward according to the highest position, or other storage modes, and the invention is not limited herein.
As a preferred embodiment, the process of determining the subdirectory of the file to be searched according to the hash value of the file to be searched specifically includes:
step 11: entering a subdirectory corresponding to the lowest bit of the hash value of the file to be searched, setting the subdirectory as a current directory, and setting the lowest bit as the current bit;
step 12: judging whether the current directory has a next level subdirectory, if so, entering a step 13, and if not, entering a step 14;
step 13: entering a next level subdirectory corresponding to a higher digit of the current digit of the hash value of the file to be searched, taking the next level subdirectory as the current directory, taking the digit of the hash value corresponding to the current directory as the current digit, and entering step 12;
step 14: and determining the current directory as the subdirectory where the file to be searched is located.
Specifically, the hash value of the file to be searched is calculated in advance, assuming that the hash value of the file to be searched obtained by calculation is 0XA4CEE0D2, when searching, the subdirectory corresponding to the lowest bit of the hash value is found from the top directory as the current directory, namely DIR _2, and after entering DIR _2, whether DIR _2 exists in the next level subdirectory is judged, if yes, the next level subdirectory, namely root/DIR _2/DIR _ D, is entered into the next level subdirectory according to the second last bit of the hash value, at this time, DIR _ D is taken as the current directory, whether DIR _ D exists in the next level subdirectory is judged, if yes, the next level subdirectory is entered according to the third last bit of the hash value, namely root/DIR _2/DIR _ D/DIR _0, whether DIR _0 exists in the next level subdirectory is judged, and the process is repeated until the next level subdirectory corresponding to a certain bit of the hash value does not exist, and determining the level subdirectory as the subdirectory where the file to be searched is located so that the upper application program can call the subdirectory.
In conclusion, the files are stored and retrieved in a layered mode according to the hash values of the files, so that the file retrieval range is narrowed, and the retrieval speed is obviously improved.
Referring to fig. 2, fig. 2 is a schematic structural diagram of a file retrieval system provided by the present invention, including:
the storage module 1 is used for creating a plurality of subdirectories in the top directory, calculating hash values of all files in the top directory respectively, and storing all files into the subdirectories corresponding to the hash values of all files;
and the searching module 2 is used for calculating the hash value of the file to be searched, and determining the subdirectory where the file to be searched is located according to the hash value of the file to be searched, so that the upper application program can call the file to be searched in the subdirectory.
As a preferred embodiment, the storage module 1 is specifically configured to calculate the hash value of each file according to the file name of each file in the top-level directory.
As a preferred embodiment, the storage module 1 is specifically configured to store each file in a subdirectory corresponding to the lowest hash value of each file.
In order to solve the above technical problem, the present invention further provides a file retrieving apparatus, including:
a memory for storing a computer program;
a processor for implementing the steps of the file retrieval method as described in any one of the above when executing the computer program.
In order to solve the above technical problem, the present invention further provides a computer-readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the steps of the file retrieval method according to any one of the above.
For the introduction of the system, the apparatus and the computer-readable storage medium for file retrieval provided by the present invention, please refer to the above embodiments, which are not repeated herein.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. The device disclosed by the embodiment corresponds to the method disclosed by the embodiment, so that the description is simple, and the relevant points can be referred to the method part for description.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (9)

1. A method of document retrieval, comprising:
creating a plurality of subdirectories under a top directory, respectively calculating the hash value of each file in the top directory, and respectively storing each file into the subdirectory corresponding to the hash value of each file;
calculating a hash value of a file to be searched, and determining a subdirectory where the file to be searched is located according to the hash value of the file to be searched so that an upper application program can call the file to be searched in the subdirectory;
the process of determining the subdirectory of the file to be searched according to the hash value of the file to be searched specifically comprises the following steps:
step 11: entering a subdirectory corresponding to the lowest bit of the hash value of the file to be searched, and setting the subdirectory as a current directory, wherein the lowest bit is set as the current bit;
step 12: judging whether the current directory has a next level subdirectory, if so, entering a step 13, and if not, entering a step 14;
step 13: entering a next-level subdirectory corresponding to the current higher digit of the hash value of the file to be searched, taking the next-level subdirectory as a current directory, and taking the digit of the hash value corresponding to the current directory as the current digit, and entering step 12;
step 14: and determining the current directory as the subdirectory of the file to be searched.
2. The method according to claim 1, wherein the process of respectively calculating the hash value of each file in the top-level directory specifically comprises:
and respectively calculating the hash value of each file according to the file name of each file in the top-level directory.
3. The method according to claim 1, wherein the process of respectively calculating the hash value of each file in the top-level directory specifically comprises:
and respectively coding the file information of each file in the top-level directory, and respectively calculating the hash value of each file according to the code corresponding to each file, wherein the file information comprises a file name, a file size, a file creation date and a file modification date.
4. The method according to claim 1, wherein the process of storing each file in the subdirectory corresponding to the hash value thereof is specifically as follows:
and respectively storing each file into the subdirectory corresponding to the lowest hash value of the file.
5. A system for document retrieval, comprising:
the storage module is used for creating a plurality of subdirectories in a top directory, calculating the hash value of each file in the top directory respectively and storing each file into the subdirectory corresponding to the hash value of the file;
the searching module is used for calculating the hash value of the file to be searched and determining the subdirectory where the file to be searched is located according to the hash value of the file to be searched so that an upper application program can call the file to be searched in the subdirectory;
the process of determining the subdirectory of the file to be searched according to the hash value of the file to be searched specifically comprises the following steps:
step 11: entering a subdirectory corresponding to the lowest bit of the hash value of the file to be searched, and setting the subdirectory as a current directory, wherein the lowest bit is set as the current bit;
step 12: judging whether the current directory has a next level subdirectory, if so, entering a step 13, and if not, entering a step 14;
step 13: entering a next-level subdirectory corresponding to the current higher digit of the hash value of the file to be searched, taking the next-level subdirectory as a current directory, and taking the digit of the hash value corresponding to the current directory as the current digit, and entering step 12;
step 14: and determining the current directory as the subdirectory of the file to be searched.
6. The system according to claim 5, wherein the storage module is specifically configured to calculate a hash value of each file according to a file name of each file in the top-level directory.
7. The system according to claim 5, wherein the storage module is specifically configured to store each of the files in a subdirectory corresponding to a lowest hash value of the file.
8. An apparatus for document retrieval, comprising:
a memory for storing a computer program;
a processor for implementing the steps of the file retrieval method of any one of claims 1 to 4 when executing said computer program.
9. A computer-readable storage medium, characterized in that a computer program is stored on the computer-readable storage medium, which computer program, when being executed by a processor, carries out the steps of the file retrieval method according to any one of claims 1 to 4.
CN201710929757.2A 2017-10-09 2017-10-09 Method, system and device for file retrieval and computer readable storage medium Active CN107741968B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710929757.2A CN107741968B (en) 2017-10-09 2017-10-09 Method, system and device for file retrieval and computer readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710929757.2A CN107741968B (en) 2017-10-09 2017-10-09 Method, system and device for file retrieval and computer readable storage medium

Publications (2)

Publication Number Publication Date
CN107741968A CN107741968A (en) 2018-02-27
CN107741968B true CN107741968B (en) 2021-06-29

Family

ID=61236767

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710929757.2A Active CN107741968B (en) 2017-10-09 2017-10-09 Method, system and device for file retrieval and computer readable storage medium

Country Status (1)

Country Link
CN (1) CN107741968B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108595715B (en) * 2018-05-15 2020-09-11 厦门市美亚柏科信息股份有限公司 File marking and arrangement analysis method, terminal equipment and storage medium
CN111061681A (en) * 2019-11-15 2020-04-24 浪潮电子信息产业股份有限公司 Method and device for partitioning directory based on case insensitivity and storage medium
CN115238257B (en) * 2022-09-26 2023-01-06 深圳市亲邻科技有限公司 Access control face permission updating method and device, computer equipment and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101196929A (en) * 2007-12-29 2008-06-11 中国科学院计算技术研究所 Metadata management method for splitting name space
CN102725755A (en) * 2011-12-31 2012-10-10 华为技术有限公司 Method and system of file access
CN103384256A (en) * 2012-05-02 2013-11-06 天津书生投资有限公司 Cloud storage method and device
CN105701096A (en) * 2014-11-25 2016-06-22 腾讯科技(深圳)有限公司 Index generation method, data inquiry method, index generation device, data inquiry device and system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101196929A (en) * 2007-12-29 2008-06-11 中国科学院计算技术研究所 Metadata management method for splitting name space
CN102725755A (en) * 2011-12-31 2012-10-10 华为技术有限公司 Method and system of file access
CN103384256A (en) * 2012-05-02 2013-11-06 天津书生投资有限公司 Cloud storage method and device
CN105701096A (en) * 2014-11-25 2016-06-22 腾讯科技(深圳)有限公司 Index generation method, data inquiry method, index generation device, data inquiry device and system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"基于有序哈希树的 RPKI 资料库数据同步方法";许圣明 等;《计算机***应用》;20160630;第142-143页 *

Also Published As

Publication number Publication date
CN107741968A (en) 2018-02-27

Similar Documents

Publication Publication Date Title
CN107741968B (en) Method, system and device for file retrieval and computer readable storage medium
US8719237B2 (en) Method and apparatus for deleting duplicate data
CN106874481B (en) Method and system for reading metadata information of distributed file system
CN105468642A (en) Data storage method and apparatus
CN110659257B (en) Metadata object repairing method, device, equipment and readable storage medium
CN112734982A (en) Storage method and system for unmanned vehicle driving behavior data
CN107402870B (en) Method and device for processing log segment in metadata server
CN111159130A (en) Small file merging method and electronic equipment
CN105824827A (en) File path storage and local file visiting method and apparatus
CN111125088B (en) Multi-level data processing method and device
CN111552438B (en) Method, device, server and storage medium for writing object
CN113468080A (en) Caching method, system and related device for full flash metadata
US20200372068A1 (en) Photo processing method, device and computer equipment
CN111984650A (en) Storage method, system and related device of tree structure data
CN111143294B (en) Data retrieval method and device for power acquisition terminal and electronic equipment
CN106446080B (en) Data query method, query service equipment, client equipment and data system
JP7180769B2 (en) Data management device, control method, and storage medium
CN110489355B (en) Mapping method and system of logic BRAM
CN110688379B (en) Data storage method, system, storage medium and electronic equipment
CN113343141A (en) Webpage obtaining method and device
CN110880005B (en) Vector index establishing method and device and vector retrieving method and device
CN107301073B (en) Configuration information retrieval method and device based on solid state disk system
US20140081986A1 (en) Computing device and method for generating sequence indexes for data files
CN113760535B (en) Resource providing method and device and service platform
CN110688325B (en) Garbage recycling method, device and equipment for solid state disk and storage medium

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