WO2021056798A1 - Dispositif, appareil et procédé de réparation de métadonnées et support de stockage - Google Patents

Dispositif, appareil et procédé de réparation de métadonnées et support de stockage Download PDF

Info

Publication number
WO2021056798A1
WO2021056798A1 PCT/CN2019/121099 CN2019121099W WO2021056798A1 WO 2021056798 A1 WO2021056798 A1 WO 2021056798A1 CN 2019121099 W CN2019121099 W CN 2019121099W WO 2021056798 A1 WO2021056798 A1 WO 2021056798A1
Authority
WO
WIPO (PCT)
Prior art keywords
search tree
current
node information
metadata
tree
Prior art date
Application number
PCT/CN2019/121099
Other languages
English (en)
Chinese (zh)
Inventor
肖计伟
Original Assignee
苏州浪潮智能科技有限公司
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 苏州浪潮智能科技有限公司 filed Critical 苏州浪潮智能科技有限公司
Publication of WO2021056798A1 publication Critical patent/WO2021056798A1/fr

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/21—Design, administration or maintenance of databases
    • G06F16/215—Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
    • 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
    • G06F16/2246—Trees, e.g. B+trees
    • 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/23—Updating

Definitions

  • This application relates to the field of data processing, and in particular to a method, device, equipment and storage medium for metadata restoration.
  • Metadata also known as intermediary data and relay data, is data describing data, mainly information describing data attributes, and is used to support functions such as indicating storage location, historical data, resource search, and file recording.
  • metadata that has not been stored to the disk in the cache device may be lost, which may cause the interruption of system services.
  • the purpose of this application is to provide a metadata repair method, device, equipment, and storage medium to implement metadata repair and ensure the normal operation of system services.
  • this application provides a metadata repair method, including:
  • the search tree includes a first search tree and a second search tree having a corresponding relationship with the first search tree;
  • the metadata is repaired by using the repaired first search tree and the repaired second search tree.
  • performing verification and repair between the current first search tree and the current second search tree based on the correspondence relationship includes:
  • obtaining the current first search tree and the current second search tree according to the root node information includes:
  • the method further includes:
  • the root information and bitmap information of the repaired metadata are updated by using the repaired first search tree and the repaired second search tree.
  • verifying the node information of the search tree according to the root node information includes:
  • the search tree includes a B+ tree.
  • the node information in the current first search tree includes a first key-value pair mapped from a logical block address of the metadata to a physical block address;
  • the node information in the current second search tree includes the second key-value pair mapped from the physical block address of the metadata to the logical block address;
  • the method After traversing the node information in the current second search tree, and verifying the corresponding node information in the current first search tree according to the node information in the current second search tree and the corresponding relationship, the method further includes:
  • the method further includes:
  • this application also provides a metadata restoration device, including:
  • a root node obtaining module configured to obtain root node information of a search tree corresponding to metadata, the search tree including a first search tree and a second search tree having a corresponding relationship with the first search tree;
  • the search tree obtaining module is used to obtain the current first search tree and the current second search tree according to the root node information
  • the verification and repair module is used to perform verification and repair between the current first search tree and the current second search tree based on the corresponding relationship;
  • the metadata recovery module is used to recover the metadata by using the repaired first search tree and the repaired second search tree.
  • this application also provides a metadata repair device, including:
  • Memory used to store computer programs
  • the processor is used to implement the steps of the above-mentioned metadata repair method when the computer program is executed.
  • the present application also provides a computer-readable storage medium with a computer program stored on the computer-readable storage medium, and when the computer program is executed by a processor, the steps of the above-mentioned metadata repair method are realized.
  • the metadata restoration method provided by the present application first obtains the root node information of the search tree corresponding to the metadata.
  • the search tree includes a first search tree and a second search tree corresponding to the first search tree, and then according to the root node Information acquisition of the current first search tree and the current second search tree, and based on the corresponding relationship between the first search tree and the second search tree, perform mutual verification and repair between the current first search tree and the current second search tree, Finally, the metadata is repaired by using the repaired first search tree and the repaired second search tree.
  • this method verifies the abnormality of the metadata based on the first search tree and the second search tree that correspond to the metadata and have a corresponding relationship with each other, and perform the verification when the metadata is abnormal.
  • the present application also provides a metadata restoration device, equipment, and storage medium, and the beneficial effects are the same as those described above.
  • FIG. 1 is a flowchart of a method for repairing metadata disclosed in an embodiment of the application
  • FIG. 3 is a flowchart of a method for repairing metadata disclosed in an embodiment of the application
  • FIG. 5 is a flowchart of a method for repairing metadata disclosed in an embodiment of the application.
  • Fig. 6 is a schematic structural diagram of a metadata repairing device disclosed in an embodiment of the application.
  • Metadata also known as intermediary data and relay data, is data describing data, mainly information describing data attributes, and is used to support functions such as indicating storage location, historical data, resource search, and file recording.
  • metadata that has not been stored to the disk in the cache device may be lost, which may cause the interruption of system services.
  • the core of this application is to provide a metadata repair method to implement metadata repair and ensure the normal operation of system services.
  • an embodiment of the present application discloses a method for repairing metadata, including:
  • Step S10 Obtain the root node information of the search tree corresponding to the metadata.
  • the search tree includes a first search tree and a second search tree having a corresponding relationship with the first search tree.
  • metadata is recorded in the form of a search tree and cached in the memory of the device.
  • the metadata cached in the device memory is lost due to a power failure or failure of the device, it can be stored in the disk.
  • the root node information of the search tree reorganizes the search tree lost in the memory.
  • This step is an operation performed when the metadata cached in the device memory is lost. Since the root node information of the search tree often records the index information of the child nodes or leaf nodes below the root node, so According to the root node information of the search tree, the child nodes of the root node can be further indexed, and then the information of the next level child nodes or leaf nodes can be further indexed by the information of the child nodes.
  • Each node in the search tree is normally stored on the disk. In the state, it can search according to the root node information of the search tree and reorganize it into a complete search tree in the device memory.
  • the search tree includes a first search tree and a second search tree.
  • the corresponding relationship referred to here is based on the first search tree.
  • the content of a search tree can be converted to obtain the corresponding content of the second search tree, or the content of the first search tree can be converted to obtain the corresponding content of the first search tree according to the content of the second search tree.
  • the corresponding relationship between the first search tree and the second search tree may be a functional relationship, that is to say, the nodes in the second search tree can be generated after substituting the functional relationship into the functional relationship based on the node information in the first search tree.
  • the node information in the first search tree can be generated after substituting the function relationship into the function relationship based on the node information in the second search tree.
  • the node information referred to here is the information on which the metadata is restored.
  • Step S11 Acquire the current first search tree and the current second search tree according to the root node information.
  • This step is to traverse the node information of all levels of the first search tree in the disk according to the root node information of the first search tree, and organize the generation of the current first search tree. At the same time, this step is also based on the root node of the second search tree.
  • the information traverses the node information at all levels of the second search tree in the disk, and organizes and generates the current second search tree.
  • the current first search tree can be regarded as the first search tree with missing node information
  • the current second search tree can be regarded as the second search tree with missing node information.
  • Step S12 Perform verification and repair between the current first search tree and the current second search tree based on the corresponding relationship.
  • this step is further based on the corresponding relationship between the first search tree and the second search tree, using the node information in the current first search tree to verify the current first search tree.
  • the ultimate goal of this step is to perform complementary verification and repair between the current first search tree and the current second search tree based on the corresponding relationship.
  • Step S13 Use the repaired first search tree and the repaired second search tree to repair the metadata.
  • the metadata is further repaired by using the repaired first search tree and the repaired second search tree.
  • the process of repairing metadata is essentially to obtain corresponding node information from the repaired first search tree and the repaired second search tree, and reorganize the node information into metadata in the memory of the device.
  • the type of the search tree in this embodiment may specifically be a B+ tree. Since the traversal efficiency of the B+ tree is higher, the traversal of the lower-level node information can be realized more efficiently according to the root node information of the B+ tree.
  • the leaf nodes on the B+ tree store keywords and the addresses of the corresponding records, that is, the node information that constitutes the metadata, and the levels above the leaf nodes are used as indexes
  • the first B+ tree root node is used to retrieve the first of the leaf nodes according to the index nodes at all levels below the root node. Node information, and retrieve and verify whether there is second node information corresponding to the first node information in the leaf nodes through the index nodes at all levels below the root node of the second B+ tree.
  • the first node information is converted into the second node information according to the corresponding relationship and inserted into the second B+ tree.
  • the index nodes at all levels of the root node of the second B+ tree The second node information in the leaf node is retrieved, and the index nodes at all levels below the root node of the first B+ tree are retrieved and verified whether there is first node information corresponding to the second node information in the leaf node, if If it does not exist, according to the corresponding relationship between the second B+ tree and the first B+ tree, the second node information is converted into the first node information according to the corresponding relationship and inserted into the first B+ tree.
  • the metadata restoration method provided by the present application first obtains the root node information of the search tree corresponding to the metadata.
  • the search tree includes a first search tree and a second search tree corresponding to the first search tree, and then according to the root node Information acquisition of the current first search tree and the current second search tree, and based on the corresponding relationship between the first search tree and the second search tree, perform mutual verification and repair between the current first search tree and the current second search tree, Finally, the metadata is repaired by using the repaired first search tree and the repaired second search tree.
  • this method verifies the abnormality of the metadata based on the first search tree and the second search tree that correspond to the metadata and have a corresponding relationship with each other, and perform the verification when the metadata is abnormal.
  • Mutual repairs are used to restore the metadata through the restored first search tree and the second search tree to realize the repair of the metadata and ensure the normal operation of system services.
  • an embodiment of the present application discloses a method for repairing metadata, including:
  • Step S20 Obtain the root node information of the search tree corresponding to the metadata.
  • the search tree includes a first search tree and a second search tree that has a corresponding relationship with the first search tree.
  • Step S21 Acquire the current first search tree and the current second search tree according to the root node information.
  • Step S22 Traverse the node information in the current first search tree, and verify the corresponding node information in the current second search tree according to the node information in the current first search tree and the corresponding relationship.
  • Step S23 When there is no node information corresponding to the node information in the current first search tree in the current second search tree, generate corresponding node information in the current second search tree according to the node information in the current first search tree .
  • Step S24 traverse the node information in the current second search tree, and verify the corresponding node information in the current first search tree according to the node information in the current second search tree and the corresponding relationship.
  • Step S25 When there is no node information corresponding to the node information in the current second search tree in the current first search tree, generate corresponding node information in the current first search tree according to the node information in the current second search tree .
  • Step S26 Use the restored first search tree and the restored second search tree to restore the metadata.
  • the current second search tree is checked and repaired according to the current first search tree, and the current second search tree is checked and merged according to the current second search tree. Repair the current first search tree.
  • the current first search tree is traversed, and each node information traversed is based on the difference between the first search tree and the second search tree. The corresponding relationship is converted into the node information corresponding to the current second search tree to check whether the node information is missing in the current second search tree.
  • the current second search tree lacks the node, and then the current first search tree
  • the node information in the search tree generates corresponding node information in the current second search tree; in the stage of verifying and repairing the current first search tree according to the current second search tree, the current second search tree is traversed, Each node information traversed is converted into node information corresponding to the current first search tree based on the corresponding relationship between the second search tree and the first search tree, so as to check whether the node information is missing in the current first search tree. If it is, the current first search tree is missing the node, and corresponding node information is further generated in the current first search tree according to the node information in the current second search tree.
  • step S22 to step S23 and the process from step S24 to step S25 in this embodiment are executed in no order, and they can also be executed at the same time.
  • This embodiment searches the corresponding node information in the current second search tree one by one by traversing the current first search tree, and supplements the missing node information in the current second search tree; in the same way, through the current second search
  • the tree traverses the corresponding node information in the current first search tree one by one, and supplements the missing node information in the current first search tree. Because the current first search tree and the second search tree are traversed The completion of node information further ensures the integrity of the repaired first search tree and the repaired second search tree.
  • an embodiment of the present application discloses a metadata repair method, including:
  • Step S30 Obtain the root node information of the search tree corresponding to the metadata.
  • the search tree includes a first search tree and a second search tree having a corresponding relationship with the first search tree.
  • Step S31 Check the node information of the search tree according to the root node information.
  • Step S32 Obtain the current first search tree and the current second search tree composed of the node information that has passed the verification.
  • Step S33 Traverse the node information in the current first search tree, and verify the corresponding node information in the current second search tree according to the node information in the current first search tree and the corresponding relationship.
  • Step S34 When there is no node information corresponding to the node information in the current first search tree in the current second search tree, generate corresponding node information in the current second search tree according to the node information in the current first search tree .
  • Step S35 Traverse the node information in the current second search tree, and verify the corresponding node information in the current first search tree according to the node information in the current second search tree and the corresponding relationship.
  • Step S36 When there is no node information corresponding to the node information in the current second search tree in the current first search tree, generate corresponding node information in the current first search tree according to the node information in the current second search tree .
  • Step S37 Use the restored first search tree and the restored second search tree to restore the metadata.
  • the focus of this embodiment is that when generating the current first search tree and the current second search tree, the node information traversed based on the root node information is verified according to the root node information of the first or second search tree. Whether it is damaged, and organize the undamaged node information into the current first search tree or the current second search tree.
  • the verification process is essentially based on the root node information to retrieve the node information of the next level node, and check the node information The completeness of the system is checked, and the check methods that can be used include but are not limited to parity check, redundancy check, MD5 check, etc.
  • verifying the node information of the search tree according to the root node information includes:
  • the node information of the search tree is traversed according to the node index information in the root node information, and the node information of the search tree is checked by means of cyclic redundancy check.
  • cyclic redundancy check (CyclicRedundancyCheck, CRC) is a hash function that generates a short fixed-digit check code based on network data packets or computer files and other data, mainly used to detect or verify data Errors that may occur after transmission or saving can take up less system resources and can be implemented with software and hardware.
  • This embodiment can further ensure the integrity and availability of node information in the current first search tree and the current second search tree, thereby improving the accuracy of metadata restoration.
  • an embodiment of the present application discloses a method for repairing metadata, including:
  • Step S40 Obtain the root node information of the search tree corresponding to the metadata.
  • the search tree includes a first search tree and a second search tree having a corresponding relationship with the first search tree.
  • Step S41 Check the node information of the search tree according to the root node information.
  • Step S42 Obtain the current first search tree and the current second search tree composed of the node information that has passed the verification.
  • Step S43 Repair the root information and bitmap information of the metadata according to the current first search tree and the second search tree.
  • Step S44 Traverse the node information in the current first search tree, and verify the corresponding node information in the current second search tree according to the node information in the current first search tree and the corresponding relationship.
  • Step S45 When there is no node information corresponding to the node information in the current first search tree in the current second search tree, generate corresponding node information in the current second search tree according to the node information in the current first search tree .
  • Step S46 Traverse the node information in the current second search tree, and verify the corresponding node information in the current first search tree according to the node information in the current second search tree and the corresponding relationship.
  • Step S47 When there is no node information corresponding to the node information in the current second search tree in the current first search tree, generate corresponding node information in the current first search tree according to the node information in the current second search tree .
  • Step S48 Use the restored first search tree and the restored second search tree to update the root information and bitmap information of the restored metadata.
  • this embodiment further repairs the root information and metadata of the metadata according to the current first search tree and the second search tree.
  • the purpose of bitmap information is to ensure that the metadata is initially available, and then after verifying and repairing each other based on the current first search tree and the current second search tree, after generating the repaired first search tree and the repaired second search tree, The root information and bitmap information of the repaired metadata are further updated by using the repaired first search tree and the repaired second search tree, so as to further ensure the integrity of the metadata as a whole. This embodiment relatively ensures the efficiency of re-using the metadata.
  • an embodiment of the present application discloses a metadata restoration method, including:
  • Step S50 Obtain the root node information of the search tree corresponding to the metadata.
  • the search tree includes a first search tree and a second search tree that has a corresponding relationship with the first search tree.
  • Step S51 Obtain the current first search tree and the current second search tree according to the root node information.
  • the node information in the current first search tree includes the first key-value pair mapped from the logical block address of the metadata to the physical block address
  • the node information in the current second search tree includes the second key-value pair mapped from the physical block address of the metadata to the logical block address.
  • Step S52 Traverse the node information in the current first search tree, and verify the corresponding node information in the current second search tree according to the node information in the current first search tree and the corresponding relationship.
  • Step S53 When there is no node information corresponding to the node information in the current first search tree in the current second search tree, generate corresponding node information in the current second search tree according to the node information in the current first search tree .
  • Step S54 Traverse the node information in the current second search tree, and verify the corresponding node information in the current first search tree according to the node information in the current second search tree and the corresponding relationship.
  • Step S55 When there is target node information in the current second search tree that does not match the node information of the current first search tree, delete the target node information in the current second search tree.
  • Step S56 When there is no node information corresponding to the node information in the current second search tree in the current first search tree, generate corresponding node information in the current first search tree according to the node information in the current second search tree .
  • Step S57 Use the restored first search tree and the restored second search tree to restore the metadata.
  • the current first search tree is the same as the first search tree
  • the content of the node information includes the first key-value pair mapped from the logical block address of the metadata to the physical block address
  • the second search tree is the same as the second search tree.
  • the content of the node information includes the second key-value pair mapped from the physical block address of the metadata to the logical block address.
  • the first key-value pair is often one value corresponding to multiple keys
  • the second A key-value pair is often a key corresponding to multiple values, so there will be a key-value mismatch between the first key-value pair and the second key-value, that is, the current second search tree does not match the current first search
  • the node information of the tree matches the target node information.
  • the second key-value pair represents the multiple mappings of the physical block address of the metadata to the logical block address, it is not credible, so the current second The target node information in the search tree is deleted, and this embodiment can further improve the accuracy of metadata restoration.
  • the method further includes:
  • the ratio threshold refers to The proportion of metadata that supports the normal operation of the system business. If the proportion of the repaired metadata to the total metadata reaches the proportion threshold, the system business corresponding to the metadata will be re-run; otherwise, the user will be prompted with an exception to the manual Ways to adopt relevant measures to continue to repair metadata. This embodiment further ensures the reliable work of the corresponding system services after the metadata is repaired.
  • LBA Logical Block Address, logical block address
  • PBA Physics Block Address, physical block address
  • an embodiment of the present application discloses a metadata restoration device, including:
  • the root node obtaining module 10 is configured to obtain root node information of a search tree corresponding to metadata, the search tree including a first search tree and a second search tree having a corresponding relationship with the first search tree;
  • the search tree obtaining module 11 is configured to obtain the current first search tree and the current second search tree according to the root node information
  • the verification and repair module 12 is configured to perform verification and repair between the current first search tree and the current second search tree based on the corresponding relationship;
  • the metadata recovery module 13 is configured to use the repaired first search tree and the repaired second search tree to repair the metadata.
  • the metadata restoration device provided by the present application first obtains the root node information of the search tree corresponding to the metadata.
  • the search tree includes a first search tree and a second search tree corresponding to the first search tree, and then according to the root node Information acquisition of the current first search tree and the current second search tree, and based on the corresponding relationship between the first search tree and the second search tree, perform mutual verification and repair between the current first search tree and the current second search tree, Finally, the metadata is repaired by using the repaired first search tree and the repaired second search tree.
  • this device verifies the abnormality of the metadata based on the first search tree and the second search tree that correspond to the metadata and have a corresponding relationship with each other, and perform the verification when the metadata is abnormal.
  • Mutual repairs are used to restore the metadata through the restored first search tree and the second search tree to realize the repair of the metadata and ensure the normal operation of system services.
  • this application also provides a metadata repair device, including:
  • Memory used to store computer programs
  • the processor is used to implement the steps of the above-mentioned metadata repair method when the computer program is executed.
  • the metadata restoration device provided by the present application first obtains the root node information of the search tree corresponding to the metadata.
  • the search tree includes a first search tree and a second search tree corresponding to the first search tree, and then according to the root node Information acquisition of the current first search tree and the current second search tree, and based on the corresponding relationship between the first search tree and the second search tree, perform mutual verification and repair between the current first search tree and the current second search tree, Finally, the metadata is repaired by using the repaired first search tree and the repaired second search tree.
  • this device verifies the abnormality of the metadata based on the first search tree and the second search tree that correspond to the metadata and have a corresponding relationship with each other, and perform verification when the metadata is abnormal.
  • Mutual repairs are used to restore the metadata through the restored first search tree and the second search tree to realize the repair of the metadata and ensure the normal operation of system services.
  • the present invention also provides a computer-readable storage medium with a computer program stored on the computer-readable storage medium, and when the computer program is executed by a processor, the steps of the above-mentioned metadata repair method are implemented.
  • the computer-readable storage medium provided in this application first obtains the root node information of the search tree corresponding to metadata.
  • the search tree includes a first search tree and a second search tree corresponding to the first search tree.
  • the node information obtains the current first search tree and the current second search tree, and performs mutual verification and repair between the current first search tree and the current second search tree based on the corresponding relationship between the first search tree and the second search tree , And finally use the repaired first search tree and repaired second search tree to repair the metadata.
  • the computer-readable storage medium verifies the abnormality of the metadata based on the first search tree and the second search tree corresponding to the metadata and has a corresponding relationship with each other, and the metadata is found in the verification.
  • mutual repair is performed, so that the metadata is restored through the restored first search tree and the second search tree, which realizes the repair of the metadata and ensures the normal operation of the system business.

Landscapes

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

Abstract

L'invention concerne un dispositif, un appareil et un procédé de réparation de métadonnées et un support de stockage. Les étapes du procédé consistent à : obtenir des informations de nœud racine d'un arbre de recherche correspondant à des métadonnées, l'arbre de recherche comprenant un premier arbre de recherche et un second arbre de recherche présentant une correspondance avec le premier arbre de recherche ; obtenir le premier arbre de recherche courant et le second arbre de recherche courant en fonction des informations de nœud racine ; effectuer une vérification et une réparation entre le premier arbre de recherche courant et le second arbre de recherche courant sur la base de la correspondance ; et réparer les métadonnées à l'aide du premier arbre de recherche réparé et du second arbre de recherche réparé. Le procédé met en œuvre une réparation de métadonnées et assure le fonctionnement normal d'un service de système. De plus, la présente invention concerne en outre un dispositif et un appareil de réparation de métadonnées et le support de stockage et les effets avantageux sont les mêmes que ceux décrits ci-dessus.
PCT/CN2019/121099 2019-09-29 2019-11-27 Dispositif, appareil et procédé de réparation de métadonnées et support de stockage WO2021056798A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910931233.6A CN110704412A (zh) 2019-09-29 2019-09-29 一种元数据修复方法、装置、设备及存储介质
CN201910931233.6 2019-09-29

Publications (1)

Publication Number Publication Date
WO2021056798A1 true WO2021056798A1 (fr) 2021-04-01

Family

ID=69197251

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/121099 WO2021056798A1 (fr) 2019-09-29 2019-11-27 Dispositif, appareil et procédé de réparation de métadonnées et support de stockage

Country Status (2)

Country Link
CN (1) CN110704412A (fr)
WO (1) WO2021056798A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111858468B (zh) * 2020-07-22 2023-01-10 苏州浪潮智能科技有限公司 分布式文件系统元数据校验方法、系统、终端及存储介质

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104199888A (zh) * 2014-08-25 2014-12-10 厦门市美亚柏科信息股份有限公司 弹性文件系统的数据恢复方法和装置
CN104376091A (zh) * 2014-11-20 2015-02-25 厦门市美亚柏科信息股份有限公司 对SQLite中删除的数据进行恢复的方法及装置
CN106708665A (zh) * 2016-12-20 2017-05-24 华为技术有限公司 一种元数据修复方法和装置
US10055420B1 (en) * 2015-06-30 2018-08-21 EMC IP Holding Company LLC Method to optimize random IOS of a storage device for multiple versions of backups using incremental metadata
US20190065322A1 (en) * 2017-08-31 2019-02-28 Cohesity, Inc. Restoring a database using a fully hydrated backup
CN110058969A (zh) * 2019-04-18 2019-07-26 腾讯科技（深圳）有限公司 一种数据恢复方法及装置

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104199888A (zh) * 2014-08-25 2014-12-10 厦门市美亚柏科信息股份有限公司 弹性文件系统的数据恢复方法和装置
CN104376091A (zh) * 2014-11-20 2015-02-25 厦门市美亚柏科信息股份有限公司 对SQLite中删除的数据进行恢复的方法及装置
US10055420B1 (en) * 2015-06-30 2018-08-21 EMC IP Holding Company LLC Method to optimize random IOS of a storage device for multiple versions of backups using incremental metadata
CN106708665A (zh) * 2016-12-20 2017-05-24 华为技术有限公司 一种元数据修复方法和装置
US20190065322A1 (en) * 2017-08-31 2019-02-28 Cohesity, Inc. Restoring a database using a fully hydrated backup
CN110058969A (zh) * 2019-04-18 2019-07-26 腾讯科技（深圳）有限公司 一种数据恢复方法及装置

Also Published As

Publication number Publication date
CN110704412A (zh) 2020-01-17

Similar Documents

Publication Publication Date Title
US7478113B1 (en) Boundaries
US10366074B2 (en) Systems and methods for migrating database data
US9436722B1 (en) Parallel checksumming of data chunks of a shared data object using a log-structured file system
US9396073B2 (en) Optimizing restores of deduplicated data
US8006126B2 (en) Data integrity validation in storage systems
US9547549B2 (en) Handling file system corruption
US20130346716A1 (en) Verifying encoded data slice integrity in a dispersed storage network
WO2021135280A1 (fr) Procédé de contrôle de données pour système de stockage distribué, et appareil associé
US20130173546A1 (en) Systems and methods for migrating database data
US7793166B2 (en) Methods and systems for recovering meta-data in a cache memory after a corruption event
CN107193871B (zh) 数据库修复方法及装置
CN111625396B (zh) 备份数据的校验方法、服务器及存储介质
WO2020119143A1 (fr) Procédé et système de récupération d'enregistrements supprimés d'une base de données
CN110659257B (zh) 一种元数据对象修复方法、装置、设备及可读存储介质
CN104217174A (zh) 分布式文件安全存储系统及其存储方法
US8762336B2 (en) Geo-verification and repair
CN112131609A (zh) 基于Merkle树的电能质量数据交换格式文件完整性校验方法及系统
WO2021056798A1 (fr) Dispositif, appareil et procédé de réparation de métadonnées et support de stockage
CN112306753A (zh) 一种数据修复方法、装置及系统
CN112307022A (zh) 一种元数据修复方法及相关装置
CN115514644B (zh) 表项一致性检查方法、电子设备及存储介质
CN111259020A (zh) 一种校验多存储卷拷贝一致性的方法、系统、设备及介质
CN110807000A (zh) 一种文件修复方法、装置、电子设备和存储介质
CN116401229A (zh) 数据库的数据校验方法、装置及设备
US20230114368A1 (en) Object metadata maintenance pertinent to object restoration

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19946498

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19946498

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 19946498

Country of ref document: EP

Kind code of ref document: A1