CN109842681B - Data management system and method giving consideration to both centralized and distributed characteristics - Google Patents

Data management system and method giving consideration to both centralized and distributed characteristics Download PDF

Info

Publication number
CN109842681B
CN109842681B CN201910097693.3A CN201910097693A CN109842681B CN 109842681 B CN109842681 B CN 109842681B CN 201910097693 A CN201910097693 A CN 201910097693A CN 109842681 B CN109842681 B CN 109842681B
Authority
CN
China
Prior art keywords
node
slave
master node
request information
hash
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
Application number
CN201910097693.3A
Other languages
Chinese (zh)
Other versions
CN109842681A (en
Inventor
谭卓之
谭绍林
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangdong Shaolin Technology Development Co ltd
Original Assignee
Guangdong Shaolin Technology Development Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Guangdong Shaolin Technology Development Co ltd filed Critical Guangdong Shaolin Technology Development Co ltd
Priority to CN201910097693.3A priority Critical patent/CN109842681B/en
Publication of CN109842681A publication Critical patent/CN109842681A/en
Application granted granted Critical
Publication of CN109842681B publication Critical patent/CN109842681B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Storage Device Security (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a data management system and a method considering both centralized and distributed characteristics, wherein the system comprises a slave node, a master node and a hash node; the slave node is used for sending first request information; the master node responds to the first request information, carries out verification according to a preset rule, and adds the slave node into the block chain after the verification is passed; distributing and storing the document data on the slave nodes in the block chain according to a file storage algorithm, and encrypting the stored document data to generate verification data; the hash node is used for sending second request information, the main node also responds to the second request information and carries out verification according to a preset rule, and after the verification is passed, the hash node is added into the block chain; storing the verification data on hash nodes in the blockchain; the effect is as follows: through the management and distribution of the main node to each node, the advantages of centralized management and distributed management are considered, the consumed resources are reduced, and the operation efficiency is higher.

Description

Data management system and method giving consideration to both centralized and distributed characteristics
Technical Field
The invention relates to the technical field of computer application, in particular to a data management system and a data management method giving consideration to both centralized and distributed characteristics.
Background
With the development of computer and internet technologies, the big data era has come, and how to safely store the document data has become an urgent need. In the prior art, document data storage by using a block chain technology appears. The block chain technology is characterized by distributed data storage, point-to-point transmission, a consensus mechanism and an encryption algorithm, and is characterized by decentralization. The original block chain technology consumes huge resources and is low in efficiency due to over-emphasis on decentralization.
Disclosure of Invention
The technical problem solved by the embodiment of the invention is to overcome the defects of huge resource consumption and low efficiency caused by over-emphasis on decentralization in the prior art to a certain extent.
In a first aspect: the embodiment of the invention provides a data management system giving consideration to both centralized and distributed characteristics, which comprises slave nodes, a master node and hash nodes, wherein the slave nodes are connected with the master node through the hash nodes;
the slave node is used for sending first request information, and the first request information is obtained through the input of the slave node;
the master node is configured to:
responding to the first request information, verifying according to a preset rule, and adding the slave node into a block chain after the verification is passed;
distributing and storing the document data on the slave nodes in the block chain according to a file storage algorithm, and encrypting the stored document data to generate verification data;
the hash node is used for sending second request information, and the second request information is obtained through the input of the hash node;
the master node is further configured to:
responding to the second request information, verifying according to a preset rule, and adding the hash node into a block chain after the verification is passed;
storing the verification data on a hash node in the blockchain.
As a preferred technical solution of the present invention, the master node is further configured to monitor an operation condition of each slave node, and automatically add/reduce the number of slave nodes according to the monitoring condition.
As a preferred technical solution of the present invention, the master node further classifies the slave nodes according to the monitoring condition, and labels the slave nodes as special slave nodes and common slave nodes according to the classification condition.
As a preferred technical solution of the present invention, the allocating, by the master node, the document data according to a file storage algorithm specifically includes:
the master node partitions the storage space of the verified slave node and numbers each partition;
the master node performs check calculation on the document data to obtain an intermediate processing value;
the main node conducts complementation calculation on the intermediate processing value and a preset value to obtain a corresponding result value;
the master node stores the document data on the same partition as the number according to the result value.
In a second aspect: an embodiment of the present invention provides a data management method considering both centralized and distributed features, which is applied to the data management system considering both centralized and distributed features in the first aspect, and includes the following steps:
the master node receives first request information, and the first request information is obtained through the input of the slave node;
the master node responds to the first request information, carries out verification according to a preset rule, and adds the slave node into the block chain after the verification is passed;
the main node distributes and stores the document data on the slave nodes in the block chain according to a file storage algorithm, and encrypts the stored document data to generate verification data;
the main node receives second request information, and the second request information is obtained through the input of the hash node;
the main node responds to the second request information, carries out verification according to a preset rule, and adds the hash node into the block chain after the verification is passed;
the master node stores the verification data on hash nodes in the blockchain.
As a preferred technical solution of the present invention, the preset rule is a set consensus specification protocol, and the consensus specification protocol includes a consistency protocol, a checkpoint protocol, and a view change protocol.
As a preferred technical solution of the present invention, the master node monitors the operation condition of each slave node, and automatically adds/reduces the number of slave nodes according to the monitoring condition.
As a preferred technical solution of the present invention, the master node further classifies the slave nodes according to the monitoring condition, and labels the slave nodes as special slave nodes and common slave nodes according to the classification condition.
As a preferred technical solution of the present invention, the allocating, by the master node, the document data according to a file storage algorithm specifically includes:
the master node partitions the storage space of the verified slave node and numbers each partition;
the master node performs check calculation on the document data to obtain an intermediate processing value;
the main node conducts complementation calculation on the intermediate processing value and a preset value to obtain a corresponding result value;
the master node stores the document data on the same partition as the number according to the result value.
By adopting the technical scheme, the method has the following advantages: the invention provides a data management system and a method considering both centralized and distributed characteristics, which divide each node in a block chain network into a slave node, a master node and a hash node according to roles, approve and manage the slave node and the hash node added into the network through the master node, store document data on the slave node in the block chain according to an allocation rule, and store generated verification data on the hash node in the block chain, thereby being different from the completely decentralized characteristic of the traditional block chain.
Drawings
Fig. 1 is a schematic structural diagram of a data management system with both centralized and distributed features according to an embodiment of the present invention;
fig. 2 is a flowchart of a data management method with both centralized and distributed features according to an embodiment of the present invention.
Detailed Description
In order to make the technical problems, technical solutions and advantages of the present invention more apparent, the following detailed description is given with reference to the accompanying drawings and specific examples, which are used for illustrating the present invention and are not intended to limit the scope of the present invention.
Referring to fig. 1, an embodiment of the present invention provides a data management system with both centralized and distributed features, including a slave node, a master node, and a hash node.
The slave node is used for sending first request information, and the first request information is obtained through the input of the slave node.
Specifically, each node in this embodiment is a corresponding server device, the number of the master nodes and the number of the hash nodes are multiple, but each type of node has a limitation of the lowest number and the highest number, and the master nodes and the hash nodes can be added into an enterprise or an individual for distinguishing, where the first request information may be understood as request information sent by a certain slave node to join a block chain, where the request information includes corresponding device information (hardware device of the server), device operating environment information (software information of the server), region information, and the like. For example, the ID of the hardware device, the version information of the software, the memory capacity of the server, the throughput, the response time, the concurrency number, the CPU utilization rate, the network occupation condition, and the like;
when the first request information is applied, the first request information further includes classification information which can be stored in the first request information, for example, the slave nodes can be stored in different banks according to the type of stored document data, such as a setting rule bank, a file bank, an archive bank, an encyclopedia bank, an electronic book bank, a name bank, a will library, various data information and other banks, one bank includes a plurality of slave nodes, the same bank can be used, and the number of the nodes in each bank can be adjusted for safety, fault tolerance, reliability, access efficiency and other factors.
The master node is configured to:
responding to the first request information, verifying according to a preset rule, and adding the slave node into a block chain after the verification is passed;
document data is distributed and stored on slave nodes in the block chain according to a file storage algorithm, and the stored document data is encrypted to generate verification data.
Specifically, it should be noted that the document data herein is a generalized expression, and includes data such as files, pictures, videos, audios, animations, computer programs, compressed files, and various information data, and the source of the data includes data stored in the blockchain itself and uploaded by each slave node on the chain, and the master node authenticates the slave node applying for joining, that is, the slave nodes on the blockchain are authenticated, and similarly, the subsequent hash nodes on the blockchain are authenticated, and the preset rule includes a set consensus and canonical protocol.
The consensus specification protocol includes a consistency protocol, a checkpoint protocol, and a view change protocol, wherein:
the coherency protocol requires that requests from the slave nodes are executed in a certain order on each slave node. The coherence protocol comprises at least three phases: sending request, sequence number assignment and returning result. According to different protocol designs, the method may include the stages of mutual interaction, sequence number confirmation and the like.
The slave node needs to log each time a request is executed. If the log cannot be cleaned in time, system resources are occupied by a large number of logs, system performance and availability are affected, and it needs to be explained that the main problem of processing the log is to distinguish which logs can be cleaned and which logs still need to be reserved.
In the coherence protocol, it is known that the master node has core capabilities such as sequence number assignment, request forwarding, etc. in the whole system, which govern the operation behavior of the system. The role of the view replacement protocol is to replace the master node with a slave node when it cannot continue to perform its duties. Then the view change protocol generally has two triggering modes:
1) triggered by the master node; 2) triggered by the slave node. The embodiment adopts a master node triggering manner, and of course, other embodiments may adopt a slave node triggering manner or a combination manner of the two to perform triggering, which is not limited herein.
After the slave node passes the verification, the master node distributes the document data according to a file storage algorithm, which specifically comprises:
the master node partitions the storage space of the verified slave node (namely, the slave node on the block chain) and numbers each partition;
the master node performs check calculation on the document data to obtain an intermediate processing value;
the main node conducts complementation calculation on the intermediate processing value and a preset value to obtain a corresponding result value;
the master node stores the document data on the same partition as the number according to the result value.
In application, the check calculation is performed by using CRC16 check, the preset value is 16384, that is, a redishash slot algorithm is used, and in other embodiments, a distributed storage algorithm such as a similar consistent hash algorithm may also be used, which is not limited herein, that is, the file storage algorithm is any one of a redishash slot algorithm, a hash algorithm, a consistent hash algorithm, and a consistent hash algorithm based on virtual nodes.
The hash node is used for sending second request information, and the second request information is obtained through the input of the hash node.
Specifically, the second request information may be understood as request information for joining a block chain sent by a hash node, where the request information includes corresponding device information, device operating environment information, region information, and the like.
The master node is further configured to:
responding to the second request information, verifying according to a preset rule, and adding the hash node into the block chain after the verification is passed.
Storing the verification data on a hash node in the blockchain.
Specifically, the way of the hash node performing the verification is similar to the above-mentioned process of the slave node, and is not described herein again.
Hash nodes added into the block chain (namely verified hash nodes) are used by the main node for specially storing generated verification data, the number of the hash nodes is adjustable, the number of the hash nodes which are stored in the verification data of each piece of document data information is adjustable, and the hash nodes are randomly sent to a plurality of hash nodes for storage according to a preset rule. The storage allocation manner of the master node for the verification data is the same as the allocation manner of the master node for the slave nodes, and is not described herein again. It should be noted that the specific generation manner of the verification data is to encrypt the stored document data, the encryption uses the certificate issued by the third party certification authority, and multiple encryptions can be performed, then, the hash value is calculated, and then, the hash value is calculated for other document data one by one as the verification data. Of course, when applied, other encryption algorithms can be introduced, such as: DES (Data Encryption Standard) Encryption algorithm, IDEA (International Data Encryption Algorithm) international Data Encryption algorithm, RSA Encryption algorithm, and DSA (digital Signature Algorithm) digital Signature algorithm, etc.
The above scheme provides a corresponding scheme for adding each node, the quitting scheme of each node is similar to the adding scheme, and the quitting needs the main node to perform approval and management, which is not described herein again.
By the scheme, each node in the block chain network is divided into the slave node, the master node and the hash node according to roles, the slave node and the hash node added into the network are approved and managed by the master node, the document data are stored on the slave node in the block chain according to the distribution rule, and the generated verification data are stored on the hash node in the block chain, so that the method is different from the completely decentralized characteristic of the traditional block chain.
It should be noted that, after the system operates, the master node is further configured to monitor the operating conditions of each slave node and the hash node, and automatically add/reduce the number of nodes according to the monitoring conditions.
The monitoring situation here includes region information, network quality, access frequency, server performance, remaining storage capacity, and conservative situation, for example, the master node determines that all technical indexes of a newly added slave node are better than those of the added slave nodes, and directly adds the new slave node when the total number of the nodes does not exceed a set number, and automatically reduces one slave node with the worst performance when the total number exceeds the set number, but preferably reduces the slave nodes in the same region when there are multiple slave nodes in the same region according to the principle of region dispersion; similarly, when a certain slave node stops operating, the master node will automatically add a new slave node, and after verification, the data of the stopped slave node is redistributed or directly stored in the newly added slave node.
When the document data information is acquired, the document data information is directly acquired from the nodes, then the verification data of a plurality of hash nodes is randomly extracted according to a preset rule, and the document information can be normally acquired through verification.
And the master node also classifies the slave nodes according to the monitoring condition and marks the slave nodes as special slave nodes and common slave nodes according to the classification condition. Therefore, the efficiency can be further improved, and the number of the nodes needing to be identified is further reduced under the condition that the number of the slave nodes is limited, namely, the transaction can be verified and confirmed only by voting of a plurality of special slave nodes; at the same time, the master node may prefer to place the storage of files on a particular slave node.
In another preferred embodiment of the present invention, each request message further includes a respective joining purpose, which is divided into a public service node and an administration node according to different purposes, for example, document data information stored in the public service node can be viewed without paying a fee; and the document data information stored by the management node can be checked only by paying.
Based on the same inventive concept as the data management system giving consideration to both the centralized and distributed features, the embodiment of the present invention further provides a data management method giving consideration to both the centralized and distributed features, which is shown in fig. 2:
s101, the main node receives first request information, and the first request information is obtained through input of the auxiliary node.
Specifically, the first request information may be understood as request information sent from a node to join a blockchain, where the request information includes corresponding device information (hardware device of the server), device operating environment information (software information of the server), region information, and the like. For example, the ID of the hardware device, the version information of the software, the memory capacity of the server, the throughput, the response time, the concurrency number, the CPU utilization rate, the network occupation condition, and the like;
when the first request information is applied, the first request information further includes classification information which can be stored in the first request information, for example, the slave nodes can perform sub-library storage according to the type of stored document data, such as setting sub-libraries of regulations, files, archives, encyclopedia, electronic books, names, will orders, data information, and the like, one sub-library includes a plurality of slave nodes, and the same document data sub-library can be adjusted in number of nodes in each sub-library in consideration of safety, fault tolerance, reliability, access efficiency, and the like.
And S102, the master node responds to the first request information, carries out verification according to a preset rule, and adds the slave node into the block chain after the verification is passed.
Specifically, the master node verifies the slave node applying for joining, wherein the preset rule comprises a set consensus canonical protocol.
The consensus specification protocol includes a consistency protocol, a checkpoint protocol, and a view change protocol, wherein:
the coherency protocol requires that requests from the slave nodes are executed in a certain order on each slave node. The coherence protocol comprises at least three phases: sending request, sequence number assignment and returning result. According to different protocol designs, the method may include the stages of mutual interaction, sequence number confirmation and the like.
The slave node needs to log each time a request is executed. If the logs cannot be cleaned in time, system resources are occupied by a large number of logs, system performance and availability are affected, and it needs to be noted that the main problem of processing the logs is to distinguish the logs which can be cleaned, and the logs still need to be kept.
In the coherence protocol, it is known that the master node has core capabilities such as sequence number assignment, request forwarding, etc. in the whole system, which govern the operation behavior of the system. The role of the view replacement protocol is to replace the master node with a slave node when it cannot continue to perform its duties. Then the view change protocol generally has two triggering modes:
1) triggered by the master node; 2) triggered by the slave node. The embodiment adopts a master node triggering manner, and of course, other embodiments may adopt a slave node triggering manner or a combination manner of the two to perform triggering, which is not limited herein.
S103, the main node distributes and stores the document data on the slave nodes in the block chain according to a file storage algorithm, and simultaneously encrypts the stored document data to generate verification data.
Specifically, after the slave node passes the verification, the master node allocates the document data according to a file storage algorithm, which specifically includes:
the master node partitions the storage space of the verified slave node and numbers each partition;
the master node performs check calculation on the document data to obtain an intermediate processing value;
the main node conducts complementation calculation on the intermediate processing value and a preset value to obtain a corresponding result value;
the master node stores the document data on the same partition as the number according to the result value.
In application, the check calculation is performed by using CRC16 check, the preset value is 16384, that is, a redishash slot algorithm is used, and in other embodiments, a distributed storage algorithm such as a similar consistent hash algorithm may also be used, which is not limited herein, that is, the file storage algorithm is any one of a redishash slot algorithm, a hash algorithm, a consistent hash algorithm, and a consistent hash algorithm based on virtual nodes.
And S104, the main node receives second request information, and the second request information is obtained through the input of the hash node.
Specifically, the second request information may be understood as request information for joining a block chain sent by a hash node, where the request information includes corresponding device information, device operating environment information, region information, and the like.
And S105, the main node responds to the second request information, carries out verification according to a preset rule, and adds the hash node into the block chain after the verification is passed.
Specifically, the way of verifying the hash node is similar to the above-mentioned process of the slave node, and is not described herein again.
S106, the main node stores the verification data on the hash nodes in the block chain.
Specifically, the hash nodes (i.e., verified hash nodes) added to the blockchain are used by the master node to specially store generated verification data, the number of the hash nodes is adjustable, the number of the hash nodes to be stored in the verification data of each piece of document information is adjustable, and the hash nodes are randomly sent to a plurality of hash nodes to be stored according to a preset rule. The storage allocation manner of the master node for the verification data is the same as the allocation manner of the master node for the slave nodes, and is not described herein again. It should be noted that the specific generation manner of the verification data is to encrypt the stored document data, the encryption uses the certificate issued by the third party certification authority, and multiple encryptions can be performed, then, the hash value is calculated, and then, the hash value is calculated for other document data one by one as the verification data. Of course, when applied, other encryption algorithms can be introduced, such as: DES (Data Encryption Standard) Encryption algorithm, IDEA (International Data Encryption Algorithm) international Data Encryption algorithm, RSA Encryption algorithm, and DSA (digital Signature Algorithm) digital Signature algorithm, etc.
The above scheme provides a corresponding scheme for adding each node, the quitting scheme of each node is similar to the adding scheme, and the quitting needs the main node to perform approval and management, which is not described herein again.
By the method, each node in the block chain network is divided into the slave node, the master node and the hash node according to the role, and the master node is used as a center, so that the method is different from the completely decentralized characteristic of the traditional block chain, and the advantages of centralized management and distributed management are taken into consideration.
When the scheme is applied, in order to further improve the operation efficiency, the master node is further configured to monitor the operation conditions of the slave nodes, and automatically add/reduce the number of the slave nodes according to the monitoring conditions.
Specifically, the monitoring conditions include region information, network quality, access frequency, server device performance, remaining storage capacity, and conservation conditions, for example, the master node determines that technical indexes of all aspects of a newly added slave node are superior to those of the added slave nodes, the master node directly adds the new slave node when the total number of the nodes does not exceed a set number, and automatically reduces one slave node with the worst performance when the total number exceeds the set number, but preferably reduces the slave nodes in the same region when a plurality of slave nodes exist in the same region according to a principle of region dispersion; similarly, when a certain slave node stops operating, the master node will automatically add a new slave node, and after verification, the data of the stopped slave node is redistributed or directly stored in the newly added slave node.
And the master node also classifies the slave nodes according to the monitoring condition and marks the slave nodes as special slave nodes and common slave nodes according to the classification condition. Therefore, the efficiency can be further improved, and the number of the nodes needing to be identified is further reduced under the condition that the number of the slave nodes is limited, namely, the transaction can be verified and confirmed only by voting of a plurality of special slave nodes; at the same time, the master node may prefer to place the storage of files on a particular slave node.
Based on the same idea, the master node also divides the hash nodes into special hash nodes and common hash nodes, so that the verification efficiency is improved, and further description is omitted here.
An embodiment of the present invention further provides a computer device, including a processor and a memory connected to the processor, where the memory is used to store a computer program, and the computer program includes program instructions, and the processor is configured to call the program instructions to execute the method described above.
It should be understood that in the present embodiment, the Processor may be a Central Processing Unit (CPU), and the Processor may also be other general purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components, and the like.
The memory may include both read-only memory and random access memory, and provides instructions and data to the processor. The portion of memory may also include non-volatile random access memory.
The computer device of this embodiment executes the method described in the above embodiment, and divides each node in the blockchain network into a slave node, a master node, and a hash node according to roles, and uses the master node as a center, so as to be different from the completely decentralized feature of the conventional blockchain, and take into account the advantages of centralized management and distributed management.
Embodiments of the present invention also provide a computer-readable storage medium, in which a computer program is stored, where the computer program includes program instructions, and the program instructions, when executed by a processor, cause the processor to execute the method according to the first aspect.
The computer readable storage medium may be a memory of the aforementioned computer device, such as a hard disk or a memory of a terminal. The computer readable storage medium may also be an external storage device of the terminal, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like provided on the terminal. Further, the computer-readable storage medium may also include both the memory of the terminal and an external storage device. The computer-readable storage medium is used for storing the computer program and other programs and data required by the terminal.
The computer-readable storage medium of this embodiment performs the method described in the embodiment, which is not described herein again.
Those of ordinary skill in the art will appreciate that the system modules and method steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
Finally, it should be noted that the above description is only a specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention.

Claims (9)

1. A data management system giving consideration to both centralized and distributed characteristics is characterized by comprising slave nodes, a master node and hash nodes;
the slave node is used for sending first request information, and the first request information is obtained through the input of the slave node;
the master node is configured to:
responding to the first request information, verifying according to a preset rule, and adding the slave node into a block chain after the verification is passed;
distributing and storing the document data on the slave nodes in the block chain according to a file storage algorithm, and encrypting the stored document data to generate verification data;
the hash node is used for sending second request information, and the second request information is obtained through the input of the hash node;
the master node is further configured to:
responding to the second request information, verifying according to a preset rule, and adding the hash node into a block chain after the verification is passed;
storing the verification data on a hash node in the blockchain.
2. The data management system according to claim 1, wherein the master node is further configured to monitor the operation status of each slave node, and automatically add/reduce the number of slave nodes according to the monitoring status.
3. The data management system according to claim 2, wherein the master node further classifies the slave nodes according to the monitoring condition and labels the slave nodes as special slave nodes and common slave nodes according to the classification condition.
4. The data management system according to claim 1, wherein the master node distributes the document data according to a file storage algorithm, and specifically includes:
the master node partitions the storage space of the verified slave node and numbers each partition;
the master node performs check calculation on the document data to obtain an intermediate processing value;
the main node conducts complementation calculation on the intermediate processing value and a preset value to obtain a corresponding result value;
the master node stores the document data on the same partition number as the result value according to the result value.
5. A data management method compatible with both centralized and distributed features, which is applied to the data management system compatible with both centralized and distributed features of any one of claims 1 to 4, comprising the steps of:
the master node receives first request information, and the first request information is obtained through the input of the slave node;
the master node responds to the first request information, carries out verification according to a preset rule, and adds the slave node into the block chain after the verification is passed;
the main node distributes and stores the document data on the slave nodes in the block chain according to a file storage algorithm, and encrypts the stored document data to generate verification data;
the main node receives second request information, and the second request information is obtained through the input of the hash node;
the main node responds to the second request information, carries out verification according to a preset rule, and adds the hash node into the block chain after the verification is passed;
the master node stores the verification data on hash nodes in the blockchain.
6. The method as claimed in claim 5, wherein the predetermined rule is a common consensus protocol, and the common consensus protocol includes a consistency protocol, a checkpoint protocol, and a view change protocol.
7. The data management method according to claim 5, wherein the master node monitors the operation of each slave node, and automatically adds/reduces the number of slave nodes according to the monitoring.
8. The method as claimed in claim 7, wherein the master node further classifies the slave nodes according to the monitoring condition and labels the slave nodes as special slave nodes and common slave nodes according to the classification condition.
9. The data management method according to claim 5, wherein the master node distributes the document data according to a file storage algorithm, and specifically includes:
the master node partitions the storage space of the verified slave node and numbers each partition;
the master node performs check calculation on the document data to obtain an intermediate processing value;
the main node conducts complementation calculation on the intermediate processing value and a preset value to obtain a corresponding result value;
the master node stores the document data on the same partition number as the result value according to the result value.
CN201910097693.3A 2019-01-31 2019-01-31 Data management system and method giving consideration to both centralized and distributed characteristics Active CN109842681B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910097693.3A CN109842681B (en) 2019-01-31 2019-01-31 Data management system and method giving consideration to both centralized and distributed characteristics

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910097693.3A CN109842681B (en) 2019-01-31 2019-01-31 Data management system and method giving consideration to both centralized and distributed characteristics

Publications (2)

Publication Number Publication Date
CN109842681A CN109842681A (en) 2019-06-04
CN109842681B true CN109842681B (en) 2021-06-29

Family

ID=66884400

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910097693.3A Active CN109842681B (en) 2019-01-31 2019-01-31 Data management system and method giving consideration to both centralized and distributed characteristics

Country Status (1)

Country Link
CN (1) CN109842681B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114401150B (en) * 2019-09-05 2023-10-20 创新先进技术有限公司 Method for adding node in blockchain network and blockchain system
CN110751560B (en) * 2019-10-22 2022-03-18 中国工商银行股份有限公司 Transaction processing method and device, electronic equipment and readable storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106534273A (en) * 2016-10-31 2017-03-22 中金云金融(北京)大数据科技股份有限公司 Block chain metadata storage system, and storage method and retrieval method thereof
CN109189727A (en) * 2018-09-14 2019-01-11 江西理工大学 A kind of block chain ciphertext cloud storage sharing method based on property broker re-encryption
CN109218391A (en) * 2018-07-16 2019-01-15 哈尔滨工程大学 A method of distributed memory system audit and decentralization based on block chain
CN109271805A (en) * 2018-08-10 2019-01-25 广东工业大学 A kind of storage of data subregion, querying method and system based on block chain

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA3039031C (en) * 2016-10-06 2022-06-21 Mastercard International Incorporated Method and system for identity and credential protection and verification via blockchain

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106534273A (en) * 2016-10-31 2017-03-22 中金云金融(北京)大数据科技股份有限公司 Block chain metadata storage system, and storage method and retrieval method thereof
CN109218391A (en) * 2018-07-16 2019-01-15 哈尔滨工程大学 A method of distributed memory system audit and decentralization based on block chain
CN109271805A (en) * 2018-08-10 2019-01-25 广东工业大学 A kind of storage of data subregion, querying method and system based on block chain
CN109189727A (en) * 2018-09-14 2019-01-11 江西理工大学 A kind of block chain ciphertext cloud storage sharing method based on property broker re-encryption

Also Published As

Publication number Publication date
CN109842681A (en) 2019-06-04

Similar Documents

Publication Publication Date Title
US11115418B2 (en) Registration and authorization method device and system
EP4344130A2 (en) Systems and methods for addressing security-related vulnerabilities arising in relation to off-blockchain channels in the event of failures in a network
US10467096B2 (en) Securely storing data in a dispersed storage network
CN111556120B (en) Data processing method and device based on block chain, storage medium and equipment
US7707248B2 (en) Credit-based peer-to-peer storage
CN108810137A (en) A kind of alliance's block catenary system
US9442671B1 (en) Distributed consumer cloud storage system
CN101411163B (en) System and method for tracking the security enforcement in a grid system
TWI740575B (en) Method, system and device for prioritizing shared blockchain data storage
US9270703B1 (en) Enhanced control-plane security for network-accessible services
US20210176328A1 (en) Management Services for Distributed Computing Architectures Using Rolling Changes
CN110119390B (en) Financial information outsourcing management system based on block chain
CN108319618B (en) Data distribution control method, system and device of distributed storage system
CN111988419A (en) File uploading method, file downloading method, file uploading device, file downloading device, computer equipment and storage medium
CN109842681B (en) Data management system and method giving consideration to both centralized and distributed characteristics
CN113064744A (en) Task processing method and device, computer readable medium and electronic equipment
CN114240433A (en) Data processing method and system based on block chain
WO2020224100A1 (en) Blockchain configuration file processing apparatus, system, and method, and storage medium
CN113806786A (en) Software authorization management method, system, equipment and storage medium
US20220114276A1 (en) Controlling a data network with respect to a use of a distributed database
US10409920B1 (en) Data services for tiered memory
Song et al. A Hybrid Data Security System of Internet of Things
WO2022111658A1 (en) Slice service processing method and apparatus
KR102447063B1 (en) Managing method for blockchain based on enhanced practical byzantine fault tolerance, blockchain system and node apparatus
JP2020135571A (en) Computer system, computer device and lincense management method

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