CN112506914A - 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
- CN112506914A CN112506914A CN201910872607.1A CN201910872607A CN112506914A CN 112506914 A CN112506914 A CN 112506914A CN 201910872607 A CN201910872607 A CN 201910872607A CN 112506914 A CN112506914 A CN 112506914A
- Authority
- CN
- China
- Prior art keywords
- block
- main
- chain
- auxiliary
- data
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000013523 data management Methods 0.000 title claims abstract description 22
- 230000008569 process Effects 0.000 claims abstract description 7
- 238000004590 computer program Methods 0.000 claims description 10
- 238000012217 deletion Methods 0.000 claims description 3
- 230000037430 deletion Effects 0.000 claims description 3
- 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
- 238000010586 diagram Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000001514 detection method Methods 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
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/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 an auxiliary block which are respectively connected behind the last data block are generated; all the sequentially connected main blocks form a main chain, all the sequentially connected auxiliary blocks form an auxiliary chain, and the main blocks in the main chain correspond to the auxiliary blocks in the auxiliary chain one to one; 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 in the display process, if the main block of the main chain cannot be detected, grabbing the auxiliary block corresponding to the main block from the auxiliary chain and displaying the auxiliary block. The method can delete the data blocks on the block chain, and prevent the harmful information from spreading on the block chain.
Description
Technical Field
The invention belongs to the technical field of block chains, and particularly relates to a block chain data management method, a block chain data management system, a block chain data management device and a block chain data management medium based on a double-chain structure.
Background
The block chain is a chain 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 cryptology mode and cannot be tampered and forged. The method is characterized in that the information on the chain can not be tampered and deleted.
The existing block chain generally adopts one chain, data blocks cannot be modified or deleted after being generated, and if a user stores the data blocks containing the illegal information, any person and organization cannot be deleted, and only the user can shield the data blocks through a browser end.
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 the data blocks on the block chain and avoid the transmission of harmful information on the block chain.
In a first aspect, a method for managing blockchain data based on a double-chain structure includes the following steps:
when a main data block is generated on the block chain, generating a main block and a sub-block which are respectively connected behind the last data block; all the sequentially connected main blocks form a main chain, all the sequentially connected auxiliary blocks form an auxiliary chain, and the main blocks in the main chain correspond to the auxiliary blocks in the auxiliary chain one to one;
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 in the display process, if the main block of the main chain cannot be detected, grabbing the auxiliary block corresponding to the main block from the auxiliary chain and displaying the auxiliary block.
Preferably, the main block and the sub-block each comprise a block head and a block body;
the block body of the auxiliary block is empty, and the block heads of the main block and the auxiliary block which are in one-to-one correspondence are the same.
Preferably, if the main block of the main chain cannot be detected, the grabbing the auxiliary block corresponding to the main block from the auxiliary chain specifically includes:
and if the block head of the specified main block cannot be searched in the main chain, grabbing the corresponding auxiliary block from the auxiliary chain.
Preferably, after the displaying the sub tile, 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 the block head of the main block is searched; and conversely, grabbing the corresponding auxiliary block from the auxiliary chain according to the block head of the auxiliary block.
In a second aspect, a block chain data management system based on a double-chain structure includes:
a creation unit: the data block generating device is used for generating a main block and a sub block which are respectively connected behind a last data block when the main data block is generated on the block chain; all the sequentially connected main blocks form a main chain, all the sequentially connected auxiliary blocks form an auxiliary chain, and the main blocks in the main chain correspond to the auxiliary blocks in the auxiliary chain one to one;
a deletion unit: the main block deleting device is used for deleting a main block in the main chain when a user deleting instruction is received;
a display unit: and the main chain is displayed when a display instruction of a user is received, and in the display process, if the main block of the main chain cannot be 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 sub-block each comprise a block head and a block body;
the block body of the auxiliary block is empty, and the block heads of the main block and the auxiliary block which are in one-to-one correspondence are the same.
Preferably, the display unit is specifically configured to:
and if the block head of the specified main block cannot be searched in the main chain, grabbing the corresponding auxiliary block from the auxiliary 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; and conversely, grabbing the corresponding auxiliary block from the auxiliary chain according to the block head of the auxiliary block.
In a third aspect, an apparatus comprises a processor and a memory, the processor and the memory being connected to each other, wherein the memory is configured to store a computer program, the computer program comprising program instructions, and the processor is configured to call the program instructions to execute the method of 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, the block chain data management method, the block chain data management system, the block chain data management device and the block chain data management medium based on the double-chain structure provided by the invention have the advantages that a user can delete any main block (main block containing harmful information) in a main chain according to needs, even if the main block is deleted, the auxiliary block corresponding to the deleted main block in the auxiliary chain can be captured and displayed when data is displayed, and the harmful information is prevented from being spread on the block chain.
Drawings
In order to more clearly illustrate the detailed description of the invention or the technical solutions in the prior art, the drawings that are needed in the detailed description of the invention or the prior art will be briefly described below. Throughout the drawings, like elements or portions are generally identified by like reference numerals. In the drawings, elements or portions 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 block chain data management method according to an embodiment of the present 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 present invention will be described in detail below with reference to the accompanying drawings. The following examples are only for illustrating the technical solutions of the present invention more clearly, and therefore are only examples, and the protection scope of the present invention is not limited thereby. It is to be noted that, unless otherwise specified, technical or scientific terms used herein shall have the ordinary meaning as understood by those skilled in the art to which the invention pertains.
It will be understood that the terms "comprises" and/or "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 the specification of the present invention 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 contextually as "when", "upon" or "in response to a determination" or "in response to a detection". Similarly, the phrase "if it is determined" or "if a [ described condition or event ] is detected" may be interpreted contextually to mean "upon determining" or "in response to determining" or "upon detecting [ described condition or event ]" or "in response to detecting [ described condition or event ]".
The first embodiment is as follows:
a block chain data management method based on a double-chain structure, see fig. 1, comprising the following steps:
s1: when a main data block is generated on the block chain, generating a main block and a sub-block which are respectively connected behind the last data block; all the sequentially connected main blocks form a main chain, all the sequentially connected auxiliary blocks form an auxiliary chain, and the main blocks in the main chain correspond to the auxiliary blocks in the auxiliary chain one to one;
specifically, referring to fig. 1, for example, if it is necessary to generate a main data block after a 0 block, a main block (a1 block, a2 block, A3 block, … … An block) and sub blocks (B1 block, B2 block, B3 block, … … Bn block) connected after the 0 block are generated, a main chain (a chain) is formed by the sequentially connected main blocks, a sub chain (B chain) is formed by the sequentially connected sub blocks, the main block in the main chain and the sub blocks in the sub chain are in one-to-one correspondence, that is, the a1 block corresponds to the B1 block, the a2 block corresponds to the B2 block, and so on. The main chain is used for displaying outwards, namely when a user views data on the block chain, the data of the A chain is displayed.
S2: when a user deleting instruction is received, deleting a main block in the main chain;
specifically, assuming that the a2 chunk on the a chain stores harmful information, the a2 chunk on the a chain may be deleted.
S3: and when a display instruction of a user is received, displaying the main chain, and in the display process, if the main block of the main chain cannot be detected, grabbing the auxiliary block corresponding to the main block from the auxiliary chain and displaying the auxiliary block.
Specifically, since each data block in the block chain is connected to an adjacent data block, in the conventional single-chain block chain, if a certain data block in the block chain is deleted, the entire block chain is broken, so that the conventional single-chain block chain cannot delete or modify the data block.
When any main block in the main chain is deleted, the block chain with the double-chain structure can capture the corresponding auxiliary block in the auxiliary chain to replace the main block, so that the integrity of the whole block chain is ensured. Referring to fig. 2, for example, when a2 block is deleted on the a chain and an a2 block does not exist, the a2 block cannot be searched on the a chain from the a1 block. At this time, the B2 block corresponding to the A2 block is grabbed on the B chain to replace the A2 block, and 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 as required, even if the main block is deleted, the auxiliary block corresponding to the deleted main block in the auxiliary chain can be captured for displaying when data is displayed, and the harmful information is prevented from being spread on the block chain.
Preferably, the main block and the sub-block each comprise a block head and a block body;
the block body of the auxiliary block is empty, and the block heads of the main block and the auxiliary block which are in one-to-one correspondence are the same.
Specifically, the block header includes data for generating the next data block. Therefore, the next data block can be searched according to the block head, and the corresponding sub-block can be searched according to the last block when the main block cannot be searched because the block heads of the main block and the sub-block which are in one-to-one correspondence are the same. The 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 cannot be detected, the grabbing the auxiliary block corresponding to the main block from the auxiliary chain specifically includes:
and if the block head of the specified main block cannot be searched in the main chain, grabbing the corresponding auxiliary block from the auxiliary chain.
Preferably, after the displaying the sub tile, 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 the block head of the main block is searched; and conversely, grabbing the corresponding auxiliary block from the auxiliary chain according to the block head of the auxiliary block.
Specifically, when data display is performed, after a B2 tile is captured in the B chain, the next main tile A3 tile is captured in the a chain according to the tile header of the B2 tile, and if the A3 tile exists, the data of the tile block in the A3 tile is displayed without being deleted. If the A3 tile is deleted, then the A3 tile cannot be grabbed in the A chain according to the B2 tile at this time, so the B3 tile continues to be grabbed in the B chain for display.
Example two:
a block chain data management system based on double chain structure, referring to fig. 3, comprising:
a creation unit: the data block generating device is used for generating a main block and a sub block which are respectively connected behind a last data block when the main data block is generated on the block chain; all the sequentially connected main blocks form a main chain, all the sequentially connected auxiliary blocks form an auxiliary chain, and the main blocks in the main chain correspond to the auxiliary blocks in the auxiliary chain one to one;
specifically, for example, if it is necessary to generate a main data block after a 0 block, main blocks (a1 block, a2 block, A3 block, … … An block) and sub blocks (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 correspond to the auxiliary blocks in the auxiliary chain one by one, namely the A1 blocks correspond to the B1 blocks, the A2 blocks correspond to the B2 blocks, and the like. The main chain is used for displaying outwards, namely when a user views data on the block chain, the data of the A chain is displayed.
A deletion unit: the main block deleting device is used for deleting a main block in the main chain when a user deleting instruction is received;
specifically, assuming that the a2 chunk on the a chain stores harmful information, the a2 chunk on the a chain may be deleted.
A display unit: and the main chain is displayed when a display instruction of a user is received, and in the display process, if the main block of the main chain cannot be 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 in the block chain is connected to an adjacent data block, in the conventional single-chain block chain, if a certain data block in the block chain is deleted, the entire block chain is broken, so that the conventional single-chain block chain cannot delete or modify the data block.
When any main block in the main chain is deleted, the block chain with the double-chain structure can capture the corresponding auxiliary block in the auxiliary chain to replace the main block, so that the integrity of the whole block chain is ensured. Referring to fig. 2, for example, when a2 block is deleted on the a chain and an a2 block does not exist, the a2 block cannot be searched on the a chain from the a1 block. At this time, the B2 block corresponding to the A2 block is grabbed on the B chain to replace the A2 block, and the integrity of the whole block chain is ensured.
The system user can delete any main block (main block containing harmful information) in the main chain as required, even if the main block is deleted, the auxiliary block corresponding to the deleted main block in the auxiliary chain can be captured for displaying when data is displayed, and the harmful information is prevented from being spread on the block chain.
Preferably, the main block and the sub-block each comprise a block head and a block body;
the block body of the auxiliary block is empty, and the block heads of the main block and the auxiliary block which are in one-to-one correspondence are the same.
Specifically, the block header includes data for generating the next data block. Therefore, the next data block can be searched according to the block head, and the corresponding sub-block can be searched according to the last block when the main block cannot be searched because the block heads of the main block and the sub-block which are in one-to-one correspondence are the same. The 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 if the block head of the specified main block cannot be searched in the main chain, grabbing the corresponding auxiliary block from the auxiliary 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; and conversely, grabbing the corresponding auxiliary block from the auxiliary chain according to the block head of the auxiliary block.
Specifically, when data display is performed, after a B2 tile is captured in the B chain, the next main tile A3 tile is captured in the a chain according to the tile header of the B2 tile, and if the A3 tile exists, the data of the tile block in the A3 tile is displayed without being deleted. If the A3 tile is deleted, then the A3 tile cannot be grabbed in the A chain according to the B2 tile at this time, so the B3 tile continues to be grabbed in the B chain for display.
In the several embodiments provided in the present application, it should be understood that the disclosed system may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may also be an electric, mechanical or other form of connection.
The units described as separate parts may or may not be physically separate, and parts displayed 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 can be selected according to actual needs to achieve the purpose of the solution of the embodiment of the present invention.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention essentially or partially contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute 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), a magnetic disk or an optical disk, and other various media capable of storing program codes.
Example three:
an apparatus, see fig. 4, comprising a processor 801 and a memory 802, the processor 801 and the memory 802 being interconnected via a bus 803, wherein the memory 802 is configured to store a computer program, the computer program comprising program instructions, and the processor 801 is configured to call the program instructions to perform the method according to the first embodiment.
It should be understood that in the present embodiment, the Processor 801 may be a Central Processing Unit (CPU), and the Processor may be other general purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components, etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory 802 may include both read-only memory and random access memory, and provides instructions and data to the processor 801. A portion of the memory 802 may also include non-volatile random access memory. For example, the memory 802 may also store device type information.
For the sake of brief description, the embodiments of the present invention do not provide references to the corresponding contents in the foregoing method embodiments.
Example four:
a computer-readable storage medium, in which a computer program is stored, the computer program comprising program instructions which, when executed by a processor, cause the processor to carry out 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), and the like 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 for storing 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 the sake of brief description, the media provided by the embodiments of the present invention, and the portions of the embodiments that are not mentioned, refer to the corresponding contents in the foregoing method embodiments.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; such modifications and substitutions do not depart from the spirit and scope of the present invention, and they should be construed as being included in the following claims and description.
Claims (10)
1. A block chain data management method based on a double-chain structure is characterized by comprising the following steps:
when a main data block is generated on the block chain, generating a main block and a sub-block which are respectively connected behind the last data block; all the sequentially connected main blocks form a main chain, all the sequentially connected auxiliary blocks form an auxiliary chain, and the main blocks in the main chain correspond to the auxiliary blocks in the auxiliary chain one to one;
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 in the display process, if the main block of the main chain cannot be detected, grabbing the auxiliary block corresponding to the main block from the auxiliary chain and displaying the auxiliary block.
2. The method for managing block chain data according to claim 1,
the main block and the auxiliary block respectively comprise a block head and a block body;
the block body of the auxiliary block is empty, and the block heads of the main block and the auxiliary block which are in one-to-one correspondence are the same.
3. The method for managing block chain data according to claim 2,
if the main block of the main chain cannot be detected, grabbing the auxiliary block corresponding to the main block from the auxiliary chain specifically comprises the following steps:
and if the block head of the specified main block cannot be searched in the main chain, grabbing the corresponding auxiliary block from the auxiliary chain.
4. The method for managing data of a blockchain based on a dual-chain structure as claimed in claim 3, further comprising, after said displaying the secondary blocks:
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 block head of the main block is searched; and conversely, grabbing the corresponding auxiliary block from the auxiliary chain according to the block head of the auxiliary block.
5. A block chain data management system based on a double-chain structure is characterized by comprising:
a creation unit: the data block generating device is used for generating a main block and a sub block which are respectively connected behind a last data block when the main data block is generated on the block chain; all the sequentially connected main blocks form a main chain, all the sequentially connected auxiliary blocks form an auxiliary chain, and the main blocks in the main chain correspond to the auxiliary blocks in the auxiliary chain one to one;
a deletion unit: the main block deleting device is used for deleting a main block in the main chain when a user deleting instruction is received;
a display unit: and the main chain is displayed when a display instruction of a user is received, and in the display process, if the main block of the main chain cannot be detected, the auxiliary block corresponding to the main block is grabbed from the auxiliary chain, and the auxiliary block is displayed.
6. The system according to claim 5, wherein the data management system comprises a plurality of data management modules,
the main block and the auxiliary block respectively comprise a block head and a block body;
the block body of the auxiliary block is empty, and the block heads of the main block and the auxiliary block which are in one-to-one correspondence are the same.
7. The system according to claim 6,
the display unit is specifically configured to:
and if the block head of the specified main block cannot be searched in the main chain, grabbing the corresponding auxiliary block from the auxiliary chain.
8. The system according to claim 7,
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; and conversely, grabbing the corresponding auxiliary block from the auxiliary chain according to the block head of the auxiliary block.
9. An apparatus comprising a processor and a memory, the processor and the 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 one of claims 1-4.
10. A computer-readable storage medium, characterized in that the computer storage medium stores a computer program comprising program instructions that, when executed by a processor, cause the processor to perform the method according to any of claims 1-4.
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 true CN112506914A (en) | 2021-03-16 |
| CN112506914B 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 (16)
| 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 |
| US20180131706A1 (en) * | 2016-11-10 | 2018-05-10 | International Business Machines Corporation | Filtering and redacting blockchain transactions |
| 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 |
| US20190081793A1 (en) * | 2017-09-12 | 2019-03-14 | Kadena, LLC | Parallel-chain architecture for blockchain systems |
| 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 |
| US20190147065A1 (en) * | 2017-11-16 | 2019-05-16 | International Business Machines Corporation | Method and system for verification of deleted data for blockchains |
| US20190155513A1 (en) * | 2017-11-20 | 2019-05-23 | 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 |
| CN110061850A (en) * | 2019-04-24 | 2019-07-26 | 电子科技大学 | The collision calculation method and editable block chain building method of chameleon hash function |
-
2019
- 2019-09-16 CN CN201910872607.1A patent/CN112506914B/en active Active
Patent Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180131706A1 (en) * | 2016-11-10 | 2018-05-10 | International Business Machines Corporation | Filtering and redacting blockchain transactions |
| 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 |
| US20190081793A1 (en) * | 2017-09-12 | 2019-03-14 | 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 |
| US20190155513A1 (en) * | 2017-11-20 | 2019-05-23 | 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 |
| 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 (5)
| Title |
|---|
| H. KRAWCZYK等: "Chameleon signatures", PROCEEDINGS OF THE NETWORK AND DISTRIBUTED SYSTEM SECURITY SYMPOSIUM, NDSS 2000, 31 December 2000 (2000-12-31) * |
| 任艳丽;徐丹婷;张新鹏;谷大武;: "基于门限环签名的可删除区块链", 通信学报, no. 04, 16 April 2019 (2019-04-16) * |
| 任艳丽等: "基于门限环签名的可删除区块链", 通信学报, vol. 40, no. 4, 30 April 2019 (2019-04-30), pages 71 - 82 * |
| 李佩丽等: "可更改区块链技术研究", 密码学报, vol. 5, no. 5, 31 October 2018 (2018-10-31), pages 501 - 509 * |
| 毕娅;周贝;冷凯君;王存法;: "基于双链架构的医药商业资源公有区块链", 计算机科学, no. 02, 15 February 2018 (2018-02-15) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112506914B (en) | 2024-02-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108108127B (en) | File reading method and system | |
| CN106030498B (en) | Storage device and data processing method and storage system | |
| US20190354944A1 (en) | Edit transactions for blockchains | |
| CN104407829B (en) | A kind of image mirrors display methods and its device | |
| CN109977684B (en) | Data transmission method and device and terminal equipment | |
| EP3316150A1 (en) | Method and apparatus for file compaction in key-value storage system | |
| EP3438845A1 (en) | Data updating method and device for a distributed database system | |
| CN111444196A (en) | Method, device and equipment for generating Hash of global state in block chain type account book | |
| CN104246727A (en) | Data processing system and method for operating a data processing system | |
| CN104123280A (en) | File comparison method and device | |
| CN110781196A (en) | Block chain transaction processing method and device, computer equipment and storage medium | |
| US20180373893A1 (en) | Method and system for emergency data destruction | |
| CN112148498A (en) | Data synchronization method, device, server and storage medium | |
| CN101599080A (en) | A kind of organization system of Backup Data and method | |
| CN106227583A (en) | A kind of multiple thread video Real-time Data Processing Method and device | |
| CN112506914A (en) | Block chain data management method, system, device and medium based on double-chain structure | |
| US20090259659A1 (en) | Identifying entities of interest | |
| WO2020247115A1 (en) | Subscription to edits of blockchain transaction | |
| CN111930890A (en) | Information sending method and device, terminal equipment and storage medium | |
| CN111143092A (en) | Fault recording data processing method and system and terminal equipment | |
| CN116738089A (en) | Rendering method, chip, electronic device and storage medium | |
| CN107832021B (en) | Electronic evidence fixing method, terminal equipment and storage medium | |
| CN112650645B (en) | Heap memory use condition monitoring method and device and 5G base station equipment | |
| EP1977551B1 (en) | Binding a protected application program to shell code | |
| CN113360571A (en) | Characteristic mark-based power grid monitoring system memory database relation database synchronization method |
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 |