CN109274728A - Block chain Data lifecycle management method - Google Patents
Block chain Data lifecycle management method Download PDFInfo
- Publication number
- CN109274728A CN109274728A CN201811022588.5A CN201811022588A CN109274728A CN 109274728 A CN109274728 A CN 109274728A CN 201811022588 A CN201811022588 A CN 201811022588A CN 109274728 A CN109274728 A CN 109274728A
- Authority
- CN
- China
- Prior art keywords
- block
- node
- precipitating
- block chain
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Marketing (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention provides a kind of block chain Data lifecycle management method, block data structures are increased into monitoring variable, variable includes block access times, block last access time, block access validity period, block life cycle, precipitating label, sedimentation basin index value.Block access times store the total degree that the block has been accessed since creation；Block last access time record block last time it is accessed at the time of；The longest term that block access validity period record block can be accessed can precipitate the block if block is not visited more than this time limit.Block after precipitating retains block index value, and block data is no longer participate in synchronization, and is temporarily stored in sedimentation basin, but still resilient within block life cycle.
Description
Technical field
The present invention relates to a kind of data managing methods, more particularly, to a kind of block chain Data lifecycle management method.
Background technique
Block chain technology is that algorithm of knowing together with storing data, using distributed node is verified using block linked data structure
Guarantee the safety of data transmission and access with more new data, in the way of cryptography, using by automatized script generation to generate
The intelligent contract of code composition programs the completely new distributed basis framework and calculation of one kind with operation data.Such as bit coin
It is a fully distributed system, system is made of many nodes, and each node has accounting capabilities.With transaction constantly into
Row, block constantly produce, and the block on each node is gone here and there in chronological order is formed block chain together.System is related to several
A key concept, node, chain, block, record, relationship are as shown in Figure 1.
The appearance of block chain technology, the operation for intelligent contract provide the credible performing environment of non-repudiation.Some areas
Block chain developer combines block chain and intelligent contract, creates the first floor system that intelligent contract, open source are realized on block chain,
That is block platform chain, such as ether mill, EOS, greatly facilitate the exploitation of block chain application, and have expanded block chain technology
Application scenarios.
The major issue that block platform chain faces now is exactly that node data is synchronous and access efficiency is relatively low.It is true
On, current public ether mill network and bit coin network it is average it is per second can handle 7-10 transaction, this number is far below
The concentrating payment processor as Visa, the latter's about 8000 transactions of average energy processing per second.Using logistics block chain as representative
Alliance's chain and privately owned chain, also because data are synchronous in node and access slowly, allow the growth rate of block chain easily to fall into bottleneck.
Node data synchronization and access efficiency are relatively low, so that those such as pay such application programs in real time is difficult the height on block chain
Effect operation finally will bring inconvenience to user, why this is also as PayPal as the time of confirmation payment is elongated
One of the main reason for still more attractive with Credit Card Payments mode as Visa.With more more complicated DApps
It becomes dependent upon in an identical block chain network, problem caused by slow transactions velocity can only become more complicated.
Its essential reason is in the distributed storage of block chain, and the time is more long, will lead to each block storage number of node
According to it is excessive, newly enter that block synchronization time is too long, access time is also too long.But in fact many historical datas have been invalid datas
Or priceless Value Data, extreme influence block chain operational efficiency.
From the technical point of view, the common recognition agreement of all block chains has a challenging limitation: in network
Each node participated in completely has to verify each transaction, and these nodes must be kept with its other nodes
Unanimously, this is the component part of block chain technology, it guarantees the safety of block chain by creating distributed account book.
Block chain divides according to application scenarios, reading and writing data range, can be divided into three classes: public block chain, alliance's block
Chain and privately owned block chain.Public block chain refers to the whole world, and anyone can participate in, anyone can trade above,
Read-write, the block chain known together.Shared block chain be it is fully distributed, number is it is disclosed that user's participation is high, convenient for promoting, but
It is that system operation relies on reward mechanism.Application scenarios are just like bit coin, ether mill etc..Alliance's chain is meant that, such as more finance
Mechanism, each mechanism constitute the distributed system of a block chain as a node together.This is only limited to it to block chain
Between a little mechanisms, or the participation node of common recognition process.Super account book (HyperLedger) of the typical case scene just like IBM.It is complete
Complete privately owned block chain refers to that the block chain that permission is only organized in hand at one is written in it.Permission or opening are read, or
Person by arbitrary extent is limited.
Most of as bit coin and ether mill on block chain, node is run by the public.Although
The common recognition mechanism of decentralization provides some important advantages, such as fault-tolerance, safety, political impartiality and authenticity, but
The method for being this validation chain is to reduce synchronous and access efficiency as cost.It is as shown in Figure 2 the example of block chain, chain
In two blocks mutually bound by the predecessor node hash value in block head with subsequent node hash value, the block of each block
Know from experience storage record data.When these block chains become longer, number of blocks will increase sharply, and will need more and more
Processing capacity verifies these blocks, this may cause bottleneck in the network of these block chains, to slow down those creations
The speed of new application.It is that can be reached in each node but in the alliance's chain and privately owned chain using logistics block chain as representative
In the case where common recognition, the hash of precipitating or destruction Partial Block.Node where user, can need to precipitate in label
Or after destroying block, mark information is passed into other nodes in network, request confirmation information.If other nodes agree to precipitating
Or destruction mark node, then confirmation message is returned to initiation node.How many node are specifically needed to reach common understanding just precipitable and sell
Block is ruined, need to be set according to specific block chain type and application background.
Summary of the invention
Based on These characteristics, present invention introduces " data life period " mechanism, intend to solve the synchronization of block data, access and
Store pressure.Data lifecycle management (data life cycle management, DLM) is a kind of side based on strategy
Flowing of the data in whole life cycle for management information system: method from creation and initial storage, is judged as to it
It is deleted after invalid.In block chain technology, all data informations are all stored in always in the different blocks of node, but are wherein had
The data of significant portion block are seldom accessed to, or even having some is invalid, redundancy data.If none machine
System goes screening to get rid of these data when block is synchronous in node, then increasing with block counts, block chain constantly extends,
The increase of block data in node finally would become hard to progress node and synchronize, and the block information storage of node itself can also encounter bottle
Neck.If access times, last access time, block access validity period, block life are added in each block data structures
The information such as phase are deposited, then can carry out block screening based on these variables, judge which block is effective block.Further according to setting
Authentication mechanism precipitates the not visited block of some long-times, i.e., removes the block from block chain, be temporarily stored in sedimentation basin
In, sedimentation basin synchronizes backup separately from each block in block chain.If still not visited in the precipitating phase, by the block pin
It ruins.
The present invention provides a kind of block chain Data lifecycle management method, it is invalid, redundancy in block chain to solve
The method of data processing, it is described that its technical solution is as follows:
Block data structures are increased monitoring variable, variable includes by a kind of block chain Data lifecycle management method
Block access times, block last access time, block access validity period, block life cycle, precipitating label, sedimentation basin index
Value, when management the following steps are included:
(1) before the block data for synchronizing each node, system can check last access time and the visit of each block
Ask number, if the block is not accessed again within block validity period, and access times are less than given threshold, then are designated as
Precipitate block；
(2) precipitating block is no longer linked in former block chain, precipitates the previous block and its latter block phase of block
Link resets subsequent block hash value and front and continued block hash value corresponding in the two block heads, the new area of one section of composition
Block chain；
(3) block in sedimentation basin is independently synchronized and is backed up with the block in block chain, and content is in user node
Request reduction, and after the above node confirmation of amount, it can restore again according to the index hash value in block head in former block
Chain position；If precipitating block to be accessed within block life cycle, it can also cancel precipitating label automatically, restore in former block chain
Position；
(4) if the time is more than the longest term that can stop in sedimentation basin of block, not each node on block chain
The data of the block are synchronized, and destroy the block in sedimentation basin, i.e., are moved the index value of the block from sedimentation basin index chain
It removes, does not resynchronize and back up the block.
In step (1), threshold value can be by user's sets itself according to block chain application background, and user is same by adjusting block
The minimum access times threshold value of step adjusts the precipitating of block or destroys strategy.
It when synchronizing the block data of each node, adjusts synchronizing speed and accelerates, then by the way that threshold value is set as high value reality
It is existing.
In step (2), the block of precipitating is no longer participate in the index hash value that block chain is synchronous, in reserved area build, temporarily
There are in sedimentation basin.
Any node in distributed network can initiate the precipitating of useless block data and destroy request, other nodes
On there is N_apply node to approve, so that it may synchronized in whole network.
Requesting node number N_apply is needed to be set according to factors such as block chain type, block chain application environments.
In step (3), when a certain node, which is ready for block, to be synchronized, system can inquire the last access time of the block
With the access times of block, and on this basis the block whether still access validity period in, if having exceeded validity period and visit
It asks number deficiency given threshold v_total, then precipitates the block to sedimentation basin, the block in sedimentation basin is no longer normally carried out together
Step, but still data are saved, it is that entirety synchronizes backup with sedimentation basin.
When node be ready for block it is synchronous when, user can marked invalid block according to demand, system is in label pad
After can to other nodes issue block precipitating or destroy request.It, can if agreeing to that node is more than to need requesting node number N_apply
To carry out block precipitating or destruction, then carries out block and synchronize；If agreeing to that number of nodes deficiency needs requesting node number N_apply,
It is synchronous directly to carry out block.
The present invention redesigns the data structure of block by introducing " data life period mechanism ", introduce access times,
The area that the variables such as last access time, block access validity period, block life cycle, precipitating or destruction are not accessed for a long time
Block.On the one hand synchronization and the access efficiency for being conducive to be promoted node allow the synchronization of node and access to carry out within the shorter time,
When being carried out with alleviating transaction, the case where network is blocked by a large amount of incomplete transactions, accelerate the operation speed.On the other hand, also favorably
In alleviating the pressure stored locally to block data in node, the gradually extension with block chain, memory space are avoided the occurrence of
Insufficient situation.
" data life period " mechanism initiates life cycle management two of formula including automatic life cycle management and node
Point.Allow block synchronize in invalid block precipitating and destroy and can not only automate progress, but also can be carried out with manual request formula, greatly
Promote block chain operational efficiency.
Detailed description of the invention
Fig. 1 is the relation schematic diagram of node, chain, block, record；
Fig. 2 is the example schematic of existing block chain；
Fig. 3 is the groundwork flow diagram of block chain；
Fig. 4 is present invention reconstruct block head data structure diagram；
Fig. 5 is automatic life cycle management algorithm flow chart；
Fig. 6 is that node initiates formula life cycle management algorithm flow chart.
Specific embodiment
Present invention introduces " data life period " mechanism, are redesigned to block data structures, increase block
The variables such as access times, block last access time, block access validity period, block life cycle, it is synchronous to solve block data
With efficiency relatively low problem when access, specific block data structures are referring to figure 4..Block access times store the block from creation
Since be accessed total degree；Block last access time record block last time it is accessed at the time of；Block access has
The longest term that effect phase record block can be accessed can precipitate the block if block is not visited more than this time limit.It is heavy
Block after shallow lake retains block index value, and block data is no longer participate in synchronization, and is temporarily stored in sedimentation basin, but in block
It is still resilient within the scope of life cycle.
" data life period " mechanism that the present invention establishes initiates the life of formula including automatic life cycle management and node
Cycle management two parts.The groundwork process of block chain is as shown in Figure 3: firstly, sending node the whole network when transaction record occurs
Broadcast recoding, the whole network node can listen to new transaction record.Later, node verifies transaction record and is put into node and delayed
Area is deposited, starts " digging mine " and calculates, to win book keeping operation power.If certain node has won book keeping operation power, then record generation area can be packaged
Block, and know together to the whole network broadcast, the whole network node synchronizes new block, is appended to block by the block of common recognition
The tail portion of chain.But theoretically each node can receive whole history, this increases many useless nodes
Network total load.
Automatic life cycle management of the present invention be node carry out block data it is synchronous when spontaneous each block of detection whether
Within access validity period (in the longest term that i.e. block can be accessed).Before synchronizing the block data of each node, it is
System can check last access time and the access times of each block, if the block is not accessed again within block validity period
It crosses, and access times are less than given threshold, is then designated as precipitating block.Threshold value need to according to block chain application background by user from
Row setting, user can be by adjusting the synchronous minimum access times threshold value of block, adjusting the precipitating of block or destroying strategy, such as
It needs to adjust synchronizing speed to very fast level, then can be realized by the way that high value will be set as.Precipitating block is no longer linked at former area
In block chain, the previous block and its latter block for precipitating block are linked, reset it is corresponding in the two block heads after
Continuous block hash value and front and continued block hash value, the new block chain of one section of composition.It is same that the block of precipitating is then no longer participate in block chain
It walks, the index hash value in reserved area build is temporarily stored in sedimentation basin.Block in sedimentation basin and the block in block chain are only
Vertical to synchronize and back up, content requests to restore in user node, and after the above node confirmation of amount, can basis again
Index hash value in block head is restored in former block chain position.If precipitate block is accessed (i.e. area within block life cycle
In the longest term that block can stop in sedimentation basin), precipitating label can also be cancelled automatically, restored in former block chain position.Such as
The fruit time is more than the longest term that can stop in sedimentation basin of block, then not on block chain, each node synchronizes the number of the block
According to, and the block is destroyed in sedimentation basin, i.e., the index value of the block is removed from sedimentation basin index chain, is not resynchronized and standby
Part block.
Automatic life cycle management can effectively promote synchronization and the block access efficiency of each node of block chain, can be very big
Alleviate bottleneck caused by invalid block data accumulation in ground.However sometimes, user needs that certain useless blocks is directly marked to carry out
Precipitating and destruction, so invention introduces the life cycle management methods that node initiates formula.
In the life cycle management that node of the present invention initiates formula, any node in distributed network can be sent out
Play the precipitating of useless block data and destroy request, there is N_apply node approval on other nodes, so that it may whole network into
Row synchronizes.This algorithm at the first time can be purged block data when node users find useless block, avoid nothing
It is synchronized in block chain again with block.Need requesting node number N_apply can be according to block chain type, block chain application environment etc.
Factor setting.Such as in privately owned chain, need requesting node number N_apply that can be set as high value (such as total node number 80%), big absolutely
Most nodes carry out invalid block precipitating and destruction in the case where all approving；If needing requesting node number N_apply in alliance's chain
(such as total nodal point number 60%) can optionally be turned down, it is ensured that request can obtain feedback result within a short period of time.
In conclusion it is same to reduce invalid block data by " data life period " mechanism of setting block by the present invention
Step effectively improves block data synchronization and access speed in node, and then improves the operational efficiency of block chain, and reduce
Its carrying cost.
Invention example one: the block head data structure of redesign of the present invention is as shown in Figure 4.The present invention passes through in left side
On the basis of the data structure of allusion quotation block head, add block access times, block last access time, block access validity period,
The variables such as block life cycle, precipitating label, sedimentation basin index value.Block access times have recorded block quilt total since creation
Access times, block validity period, which records the block, allows accessed maximum duration limit, and block life cycle records the block quilt
After precipitating, not destroyed longest allows the time in sedimentation basin, and precipitating records whether the block is deposited, sedimentation basin rope
Draw position of the value record block in sedimentation basin.
Invention example two: automatic life cycle management method flow chart of the present invention is as shown in Figure 5.When a certain node is quasi-
When standby progress block synchronizes, system can inquire last access time and the access times of block of the block, and on this basis
Whether the block, if having exceeded validity period and access times deficiency given threshold v_total, sinks still within access validity period
The block form sediment to sedimentation basin, the block in sedimentation basin is no longer normally carried out synchronization, but still saves data, is whole with sedimentation basin
Synchronize backup.If desired precipitating block accesses again, can apply for that block restores.If precipitate block within life cycle still
It is not accessed, then destroys it in sedimentation basin, no longer back up its block data, can not apply restoring.It is precipitated and is sold
Each block of node can be carried out by, which ruining after verifying, synchronizes.
Invention example three: it is as shown in Figure 6 that node of the present invention initiates formula life cycle management method flow chart.Work as node
When being ready for block synchronization, user can marked invalid block, system can be to other nodes after label pad according to demand
It issues block precipitating or destroys request.If agreeing to that node is more than to need requesting node number N_apply, block precipitating can be carried out
Or it destroys, then carry out block and synchronize；If agreeing to that number of nodes deficiency needs requesting node number N_apply, directly progress block is same
Step.
Claims (8)
1. block data structures are increased monitoring variable by a kind of block chain Data lifecycle management method, variable includes area
Block access number, block last access time, block access validity period, block life cycle, precipitating label, sedimentation basin index value,
When management the following steps are included:
(1) before the block data for synchronizing each node, system can check last access time and the access time of each block
Number, if the block is not accessed again within block validity period, and access times are less than given threshold, then are designated as precipitating
Block；
(2) precipitating block is no longer linked in former block chain, and the previous block and its latter block for precipitating block are linked,
Reset subsequent block hash value and front and continued block hash value corresponding in the two block heads, the new block chain of one section of composition；
(3) block in sedimentation basin is independently synchronized and is backed up with the block in block chain, and content is requested in user node
Reduction, and after the above node confirmation of amount, it can restore again according to the index hash value in block head in former block chain position
It sets；If precipitating block to be accessed within block life cycle, it can also cancel precipitating label automatically, restore in former block chain position
It sets；
(4) if the time is more than the longest term that block can stop in sedimentation basin, not on block chain, each node is synchronous
The data of the block, and the block is destroyed in sedimentation basin, i.e., the index value of the block is removed from sedimentation basin index chain, no
Resynchronize and back up the block.
2. block chain Data lifecycle management method according to claim 1, it is characterised in that: in step (1), threshold value
Can be by user's sets itself according to block chain application background, the minimum access times threshold value that user is synchronized by adjusting block,
It adjusts the precipitating of block or destroys strategy.
3. block chain Data lifecycle management method according to claim 2, it is characterised in that: synchronize each node
Block data when, adjust synchronizing speed accelerate, then by by threshold value be set as high value realize.
4. block chain Data lifecycle management method according to claim 1, it is characterised in that: in step (2), precipitating
Block be no longer participate in the index hash value that block chain is synchronous, in reserved area build, be temporarily stored in sedimentation basin.
5. block chain Data lifecycle management method according to claim 1, it is characterised in that: in distributed network
Any node can initiate the precipitating of useless block data and destroy request, have N_apply node to approve on other nodes,
It can be synchronized in whole network.
6. block chain Data lifecycle management method according to claim 5, it is characterised in that: need requesting node number N_
Apply is set according to factors such as block chain type, block chain application environments.
7. block chain Data lifecycle management method according to claim 1, it is characterised in that: in step (3), when certain
One node be ready for block it is synchronous when, system can inquire last access time and the access times of block of the block, and with
Whether this is according to the block still within access validity period, if having exceeded validity period and access times deficiency given threshold v_
Total then precipitates the block to sedimentation basin, and the block in sedimentation basin is no longer normally carried out synchronization, but still saves data, with heavy
Shallow lake pond is that entirety synchronizes backup.
8. block chain Data lifecycle management method according to claim 1, it is characterised in that: when node is ready for
When block is synchronous, user marked invalid block, system can issue block to other nodes after label pad according to demand
Precipitating destroys request.If agreeing to that node is more than to need requesting node number N_apply, block precipitating or destruction can be carried out,
It is synchronous that block is carried out again；If agreeing to that number of nodes deficiency needs requesting node number N_apply, directly progress block is synchronous.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811022588.5A CN109274728B (en) | 2018-09-03 | 2018-09-03 | Block chain data life cycle management method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811022588.5A CN109274728B (en) | 2018-09-03 | 2018-09-03 | Block chain data life cycle management method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109274728A true CN109274728A (en) | 2019-01-25 |
| CN109274728B CN109274728B (en) | 2021-08-10 |
Family
ID=65187351
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811022588.5A Active CN109274728B (en) | 2018-09-03 | 2018-09-03 | Block chain data life cycle management method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109274728B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110222532A (en) * | 2019-06-06 | 2019-09-10 | 杭州趣链科技有限公司 | A kind of subregion common recognition method for realizing the secret protection of alliance's chain based on NameSpace |
| CN110851445A (en) * | 2019-11-07 | 2020-02-28 | 浪潮云信息技术有限公司 | Method for safely storing data based on block chain technology |
| CN111143341A (en) * | 2019-12-25 | 2020-05-12 | 江苏众享金联科技有限公司 | Block chain account body slimming method based on intelligent contract |
| CN111311263A (en) * | 2020-03-18 | 2020-06-19 | 广州知弘科技有限公司 | Local safety accounting method for block chain node |
| CN112883009A (en) * | 2019-11-29 | 2021-06-01 | 北京百度网讯科技有限公司 | Method and apparatus for processing data |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017006134A1 (en) * | 2015-07-08 | 2017-01-12 | Barclays Bank Plc | Secure digital data operations |
| CN106530083A (en) * | 2016-10-27 | 2017-03-22 | 上海亿账通区块链科技有限公司 | Multi-chain management method and system based on block chain |
| CN106686087A (en) * | 2016-12-30 | 2017-05-17 | 先锋支付有限公司 | Blockchain truncation method and distributed node |
| CN108123936A (en) * | 2017-12-13 | 2018-06-05 | 北京科技大学 | A kind of access control method and system based on block chain technology |
| WO2018125989A2 (en) * | 2016-12-30 | 2018-07-05 | Intel Corporation | The internet of things |
-
2018
- 2018-09-03 CN CN201811022588.5A patent/CN109274728B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017006134A1 (en) * | 2015-07-08 | 2017-01-12 | Barclays Bank Plc | Secure digital data operations |
| CN106530083A (en) * | 2016-10-27 | 2017-03-22 | 上海亿账通区块链科技有限公司 | Multi-chain management method and system based on block chain |
| CN106686087A (en) * | 2016-12-30 | 2017-05-17 | 先锋支付有限公司 | Blockchain truncation method and distributed node |
| WO2018125989A2 (en) * | 2016-12-30 | 2018-07-05 | Intel Corporation | The internet of things |
| CN108123936A (en) * | 2017-12-13 | 2018-06-05 | 北京科技大学 | A kind of access control method and system based on block chain technology |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110222532A (en) * | 2019-06-06 | 2019-09-10 | 杭州趣链科技有限公司 | A kind of subregion common recognition method for realizing the secret protection of alliance's chain based on NameSpace |
| CN110851445A (en) * | 2019-11-07 | 2020-02-28 | 浪潮云信息技术有限公司 | Method for safely storing data based on block chain technology |
| CN110851445B (en) * | 2019-11-07 | 2022-05-03 | 浪潮云信息技术股份公司 | Method for safely storing data based on block chain technology |
| CN112883009A (en) * | 2019-11-29 | 2021-06-01 | 北京百度网讯科技有限公司 | Method and apparatus for processing data |
| CN111143341A (en) * | 2019-12-25 | 2020-05-12 | 江苏众享金联科技有限公司 | Block chain account body slimming method based on intelligent contract |
| CN111143341B (en) * | 2019-12-25 | 2023-12-19 | 江苏众享金联科技有限公司 | Block chain account book weight reducing method based on intelligent contracts |
| CN111311263A (en) * | 2020-03-18 | 2020-06-19 | 广州知弘科技有限公司 | Local safety accounting method for block chain node |
| CN111311263B (en) * | 2020-03-18 | 2021-07-16 | 广州知弘科技有限公司 | Local safety accounting method for block chain node |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109274728B (en) | 2021-08-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109274728A (en) | Block chain Data lifecycle management method | |
| US10986177B2 (en) | Systems and methods of self-forking blockchain protocol | |
| Buterin | A next-generation smart contract and decentralized application platform | |
| CN109829718B (en) | Block chain multi-level framework based on storage application scene and operation method thereof | |
| CN109964446A (en) | A kind of common recognition method based on ballot | |
| US20160342988A1 (en) | Temporary consensus networks in a resource transfer system | |
| CN109508968A (en) | Block catenary system and its control method | |
| CN107526775A (en) | A kind of method of block chain data filing | |
| CN105488722A (en) | Asset data processing method and device based on derivation chain | |
| CN108765151A (en) | A kind of method of commerce based on block chain | |
| CN109446266B (en) | Method for improving transaction efficiency and stability suitable for block chain network | |
| CN103034592B (en) | Data processing method and device | |
| CN111034119A (en) | Computer-implemented systems and methods associated with a binary blockchain including a pair of coupled blockchains | |
| CN105678546A (en) | Digital asset processing method based on distributed shared general ledger | |
| CN116235463A (en) | Convergence consensus method for distributed ledger transaction | |
| KR20190003134U (en) | System and method for generating permanent data records and assets for digital items in a networked video game system | |
| CN108701326A (en) | Interim common recognition network in resource transfers system | |
| CN109584071A (en) | Block chain processing method and electronic equipment | |
| CN109886676A (en) | Method of payment, calculating equipment, storage medium for block chain network | |
| CN113886135A (en) | Block chain data recovery method and device | |
| CN113553378A (en) | Block chain data deleting method and device | |
| Michelson et al. | Accumulate: An identity-based blockchain protocol with cross-chain support, human-readable addresses, and key management capabilities | |
| CN111031100A (en) | Extended block chain storage method, system and medium | |
| CN111611598A (en) | Block chain-based secure distributed cloud storage service implementation method, equipment and medium | |
| US11416933B2 (en) | Event management and validation platform using a recursive hierarchic blockchain |
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 | ||
| PP01 | Preservation of patent right | ||
| PP01 | Preservation of patent right |
Effective date of registration: 20220711 Granted publication date: 20210810 |