CN111984735A - Data archiving method and device, electronic equipment and storage medium - Google Patents
Data archiving method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN111984735A CN111984735A CN202010918632.1A CN202010918632A CN111984735A CN 111984735 A CN111984735 A CN 111984735A CN 202010918632 A CN202010918632 A CN 202010918632A CN 111984735 A CN111984735 A CN 111984735A
- Authority
- CN
- China
- Prior art keywords
- archived
- block
- blocks
- groups
- block chain
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000004891 communication Methods 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 4
- 238000012217 deletion Methods 0.000 claims description 2
- 230000037430 deletion Effects 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 10
- 238000005516 engineering process Methods 0.000 description 9
- 230000008569 process Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 3
- 238000012790 confirmation Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
- G06F16/278—Data partitioning, e.g. horizontal or vertical partitioning
-
- 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
-
- 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/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Quality & Reliability (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application relates to a block storage system and discloses a data archiving method, a data archiving device, electronic equipment and a storage medium, wherein the method comprises the following steps: when the archiving operation is detected on the archiving interface, acquiring N block chain identifications to be archived, N groups of block heights to be archived and N archiving addresses; determining the lengths of N block chains to be archived, which correspond to the N block chain to be archived one by one; determining N groups of blocks which correspond to the heights of the N groups of blocks to be archived one by one from the N blocks to be archived according to the lengths of the N blocks to be archived; acquiring N groups of block data from N groups of blocks, wherein the N groups of blocks correspond to the N groups of block data one by one; and sending N groups of block data to N filing nodes which are in one-to-one correspondence with the N filing addresses, and deleting the N groups of block data on the N to-be-filed block chains. By implementing the embodiment of the application, the storage pressure of the block chain node is reduced.
Description
Technical Field
The present application relates to the field of block chain technologies, and in particular, to a data archiving method and apparatus, an electronic device, and a storage medium.
Background
With the rapid development of the block chain technology, the block chain technology is widely applied in many fields. Furthermore, a large amount of data, such as transaction data, insurance service related data, etc., is often generated in the application process of the block chain technology, so that more and more data are required to be stored in the block chain nodes, and the storage space occupied by the block data in the block chain nodes is larger and larger. Therefore, how to relieve the storage pressure of the blockchain node becomes a problem to be solved urgently at present.
Disclosure of Invention
The embodiment of the application provides a data archiving method and device, electronic equipment and a storage medium, and by implementing the embodiment of the application, the storage pressure of a block chain node is reduced.
A first aspect of the present application provides a data archiving method, including:
when an archiving operation is detected on an archiving interface, acquiring N block chain identifications to be archived, N groups of heights of blocks to be archived and N archiving addresses, wherein the N block chain identifications to be archived are in one-to-one correspondence with the N groups of heights of the blocks to be archived, the N block chain identifications to be archived are in one-to-one correspondence with the N archiving addresses, and N is an integer greater than 1;
determining the lengths of N block chains to be archived, which correspond to the N block chain to be archived one by one;
determining N groups of blocks which correspond to the heights of the N groups of blocks to be archived one by one from the N blocks to be archived according to the lengths of the N blocks to be archived;
acquiring N groups of block data from the N groups of blocks, wherein the N groups of blocks correspond to the N groups of block data one by one;
and sending the N groups of block data to N filing nodes in one-to-one correspondence with the N filing addresses, and deleting the N groups of block data on the N to-be-filed block chains.
A second aspect of the present application provides a data archiving apparatus comprising:
the device comprises a first acquisition module, a first determination module, a second acquisition module, a sending module and a deletion module,
the first obtaining module is configured to obtain N to-be-archived blockchain identifiers, N groups of to-be-archived block heights, and N archive addresses when an archive operation is detected on an archive interface, where the N to-be-archived blockchain identifiers are in one-to-one correspondence with the N groups of to-be-archived block heights, the N to-be-archived blockchain identifiers are in one-to-one correspondence with the N archive addresses, and N is an integer greater than 1;
the first determining module is configured to determine lengths of N to-be-archived block chains that are in one-to-one correspondence with the N to-be-archived block chain identifiers;
the second determining module is configured to determine, according to the lengths of the N to-be-archived block chains, N groups of blocks that correspond to the heights of the N groups of to-be-archived blocks one by one from the N to-be-archived block chains;
the second obtaining module is configured to obtain N groups of block data from the N groups of blocks, where the N groups of blocks are in one-to-one correspondence with the N groups of block data;
the sending module is configured to send the N groups of block data to N archive nodes that are in one-to-one correspondence with the N archive addresses;
and the deleting module is used for deleting the N groups of block data on the N to-be-archived block chains.
A third aspect of the application provides an electronic device for data archiving comprising a processor, a memory, a communication interface, and one or more programs, wherein the one or more programs are stored in the memory and are generated as instructions for execution by the processor to perform steps in any of the methods of a data archiving method.
A fourth aspect of the present application provides a computer readable storage medium for storing a computer program for execution by the processor to implement the method of any one of the data archiving methods.
It can be seen that, in the above technical solution, by determining the block based on the block chain length, preparation is made for subsequently and efficiently storing the block data to the archive node corresponding to the archive address. Meanwhile, by deleting the block data, the storage space of the block chain link points is saved, and the storage pressure of the block chain link points is reduced.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Wherein:
FIG. 1 is a schematic diagram of a data archiving system provided in an embodiment of the present application;
fig. 2A is a schematic flowchart of a data archiving method according to an embodiment of the present application;
FIG. 2B is a schematic diagram of an archiving interface provided in an embodiment of the present application;
fig. 2C is a schematic diagram illustrating determination of a length of a blockchain to be archived according to an embodiment of the present application;
fig. 3 is a schematic flowchart of another data archiving method according to an embodiment of the present application;
fig. 4 is a schematic diagram of a data archiving apparatus according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of an electronic device in a hardware operating environment according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The following are detailed below.
The terms "first" and "second" in the description and claims of the present application and the above-described drawings are used for distinguishing between different objects and not for describing a particular order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus.
Referring to fig. 1, fig. 1 is a schematic diagram of a data archiving system according to an embodiment of the present application, where the data archiving system 100 includes a data archiving device 110. The data archive device 110 is used for processing, storing and displaying block data. The data archiving system 100 may comprise an integrated single device or multiple devices, and for ease of description, the data archiving system 100 is referred to herein collectively as a blockchain node. It is apparent that the tile link node may include various handheld devices, vehicle-mounted devices, wearable devices, computing devices or other processing devices connected to a wireless modem, as well as various forms of User Equipment (UE), Mobile Stations (MS), terminal Equipment (terminal device), and so on, having wireless communication capabilities.
Further, in order to make the embodiments of the present application clearer, a part of concepts or contents in the embodiments of the present application are briefly introduced here.
The block chain is a chain data structure which connects the data blocks according to the time sequence and is a distributed account book which is ensured in a cryptographic mode and cannot be tampered and forged. The blockchain may include a blockchain underlying platform, a platform product service layer, an application service layer, and the like.
Further, the properties of the blockchain include openness, consensus, de-centering, de-trust, transparency, anonymity of both sides, non-tampering, traceability, and the like. Open and transparent means that anyone can participate in the blockchain network, and each device can be used as a node, and each node allows a complete database copy to be obtained. The nodes maintain the whole block chain together through competition calculation based on a set of consensus mechanism. When any node fails, the rest nodes can still work normally. The decentralization and the distrust mean that a block chain is formed into an end-to-end network by a plurality of nodes together, and no centralized equipment or management mechanism exists. The data exchange between the nodes is verified by a digital signature technology, mutual trust is not needed, and other nodes cannot be deceived as long as the data exchange is carried out according to the rules set by the system. Transparent and anonymous meaning that the operation rule of the block chain is public, and all data information is also public, so that each transaction is visible to all nodes. Because the nodes are distrusted, the nodes do not need to disclose identities, and each participated node is anonymous. Among other things, non-tamperable and traceable means that modifications to the database by each and even multiple nodes cannot affect the databases of other nodes unless more than 51% of the nodes in the entire network can be controlled to modify at the same time, which is almost impossible. In the block chain, each transaction is connected with two adjacent blocks in series through a cryptographic method, so that any transaction record can be traced.
In particular, the blockchain may utilize blockchain data structures to verify and store data, utilize distributed node consensus algorithms to generate and update data, cryptographically secure data transmission and access, and utilize intelligent contracts comprised of automated script code to program and manipulate data in a completely new distributed infrastructure and computing manner. Therefore, the characteristic that the block chain technology is not tampered fundamentally changes a centralized credit creation mode, and the irrevocability and the safety of data are effectively improved. The intelligent contract enables all the terms to be written into programs, the terms can be automatically executed on the block chain, and therefore when conditions for triggering the intelligent contract exist, the block chain can be forcibly executed according to the content in the intelligent contract and is not blocked by any external force, effectiveness and execution force of the contract are guaranteed, cost can be greatly reduced, and efficiency can be improved. Each node on the block chain has the same account book, and the recording process of the account book can be ensured to be public and transparent. The block chain technology can realize point-to-point, open and transparent direct interaction, so that an information interaction mode with high efficiency, large scale and no centralized agent becomes a reality.
In addition, with the rapid development of the blockchain technology, the application of the blockchain technology in the transaction field is also more and more extensive. Furthermore, as the amount of transaction data increases gradually, more and more data are stored in the block nodes, and the storage space occupied by the block data in the block nodes is also larger and larger. Therefore, how to relieve the storage pressure of the blockchain node becomes a problem to be solved urgently at present.
Based on this, the embodiments of the present application provide a data archiving method to solve the above problems, and the embodiments of the present application are described in detail below.
Referring to fig. 2A, fig. 2A is a schematic flowchart of a data archiving method according to an embodiment of the present application. The data archiving method can be applied to a blockchain node, as shown in fig. 2A, and the method includes:
201. when the archiving operation is detected on the archiving interface, N block chain identifiers to be archived, N groups of block heights to be archived and N archiving addresses are obtained, wherein the N block chain identifiers to be archived are in one-to-one correspondence with the N groups of block heights to be archived, the N block chain identifiers to be archived are in one-to-one correspondence with the N archiving addresses, and N is an integer greater than 1.
Referring to fig. 2B, fig. 2B is a schematic diagram of an archiving interface provided in the embodiment of the present application. As shown in fig. 2B, archiving interface 200 includes a to-be-archived block chain identification selection box, a to-be-archived block height selection box, an archive address selection box, and a confirmation button. It is understood that the user may select the selection box for the to-be-archived blockchain identifier, the to-be-archived blockheight selection box and the archive address selection box, so as to determine the to-be-archived blockchain identifier, the to-be-archived blockheight and the archive address. Further, the filing operation may be a click operation on a confirmation button.
Each of the N groups of block heights to be archived includes M block heights to be archived corresponding to each block chain identifier to be archived in the N block chain identifiers, where M is an integer greater than 0. Further, in the present application, the height of the block to be archived may be the number of the block to be archived.
Wherein each of the N archival addresses may include one of: internet protocol address (IP address), IP address and port number, domain name.
202. Determining the length of N blockchains to be archived, which are in one-to-one correspondence with the N blockchain to be archived identifications.
Wherein the determining the length of the N to-be-archived block chains in one-to-one correspondence with the N to-be-archived block chain identifiers includes: determining N block chains to be archived, which correspond to the N block chain to be archived in a one-to-one manner; determining the number of block heads corresponding to each block chain to be archived in the N block chains to be archived; and determining the length of the N block chains to be archived according to the number of block heads corresponding to each block chain to be archived in the N block chains to be archived.
Specifically, referring to fig. 2C, fig. 2C is a schematic diagram illustrating length determination of a block chain to be archived according to an embodiment of the present application. As shown in fig. 2C, the N to-be-archived blockchains include a to-be-archived blockchain 1 to a to-be-archived blockchain N. The block chain to be archived 1 comprises at least one block, and each block in the at least one block comprises a block header. The chain of blocks to be archived N comprises at least one block, each of which comprises a block header. It is understood that the header of the block stores header information of the block, including Hash value (prelash) of the previous block, Hash value (Hash) of the block, and TimeStamp (TimeStamp), etc.
Therefore, in the technical scheme, the determination of the length of the block chain is realized, and preparation is made for storing the block data to the archive node corresponding to the archive address in a follow-up efficient manner.
Wherein the determining the length of the N to-be-archived block chains in one-to-one correspondence with the N to-be-archived block chain identifiers includes: determining a first to-be-returned block chain corresponding to the first to-be-returned block chain identifier; acquiring the block height corresponding to the starting block and the block height corresponding to the ending block in the first block chain to be subjected to the file grouping; and determining the length of the first block chain to be restored according to the difference value of the block height corresponding to the starting block and the block height corresponding to the ending block in the first block chain to be restored.
It is to be understood that the starting block in the first chain of blocks to be archived is the block with the smallest block height in the first chain of blocks to be archived and the ending block in the first chain of blocks to be archived is the block with the largest block height in the first chain of blocks to be archived.
Therefore, in the technical scheme, the determination of the length of the block chain is realized, and preparation is made for storing the block data to the archive node corresponding to the archive address in a follow-up efficient manner.
203. And determining N groups of blocks which correspond to the heights of the N groups of blocks to be archived one by one from the N chains of blocks to be archived according to the lengths of the N chains of blocks to be archived.
It can be understood that, the first to-be-archived block chain identifier is any one to-be-archived block chain identifier in the N to-be-archived block chain identifiers, and the first group of to-be-archived block heights corresponding to the first to-be-archived block chain identifier includes M to-be-archived block heights corresponding to the first to-be-archived block chain identifier, where the first group of to-be-archived block heights is one group of to-be-archived block heights in the N groups of to-be-archived block heights.
Further, the height of the first group of blocks to be archived includes M heights of blocks to be archived, where M is an integer greater than 1, the first group of blocks corresponding to the height of the first group of blocks to be archived includes M blocks, the M blocks are determined from the first chain of blocks to be archived corresponding to the first chain identifier of blocks to be archived according to the heights of the M blocks to be archived, and the first chain of blocks to be archived is one chain of blocks to be archived among the N chains of blocks to be archived.
204. And acquiring N groups of block data from the N groups of blocks, wherein the N groups of blocks correspond to the N groups of block data one by one.
The first group of block data corresponding to the first to-be-archived block chain is the block data obtained from the first to-be-archived block chain corresponding to the first to-be-archived block chain identifier according to the first group of to-be-archived block height corresponding to the first to-be-archived block chain identifier. Specifically, the first set of block data is obtained from the first set of blocks.
205. And sending the N groups of block data to N filing nodes in one-to-one correspondence with the N filing addresses, and deleting the N groups of block data on the N to-be-filed block chains.
In the embodiment of the present application, the node to be archived may include, for example, various handheld devices, vehicle-mounted devices, wearable devices, computing devices or other processing devices connected to a wireless modem and various forms of User Equipment (UE), Mobile Stations (MS), terminal devices (terminal device), and the like, which have wireless communication functions.
It can be seen that, in the above technical solution, by determining the block based on the block chain length, preparation is made for subsequently and efficiently storing the block data to the archive node corresponding to the archive address. Meanwhile, by deleting the block data, the storage space of the block chain link points is saved, and the storage pressure of the block chain link points is reduced.
In a possible implementation manner, the determining, according to the lengths of the N to-be-archived block chains, N groups of blocks from the N to-be-archived block chains, which correspond to the heights of the N groups of blocks to be archived in one-to-one manner includes: determining a second block chain to be archived and a third block chain to be archived from the N block chains to be archived; determining the length difference value of the second block chain to be subjected to filing and the third block chain to be subjected to filing; if the length difference value of the second block chain to be archived and the third block chain to be archived is higher than a preset length difference value, determining N groups of blocks which correspond to the heights of the N groups of blocks to be archived one by one from the N block chains to be archived according to the length difference value of the third block chain to be archived and N-1 fourth block chains to be archived, wherein the N-1 fourth block chains to be archived are block chains of the N block chains to be archived except the third block chain to be archived; if the length difference value between the second block chain to be archived and the third block chain to be archived is lower than the preset length difference value, determining N groups of blocks which correspond to the heights of the N groups of blocks to be archived one by one from the N block chains to be archived according to the length difference value between the second block chain to be archived and N-1 fifth block chains to be archived, wherein the N-1 fifth block chains to be archived are block chains in the N block chains to be archived except the second block chain to be archived.
The second block chain to be archived is the block chain with the longest block chain length in the N block chains to be archived, and the third block chain to be archived is the block chain with the shortest block chain length in the N block chains to be archived.
The preset length difference may be set by an administrator or may be configured in a blockchain node.
As can be appreciated, the determining a difference in length between the second and third to-be-filed blockchains comprises: and determining the length difference value of the second block chain to be subjected to the filing and the third block chain to be subjected to the filing according to the length of the second block chain to be subjected to the filing and the length of the third block chain to be subjected to the filing.
The length of the second block chain to be archived may be determined according to the number of block headers corresponding to the second block chain to be archived, or may be determined according to a difference between a block height corresponding to a starting block and a block height corresponding to an ending block in the second block chain to be archived.
The length of the third block chain to be archived may be determined according to the number of block headers corresponding to the third block chain to be archived, or may be determined according to a difference between a block height corresponding to a starting block and a block height corresponding to an ending block in the third block chain to be archived.
It can be seen that, in the above technical scheme, the block is determined by the length difference, so that the block is determined quickly, and the problem of low efficiency caused by randomly determining the block is avoided.
In a possible implementation manner, the determining, according to a difference between lengths of the third block chain to be archived and N-1 fourth block chains to be archived, N groups of blocks from the N block chains to be archived, the group of blocks corresponding to heights of the N groups of blocks to be archived in one-to-one correspondence includes: and determining N groups of blocks which correspond to the heights of the N groups of blocks to be archived in a one-to-one manner from the N blocks to be archived according to a first sequence, wherein the first sequence is the sequence from small to large of the length difference between the third block chain to be archived and the N-1 fourth block chains to be archived.
It can be seen that, in the above technical scheme, the blocks are determined according to the sequence of the length difference from small to large, the blocks are determined quickly, and the problem of low efficiency caused by random block determination is avoided.
In a possible implementation manner, the determining, according to a difference between lengths of the second block chain to be archived and N-1 fifth block chains to be archived, N groups of blocks from the N block chains to be archived, the groups of blocks corresponding to heights of the N groups of blocks to be archived in one-to-one correspondence includes:
and according to a second sequence, determining N groups of blocks which correspond to the N groups of blocks to be archived in height one-to-one mode from the N blocks to be archived, wherein the second sequence is the sequence from large to small of the length difference of the second block chain to be archived and the N-1 fifth block chains to be archived.
It can be seen that, in the above technical scheme, the blocks are determined according to the sequence of the length difference from large to small, the blocks are determined quickly, and the problem of low efficiency caused by random block determination is avoided.
In a possible implementation manner, the determining, according to the lengths of the N to-be-archived block chains, N groups of blocks from the N to-be-archived block chains, which correspond to the heights of the N groups of blocks to be archived in one-to-one manner includes: acquiring a preset length; determining whether K block chains to be archived, of the lengths of the N block chains to be archived, are larger than the preset length, wherein K is an integer larger than 0 and smaller than N;
if yes, determining a block chain with the shortest block chain length in the K block chains to be archived from the K block chains to be archived; determining K groups of blocks which are in one-to-one correspondence with K groups of block heights to be archived from the K block chains to be archived according to the length difference between the block chain with the shortest block chain length and the K-1 block chains to be archived in the K block chains to be archived, wherein the K-1 block chains to be archived are other block chains except the block chain with the shortest block chain length in the K block chains to be archived, and the K groups of block heights to be archived are the block heights corresponding to the K block chains to be archived in the N groups of block heights to be archived; determining a block chain with the longest block chain length in the N-K block chains to be archived from N-K block chains to be archived, wherein the N-K block chains to be archived are block chains except the K block chains to be archived in the N block chains to be archived; determining N-K groups of blocks which are in one-to-one correspondence with the heights of the N-K groups of blocks to be archived according to the length difference between the block chain with the longest block chain length in the N-K block chains to be archived and the N-K-1 block chains to be archived, wherein the N-K-1 block chains to be archived are other block chains in the N-K block chains to be archived except the block chain with the longest block chain length in the N-K block chains to be archived;
if not, determining N groups of blocks which correspond to the heights of the N groups of blocks to be archived one by one from the N blocks to be archived according to the sequence of the lengths of the N blocks to be archived from large to small.
The preset length may be set by an administrator or may be configured in a blockchain node.
Wherein, the determining the block chain with the shortest block chain length in the K block chains to be archived from the K block chains to be archived includes: determining the number of block heads corresponding to each block chain to be archived in the K block chains to be archived; determining the length of the K block chains to be archived according to the number of block heads corresponding to each block chain to be archived in the K block chains to be archived; and determining the block chain with the shortest block chain length in the K block chains to be archived according to the lengths of the K block chains to be archived.
Wherein, the determining the block chain with the shortest block chain length in the K block chains to be archived from the K block chains to be archived includes: determining the block height corresponding to the starting block and the block height corresponding to the ending block of each block chain to be archived in the K block chains to be archived; determining the lengths of the K block chains to be archived according to the difference value of the block height corresponding to the starting block and the block height corresponding to the ending block of each block chain to be archived in the K block chains to be archived; and determining the block chain with the shortest block chain length in the K block chains to be archived according to the lengths of the K block chains to be archived.
Wherein, according to the length difference between the block chain with the shortest block chain length among the K block chains to be archived and the K-1 block chains to be archived, determining K groups of blocks corresponding to K groups of block heights to be archived one by one from the K block chains to be archived includes: and according to a third sequence, determining K groups of blocks which correspond to the heights of K groups of blocks to be archived one by one from the K block chains to be archived, wherein the third sequence is the sequence from small to large of the length difference between the block chain with the shortest block chain length in the K block chains to be archived and the K-1 block chains to be archived.
Determining N-K groups of blocks which correspond to the heights of the N-K groups of blocks to be archived one by one from the N-K blocks to be archived according to the length difference between the block chain with the longest block chain length in the N-K blocks to be archived and the N-K-1 blocks to be archived, wherein the method comprises the following steps: and according to a fourth sequence, determining N-K groups of blocks which are in one-to-one correspondence with the heights of the N-K groups of blocks to be archived from the N-K block chains to be archived, wherein the fourth sequence is the sequence from large to small of the length difference between the block chain with the longest block chain length in the N-K block chains to be archived and the N-K-1 block chains to be archived.
Therefore, in the technical scheme, the determination of the length of the block chain is realized, and preparation is made for storing the block data to the archive node corresponding to the archive address in a follow-up efficient manner.
Referring to fig. 3, fig. 3 is a schematic flowchart of another data archiving method according to the embodiment of the present application. The data archiving method can be applied to a blockchain node, wherein, as shown in fig. 3, the method includes:
301. when the archiving operation is detected on the archiving interface, N block chain identifications to be archived, N groups of block heights to be archived and N archiving addresses are obtained.
The N to-be-archived block chain identifiers correspond to the N groups of to-be-archived block heights one to one, the N to-be-archived block chain identifiers correspond to the N archive addresses one to one, and N is an integer greater than 1.
For the archiving interface, reference may be made to the description of the archiving interface in step 201, which is not described herein again. Regarding the heights of the N sets of blocks to be archived, the description of the heights of the N sets of blocks to be archived in step 201 can be referred to, and details are not repeated herein. For the N archival addresses, reference may be made to the description of the N archival addresses in step 201, which is not described herein again.
302. Determining the length of N blockchains to be archived, which are in one-to-one correspondence with the N blockchain to be archived identifications.
303. And determining N groups of blocks which correspond to the heights of the N groups of blocks to be archived one by one from the N chains of blocks to be archived according to the lengths of the N chains of blocks to be archived.
304. A first set of block data is sent to a first archival node.
The first filing node corresponds to an filing address corresponding to a first to-be-filed block chain identifier, the first to-be-filed block chain identifier is any one of the N to-be-filed block chain identifiers, the first group of block data is obtained from the first to-be-filed block chain corresponding to the first to-be-filed block chain identifier according to a first group of to-be-filed block heights corresponding to the first to-be-filed block chain identifier, and the first group of to-be-filed block heights is one of the N groups of to-be-filed block heights.
Wherein the deleting the N groups of block data on the N to-be-archived block chains includes: deleting the first set of block data on the first block chain to be archived.
It can be seen that, in the above technical solution, the block data is archived, so as to prepare for subsequently deleting the archived block data.
Referring to fig. 4, fig. 4 is a schematic diagram of a data archiving apparatus according to an embodiment of the present application. As shown in fig. 4, a data archiving apparatus 400 provided in this embodiment of the present application includes a first obtaining module 401, a first determining module 402, a second determining module 403, a second obtaining module 404, a sending module 405, and a deleting module 406, where,
the first obtaining module 401 is configured to, when a filing operation is detected on a filing interface, obtain N to-be-filed blockchain identifiers, N groups of to-be-filed blockchains heights, and N filing addresses, where the N to-be-filed blockchain identifiers correspond to the N groups of to-be-filed blockheights one to one, the N to-be-filed blockchain identifiers correspond to the N filing addresses one to one, and N is an integer greater than 1;
the first determining module 402 is configured to determine lengths of N to-be-archived block chains that are in one-to-one correspondence with the N to-be-archived block chain identifiers;
the second determining module 403 is configured to determine, according to the lengths of the N to-be-archived block chains, N groups of blocks that correspond to the heights of the N groups of to-be-archived blocks one by one from the N to-be-archived block chains;
the second obtaining module 404 is configured to obtain N groups of block data from the N groups of blocks, where the N groups of blocks are in one-to-one correspondence with the N groups of block data.
The sending module 405 is configured to send the N sets of block data to N archive nodes corresponding to the N archive addresses one to one;
the deleting module 406 is configured to delete the N groups of block data on the N to-be-archived block chains.
It can be seen that, in the above technical solution, by determining the block based on the block chain length, preparation is made for subsequently and efficiently storing the block data to the archive node corresponding to the archive address. Meanwhile, by deleting the block data, the storage space of the block chain link points is saved, and the storage pressure of the block chain link points is reduced.
In a possible embodiment, the first to-be-archived block chain identifier is any one of the N to-be-archived block chain identifiers, and when determining the lengths of the N to-be-archived block chains that are in one-to-one correspondence with the N to-be-archived block chain identifiers, the second determining module 402 is specifically configured to determine the N to-be-archived block chains that are in one-to-one correspondence with the N to-be-archived block chain identifiers; determining the number of block heads corresponding to each block chain to be archived in the N block chains to be archived; and determining the length of the N block chains to be archived according to the number of block heads corresponding to each block chain to be archived in the N block chains to be archived.
Therefore, in the technical scheme, the determination of the length of the block chain is realized, and preparation is made for storing the block data to the archive node corresponding to the archive address in a follow-up efficient manner.
In a possible embodiment, the first to-be-archived block chain identifier is any one of the N to-be-archived block chain identifiers, and when determining the lengths of the N to-be-archived block chains that are in one-to-one correspondence with the N to-be-archived block chain identifiers, the first determining module 402 is specifically configured to determine the first to-be-archived block chain corresponding to the first to-be-archived block chain identifier; acquiring the block height corresponding to the starting block and the block height corresponding to the ending block in the first block chain to be subjected to the file grouping; and determining the length of the first block chain to be restored according to the difference value of the block height corresponding to the starting block and the block height corresponding to the ending block in the first block chain to be restored.
Therefore, in the technical scheme, the determination of the length of the block chain is realized, and preparation is made for storing the block data to the archive node corresponding to the archive address in a follow-up efficient manner.
In a possible implementation manner, when determining, according to the lengths of the N to-be-archived block chains, N groups of blocks that correspond to the heights of the N groups of to-be-archived blocks one by one from the N to-be-archived block chains, the second determining module 402 is specifically configured to determine, from the N to-be-archived block chains, a second to-be-archived block chain and a third to-be-archived block chain, where the second to-be-archived block chain is a block chain with a longest block chain length in the N to-be-archived block chains, and the third to-be-archived block chain is a block chain with a shortest block chain length in the N to-be-archived block chains; determining the length difference value of the second block chain to be subjected to filing and the third block chain to be subjected to filing; if the length difference value of the second block chain to be archived and the third block chain to be archived is higher than a preset length difference value, determining N groups of blocks which correspond to the heights of the N groups of blocks to be archived one by one from the N block chains to be archived according to the length difference value of the third block chain to be archived and N-1 fourth block chains to be archived, wherein the N-1 fourth block chains to be archived are block chains of the N block chains to be archived except the third block chain to be archived; if the length difference value between the second block chain to be archived and the third block chain to be archived is lower than the preset length difference value, determining N groups of blocks which correspond to the heights of the N groups of blocks to be archived one by one from the N block chains to be archived according to the length difference value between the second block chain to be archived and N-1 fifth block chains to be archived, wherein the N-1 fifth block chains to be archived are block chains in the N block chains to be archived except the second block chain to be archived.
It can be seen that, in the above technical scheme, the block is determined by the length difference, so that the block is determined quickly, and the problem of low efficiency caused by randomly determining the block is avoided.
In a possible implementation manner, when N groups of blocks corresponding to the heights of the N groups of blocks to be archived one by one are determined from the N blocks to be archived chains according to the length difference between the third block chain to be archived and N-1 fourth block chains to be archived, the second determining module 402 is specifically configured to determine N groups of blocks corresponding to the heights of the N groups of blocks to be archived one by one from the N blocks to be archived chains according to a first order, where the first order is an order in which the length difference between the third block chain to be archived and the N-1 fourth block chains to be archived is from small to large.
It can be seen that, in the above technical scheme, the blocks are determined according to the sequence of the length difference from small to large, the blocks are determined quickly, and the problem of low efficiency caused by random block determination is avoided.
In a possible implementation manner, when N groups of blocks corresponding to the heights of the N groups of blocks to be archived are determined from the N blocks to be archived according to the length difference between the second block chain to be archived and N-1 fifth block chains to be archived, the second determining module 402 is specifically configured to determine N groups of blocks corresponding to the heights of the N groups of blocks to be archived from the N blocks to be archived according to a second order, where the second order is an order from large to small of the length difference between the second block chain to be archived and the N-1 fifth block chains to be archived.
It can be seen that, in the above technical scheme, the blocks are determined according to the sequence of the length difference from large to small, the blocks are determined quickly, and the problem of low efficiency caused by random block determination is avoided.
In a possible implementation manner, when the N sets of block data are sent to N archive nodes corresponding to the N archive addresses in a one-to-one manner, the sending module 405 is configured to send a first set of block data to a first archive node, where the first archive node corresponds to an archive address corresponding to a first to-be-archived block chain identifier, the first to-be-archived block chain identifier is any one to-be-archived block chain identifier in the N to-be-archived block chain identifiers, the first set of block data is block data obtained from a first to-be-archived block chain corresponding to the first to-be-archived block chain identifier according to a first to-be-archived block height corresponding to the first to-be-archived block chain identifier, and the first set of to-be-archived block height is one to-be-archived block height in the N sets of to-be-archived block heights.
It can be seen that, in the above technical solution, the block data is archived, so as to prepare for subsequently deleting the archived block data.
Referring to fig. 5, fig. 5 is a schematic structural diagram of an electronic device in a hardware operating environment according to an embodiment of the present application.
Embodiments of the present application provide an electronic device for data archiving comprising a processor, a memory, a communication interface, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the processor to perform instructions comprising the steps of any of the data archiving methods. As shown in fig. 5, an electronic device of a hardware operating environment according to an embodiment of the present application may include:
a processor 501, such as a CPU.
The memory 502 may alternatively be a high speed RAM memory or a stable memory such as a disk memory.
A communication interface 503 for implementing connection communication between the processor 501 and the memory 502.
Those skilled in the art will appreciate that the configuration of the electronic device shown in fig. 5 is not intended to be limiting and may include more or fewer components than shown, or some components in combination, or a different arrangement of components.
As shown in fig. 5, the memory 502 may include an operating system, a network communication module, and one or more programs. An operating system is a program that manages and controls the server hardware and software resources, supporting the execution of one or more programs. The network communication module is used for communication among the components in the memory 502 and with other hardware and software in the electronic device.
In the electronic device shown in fig. 5, the processor 501 is configured to execute one or more programs in the memory 502, and to implement the following steps: when an archiving operation is detected on an archiving interface, acquiring N block chain identifications to be archived, N groups of heights of blocks to be archived and N archiving addresses, wherein the N block chain identifications to be archived are in one-to-one correspondence with the N groups of heights of the blocks to be archived, the N block chain identifications to be archived are in one-to-one correspondence with the N archiving addresses, and N is an integer greater than 1; determining the lengths of N block chains to be archived, which correspond to the N block chain to be archived one by one; determining N groups of blocks which correspond to the heights of the N groups of blocks to be archived one by one from the N blocks to be archived according to the lengths of the N blocks to be archived; acquiring N groups of block data from the N groups of blocks, wherein the N groups of blocks correspond to the N groups of block data one by one; and sending the N groups of block data to N filing nodes in one-to-one correspondence with the N filing addresses, and deleting the N groups of block data on the N to-be-filed block chains.
For specific implementation of the electronic device related to the present application, reference may be made to various embodiments of the data archiving method, which are not described herein again.
The present application further provides a computer readable storage medium for storing a computer program, the stored computer program being executable by the processor to perform the steps of: when an archiving operation is detected on an archiving interface, acquiring N block chain identifications to be archived, N groups of heights of blocks to be archived and N archiving addresses, wherein the N block chain identifications to be archived are in one-to-one correspondence with the N groups of heights of the blocks to be archived, the N block chain identifications to be archived are in one-to-one correspondence with the N archiving addresses, and N is an integer greater than 1; determining the lengths of N block chains to be archived, which correspond to the N block chain to be archived one by one; determining N groups of blocks which correspond to the heights of the N groups of blocks to be archived one by one from the N blocks to be archived according to the lengths of the N blocks to be archived; acquiring N groups of block data from the N groups of blocks, wherein the N groups of blocks correspond to the N groups of block data one by one; and sending the N groups of block data to N filing nodes in one-to-one correspondence with the N filing addresses, and deleting the N groups of block data on the N to-be-filed block chains.
For specific implementation of the computer-readable storage medium related to the present application, reference may be made to the embodiments of the data archiving method, which are not described herein again.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art should understand that the present application is not limited by the order of acts described, as some steps may be performed in other orders or simultaneously according to the present application. Further, those skilled in the art should also appreciate that the embodiments described in this specification are preferred embodiments and that the acts and modules involved are not necessarily required for this application.
The above embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present application.
Claims (10)
1. A method for archiving data, comprising:
when an archiving operation is detected on an archiving interface, acquiring N block chain identifications to be archived, N groups of heights of blocks to be archived and N archiving addresses, wherein the N block chain identifications to be archived are in one-to-one correspondence with the N groups of heights of the blocks to be archived, the N block chain identifications to be archived are in one-to-one correspondence with the N archiving addresses, and N is an integer greater than 1;
determining the lengths of N block chains to be archived, which correspond to the N block chain to be archived one by one;
determining N groups of blocks which correspond to the heights of the N groups of blocks to be archived one by one from the N blocks to be archived according to the lengths of the N blocks to be archived;
acquiring N groups of block data from the N groups of blocks, wherein the N groups of blocks correspond to the N groups of block data one by one;
and sending the N groups of block data to N filing nodes in one-to-one correspondence with the N filing addresses, and deleting the N groups of block data on the N to-be-filed block chains.
2. The method of claim 1, wherein said determining the length of N blockchains to be archived, which have a one-to-one correspondence with the N blockchain identifiers, comprises:
determining N block chains to be archived, which correspond to the N block chain to be archived in a one-to-one manner;
determining the number of block heads corresponding to each block chain to be archived in the N block chains to be archived;
and determining the length of the N block chains to be archived according to the number of block heads corresponding to each block chain to be archived in the N block chains to be archived.
3. The method according to claim 1, wherein the first blockchain identifier to be archived is any blockchain identifier of the N blockchain identifiers to be archived, and the determining the lengths of the N blockchains to be archived, which correspond to the N blockchain identifiers in one-to-one correspondence, comprises:
determining a first to-be-returned block chain corresponding to the first to-be-returned block chain identifier;
acquiring the block height corresponding to the starting block and the block height corresponding to the ending block in the first block chain to be subjected to the file grouping;
and determining the length of the first block chain to be restored according to the difference value of the block height corresponding to the starting block and the block height corresponding to the ending block in the first block chain to be restored.
4. The method according to any one of claims 1 to 3, wherein said determining N groups of blocks from said N chains of blocks to be archived, which correspond to the heights of said N groups of blocks to be archived one-to-one, according to the lengths of said N chains of blocks to be archived, comprises:
determining a second block chain to be archived and a third block chain to be archived from the N block chains to be archived, wherein the second block chain to be archived is the block chain with the longest block chain length in the N block chains to be archived, and the third block chain to be archived is the block chain with the shortest block chain length in the N block chains to be archived;
determining the length difference value of the second block chain to be subjected to filing and the third block chain to be subjected to filing;
if the length difference value of the second block chain to be archived and the third block chain to be archived is higher than a preset length difference value, determining N groups of blocks which correspond to the heights of the N groups of blocks to be archived one by one from the N block chains to be archived according to the length difference value of the third block chain to be archived and N-1 fourth block chains to be archived, wherein the N-1 fourth block chains to be archived are block chains of the N block chains to be archived except the third block chain to be archived;
if the length difference value between the second block chain to be archived and the third block chain to be archived is lower than the preset length difference value, determining N groups of blocks which correspond to the heights of the N groups of blocks to be archived one by one from the N block chains to be archived according to the length difference value between the second block chain to be archived and N-1 fifth block chains to be archived, wherein the N-1 fifth block chains to be archived are block chains in the N block chains to be archived except the second block chain to be archived.
5. The method according to claim 4, wherein said determining N groups of blocks corresponding to the heights of the N groups of blocks to be archived, one to one, from the N chains of blocks to be archived, according to the difference in length between the third chain of blocks to be archived and N-1 fourth chains of blocks to be archived, comprises:
and determining N groups of blocks which correspond to the heights of the N groups of blocks to be archived in a one-to-one manner from the N blocks to be archived according to a first sequence, wherein the first sequence is the sequence from small to large of the length difference between the third block chain to be archived and the N-1 fourth block chains to be archived.
6. The method according to claim 4, wherein said determining N groups of blocks corresponding to the heights of the N groups of blocks to be archived, one to one, from the N chains of blocks to be archived, according to the length difference between the second chain of blocks to be archived and N-1 fifth chains of blocks to be archived, comprises:
and according to a second sequence, determining N groups of blocks which correspond to the N groups of blocks to be archived in height one-to-one mode from the N blocks to be archived, wherein the second sequence is the sequence from large to small of the length difference of the second block chain to be archived and the N-1 fifth block chains to be archived.
7. The method according to any of claims 1-3, wherein said sending said N sets of block data to N archive nodes in one-to-one correspondence with said N archive addresses comprises:
sending a first group of block data to a first archiving node, where the first archiving node corresponds to an archiving address corresponding to a first to-be-archived block chain identifier, the first to-be-archived block chain identifier is any one of the N to-be-archived block chain identifiers, the first group of block data is block data acquired from a first to-be-archived block chain corresponding to the first to-be-archived block chain identifier according to a first group of to-be-archived block heights corresponding to the first to-be-archived block chain identifier, and the first group of to-be-archived block heights is one of the N groups of to-be-archived block heights.
8. A data archiving device is characterized by comprising a first acquisition module, a first determination module, a second acquisition module, a sending module and a deletion module,
the first obtaining module is configured to obtain N to-be-archived blockchain identifiers, N groups of to-be-archived block heights, and N archive addresses when an archive operation is detected on an archive interface, where the N to-be-archived blockchain identifiers are in one-to-one correspondence with the N groups of to-be-archived block heights, the N to-be-archived blockchain identifiers are in one-to-one correspondence with the N archive addresses, and N is an integer greater than 1;
the first determining module is configured to determine lengths of N to-be-archived block chains that are in one-to-one correspondence with the N to-be-archived block chain identifiers;
the second determining module is configured to determine, according to the lengths of the N to-be-archived block chains, N groups of blocks that correspond to the heights of the N groups of to-be-archived blocks one by one from the N to-be-archived block chains;
the second obtaining module is configured to obtain N groups of block data from the N groups of blocks, where the N groups of blocks are in one-to-one correspondence with the N groups of block data;
the sending module is configured to send the N groups of block data to N archive nodes that are in one-to-one correspondence with the N archive addresses;
and the deleting module is used for deleting the N groups of block data on the N to-be-archived block chains.
9. An electronic device for data archiving comprising a processor, a memory, a communication interface, and one or more programs, wherein the one or more programs are stored in the memory and are generated for execution by the processor to perform the instructions of the steps of the method of any one of claims 1-7.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium is used to store a computer program, which is executed by the processor, to implement the method of any of claims 1-7.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010918632.1A CN111984735A (en) | 2020-09-03 | 2020-09-03 | Data archiving method and device, electronic equipment and storage medium |
| PCT/CN2021/109269 WO2022048359A1 (en) | 2020-09-03 | 2021-07-29 | Data archiving method and apparatus, and electronic device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010918632.1A CN111984735A (en) | 2020-09-03 | 2020-09-03 | Data archiving method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111984735A true CN111984735A (en) | 2020-11-24 |
Family
ID=73447440
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010918632.1A Pending CN111984735A (en) | 2020-09-03 | 2020-09-03 | Data archiving method and device, electronic equipment and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN111984735A (en) |
| WO (1) | WO2022048359A1 (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112291376A (en) * | 2020-12-31 | 2021-01-29 | 腾讯科技（深圳）有限公司 | Data processing method and related equipment in block chain system |
| CN112559533A (en) * | 2020-12-23 | 2021-03-26 | 杭州趣链科技有限公司 | Continuous database filing method and device and electronic equipment |
| CN113220665A (en) * | 2021-05-20 | 2021-08-06 | 成都质数斯达克科技有限公司 | Block chain data archiving method and device, electronic equipment and readable storage medium |
| WO2022048359A1 (en) * | 2020-09-03 | 2022-03-10 | 深圳壹账通智能科技有限公司 | Data archiving method and apparatus, and electronic device and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190182029A1 (en) * | 2017-12-08 | 2019-06-13 | Electronics And Telecommunications Research Institute | Method of generating block chain and apparatus and method for generating blocks |
| CN110597887A (en) * | 2019-09-27 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Data management method, device and storage medium based on block chain network |
| CA3098645A1 (en) * | 2019-11-06 | 2020-02-20 | Alipay (Hangzhou) Information Technology Co., Ltd. | Prioritizing shared blockchain data storage |
| WO2020043048A1 (en) * | 2018-08-30 | 2020-03-05 | 杭州复杂美科技有限公司 | Parallel chain data synchronization method, device, and storage medium |
| CN111309808A (en) * | 2020-02-18 | 2020-06-19 | 腾讯科技（深圳）有限公司 | Page access method, device, equipment and storage medium for decentralized application |
| WO2020169061A1 (en) * | 2019-02-21 | 2020-08-27 | 腾讯科技（深圳）有限公司 | Method for recording data block on blockchain, and leader accounting node and medium |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108596767B (en) * | 2018-05-09 | 2021-11-02 | 中国工商银行股份有限公司 | Block chain historical data cleaning method and device |
| CN109298835B (en) * | 2018-08-16 | 2022-04-26 | 北京京东尚科信息技术有限公司 | Data archiving processing method, device, equipment and storage medium of block chain |
| CN111382119B (en) * | 2018-12-29 | 2023-08-22 | 华为技术有限公司 | Block data archiving method and related equipment |
| CN110442644A (en) * | 2019-07-08 | 2019-11-12 | 深圳壹账通智能科技有限公司 | Block chain data filing storage method, device, computer equipment and storage medium |
| CN111984735A (en) * | 2020-09-03 | 2020-11-24 | 深圳壹账通智能科技有限公司 | Data archiving method and device, electronic equipment and storage medium |
-
2020
- 2020-09-03 CN CN202010918632.1A patent/CN111984735A/en active Pending
-
2021
- 2021-07-29 WO PCT/CN2021/109269 patent/WO2022048359A1/en active Application Filing
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190182029A1 (en) * | 2017-12-08 | 2019-06-13 | Electronics And Telecommunications Research Institute | Method of generating block chain and apparatus and method for generating blocks |
| WO2020043048A1 (en) * | 2018-08-30 | 2020-03-05 | 杭州复杂美科技有限公司 | Parallel chain data synchronization method, device, and storage medium |
| WO2020169061A1 (en) * | 2019-02-21 | 2020-08-27 | 腾讯科技（深圳）有限公司 | Method for recording data block on blockchain, and leader accounting node and medium |
| CN110597887A (en) * | 2019-09-27 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Data management method, device and storage medium based on block chain network |
| CA3098645A1 (en) * | 2019-11-06 | 2020-02-20 | Alipay (Hangzhou) Information Technology Co., Ltd. | Prioritizing shared blockchain data storage |
| CN111309808A (en) * | 2020-02-18 | 2020-06-19 | 腾讯科技（深圳）有限公司 | Page access method, device, equipment and storage medium for decentralized application |
Non-Patent Citations (2)
| Title |
|---|
| 何晓东;黄新荣;: "浅析区块链技术在电子文件管理中的应用", 档案与建设, no. 02, 15 February 2018 (2018-02-15) * |
| 刘越男;张一锋;吴云鹏;郑?;: "区块链技术与文件档案管理:技术和管理的双向思考", 档案学通讯, no. 01, 18 January 2020 (2020-01-18) * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022048359A1 (en) * | 2020-09-03 | 2022-03-10 | 深圳壹账通智能科技有限公司 | Data archiving method and apparatus, and electronic device and storage medium |
| CN112559533A (en) * | 2020-12-23 | 2021-03-26 | 杭州趣链科技有限公司 | Continuous database filing method and device and electronic equipment |
| CN112559533B (en) * | 2020-12-23 | 2023-06-16 | 杭州趣链科技有限公司 | Archiving method and device of continuous database and electronic equipment |
| CN112291376A (en) * | 2020-12-31 | 2021-01-29 | 腾讯科技（深圳）有限公司 | Data processing method and related equipment in block chain system |
| CN112291376B (en) * | 2020-12-31 | 2021-04-09 | 腾讯科技（深圳）有限公司 | Data processing method and related equipment in block chain system |
| CN113220665A (en) * | 2021-05-20 | 2021-08-06 | 成都质数斯达克科技有限公司 | Block chain data archiving method and device, electronic equipment and readable storage medium |
| CN113220665B (en) * | 2021-05-20 | 2023-10-20 | 成都质数斯达克科技有限公司 | Block chain data archiving method and device, electronic equipment and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2022048359A1 (en) | 2022-03-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111984735A (en) | Data archiving method and device, electronic equipment and storage medium | |
| CN111201754B (en) | Device for providing cryptographically protected and filtered and ordered collection of transaction data sets for links of a blockchain | |
| CN111831548B (en) | Dependency relationship topological graph drawing method and device | |
| CN110266872B (en) | Address book data management and control method and device, cloud address book system, computer equipment and computer readable storage medium | |
| CN110543448A (en) | data synchronization method, device, equipment and computer readable storage medium | |
| CN111447069B (en) | Low-frequency access data processing method based on block chain | |
| CN112134956A (en) | Distributed Internet of things instruction management method and system based on block chain | |
| CN111488372A (en) | Data processing method, device and storage medium | |
| CN111460458A (en) | Data processing method, related device and computer storage medium | |
| CN111899019A (en) | Method and system for cross validation and sharing of blacklist and multiple parties | |
| CN113765675B (en) | Transaction data processing method, device, equipment and medium | |
| CN111488626A (en) | Data processing method, device, equipment and medium based on block chain | |
| CN111367923A (en) | Data processing method, data processing device, node equipment and storage medium | |
| CN111813418A (en) | Distributed link tracking method, device, computer equipment and storage medium | |
| CN111260475A (en) | Data processing method, block chain node point equipment and storage medium | |
| CN113162971B (en) | Block link point management method, device, computer and readable storage medium | |
| CN112040015B (en) | Consensus node list generation method and related device | |
| CN113824755A (en) | Method, system and related device for processing block chain data | |
| CN112559546B (en) | Database synchronization method, database synchronization device, computer equipment and readable storage medium | |
| CN110597466B (en) | Control method and device of block chain node, storage medium and computer equipment | |
| CN112217770B (en) | Security detection method, security detection device, computer equipment and storage medium | |
| CN111984202A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN112039893A (en) | Private transaction processing method and device, electronic equipment and readable storage medium | |
| CN117032998B (en) | Block chain-based data processing method and device and readable storage medium | |
| CN112948362B (en) | Data quality evaluation method, device, computer equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| CB02 | Change of applicant information |
Address after: 518000 Room 201, building A, No. 1, Qian Wan Road, Qianhai Shenzhen Hong Kong cooperation zone, Shenzhen, Guangdong (Shenzhen Qianhai business secretary Co., Ltd.) Applicant after: ONECONNECT FINANCIAL TECHNOLOGY Co.,Ltd. (SHANGHAI) Address before: Room 201, Building A, No. 1 Qianwan Road, Qianhaisheng Cooperation Zone, Shenzhen City, Guangdong Province, 518000 Applicant before: ONECONNECT FINANCIAL TECHNOLOGY Co.,Ltd. (SHANGHAI) |
|
| CB02 | Change of applicant information | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |