CN109492049B - Data processing, block generation and synchronization method for block chain network - Google Patents
Data processing, block generation and synchronization method for block chain network Download PDFInfo
- Publication number
- CN109492049B CN109492049B CN201811108985.4A CN201811108985A CN109492049B CN 109492049 B CN109492049 B CN 109492049B CN 201811108985 A CN201811108985 A CN 201811108985A CN 109492049 B CN109492049 B CN 109492049B
- Authority
- CN
- China
- Prior art keywords
- block
- deleted
- data
- hash value
- data list
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Storage Device Security (AREA)
- Computer And Data Communications (AREA)
Abstract
A data processing, block generation and synchronization method, a computing device, a storage medium for a blockchain network, the data processing method comprising: A. generating a deletion identifier in response to block data stored in a preset storage space being deleted, the deletion identifier indicating the deleted block data, the preset storage space being accessible by at least one block link point in a blockchain network, the block data being associated with a target block; B. and adding the deletion identifier into a deleted data list, wherein the deleted data list is stored in the preset storage space. According to the technical scheme, the block data associated with each block in the block chain can be deleted.
Description
Technical Field
The present invention relates to the field of blockchain technologies, and in particular, to a data processing, block generating, and synchronization method for a blockchain network.
Background
Blockchains (Blockchain) are intelligent peer-to-peer networks that use distributed databases to identify, disseminate, and document information, also known as value internet. The block chain technology comprises the steps of storing data in a block structure, guaranteeing transmission and access safety by using cryptography and the like, and can realize a technical system of data consistency storage, tamper resistance and decentration.
Currently, in partial blockchain networks, each node has a full amount of ledger data copies. With the development of business, data on the book can continuously increase. The data in the block chain is divided into blocks for storage, and each block comprises a HASH value (HASH) of a previous block, a HASH of the block and the data of the block. The HASH of the current block is generated based on the HASH of the previous block and the data of the current block. Any block loss or data change results in an inability to verify the integrity and non-tamper of the entire block chain.
Disclosure of Invention
The embodiment of the invention provides a data processing, block generating and synchronizing method for a block chain network.
An embodiment of the present invention provides a data processing method for a blockchain network, where a target block in the blockchain network includes a hash value of a previous block of the target block, a hash value of the target block, and a hash value and a storage address of each block data in at least one block data associated with the target block, the hash value of the target block is generated according to the hash value and the storage address of each block data in the at least one block data and the hash value of the previous block, the storage address of each block data indicates a storage location of the block data in a preset storage space, and the preset storage space is accessible by at least one block link node in the blockchain network, and the method includes: A. generating a deletion identifier in response to deletion of the block data stored in the preset storage space, wherein the deletion identifier indicates the deleted block data; B. and adding the deletion identifier into a deleted data list, wherein the deleted data list is stored in the preset storage space.
In the scheme of this embodiment, the block data and the blocks associated therewith are stored separately, and a deleted data list is formed when the block data is deleted, so that deletion of the block data associated with each block in the block chain can be realized, the data amount of the data stored in the block chain network is reduced, and flexibility of data storage in the block chain network is realized.
An embodiment of the present invention further provides a computing device including a processor and a memory, a target block in a blockchain network includes a hash value of a previous block of the target block, a hash value and a storage address of each block data in at least one block data associated with the target block, the hash value of the target block is generated according to the hash value and the storage address of each block data in the at least one block data and the hash value of the previous block, the storage address of each block data indicates a storage location of the block data in a preset storage space, the preset storage space is accessible by at least one block link point in the blockchain network, the computing device includes a processor and a memory, the memory has stored thereon computer instructions capable of running on the processor, the processor, when executing the computer instructions, performs the steps of: A. generating a deletion identifier in response to deletion of block data stored in a preset storage space, wherein the deletion identifier indicates the deleted block data; B. and adding the deletion identifier into a deleted data list, wherein the deleted data list is stored in the preset storage space.
The embodiment of the invention also provides a block generation method for the block chain network, which comprises the following steps: A. obtaining the hash value of the previous block; B. acquiring a deleted data list and generating a hash value of the deleted data list, wherein the deleted data list comprises a deletion identifier, the deletion identifier indicates deleted block data, the deletion identifier is generated in response to deletion of the block data stored in a preset storage space, the deleted data list is stored in the preset storage space, and the preset storage space can be accessed by at least one block link point in the block chain network; C. generating a hash value of a current block according to the hash value and the storage address of the deleted data list and the hash value of the previous block, wherein the storage address of the deleted data list indicates a storage position of the deleted data list in the preset storage space; D. generating the current block at least based on the hash value of the previous block, the hash value of the current block, the hash value of the deleted data list, and a storage address, wherein the current block is connected after the previous block.
According to the scheme of the embodiment, the hash value and the storage address of the deleted data list can be recorded in the block, the access path of the deleted data list can be provided through the storage address, and whether the deleted data list which is stored separately is tampered or not can be verified by using the hash value of the deleted data list.
The embodiment of the present invention further provides a computing device, which includes a processor and a memory, where the memory stores computer instructions capable of running on the processor, and when the processor runs the computer instructions, the processor executes the following steps: A. obtaining the hash value of the previous block; B. acquiring a deleted data list and generating a hash value of the deleted data list, wherein the deleted data list comprises a deletion identifier, the deletion identifier indicates deleted block data, the deletion identifier is generated in response to deletion of the block data stored in a preset storage space, the deleted data list is stored in the preset storage space, and the preset storage space can be accessed by at least one block link point in the block chain network; C. generating a hash value of a current block according to the hash value and the storage address of the deleted data list and the hash value of the previous block, wherein the storage address of the deleted data list indicates a storage position of the deleted data list in the preset storage space; D. generating the current block at least based on the hash value of the previous block, the hash value of the current block, the hash value of the deleted data list, and a storage address, wherein the current block is connected after the previous block.
The embodiment of the invention also provides a synchronization method for the block chain network, which comprises the following steps: A. acquiring a current block, wherein the current block comprises a hash value of a previous block, a hash value of the current block, a hash value of a deleted data list and a storage address, the deleted data list comprises an identifier of deleted data, the identifier of the deleted data indicates deleted block data, the deletion identifier is generated in response to deletion of block data stored in a preset storage space, and the deleted data list is stored in the preset storage space; B. verifying the current block according to the hash value of the previous block and the hash value of the current block, and connecting the current block behind the previous block when the current block passes the verification; wherein the storage address of the deleted data list indicates a storage location of the deleted data list in a preset storage space, and the preset storage space is accessible to at least a part of the blockchain link points in the blockchain network.
In the solution of this embodiment, the block on the blockchain may include a storage address of the deleted data list, so that the blockchain node in the blockchain network can obtain the deleted data list after synchronizing to the block, and thus the blockchain node can know whether each piece of block data is deleted.
The embodiment of the present invention further provides a computing device, which includes a processor and a memory, where the memory stores computer instructions capable of running on the processor, and when the processor runs the computer instructions, the processor executes the following steps: A. acquiring a current block, wherein the current block comprises a hash value of a previous block, a hash value of the current block, a hash value of a deleted data list and a storage address, the deleted data list comprises an identifier of deleted data, the identifier of the deleted data indicates deleted block data, the deletion identifier is generated in response to deletion of block data stored in a preset storage space, and the deleted data list is stored in the preset storage space; B. verifying the current block according to the hash value of the previous block and the hash value of the current block, and connecting the current block behind the previous block when the current block passes the verification; wherein the storage address of the deleted data list indicates a storage location of the deleted data list in a preset storage space, and the preset storage space is accessible to at least a part of the blockchain link points in the blockchain network.
The embodiment of the invention also provides a storage medium, wherein computer instructions are stored on the storage medium, and the computer instructions execute the steps of the method when running.
Drawings
Fig. 1 is a flowchart of a data processing method for a blockchain network according to an embodiment of the present invention;
fig. 2 is a flowchart of another data processing method for a blockchain network according to an embodiment of the present invention;
fig. 3 is a flowchart of a block generation method for a blockchain network according to an embodiment of the present invention;
FIG. 4 is a schematic structural diagram of a current block generated based on the method shown in FIG. 3;
fig. 5 is a flowchart of a synchronization method for a blockchain network according to an embodiment of the present invention.
Detailed Description
The inventor of the present application finds that the block data in the existing block chain cannot be deleted, because after deletion, after the newly added node acquires the data of the block chain, the correctness of the block data cannot be verified. Therefore, in the face of the continuously increasing blockchain data, the old data cannot generate business value, but cannot be deleted, and a large amount of storage resources and computing resources are occupied.
The embodiment of the invention provides a data processing method for a block chain network, which comprises the following steps: generating a deletion identifier in response to block data stored in a preset storage space being deleted, the deletion identifier indicating the deleted block data, the preset storage space being accessible by at least one block link point in a blockchain network, the block data being associated with a target block; adding the deletion identifier into a deleted data list, wherein the deleted data list is stored in the preset storage space; the target block comprises a hash value of a previous block of the target block, a hash value and a storage address of each block data in at least one block data associated with the target block, the hash value of the target block is generated according to the hash value and the storage address of each block data in the at least one block data and the hash value of the previous block, and the storage address of each block data indicates a storage position of the block data in the preset storage space.
In the scheme of this embodiment, the block data and the associated block header are stored separately, and a deleted data list is formed when the block data is deleted, so that deletion of the block data associated with each block in the block chain can be realized, and flexibility of network data storage of the block chain is realized.
Various exemplary embodiments of the present disclosure are described in detail below with reference to the accompanying drawings. The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of methods and systems according to various embodiments of the present disclosure. It should be noted that each block in the flowchart or block diagrams may represent a module, a program segment, or a portion of code, which may include one or more executable instructions for implementing the logical function specified in the respective embodiment. It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
As used herein, the terms "comprising," "including," and the like are to be construed as open-ended terms, i.e., "including/including but not limited to," meaning that additional content can be included as well. In the present disclosure, the term "based on" is "based at least in part on"; the term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment".
"chunk data" as referred to herein includes transaction data in at least one transaction. Further, a plurality of the tile data may be associated with the same tile. More specifically, by synchronizing the blocks, the storage addresses of the respective block data of the plurality of block data can be acquired.
For another example, the block data may also include transaction data in all transactions included in a single service, such as transaction data generated by all block chain nodes associated in a single asset transfer service in all transactions of the asset transfer service, or transaction data generated by upstream and downstream block chain nodes associated in a single supply chain financial service in all transactions of the supply chain financial service.
"transaction data" as it appears herein refers to: transactions (transactions) are the various data generated during the course of a transaction. Further, the transaction data may include various intermediate data generated during the transaction process and various result data obtained after the transaction process is completed.
The "preset storage space" appearing herein means: data storage space accessible by at least a portion of the blockchain link points in the blockchain network, and more particularly, to data storage space accessible by blockchain link points capable of generating blocks in the blockchain network. For example, the predetermined storage space may be a memory local to a block link point capable of generating a block. For another example, the predetermined storage space may also be an external server (e.g., a cloud server, or a portion of the storage space in the cloud server) coupled to the blockchain node capable of generating the block.
The "memory address" appearing herein refers to: an identifier (e.g., a character string or a combination of character strings) of a storage location of the block data in the preset storage space can uniquely determine the storage location of the block data in the preset storage space according to the storage address. For example, the memory address may be represented based on at least one or more of the following protocols: file protocol (e.g., file://); hypertext Transfer Protocol (HTTP); file Transfer Protocol (FTP).
"deletion marker" appearing herein refers to: an identifier indicating the deleted tile data is generated, for example, based on or at a storage address, a file name, or the like of the tile data that can be deleted.
The "deleted data list" appearing herein refers to a list in which deletion identifications of the deleted tile data are recorded. Further, the deleted data list may be associated with the tile as one of the tile data. That is, by synchronizing the blocks, the storage addresses of the deleted data list can be acquired. In one non-limiting embodiment, after the deleted block data is restored, the deletion identifier of the deleted block data may be removed from the deleted data list.
The "flag" appearing herein refers to: is a character that distinguishes the deleted data list from the indicator of the block data. The identification bit may be, for example, a single character or a string of multiple characters.
It should be understood that these exemplary embodiments are given solely for the purpose of enabling those skilled in the art to better understand and thereby implement the embodiments of the present disclosure, and are not intended to limit the scope of the invention in any way.
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in detail below.
Fig. 1 is a flowchart of a data processing method for a blockchain network according to an embodiment of the present invention.
The blockchain network may include a plurality of blockchain nodes that may be in communication with each other, and the blockchain nodes may be various suitable computing devices, such as Personal Computers (PCs), servers, smart phones, and the like. The method of this embodiment may be performed on the blockchain node side. For example, the tile data associated with tile 1 generated by the tile chain node 1 is deleted, and the tile chain node 1 may perform the steps of the method.
In one non-limiting embodiment, a block link point may perform the method of the present embodiment by invoking a delete intelligence contract.
Specifically, in this embodiment, the data processing method for a blockchain network may include the following steps:
102, adding the deletion identifier into a deleted data list, wherein the deleted data list is stored in the preset storage space;
the target block comprises a hash value of a previous block of the target block, a hash value and a storage address of each block data in at least one block data associated with the target block, the hash value of the target block is generated according to the hash value and the storage address of each block data in the at least one block data and the hash value of the previous block, and the storage address of each block data indicates a storage position of the block data in the preset storage space.
It should be noted that the sequence numbers of the steps in this embodiment do not represent a limitation on the execution sequence of the steps.
In one non-limiting embodiment, the memory address may be represented in a variety of suitable ways. For example, it can be represented based on at least the following protocol: file protocol (e.g., file://); hypertext Transfer Protocol (HTTP); file Transfer Protocol (FTP).
In one non-limiting embodiment, the hash value may be calculated by applying one or more of the following algorithms to the data to be processed: message Digest Algorithm fifth edition (Message Digest Algorithm MD5, MD5 for short), cipher Hash Algorithm (sensor middle 3, SM3 for short), Secure Hash Algorithm (Secure Hash Algorithm SHA)1, SHA256, SHA384, SHA128, SHA2567, and other algorithms (hereinafter, referred to as Hash algorithms) and the like.
For example, SHA256 algorithm may be used to perform a hash calculation on the tile data to generate a hash value for the tile data. For another example, the MD5 algorithm may be used to perform a hash calculation on the hash value of the tile data, the storage address, and the hash value of the previous tile together to generate the hash value of the target tile.
In this embodiment, the deletion flag is generated when the block data is deleted. The deletion flag has a corresponding relationship with the deleted tile data, in other words, the deletion flag indicates the deleted tile data. In a specific implementation, if a plurality of tile data are deleted simultaneously, the corresponding deletion identifier may be generated for the deleted tile data one by one.
In an implementation of step 102, the deletion identifier may be added to a deleted data list. The deleted data list is stored in a preset storage space. That is, the predetermined storage space may store the tile data and the deleted data list at the same time.
In this embodiment, the block data and its associated block are stored separately, and the verification of the block data are also separate.
It should be understood by those skilled in the art that the target block associated with the deleted block data is verified according to the hash value of the block before the target block and the hash value of the target block. And the hash value of the target block is generated according to the hash value and the storage address of the deleted block data and the hash value of the previous block. That is to say, after the block data is deleted, the hash value of the deleted block data in the target block is not affected, and the verification process of the target block in the block synchronization process is not affected, so that the block data can be deleted without affecting the block chain.
In one non-limiting embodiment, the step S101 may include one of the following steps: generating the deletion identifier according to the storage address of the deleted block data; generating the deletion identifier according to the storage address of the deleted block data and the hash value; or generating the deletion identifier according to the identifier of the deleted block data.
In one non-limiting embodiment, please refer to table 1. Table 1 shows a deleted data list. The deleted data list includes an identification of the block data that was deleted, such as block data 1, block data 2, and block data 3. The identifier of the block data in table 1 may also be replaced with the storage address of the deleted block data, for example, storage address 1, storage address 2, storage address 3; the identification of the chunk data in table 1 may also be replaced by the storage address of the deleted chunk data and the hash value of the deleted chunk data, for example, storage address 1+ hash value 1, storage address 2+ hash value 2, storage address 3+ hash value 3.
TABLE 1
| Delete mark |
| Block data 1 |
| Block data 2 |
| Block data 3 |
In one non-limiting embodiment, please refer to FIG. 2. The data processing method shown in fig. 1 may further include the steps of:
step 201: detecting whether the deleted block data is reserved in a backup storage space in response to a data recovery request for the deleted block data;
step 202: if the deleted block data are reserved in the backup storage space, moving the deleted block data from the backup storage space to a storage position indicated by the storage address in the preset storage space;
step 203: updating the deleted data list to remove the deletion identifier of the deleted block data.
It should be noted that step 201 is executed after step 102 shown in fig. 1.
In this embodiment, after the block data is deleted, the block link point may also recover the deleted data. The block data is deleted, which means that the block data is moved from the storage address of the block data to the backup storage space. The backup storage space may be a local storage where the block link point of the block data is deleted; the backup storage space may also be an external server (e.g., a cloud server, or a portion of the storage space in the cloud server) that deletes the block link node of the block data.
Restoring deleted block data refers to: and moving the deleted block data from the backup storage space to a storage position indicated by the storage address of the deleted block data in the preset storage space.
As described above, the deleted data list includes the deletion flag indicating the deleted block data, and if the deleted block data is restored, the deleted data list is updated, that is, the deletion flag of the deleted block data is removed.
By the scheme of the embodiment, the block data can be recovered after being deleted, and the flexibility of data storage in the block chain network is further realized.
In one non-limiting embodiment, step 101 shown in FIG. 1 may also be preceded by the following steps: traversing all block data in the preset storage space, and selecting the block data with the storage duration exceeding a preset duration threshold, or selecting the block data with the storage space occupied exceeding a preset space threshold; and deleting the selected block data.
Since the block data with the storage duration exceeding the preset duration threshold, that is, the historical data may not generate value and occupy the storage resources in the block chain network, the scheme of the embodiment can automatically traverse all the block data in the preset storage space, and screen out the block data with the storage duration exceeding the preset duration threshold for deletion. Or, in order to fully utilize the storage resources in the blockchain network, the block data occupying the storage space exceeding the preset space threshold may be selected for deletion.
The embodiment of the invention also discloses a computing device. Those skilled in the art understand that the computing device of the present embodiment is used to implement the method technical solution described in the above embodiment shown in fig. 1 or fig. 2.
Specifically, in this embodiment, the computing device may include a processor and a memory, where the memory stores computer instructions capable of being executed on the processor, and the processor executes the computer instructions to perform the following steps: generating a deletion identifier in response to block data stored in a preset storage space being deleted, the deletion identifier indicating the deleted block data, the preset storage space being accessible by at least one block link point in a blockchain network, the block data being associated with a target block; adding the deletion identifier into a deleted data list, wherein the deleted data list is stored in the preset storage space;
the target block comprises a hash value of a previous block of the target block, a hash value and a storage address of each block data in at least one block data associated with the target block, the hash value of the target block is generated according to the hash value and the storage address of each block data in the at least one block data and the hash value of the previous block, and the storage address of each block data indicates a storage position of the block data in the preset storage space.
In one non-limiting embodiment, the processor, when executing the computer instructions, further performs the steps of: generating the deletion identifier according to the storage address of the deleted block data; or generating the deletion identifier according to the storage address of the deleted block data and the hash value; or generating the deletion identifier according to the identifier of the deleted block data.
In one non-limiting embodiment, the processor, when executing the computer instructions, further performs the steps of: detecting whether the deleted block data is reserved in a backup storage space in response to a data recovery request for the deleted block data; if the deleted block data are reserved in the backup storage space, moving the deleted block data from the backup storage space to a storage position indicated by the storage address in the preset storage space; updating the deleted data list to remove the deletion identifier of the deleted block data.
In one non-limiting embodiment, the deleted tile data is determined by the processor executing the computer instructions to perform the following steps: traversing all block data in the preset storage space, and selecting the block data with the storage time length exceeding a preset time length threshold value, or selecting the block data with the storage space occupied exceeding a preset space threshold value
For more contents of the working principle and the working mode of the computing device, reference may be made to the related description in fig. 1 or fig. 2, which is not described herein again.
Fig. 3 is a flowchart of a block generation method for a blockchain network according to an embodiment of the present invention. The scheme of the present embodiment may be performed by generating block link points of the block.
Specifically, in this embodiment, the method for generating a block for a blockchain network may include the following steps:
step 301: obtaining the hash value of the previous block;
step 302: acquiring a deleted data list and generating a hash value of the deleted data list, wherein the deleted data list comprises a deletion identifier, the deletion identifier indicates deleted block data, the deletion identifier is generated in response to deletion of the block data stored in a preset storage space, the deleted data list is stored in the preset storage space, and the preset storage space can be accessed by at least one block link point in the block chain network;
step 303: generating a hash value of a current block according to the hash value and the storage address of the deleted data list and the hash value of the previous block, wherein the storage address of the deleted data list indicates a storage position of the deleted data list in the preset storage space;
step 304: generating the current block at least based on the hash value of the previous block, the hash value of the current block, the hash value of the deleted data list, and a storage address, wherein the current block is connected after the previous block.
It is to be understood that the timing to perform the above steps is when the deleted data list is generated or updated. Updating the deleted data list may refer to adding a deletion flag or removing a deletion flag in the deleted data list.
In this embodiment, the current chunk generated in step 304 may include the hash value of the previous chunk, the hash value of the current chunk, the hash value of the deleted data list, and a storage address.
In this embodiment, the generation process of the block is described as an example when only the deleted data list is generated or updated, and the generation process of the block should not be limited to this embodiment. If the deleted data list is generated (or updated) and new block data is generated at the same time, step 302 may also generate a hash value of the block data when the current block is generated; step 303 may generate a hash value of the current chunk according to the hash value and the storage address of the deleted data list, the hash value and the storage address of the chunk data, and the hash value of the previous chunk; step 304 may generate the current chunk based on the hash value of the previous chunk, the hash value of the current chunk, the hash value and storage address of the deleted data list, and the hash value and storage address of the chunk data.
In one non-limiting embodiment, the step 304 may further include: and generating the current block based on the hash value of the previous block, the hash value of the current block, the hash value of the deleted data list, a storage address and a flag bit, wherein the flag bit is an indicator for distinguishing the deleted data list from the block data.
The difference from the current block generated in the previous embodiment is that the data of the current block generated in the present embodiment further includes a flag bit. The flag bit and the storage address of the deleted data list have a corresponding relation. In other words, the storage address of the deleted data list corresponding to the block can be determined by the flag bit in the block.
In one non-limiting embodiment, referring to fig. 4, in the block header information 40 of the current block, the following information may be contained: the hash value 41 of the previous block, the hash value 42 of the current block, the hash value 43 of the deleted data list, and a storage address 44, where the storage address 44 indicates a storage location in a preset storage space where the deleted data list is stored.
The block header information 40 of the current block may further include a hash value of the block data and a storage address of the block data.
Those skilled in the art will understand that, in fact, according to the solution of the present embodiment, the current block and the block header information 40 may be substantially equivalent, that is, the current block generated according to the solution of the present embodiment only includes the block header information, and the deleted data list associated with the block header information is separately stored in the predetermined storage space.
The embodiment of the invention also discloses a computing device. Those skilled in the art will understand that the computing device of the present embodiment is configured to implement the method solution described in the embodiment shown in fig. 3.
Specifically, in this embodiment, the computing device may include a processor and a memory, where the memory stores computer instructions capable of being executed on the processor, and the processor executes the computer instructions to perform the following steps: obtaining the hash value of the previous block; acquiring a deleted data list and generating a hash value of the deleted data list, wherein the deleted data list comprises a deletion identifier, the deletion identifier indicates deleted block data, the deletion identifier is generated in response to deletion of the block data stored in a preset storage space, the deleted data list is stored in the preset storage space, and the preset storage space can be accessed by at least one block link point in the block chain network; generating a hash value of a current block according to the hash value and the storage address of the deleted data list and the hash value of the previous block, wherein the storage address of the deleted data list indicates a storage position of the deleted data list in the preset storage space; generating the current block at least based on the hash value of the previous block, the hash value of the current block, the hash value of the deleted data list, and a storage address, wherein the current block is connected after the previous block.
In one non-limiting embodiment, when the processor executes the computer instructions to perform the step of generating the current chunk based on at least the hash value of the previous chunk, the hash value of the current chunk, the hash value of the deleted data list, and a storage address, the method further performs the steps of:
and generating the current block based on the hash value of the previous block, the hash value of the current block, the hash value of the deleted data list, a storage address and a flag bit, wherein the flag bit is an indicator for distinguishing the deleted data list from the block data.
For more details on the working principle and the working mode of the computing device, reference may be made to the related description in fig. 3 and fig. 4, which is not described herein again.
Referring to fig. 5, fig. 5 is a flowchart illustrating a synchronization method for a blockchain network according to an embodiment of the present invention. The scheme of this embodiment may be performed by blockchain nodes other than the blockchain link point of the generated block (e.g., existing blockchain nodes or newly added blockchain nodes in a blockchain network).
Specifically, in this embodiment, the method for generating a block for a blockchain network may include the following steps:
step 501: acquiring a current block, wherein the current block comprises a hash value of a previous block, a hash value of the current block, a hash value of a deleted data list and a storage address, the deleted data list comprises an identifier of deleted data, the identifier of the deleted data indicates deleted block data, the deletion identifier is generated in response to deletion of block data stored in a preset storage space, and the deleted data list is stored in the preset storage space;
step 502: verifying the current block according to the hash value of the previous block and the hash value of the current block, and connecting the current block behind the previous block when the current block passes the verification;
wherein the storage address of the deleted data list indicates a storage location of the deleted data list in a preset storage space, and the preset storage space is accessible to at least a part of the blockchain link points in the blockchain network.
Through the steps 501 and 502, the synchronization of the current block can be realized, so that the data included in the current block, such as the hash value of the previous block, the hash value of the current block, the hash value of the deleted data list, and the storage address, can be obtained.
In one non-limiting embodiment, the synchronization method shown in fig. 5 may further include the steps of: acquiring the deleted data list according to the storage address of the deleted data list; and adjusting the storage state of the locally stored block data according to the deleted data list.
It will be appreciated that the above steps may be performed by existing blockchain nodes in the blockchain network.
In specific implementation, after an existing block chain node is synchronized to a current block, a storage address of a deleted data list can be determined, so that the deleted data list can be directly obtained from a storage position in a preset storage space indicated by the storage address. In addition, since the deleted data list includes the deletion identifier of the deleted block data, the existing block chain node may adjust the storage state of the locally stored block data according to the deletion identifier in the deleted data list.
For example, in the case of adding a new deletion identifier in the deleted data list, the existing blockchain node may delete the blockchain data indicated by the locally added deletion identifier. For another example, when the deletion identifier is removed from the deleted data list, the existing blockchain node may restore the blockchain node that is different from the blockchain node indicated by the deletion identifier.
In one non-limiting embodiment, the synchronization method shown in fig. 5 may further include the steps of: acquiring the deleted data list according to the storage address of the deleted data list; copying at least a part of block data in the preset storage space according to the deleted data list.
It will be appreciated that the above steps may be performed by newly added blockchain nodes in the blockchain network.
In specific implementation, after a link point of a newly added block is synchronized to a current block, a storage address of a deleted data list can be determined, so that the deleted data list can be directly obtained from a storage position in a preset storage space indicated by the storage address. In addition, since the deleted data list includes the deletion identifier of the deleted block data, the newly added block link point may copy at least a portion of the block data according to the deletion identifier.
For example, the deleted data list includes a deletion identifier of the deleted block data, and when copying the block data, the newly added block link point may copy only block data other than the block data indicated by the deletion identifier in the deleted data list, without copying the block data indicated by the deletion identifier in the deleted data list.
It should be noted that the newly added block link point may not be necessary to copy the block data according to the deleted data list. In this case, the newly added block link point may duplicate all block data.
In one non-limiting embodiment, the step of obtaining the deleted data list according to the storage address of the deleted data list is performed when the current block includes the flag bit of the deleted data list.
In this embodiment, the current block may include a flag bit. The blockchain node may obtain the flag bit through the synchronization block. As described above, the flag bit corresponds to the storage address of the deleted data list. Therefore, once the block link point acquires the flag bit in the current block, the deleted data list can be acquired from the storage position indicated by the storage address corresponding to the flag bit.
In a variation, when copying data, the block chain node may first send a data copy request to the block chain node that generates the block or a designated block link point, and send data from the block link point that generates the block or the designated block link point.
For example, an existing block link node sends a data replication request, and a block link node that generates a block or a designated block link node sends newly generated block data or a deleted data list to the existing block link node.
For another example, the newly added block link node sends a data replication request, and the block link node of the generated block or the designated block link node sends all the block data and the deleted data list to the newly added block link node. Or, the newly added block link point sends a data replication request, generates a block link node of the block or a designated block link node, determines the deleted block data according to the deleted data list, and sends other block data except the deleted block data to the newly added block link point.
For another example, after an existing block chain node or a newly added block chain link point acquires a flag bit therein by synchronizing the current block, a request for acquiring a deleted data list is sent, and a block chain node or a designated block chain link point of the block is generated and the deleted data list is sent to the existing block chain node or the newly added block chain link point.
The embodiment of the invention also discloses a computing device. Those skilled in the art will understand that the computing device of the present embodiment is configured to implement the method solution described in the embodiment shown in fig. 5.
Specifically, in this embodiment, the computing device may include a processor and a memory, where the memory stores computer instructions capable of being executed on the processor, and the processor executes the computer instructions to perform the following steps: acquiring a current block, wherein the current block comprises a hash value of a previous block, a hash value of the current block, a hash value of a deleted data list and a storage address, the deleted data list comprises an identifier of deleted data, the identifier of the deleted data indicates deleted block data, the deletion identifier is generated in response to deletion of block data stored in a preset storage space, and the deleted data list is stored in the preset storage space; verifying the current block according to the hash value of the previous block and the hash value of the current block, and connecting the current block behind the previous block when the current block passes the verification;
wherein the storage address of the deleted data list indicates a storage location of the deleted data list in a preset storage space, and the preset storage space is accessible to at least a part of the blockchain link points in the blockchain network.
In one non-limiting embodiment, the processor, when executing the computer instructions, further performs the steps of: acquiring the deleted data list according to the storage address of the deleted data list; and adjusting the storage state of the locally stored block data according to the deleted data list.
In one non-limiting embodiment, the processor, when executing the computer instructions, further performs the steps of: acquiring the deleted data list according to the storage address of the deleted data list; copying at least a part of block data in the preset storage space according to the deleted data list.
In one non-limiting embodiment, the step of obtaining the deleted data list according to the storage address of the deleted data list is performed when the current block includes the flag bit of the deleted data list.
For more details on the working principle and working mode of the computing device, reference may be made to the related description in fig. 5, which is not described herein again.
In a specific application scenario, in a system using the blockchain technology to implement communication, blogs, etc., a large number of messages may be packaged (i.e., form block data) and stored in a predetermined storage space separate from the blocks. For block data with storage duration exceeding a preset duration threshold (namely, historical messages cannot generate value any more), block link points can delete the block data so as to archive the historical data.
In another specific application scenario, in a Transaction system implemented by using the blockchain technology, after separating Transaction data (i.e., block data) from a block, if all unused Transaction outputs (UTXO) in the Transaction data associated with the current block and the Transaction data associated with the previous block have been consumed, the Transaction data associated with the block and the previous block may be deleted. That is, the data can be archived from the preset storage space to the backup storage space.
It should be noted that the embodiments of the present invention are not limited to be applied to the above application scenarios, and can be applied to any scenario that uses the block chain technology.
The embodiment of the invention also discloses a storage medium, wherein computer instructions are stored on the storage medium, and when the computer instructions are operated, the steps of the method shown in the figure 1, the figure 2, the figure 3 or the figure 5 can be executed. The storage medium may include ROM, RAM, magnetic or optical disks, etc. The storage medium may further include a non-volatile memory (non-volatile) or a non-transitory memory (non-transient), and the like.
Although the present invention is disclosed above, the present invention is not limited thereto. Various changes and modifications may be effected therein by one skilled in the art without departing from the spirit and scope of the invention as defined in the appended claims.
Claims (23)
1. A data processing method for a blockchain network, wherein a target block in the blockchain network includes a hash value of a previous block of the target block, a hash value and a storage address of each block data in at least one block data associated with the target block, the hash value of the target block is generated according to the hash value and the storage address of each block data in the at least one block data and the hash value of the previous block, the storage address of each block data indicates a storage location of the block data in a preset storage space, and the preset storage space is accessible by at least one block link node in the blockchain network, the method comprising:
A. generating a deletion identifier in response to deletion of the block data stored in the preset storage space, wherein the deletion identifier indicates the deleted block data;
B. adding the deletion identifier into a deleted data list, wherein the deleted data list is stored in the preset storage space;
the deleted data list is used for block generation, and the block generation method comprises the following steps:
obtaining the hash value of the previous block;
acquiring the deleted data list and generating a hash value of the deleted data list;
generating a hash value of a current block according to the hash value and the storage address of the deleted data list and the hash value of the previous block, wherein the storage address of the deleted data list indicates a storage position of the deleted data list in the preset storage space;
generating the current block at least based on the hash value of the previous block, the hash value of the current block, the hash value of the deleted data list, and a storage address, wherein the current block is connected after the previous block.
2. The data processing method of claim 1, wherein the predetermined storage space and the blockchain ledger are independent of each other.
3. The data processing method of claim 1, wherein step a further comprises: generating the deletion identifier according to the storage address of the deleted block data;
or generating the deletion identifier according to the storage address of the deleted block data and the hash value;
or generating the deletion identifier according to the identifier of the deleted block data.
4. The data processing method of claim 1, further comprising:
C. detecting whether the deleted block data is reserved in a backup storage space in response to a data recovery request for the deleted block data;
D. if the deleted block data are reserved in the backup storage space, moving the deleted block data from the backup storage space to a storage position indicated by the storage address in the preset storage space;
E. updating the deleted data list to remove the deletion identifier of the deleted block data.
5. The data processing method according to any one of claims 1 to 4, wherein step A is preceded by:
a1, traversing all block data in the preset storage space, and selecting the block data with the storage duration exceeding a preset duration threshold, or selecting the block data with the storage space occupied exceeding a preset space threshold;
and A2, deleting the selected block data.
6. A computing device, wherein a target block in a blockchain network comprises a hash value of a block previous to the target block, a hash value of the target block, a hash value and a storage address of each block data of at least one block data associated with the target block, the hash value of the target block is generated according to the hash value and the storage address of each block data of the at least one block data and the hash value of the previous block, the storage address of each block data indicates the storage location of the block data in a preset storage space, the predetermined memory space is accessible by at least one blockchain node in a blockchain network, the computing device includes a processor and a memory, the memory has stored thereon computer instructions executable on the processor, the processor when executing the computer instructions performing the steps of:
A. generating a deletion identifier in response to deletion of block data stored in a preset storage space, wherein the deletion identifier indicates the deleted block data;
B. adding the deletion identifier into a deleted data list, wherein the deleted data list is stored in the preset storage space;
the deleted data list is used for block generation, and the block generation method comprises the following steps:
obtaining the hash value of the previous block;
acquiring the deleted data list and generating a hash value of the deleted data list;
generating a hash value of a current block according to the hash value and the storage address of the deleted data list and the hash value of the previous block, wherein the storage address of the deleted data list indicates a storage position of the deleted data list in the preset storage space;
generating the current block at least based on the hash value of the previous block, the hash value of the current block, the hash value of the deleted data list, and a storage address, wherein the current block is connected after the previous block.
7. The computing device of claim 6, wherein the predetermined storage space is independent of the blockchain ledger.
8. The computing device of claim 6, wherein the processor, when executing the computer instructions, further performs the steps of:
generating the deletion identifier according to the storage address of the deleted block data;
or generating the deletion identifier according to the storage address of the deleted block data and the hash value;
or generating the deletion identifier according to the identifier of the deleted block data.
9. The computing device of claim 6, wherein the processor, when executing the computer instructions, further performs the steps of:
C. detecting whether the deleted block data is reserved in a backup storage space in response to a data recovery request for the deleted block data;
D. if the deleted block data are reserved in the backup storage space, moving the deleted block data from the backup storage space to a storage position indicated by the storage address in the preset storage space;
E. updating the deleted data list to remove the deletion identifier of the deleted block data.
10. The computing device of any of claims 6 to 9, wherein the processor executing the computer instructions may further perform the following steps before performing step a:
a1, traversing all block data in the preset storage space, and selecting the block data with the storage duration exceeding a preset duration threshold, or selecting the block data with the storage space occupied exceeding a preset space threshold;
and A2, deleting the selected block data.
11. A block generation method for a block chain network, comprising:
A. obtaining the hash value of the previous block;
B. acquiring a deleted data list and generating a hash value of the deleted data list, wherein the deleted data list comprises a deletion identifier, the deletion identifier indicates deleted block data, the deletion identifier is generated in response to deletion of the block data stored in a preset storage space, the deleted data list is stored in the preset storage space, and the preset storage space can be accessed by at least one block link point in the block chain network;
C. generating a hash value of a current block according to the hash value and the storage address of the deleted data list and the hash value of the previous block, wherein the storage address of the deleted data list indicates a storage position of the deleted data list in the preset storage space;
D. generating the current block at least based on the hash value of the previous block, the hash value of the current block, the hash value of the deleted data list, and a storage address, wherein the current block is connected after the previous block.
12. A block generation method as claimed in claim 11, wherein step D further comprises: and generating the current block based on the hash value of the previous block, the hash value of the current block, the hash value of the deleted data list, a storage address and a flag bit, wherein the flag bit is an indicator for distinguishing the deleted data list from the block data.
13. A computing device comprising a processor and a memory, the memory having stored thereon computer instructions executable on the processor, the processor when executing the computer instructions performing the steps of:
A. obtaining the hash value of the previous block;
B. acquiring a deleted data list and generating a hash value of the deleted data list, wherein the deleted data list comprises a deletion identifier, the deletion identifier indicates deleted block data, the deletion identifier is generated in response to deletion of the block data stored in a preset storage space, the deleted data list is stored in the preset storage space, and the preset storage space can be accessed by at least one block link point in a block chain network;
C. generating a hash value of a current block according to the hash value and the storage address of the deleted data list and the hash value of the previous block, wherein the storage address of the deleted data list indicates a storage position of the deleted data list in the preset storage space;
D. generating the current block at least based on the hash value of the previous block, the hash value of the current block, the hash value of the deleted data list, and a storage address, wherein the current block is connected after the previous block.
14. The computing device of claim 13, wherein the processor, when executing the computer instructions to perform step D, further performs the steps of:
and generating the current block based on the hash value of the previous block, the hash value of the current block, the hash value of the deleted data list, a storage address and a flag bit, wherein the flag bit is an indicator for distinguishing the deleted data list from the block data.
15. A synchronization method for a blockchain network, comprising:
A. acquiring a current block, wherein the current block comprises a hash value of a previous block, a hash value of the current block, a hash value of a deleted data list and a storage address, the deleted data list comprises an identifier of deleted data, the identifier of the deleted data indicates deleted block data, the deletion identifier is generated in response to deletion of block data stored in a preset storage space, and the deleted data list is stored in the preset storage space;
B. verifying the current block according to the hash value of the previous block and the hash value of the current block, and connecting the current block behind the previous block when the current block passes the verification;
wherein the storage address of the deleted data list indicates a storage location of the deleted data list in a preset storage space, and the preset storage space is accessible to at least a part of the blockchain link points in the blockchain network.
16. The synchronization method of claim 15, further comprising:
C1. acquiring the deleted data list according to the storage address of the deleted data list;
D1. and adjusting the storage state of the locally stored block data according to the deleted data list.
17. The synchronization method of claim 15, further comprising:
C2. acquiring the deleted data list according to the storage address of the deleted data list;
D2. copying at least a part of block data in the preset storage space according to the deleted data list.
18. The synchronization method according to claim 16 or 17, wherein the step of obtaining the deleted data list according to the storage address of the deleted data list is performed when the current block contains the flag bit of the deleted data list.
19. A computing device comprising a processor and a memory, the memory having stored thereon computer instructions executable on the processor, the processor when executing the computer instructions performing the steps of:
A. acquiring a current block, wherein the current block comprises a hash value of a previous block, a hash value of the current block, a hash value of a deleted data list and a storage address, the deleted data list comprises an identifier of deleted data, the identifier of the deleted data indicates deleted block data, the deletion identifier is generated in response to deletion of block data stored in a preset storage space, and the deleted data list is stored in the preset storage space;
B. verifying the current block according to the hash value of the previous block and the hash value of the current block, and connecting the current block behind the previous block when the current block passes the verification;
wherein the storage address of the deleted data list indicates a storage location of the deleted data list in a preset storage space, and the preset storage space is accessible by at least a part of the blockchain nodes in the blockchain network.
20. The computing device of claim 19, wherein the processor, when executing the computer instructions, further performs the steps of:
C1. acquiring the deleted data list according to the storage address of the deleted data list;
D1. and adjusting the storage state of the locally stored block data according to the deleted data list.
21. The computing device of claim 19, wherein the processor, when executing the computer instructions, further performs the steps of:
C2. acquiring the deleted data list according to the storage address of the deleted data list;
D2. copying at least a part of block data in the preset storage space according to the deleted data list.
22. The computing device of claim 20 or 21, wherein the step of retrieving the deleted data list according to the storage address of the deleted data list is performed when the current block contains a flag bit of the deleted data list.
23. A storage medium having stored thereon computer instructions which, when executed, perform the steps of the data processing method for a blockchain network according to any one of claims 1 to 5, perform the steps of the block generation method for a blockchain network according to any one of claims 11 to 12, or perform the steps of the synchronization method for a blockchain network according to any one of claims 15 to 18.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811108985.4A CN109492049B (en) | 2018-09-21 | 2018-09-21 | Data processing, block generation and synchronization method for block chain network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811108985.4A CN109492049B (en) | 2018-09-21 | 2018-09-21 | Data processing, block generation and synchronization method for block chain network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109492049A CN109492049A (en) | 2019-03-19 |
| CN109492049B true CN109492049B (en) | 2021-05-04 |
Family
ID=65689368
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811108985.4A Expired - Fee Related CN109492049B (en) | 2018-09-21 | 2018-09-21 | Data processing, block generation and synchronization method for block chain network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109492049B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110474776B (en) * | 2019-07-19 | 2022-06-07 | 上海朝夕网络技术有限公司 | Credible block data dynamic deleting method |
| CN111340496B (en) * | 2020-05-20 | 2020-10-27 | 南京如般量子科技有限公司 | Block chain system and method for automatically optimizing historical transaction data |
| CN111815454B (en) | 2020-08-21 | 2020-12-11 | 支付宝(杭州)信息技术有限公司 | Data uplink method and device, electronic equipment and storage medium |
| CN111930753B (en) | 2020-09-15 | 2021-01-22 | 腾讯科技（深圳）有限公司 | Data retrieving method and device, electronic equipment and storage medium |
| CN113627938B (en) * | 2021-08-24 | 2024-05-28 | 上海点融信息科技有限责任公司 | Data deleting method, device and equipment of block chain and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101364192A (en) * | 2007-08-09 | 2009-02-11 | 英华达(上海)电子有限公司 | Recovery method and system after data being cancelled by mistake and electronic appliance |
| CN106372868A (en) * | 2016-09-06 | 2017-02-01 | 联动优势科技有限公司 | Verification method and apparatus for transaction data written into block chain |
| CN106775497A (en) * | 2017-01-19 | 2017-05-31 | 郑志超 | Distributed storage method and equipment based on block chain |
| CN107360156A (en) * | 2017-07-10 | 2017-11-17 | 广东工业大学 | P2P network method for cloud storage based on block chain under a kind of big data environment |
| WO2018103850A1 (en) * | 2016-12-08 | 2018-06-14 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus for creating a finite blockchain |
| CN108519862A (en) * | 2018-03-30 | 2018-09-11 | 百度在线网络技术（北京）有限公司 | Storage method, device, system and the storage medium of block catenary system |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10805393B2 (en) * | 2015-12-02 | 2020-10-13 | Olea Networks, Inc. | System and method for data management structure using auditable delta records in a distributed environment |
| US9967096B2 (en) * | 2016-05-23 | 2018-05-08 | Accenture Global Solutions Limited | Rewritable blockchain |
| CN106446705A (en) * | 2016-08-26 | 2017-02-22 | 杨鹏 | Cyclic writing method and system of data on the basis of block chain |
| CN106776894B (en) * | 2016-11-29 | 2018-03-16 | 北京众享比特科技有限公司 | Log database system and synchronous method |
| CN107122477A (en) * | 2017-05-02 | 2017-09-01 | 成都中远信电子科技有限公司 | A kind of block chain storage system |
| CN107273410B (en) * | 2017-05-03 | 2020-07-07 | 上海点融信息科技有限责任公司 | Block chain based distributed storage |
| CN110377570B (en) * | 2017-10-12 | 2021-06-11 | 腾讯科技（深圳）有限公司 | Node switching method and device, computer equipment and storage medium |
-
2018
- 2018-09-21 CN CN201811108985.4A patent/CN109492049B/en not_active Expired - Fee Related
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101364192A (en) * | 2007-08-09 | 2009-02-11 | 英华达(上海)电子有限公司 | Recovery method and system after data being cancelled by mistake and electronic appliance |
| CN106372868A (en) * | 2016-09-06 | 2017-02-01 | 联动优势科技有限公司 | Verification method and apparatus for transaction data written into block chain |
| WO2018103850A1 (en) * | 2016-12-08 | 2018-06-14 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus for creating a finite blockchain |
| CN106775497A (en) * | 2017-01-19 | 2017-05-31 | 郑志超 | Distributed storage method and equipment based on block chain |
| CN107360156A (en) * | 2017-07-10 | 2017-11-17 | 广东工业大学 | P2P network method for cloud storage based on block chain under a kind of big data environment |
| CN108519862A (en) * | 2018-03-30 | 2018-09-11 | 百度在线网络技术（北京）有限公司 | Storage method, device, system and the storage medium of block catenary system |
Non-Patent Citations (1)
| Title |
|---|
| 区块链技术：应用及问题;翟社平 等;《西安邮电大学学报》;20180110;第23卷(第01期);1-13 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109492049A (en) | 2019-03-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109492049B (en) | Data processing, block generation and synchronization method for block chain network | |
| US11074139B2 (en) | Dynamic block chain system using metadata for backing up data based on digest rules | |
| CN108270874B (en) | Application program updating method and device | |
| CN109543455B (en) | Data archiving method and device for block chain | |
| CN103473277B (en) | The Snapshot Method and device of file system | |
| CN108255647B (en) | High-speed data backup method under samba server cluster | |
| US20200097452A1 (en) | Data deduplication device, data deduplication method, and data deduplication program | |
| US10366072B2 (en) | De-duplication data bank | |
| US8954793B2 (en) | Method and a storage server for data redundancy | |
| JP2021528883A (en) | Indexing and restoration of coded blockchain data | |
| CN111226206B (en) | Taking a snapshot of blockchain data | |
| CN110781028B (en) | Data backup method, data recovery method, data backup device, data recovery device and computing equipment | |
| CN108512649B (en) | Processing method and device for reverse hash link of block chain | |
| US11544150B2 (en) | Method of detecting source change for file level incremental backup | |
| CN107018185A (en) | The synchronous method and device of cloud storage system | |
| US11372847B2 (en) | Block verification device, block verification method, and program | |
| CN111316256A (en) | Taking snapshots of blockchain data | |
| CN111045856A (en) | Method, apparatus and computer program product for managing application systems | |
| US8312237B2 (en) | Automated relocation of in-use multi-site protected data storage | |
| US20210240350A1 (en) | Method, device, and computer program product for recovering based on reverse differential recovery | |
| CN106534234B (en) | Relationship chain processing system, method and device | |
| CN109992447B (en) | Data copying method, device and storage medium | |
| JP6376626B2 (en) | Data storage method, data storage device, and storage device | |
| US11513913B2 (en) | Method for storage management, electronic device, and computer program product | |
| US20180246666A1 (en) | Methods for performing data deduplication on data blocks at granularity level and devices 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20210504 Termination date: 20210921 |