CN111858771A - Distributed data storage method, device and storage medium - Google Patents
Distributed data storage method, device and storage medium Download PDFInfo
- Publication number
- CN111858771A CN111858771A CN202010748217.6A CN202010748217A CN111858771A CN 111858771 A CN111858771 A CN 111858771A CN 202010748217 A CN202010748217 A CN 202010748217A CN 111858771 A CN111858771 A CN 111858771A
- Authority
- CN
- China
- Prior art keywords
- data
- blockchain
- fragment
- nodes
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- 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/23—Updating
Abstract
The invention provides a distributed data storage method, equipment and a storage medium, which relate to the technical field of block chains and the like, and the method comprises the following steps: generating a first data set according to a first number of continuous blocks to be stored; determining a first blockchain fragment to be stored with a first data set according to a preconfigured logical distance calculation rule; the first data set is sent to a number of nodes in the first blockchain fragment for storage of the first data set. The application reduces bandwidth consumption in blockchain networks.
Description
Technical Field
The present application relates to the field of block chaining technologies, and in particular, to a distributed data storage method, device, and storage medium.
Background
In the existing distributed data storage technology in the field of block chains, at intervals, a node storing a first data set needs to broadcast the first data set to a plurality of nodes with smaller logical distances to ensure dynamic balance, that is, it is ensured that a plurality of nodes always store first archived data in a block chain network.
The above mechanism takes up a lot of bandwidth in the blockchain network due to the large first data set.
Disclosure of Invention
In view of the above-identified deficiencies or inadequacies in the prior art, it would be desirable to provide a distributed data storage method, apparatus, and storage medium that reduces bandwidth consumption by a blockchain network.
In a first aspect, the present invention provides a distributed data storage method suitable for a blockchain, where the method includes:
generating a first data set according to a first number of continuous blocks to be stored;
determining a first blockchain fragment to receive a first data set according to a preconfigured logical distance calculation rule;
the first data set is sent to a number of nodes in the first blockchain fragment for storage of the first data set.
In a second aspect, the present invention also provides an apparatus comprising one or more processors and a memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform a distributed data storage method provided according to embodiments of the present invention.
In a third aspect, the present invention also provides a storage medium storing a computer program that causes a computer to execute the distributed data storage method provided according to the embodiments of the present invention.
In the distributed data storage method, the distributed data storage device and the distributed data storage medium provided by the embodiments of the invention, the first data set is generated according to the first number of continuous blocks to be stored; determining a first blockchain fragment to be stored with a first data set according to a preconfigured logical distance calculation rule; a method of sending a first data set to a number of nodes in a first blockchain fragment for storage of the first data set reduces bandwidth consumption by blockchain networks.
The distributed data storage method, device, and storage medium provided in some embodiments of the present invention further divide the located blockchain segment into a plurality of new blockchain segments according to a preconfigured blockchain segment adjustment rule when a ratio of a total number of nodes of the located blockchain segment to an average number of total numbers of nodes of each blockchain segment in the blockchain network exceeds a first value, and update the blockchain segment where the current node is located; the following operations are performed on each of the archived data stored: generating second data from the second archived data; and determining a second node with the minimum logical distance to the second data according to the logical distance calculation rule, and judging whether the second node is a node in the block chain fragment in which the second node is located: and if not, the second archived data is deleted, and when the number of the nodes of the block chain fragments is excessive, the number of the block chain fragments in the block chain network is adjusted, so that the archived data can be uniformly and distributively stored.
In some embodiments of the present invention, the distributed data storage method, the device, and the storage medium further fuse the located blockchain segment with the first blockchain segment according to a preconfigured blockchain segment adjustment rule when a ratio of a total number of nodes of the located blockchain segment to an average number of total numbers of nodes of each blockchain segment in the blockchain network is lower than a second value, and update the blockchain segment where the current node is located; the following operations are performed on each of the archived data stored: generating third data according to the third filing data, and generating a second data set according to the third data and the third filing data; and when the number of the nodes of the block chain fragment is too small, the number of the block chain fragments in the block chain network is adjusted, so that the archived data can be uniformly and distributively stored.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a flowchart of a distributed data storage method according to an embodiment of the present invention.
FIG. 2 is a flow diagram of a preferred embodiment of the method shown in FIG. 1.
FIG. 3 is a flow diagram of another preferred embodiment of the method shown in FIG. 1.
Fig. 4 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 is a flowchart of a distributed data storage method according to an embodiment of the present invention. As shown in fig. 1, in this embodiment, the present invention provides a distributed data storage method suitable for a blockchain, where the method includes:
s11: generating a first data set according to a first number of continuous blocks to be stored;
s12: determining a first blockchain fragment to be stored with a first data set according to a preconfigured logical distance calculation rule;
s13: the first data set is sent to a number of nodes in the first blockchain fragment for storage of the first data set.
Specifically, reference to S11 includes "generating first data and first archive data from a first number of consecutive chunks to be stored, and generates a first data set from the first data, the first archived data S12 includes "determine a first node having a smallest logical distance from the first data according to a preconfigured logical distance calculation rule, determine a blockchain slice in which the first node is located as a first blockchain slice that is to store the first data set", S13 includes "send the first data set to a number of nodes of the first blockchain slice", taking the case that the first archived data is stored according to the first data set, the logical distance calculation rule is that the first data is subjected to xor with the node IDs of the nodes to calculate the logical distance, and the sending of the first data set to the plurality of nodes of the first blockchain fragment includes "sending the first data set to each node of the first blockchain fragment"; assuming that a first number of continuous blocks to be stored are blocks (1) to (1000), a block chain network has 10 slices, each slice has 10 nodes, the nodes in the block chain slice 1 are N1 to N10, the nodes in the block chain slice 2 are N11 to N20 … …, and the nodes in the block chain slice 10 are N91 to N100;
the node executes step S11, generates chunkhash and archive data according to block (1) to block (1000) (assuming that the archive data is also block (1) to block (1000)), and generates a data set { chunkhash, block (1) to block (1000) }accordingto chunkhash, block (1) to block (1000);
the node executes step S12, and calculates a logical distance by xoring the chunkhash with the node ID of the node, determines the node (assumed to be N91) having the smallest logical distance from the chunkhash, and determines the block chain segment where N91 is located, that is, the block chain segment 10, as the block chain segment to be received { chunkhash, block (1) -block (1000) };
the node executes step S13, and sends { chunkhash, block (1) -block (1000) } to each node of the block chain fragment 10, i.e., N91-N100;
n91 to N100 store block (1) to block (1000) from { chunkhash, block (1) to block (1000) }.
The foregoing embodiments exemplify the principle that S11 includes "generating first data and first archive data according to a first number of contiguous tiles to be stored, and generating a first data set according to the first data and the first archive data", S12 includes "determining a first node having a smallest logical distance from the first data according to a preconfigured logical distance calculation rule, determining a blockchain fragment in which the first node is located as a first blockchain fragment in which the first data set is to be stored", S13 includes "sending the first data set to nodes of the first blockchain fragment for storing the first archive data according to the first data set", the logical distance calculation rule is to xor the first data with node IDs of the nodes to calculate logical distances, and sending the first data set to the nodes of the first blockchain fragment includes "sending the first data set to nodes of the first blockchain fragment" Are set forth.
In further embodiments, the logical distance calculation rule may also be configured according to actual requirements, for example, the logical distance calculation rule may be configured to perform an exclusive or operation on the first data and a hash value of the node ID of the node to calculate the logical distance, and the same technical effect may be achieved.
In further embodiments, the plurality of nodes that send the first data set to the first blockchain fragment may also be configured according to actual requirements, for example, configured to send the first data set to 5 nodes in the first blockchain fragment in an order from a smaller logical distance to a larger logical distance, so that the same technical effect may be achieved.
In further embodiments, S11 may also be configured according to actual requirements, for example, configured to generate the first data and the first compressible data that can be decompressed according to the first number of consecutive blocks to be stored, and generate the first data set according to the first data and the first compressible data that can be decompressed, where the first compressible data is obtained by compressing the first archive number, and the same technical effect may be achieved. Accordingly, S13 is configured to send the first set of data to the nodes of the first blockchain fragment for storing the first compressed data according to the first set of data.
In further embodiments, the method of the above embodiments may be configured to allocate a trigger condition according to an actual requirement, for example, configured to execute the method of the above embodiments by the node generating the first block with the first block height when the block height increases to the first block height, where the first block height is a sum of a block with a largest block height and a safe rollback depth in the first number of consecutive blocks to be stored.
It should be noted that each block link point is stored in a block chain module from block (1) to block (1000) at the beginning, and after implementing the method described in the above embodiment, N91 to N100 store archive data block (1) to block (1000) in a local P2P module. After a period of time, deleting block (1) -block (1000) by the block chain modules of all nodes in the block chain; at this time, archive data blocks (1) to block (1000) are stored in a distributed manner only in N91 to N100.
The above embodiments reduce bandwidth consumption by the blockchain network.
Preferably, generating the first set of data from the first number of consecutive blocks to be stored comprises:
generating first data and first archival data according to a first number of continuous blocks to be stored, and generating a first data set according to the first data and the first archival data;
determining, according to a preconfigured logical distance calculation rule, that a first blockchain slice of a first set of data is to be received comprises:
determining a first node with the minimum logical distance to first data according to a preconfigured logical distance calculation rule, and determining a blockchain fragment where the first node is located as a first blockchain fragment to be received by a first data set;
sending the first set of data to a number of nodes in the first blockchain fragment for storage of the first set of data includes:
the first data set is sent to a number of nodes of the first blockchain fragment for storing first archived data according to the first data set.
The distributed data storage principle of the above embodiment can refer to the method shown in fig. 1, and is not described herein again.
Preferably, the logical distance calculation rule is to xor the first data with the node ID of the node to calculate the logical distance.
The distributed data storage principle of the above embodiment can refer to the method shown in fig. 1, and is not described herein again.
FIG. 2 is a flow diagram of a preferred embodiment of the method shown in FIG. 1. As shown in fig. 2, in a preferred embodiment, the method further comprises:
s14: when the ratio of the total number of nodes of the block chain fragment to the average number of nodes of each block chain fragment in the block chain network exceeds a first value, dividing the block chain fragment into a plurality of new block chain fragments according to a pre-configured block chain fragment adjustment rule, and updating the block chain fragment in which the current node is positioned;
s15: the following operations are performed on each of the archived data stored:
generating second data from the second archived data;
determining a second node with the minimum logical distance to second data according to a logical distance calculation rule, and judging whether the second node is a node in the block chain fragment in which the second node is located:
and if not, deleting the second archived data.
Specifically, assuming that the first value is 1.35, the pre-configured adjustment rule for the blockchain fragment is to reserve the original node in the original blockchain fragment and divide other nodes into a new blockchain fragment; nodes in other blockchain fragments are unchanged, the nodes in the blockchain fragment 10 are N91-N103, and now N104 and N105 are also added into the blockchain fragment 10 in sequence;
adding N104 into the blockchain fragment 10, and executing the step S14 by N91-N104, wherein the total number of nodes of the blockchain fragment 10 is 14, the average number of the total number of nodes of each blockchain fragment in the blockchain network is 10.4, and the ratio is 1.346 and is not more than 1.35;
n105 adds blockchain fragments 10, and N91 to N105 execute step S14, where the total number of nodes of the blockchain fragment 10 is 15, the average number of nodes of each blockchain fragment in the blockchain network is 10.5, and the above ratio is 1.429 and greater than 1.35, then N91 to N100 are left in the blockchain fragment 10, and create blockchain fragments 11, and divide N101 to N105 into blockchain fragments 11.
N91-N105 execute step S15, and execute the following operations for each stored archive data:
taking archive data as block (1) to block (1000) as an example, generating a chunkhash by N91 to N105 according to block (1) to block (1000);
determining a node with the minimum logical distance to the chunkhash according to a logical distance calculation rule, wherein the node is N91, and judging whether N91 is the node in the block chain fragment:
since N91 is not in the block chain partition 11, N101 to N105 delete block (1) to block (1000).
In further embodiments, the first value may also be configured according to actual requirements, for example, configured to be 1.7, and the same technical effect may be achieved.
In more embodiments, the preconfigured blockchain segment adjustment rule may also be configured according to actual requirements, for example, the configuration is that a node of roundup (M/2) is left in the original blockchain segment, and other nodes are divided into a new blockchain segment, where roundup is an upward rounding function, and M is the total number of nodes of the blockchain segment where the roundup is located, so that the same technical effect can be achieved.
In the above embodiment, when the number of the nodes of the block chain fragment where the block chain fragment is located is too large, the number of the block chain fragments in the block chain network is adjusted, so that each archived data can be uniformly and distributively stored.
FIG. 3 is a flow diagram of another preferred embodiment of the method shown in FIG. 1. As shown in fig. 3, in a preferred embodiment, the method further includes:
s16: when the ratio of the total number of the nodes of the located blockchain fragment to the average number of the nodes of each blockchain fragment in the blockchain network is lower than a second value, fusing the located blockchain fragment with the first blockchain fragment according to a pre-configured blockchain fragment adjustment rule, and updating the blockchain fragment where the current node is located;
s17: the following operations are performed on each of the archived data stored:
generating third data according to the third filing data, and generating a second data set according to the third data and the third filing data;
and sending the second data set to a plurality of nodes of the block chain fragment where the second data set is located so as to store third filing data according to the second data set when the third filing data is not locally stored.
Specifically, assuming that the second value is 0.5, the pre-configured adjustment rule for the blockchain fragment is to fuse the fragment where the second value is located with the previous fragment; the nodes in other blockchain fragments are unchanged, the nodes in blockchain fragment 10 are N91-N96, and now N96 and N95 also leave blockchain fragment 10 in sequence;
n96 leaves the blockchain fragment 10, and N91-N95 execute step S16, where the total number of nodes of the blockchain fragment 10 is 5, the average number of nodes of each blockchain fragment in the blockchain network is 9.5, and the above ratio is 0.526 and is not lower than 0.5;
n95 leaves the blockchain fragment 10, and N91 to N94 execute step S16, where the total number of nodes of the blockchain fragment 10 is 4, the average number of nodes of each blockchain fragment in the blockchain network is 9.4, and the above ratio is 0.426 and lower than 0.5, and the blockchain fragments are merged with the blockchain fragment 9, and the blockchain fragment in which the current node is located is updated to be the blockchain fragment 9;
N81-N94 execute step S17, and execute the following operations for each stored archive data:
taking archival data as block (1) to block (1000) as an example, generating chunkhash by N91 to N94 according to block (1) to block (1000), and generating a data set { chunkhash, block (1) to block (1000) }accordingto chunkhash and block (1) to block (1000);
and N91-N94 sends { chunkhash, block (1) -block (1000) } to a plurality of nodes of the block chain fragment where the block chain fragment is located so that when block (1) -block (1000) is not stored locally, block (1) -block (1000) are stored according to { chunkhash, block (1) -block (1000) }.
In further embodiments, the second value may also be configured according to actual requirements, for example, configured to be 0.6, and the same technical effect may be achieved.
In more embodiments, the pre-configured adjustment rule for the blockchain fragment may also be configured according to actual requirements, for example, the pre-configured adjustment rule is configured to merge the blockchain fragment where the blockchain fragment is located with the blockchain fragment with the second smallest number of nodes in the blockchain network, so that the same technical effect can be achieved.
In the above embodiment, when the number of the nodes of the located blockchain fragment is too small, the number of blockchain fragments in the blockchain network is adjusted, so that each archived data can be uniformly and distributively stored.
It should be noted that the above embodiments may be combined with each other.
Fig. 4 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 4, as another aspect, the present application also provides an apparatus 400 including one or more Central Processing Units (CPUs) 401 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)402 or a program loaded from a storage section 408 into a Random Access Memory (RAM) 403. In the RAM403, various programs and data necessary for the operation of the device 400 are also stored. The CPU401, ROM402, and RAM403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
The following components are connected to the I/O interface 405: an input section 406 including a keyboard, a mouse, and the like; an output section 407 including a display device such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 408 including a hard disk and the like; and a communication section 409 including a network interface card such as a LAN card, a modem, or the like. The communication section 409 performs communication processing via a network such as the internet. A driver 410 is also connected to the I/O interface 405 as needed. A removable medium 411 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 410 as necessary, so that a computer program read out therefrom is mounted into the storage section 408 as necessary.
In particular, according to an embodiment of the present disclosure, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing any of the methods described above. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 409, and/or installed from the removable medium 411.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present application.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, for example, each of the described units may be a software program provided in a computer or a mobile intelligent device, or may be a separately configured hardware device. Wherein the designation of a unit or module does not in some way constitute a limitation of the unit or module itself.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the present application. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (7)
1. A distributed data storage method adapted for use with blockchain nodes, the method comprising:
generating a first data set according to a first number of continuous blocks to be stored;
determining a first blockchain fragment to receive the first data set according to a preconfigured logical distance calculation rule;
sending the first data set to a number of nodes in the first blockchain fragment for storage of the first data set.
2. The method of claim 1, wherein generating the first set of data from the first number of consecutive blocks to be stored comprises:
generating first data and first archival data according to a first number of continuous blocks to be stored, and generating a first data set according to the first data and the first archival data;
the determining, according to preconfigured logical distance computation rules, that a first blockchain slice of the first set of data is to be received comprises:
determining a first node with the minimum logical distance to the first data according to a pre-configured logical distance calculation rule, and determining a blockchain fragment where the first node is located as a first blockchain fragment to receive the first data set;
the sending the first set of data to a number of nodes in the first blockchain slice for storing the first set of data comprises:
sending the first set of data to a number of nodes of the first blockchain fragment for storing the first archived data according to the first set of data.
3. The method of claim 2, wherein the logical distance calculation rule is to xor the first data with a node ID of a node to calculate a logical distance.
4. The method of claim 2 or 3, further comprising:
when the ratio of the total number of nodes of the block chain fragment to the average number of nodes of each block chain fragment in the block chain network exceeds a first value, dividing the block chain fragment into a plurality of new block chain fragments according to a pre-configured block chain fragment adjustment rule, and updating the block chain fragment in which the current node is positioned;
the following operations are performed on each of the archived data stored:
generating second data from the second archived data;
determining a second node with the minimum logical distance to the second data according to the logical distance calculation rule, and judging whether the second node is a node in the block chain fragment:
and if not, deleting the second archived data.
5. The method of claim 2 or 3, further comprising:
when the ratio of the total number of the nodes of the located blockchain fragment to the average number of the nodes of each blockchain fragment in the blockchain network is lower than a second value, fusing the located blockchain fragment with the first blockchain fragment according to a pre-configured blockchain fragment adjustment rule, and updating the blockchain fragment where the current node is located;
the following operations are performed on each of the archived data stored:
generating third data according to third filing data, and generating a second data set according to the third data and the third filing data;
and sending the second data set to a plurality of nodes of the block chain fragment where the second data set is located so as to store the third filing data according to the second data set when the third filing data is not locally stored.
6. An apparatus, characterized in that the apparatus comprises:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-5.
7. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010748217.6A CN111858771A (en) | 2020-07-30 | 2020-07-30 | Distributed data storage method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010748217.6A CN111858771A (en) | 2020-07-30 | 2020-07-30 | Distributed data storage method, device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111858771A true CN111858771A (en) | 2020-10-30 |
Family
ID=72946171
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010748217.6A Pending CN111858771A (en) | 2020-07-30 | 2020-07-30 | Distributed data storage method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111858771A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112417054A (en) * | 2020-12-09 | 2021-02-26 | 杭州复杂美科技有限公司 | Distributed data storage method, data query method, device and storage medium |
| CN113312005A (en) * | 2021-06-22 | 2021-08-27 | 青岛理工大学 | Block chain-based Internet of things data capacity expansion storage method and system and computing equipment |
| CN114928622A (en) * | 2022-05-07 | 2022-08-19 | 杭州复杂美科技有限公司 | Multi-subnet blockchain network, data storage method and device thereof, and storage medium |
Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160085839A1 (en) * | 2014-09-18 | 2016-03-24 | HGST Netherlands B.V. | Computer Implemented Method for Dynamic Sharding |
| CN107423426A (en) * | 2017-08-02 | 2017-12-01 | 众安信息技术服务有限公司 | A kind of data archiving method and electronic equipment of block chain block number evidence |
| CN108648084A (en) * | 2018-05-18 | 2018-10-12 | 百度在线网络技术（北京）有限公司 | A kind of data processing method, device, equipment and the storage medium of block chain network |
| CN109086139A (en) * | 2018-08-15 | 2018-12-25 | 昧来网络科技（上海）有限公司 | Dynamic Program Slicing method, equipment and computer storage medium |
| CN109150972A (en) * | 2018-07-17 | 2019-01-04 | 湖南宸瀚信息科技有限责任公司 | A kind of the common recognition mechanism and its working method of the efficient block chain of bilayer fragment |
| CN109377225A (en) * | 2018-10-30 | 2019-02-22 | 杭州复杂美科技有限公司 | Transaction allocation method, common recognition method, equipment and storage medium |
| CN109658074A (en) * | 2018-08-09 | 2019-04-19 | 杭州复杂美科技有限公司 | A kind of storage of data and read system and method, equipment and storage medium |
| CN109871366A (en) * | 2019-01-17 | 2019-06-11 | 华东师范大学 | A kind of storage of block chain fragment and querying method based on correcting and eleting codes |
| CN110392094A (en) * | 2019-06-03 | 2019-10-29 | 网宿科技股份有限公司 | A kind of method and fusion CDN system of acquisition business datum |
| CN110737658A (en) * | 2019-09-06 | 2020-01-31 | 平安国际智慧城市科技股份有限公司 | Data fragment storage method, device, terminal and readable storage medium |
| CN110753026A (en) * | 2019-02-27 | 2020-02-04 | 北京嘀嘀无限科技发展有限公司 | Block chain-based fragmentation method and device |
| CN110808838A (en) * | 2019-10-24 | 2020-02-18 | 华东师范大学 | Alliance chain-oriented fragmentation method |
| US20200076918A1 (en) * | 2018-09-05 | 2020-03-05 | Moac Blockchain Tech Inc | Apparatus and Method for Flexible Access Control and Resource Control in a Decentralized System |
| CN110958303A (en) * | 2019-11-14 | 2020-04-03 | 杭州复杂美科技有限公司 | Block storage and query method, equipment and storage medium |
| JP2020095701A (en) * | 2018-12-14 | 2020-06-18 | 三星電子株式会社Ｓａｍｓｕｎｇ Ｅｌｅｃｔｒｏｎｉｃｓ Ｃｏ．，Ｌｔｄ． | Apparatus and system for optimal dynamic shard creation in storage |
-
2020
- 2020-07-30 CN CN202010748217.6A patent/CN111858771A/en active Pending
Patent Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160085839A1 (en) * | 2014-09-18 | 2016-03-24 | HGST Netherlands B.V. | Computer Implemented Method for Dynamic Sharding |
| CN107423426A (en) * | 2017-08-02 | 2017-12-01 | 众安信息技术服务有限公司 | A kind of data archiving method and electronic equipment of block chain block number evidence |
| CN108648084A (en) * | 2018-05-18 | 2018-10-12 | 百度在线网络技术（北京）有限公司 | A kind of data processing method, device, equipment and the storage medium of block chain network |
| CN109150972A (en) * | 2018-07-17 | 2019-01-04 | 湖南宸瀚信息科技有限责任公司 | A kind of the common recognition mechanism and its working method of the efficient block chain of bilayer fragment |
| CN109658074A (en) * | 2018-08-09 | 2019-04-19 | 杭州复杂美科技有限公司 | A kind of storage of data and read system and method, equipment and storage medium |
| CN109086139A (en) * | 2018-08-15 | 2018-12-25 | 昧来网络科技（上海）有限公司 | Dynamic Program Slicing method, equipment and computer storage medium |
| US20200076918A1 (en) * | 2018-09-05 | 2020-03-05 | Moac Blockchain Tech Inc | Apparatus and Method for Flexible Access Control and Resource Control in a Decentralized System |
| CN109377225A (en) * | 2018-10-30 | 2019-02-22 | 杭州复杂美科技有限公司 | Transaction allocation method, common recognition method, equipment and storage medium |
| JP2020095701A (en) * | 2018-12-14 | 2020-06-18 | 三星電子株式会社Ｓａｍｓｕｎｇ Ｅｌｅｃｔｒｏｎｉｃｓ Ｃｏ．，Ｌｔｄ． | Apparatus and system for optimal dynamic shard creation in storage |
| CN109871366A (en) * | 2019-01-17 | 2019-06-11 | 华东师范大学 | A kind of storage of block chain fragment and querying method based on correcting and eleting codes |
| CN110753026A (en) * | 2019-02-27 | 2020-02-04 | 北京嘀嘀无限科技发展有限公司 | Block chain-based fragmentation method and device |
| CN110392094A (en) * | 2019-06-03 | 2019-10-29 | 网宿科技股份有限公司 | A kind of method and fusion CDN system of acquisition business datum |
| CN110737658A (en) * | 2019-09-06 | 2020-01-31 | 平安国际智慧城市科技股份有限公司 | Data fragment storage method, device, terminal and readable storage medium |
| CN110808838A (en) * | 2019-10-24 | 2020-02-18 | 华东师范大学 | Alliance chain-oriented fragmentation method |
| CN110958303A (en) * | 2019-11-14 | 2020-04-03 | 杭州复杂美科技有限公司 | Block storage and query method, equipment and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| 江云超;何小卫;崔一举;: "区块链节点存储优化方案", 应用科学学报, no. 01 * |
| 王军;陈羽;田?;赵子君;: "基于数据分片的WSN安全数据融合方案优化", 沈阳化工大学学报, no. 02 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112417054A (en) * | 2020-12-09 | 2021-02-26 | 杭州复杂美科技有限公司 | Distributed data storage method, data query method, device and storage medium |
| CN112417054B (en) * | 2020-12-09 | 2024-03-05 | 北京万古科技股份有限公司 | Distributed data storage method, data query method, device and storage medium |
| CN113312005A (en) * | 2021-06-22 | 2021-08-27 | 青岛理工大学 | Block chain-based Internet of things data capacity expansion storage method and system and computing equipment |
| CN114928622A (en) * | 2022-05-07 | 2022-08-19 | 杭州复杂美科技有限公司 | Multi-subnet blockchain network, data storage method and device thereof, and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111858771A (en) | Distributed data storage method, device and storage medium | |
| CN112364209B (en) | Distributed data storage method, data query method, device and storage medium | |
| CN109377232B (en) | DAG-based block chain transaction sequencing method and device | |
| CN109391645B (en) | Block chain lightweight processing method, block chain node and storage medium | |
| CN110599169B (en) | Data processing method, device, terminal and medium | |
| CN111611319A (en) | Distributed data storage method, device and storage medium | |
| CN110083745B (en) | Data query method, device and storage medium | |
| CN111798316A (en) | Parallel chain consensus method, device and storage medium | |
| CN111008249A (en) | Parallel chain block synchronization method, device and storage medium | |
| CN112055067B (en) | Node connection method, device and storage medium | |
| CN110322350B (en) | Method, device, equipment and storage medium for cutting hollow block in consensus network | |
| CN112182029B (en) | Data query method, device and storage medium | |
| CN110516006B (en) | Parallel chain block generation method, device and storage medium | |
| US10863005B2 (en) | Data transmitting program, data transmitting device, and data transmitting method | |
| CN111405037A (en) | Block synchronization method, device and storage medium | |
| CN114172998B (en) | File transmission method and device, electronic equipment and storage medium | |
| CN112417054B (en) | Distributed data storage method, data query method, device and storage medium | |
| CN112929432B (en) | Broadcasting method, equipment and storage medium based on repeated broadcasting history | |
| CN111639939A (en) | Block restoring method, equipment and storage medium | |
| CN110019671B (en) | Method and system for processing real-time message | |
| CN108520025B (en) | Service node determination method, device, equipment and medium | |
| CN112733202A (en) | Parallel chain supervision consensus method, computer device and storage medium | |
| CN112804322B (en) | Block generation method, computer device and storage medium | |
| CN112667607B (en) | Historical data management method and related equipment | |
| US11853814B2 (en) | Automatically generating events |
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 |