CN110008750A - A kind of data-storage system and method with block chain distributed management characteristic - Google Patents
A kind of data-storage system and method with block chain distributed management characteristic Download PDFInfo
- Publication number
- CN110008750A CN110008750A CN201910279772.6A CN201910279772A CN110008750A CN 110008750 A CN110008750 A CN 110008750A CN 201910279772 A CN201910279772 A CN 201910279772A CN 110008750 A CN110008750 A CN 110008750A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- library
- rule
- added
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
Abstract
The invention belongs to document technical field of memory, and in particular to a kind of data-storage system and method with block chain distributed management characteristic, including master node, slave node and hash node；The host node, for distributing management from node and hash node, be also used to monitor the operation information from node and hash node, calculate meet service requirement meet number of nodes, it is that new node is added in system according to rule is added if meeting number of nodes less than preset value；It is described to be also used to verify by inquiry request of the verification information to user, the document data of decryption is fed back into user after being verified for carrying out encryption and distributed storage to document data by Encryption Algorithm from node；The hash node, for storing algorithm, rule and verification information.The present invention can not only carry out encryption storage to document data, and can distribute management and monitoring to each node, improve the safety of data storage.
Description
Technical field
The invention belongs to document technical field of memory, and in particular to a kind of data with block chain distributed management characteristic
Storage system and method.
Background technique
Currently, existing document file management system or the only management of attention paper document or only attention electronic document
Management, in terms of digital document, how major technique emphasis is also utilizing high-tech equipment, such as scanner, high photographing instrument, fastly
Speed forms electronic document, then handles electronic document, and document data carries out Classification Management by treated.
Existing document storage management system, although storage management, the mode of its storage management can be carried out to document
There is to be optimized, the storage mode on single node, once document data is lost, then be difficult to give for change, on the other hand, document is deposited
Each node of storage lacks monitoring, poor so as to cause document storage security, storage efficiency is low.
Summary of the invention
For the defects in the prior art, the present invention provides a kind of data with block chain distributed management characteristic to deposit
Storage system and method can not only carry out encryption storage to document data, and can distribute management and monitoring to each node, mention
The high safety of data storages.
In a first aspect, the present invention provides a kind of data-storage systems with block chain distributed management characteristic, including
Master node, slave node and hash node；
The host node is also used to monitor from node and hashes node for distribution management from node and hash node
Operation information, calculate meet service requirement meet number of nodes, if meeting number of nodes less than preset value, according to addition
Rule is that new node is added in system；
It is described to be also used to pass through for carrying out encryption and distributed storage to document data by Encryption Algorithm from node
Verification information verifies the inquiry request of user, and the document data of decryption is fed back to user after being verified；
The hash node, for storing algorithm, rule and verification information.
Preferably, multiple points of libraries are arranged according to document classification in the host node, and each a point library includes multiple from node.
Preferably, the document classification includes regulation, encyclopedia, e-book, name and testament；Described point of library includes
Regulation point library, encyclopedia point library, e-book point library, name point library and testament divide library.
Preferably, the host node includes that service management unit, node allocation unit, monitoring nodes unit and node are newly-increased
Unit；
The service management unit is managed for the historical information after logging in user information and user；
The node allocation unit, for distributing management from node and hash node；
The monitoring nodes unit, for dispersing from region, performance and these three dimensions of visiting frequency are in same point of library
Node be monitored, and calculate meet service requirement meet number of nodes, if meeting number of nodes less than preset value,
Calculate the required number of nodes for needing to be added；
The node increases unit newly, for regular, the new node of number of nodes needed for dividing library to distribute for described according to being added.
Preferably, the monitoring nodes unit include region monitoring module, performance monitoring module and access monitoring module and
Newly-increased computing module；
The region monitoring module, for dispersing the liveness of all nodes in same point of library of rule monitoring according to region,
And divide the live-vertex quantity in library described in calculating；
The performance monitoring module for monitoring the performance of all nodes in same point of library according to performance rule, and calculates
Performance reaches the performance number of nodes up to standard of default capabilities index in described point of library；
The access monitoring module, for monitoring the access frequency of all nodes in same point of library according to visiting frequency rule
Degree, and calculate the access number of nodes up to standard that visiting frequency in point library reaches default access index；
The newly-increased computing module, for according to live-vertex quantity, performance number of nodes up to standard and access node up to standard
Quantity meets number of nodes by weighting algorithm calculating, and judgement meets whether number of nodes is less than preset value, if it is less,
Calculate the required number of nodes for needing to be added.
Preferably, the node increases unit newly, is specifically used for:
Standby node is grabbed at random from alternative library, and standby node is verified by the way that rule is added, will be verified
Standby node as new node be added described in divide library, judge be added new node whether reach required number of nodes, if not reaching
It arrives, then carries out crawl verifying again and be added, stop grabbing if reaching.
Preferably, the algorithm of the hash node storage includes Encryption Algorithm and weighting algorithm；
The rule of the hash node storage includes that rule, region dispersion rule, performance rule and visiting frequency rule are added
Then.
Second aspect, the present invention provides a kind of date storage methods with block chain distributed management characteristic, are applicable in
A kind of data-storage system with block chain distributed management characteristic described in first aspect, comprising the following steps:
Host node distribution management is from node and hashes node；
Encryption and distributed storage are carried out to document data from node by Encryption Algorithm, by verification information to user's
Inquiry request is verified, and the document data of decryption is fed back to user after being verified；
Hash node stores algorithm, rule and verification information；
Host node monitoring from the operation information of node and hash node, calculate meet service requirement meet number of nodes,
It is that new node is added in system according to rule is added if meeting number of nodes less than preset value.
Preferably, multiple points of libraries are arranged according to document classification in the host node, and each a point library includes multiple from node.
Preferably, it is described calculate meet service requirement meet number of nodes, if meeting number of nodes less than preset value,
It is then that new node is added in system according to rule is added, specifically includes:
Disperse the liveness of all nodes in same point of library of rule monitoring, and enlivening in point library described in calculating according to region
Number of nodes；
The performance of all nodes in same point of library is monitored according to performance rule, and performance reaches default in point library described in calculating
The performance of performance indicator number of nodes up to standard；
The visiting frequency of all nodes in same point of library is monitored according to visiting frequency rule, and is calculated and divided visiting frequency in library
Reach the access number of nodes up to standard of default access index；
According to live-vertex quantity, performance number of nodes up to standard and access number of nodes up to standard, calculated by weighting algorithm
Meet number of nodes, judgement meets whether number of nodes is less than preset value, if it is less, calculating the required node for needing to be added
Quantity；
Standby node is grabbed at random from alternative library, and standby node is verified by the way that rule is added, will be verified
Standby node as new node be added described in divide library, judge be added new node whether reach required number of nodes, if not reaching
It arrives, then carries out crawl verifying again and be added, stop grabbing if reaching.
The embodiment of the present invention can not only carry out encryption storage to document data, and can distribute each node and manage
And monitoring, improve the safety of data storage.
Detailed description of the invention
It, below will be to specific in order to illustrate more clearly of the specific embodiment of the invention or technical solution in the prior art
Embodiment or attached drawing needed to be used in the description of the prior art are briefly described.In all the appended drawings, similar element
Or part is generally identified by similar appended drawing reference.In attached drawing, each element or part might not be drawn according to actual ratio.
Fig. 1 is the structural representation of the data-storage system in the embodiment of the present invention with block chain distributed management characteristic
Figure；
Fig. 2 is the flow chart of the date storage method in the embodiment of the present invention with block chain distributed management characteristic.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are some of the embodiments of the present invention, instead of all the embodiments.Based on this hair
Embodiment in bright, every other implementation obtained by those of ordinary skill in the art without making creative efforts
Example, shall fall within the protection scope of the present invention.
It should be appreciated that ought use in this specification and in the appended claims, term " includes " and "comprising" instruction
Described feature, entirety, step, operation, the presence of element and/or component, but one or more of the other feature, whole is not precluded
Body, step, operation, the presence or addition of element, component and/or its set.
It is also understood that mesh of the term used in this description of the invention merely for the sake of description specific embodiment
And be not intended to limit the present invention.As description of the invention and it is used in the attached claims, unless on
Other situations are hereafter clearly indicated, otherwise " one " of singular, "one" and "the" are intended to include plural form.
It will be further appreciated that the term "and/or" used in description of the invention and the appended claims is
Refer to any combination and all possible combinations of one or more of associated item listed, and including these combinations.
Embodiment one:
The present invention provides a kind of data-storage systems with block chain distributed management characteristic, as shown in Figure 1, including
Master node, slave node and hash node；
The host node is also used to monitor from node and hashes node for distribution management from node and hash node
Operation information, calculate meet service requirement meet number of nodes, if meeting number of nodes less than preset value, according to addition
Rule is that new node is added in system；
It is described to be also used to pass through for carrying out encryption and distributed storage to document data by Encryption Algorithm from node
Verification information verifies the inquiry request of user, and the document data of decryption is fed back to user after being verified；
The hash node, for storing algorithm, rule and verification information.
Host node in the present embodiment is predominantly managed the node of whole system, is managed to user, carries out
Monitoring distribution of node etc.；Classification storage mainly is carried out to document from node, and the inquiry of user is verified and fed back；It dissipates
The various algorithms of the main storage system of column node, rule, verification information etc..For the ease of the storage and management of document, the master
Multiple points of libraries are arranged according to document classification in node, and the document classification includes regulation, encyclopedia, e-book, name, testament
A point of library is established Deng, each document classification, and each to divide lab setting multiple from node, so that building includes three classes node
Whole system frame.Wherein, described point of library includes regulation point library, encyclopedia point library, e-book point library, name point library, loses
Advise point library etc..The slave node of the present embodiment can be divided into public good from node according to purpose is added and manage from node, the public good from
The document data of node storage, can check without payment；Described to manage the document data stored from node, need to pay ability
It checks.
The embodiment of the present invention from node include file encryption unit, document decryption unit, radio unit, storage unit
Deng；
The file encryption unit, the document data to be stored for obtaining user are calculated according to user information by encryption
Method generates public private key pair, and private key is fed back to user, is encrypted by public key to document data, to obtain encrypted text
File data；
The document decryption unit obtains private key according to inquiry request, passes through private key for obtaining the inquiry request of user
Encrypted document data is decrypted, and the document data after decryption is fed back into user；
The storage unit, for storing encrypted document data；
The radio unit, for point library belonging to being sent to encrypted document data other from node.
In the present embodiment, user selects point library to be stored when storing document, according to the classification of document, divides one in library
It is a obtain user's document data to be stored from node after, according to user information (including name, age, registion time, identity card
Number etc.) pass through the public private key pair of Encryption Algorithm (such as RSA, ElGamal, knapsack algorithm Encryption Algorithm) generation user, public and private key
To including public key and private key, public key and private key are uniquely matched, and the file of public key encryption can be decrypted by private key, therefore logical
The cipher mode of public private key pair is crossed, the safety of file storage is improved.Private key is fed back to user by the present embodiment, passes through public key pair
Document data is encrypted, and saves encrypted document data.Document data is lost in order to prevent, the peace of enhancing document storage
Quan Xing not only stores encrypted document data, but also encrypted document data is sent to its of affiliated point library
He stores node.It is stored so as to avoid single node, using distributed storage, improves the safety of document storage
Property.
When user needs to check document data, the inquiry request of user is parsed, the private key of user is obtained, passes through
Document data after private key pair encryption is decrypted, if decryption is unsuccessful, illustrates that private key is wrong, will solution if successful decryption
Document data after close feeds back to user.
The embodiment of the present invention host node includes that service management unit, node allocation unit, monitoring nodes unit, node are new
Increase unit etc.；
The service management unit is managed for the historical information after logging in user information and user.This implementation
User described in example includes document management personnel, general query personnel etc., and each personnel will store or inquire document in system,
The user for being first registered as system is all needed, personal user information need to be filled in registration, such as name, age, registion time, body
Part card number etc..After the user of system, the historical information for the footprints such as user logs in, stores, checking, modifying all will be by one by one
Record.
For distributing management from node and hash node multiple points of libraries are arranged according to document classification, often in node allocation unit
A point of library includes multiple from node.
The monitoring nodes unit, for dispersing from region, performance and these three dimensions of visiting frequency are in same point of library
Node be monitored, and calculate meet service requirement meet number of nodes, if meeting number of nodes less than preset value,
Calculate the required number of nodes for needing to be added.
Wherein, the monitoring nodes unit includes region monitoring module, performance monitoring module, access monitoring module, increases newly
Computing module etc.；
The region monitoring module, for dispersing the liveness of all nodes in same point of library of rule monitoring according to region,
And divide the live-vertex quantity in library described in calculating；
The performance monitoring module for monitoring the performance of all nodes in same point of library according to performance rule, and calculates
Performance reaches the performance number of nodes up to standard of default capabilities index in described point of library；
The access monitoring module, for monitoring the access frequency of all nodes in same point of library according to visiting frequency rule
Degree, and calculate the access number of nodes up to standard that visiting frequency in point library reaches default access index；
The newly-increased computing module, for according to live-vertex quantity, performance number of nodes up to standard and access node up to standard
Quantity meets number of nodes by weighting algorithm calculating, and judgement meets whether number of nodes is less than preset value, if it is less,
Calculate the required number of nodes for needing to be added.
In the present embodiment, each divide the slave node in library with hash node while operation, host node is in terms of three
Operation monitoring is carried out to other nodes in addition to host node.The active degree of the region decentralization principle, i.e., each node is
No to reach requirement, reaching requirement then is active node, and calculates and each divide live-vertex quantity in library.
Whether the performance rule, i.e. residual memory space, the speed of service, network quality etc. touch the mark, if a section
The residual memory space of point is very few, the speed of service is excessively slow, network quality is too poor, then will affect the storage efficiency of system, therefore sentence
Whether the performance of each node of breaking reaches default capabilities index, and calculates and each divide the performance in library number of nodes up to standard.
Visiting frequency rule, that is, the frequency being accessed by the user (such as one day accessed how many times, one week it is accessed how much
It is secondary) whether touch the mark, if the number that a node is accessed by the user is very little, show this node actual use effect compared with
It is small, therefore judge whether the visiting frequency of each node reaches default access index, and calculate and each divide the access in library section up to standard
Point quantity.
By taking a point of library as an example, this divides total node number in library to be 50, and preset value 40, calculating meets meeting for service requirement
Whether number of nodes is greater than 40, if being less than or equal to 40, needs newly-increased node.If setting was more than 5 days, a node is not any
Activity judges the node then for inactive node, and the inactive number of nodes for being computed this point of library is 8, live-vertex quantity A=
42.In aspect of performance, the performance to touch the mark number of nodes B=38 up to standard.In terms of access, the access to touch the mark section up to standard
Point quantity C=39.Then weighting algorithm M=k is used1*A+k2*B+k3* C=0.3*42+0.5*38+0.2*36=12.6+19+
7.2=38.8 is less than preset value 40, then calculates needs so that the number of nodes that meets after being comprehensively considered is 38.8
The required number of nodes being added is 2.
The node increases unit newly, for regular, the new node of number of nodes needed for dividing library to distribute for described according to being added.
The node increases unit newly and is specifically used for:
Standby node is grabbed at random from alternative library, and standby node is verified by the way that rule is added, will be verified
Standby node as new node be added described in divide library, judge be added new node whether reach required number of nodes, if not reaching
It arrives, then carries out crawl verifying again and be added, stop grabbing if reaching.
Rule is added described in the present embodiment, i.e., whether standby node running environment, total capacity reach requirement.It is calculating
After required number of nodes, host node is that this divides library to increase node newly, has then grabbed 3 standby nodes at random out of alternative library, has led to
It crosses addition rule to be verified, there is one to meet the requirements, then this point of library is added in this satisfactory node.Then it grabs again
2 standby nodes are verified by the way that rule is added, have one to meet the requirements, then will the addition of satisfactory this node
This divides library.It joined two, reached required number of nodes, in being off crawl, terminate to allocation flow.
The embodiment of the present invention hashes various algorithms, rule and the verification information of node storage system, and wherein algorithm includes
Encryption Algorithm, weighting algorithm etc., rule include that rule, region dispersion rule, performance rule, visiting frequency rule etc. is added；It tests
Demonstrate,proving information includes public private key pair etc..
In conclusion the system of the present embodiment, can not only carry out encryption storage, and can be to each section to document data
Point distribution management and monitoring, improve the safety and storage efficiency of data storage.
Embodiment two:
A kind of date storage method with block chain distributed management characteristic is present embodiments provided, embodiment is suitable for
A kind of data-storage system with block chain distributed management characteristic described in one, as shown in Figure 2, comprising the following steps:
S1, host node distribution management is from node and hashes node；
S2, from node by Encryption Algorithm to document data carry out encryption and distributed storage, by verification information to
The inquiry request at family is verified, and the document data of decryption is fed back to user after being verified；
S3, hash node store algorithm, rule and verification information；
S4, host node monitoring from the operation information of node and hash node, calculate meet service requirement meet number of nodes
Amount is that new node is added in system according to rule is added if meeting number of nodes less than preset value.
Host node in the present embodiment is predominantly managed the node of whole system, is managed to user, carries out
Monitoring distribution of node etc.；Classification storage mainly is carried out to document from node, and the inquiry of user is verified and fed back；It dissipates
The various algorithms of the main storage system of column node, rule, verification information etc..For the ease of the storage and management of document, the master
Multiple points of libraries are arranged according to document classification in node, and the document classification includes regulation, encyclopedia, e-book, name, testament
A point of library is established Deng, each document classification, and each to divide lab setting multiple from node, so that building includes three classes node
Whole system frame.Wherein, described point of library includes regulation point library, encyclopedia point library, e-book point library, name point library, loses
Advise point library etc..The slave node of the present embodiment can be divided into public good from node according to purpose is added and manage from node, the public good from
The document data of node storage, can check without payment；Described to manage the document data stored from node, need to pay ability
It checks.
The embodiment of the present invention step S2 is specifically included:
User's document data to be stored is obtained, public private key pair is generated by Encryption Algorithm according to user information, by private key
User is fed back to, document data is encrypted by public key, to obtain encrypted document data；
Obtain user inquiry request, private key is obtained according to inquiry request, by the document data after private key pair encryption into
Row decryption, and the document data after decryption is fed back into user；
Store encrypted document data, and by encrypted document data be sent to belonging to point library other from node.
In the present embodiment, user selects point library to be stored when storing document, according to the classification of document, divides one in library
It is a obtain user's document data to be stored from node after, according to user information (including name, age, registion time, identity card
Number etc.) pass through the public private key pair of Encryption Algorithm (such as RSA, ElGamal, knapsack algorithm Encryption Algorithm) generation user, public and private key
To including public key and private key, public key and private key are uniquely matched, and the file of public key encryption can be decrypted by private key, therefore logical
The cipher mode of public private key pair is crossed, the safety of file storage is improved.Private key is fed back to user by the present embodiment, passes through public key pair
Document data is encrypted, and saves encrypted document data.Document data is lost in order to prevent, the peace of enhancing document storage
Quan Xing not only stores encrypted document data, but also encrypted document data is sent to its of affiliated point library
He stores node.It is stored so as to avoid single node, using distributed storage, improves the safety of document storage
Property.
When user needs to check document data, the inquiry request of user is parsed, the private key of user is obtained, passes through
Document data after private key pair encryption is decrypted, if decryption is unsuccessful, illustrates that private key is wrong, will solution if successful decryption
Document data after close feeds back to user.
The embodiment of the present invention step S4 is specifically included:
Disperse the liveness of all nodes in same point of library of rule monitoring, and enlivening in point library described in calculating according to region
Number of nodes；
The performance of all nodes in same point of library is monitored according to performance rule, and performance reaches default in point library described in calculating
The performance of performance indicator number of nodes up to standard；
The visiting frequency of all nodes in same point of library is monitored according to visiting frequency rule, and is calculated and divided visiting frequency in library
Reach the access number of nodes up to standard of default access index；
According to live-vertex quantity, performance number of nodes up to standard and access number of nodes up to standard, calculated by weighting algorithm
Meet number of nodes, judgement meets whether number of nodes is less than preset value, if it is less, calculating the required node for needing to be added
Quantity；
Standby node is grabbed at random from alternative library, and standby node is verified by the way that rule is added, will be verified
Standby node as new node be added described in divide library, judge be added new node whether reach required number of nodes, if not reaching
It arrives, then carries out crawl verifying again and be added, stop grabbing if reaching.
In the present embodiment, each divide slave node in library and hash node while operation, host node disperses from region,
Performance and these three dimensions of visiting frequency carry out operation monitoring to other nodes in addition to host node in same point of library.It is described
Whether the active degree of region decentralization principle, i.e., each node reaches requirement, and reaching requirement then is active node, and calculates every
It is a to divide live-vertex quantity in library.
Whether the performance rule, i.e. residual memory space, the speed of service, network quality etc. touch the mark, if a section
The residual memory space of point is very few, the speed of service is excessively slow, network quality is too poor, then will affect the storage efficiency of system, therefore sentence
Whether the performance of each node of breaking reaches default capabilities index, and calculates and each divide the performance in library number of nodes up to standard.
Visiting frequency rule, that is, the frequency being accessed by the user (such as one day accessed how many times, one week it is accessed how much
It is secondary) whether touch the mark, if the number that a node is accessed by the user is very little, show this node actual use effect compared with
It is small, therefore judge whether the visiting frequency of each node reaches default access index, and calculate and each divide the access in library section up to standard
Point quantity.
By taking a point of library as an example, this divides total node number in library to be 50, and preset value 40, calculating meets meeting for service requirement
Whether number of nodes is greater than 40, if being less than or equal to 40, needs newly-increased node.If setting was more than 5 days, a node is not any
Activity judges the node then for inactive node, and the inactive number of nodes for being computed this point of library is 8, live-vertex quantity A=
42.In aspect of performance, the performance to touch the mark number of nodes B=38 up to standard.In terms of access, the access to touch the mark section up to standard
Point quantity C=39.Then weighting algorithm M=k is used1*A+k2*B+k3* C=0.3*42+0.5*38+0.2*36=12.6+19+
7.2=38.8 is less than preset value 40, then calculates needs so that the number of nodes that meets after being comprehensively considered is 38.8
The required number of nodes being added is 2.
Rule is added described in the present embodiment, i.e., whether standby node running environment, total capacity reach requirement.It is calculating
After required number of nodes, host node is that this divides library to increase node newly, has then grabbed 3 standby nodes at random out of alternative library, has led to
It crosses addition rule to be verified, there is one to meet the requirements, then this point of library is added in this satisfactory node.Then it grabs again
2 standby nodes are verified by the way that rule is added, have one to meet the requirements, then will the addition of satisfactory this node
This divides library.It joined two, reached required number of nodes, in being off crawl, terminate to allocation flow.
In conclusion the method for the present embodiment can not only carry out encryption storage to document data, and can be to each section
Point distribution management and monitoring, improve the safety and storage efficiency of data storage.
Those of ordinary skill in the art may be aware that system and method described in conjunction with the examples disclosed in this document
Step can be realized with electronic hardware, computer software, or a combination of the two, in order to clearly demonstrate hardware and software
Interchangeability generally describes each exemplary composition and step according to function in the above description.These functions are studied carefully
Unexpectedly it is implemented in hardware or software, the specific application and design constraint depending on technical solution.Professional technique people
Member can use different methods to achieve the described function each specific application, but this realization is it is not considered that super
The scope of the present invention out.
In several embodiments provided herein, it should be understood that disclosed method and system can pass through it
Its mode is realized.For example, in addition the division of above step, only a kind of logical function partition can have in actual implementation
Division mode, such as multiple steps can be combined into a step, and a step step can also be split as multiple steps.It can also
The purpose of the embodiment of the present invention is realized to select some or all of step therein according to the actual needs.
Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention., rather than its limitations；To the greatest extent
Pipe present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: its according to
So be possible to modify the technical solutions described in the foregoing embodiments, or to some or all of the technical features into
Row equivalent replacement；And these are modified or replaceed, various embodiments of the present invention technology that it does not separate the essence of the corresponding technical solution
The range of scheme should all cover within the scope of the claims and the description of the invention.
Claims (10)
1. a kind of data-storage system with block chain distributed management characteristic, which is characterized in that including master node, slave node
With hash node；
The host node is also used to monitor the operation from node and hash node for distributing management from node and hash node
Information, calculate meet service requirement meet number of nodes, if meeting number of nodes less than preset value, according to rule is added
New node is added for system；
It is described to be also used to pass through verifying for carrying out encryption and distributed storage to document data by Encryption Algorithm from node
Information verifies the inquiry request of user, and the document data of decryption is fed back to user after being verified；
The hash node, for storing algorithm, rule and verification information.
2. a kind of data-storage system with block chain distributed management characteristic according to claim 1, feature exist
In multiple points of libraries are arranged according to document classification in the host node, and each a point library includes multiple from node.
3. a kind of data-storage system with block chain distributed management characteristic according to claim 2, feature exist
In the document classification includes regulation, encyclopedia, e-book, name and testament；Described point of library includes regulation Fen Ku, hundred
Section's pandect point library, e-book point library, name point library and testament divide library.
4. a kind of data-storage system with block chain distributed management characteristic according to claim 3, feature exist
In the host node includes that service management unit, node allocation unit, monitoring nodes unit and node increase unit newly；
The service management unit is managed for the historical information after logging in user information and user；
The node allocation unit, for distributing management from node and hash node；
The monitoring nodes unit, for dispersing from region, performance and these three dimensions of visiting frequency are to the section in same point of library
Point is monitored, and calculates the number of nodes that meets for meeting service requirement, if meeting number of nodes less than preset value, is calculated
The required number of nodes for needing to be added；
The node increases unit newly, for regular, the new node of number of nodes needed for dividing library to distribute for described according to being added.
5. a kind of data-storage system with block chain distributed management characteristic according to claim 4, feature exist
In the monitoring nodes unit includes region monitoring module, performance monitoring module and access monitoring module and newly-increased computing module；
The region monitoring module for dispersing the liveness of all nodes in same point of library of rule monitoring according to region, and is counted
Divide the live-vertex quantity in library described in calculation；
The performance monitoring module, for monitoring the performance of all nodes in same point of library according to performance rule, and described in calculating
Performance reaches the performance number of nodes up to standard of default capabilities index in point library；
The access monitoring module, for monitoring the visiting frequency of all nodes in same point of library according to visiting frequency rule, and
Calculate the access number of nodes up to standard that visiting frequency in point library reaches default access index；
The newly-increased computing module is used for according to live-vertex quantity, performance number of nodes up to standard and access number of nodes up to standard,
Meet number of nodes by weighting algorithm calculating, judgement meets whether number of nodes is less than preset value, if it is less, calculating needs
The required number of nodes to be added.
6. a kind of data-storage system with block chain distributed management characteristic according to claim 5, feature exist
In, the node increases unit newly, it is specifically used for:
Standby node is grabbed at random from alternative library, and standby node is verified by the way that rule is added, it is standby by what is be verified
It uses node as point library described in new node addition, judges whether the new node being added reaches required number of nodes, if not up to,
Crawl verifying is carried out again to be added, and stops grabbing if reaching.
7. a kind of data-storage system with block chain distributed management characteristic according to claim 1, feature exist
In the algorithm of the hash node storage includes Encryption Algorithm and weighting algorithm；
The rule of the hash node storage includes that rule, region dispersion rule, performance rule and visiting frequency rule is added.
8. a kind of date storage method with block chain distributed management characteristic is suitable for described in any one of claim 1-7
A kind of data-storage system with block chain distributed management characteristic, which comprises the following steps:
Host node distribution management is from node and hashes node；
Encryption and distributed storage are carried out to document data from node by Encryption Algorithm, the inquiry by verification information to user
Request is verified, and the document data of decryption is fed back to user after being verified；
Hash node stores algorithm, rule and verification information；
Host node monitoring from the operation information of node and hash node, calculate meet service requirement meet number of nodes, if
Meet number of nodes less than preset value, is then that new node is added in system according to rule is added.
9. a kind of date storage method with block chain distributed management characteristic according to claim 8, feature exist
In multiple points of libraries are arranged according to document classification in the host node, and each a point library includes multiple from node.
10. a kind of date storage method with block chain distributed management characteristic according to claim 9, feature exist
In, it is described calculate meet service requirement meet number of nodes, if meeting number of nodes less than preset value, advised according to being added
New node then is added for system, specifically includes:
Disperse the liveness of all nodes in same point of library of rule monitoring according to region, and divides the live-vertex in library described in calculating
Quantity；
The performance of all nodes in same point of library is monitored according to performance rule, and performance reaches default capabilities in point library described in calculating
The performance of index number of nodes up to standard；
The visiting frequency of all nodes in same point of library is monitored according to visiting frequency rule, and is calculated visiting frequency in point library and reached
The access number of nodes up to standard of default access index；
According to live-vertex quantity, performance number of nodes up to standard and access number of nodes up to standard, met by weighting algorithm calculating
Number of nodes, judgement meet whether number of nodes is less than preset value, if it is less, calculating the required number of nodes for needing to be added
Amount；
Standby node is grabbed at random from alternative library, and standby node is verified by the way that rule is added, it is standby by what is be verified
It uses node as point library described in new node addition, judges whether the new node being added reaches required number of nodes, if not up to,
Crawl verifying is carried out again to be added, and stops grabbing if reaching.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910279772.6A CN110008750B (en) | 2019-04-09 | 2019-04-09 | Data storage system and method with block chain distributed management characteristic |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910279772.6A CN110008750B (en) | 2019-04-09 | 2019-04-09 | Data storage system and method with block chain distributed management characteristic |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110008750A true CN110008750A (en) | 2019-07-12 |
| CN110008750B CN110008750B (en) | 2021-01-15 |
Family
ID=67170419
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910279772.6A Active CN110008750B (en) | 2019-04-09 | 2019-04-09 | Data storage system and method with block chain distributed management characteristic |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110008750B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111131795A (en) * | 2020-01-20 | 2020-05-08 | 江苏荣泽信息科技股份有限公司 | City safety monitoring platform based on block chain |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160203202A1 (en) * | 2010-12-23 | 2016-07-14 | Mongodb, Inc. | Method and apparatus for maintaining replica sets |
| CN106339475A (en) * | 2016-08-29 | 2017-01-18 | 联众智慧科技股份有限公司 | Distributed storage system for mass data |
| CN107025409A (en) * | 2017-06-27 | 2017-08-08 | 中经汇通电子商务有限公司 | A kind of data safety storaging platform |
| CN108874528A (en) * | 2017-05-09 | 2018-11-23 | 北京京东尚科信息技术有限公司 | Distributed task scheduling storage system and distributed task scheduling storage/read method |
-
2019
- 2019-04-09 CN CN201910279772.6A patent/CN110008750B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160203202A1 (en) * | 2010-12-23 | 2016-07-14 | Mongodb, Inc. | Method and apparatus for maintaining replica sets |
| CN106339475A (en) * | 2016-08-29 | 2017-01-18 | 联众智慧科技股份有限公司 | Distributed storage system for mass data |
| CN108874528A (en) * | 2017-05-09 | 2018-11-23 | 北京京东尚科信息技术有限公司 | Distributed task scheduling storage system and distributed task scheduling storage/read method |
| CN107025409A (en) * | 2017-06-27 | 2017-08-08 | 中经汇通电子商务有限公司 | A kind of data safety storaging platform |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111131795A (en) * | 2020-01-20 | 2020-05-08 | 江苏荣泽信息科技股份有限公司 | City safety monitoring platform based on block chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110008750B (en) | 2021-01-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Shi et al. | Applications of blockchain in ensuring the security and privacy of electronic health record systems: A survey | |
| CN111709056B (en) | Data sharing method and system based on block chain | |
| Wang et al. | Secure and efficient access to outsourced data | |
| Zhu et al. | Dynamic audit services for integrity verification of outsourced storages in clouds | |
| CN111986755A (en) | Data sharing system based on block chain and attribute-based encryption | |
| CN104935590A (en) | HDFS access control method based on role and user trust value | |
| Lin et al. | Policy decomposition for collaborative access control | |
| Xu et al. | EPBC: Efficient public blockchain client for lightweight users | |
| CN108021677A (en) | The control method of cloud computing distributed search engine | |
| CN106326666A (en) | Health record information management service system | |
| CN106356066A (en) | Speech recognition system based on cloud computing | |
| Komlenovic et al. | An empirical assessment of approaches to distributed enforcement in role-based access control (RBAC) | |
| CN115964751A (en) | Data security storage and access control method based on attribute classification and grading | |
| CA3060710A1 (en) | Systems and methods for identity atomization and usage | |
| Azeez et al. | Towards ensuring scalability, interoperability and efficient access control in a multi-domain grid-based environment | |
| CN110008750A (en) | A kind of data-storage system and method with block chain distributed management characteristic | |
| CN110474764A (en) | Ciphertext data set intersection calculation method, device, system, client, server and medium | |
| González-Manzano et al. | ase-PoW: A proof of ownership mechanism for cloud deduplication in hierarchical environments | |
| CN116800541A (en) | Classified and hierarchical access control and access method for flight operation data | |
| Hong et al. | A secure and efficient role-based access policy towards cryptographic cloud storage | |
| Yuan et al. | B-SSMD: a fine-grained secure sharing scheme of medical data based on blockchain | |
| Sifah et al. | Selective sharing of outsourced encrypted data in cloud environments | |
| Wang et al. | Fine-grained task access control system for mobile crowdsensing | |
| CN115459901A (en) | Building Internet of things data management method based on block chain multi-chain and attribute encryption | |
| Muth et al. | ELSA: efficient long-term secure storage of large datasets (full version)∗ |
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 |