CN112506914B - Block chain data management method, system, device and medium based on double-chain structure - Google Patents
Block chain data management method, system, device and medium based on double-chain structure Download PDFInfo
- Publication number
- CN112506914B CN112506914B CN201910872607.1A CN201910872607A CN112506914B CN 112506914 B CN112506914 B CN 112506914B CN 201910872607 A CN201910872607 A CN 201910872607A CN 112506914 B CN112506914 B CN 112506914B
- Authority
- CN
- China
- Prior art keywords
- block
- main
- chain
- auxiliary
- blocks
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 34
- 238000013523 data management Methods 0.000 title claims abstract description 19
- 230000008569 process Effects 0.000 claims abstract description 7
- 238000004590 computer program Methods 0.000 claims description 8
- 230000009977 dual effect Effects 0.000 claims description 4
- 238000012217 deletion Methods 0.000 claims description 3
- 230000037430 deletion Effects 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 abstract 1
- 230000004044 response Effects 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000001514 detection method Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000007480 spreading Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 235000019800 disodium phosphate Nutrition 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
-
- 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/24—Querying
- G06F16/248—Presentation of query results
-
- 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
Abstract
According to the block chain data management method based on the double-chain structure, when a main data block is generated on a block chain, a main block and a sub block which are respectively connected with the last data block are generated; all the sequentially connected main blocks form a main chain, and all the sequentially connected auxiliary blocks form auxiliary chains, wherein the main blocks in the main chain and the auxiliary blocks in the auxiliary chains are in one-to-one correspondence; when a user deleting instruction is received, deleting a main block in the main chain; and when a display instruction of a user is received, displaying the main chain, and if a main block of the main chain is not detected in the display process, grabbing a sub block corresponding to the main block from the sub chain, and displaying the sub block. The method can delete the data blocks on the block chain and avoid the transmission of harmful information on the block chain.
Description
Technical Field
The invention belongs to the technical field of blockchains, and particularly relates to a blockchain data management method, a system, a device and a medium based on a double-chain structure.
Background
The blockchain is a chained data structure formed by combining data blocks in a sequential connection mode according to a time sequence, and belongs to a distributed account book which is guaranteed in a cryptographic mode and cannot be tampered and counterfeited. The method is characterized in that the information on the chain cannot be tampered and deleted.
The existing blockchain generally adopts one chain, the data blocks cannot be modified or deleted after being generated, and if users store the data blocks containing forbidden information, any person and organization cannot be deleted, and only the browser end can be used for shielding.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides a block chain data management method, a system, a device and a medium based on a double-chain structure, which can delete a data block on a block chain and avoid the propagation of harmful information on the block chain.
In a first aspect, a blockchain data management method based on a double-chain structure includes the steps of:
when a main data block is generated on a block chain, generating a main block and a sub block which are respectively connected after the last data block; all the sequentially connected main blocks form a main chain, and all the sequentially connected auxiliary blocks form auxiliary chains, wherein the main blocks in the main chain and the auxiliary blocks in the auxiliary chains are in one-to-one correspondence;
when a user deleting instruction is received, deleting a main block in the main chain;
and when a display instruction of a user is received, displaying the main chain, and if a main block of the main chain is not detected in the display process, grabbing a sub block corresponding to the main block from the sub chain, and displaying the sub block.
Preferably, the main block and the auxiliary block comprise a block head and a block body;
the area blocks of the auxiliary blocks are empty, and the block heads of the main blocks and the auxiliary blocks which are in one-to-one correspondence are the same.
Preferably, if the main block of the main chain is not detected, capturing the sub block corresponding to the main block from the sub chain specifically includes:
and grabbing the corresponding secondary block from the secondary chain if the block head of the designated primary block is not searched in the main chain.
Preferably, after the displaying the sub-block, the method further comprises:
searching the block head of the main block in the main chain according to the block head of the auxiliary block, and displaying the main block when searching; otherwise, the corresponding sub block is grabbed from the sub chain according to the block head of the sub block.
In a second aspect, a blockchain data management system based on a dual chain structure includes:
a creation unit: for generating a main block and a sub block connected respectively after a last data block when the main data block is generated on the blockchain; all the sequentially connected main blocks form a main chain, and all the sequentially connected auxiliary blocks form auxiliary chains, wherein the main blocks in the main chain and the auxiliary blocks in the auxiliary chains are in one-to-one correspondence;
a deletion unit: when receiving a user deleting instruction, deleting a main block in the main chain;
and a display unit: and the main chain is used for displaying the main chain when a display instruction of a user is received, and in the display process, if the main block of the main chain is not detected, the auxiliary block corresponding to the main block is grabbed from the auxiliary chain, and the auxiliary block is displayed.
Preferably, the main block and the auxiliary block comprise a block head and a block body;
the area blocks of the auxiliary blocks are empty, and the block heads of the main blocks and the auxiliary blocks which are in one-to-one correspondence are the same.
Preferably, the display unit is specifically configured to:
and grabbing the corresponding secondary block from the secondary chain if the block head of the designated primary block is not searched in the main chain.
Preferably, the display unit is further configured to:
searching the block head of the main block in the main chain according to the block head of the auxiliary block, and displaying the main block when the next main block is searched; otherwise, the corresponding sub block is grabbed from the sub chain according to the block head of the sub block.
In a third aspect, an apparatus comprises a processor and a memory, the processor and the memory being interconnected, wherein the memory is adapted to store a computer program, the computer program comprising program instructions, the processor being configured to invoke the program instructions to perform the method according to the first aspect.
In a fourth aspect, a computer readable storage medium stores a computer program comprising program instructions which, when executed by a processor, cause the processor to perform the method of the first aspect.
According to the technical scheme, according to the block chain data management method, system, device and medium based on the double-chain structure, a user can delete any main block (the main block containing harmful information) in the main chain according to the requirement, even if the main block is deleted, when data display is performed, the auxiliary block corresponding to the deleted main block in the auxiliary chain can be grasped for display, and the harmful information is prevented from spreading on the block chain.
Drawings
In order to more clearly illustrate the embodiments of the present invention 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. Like elements or portions are generally identified by like reference numerals throughout the several figures. In the drawings, elements or portions thereof are not necessarily drawn to scale.
FIG. 1 is a flowchart of a block chain data management method according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of a blockchain data management method according to an embodiment of the invention.
FIG. 3 is a block diagram of a blockchain data management system according to a second embodiment of the present invention.
Fig. 4 is a block diagram of an apparatus according to a third embodiment of the present invention.
Detailed Description
Embodiments of the technical scheme of the present invention will be described in detail below with reference to the accompanying drawings. The following examples are only for more clearly illustrating the technical aspects of the present invention, and thus are merely examples, and are not intended to limit the scope of the present invention. It is noted that unless otherwise indicated, technical or scientific terms used herein should be given the ordinary meaning as understood by one of ordinary skill in the art to which this invention pertains.
It should be understood that the terms "comprises" and "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It is also to be understood that the terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in this specification and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
As used in this specification and the appended claims, the term "if" may be interpreted as "when..once" or "in response to a determination" or "in response to detection" depending on the context. Similarly, the phrase "if a determination" or "if a [ described condition or event ] is detected" may be interpreted in the context of meaning "upon determination" or "in response to determination" or "upon detection of a [ described condition or event ]" or "in response to detection of a [ described condition or event ]".
Embodiment one:
a blockchain data management method based on a double-chain structure, see fig. 1, includes the following steps:
s1: when a main data block is generated on a block chain, generating a main block and a sub block which are respectively connected after the last data block; all the sequentially connected main blocks form a main chain, and all the sequentially connected auxiliary blocks form auxiliary chains, wherein the main blocks in the main chain and the auxiliary blocks in the auxiliary chains are in one-to-one correspondence;
specifically, referring to fig. 1, for example, if it is necessary to generate a main data block after the 0 block, a main block (A1 block, A2 block, A3 block, … … An block) and a sub block (B1 block, B2 block, B3 block, … … Bn block) connected after the 0 block are generated, a main chain (a chain) is constituted by the sequentially connected main blocks, a sub chain (B chain) is constituted by the sequentially connected sub blocks, the main block and the sub block in the sub chain in the main chain are in one-to-one correspondence, i.e., the A1 block corresponds to the B1 block, the A2 block corresponds to the B2 block, and so on. The backbone is used for external display, i.e., displaying the data of the A chain when the user is about to view the data on the blockchain.
S2: when a user deleting instruction is received, deleting a main block in the main chain;
specifically, assuming that the A2 blocks on the a chain store harmful information, the A2 blocks on the a chain may be deleted.
S3: and when a display instruction of a user is received, displaying the main chain, and if a main block of the main chain is not detected in the display process, grabbing a sub block corresponding to the main block from the sub chain, and displaying the sub block.
Specifically, since each data block and adjacent data blocks in the blockchain are interconnected, in a conventional single-chain blockchain, if a certain data block in the blockchain is deleted, the whole blockchain is broken, so that the conventional single-chain blockchain cannot delete or modify the data block.
The blockchain with the double-chain structure can grasp the corresponding auxiliary block in the auxiliary chain to replace the corresponding auxiliary block when deleting any main block in the main chain, so that the integrity of the whole blockchain is ensured. Referring to fig. 2, for example, when an A2 block is deleted on the a chain, the A2 block is not present, the A2 block cannot be searched according to the A1 block on the a chain. At the moment, B2 blocks corresponding to the A2 blocks are grabbed on the B chain and used for replacing the A2 blocks, so that the integrity of the whole block chain is ensured.
According to the method, a user can delete any main block (the main block containing harmful information) in the main chain according to the requirement, even if the main block is deleted, the user can grasp the auxiliary block corresponding to the deleted main block in the auxiliary chain for displaying when the data is displayed, and the harmful information is prevented from spreading on the block chain.
Preferably, the main block and the auxiliary block comprise a block head and a block body;
the area blocks of the auxiliary blocks are empty, and the block heads of the main blocks and the auxiliary blocks which are in one-to-one correspondence are the same.
Specifically, the block header includes data for generating the next data block. The next data block can be searched according to the block header, and since the block headers of the main block and the sub block corresponding one to one are the same, when the main block cannot be searched, the corresponding sub block can be searched according to the previous block. The area block of the sub-block is empty, which indicates that there is no data in the sub-block, so that the display interface is blank when the sub-block is displayed.
Preferably, if the main block of the main chain is not detected, capturing the sub block corresponding to the main block from the sub chain specifically includes:
and grabbing the corresponding secondary block from the secondary chain if the block head of the designated primary block is not searched in the main chain.
Preferably, after the displaying the sub-block, the method further comprises:
searching the block head of the main block in the main chain according to the block head of the auxiliary block, and displaying the main block when searching; otherwise, the corresponding sub block is grabbed from the sub chain according to the block head of the sub block.
Specifically, when the data is displayed, after the B2 block is grabbed in the B chain, the next main block A3 block is grabbed in the a chain according to the block header of the B2 block, and if the A3 block exists, the data of the block in the A3 block is displayed without being deleted. If the A3 block is deleted, then the A3 block cannot be grabbed in the A chain according to the B2 block at this time, so the B3 block is grabbed in the B chain continuously for display.
Embodiment two:
a blockchain data management system based on a double-chain structure, see fig. 3, comprising:
a creation unit: for generating a main block and a sub block connected respectively after a last data block when the main data block is generated on the blockchain; all the sequentially connected main blocks form a main chain, and all the sequentially connected auxiliary blocks form auxiliary chains, wherein the main blocks in the main chain and the auxiliary blocks in the auxiliary chains are in one-to-one correspondence;
specifically, for example, if it is necessary to generate a main data block after the 0 block, a main block (A1 block, A2 block, A3 block, … … An block) and a sub block (B1 block, B2 block, B3 block, … … Bn block) connected after the 0 block are generated, a main chain (a chain) is constituted by the sequentially connected main blocks, and a sub chain (B chain) is constituted by the sequentially connected sub blocks. The main blocks in the main chain and the auxiliary blocks in the auxiliary chain are in one-to-one correspondence, namely, the A1 block corresponds to the B1 block, the A2 block corresponds to the B2 block, and the like. The backbone is used for external display, i.e., displaying the data of the A chain when the user is about to view the data on the blockchain.
A deletion unit: when receiving a user deleting instruction, deleting a main block in the main chain;
specifically, assuming that the A2 blocks on the a chain store harmful information, the A2 blocks on the a chain may be deleted.
And a display unit: and the main chain is used for displaying the main chain when a display instruction of a user is received, and in the display process, if the main block of the main chain is not detected, the auxiliary block corresponding to the main block is grabbed from the auxiliary chain, and the auxiliary block is displayed.
Specifically, since each data block and adjacent data blocks in the blockchain are interconnected, in a conventional single-chain blockchain, if a certain data block in the blockchain is deleted, the whole blockchain is broken, so that the conventional single-chain blockchain cannot delete or modify the data block.
The blockchain with the double-chain structure can grasp the corresponding auxiliary block in the auxiliary chain to replace the corresponding auxiliary block when deleting any main block in the main chain, so that the integrity of the whole blockchain is ensured. Referring to fig. 2, for example, when an A2 block is deleted on the a chain, the A2 block is not present, the A2 block cannot be searched according to the A1 block on the a chain. At the moment, B2 blocks corresponding to the A2 blocks are grabbed on the B chain and used for replacing the A2 blocks, so that the integrity of the whole block chain is ensured.
The system user can delete any main block (the main block containing the harmful information) in the main chain according to the requirement, even if the main block is deleted, the system user can grasp the auxiliary block corresponding to the deleted main block in the auxiliary chain for displaying when the data is displayed, and the harmful information is prevented from spreading on the block chain.
Preferably, the main block and the auxiliary block comprise a block head and a block body;
the area blocks of the auxiliary blocks are empty, and the block heads of the main blocks and the auxiliary blocks which are in one-to-one correspondence are the same.
Specifically, the block header includes data for generating the next data block. The next data block can be searched according to the block header, and since the block headers of the main block and the sub block corresponding one to one are the same, when the main block cannot be searched, the corresponding sub block can be searched according to the previous block. The area block of the sub-block is empty, which indicates that there is no data in the sub-block, so that the display interface is blank when the sub-block is displayed.
Preferably, the display unit is specifically configured to:
and grabbing the corresponding secondary block from the secondary chain if the block head of the designated primary block is not searched in the main chain.
Preferably, the display unit is further configured to:
searching the block head of the main block in the main chain according to the block head of the auxiliary block, and displaying the main block when the next main block is searched; otherwise, the corresponding sub block is grabbed from the sub chain according to the block head of the sub block.
Specifically, when the data is displayed, after the B2 block is grabbed in the B chain, the next main block A3 block is grabbed in the a chain according to the block header of the B2 block, and if the A3 block exists, the data of the block in the A3 block is displayed without being deleted. If the A3 block is deleted, then the A3 block cannot be grabbed in the A chain according to the B2 block at this time, so the B3 block is grabbed in the B chain continuously for display.
In the several embodiments provided in this application, it should be understood that the disclosed system may be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. In addition, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices, or elements, or may be an electrical, mechanical, or other form of connection.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiment of the present invention.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention is essentially or a part contributing to the prior art, or all or part of the technical solution may be embodied in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Embodiment III:
an apparatus, see fig. 4, comprising a processor 801 and a memory 802, the processor 801 and the memory 802 being interconnected by a bus 803, wherein the memory 802 is adapted to store a computer program comprising program instructions, the processor 801 being configured to invoke the program instructions to perform the method according to embodiment one.
It should be appreciated that in embodiments of the present invention, the processor 801 may be a central processing unit (Central Processing Unit, CPU) which may also be other general purpose processors, digital signal processors (Digital Signal Processor, DSPs), application specific integrated circuits (Application Specific Integrated Circuit, ASICs), off-the-shelf programmable gate arrays (Field-Programmable Gate Array, FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory 802 may include read only memory and random access memory, and provides instructions and data to the processor 801. A portion of memory 802 may also include non-volatile random access memory. For example, the memory 802 may also store information of device type.
For a brief description, reference may be made to the corresponding contents of the foregoing method embodiments for the device provided in the embodiments of the present invention, where the description of the embodiments is not mentioned.
Embodiment four:
a computer readable storage medium storing a computer program comprising program instructions which, when executed by a processor, cause the processor to perform the method of embodiment one.
The computer readable storage medium may be an internal storage unit of the terminal according to any of the foregoing embodiments, for example, a hard disk or a memory of the terminal. The computer readable storage medium may also be an external storage device of the terminal, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card) or the like, which are provided on the terminal. Further, the computer-readable storage medium may also include both an internal storage unit and an external storage device of the terminal. The computer-readable storage medium is used to store the computer program and other programs and data required by the terminal. The computer-readable storage medium may also be used to temporarily store data that has been output or is to be output.
For a brief description, reference may be made to the corresponding contents of the foregoing method embodiments for the media provided in the embodiments of the present invention, where the description of the embodiments is not mentioned.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and not for limiting the same; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the invention, and are intended to be included within the scope of the appended claims and description.
Claims (8)
1. The block chain data management method based on the double-chain structure is characterized by comprising the following steps of:
when a main data block is generated on a block chain, generating a main block and a sub block which are respectively connected after the last data block; all the sequentially connected main blocks form a main chain, and all the sequentially connected auxiliary blocks form auxiliary chains, wherein the main blocks in the main chain and the auxiliary blocks in the auxiliary chains are in one-to-one correspondence;
when a user deleting instruction is received, deleting a main block in the main chain;
when a display instruction of a user is received, displaying the main chain, and if a main block of the main chain cannot be detected in the display process, grabbing a sub block corresponding to the main block from a sub chain, and displaying the sub block;
the main block and the auxiliary block comprise block heads and block bodies;
the area blocks of the auxiliary blocks are empty, and the block heads of the main blocks and the auxiliary blocks which are in one-to-one correspondence are the same.
2. The method of claim 1, wherein the block chain data management based on the double chain structure,
if the main block of the main chain cannot be detected, capturing the auxiliary block corresponding to the main block from the auxiliary chain specifically comprises the following steps:
and grabbing the corresponding secondary block from the secondary chain if the block head of the designated primary block is not searched in the main chain.
3. The blockchain data management method of claim 2, further comprising, after the displaying the secondary block:
searching the block head of the main block in the main chain according to the block head of the auxiliary block, and displaying the main block when searching; otherwise, the corresponding sub block is grabbed from the sub chain according to the block head of the sub block.
4. A blockchain data management system based on a dual chain structure, comprising:
a creation unit: for generating a main block and a sub block connected respectively after a last data block when the main data block is generated on the blockchain; all the sequentially connected main blocks form a main chain, and all the sequentially connected auxiliary blocks form auxiliary chains, wherein the main blocks in the main chain and the auxiliary blocks in the auxiliary chains are in one-to-one correspondence;
a deletion unit: when receiving a user deleting instruction, deleting a main block in the main chain;
and a display unit: the main chain is used for displaying the main chain when a display instruction of a user is received, and in the display process, if a main block of the main chain is not detected, a sub block corresponding to the main block is grabbed from the sub chain, and the sub block is displayed;
the main block and the auxiliary block comprise block heads and block bodies;
the area blocks of the auxiliary blocks are empty, and the block heads of the main blocks and the auxiliary blocks which are in one-to-one correspondence are the same.
5. The blockchain data management system based on a dual chain structure of claim 4,
the display unit is specifically configured to:
and grabbing the corresponding secondary block from the secondary chain if the block head of the designated primary block is not searched in the main chain.
6. The blockchain data management system based on a dual chain structure of claim 5,
the display unit is further configured to:
searching the block head of the main block in the main chain according to the block head of the auxiliary block, and displaying the main block when the next main block is searched; otherwise, the corresponding sub block is grabbed from the sub chain according to the block head of the sub block.
7. An apparatus comprising a processor and a memory, the processor and memory being interconnected, wherein the memory is configured to store a computer program comprising program instructions, the processor being configured to invoke the program instructions to perform the method of any of claims 1-3.
8. A computer readable storage medium, characterized in that the computer storage medium stores a computer program comprising program instructions which, when executed by a processor, cause the processor to perform the method of any of claims 1-3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910872607.1A CN112506914B (en) | 2019-09-16 | 2019-09-16 | Block chain data management method, system, device and medium based on double-chain structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910872607.1A CN112506914B (en) | 2019-09-16 | 2019-09-16 | Block chain data management method, system, device and medium based on double-chain structure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112506914A CN112506914A (en) | 2021-03-16 |
| CN112506914B true CN112506914B (en) | 2024-02-27 |
Family
ID=74923971
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910872607.1A Active CN112506914B (en) | 2019-09-16 | 2019-09-16 | Block chain data management method, system, device and medium based on double-chain structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112506914B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107103098A (en) * | 2017-05-12 | 2017-08-29 | 曾建伟 | A kind of block chain net type database comprising intelligent contract and method of work |
| CN108595535A (en) * | 2018-03-30 | 2018-09-28 | 李欣宇 | Knowledge Q-A system and method based on the double-chain block chain of same root |
| CN108764902A (en) * | 2018-05-23 | 2018-11-06 | 北京京东尚科信息技术有限公司 | Method, node and block catenary system for storing data |
| CN109032802A (en) * | 2018-07-26 | 2018-12-18 | 国信优易数据有限公司 | A kind of block catenary system and management method |
| CN109117097A (en) * | 2018-09-05 | 2019-01-01 | 深圳正品创想科技有限公司 | A kind of date storage method and system based on block chain |
| CN109213900A (en) * | 2018-09-18 | 2019-01-15 | 百度在线网络技术（北京）有限公司 | A kind of data modification method, device, equipment and the medium of block chain |
| CN109391643A (en) * | 2017-08-03 | 2019-02-26 | 中国移动通信有限公司研究院 | Block chain light-weight technologg method, block chain node and storage medium |
| CN109428892A (en) * | 2017-09-01 | 2019-03-05 | 埃森哲环球解决方案有限公司 | Multistage rewritable block chain |
| CN109523381A (en) * | 2018-10-18 | 2019-03-26 | 尚维斯 | A kind of erasable formula date storage method based on block chain |
| CN109558276A (en) * | 2018-11-30 | 2019-04-02 | 弗洛格（武汉）信息科技有限公司 | Block chain standby system, backup method and block chain verification method, verifying system |
| CN110061850A (en) * | 2019-04-24 | 2019-07-26 | 电子科技大学 | The collision calculation method and editable block chain building method of chameleon hash function |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10171509B2 (en) * | 2016-11-10 | 2019-01-01 | International Business Machines Corporation | Filtering and redacting blockchain transactions |
| US10938567B2 (en) * | 2017-09-12 | 2021-03-02 | Kadena Llc | Parallel-chain architecture for blockchain systems |
| US20190147065A1 (en) * | 2017-11-16 | 2019-05-16 | International Business Machines Corporation | Method and system for verification of deleted data for blockchains |
| US10739997B2 (en) * | 2017-11-20 | 2020-08-11 | International Business Machines Corporation | Deletion of blocks in a blockchain |
| US20190188086A1 (en) * | 2017-12-14 | 2019-06-20 | International Business Machines Corporation | Redundancy reduction in blockchains |
-
2019
- 2019-09-16 CN CN201910872607.1A patent/CN112506914B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107103098A (en) * | 2017-05-12 | 2017-08-29 | 曾建伟 | A kind of block chain net type database comprising intelligent contract and method of work |
| CN109391643A (en) * | 2017-08-03 | 2019-02-26 | 中国移动通信有限公司研究院 | Block chain light-weight technologg method, block chain node and storage medium |
| CN109428892A (en) * | 2017-09-01 | 2019-03-05 | 埃森哲环球解决方案有限公司 | Multistage rewritable block chain |
| CN108595535A (en) * | 2018-03-30 | 2018-09-28 | 李欣宇 | Knowledge Q-A system and method based on the double-chain block chain of same root |
| CN108764902A (en) * | 2018-05-23 | 2018-11-06 | 北京京东尚科信息技术有限公司 | Method, node and block catenary system for storing data |
| CN109032802A (en) * | 2018-07-26 | 2018-12-18 | 国信优易数据有限公司 | A kind of block catenary system and management method |
| CN109117097A (en) * | 2018-09-05 | 2019-01-01 | 深圳正品创想科技有限公司 | A kind of date storage method and system based on block chain |
| CN109213900A (en) * | 2018-09-18 | 2019-01-15 | 百度在线网络技术（北京）有限公司 | A kind of data modification method, device, equipment and the medium of block chain |
| CN109523381A (en) * | 2018-10-18 | 2019-03-26 | 尚维斯 | A kind of erasable formula date storage method based on block chain |
| CN109558276A (en) * | 2018-11-30 | 2019-04-02 | 弗洛格（武汉）信息科技有限公司 | Block chain standby system, backup method and block chain verification method, verifying system |
| CN110061850A (en) * | 2019-04-24 | 2019-07-26 | 电子科技大学 | The collision calculation method and editable block chain building method of chameleon hash function |
Non-Patent Citations (4)
| Title |
|---|
| Chameleon signatures;H. Krawczyk等;Proceedings of the Network and Distributed System Security Symposium, NDSS 2000;20001231;全文 * |
| 任艳丽 ; 徐丹婷 ; 张新鹏 ; 谷大武 ; .基于门限环签名的可删除区块链.通信学报.2019,(04),全文. * |
| 可更改区块链技术研究;李佩丽等;密码学报;20181031;第5卷(第5期);第501-509页 * |
| 基于双链架构的医药商业资源公有区块链;毕娅;周贝;冷凯君;王存法;;计算机科学;20180215(02);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112506914A (en) | 2021-03-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100979825B1 (en) | Direct memory access transfer buffer processor | |
| US9811549B2 (en) | Applying a database transaction log record directly to a database table container | |
| CN106030498B (en) | Storage device and data processing method and storage system | |
| CN109977684B (en) | Data transmission method and device and terminal equipment | |
| CN105471714A (en) | Message processing method and device | |
| CN112286939A (en) | Method, device and equipment for generating Hash of global state in block chain type account book | |
| CN111723059B (en) | Data compression method and device, terminal equipment and storage medium | |
| CN104123280A (en) | File comparison method and device | |
| Hand et al. | Bin-Carver: Automatic recovery of binary executable files | |
| CN112506914B (en) | Block chain data management method, system, device and medium based on double-chain structure | |
| CN110753080A (en) | Block transmission method, device, equipment and readable storage medium | |
| JP2012507767A5 (en) | ||
| CN114127707A (en) | System, computing node and method for processing write requests | |
| KR100792214B1 (en) | Apparatus and Method OF processing for HL7 Message | |
| CN110018792B (en) | Method and device for processing data to be landed, electronic equipment and storage medium | |
| EP3980955A1 (en) | Subscription to edits of blockchain transaction | |
| CN111444194B (en) | Method, device and equipment for clearing indexes in block chain type account book | |
| CN110955383B (en) | Data storage device and non-volatile memory control method | |
| CN111581289B (en) | Data management method, system, device and medium for double-head block chain | |
| CN113407492B (en) | Method and device for storing file fragments and reorganizing file fragments and file protection system | |
| CN106815235B (en) | Super webpage template generation method and device and page data transmission method | |
| CN111435332A (en) | Data processing method and device | |
| CN110874486B (en) | Method, device and equipment for reading data in block chain type account book | |
| CN114428594B (en) | Image display method, device, electronic equipment and storage medium | |
| RU2804310C1 (en) | Method of protection of information placed in external data storages |
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 |