CN109714398A - Date storage method and device - Google Patents
Date storage method and device Download PDFInfo
- Publication number
- CN109714398A CN109714398A CN201811511532.6A CN201811511532A CN109714398A CN 109714398 A CN109714398 A CN 109714398A CN 201811511532 A CN201811511532 A CN 201811511532A CN 109714398 A CN109714398 A CN 109714398A
- Authority
- CN
- China
- Prior art keywords
- block
- node
- ttl parameter
- network node
- network
- 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
Abstract
This application provides date storage methods and device.In the application, network node both makes have block transmission, also block is not directly transmitted, but the first node list of block associations is first sent before sending block, when the response message for the response first node list for receiving the return of the first correspondent network node, and when the second TTL parameter satisfaction setting condition of response message carrying, block can just be sent, otherwise, the block head (namely hold in block body and do not send) of block is broadcasted in block chain network, realize in block chain network is not that all-network node all stores entire block in block chain, but a portion network node stores entire block in block chain, block head of the another part network node in block chain memory block, this will block on memory block chain compared to existing all-network node, greatly reduce node storage space, big data base is supported well In the application of block chain.
Description
Technical field
This application involves network communication technologies, in particular to method and apparatus.
Background technique
Block chain technology, also referred to as distributed account book technology is a kind of by several calculating equipment (also referred to as block chain networks
In network node, hereinafter referred to as network node) it is common participate in " book keeping operation ", a completely distributed data base of common maintenance
Emerging technology.
Since there is block chain technology decentralization, open and clear, network node can participate in data-base recording and each
It can be rapidly performed by the synchronous characteristic of data between network node, answered extensively so that block chain technology also has in field of storage
With.
But currently based in the storage of block chain application, each network node will store identical block, if number
Very big according to measuring, then the memory space that will lead to network node increases considerably.
Summary of the invention
This application provides date storage methods and device, and to realize, a portion network node is deposited in block chain networking
Storage area block, the block head of another part network node memory block, reduces the memory space requirements of network node.
The technical scheme provided by the application includes:
A kind of date storage method, this method are applied to the network node in block chain network, comprising:
The first node list with the block associations is first broadcasted in the block chain network before sending block, it is described
First node list includes the first life span TTL parameter, and the block includes at least the interior appearance of block head, block body；
Receive the response message for being used to respond the first node list of the first correspondent network node return, the response
Message carries the second TTL parameter, difference of second TTL parameter between first TTL parameter and the first setting value；
Check whether second TTL parameter meets setting condition, if it is, broadcasting institute in the block chain network
Block head is stated, if not, sending the block to the first correspondent network node.
A kind of data storage device, the device are applied to the network node in block chain network, comprising: control unit, hair
Send unit；
Described control unit is used for before the transmission unit sends block first broadcast and institute in the block chain network
The first node list of block associations is stated, the first node list includes the first life span TTL parameter, and the block is at least
Including holding in block head, block body；And receive that the first correspondent network node returns for responding the first node list
Response message, the response message carries the second TTL parameter, and second TTL parameter is first TTL parameter and first
Difference between setting value；And check whether second TTL parameter meets setting condition, if so, it is logical to send block head
Know to the transmission unit, notifies if not, sending block to the transmission unit；
The transmission unit, for when receive from described control unit block head notice when, in the block chain
The block head is broadcasted in network, when receiving the block notice from described control unit, the first correspondent network of Xiang Suoshu
Node sends the block.
As can be seen from the above technical solutions, in the application, network node both makes have block transmission, does not also directly transmit area
Block, but the first node list of block associations is first sent before sending block, it is returned when receiving the first correspondent network node
Response first node list response message and response message carry the second TTL parameter meet impose a condition when, Cai Huifa
Block is sent, otherwise, the block head (namely hold in block body and do not send) of block is broadcasted in block chain network.As can be seen that logical
It crosses and judges whether the second TTL parameter that the response message that the first correspondent network node returns carries meets to impose a condition determine it is hair
Block is sent, or sends the block head (namely hold in block body and do not send) of block, is realized in block chain network and not all
Network node all stores entire block in block chain, but a portion network node stores entire block (packet in block chain
Include in block head and block body and hold), for another part network node in the block head of block chain memory block, this compares existing institute
Have network node will block on memory block chain, greatly reduce node storage space, support big data well and be based on
The application of block chain.
Detailed description of the invention
The drawings herein are incorporated into the specification and forms part of this specification, and shows the implementation for meeting the disclosure
Example, and together with specification for explaining the principles of this disclosure.
Fig. 1 is method flow diagram provided by the present application；
Fig. 2 a is existing block structure schematic diagram；
Fig. 2 b is block structure schematic diagram provided by the present application；
Fig. 3 is that block provided by the present application storage updates schematic diagram；
Fig. 4 is embodiment schematic diagram provided by the present application；
Fig. 5 is apparatus structure schematic diagram provided by the present application；
Fig. 6 is the hardware structural diagram of Fig. 5 shown device provided by the present application.
Specific embodiment
In storage method provided by the present application based on block chain, the area on subnetwork node memory block chain is realized
Block greatly reduces node storage space, supports well compared to block chain all memory blocks of existing all-network node local
Application of the big data based on block chain.
To keep the application clearer, the application is described with reference to the accompanying drawings and examples:
Referring to Fig. 1, Fig. 1 is method flow diagram provided by the present application.This method is applied to the network section in block chain network
Point.Here network node refers to any network node in block chain network, and the application does not limit specifically.
Step 101, the first node with the block associations is first broadcasted in the block chain network before sending block
List, the first node list include the first life span (TTL:Time To Live) parameter.
It in this application, can be to the structure of block in order to realize the block on only subnetwork node memory block chain
It improves.
Compared to existing block structure shown in Fig. 2 a, block includes: block head, the interior appearance of block body, and the application is in Fig. 2 a institute
Node listing ID is increased in the existing block structure shown, it is specific as shown in Figure 2 b.It should be noted that the node shown in Fig. 2 b
The position of list ID is a kind of citing, can also specifically not limited in other positions, the application.
In this application, node listing ID is the value of similarity relation type database ID, immutable.Pass through node listing ID
Corresponding node listing can be inquired in relevant database.Based on this, the above-mentioned first node list with block associations are as follows:
The corresponding node listing of the node listing ID.
Step 102, the response message for being used to respond the first node list that the first correspondent network node returns is received,
The response message carries the second TTL parameter, and second TTL parameter is between first TTL parameter and the first setting value
Difference.
Here the first correspondent network node is not only a network node, can refer to and return to above-mentioned response message
All-network node.
Step 103, check whether the second TTL parameter meets setting condition, if it is, wide in the block chain network
The block head of the block is broadcast, if not, sending the block to the first correspondent network node.
It is also not straight by step 101 to step 103 as can be seen that in this application, network node both makes have block transmission
Block is received and sent, but first sends the first node list of block associations before sending block, when receiving the first correspondent network
The second TTL parameter that the response message and response message for the response first node list that node returns carry, which meets, to impose a condition
When, block can be just sent, otherwise, the block head (namely hold in block body and do not send) of block is broadcasted in block chain network.It can
To find out, whether setting item is met by the second TTL parameter for judging that the response message that the first correspondent network node returns carries
Part decision is the block head (namely hold in block body and do not send) for sending block, or sending block, realizes block chain network
In not all-network node all store entire block in block chain, but a portion network node stored in block chain it is whole
A block, for another part network node in the block head of block chain memory block, this will compared to existing all-network node
Block on memory block chain, greatly reduces node storage space, supports application of the big data based on block chain well.
In the above description, the first setting value, setting condition can be arranged according to the actual situation.
In this application, the block of any network node storage is renewable.Block is described below and updates flow chart.
Referring to Fig. 3, Fig. 3 is that block provided by the present application storage updates flow chart.The process is held after sending block
Row.As shown in figure 3, the process can comprise the following steps that
Step 301, the forward-path topology of block is collected.
In this step 301, the collection of forward-path topology is collected similar to existing topological structure, and the application not retouch by emphasis
It states.
Step 302, when detecting all first correspondent network nodes for returning to the response message in local block chain
When deleting the block, the next-hop of the first correspondent network node is determined according to the forward-path topology and under described
One jump sends a notification message.
In this application, network node can carry out heartbeat detection with the first correspondent network node, to determine the first opposite end net
Whether whether online, the first correspondent network node continues memory block etc. to network node.
Based on above-mentioned heartbeat detection, then this step 302 is readily possible to detect all first opposite ends net of returning response message
Whether network node deletes the block in block chain.
In this application, notification message is used to indicate any network node for receiving the notification message first in local lookup
To the third node listing with the block associations, then check that the 4th TTL parameter is set with described first in third node listing
Whether the difference of definite value meets setting condition, if not, the 4th TTL parameter is increased by first setting value, and along described turn
Hair path topology continues to send the notification message, if so, the 4th TTL parameter is increased into first setting value, and
The block is sent to the network node for sending the response message.
By process shown in Fig. 3, finally realizes when there is network node to delete block, increase new network node in time
Memory block, to guarantee that the backup quantity of block is met the requirements.
Below with the first setting value for 1, impose a condition to be flowed by a specific embodiment to shown in Fig. 1 for equal to 0
Journey is described:
Referring to fig. 4, Fig. 4 is embodiment application networking diagram provided by the present application.In Fig. 4, block chain network is by node 401
To node N, N number of node is connected with each other for composition altogether.
In fig. 4, it is assumed that 401 newly-generated blocks of node.The block is denoted as block 400.Block 400 includes block
Hold in head, block body, node listing ID (being denoted as ID100).
Node 401 creates a node listing (being denoted as table 1) corresponding with ID100.Including the IP of node 401 in table 1
Location, TTL parameter.Here TTL parameter is initial value.As one embodiment, in this application, initial value can be according to practical feelings
Condition setting.The present embodiment is by taking initial value is 16 as an example.
Node 401 first broadcasts table 1 before sending block 400 in block chain network.
If node 402, node 403, node 404 receive the table 1 of the broadcast of node 401.
TTL parameter in 402 computational chart 1 of node and 1 difference, check whether the difference is 0.As a result, it has been found that be not 0,
Then simultaneously record sheet 2 is locally generated according to table 1.Table 2 is different from table 1, and the TTL parameter in table 2 is above-mentioned difference, also wraps in table 2
It includes: the IP address of the node 401 recorded in the IP address of node 402, table 1.
Node 402 can carry the TTL parameter in table 2 to 401 returning response message of node, response message.
The operation that node 403, node 404 execute, finally also can be to 401 returning response message of node similar to node 402.
Node 401 receives the response message that node 402 returns respectively to node 404, judges the TTL that response message carries
Parameter is not 0, then increases the IP address of node 402 to node 404 newly in table 1, and send area to node 402 to node 404
Block 400.In one example, node 401 can send block 400 to node 402 to node 404 in the form of multicast.
Finish node 402 to node 404 can all receive block 400, by the block 400 received record to local block
Chain, and continue to forward block 400.By taking node 402 as an example:
Node 402 first broadcasts table 2 before sending block 400 in block chain network.
If node 405, node 406 receive the table 2 of the broadcast of node 402.
TTL parameter in 405 computational chart 2 of node and 1 difference, check whether the difference is 0.As a result, it has been found that be not 0,
Then simultaneously record sheet 5 is locally generated according to table 2.Table 5 is different from table 2, and the TTL parameter in table 5 is above-mentioned difference, also wraps in table 5
It includes: the IP address recorded in the IP address of node 405, table 2.
Node 405 can carry the TTL parameter in table 5 to 402 returning response message of node, response message.
The operation that node 406 executes, finally also can be to 402 returning response message of node similar to node 405.
The response message that node 402 receives node 405, node 406 returns respectively judges the TTL that response message carries
Parameter is not 0, then sends block 400 to node 405, node 406.In one example, node 402 can be in the form of multicast
Block 400 is sent to node 405, node 406.
And so on, if when node 340 receives the response message that node 331 returns respectively to node 336, judgement
The TTL parameter that response message carries is 0, then node 340 does not retransmit block 400, but sends the block head of block 400.It
Afterwards, the network node for receiving the block head of block 400 will continue to send the block head of block 400, and so on, in final the whole network
Some network node can be in block chain memory block 400, and being left a part of network node can be in block chain memory block 400
Block head.
In the present embodiment, as described above as can be seen that final, each network node for storing block 400 is local all
It will record one and the associated node listing of block 400.Wherein, each network node local record is associated with block 400
Node listing include: block 400 before reaching this node via the IP address of each network node, the IP address of this node,
The next-hop ip address of this node Forward Area block 400.
If Fig. 4 is described, each network node can be according to local record and the IP address in the associated node listing of block 400
Heartbeat detection is carried out between adjacent neighbors, according to heartbeat detection, is finally deposited in such a way that similar existing topological structure is collected
The each network node for having stored up block 400 can all collect the forward-path topology of block 400.
After the forward-path that each network node for storing block 400 collects block 400 is topological, once discovery is all
Next-hop network node all deletes block 400, then can send a notification message such as the description of above-mentioned steps 302.The work of notification message
With as described above, which is not described herein again.Finally, it is based on notification message, the network node that can be realized memory block 400 increases in time
Add, to meet the backup quantitative requirement of block 400.
So far, the description of embodiment is completed.
Method provided by the present application is described above, device provided by the present application is described below:
Referring to Fig. 5, Fig. 5 is structure drawing of device provided by the present application.The device is applied to the network section in block chain network
Point, comprising: control unit, transmission unit；
Described control unit is used for before the transmission unit sends block first broadcast and institute in the block chain network
The first node list of block associations is stated, the first node list includes the first life span TTL parameter, and the block is at least
Including holding in block head, block body；And receive that the first correspondent network node returns for responding the first node list
Response message, the response message carries the second TTL parameter, and second TTL parameter is first TTL parameter and first
Difference between setting value；And check whether second TTL parameter meets setting condition, if so, it is logical to send block head
Know to the transmission unit, notifies if not, sending block to the transmission unit；
The transmission unit, for when receive from described control unit block head notice when, in the block chain
The block head that the block is broadcasted in network, when receiving the block notice from described control unit, Xiang Suoshu first is right
Network node is held to send the block.
In one example, the block further comprises: node listing ID；
The first node list are as follows: the corresponding node listing of the node listing ID.
In one example, the block is generated by this node；
Described control unit is further locally creating the first node list, and first TTL parameter is preset
Initial value.
In one example, the block is that this node is received from the second correspondent network node direct-connected with this node
The block of transmission；
Described control unit further receives the second node list that the second correspondent network node is sent, according to described in
Second node list generate first node list, first TTL parameter be the second node list in third TTL parameter with
Difference between first setting value.
In one example, described device further comprises:
Collecting topology unit, for obtaining the forward-path topology of the block；
Updating unit detects all first correspondent network nodes for returning to the response message in local block for working as
When deleting the block in chain, the next-hop of the first correspondent network node is determined according to the forward-path topology and to institute
Next-hop is stated to send a notification message；
The notification message, which is used to indicate, to be received any network node of the notification message and first finds and institute locally
State the third node listing of block associations, then check in third node listing the 4th TTL parameter and first setting value it
Whether difference meets setting condition, if not, the 4th TTL parameter is increased by first setting value, and along the forward-path
Topology continues to send the notification message, if so, the 4th TTL parameter is increased by first setting value, and to transmission
The network node of the response message sends the block.
So far, structure drawing of device provided by the present application is completed.
Accordingly, the application also provides the hardware structure diagram of Fig. 5 shown device.As shown in fig. 6, the hardware configuration can wrap
It includes: machine readable storage medium and processor, in which:
Machine readable storage medium: store instruction code.
Processor: communicating with machine readable storage medium, reads and executees the instruction in the machine readable storage medium
Code realizes date storage method disclosed in disclosure above-mentioned example.
So far, the hardware structure diagram of Fig. 6 shown device is completed.
In this application, machine readable storage medium can be any electronics, magnetism, optics or other physical stores dress
It sets, may include or store information, such as executable instruction, data, etc..For example, machine readable storage medium may is that RAM
(Radom Access Memory, random access memory), volatile memory, nonvolatile memory, flash memory, storage driving
Device (such as hard disk drive), solid state hard disk, any kind of storage dish (such as CD, dvd) or similar storage medium,
Or their combination.
Device, module or the unit that above-described embodiment illustrates can specifically be realized, Huo Zheyou by computer chip or entity
Product with certain function is realized.A kind of typically to realize that equipment is computer, the concrete form of computer can be a
People's computer, laptop computer, cellular phone, camera phone, smart phone, personal digital assistant, media player, navigation
It is any several in equipment, E-mail receiver/send equipment, game console, tablet computer, wearable device or these equipment
The combination of kind equipment.
For convenience of description, it is divided into various units when description apparatus above with function to describe respectively.Certainly, implementing this
The function of each unit can be realized in the same or multiple software and or hardware when application.
It should be understood by those skilled in the art that, embodiments herein can provide as method or computer program product.
Therefore, complete hardware embodiment, complete software embodiment or embodiment combining software and hardware aspects can be used in the application
Form.Moreover, it wherein includes the computer of computer usable program code that the embodiment of the present application, which can be used in one or more,
The computer program implemented in usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) produces
The form of product.
The application is process of the reference according to method, apparatus (system) and computer program product of the embodiment of the present application
Figure and/or block diagram describe.It is generally understood that being realized by computer program instructions each in flowchart and/or the block diagram
The combination of process and/or box in process and/or box and flowchart and/or the block diagram.It can provide these computer journeys
Sequence instruct to general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices processor with
A machine is generated, so that the instruction generation executed by computer or the processor of other programmable data processing devices is used for
Realize the dress for the function of specifying in one or more flows of the flowchart and/or one or more blocks of the block diagram
It sets.
Moreover, these computer program instructions also can store be able to guide computer or other programmable datas processing set
In standby computer-readable memory operate in a specific manner, so that instruction stored in the computer readable memory generates
Manufacture including command device, the command device are realized in one process of flow chart or multiple processes and/or block diagram one
The function of being specified in a box or multiple boxes.
These computer program instructions can also be loaded into computer or other programmable data processing devices, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer
Or the instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram
The step of function of being specified in one box or multiple boxes.
The foregoing is merely the preferred embodiments of the application, not to limit the application, all essences in the application
Within mind and principle, any modification, equivalent substitution, improvement and etc. done be should be included within the scope of the application protection.
Claims (10)
1. a kind of date storage method, which is characterized in that this method is applied to the network node in block chain network, comprising:
First broadcasted in the block chain network before sending block with the first node lists of the block associations, described first
Node listing includes the first life span TTL parameter, and the block includes at least the interior appearance of block head, block body；
Receive the response message for being used to respond the first node list of the first correspondent network node return, the response message
Carry the second TTL parameter, difference of second TTL parameter between first TTL parameter and the first setting value；
Check whether second TTL parameter meets setting condition, if it is, broadcasting the area in the block chain network
Build, if not, sending the block to the first correspondent network node.
2. the method according to claim 1, wherein the block further comprises: node listing ID；
The first node list are as follows: the corresponding node listing of the node listing ID.
3. the method according to claim 1, wherein the block is generated by this node；
Further comprise before this method: locally creating the first node list, first TTL parameter is preset first
Initial value.
4. the method according to claim 1, wherein the block is that this node is received from straight with this node
The block that the second correspondent network node even is sent；
Further comprise before this method:
The second node list that the second correspondent network node is sent is received, generates first segment according to the second node list
Point list, first TTL parameter are the difference in the second node list between third TTL parameter and first setting value
Value.
5. the method according to claim 1, wherein this method further comprises:
Collect the forward-path topology of the block；
When detecting that all first correspondent network nodes for returning to the response message delete the block in local block chain
When, the next-hop of the first correspondent network node is determined according to the forward-path topology and sends notice to the next-hop
Message；
The notification message be used to indicate receive the notification message any network node first locally find and the area
Then the associated third node listing of block checks that the difference of the 4th TTL parameter and first setting value is in third node listing
No satisfaction imposes a condition, if not, the 4th TTL parameter is increased by first setting value, and along the forward-path topology
Continue to send the notification message, if so, the 4th TTL parameter is increased by first setting value, and to sending the sound
The network node of message is answered to send the block.
6. a kind of data storage device, which is characterized in that the device is applied to the network node in block chain network, comprising: control
Unit processed, transmission unit；
Described control unit, for first being broadcasted and the area in the block chain network before the transmission unit sends block
The associated first node list of block, the first node list include the first life span TTL parameter, and the block includes at least
Hold in block head, block body；And receive the sound for being used to respond the first node list that the first correspondent network node returns
Message is answered, the response message carries the second TTL parameter, and second TTL parameter is first TTL parameter and the first setting
Difference between value；And check whether second TTL parameter meets settings condition, if so, transmission block head notify to
The transmission unit notifies if not, sending block to the transmission unit；
The transmission unit, for when receive from described control unit block head notice when, in the block chain network
The middle broadcast block head, when receiving the block notice from described control unit, Xiang Suoshu the first correspondent network node
Send the block.
7. device according to claim 6, which is characterized in that the block further comprises: node listing ID；
The first node list are as follows: the corresponding node listing of the node listing ID.
8. device according to claim 6, which is characterized in that the block is generated by this node；
Described control unit is further locally creating the first node list, and first TTL parameter is preset initial
Value.
9. device according to claim 6, which is characterized in that the block is that this node is received from straight with this node
The block that the second correspondent network node even is sent；
Described control unit further receives the second node list that the second correspondent network node is sent, according to described second
Node listing generate first node list, first TTL parameter be the second node list in third TTL parameter with it is described
Difference between first setting value.
10. device according to claim 6, which is characterized in that described device further comprises:
Collecting topology unit, for obtaining the forward-path topology of the block；
Updating unit detects all first correspondent network nodes for returning to the response message in local block chain for working as
When deleting the block, the next-hop of the first correspondent network node is determined according to the forward-path topology and under described
One jump sends a notification message；
The notification message be used to indicate receive the notification message any network node first locally find and the area
Then the associated third node listing of block checks that the difference of the 4th TTL parameter and first setting value is in third node listing
No satisfaction imposes a condition, if not, the 4th TTL parameter is increased by first setting value, and along the forward-path topology
Continue to send the notification message, if so, the 4th TTL parameter is increased by first setting value, and to sending the sound
The network node of message is answered to send the block.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811511532.6A CN109714398B (en) | 2018-12-11 | 2018-12-11 | Data storage method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811511532.6A CN109714398B (en) | 2018-12-11 | 2018-12-11 | Data storage method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109714398A true CN109714398A (en) | 2019-05-03 |
| CN109714398B CN109714398B (en) | 2021-09-21 |
Family
ID=66256325
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811511532.6A Active CN109714398B (en) | 2018-12-11 | 2018-12-11 | Data storage method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109714398B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111711567A (en) * | 2020-06-12 | 2020-09-25 | 杭州溪塔科技有限公司 | Block chain-based network message transmission method and device and electronic equipment |
| CN113296707A (en) * | 2021-05-31 | 2021-08-24 | 尧领有限公司 | Disk storage method and system, block chain node and computer readable storage medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106506638A (en) * | 2016-11-04 | 2017-03-15 | 江苏通付盾科技有限公司 | Block storage method and device in block chain |
| EP3163446A1 (en) * | 2014-06-26 | 2017-05-03 | Hangzhou Hikvision System Technology Co., Ltd. | Data storage method and data storage management server |
| CN107317672A (en) * | 2017-05-10 | 2017-11-03 | 广东网金控股股份有限公司 | A kind of light weight terminating machine block catenary system |
| CN107360156A (en) * | 2017-07-10 | 2017-11-17 | 广东工业大学 | P2P network method for cloud storage based on block chain under a kind of big data environment |
| CN107992492A (en) * | 2016-10-26 | 2018-05-04 | 中国移动通信有限公司研究院 | A kind of storage method of data block, read method, its device and block chain |
| CN108270836A (en) * | 2017-01-03 | 2018-07-10 | 华为技术有限公司 | Data processing method, equipment and system based on block chain |
| CN108777710A (en) * | 2018-05-31 | 2018-11-09 | 中国联合网络通信集团有限公司 | Block chain communication method between nodes, device and block chain node |
| CN108810119A (en) * | 2018-05-31 | 2018-11-13 | 中国联合网络通信集团有限公司 | block chain processing method, device and block chain node |
| CN108924252A (en) * | 2018-07-31 | 2018-11-30 | 泰链（厦门）科技有限公司 | Mitigate method, medium and the block catenary system of node storage load in block catenary system |
| WO2018222927A1 (en) * | 2017-05-31 | 2018-12-06 | Alibaba Group Holding Limited | Blockchain data processing method and apparatus |
-
2018
- 2018-12-11 CN CN201811511532.6A patent/CN109714398B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3163446A1 (en) * | 2014-06-26 | 2017-05-03 | Hangzhou Hikvision System Technology Co., Ltd. | Data storage method and data storage management server |
| CN107992492A (en) * | 2016-10-26 | 2018-05-04 | 中国移动通信有限公司研究院 | A kind of storage method of data block, read method, its device and block chain |
| CN106506638A (en) * | 2016-11-04 | 2017-03-15 | 江苏通付盾科技有限公司 | Block storage method and device in block chain |
| CN108270836A (en) * | 2017-01-03 | 2018-07-10 | 华为技术有限公司 | Data processing method, equipment and system based on block chain |
| CN107317672A (en) * | 2017-05-10 | 2017-11-03 | 广东网金控股股份有限公司 | A kind of light weight terminating machine block catenary system |
| WO2018222927A1 (en) * | 2017-05-31 | 2018-12-06 | Alibaba Group Holding Limited | Blockchain data processing method and apparatus |
| CN107360156A (en) * | 2017-07-10 | 2017-11-17 | 广东工业大学 | P2P network method for cloud storage based on block chain under a kind of big data environment |
| CN108777710A (en) * | 2018-05-31 | 2018-11-09 | 中国联合网络通信集团有限公司 | Block chain communication method between nodes, device and block chain node |
| CN108810119A (en) * | 2018-05-31 | 2018-11-13 | 中国联合网络通信集团有限公司 | block chain processing method, device and block chain node |
| CN108924252A (en) * | 2018-07-31 | 2018-11-30 | 泰链（厦门）科技有限公司 | Mitigate method, medium and the block catenary system of node storage load in block catenary system |
Non-Patent Citations (2)
| Title |
|---|
| WILLIAM POURMAJIDI等: ""Logchain: Blockchain-Assisted Log Storage"", 《2018 IEEE 11TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING (CLOUD)》 * |
| 费禹等: ""基于区块链的日志存储系统"", 《网络空间安全》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111711567A (en) * | 2020-06-12 | 2020-09-25 | 杭州溪塔科技有限公司 | Block chain-based network message transmission method and device and electronic equipment |
| CN113296707A (en) * | 2021-05-31 | 2021-08-24 | 尧领有限公司 | Disk storage method and system, block chain node and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109714398B (en) | 2021-09-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1768332B1 (en) | Hierarchical mobile ad-hoc network and methods for performing reactive routing therein | |
| EP1500287B1 (en) | Wireless ad-hoc network and method for performing reactive routing therein | |
| CA2484489C (en) | Reactive routing on-demand in mobile network | |
| EP1500291A2 (en) | Hierarchical mobile ad-hoc network and methods for route error recovery therein | |
| CN108092899A (en) | Routing policy update method based on name data network under MANET environment | |
| CN109714398A (en) | Date storage method and device | |
| CN106814972A (en) | The rollback method and device of the snapshot node of distributed block storage | |
| CN107852367A (en) | Path in mesh network is established | |
| CN106161233A (en) | A kind of message forwarding method and device | |
| CN110311828B (en) | Network verification method and device, computer storage medium and electronic equipment | |
| CN106034289A (en) | Forwarding control method in D2D multicast communication | |
| CN108259340B (en) | Topology information transmission method and device | |
| CN109873764A (en) | Establish method, apparatus, the electronic equipment of orientation ospf neighbor relationship | |
| CN115280745B (en) | Stream following detection method and electronic equipment | |
| CN106712995B (en) | A kind of acquisition methods and device of multi-hop neighbor node | |
| CN111641969B (en) | Wireless multi-hop ad hoc network data distribution method and device based on edge calculation | |
| US9621401B1 (en) | Performing dynamic data analysis within a dynamic network | |
| CN113608856A (en) | Node scheduling method, system and device | |
| CN108809916B (en) | Service processing method and device | |
| CN103518402B (en) | Signal processing method, device and system | |
| CN108833273B (en) | Main/standby switching and electing method, router and medium in VRRP backup group | |
| CN111383125A (en) | Community division method, system, terminal device and storage medium | |
| CN105656789B (en) | A kind of MAC Address notifying method and core node | |
| CN106453080B (en) | Tracing method and device for link state clearing message | |
| WO2013145253A1 (en) | Communication method, node device, and communication program |
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 |