CN110727964B - Block chain big data processing method and system - Google Patents
Block chain big data processing method and system Download PDFInfo
- Publication number
- CN110727964B CN110727964B CN201911008502.8A CN201911008502A CN110727964B CN 110727964 B CN110727964 B CN 110727964B CN 201911008502 A CN201911008502 A CN 201911008502A CN 110727964 B CN110727964 B CN 110727964B
- Authority
- CN
- China
- Prior art keywords
- data
- node
- blockchain
- nodes
- block chain
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 21
- 238000004364 calculation method Methods 0.000 claims description 9
- 238000000034 method Methods 0.000 claims description 5
- 230000005540 biological transmission Effects 0.000 abstract description 14
- 238000005516 engineering process Methods 0.000 abstract description 3
- 241000700605 Viruses Species 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 235000021393 food security Nutrition 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The invention relates to a block chain big data processing method, which comprises the steps that a node obtaining accounting rights converts user data into first data and broadcasts the first data to other nodes running a first block chain client; configuring a node in the second blockchain client to obtain the accounting right through a hash algorithm; the node obtaining the accounting right converts the user data into second data and broadcasts the second data to other nodes running a second blockchain client; and judging whether the first data stored in each node is the same as the second data, if so, outputting the first data or the second data as user data, and if not, disconnecting the node with different stored first data and second data from the first block chain and the second block chain. The invention combines the safety of the block chain transmission data and the speed of the common mode transmission data, thereby enabling the block chain technology to be applied to more fields requiring large data transmission speed, exerting the characteristics of the block chain and ensuring the data safety and the decentralization.
Description
Technical Field
The present invention relates to a blockchain processing method, and more particularly, to a blockchain processing method for processing big data to improve speed and security.
Background
Blockchains are widely used in the fields of finance, insurance, law, logistics, food security, payment, database construction, and the like, with the advantages of decentralization, information disclosure, non-tampering, and the like.
At present, the pain point that the blockchain does not really land is that the processing speed of the existing blockchain is low, the real-time processing requirement of a user cannot be met, and if the real-time processing is met, the processing speed of the blockchain is reduced.
Therefore, there is a need for a blockchain big data processing system that can increase the speed of processing big data by the blockchain while taking advantage of the blockchain to ensure the data security.
Disclosure of Invention
The technical problem to be solved by the invention is to provide the blockchain big data processing system which can increase the speed of processing big data of the blockchain and can play the advantages of the blockchain at the same time so as to ensure the data security.
The invention relates to a block chain big data processing method, which comprises the following steps of
Simultaneously configuring a first blockchain client and a second blockchain client on at least five nodes;
acquiring user data;
randomly configuring a node in the first blockchain client to obtain accounting rights;
the node obtaining the accounting right converts the user data into first data and broadcasts the first data to other nodes running the first blockchain client, and when more than 51% of other nodes of the first blockchain are successfully received, the first data is regarded as being stored in the first blockchain;
configuring a node in the second blockchain client to obtain the accounting right through a hash algorithm;
the node obtaining the accounting right converts the user data into second data and broadcasts the second data to other nodes running the second blockchain client, and when more than 51% of other nodes of the second blockchain are received and verified successfully, the second data is regarded as being stored in the second blockchain;
and judging whether the first data stored in each node is the same as the second data, if so, outputting the first data or the second data as user data, and if not, disconnecting the node with different stored first data and second data from the first block chain and the second block chain.
The invention relates to a blockchain big data processing method, wherein after a node is matched with a hash algorithm in a second blockchain client to obtain accounting rights, the method further comprises the following steps:
acquiring the processor load occupancy rate of each node;
and judging whether the highest processor load occupancy rate in each node is lower than a preset threshold value according to the wooden barrel principle, and if so, operating the second blockchain client.
The invention relates to a block chain big data processing method, wherein the random configuration mode is as follows:
acquiring the data read-write speed v of each node;
constructing a pie chart according to the sum of the data read-write speed v of each node and the total read-write speed of all nodes;
a pointer which can rotate and stop at any time is configured in the pie chart, and the node pointed by the pointer when stopping is the node which is randomly configured and obtains the accounting right;
when nodes with accounting rights are randomly configured next time, a pie chart is constructed by the sum of the data read-write speed v x 2 of the nodes which do not acquire the accounting rights in the first blockchain and the total read-write speed of all the nodes;
and configuring a pointer which can rotate and stop at any time in the pie chart, wherein the node pointed by the pointer when the pointer stops is the node which is randomly configured and obtains the accounting right.
The invention relates to a block chain big data processing method, wherein the random configuration mode is as follows:
obtaining redundancy coefficients of the user data according to the condition of the user data;
obtaining redundancy calculation force Xi of each node according to the data processing capacity of the node;
the preset threshold Y is output according to the following formula:wherein n is the number of nodes;
when the redundancy factor is higher than a preset threshold value Y, the first blockchain client only selects nodes with redundancy calculation force Xi exceeding the preset threshold value Y to be randomly configured as nodes for obtaining the accounting rights.
The invention discloses a blockchain big data processing method, wherein the redundancy coefficient is as follows:
the invention discloses a blockchain big data processing method, wherein the redundancy coefficient is as follows:
the invention relates to a system of a blockchain big data processing method, which comprises at least five nodes, wherein each node is simultaneously provided with a first blockchain client and a second blockchain client, and the nodes comprise:
an input module for acquiring user data;
a first allocation module for obtaining accounting rights by randomly configuring a node in the first blockchain client to be operated;
a broadcasting module for converting the user data into first data at the node obtaining the accounting right and broadcasting the first data to other nodes running the first blockchain client, wherein when the other nodes exceeding 51% of the first blockchain are successfully received, the first data is regarded as being stored in the first blockchain;
a second distribution module for configuring a node in the second blockchain client to be operated with a hash algorithm to obtain accounting rights;
a second broadcasting module, configured to convert the user data into second data at the node that obtains the accounting right and broadcast the second data to other nodes running the second blockchain client, and when more than 51% of other nodes of the second blockchain are received and verified successfully, consider that the second data is stored in the second blockchain;
and the processing module is used for judging whether the first data stored in each node is the same as the second data, if so, outputting the first data or the second data as user data, and if not, disconnecting the node with different stored first data and second data from the first block chain and the second block chain.
The invention relates to a block chain big data processing method which is different from the prior art in that the method of the invention changes the hash algorithm in the traditional block chain algorithm to contend for the accounting right by randomly configuring a node to obtain the accounting right so as to improve the running speed and the processing speed of the whole system, thereby being convenient for storing, receiving and transmitting big data and accelerating; when the receiving and transmitting are finished, the second block chain is used for carrying out a traditional hash algorithm to enable the node to contend for the accounting right, and the node can be firstly distinguished from the node of the first block chain, which obtains the accounting right, so that the first data and the second data which are transmitted in two ways can be compared, and the situation that the user data are changed or changed in transmission due to system damage, viruses and data transmission faults is avoided. The invention combines the safety of the block chain transmission data and the speed of the common mode transmission data, thereby enabling the block chain technology to be applied to more fields requiring large data transmission speed, exerting the characteristics of the block chain and ensuring the data safety and the decentralization.
A blockchain big data processing method of the present invention is further described below with reference to the accompanying drawings.
Drawings
FIG. 1 is a flow chart of a blockchain big data processing method;
FIG. 2 is a pie chart of the first table;
fig. 3 is a pie chart of the second table.
Detailed Description
As shown in FIG. 1, the method for processing big data of a block chain of the present invention comprises
Simultaneously configuring a first blockchain client and a second blockchain client on at least five nodes;
acquiring user data;
randomly configuring a node in the first blockchain client to obtain accounting rights;
the node obtaining the accounting right converts the user data into first data and broadcasts the first data to other nodes running the first blockchain client, and when more than 51% of other nodes of the first blockchain are successfully received, the first data is regarded as being stored in the first blockchain;
configuring a node in the second blockchain client to obtain the accounting right through a hash algorithm;
the node obtaining the accounting right converts the user data into second data and broadcasts the second data to other nodes running the second blockchain client, and when more than 51% of other nodes of the second blockchain are received and verified successfully, the second data is regarded as being stored in the second blockchain;
and judging whether the first data stored in each node is the same as the second data, if so, outputting the first data or the second data as user data, and if not, disconnecting the node with different stored first data and second data from the first block chain and the second block chain.
According to the invention, the hash algorithm in the traditional block chain algorithm contends for the accounting right and is changed into a node which is randomly configured to obtain the accounting right, so that the running speed and the processing speed of the whole system are improved, and the storage, the receiving and the transmitting of big data are facilitated and the speed is accelerated; when the receiving and transmitting are finished, the second block chain is used for carrying out a traditional hash algorithm to enable the node to contend for the accounting right, and the node can be firstly distinguished from the node of the first block chain, which obtains the accounting right, so that the first data and the second data which are transmitted in two ways can be compared, and the situation that the user data are changed or changed in transmission due to system damage, viruses and data transmission faults is avoided. The invention combines the safety of the block chain transmission data and the speed of the common mode transmission data, thereby enabling the block chain technology to be applied to more fields requiring large data transmission speed, exerting the characteristics of the block chain and ensuring the data safety and the decentralization.
The node running the first blockchain client is regarded as running on the first blockchain; similarly, the node running the second blockchain client is considered to be running on the second blockchain.
Wherein, when more than 51% of the other nodes receive and verify successfully, a receipt is sent to the billing node to count if 51% of the other nodes verify successfully.
For example, when the input module obtains that the user data is I'm, the input module randomly configures one node to obtain the accounting right and converts I'm into the first data to broadcast to other nodes of the first blockchain, wherein the first blockchain client and the second blockchain client are operated on 11 nodes; when more than 51% of other nodes of the first blockchain are successfully received, the first data is regarded as being stored in the first blockchain;
at this time, the processor load occupancy rate of each node is obtained;
judging whether the highest processor load occupancy rate in each node is lower than a preset threshold value according to the wooden barrel principle, and if so, operating a second blockchain client; the preset threshold may be (9%, 90%), preferably 30%, that is, when the highest processor load rate node is less than 30% in each node, the second blockchain client is operated.
Wherein outputting the first data or the second data as the user data means: when the user needs to consult, the user can output the first data or the second data.
Configuring a node in the second blockchain client by a hash algorithm to obtain the accounting right; for example, each node combines "me" with the time of acquiring user data "2019, 7, 2, 3 pm, 43 minutes, 24 seconds" and the natural number "n" to be "me 2019, 7, 2, 3 pm, 43 minutes, 24 seconds, n" and judges whether the generated hash value is 0 in the first 5 bits through the SHA256 algorithm, if yes, it is judged that n is calculated first, it is judged that the node has the accounting right, if not, n is sequentially transformed until the node finds n as several or other nodes find n as several.
The node obtaining the accounting right converts the user data I'm into second data and broadcasts the second data to other nodes running the second blockchain client, and when more than 51% of other nodes of the second blockchain are successfully received and verified, the second data is regarded as being stored in the second blockchain;
each node can determine whether the first data stored in the node is the same as the second data, if so, the first data or the second data is output as user data, and if not, the node with the stored first data and the stored second data being different is disconnected from the first block chain and the second block chain.
Preferably, after the second blockchain client is configured with a node to obtain the accounting right through the hash algorithm, the method further includes:
acquiring the processor load occupancy rate of each node;
and judging whether the highest processor load occupancy rate in each node is lower than a preset threshold value according to the wooden barrel principle, and if so, operating the second blockchain client.
The invention uses the workload peak and valley period between each node to judge whether the second blockchain client needs to be operated, namely, only the first blockchain client is operated in busy hours, thereby ensuring the efficiency and speed of data storage, and the second blockchain client is operated in idle hours to ensure the fairness and rationality of the accounting right through a hash algorithm, thereby avoiding the phenomenon of unstable accounting right caused by random preset rules, namely, ensuring the safety of big data.
Wherein the operation of the running second blockchain client is: the node that obtains the billing rights converts the user data into second data and broadcasts it to other nodes running the second blockchain client.
That is, the above steps are the steps of "the node that will operate the second blockchain client to obtain the accounting right with a hash algorithm and" the node that will obtain the accounting right will convert the user data into the second data and broadcast it to the other nodes that operate the second blockchain client, when more than 51% of the other nodes of the second blockchain are successfully received and verified, the second data is considered to be stored in the second blockchain "to operate, thereby determining whether the node that will obtain the accounting right needs to operate" the node that will convert the user data into the second data and broadcast it to the other nodes that operate the second blockchain client, when more than 51% of the other nodes of the second blockchain are successfully received and verified, the second data is considered to be stored in the second blockchain "so that when the load is low, the above steps are operated, and the processor load rate of the steps above this step is guaranteed to be low and the operation speed is high.
Preferably, the random configuration is as follows:
acquiring the data read-write speed v of each node;
constructing a pie chart according to the sum of the data read-write speed v of each node and the total read-write speed of all nodes;
a pointer which can rotate and stop at any time is configured in the pie chart, and the node pointed by the pointer when stopping is the node which is randomly configured and obtains the accounting right;
when nodes with accounting rights are randomly configured next time, a pie chart is constructed by the sum of the data read-write speed v x 2 of the nodes which do not acquire the accounting rights in the first blockchain and the total read-write speed of all the nodes;
and configuring a pointer which can rotate and stop at any time in the pie chart, wherein the node pointed by the pointer when the pointer stops is the node which is randomly configured and obtains the accounting right.
The random configuration pointed out by the invention can be pseudo-random, i.e. if the node which is not randomly configured to obtain the accounting right is not randomly configured for the first time, the probability of being randomly configured for other nodes is doubled in the next random configuration, so that the pie chart is changed every time, and the probability of each node in the whole pie chart is changed, so that after thousands of accounting, the probability of the node which is configured to obtain the accounting right is approximately positively related to the data read-write speed v.
For example: the first time as shown in the following table:
| data read-write speed v | |
| First node | 81 |
| Second node | 52 |
| Third node | 71 |
| Fourth node | 45 |
| Fifth node | 36 |
The corresponding pie chart is as follows: shown in fig. 2.
The second time is shown in the following table:
| data read-write speed v | |
| First node | 162 |
| Second node | 52 |
| Third node | 141 |
| Fourth node | 90 |
| Fifth node | 72 |
The corresponding pie chart is as follows: shown in fig. 3.
The read-write speed of each node can be: the node stores the capacity stored in a one-minute file, which may be in units of G/min.
Preferably, the random configuration is as follows:
obtaining redundancy coefficients of the user data according to the condition of the user data;
obtaining redundancy calculation force Xi of each node according to the data processing capacity of the node;
the preset threshold Y is output according to the following formula:wherein n is the number of nodes;
when the redundancy factor is higher than a preset threshold value Y, the first blockchain client only selects nodes with redundancy calculation force Xi exceeding the preset threshold value Y to be randomly configured as nodes for obtaining the accounting rights.
The invention properly matches the node capable of being qualified for the redundancy degree of the user data by acquiring the redundancy calculation force Xi of each node and the redundancy coefficient of each user data as the node of the accounting right, thereby having faster speed and higher efficiency when broadcasting to other nodes. Moreover, the computing power of the node with higher redundancy computing power Xi is not excessively occupied, but the node with higher redundancy computing power Xi is approved to be the node with higher redundancy computing power Xi when the computing power of each node exceeds a preset threshold value by taking the cubic root of the arithmetic square of each node as the preset threshold value, and the computing power of the redundancy computing coefficient of the user data with higher redundancy computing power Xi is also taken as the value of the redundancy computing coefficient for checking whether the user data with higher redundancy computing power Xi needs to be started, so that the overall transmission efficiency of the first block chain is improved.
The redundancy refers to the number of files stored in each node for storing a plurality of 1mb of different files within one minute. Of course, the redundancy can also be: each node stores the number of files that store a number of 1kb of different files within one minute.
Wherein, the liquid crystal display device comprises a liquid crystal display device,the total capacity is calculated according to G, that is, the redundancy coefficient represents the number of files in each Gb data of the user data, so that the redundancy degree of the data packet of the user data is calculated, and the node suitable for the user data is adapted according to the redundancy degree to randomly obtain the accounting right, thereby ensuring the efficiency of data processing. Because the hard disk storage of a node is generally divided into two forms, one is suitable for storing a single file of a larger capacity and one is suitable for storing a plurality of files of a smaller capacity. Where a node that is suitable for storing multiple files of smaller capacity is often also good at storing a single file of larger capacity, and vice versa. That is, if this node is more suitable for storing a plurality of files having smaller capacity, it is more suitable for storing user data having a high redundancy factor.
Of course, the redundancy factor may also be:or->Or (b)Wherein the number of file types refers to: the data packet of one user data has the types of files of types ". Exe", ". Doc", etc. Either of the above may represent a redundancy factor for the user data.
Preferably, the redundancy factor is:
the invention judges the redundancy coefficient of the user data according to the number of the files, and can judge whether the redundancy coefficient is applicable to the redundancy calculation force Xi of each node according to the data packet of the user data, wherein the unit of the total capacity can be Gb or mb, and is preferably Gb.
Preferably, the redundancy factor is:
the invention judges the redundancy coefficient of the user data by the number of the file words, and can judge whether the redundancy coefficient is applicable to the redundancy calculation force Xi of each node according to the data packet of the user data.
The invention relates to a system of a blockchain big data processing method, which comprises at least five nodes, wherein each node is simultaneously provided with a first blockchain client and a second blockchain client, and the nodes comprise:
an input module for acquiring user data;
a first allocation module for obtaining accounting rights by randomly configuring a node in the first blockchain client to be operated;
a broadcasting module for converting the user data into first data at the node obtaining the accounting right and broadcasting the first data to other nodes running the first blockchain client, wherein when the other nodes exceeding 51% of the first blockchain are successfully received, the first data is regarded as being stored in the first blockchain;
a second distribution module for configuring a node in the second blockchain client to be operated with a hash algorithm to obtain accounting rights;
a second broadcasting module, configured to convert the user data into second data at the node that obtains the accounting right and broadcast the second data to other nodes running the second blockchain client, and when more than 51% of other nodes of the second blockchain are received and verified successfully, consider that the second data is stored in the second blockchain;
and the processing module is used for judging whether the first data stored in each node is the same as the second data, if so, outputting the first data or the second data as user data, and if not, disconnecting the node with different stored first data and second data from the first block chain and the second block chain.
It should be noted that, only the first allocation module of the node where the input module for obtaining the user data is located can complete the random configuration function, and the first allocation modules of other nodes do not work at this time.
It should be noted that the second allocation module is different from the random assignment of the first allocation module because the second allocation module needs to contend for the accounting right through the hash algorithm, and thus the second allocation module of each node works at this time.
Wherein the first and second broadcast modules may be the same module.
The above examples are only illustrative of the preferred embodiments of the present invention and are not intended to limit the scope of the present invention, and various modifications and improvements made by those skilled in the art to the technical solution of the present invention should fall within the scope of protection defined by the claims of the present invention without departing from the spirit of the present invention.
Claims (5)
1. A block chain big data processing method is characterized in that: comprising
Simultaneously configuring a first blockchain client and a second blockchain client on at least five nodes;
acquiring user data;
randomly configuring a node in the nodes running the first blockchain client to obtain accounting rights;
the node obtaining the accounting right converts the user data into first data and broadcasts the first data to other nodes running the first blockchain client, and when more than 51% of other nodes of the first blockchain are successfully received, the first data is regarded as being stored in the first blockchain;
configuring a node in the nodes running the second blockchain client by a hash algorithm to obtain a billing right;
the node obtaining the accounting right converts the user data into second data and broadcasts the second data to other nodes running the second blockchain client, and when more than 51% of other nodes of the second blockchain are received and verified successfully, the second data is regarded as being stored in the second blockchain;
judging whether the first data stored in each node is the same as the second data, if so, outputting the first data or the second data as user data, and if not, disconnecting the node with different stored first data and second data from the first block chain and the second block chain;
the configuring a node with a hash algorithm in the node running the second blockchain client to obtain the accounting right further comprises:
acquiring the processor load occupancy rate of each node;
judging whether the highest processor load occupancy rate in each node is lower than a preset threshold value according to the wooden barrel principle, and if so, operating a second blockchain client;
the random configuration mode is as follows:
acquiring the data read-write speed v of each node;
constructing a pie chart according to the sum of the data read-write speed v of each node and the total read-write speed of all nodes;
a pointer which can rotate and stop at any time is configured in the pie chart, and the node pointed by the pointer when stopping is the node which is randomly configured and obtains the accounting right;
when the node with the accounting right is randomly configured next time, the sum of the data read-write speed v x 2 of the node which does not acquire the accounting right in the first blockchain and the total read-write speed of all the nodes is used for constructing a pie chart.
2. A block chain big data processing method is characterized in that: comprising
Simultaneously configuring a first blockchain client and a second blockchain client on at least five nodes;
acquiring user data;
randomly configuring a node in the nodes running the first blockchain client to obtain accounting rights;
the node obtaining the accounting right converts the user data into first data and broadcasts the first data to other nodes running the first blockchain client, and when more than 51% of other nodes of the first blockchain are successfully received, the first data is regarded as being stored in the first blockchain;
configuring a node in the nodes running the second blockchain client by a hash algorithm to obtain a billing right;
the node obtaining the accounting right converts the user data into second data and broadcasts the second data to other nodes running the second blockchain client, and when more than 51% of other nodes of the second blockchain are received and verified successfully, the second data is regarded as being stored in the second blockchain;
judging whether the first data stored in each node is the same as the second data, if so, outputting the first data or the second data as user data, and if not, disconnecting the node with different stored first data and second data from the first block chain and the second block chain;
the configuring a node with a hash algorithm in the node running the second blockchain client to obtain the accounting right further comprises:
acquiring the processor load occupancy rate of each node;
judging whether the highest processor load occupancy rate in each node is lower than a preset threshold value according to the wooden barrel principle, and if so, operating a second blockchain client;
the random configuration mode is as follows:
obtaining redundancy coefficients of the user data according to the condition of the user data;
obtaining redundancy calculation force Xi of each node according to the data processing capacity of the node;
the preset threshold Y is output according to the following formula:wherein n is the number of nodes;
when the redundancy factor is higher than a preset threshold value Y, the first blockchain client only selects nodes with redundancy calculation force Xi exceeding the preset threshold value Y to be randomly configured as nodes for obtaining the accounting right.
3. The blockchain big data processing method of claim 2, wherein: the redundancy factor is:
4. the blockchain big data processing method of claim 2, wherein: the redundancy factor is:
5. a system for a blockchain big data processing method of claim 1 or 2, characterized by: the method comprises the steps that at least five nodes are included, a first blockchain client and a second blockchain client are simultaneously configured on each node, and the nodes comprise:
an input module for acquiring user data;
the first distribution module is used for randomly configuring a node in the nodes running the first blockchain client to obtain the accounting right;
a broadcasting module for converting the user data into first data at the node obtaining the accounting right and broadcasting the first data to other nodes running the first blockchain client, wherein when the other nodes exceeding 51% of the first blockchain are successfully received, the first data is regarded as being stored in the first blockchain;
the second distribution module is used for configuring a node to obtain the accounting right by a hash algorithm in the nodes running the second blockchain client;
a second broadcasting module, configured to convert the user data into second data at the node that obtains the accounting right and broadcast the second data to other nodes running the second blockchain client, and when more than 51% of other nodes of the second blockchain are received and verified successfully, consider that the second data is stored in the second blockchain;
the processing module is used for judging whether the first data stored in each node are the same as the second data, if so, outputting the first data or the second data as user data, and if not, disconnecting the node with different stored first data and second data from the first block chain and the second block chain;
the configuring a node with a hash algorithm in the node running the second blockchain client to obtain the accounting right further comprises:
acquiring the processor load occupancy rate of each node;
and judging whether the highest processor load occupancy rate in each node is lower than a preset threshold value according to the wooden barrel principle, and if so, operating the second blockchain client.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911008502.8A CN110727964B (en) | 2019-10-22 | 2019-10-22 | Block chain big data processing method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911008502.8A CN110727964B (en) | 2019-10-22 | 2019-10-22 | Block chain big data processing method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110727964A CN110727964A (en) | 2020-01-24 |
| CN110727964B true CN110727964B (en) | 2023-10-31 |
Family
ID=69222848
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911008502.8A Active CN110727964B (en) | 2019-10-22 | 2019-10-22 | Block chain big data processing method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110727964B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111371556B (en) * | 2020-02-21 | 2022-06-17 | 运易通科技有限公司 | Block link point accounting method, device, equipment and storage medium |
| CN112835935B (en) * | 2021-02-02 | 2021-12-07 | 农夫铺子发展集团有限公司 | Information flow analysis method and cloud service platform based on block chain and mobile internet |
| CN112927078A (en) * | 2021-03-03 | 2021-06-08 | 关莉莉 | Block chain financial big data analysis processing system and method and transaction platform system |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109101836B (en) * | 2018-08-09 | 2021-07-13 | 全链通有限公司 | Accounting method and system of block chain network |
| CN109547527B (en) * | 2018-10-12 | 2021-04-06 | 广西师范大学 | Partition quick consensus method based on credit mechanism in block chain |
| CN109542883B (en) * | 2018-10-30 | 2021-06-01 | 广州斯拜若科技有限公司 | Information duplicate checking method based on block chain |
| CN109493223B (en) * | 2018-11-07 | 2021-12-21 | 联动优势科技有限公司 | Accounting method and device |
| CN109918946B (en) * | 2019-03-08 | 2019-12-10 | 浙江雲禾智能设备有限公司 | big data security processing system and method based on block chain technology |
| CN110321723B (en) * | 2019-07-08 | 2021-11-09 | 环玺信息科技（上海）有限公司 | Block chain safety information processing system and method, electronic equipment and medium |
-
2019
- 2019-10-22 CN CN201911008502.8A patent/CN110727964B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN110727964A (en) | 2020-01-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110727964B (en) | Block chain big data processing method and system | |
| CN109347804B (en) | Byzantine fault-tolerant consensus optimization method for block chain | |
| RU2586010C2 (en) | Method and device for storing data using hashing | |
| US20230214380A1 (en) | Methods for extending a proof-of-space-time blockchain | |
| CN105718317A (en) | Task scheduling method and task scheduling device | |
| CN103561354B (en) | Method and device for calculating and processing video smoothness | |
| CN103312825A (en) | Method and device for data distribution and storage | |
| Walsh et al. | Lot-based voting rules. | |
| Escoffier et al. | Fair solutions for some multiagent optimization problems | |
| CN111697590A (en) | Entropy weight method-based power system key node identification method and system | |
| CN109450806B (en) | Flow control method and device and distributed cluster | |
| CN115865779A (en) | Communication path selection method, system, terminal equipment and storage medium | |
| CN109189808B (en) | Data query method and related equipment | |
| CN104572414A (en) | Method and system for detecting CPU (Central Processing Unit) occupancy rate of vxWorks | |
| Bagai et al. | An accurate system-wide anonymity metric for probabilistic attacks | |
| CN108664322A (en) | Data processing method and system | |
| CN109542909B (en) | Method and system for identifying associative storage devices in big data storage system | |
| CN103842955A (en) | Service flow control method, service flow control device and service flow control system | |
| US20070150437A1 (en) | Protection against timing and resource consumption attacks | |
| CN116112507A (en) | Hierarchical blockchain-based multitasking asynchronous execution method and device | |
| CN111522876B (en) | Block chain consensus method, device, computer equipment and block chain link point | |
| CN109597832B (en) | Data processing method, computing device, storage device, and storage medium | |
| CN108345495A (en) | A kind of locking method and server of multithreading | |
| CN111628901B (en) | Index anomaly detection method and related device | |
| Li et al. | Scheduling coupled-tasks on a single machine |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20230928 Address after: 9th Floor, Building 3, Zone 6, No. 188 South Fourth Ring West Road, Fengtai District, Beijing, 100070 Applicant after: Beijing Guolian video information technology Co.,Ltd. Address before: 502, Building 18, Jinmaofu, Guangqu, Chaoyang District, Beijing, 100000 Applicant before: Gao Po |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |