CN114884977B - Block chain-based data sharing method and system - Google Patents
Block chain-based data sharing method and system Download PDFInfo
- Publication number
- CN114884977B CN114884977B CN202210496601.0A CN202210496601A CN114884977B CN 114884977 B CN114884977 B CN 114884977B CN 202210496601 A CN202210496601 A CN 202210496601A CN 114884977 B CN114884977 B CN 114884977B
- Authority
- CN
- China
- Prior art keywords
- data
- stored
- importance
- unit
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 23
- 238000012545 processing Methods 0.000 claims abstract description 48
- 238000011156 evaluation Methods 0.000 claims description 10
- 230000004044 response Effects 0.000 claims description 9
- 230000005540 biological transmission Effects 0.000 claims description 3
- 238000004148 unit process Methods 0.000 claims description 2
- 229910000831 Steel Inorganic materials 0.000 claims 2
- 239000010959 steel Substances 0.000 claims 2
- 239000002699 waste material Substances 0.000 abstract description 7
- 238000005516 engineering process Methods 0.000 abstract description 3
- 238000012546 transfer Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 2
- 238000005192 partition Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 230000006870 function Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present application relates to the field of blockchain technologies, and in particular, to a blockchain-based data sharing method and system, including: receiving data to be stored, and calculating the importance of the data to be stored; writing data to be stored into a common node of a block unit, writing a consensus mechanism into a representative node of the block unit, and writing a data processing model into the representative node of the block unit according to the importance of the data to be stored; responding to receiving read requests of other block units, wherein data recorded in common nodes of the block units are subjected to consensus through a consensus mechanism in a representative node; after consensus is achieved, processing the data recorded in the common node through a data processing model in the representative section of the block unit; and calculating the information loss rate of the processed data, and sending the processed data to other block units according to the information loss rate to respond to the read request. The method and the device can fully utilize the data resources and avoid the waste of the data resources.
Description
Technical Field
The present disclosure relates to the field of blockchain technologies, and in particular, to a blockchain-based data sharing method and system.
Background
With the development of computer, communication and network technologies and the huge and profound influence of globalization and internationalization on the world, the informatization and digitalization processes of the whole society are greatly accelerated, and simultaneously, the number of users and the data volume of the users are explosive growth, and the huge number also provides abundant data resources for the society.
However, the requirements of different kinds of data for security levels are different, which limits sharing of data, for example: data with higher security level requirements are generally not shared externally, so that data leakage is avoided. In this case, it is difficult to fully utilize the data resources even though the data resources are abundant at present, resulting in serious waste of the data resources.
Therefore, how to fully utilize the data resources and avoid the waste of the data resources is a technical problem which needs to be solved by the technicians in the field at present.
Disclosure of Invention
The application provides a data sharing method and a system based on a block chain so as to fully utilize data resources and avoid waste of the data resources.
In order to solve the technical problems, the application provides the following technical scheme:
a data sharing method based on a block chain comprises the following steps: step S110, receiving data to be stored, and calculating the importance of the data to be stored; step S120, writing the data to be stored into the common node of the block unit, writing a consensus mechanism into the representative node of the block unit, and writing a data processing model into the representative node of the block unit according to the importance of the data to be stored; step S130, responding to the received read request of other block units, wherein the data recorded in the common node of the block unit is subjected to consensus through a consensus mechanism in the representative node; step S140, after consensus is achieved, processing the data recorded in the common node through a data processing model in the representative section of the block unit; step S150, the information loss rate calculation is performed on the processed data, and the processed data is sent to other block units according to the information loss rate to be used as a response to the read request.
The blockchain-based data sharing method as described above, wherein preferably, the importance of the data to be stored is calculated, comprising the steps of: bringing a plurality of characteristic values of data to be stored together to form a characteristic set A; taking the weight of the preset category corresponding to each characteristic value in the characteristic set A as the weight of the characteristic value, and collecting the weights of each characteristic value in the characteristic set A together to form a characteristic weight set V; and obtaining the importance degree p of the data to be stored according to the feature set A and the feature weight set V of the data to be stored.
In the blockchain-based data sharing method, preferably, after the data recorded in the common node is agreed according to the consensus mechanism recorded in the representative node of the blockunit, the data X recorded in the common node is further divided into P parts, wherein P is an integer obtained by rounding up the importance P; and inputting the divided P part into a data processing model for processing to obtain processed data S.
In the block chain-based data sharing method as described above, it is preferable that if the information loss rate β of the data X is greater than the parameter corresponding to the importance p, the processed data S cannot be transmitted to other block units; if the information loss rate β of the data X is not greater than the parameter corresponding to the importance p, the processed data S can be transmitted to other block units.
In the blockchain-based data sharing method as described above, it is preferable that a certain number of nodes having a strong evaluation value of computing power are selected from all nodes of a blockunit as representative nodes, and the remaining nodes in the blockunit are taken as normal nodes.
A blockchain-based data sharing system, preferably comprising: the device comprises a receiving unit, a calculating unit, a writing unit, a consensus unit, a processing unit, a loss calculating unit and a transmitting unit; the receiving unit receives data to be stored, and the calculating unit calculates the importance of the data to be stored; the writing unit writes the data to be stored into the common node of the block unit, writes the consensus mechanism into the representative node of the block unit, and writes the data processing model into the representative node of the block unit according to the importance of the data to be stored; responding to the received read requests of other block units, and enabling the consensus unit to perform consensus on the data recorded in the common node of the block unit through a consensus mechanism in the representative node; after consensus is achieved, the processing unit processes the data recorded in the common node through the data processing model in the representative node of the block unit; the loss calculation unit performs information loss rate calculation on the processed data, and the transmission unit transmits the processed data to other block units in accordance with the information loss rate as a response to the read request.
The blockchain-based data sharing system as described above, preferably, further includes: bringing a plurality of characteristic values of data to be stored together to form a characteristic set A; taking the weight of the preset category corresponding to each characteristic value in the characteristic set A as the weight of the characteristic value, and collecting the weights of each characteristic value in the characteristic set A together to form a characteristic weight set V; and obtaining the importance degree p of the data to be stored according to the feature set A and the feature weight set V of the data to be stored.
In the blockchain-based data sharing system, preferably, after the data recorded in the common node is agreed according to the consensus mechanism recorded in the representative node of the blockunit, the data X recorded in the common node is further divided into P parts, wherein P is an integer obtained by rounding up the importance P; and inputting the divided P part into a data processing model for processing to obtain processed data S.
In the blockchain-based data sharing system as described above, it is preferable that if the information loss rate β of the data X is greater than the parameter corresponding to the importance p, the processed data S cannot be transmitted to other block units; if the information loss rate β of the data X is not greater than the parameter corresponding to the importance p, the processed data S can be transmitted to other block units.
In the blockchain-based data sharing system as described above, it is preferable that a certain number of nodes having a high computing power evaluation value are selected from all the nodes of the block unit as representative nodes, and the remaining nodes in the block unit are taken as normal nodes.
Compared with the background art, the data sharing method and system based on the blockchain can fully utilize data resources and avoid waste of the data resources.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments described in the present invention, and other drawings may be obtained according to these drawings for a person having ordinary skill in the art.
FIG. 1 is a flow chart of a blockchain-based data sharing method provided by embodiments of the present application;
FIG. 2 is a schematic diagram of a blockchain-based data sharing system provided in an embodiment of the present application.
Detailed Description
Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to like or similar elements or elements having like or similar functions throughout. The embodiments described below by referring to the drawings are illustrative only and are not to be construed as limiting the invention.
Example 1
Referring to fig. 1, fig. 1 is a flowchart of a data sharing method based on a blockchain according to an embodiment of the present application.
The application provides a data sharing method based on a block chain, which comprises the following steps:
step S110, receiving data to be stored, and calculating the importance of the data to be stored;
the blockchain is a chain of block units, each of which holds a certain amount of data, and the block units are connected in a respective time sequence. The blockchain receives data to be stored, organizes a number of node building block units according to the data to be stored, for example: a certain number of nodes are organized according to the importance of the data to be stored, and then the identification of the previous node (specifically, the hash value of the previous node, the timestamp, the random number, the target hash, etc.) is recorded in the block header of each node, so that the nodes are constructed into block units to store the data to be stored.
In addition, each data has different importance, and the different importance has an influence on the security level and the sharing degree of outward sharing, so after the block link receives the data to be stored, the importance of the data to be stored is calculated, and the basis of the sharing degree is provided for the subsequent outward sharing data.
Specifically, each data has a plurality of characteristic values, and the plurality of characteristic values of the data to be stored are collected together to form a characteristic set A= { A 1 、A 2 、…、A i 、…、A n }, wherein A 1 Is the 1 st characteristic value, A 2 For the 2 nd characteristic value, A i For the ith eigenvalue, A n Is the nth eigenvalue. For example: if the data to be stored is transfer data, A 1 Can be payer account data, A 2 Can be payee account data, A i Can be the account password of the payer, A n May be transfer amount data; if the data to be stored is microblog data, A 1 Personal data, A, which can be the microblog publisher 2 Can be microblog content data, A i Can be comment data, A n May be personal data of the commentator.
Feature set a= { a 1 、A 2 、…、A i 、…、A n The weight of the preset category corresponding to each characteristic value in the characteristic set A is taken as the weight of the characteristic value, and the weights of each characteristic value in the characteristic set A are combined together to form a characteristic weight set V= { V 1 、V 2 、…、V i 、…、V n }, wherein V 1 Is the 1 st characteristic value A 1 Corresponding weight, V 2 For the 2 nd characteristic value A 2 Corresponding weight, V i For the ith eigenvalue A i Corresponding weight, V n For the nth characteristic value A n And (5) corresponding weight.
And obtaining the importance degree p of the data to be stored according to the feature set A and the feature weight set V of the data to be stored. In particular, according to
Calculating the importance p of the data to be stored, wherein A is max Is the most important feature value in the feature set A, V max For the most important characteristic value A max The corresponding most important weights, for example: if the data is to be storedIf the data is transfer data, then consider the payer account password A i For the most important characteristic value A max Payer account password A i Corresponding weight V i Is the most important weight V max 。
Step S120, writing the data to be stored into the common node of the block unit, writing a consensus mechanism into the representative node of the block unit, and writing a data processing model into the representative node of the block unit according to the importance of the data to be stored;
after the block chain builds the block unit, a certain number of nodes with strong computing power evaluation values are selected from all nodes of the block unit to serve as representative nodes, the rest nodes serve as common nodes, and then data to be stored are written into a block body of the common nodes to store the data.
In particular, according to
Calculating to obtain a calculation capability evaluation value E of the jth node j Wherein K is j For the expected value of the jth computing power affecting parameter, C j For the j-th computing power affecting parameter, D j Weighting the influence of the j-th computing power influence parameter on the evaluation value, 0<D j <1. For example: the computing capability influencing parameter may be a memory of the node, a CPU of the node, a graphics card of the node, etc.
In addition, a consensus mechanism is written into the block of the representative node, and all nodes in the block unit follow the decision rule of the consensus mechanism, that is, all the data recorded by the common nodes in the block unit need to be consensus through the consensus mechanism in the representative node. In addition, since the security level and the sharing degree of outward sharing of each data are different, in order to outward share data so as to fully utilize data resources, the waste of the data resources is avoided, meanwhile, the security of the data is ensured, and in the method, a data processing model is written into a zone block body representing a node. Thus, when the block unit shares data with other block units outside the block unit, the data is processed through the data processing model, and then the processed data is shared with other block units outside the block unit.
Specifically, the data processing model is
Wherein S is processed data, X α For the alpha-th part of data X stored in a normal node, x= { X 1 、X 2 、…、X α 、…、X P }，X 1 Is part 1 of data X, X 2 Is part 2 of data X, X P P is the P-th part of the data X, P is the importance P rounded up, ω α Alpha part X of data X α Deformation coefficient of>
e is a natural constant, Y α Is a random number, an X α Corresponds to one Y α 。
Step S130, responding to the received read request of other block units, wherein the data recorded in the common node of the block unit is subjected to consensus through a consensus mechanism in the representative node;
after the block unit receives the read requests of other block units, the data recorded by all the common nodes in the block unit are commonly recognized through a common recognition mechanism in the representative node so as to verify whether the data recorded by all the common nodes in the block unit are tampered, and after the data recorded by the common nodes to be verified are not tampered, the data recorded by the common nodes in the block unit can be provided for other block units outside the block unit.
Step S140, after consensus is achieved, processing the data recorded in the common node through a data processing model in the representative section of the block unit;
after consensus is achieved for the data recorded in the common node according to the consensus mechanism recorded in the representative node of the block unit, the data X recorded in the common node is further divided into P parts, namely: x= { X 1 、X 2 、…、X α 、…、X P P is an integer with importance P rounded up, all partitions of data X are related to importance P, and then the partitioned X is used 1 、X 2 、…、X α 、…、X P The input data processing model is
And processing the data to obtain processed data S.
Step S150, calculating the information loss rate of the processed data, and sending the processed data to other block units according to the information loss rate to be used as a response to the read request;
the representative node of the block unit also needs to calculate the information loss rate of the data, since processing the data results in loss of data information. In particular, according to
Calculating the information loss rate beta of the data X processed by the data processing model; if the information loss rate beta of the data X is larger than the parameter corresponding to the importance p, the processed data S cannot be sent to other block units; if the information loss rate β of the data X is not greater than the parameter corresponding to the importance p, the processed data S can be transmitted to other block units, in which case the processed data S is transmitted to other block units as a response to the read request.
Example two
Referring to fig. 2, fig. 2 is a schematic diagram of a blockchain-based data sharing system according to an embodiment of the present application.
The present application also provides a blockchain-based data sharing system 200, comprising: a receiving unit 210, a calculating unit 220, a writing unit 230, a consensus unit 240, a processing unit 250, a loss calculating unit 260, and a transmitting unit 270.
The receiving unit 210 receives data to be stored, and the calculating unit 220 calculates importance of the data to be stored.
The blockchain is a chain of block units, each of which holds a certain amount of data, and the block units are connected in a respective time sequence. The blockchain receives data to be stored, organizes a number of node building block units according to the data to be stored, for example: a certain number of nodes are organized according to the importance of the data to be stored, and then the identification of the previous node (specifically, the hash value of the previous node, the timestamp, the random number, the target hash, etc.) is recorded in the block header of each node, so that the nodes are constructed into block units to store the data to be stored.
In addition, each data has different importance, and the different importance has an influence on the security level and the sharing degree of outward sharing, so after the block link receives the data to be stored, the importance of the data to be stored is calculated, and the basis of the sharing degree is provided for the subsequent outward sharing data.
Specifically, each data has a plurality of characteristic values, and the plurality of characteristic values of the data to be stored are collected together to form a characteristic set A= { A 1 、A 2 、…、A i 、…、A n }, wherein A 1 Is the 1 st characteristic value, A 2 For the 2 nd characteristic value, A i For the ith eigenvalue, A n Is the nth eigenvalue. For example: if the data to be stored is transfer data, A 1 Can be payer account data, A 2 Can be payee account data, A i Can be the account password of the payer, A n May be transfer amount data; if the data to be stored is microblog data, A 1 Personal data, A, which can be the microblog publisher 2 Can be microblog content data, A i Can be comment data, A n May be personal data of the commentator.
Feature set a= { a 1 、A 2 、…、A i 、…、A n The weight of the preset category corresponding to each characteristic value in the characteristic set A is taken as the weight of the characteristic value, and the weights of each characteristic value in the characteristic set A are combined together to form a characteristic weight set V= { V 1 、V 2 、…、V i 、…、V n }, wherein V 1 Is the 1 st characteristic value A 1 Corresponding weight, V 2 For the 2 nd characteristic value A 2 Corresponding weight, V i For the ith eigenvalue A i Corresponding weight, V n For the nth characteristic value A n And (5) corresponding weight.
And obtaining the importance degree p of the data to be stored according to the feature set A and the feature weight set V of the data to be stored. In particular, according to
Calculating the importance p of the data to be stored, wherein A is max Is the most important feature value in the feature set A, V max For the most important characteristic value A max The corresponding most important weights, for example: if the data to be stored is transfer data, consider the payer account password A i For the most important characteristic value A max Payer account password A i Corresponding weight V i Is the most important weight V max 。
The writing unit 230 writes the data to be stored into the common node of the block unit, and writes the consensus mechanism into the representative node of the block unit, and also writes the data processing model into the representative node of the block unit according to the importance of the data to be stored.
After the block chain builds the block unit, a certain number of nodes with strong computing power evaluation values are selected from all nodes of the block unit to serve as representative nodes, the rest nodes serve as common nodes, and then data to be stored are written into a block body of the common nodes to store the data.
In particular, according to
Calculating to obtain a calculation capability evaluation value E of the jth node j Wherein K is j For the expected value of the jth computing power affecting parameter, C j For the j-th computing power affecting parameter, D j Weighting the influence of the j-th computing power influence parameter on the evaluation value, 0<D j <1. For example: the computing capability influencing parameter may be a memory of the node, a CPU of the node, a graphics card of the node, etc.
In addition, a consensus mechanism is written into the block of the representative node, and all nodes in the block unit follow the decision rule of the consensus mechanism, that is, all the data recorded by the common nodes in the block unit need to be consensus through the consensus mechanism in the representative node. In addition, since the security level and the sharing degree of outward sharing of each data are different, in order to outward share data so as to fully utilize data resources, the waste of the data resources is avoided, meanwhile, the security of the data is ensured, and in the method, a data processing model is written into a zone block body representing a node. Thus, when the block unit shares data with other block units outside the block unit, the data is processed through the data processing model, and then the processed data is shared with other block units outside the block unit.
Specifically, the data processing model is
Wherein S is processed data, X α For the alpha-th part of data X stored in a normal node, x= { X 1 、X 2 、…、X α 、…、X P }，X 1 Is part 1 of data X, X 2 Is part 2 of data X, X P P is the P-th part of the data X, P is the importance P rounded up, ω α Alpha part X of data X α Deformation coefficient of>
e is a natural constant, Y α Is a random number, an X α Corresponds to one Y α 。
In response to receiving a read request of another block unit, the consensus unit 240 performs consensus on the data recorded in the normal node of the block unit through a consensus mechanism in the representative node.
After the block unit receives the read requests of other block units, the data recorded by all the common nodes in the block unit are commonly recognized through a common recognition mechanism in the representative node so as to verify whether the data recorded by all the common nodes in the block unit are tampered, and after the data recorded by the common nodes to be verified are not tampered, the data recorded by the common nodes in the block unit can be provided for other block units outside the block unit.
After the consensus is reached, the processing unit 250 processes the data recorded in the common node through the data processing model in the representative section of the block unit.
After consensus is achieved for the data recorded in the common node according to the consensus mechanism recorded in the representative node of the block unit, the data X recorded in the common node is further divided into P parts, namely: x= { X 1 、X 2 、…、X α 、…、X P P is an integer with importance P rounded up, all partitions of data X are related to importance P, and then the partitioned X is used 1 、X 2 、…、X α 、…、X P The input data processing model is
And processing the data to obtain processed data S.
The loss calculation unit 260 performs information loss rate calculation on the processed data, and the transmission unit 270 transmits the processed data to other block units in accordance with the information loss rate as a response to the read request.
The representative node of the block unit also needs to calculate the information loss rate of the data, since processing the data results in loss of data information. In particular, according to
Calculating the information loss rate beta of the data X processed by the data processing model; if the information loss rate beta of the data X is larger than the parameter corresponding to the importance p, the processed data S cannot be sent to other block units; if the information loss rate beta of the data X is not more than the parameter corresponding to the importance pThe processed data S can then be sent to other block units, in which case the processed data S is sent to other block units as a response to the read request.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. The present embodiments are, therefore, to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned.
Furthermore, it should be understood that although the present disclosure describes embodiments, not every embodiment is provided with a separate embodiment, and that this description is provided for clarity only, and that the disclosure is not limited to the embodiments described in detail below, and that the embodiments described in the examples may be combined as appropriate to form other embodiments that will be apparent to those skilled in the art.
Claims (6)
1. A blockchain-based data sharing method, comprising the steps of:
step S110, receiving data to be stored, and calculating the importance of the data to be stored;
the importance of the data to be stored is calculated, comprising the following steps:
bringing a plurality of characteristic values of data to be stored together to form a characteristic set A;
taking the weight of the preset category corresponding to each characteristic value in the characteristic set A as the weight of the characteristic value, and collecting the weights of each characteristic value in the characteristic set A together to form a characteristic weight set V;
obtaining importance p of the data to be stored according to the feature set A and the feature weight set V of the data to be stored;
according to
Calculating the importance p of the data to be stored, wherein A is max Is the most important feature value in the feature set A, V max For the most important characteristic value A max The corresponding most important weight, A i For the ith feature value in feature set A, V i For the ith eigenvalue A i Corresponding weights;
step S120, writing the data to be stored into the common node of the block unit, writing a consensus mechanism into the representative node of the block unit, and writing a data processing model into the representative node of the block unit according to the importance of the data to be stored;
the data processing model is as follows
Wherein S is processed data, X α For the alpha-th part of data X stored in a normal node, x= { X 1 、X 2 、…、X α 、…、X P }，X 1 Is part 1 of data X, X 2 Is part 2 of data X, X P P is the P-th part of the data X, P is the importance P rounded up, ω α Alpha part X of data X α Is used for the deformation coefficient of the steel plate,
e is a natural constant, Y α Is a random number, an X α Corresponds to one Y α ；
Step S130, responding to the received read request of other block units, wherein the data recorded in the common node of the block unit is subjected to consensus through a consensus mechanism in the representative node;
step S140, after consensus is achieved, processing the data recorded in the common node through a data processing model in the representative section of the block unit;
step S150, calculating the information loss rate of the processed data, and sending the processed data to other block units according to the information loss rate to be used as a response to the read request;
if the information loss rate beta of the data X is larger than the parameter corresponding to the importance p, the processed data S cannot be sent to other block units;
if the information loss rate β of the data X is not greater than the parameter corresponding to the importance p, the processed data S can be transmitted to other block units.
2. The blockchain-based data sharing method of claim 1, wherein after consensus is achieved for the data recorded in the common node according to the consensus mechanism recorded in the representative node of the block unit, the data X recorded in the common node is further divided into P parts, wherein P is an integer obtained by rounding up the importance P;
and inputting the divided P part into a data processing model for processing to obtain processed data S.
3. The blockchain-based data sharing method according to claim 1 or 2, wherein a certain number of nodes with strong computing power evaluation values are selected from all nodes of a block unit as representative nodes, and the remaining nodes in the block unit are taken as normal nodes.
4. A blockchain-based data sharing system, comprising: the device comprises a receiving unit, a calculating unit, a writing unit, a consensus unit, a processing unit, a loss calculating unit and a transmitting unit;
the receiving unit receives data to be stored, and the calculating unit calculates the importance of the data to be stored;
bringing a plurality of characteristic values of data to be stored together to form a characteristic set A;
taking the weight of the preset category corresponding to each characteristic value in the characteristic set A as the weight of the characteristic value, and collecting the weights of each characteristic value in the characteristic set A together to form a characteristic weight set V;
obtaining importance p of the data to be stored according to the feature set A and the feature weight set V of the data to be stored;
the writing unit writes the data to be stored into the common node of the block unit, writes the consensus mechanism into the representative node of the block unit, and writes the data processing model into the representative node of the block unit according to the importance of the data to be stored;
the data processing model is as follows
Wherein S is processed data, X α For the alpha-th part of data X stored in a normal node, x= { X 1 、X 2 、…、X α 、…、X P }，X 1 Is part 1 of data X, X 2 Is part 2 of data X, X P P is the P-th part of the data X, P is the importance P rounded up, ω α Alpha part X of data X α Is used for the deformation coefficient of the steel plate,
e is a natural constant, Y α Is a random number, an X α Corresponds to one Y α The method comprises the steps of carrying out a first treatment on the surface of the Responding to the received read requests of other block units, and enabling the consensus unit to perform consensus on the data recorded in the common node of the block unit through a consensus mechanism in the representative node;
after consensus is achieved, the processing unit processes the data recorded in the common node through the data processing model in the representative node of the block unit;
the loss calculation unit calculates the information loss rate of the processed data, and the transmission unit transmits the processed data to other block units according to the information loss rate to be used as a response to the read request;
if the information loss rate beta of the data X is larger than the parameter corresponding to the importance p, the processed data S cannot be sent to other block units;
if the information loss rate β of the data X is not greater than the parameter corresponding to the importance p, the processed data S can be transmitted to other block units.
5. The blockchain-based data sharing system of claim 4, wherein after consensus is achieved for the data recorded in the common node according to the consensus mechanism recorded in the representative node of the blockunit, the data X recorded in the common node is further divided into P parts, wherein P is an integer obtained by rounding up the importance P;
and inputting the divided P part into a data processing model for processing to obtain processed data S.
6. The blockchain-based data sharing system of claim 4 or 5, wherein a certain number of nodes with strong computing power evaluation values are selected from all nodes of a block unit as representative nodes, and the remaining nodes in the block unit are taken as normal nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210496601.0A CN114884977B (en) | 2022-05-09 | 2022-05-09 | Block chain-based data sharing method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210496601.0A CN114884977B (en) | 2022-05-09 | 2022-05-09 | Block chain-based data sharing method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114884977A CN114884977A (en) | 2022-08-09 |
| CN114884977B true CN114884977B (en) | 2023-07-04 |
Family
ID=82673459
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210496601.0A Active CN114884977B (en) | 2022-05-09 | 2022-05-09 | Block chain-based data sharing method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114884977B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110784521A (en) * | 2019-09-30 | 2020-02-11 | 远光软件股份有限公司 | Block chain consensus method, electronic device and storage medium |
| CN111353717A (en) * | 2020-03-05 | 2020-06-30 | 中国工商银行股份有限公司 | System and method for block chain consensus node election |
| CN111680076A (en) * | 2020-04-21 | 2020-09-18 | 广州中科易德科技有限公司 | Block chain consensus method and system based on association rule model training |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| SG11201908982QA (en) * | 2019-03-29 | 2019-10-30 | Alibaba Group Holding Ltd | Managing sensitive data elements in a blockchain network |
| CN110855761B (en) * | 2019-10-29 | 2021-09-21 | 深圳前海微众银行股份有限公司 | Data processing method and device based on block chain system |
| CN111371769B (en) * | 2020-02-27 | 2022-03-08 | 北京链化未来科技有限公司 | Consensus processing method, consensus node, electronic device, and readable storage medium |
| CN112200680B (en) * | 2020-12-03 | 2021-03-05 | 腾讯科技（深圳）有限公司 | Block link point management method, device, computer and readable storage medium |
| CN113992335B (en) * | 2021-12-28 | 2022-03-25 | 广州敏行区块链科技有限公司 | Self-adaptive multi-consensus block chain processing method and system |
-
2022
- 2022-05-09 CN CN202210496601.0A patent/CN114884977B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110784521A (en) * | 2019-09-30 | 2020-02-11 | 远光软件股份有限公司 | Block chain consensus method, electronic device and storage medium |
| CN111353717A (en) * | 2020-03-05 | 2020-06-30 | 中国工商银行股份有限公司 | System and method for block chain consensus node election |
| CN111680076A (en) * | 2020-04-21 | 2020-09-18 | 广州中科易德科技有限公司 | Block chain consensus method and system based on association rule model training |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114884977A (en) | 2022-08-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11270375B1 (en) | Method and system for aggregating personal financial data to predict consumer financial health | |
| US20230139892A1 (en) | Apparatus and method for managing trust-based delegation consensus of blockchain network using deep reinforcement learning | |
| CN109947740B (en) | Performance optimization method and device of block chain system | |
| CN109544332A (en) | A method of the block chain based on user gradation is traded out block | |
| WO2021135449A1 (en) | Deep reinforcement learning-based data classification method, apparatus, device, and medium | |
| CN112163635B (en) | Image classification method, device, server and medium based on deep learning | |
| CN113609113A (en) | User information generation method and device based on power data and electronic equipment | |
| US11763189B2 (en) | Method for tracking lack of bias of deep learning AI systems | |
| WO2023071105A1 (en) | Method and apparatus for analyzing feature variable, computer device, and storage medium | |
| US11902180B2 (en) | Automated decision techniques for controlling resource access | |
| CN114629654A (en) | Trust management mechanism-oriented double-chain block chain and consensus method thereof | |
| WO2023024408A1 (en) | Method for determining feature vector of user, and related device and medium | |
| US11720900B1 (en) | Systems and methods for adaptive learning to replicate peak performance of human decision making | |
| CN117076523B (en) | Local data time sequence storage method | |
| CN114884977B (en) | Block chain-based data sharing method and system | |
| CN114679283A (en) | Block chain data request processing method and device, server and storage medium | |
| CN116860470A (en) | Data transmission method, device, computer equipment and storage medium | |
| CN114969470B (en) | Big data based decision method and system | |
| WO2023035526A1 (en) | Object sorting method, related device, and medium | |
| CN115905358A (en) | Graph neural network-based endogenous security trust mining method and system | |
| CN115099875A (en) | Data classification method based on decision tree model and related equipment | |
| CN115936110A (en) | Federal learning method for relieving isomerism problem | |
| WO2021139437A1 (en) | Method and apparatus for processing event sequence data, and electronic device | |
| CN114329127A (en) | Characteristic box dividing method, device and storage medium | |
| CN114900535B (en) | Data transmission method and system based on block chain |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231226 Address after: Building 801, Building 4, Baoxing Zhihui City, No. 650 Zhoushi Road, Zhongwu Community, Hangcheng Street, Bao'an District, Shenzhen City, Guangdong Province, 518100 Patentee after: Shenzhen Jiaye Co Creation Supply Chain Management Co.,Ltd. Address before: 518100 Room 802, building 4, Baoxing Zhihui City, No. 650, Zhoushi Road, Zhongwu community, Hangcheng street, Bao'an District, Shenzhen City, Guangdong Province Patentee before: Shenzhen JIAYE Industry Development Co.,Ltd. |
|
| TR01 | Transfer of patent right |