CN108710681A - File acquisition method, device, equipment and storage medium - Google Patents
File acquisition method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN108710681A CN108710681A CN201810482561.8A CN201810482561A CN108710681A CN 108710681 A CN108710681 A CN 108710681A CN 201810482561 A CN201810482561 A CN 201810482561A CN 108710681 A CN108710681 A CN 108710681A
- Authority
- CN
- China
- Prior art keywords
- node
- memory node
- file
- account book
- memory
- 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
- 238000003860 storage Methods 0.000 title claims abstract description 207
- 238000000034 method Methods 0.000 title claims abstract description 101
- 239000012634 fragment Substances 0.000 claims abstract description 101
- 230000005540 biological transmission Effects 0.000 claims abstract description 22
- 238000001514 detection method Methods 0.000 claims abstract description 11
- 230000011664 signaling Effects 0.000 claims description 24
- 238000004891 communication Methods 0.000 claims description 16
- 238000012545 processing Methods 0.000 claims description 14
- 230000004913 activation Effects 0.000 claims description 6
- 238000009826 distribution Methods 0.000 claims description 4
- 239000004744 fabric Substances 0.000 claims description 3
- 238000012360 testing method Methods 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 13
- 108010069898 fibrinogen fragment X Proteins 0.000 description 10
- 230000004048 modification Effects 0.000 description 9
- 238000012986 modification Methods 0.000 description 9
- 230000006399 behavior Effects 0.000 description 8
- 238000005516 engineering process Methods 0.000 description 6
- 230000003068 static effect Effects 0.000 description 4
- 238000010200 validation analysis Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 3
- 230000001360 synchronised effect Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000004590 computer program Methods 0.000 description 2
- 238000012790 confirmation Methods 0.000 description 2
- 210000004209 hair Anatomy 0.000 description 2
- 230000014759 maintenance of location Effects 0.000 description 2
- 230000008520 organization Effects 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000000151 deposition Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/18—File system types
- G06F16/182—Distributed file systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/13—File access structures, e.g. distributed indices
- G06F16/134—Distributed indices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/16—File or folder operations, e.g. details of user interfaces specifically adapted to file systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/17—Details of further file system functions
- G06F16/172—Caching, prefetching or hoarding of files
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
This application discloses a kind of file acquisition method, device, equipment and storage mediums, belong to network field.The method includes:The second memory node into distributed file storage system sends the first account book;Instruction is established in the connection for receiving the transmission of the second memory node;Instruction is established according to connection and the second memory node establishes connection, and the unique identifying information of demand file segment is sent to the second memory node;The demand file segment of the second memory node transmission is received, and merges and obtains demand file.After the application detects the first account book of the first memory node by the second memory node, demand file segment is sent to the first memory node, due to including operation note of first memory node to the file fragment stored in distributed file storage system in the first account book, therefore the second memory node can judge whether first node is validated user according to the first account book of detection, on the basis of realizing door chain, the mortality that file is downloaded and/or accessed due to reducing validated user improves the fluency that user obtains file.
Description
Technical field
This application involves network technique field, more particularly to a kind of file acquisition method, device, equipment and storage medium.
Background technology
The unified resource positioning for the file (or service) that bad service provider would generally provide other service providers
It accords in (Uniform Resource Locator, URL) storage to the database of oneself, when user accesses bad service provider
The network platform when, the URL for the file for accessing and/or downloading is the URL of stolen chained file.
In the related technology, the file issued in the network platform in order to prevent is stolen chain, and service provider would generally be indefinite
Filename is changed to phase to prevent file to be stolen chain, can correspondingly change the URL of stolen chained file due to changing filename,
The URL failures that can lead to the stolen chained file of bad service provider's storage, to realize the purpose of door chain.
Aperiodically modification filename can be such that URL is changed, when validated user is in access and/or download file,
The URL of this document can lead to the access of validated user by modification and/or download behavior failure.
Invention content
The embodiment of the present application provides a kind of file acquisition method, device, equipment and storage medium, can be used for solving phase
It prevents file to be stolen chain using aperiodically modification filename in the technology of pass, validated user is caused to access and/or download file
The problem of failure.The technical solution is as follows:
On the one hand, the embodiment of the present application provides a kind of file acquisition method, and the method is deposited applied to distributed document
In first memory node of storage system, the method includes:
The second memory node into the distributed file storage system sends the first account book;The distributed document is deposited
Account book is stored in memory node in storage system, the account book includes the memory node to being stored in the distributed document
The operation note that file fragment in storage system is operated, first account book are stored in first memory node
The account book;
It receives the connection that second memory node is sent and establishes instruction, it is second storage that instruction is established in the connection
Node is sent after determining first account book and the matching of the second account book, and second account book deposited in second memory node
The account book of storage;
Instruction is established according to the connection and second memory node establishes connection, is sent to second memory node
The unique identifying information of demand file segment;
The demand file segment that second memory node is sent is received, and merges and obtains demand file;The need
It is that second memory node is obtained according to the unique identifying information in local search to seek file fragment.
On the one hand, the embodiment of the present application provides a kind of file acquisition device, and described device is deposited applied to distributed document
In first memory node of storage system, described device includes:
Sending module sends the first account book for the second memory node into the distributed file storage system;Institute
It states and is stored with account book in the memory node in distributed file storage system, the account book includes the memory node to being stored in
The operation note that file fragment in the distributed file storage system is operated, first account book are described first to deposit
The account book stored in storage node;
Receiving module establishes instruction for receiving the connection that second memory node is sent, and instruction is established in the connection
Second memory node is sent after determining first account book and the matching of the second account book, and second account book is described the
The account book stored in two memory nodes;
The sending module is additionally operable to establish instruction according to the connection and second memory node establishes connection, to
Second memory node sends the unique identifying information of demand file segment;
The receiving module is additionally operable to receive the demand file segment that second memory node is sent;The need
It is that second memory node is obtained according to the unique identifying information in local search to seek file fragment;
Processing module is used for and closes the demand file segment and obtains demand file.
On the one hand, the embodiment of the present application provides a kind of file acquisition device, and described device is deposited applied to distributed document
In the second memory node in storage system, described device includes:
Receiving module, the first account for receiving the transmission of the first memory node in the distributed file storage system
This;Account book is stored in memory node in the distributed file storage system, the account book includes the memory node pair
The operation note that the file fragment being stored in the distributed file storage system is operated, first account book is described
The account book stored in first memory node;
Sending module is sent if being matched for first account book and second account book to first memory node
Instruction is established in connection, and the connection foundation instruction is used to indicate first memory node and second memory node is established and connected
It connects, second account book is the account book stored in second memory node;
Processing module is connected for being established with first memory node;
The receiving module is additionally operable to receive the unique identification letter for the demand file segment that first memory node is sent
Breath;
Sending module is additionally operable to send demand file segment to first memory node;The demand file segment is
It is obtained in local search according to the unique identifying information.
On the one hand, the embodiment of the present application provides a kind of electronic equipment, and the electronic equipment includes processor and memory,
At least one instruction is stored in the memory, at least one instruction is loaded by the processor and executed to realize such as
The upper file acquisition method.
On the one hand, it includes processor and memory that the embodiment of the present application, which provides electronic equipment described in a kind of electronic equipment,
At least one instruction is stored in the memory, at least one instruction is loaded by the processor and executed to realize such as
The upper file memory method.
On the one hand, the embodiment of the present application provides a kind of computer readable storage medium, the computer-readable storage medium
At least one instruction is stored in matter, at least one instruction is loaded by processor and executed to realize file acquisition as described above
Method.
On the one hand, the embodiment of the present application provides a kind of computer readable storage medium, the computer-readable storage medium
At least one instruction is stored in matter, at least one instruction is loaded by processor and executed to realize file storage as described above
Method.
The advantageous effect that technical solution provided by the embodiments of the present application is brought is at least:
By detecting that the first account book of the first memory node is and the in the second memory node when the second memory node
When two account books match, demand file segment is sent to the first memory node, due to including the first memory node pair in the first account book
The operation note of the file fragment stored in distributed file storage system, therefore the second memory node can be according to judging the first account
Whether this matches to judge whether first node is validated user in distributed file storage system with the second account book, solves
In the related technology by irregularly change filename door chain may caused by validated user access and/or download behavior
The mortality of file is downloaded due to reducing validated user and/or accessed to the problem of failure on the basis of realizing door chain,
Improve the fluency that user obtains file.
Description of the drawings
In order to more clearly explain the technical solutions in the embodiments of the present application, make required in being described below to embodiment
Attached drawing is briefly described, it should be apparent that, the accompanying drawings in the following description is only some embodiments of the present application, for
For those of ordinary skill in the art, without creative efforts, it can also be obtained according to these attached drawings other
Attached drawing.
Fig. 1 is the schematic diagram of the implementation environment for the file acquisition method that one exemplary embodiment of the application provides;
Fig. 2 is the method flow diagram for the file acquisition method that one exemplary embodiment of the application provides;
Fig. 3 is the framework of a specific embodiment of the file acquisition method that one exemplary embodiment of the application provides
Figure;
Fig. 4 is the method flow diagram for the file acquisition method that one exemplary embodiment of the application provides;
Fig. 5 is the method flow diagram for the file acquisition method that one exemplary embodiment of the application provides;
Fig. 6 is the framework of a specific embodiment of the file acquisition method that one exemplary embodiment of the application provides
Figure;
Fig. 7 is the method flow diagram for the file acquisition method that one exemplary embodiment of the application provides;
Fig. 8 is the method flow diagram for the file memory method that one exemplary embodiment of the application provides;
Fig. 9 is the framework of a specific embodiment of the file memory method that one exemplary embodiment of the application provides
Figure;
Figure 10 is a specific embodiment of file storage and acquisition methods that one exemplary embodiment of the application provides
Organization Chart;
Figure 11 is the device block diagram for the file acquisition device that one exemplary embodiment of the application provides;
Figure 12 is the device block diagram for the file acquisition device that one exemplary embodiment of the application provides;
Figure 13 is the device block diagram for the electronic equipment that one exemplary embodiment of the application provides;
Figure 14 is the device block diagram for the electronic equipment that one exemplary embodiment of the application provides.
Specific implementation mode
To keep the purpose, technical scheme and advantage of the application clearer, below in conjunction with attached drawing to the application embodiment party
Formula is described in further detail.
In order to facilitate understanding, the noun involved in the embodiment of the present application is explained below:
Distributed file storage system:It is that a file division is stored at least two electronics at multiple file fragments to set
Storage system in standby;Or, multiple subfiles of a file are stored at least two electronic equipments;The application is stating
It is middle that file fragment and subfile are referred to as file fragment.Optionally, the distributed file storage system in the application is interspace
File system.
Memory node:It is the electronic equipment of storage file segment in distributed file storage system, in each memory node
It is stored with account book.
Index node:It is that the electronics of the operation note that each file fragment is stored in distributed file storage system is set
Standby, each index node is stored with the unique identifying information for the file for being stored into distributed file storage system and total account book.
Wherein, the operation note of each file fragment refer in distributed file storage system each memory node to being stored in distribution
The operation note of file fragment in document storage system, memory node can be inquired by index node and be stored with demand file
Other memory nodes of segment;Optionally, the index node in distributed storage node may be constructed block platform chain, each rope
It can be the block chain node in block platform chain to draw node.Illustratively, in the embodiment of the present application, it is with block platform chain
Example, refers to the index node of distributed file storage system.
Interspace file system (Inter Planetary File System, IPFS):Be one towards the whole world, point pair
The distributed file storage system of point.
Account book:It is that the operation that memory node operates the file fragment being stored in distributed file storage system is remembered
Record.Optionally, account book include send inventory, obtained inventory, modification inventory, delete inventory, do not complete inventory at least one
Kind.Send the operation note that inventory is the file fragment that memory node is sent to other memory nodes comprising memory node is sent out
The unique identifying information of the file fragment sent and the device identification of sending object;Obtained inventory be memory node from other
The operation note for the file fragment that memory node obtains comprising file fragment unique identifying information that memory node has obtained,
It sends the device identification of the memory node of this document segment and this document segment is modified, sends and/or received
The device identification of memory node;Modification inventory is the unique identifying information for the file fragment that memory node was changed;Delete inventory
Be memory node once obtained but the unique identifying information of file fragment deleted;Unfinished inventory is that memory node is rung
It answers the acquisition of other memory nodes to ask, but does not complete the unique identifying information of the file fragment sent.
For example, memory node 1 has sent file fragment A to memory node 2, the file fragment that memory node 3 is sent is received
B has modified file fragment C, deletes file fragment D, needs to send file E to memory node 4, then the account book 1 of memory node 1
Send inventory in comprising file fragment A unique identifying information and memory node 2 device identification;The acquisition of account book 1 is clear
The device identification of unique identifying information and memory node 3 comprising file fragment B in list;The modification inventory of account book 1 includes file
The unique identifying information of the unique identifying information of segment C and/or modified file fragment C;The deletion inventory of account book 1 includes text
The unique identifying information of part segment D;Include the unique identifying information of file fragment E in the unfinished inventory of account book 1.
Device identification:It is the number-mark of memory node and index node in distributed file storage system, it is distributed
Any memory node or index node in document storage system can be set by device identification electronics corresponding with the device identification
It is standby to establish connection.
Unique identifying information:It is unique coding letter corresponding to the file fragment that is stored in distributed file storage system
Breath, memory node can generate the unique identifying information of this document segment according to file fragment.Wherein, each file or file fragment
Unique identifying information be unique.Optionally, in distributed file storage system, unique identification can be file and text
The cryptographic Hash of part segment refers to the unique identifying information of file and file fragment in following description by taking cryptographic Hash as an example.
Block platform chain:It is the network platform being made of the index node in distributed memory system, in block platform chain
In, index node is referred to as block chain node, and each block chain node is stored with the text for being stored into distributed file storage system
The cryptographic Hash of part and total account book.Block platform chain includes that the index node of at least two communication connections is constituted, each index section
Point is a block chain node in block platform chain, and each block chain node is stored with total account book of block platform chain.At least
The total account book respectively stored is synchronized by wired or wireless network between two block chain nodes.Block platform chain and distribution text
At least one memory node communication connection, receives at least one memory node in distributed file storage system in part storage system
The account book of transmission.
Total account book:It is the account book of each memory node in distributed file storage system, it includes deposit distributed documents
Operation note, the device identification of each memory node and the account book of the memory node of each file fragment in storage system
Content.
Leader node (Leader Node):It is the block chain node being responsible in block platform chain with memory node communication.Neck
Leading node is elected from the block chain node for the storage request that response memory node is sent to block platform chain.
Referring to FIG. 1, the implementation environment of the file acquisition method provided it illustrates one exemplary embodiment of the application
Schematic diagram, as shown in Figure 1, the implementation environment includes block platform chain 100 and distributed file storage system 200.
As shown, block platform chain 100 includes multiple block chain nodes 110,111,112,113,114,115 etc.,
Each block chain node is stored with total account book of block platform chain, and multiple block chain nodes can be synchronized by wired or wireless network
Total account book.
For example, when the total account book stored in block chain node 110 changes, block chain node 110 is flat to block chain
Total account book in platform 100 after other block chain node broadcasts changes updates it and deposits after other block chain nodes receive the broadcast
Total account book of storage.Wherein, total account book includes each memory node in distributed file storage system 200 to distributed document
The operation note of the file stored in storage system 200, block platform chain 100 by in distributed file storage system 200
Memory node communication connection obtain memory node send account book, distributed document is deposited to obtain each memory node
The operation note of the file stored in storage system 200.
Distributed file storage system 200 includes multiple memory nodes 210,211,212,213,214 etc., and user can incite somebody to action
Need the file destination stored that at least two file destination segments is divided into be stored at least two memory nodes.Distributed text
Each of part storage system 200 storage section is stored with the memory node account book of itself.
For example, memory node 210 has sent file fragment X to memory node 211, then in the account book of memory node 210
Transmission inventory in be stored with the cryptographic Hash of file fragment X and the device identification of memory node 211, indicate to memory node
211 send file fragment X;Meanwhile the Hash that file fragment X is stored in inventory is obtained in the account book of memory node 211
The device identification of value and memory node 210 indicates to obtain file fragment X from memory node 210.Memory node is to file fragment
It is operated, such as sends file fragment, or modified, delete, replicate to file fragment, it is right in account book to be all recorded in
Account book is updated, and updated account book is sent in the form of broadcasting to block platform chain 100, in block platform chain 100
After at least one block chain node receives updated account book, total account book to being stored in the node is updated, and to its
His updated total account book of block chain node broadcasts so that the total account book preserved on each block chain node is synchronous and consistent
's.
Referring to FIG. 2, the method flow of the file acquisition method provided it illustrates one exemplary embodiment of the application
Figure.This method can be applied in the first memory node of the distributed storage node in implementation environment as shown in Figure 1, this method
Including:
Step 201, the second memory node into distributed file storage system sends the first account book.
First memory node sends the first account book to the second memory node.Usually, the first memory node is at least two
A second memory node sends the first account book, but on other occasions, for example, only remaining a file in the first memory node
Segment fails to get, and when having got other file fragments, and the first account book is sent to second memory node.
Optionally, in the first account book comprising the first memory node to the file fragment that is stored in distributed file storage system
Operation note.For example, the first memory node has received the file fragment X of third memory node transmission, and the first memory node
Modification is made that file fragment X, then having obtained in the first account book is stored with the unique identification letter of file fragment X in inventory
The device identification of breath and third memory node;The unique identification of file fragment X is stored in the modification inventory of the first account book
The unique identifying information of information and/or modified file fragment X.
It should be noted that memory node either acquisition request file fragment memory node, can also be send
The memory node of file fragment or storage file segment is referred to only for the difference in statement in the application with the first memory node
For the memory node of acquisition request file fragment, is referred to the second memory node and send depositing for file fragment and storage file segment
Store up node.
Step 202, it receives the connection that the second memory node is sent and establishes instruction, it is the second storage section which, which establishes instruction,
It is sent after determining first account book of point and the matching of the second account book.
First memory node receives the connection that the second memory node is sent and establishes instruction.
Illustratively, after receiving the first account book, whether the first account book of detection saves the second memory node with the second storage
The the second account book matching stored in point sends connection to the first memory node and establishes if the first account book and the matching of the second account book
Instruction, the connection establish instruction and are used to indicate the first memory node and the foundation connection of the second memory node.
First account book and the matching of the second account book refer to the operation behavior and the of the first memory node recorded in the second account book
The operation behavior of the first memory node recorded in one account book is identical.
For example, if file fragment Y is sent to the storage section of the third in distributed file storage system by the first memory node
After point, the third account book that is stored in third memory node has obtained the unique identifying information that file fragment Y can be recorded in inventory
And first memory node device identification;After if file fragment Y is sent to the second memory node by third memory node, the
The device identification for having obtained unique identifying information, third memory node that file fragment Y can be recorded on inventory of two account books and
The device identification of first memory node;Therefore, when having sent for the first account book has recorded the unique identification of file fragment Y on inventory
The device identification of information and third memory node, and the record on inventory that obtained of the second account book has unique knowledge of file fragment Y
Other information, the device identification of third memory node and the device identification of the first memory node illustrate to record in the first account book
First memory node to recorded in the operation of file fragment Y (sending file fragment Y to third node) and the second account book the
(i.e. the second memory node receives file fragment Y, third storage section from third memory node for operation of one node to file fragment Y
O'clock from the first memory node receive file fragment Y) be it is matched, therefore the first account book and the second account book matching.
Optionally, it is that the second memory node determines the first account book and the matching of the second account book, and first deposits to establish link order
The debt ratio of storage node is not higher than sending after debt ratio threshold value.Debt ratio is used to indicate the first memory node and needs to distribution
Memory node is sent, but the ratio that the file fragment not sent is shared in the file fragment that the first memory node transmits.
Illustratively, the second memory node is after determining the first account book and the matching of the second account book, according in the first bill
The file fragment number in inventory and the file fragment data in unfinished inventory have been sent, the first memory node is calculated
Debt ratio.If the debt ratio is higher than debt ratio threshold value, it is determined that the first memory node is node of doing evil, and stops saving with the first storage
The communication of point;If the debt ratio is not higher than debt ratio threshold value, link order is established to the transmission of the first memory node.Wherein, make
It refers to the higher memory node of debt ratio to dislike node.The usual higher node of debt ratio is normally present the storage section of the system failure
Point, node of doing evil can send the account book of mistake to other memory nodes, or, after the transmission request for having responded other memory nodes
There is no the file fragments for sending the request of other memory nodes.
Step 203, instruction is established according to connection and the second memory node establishes connection, demand is sent to the second memory node
The unique identifying information of file fragment.
First memory node establishes link order and the foundation connection of the second memory node according to what the second memory node was sent
Afterwards, the unique identifying information of demand file segment is sent to the second memory node.Optionally, unique knowledge of the demand file segment
Other information is the cryptographic Hash of demand file segment.
Illustratively, after the first memory node and the second memory node establish connection, if the first memory node demand
For demand file segment A, demand file segment B and demand file segment C, then the first memory node is sent out to the second memory node
Send the unique identifying information of demand file segment A, the unique identifying information of demand file segment B and demand file segment C
Unique identifying information.
Step 204, the demand file segment that the second memory node is sent is received, and merges and obtains demand file.
First memory node receives the demand file segment that the second memory node is sent, and demand file segment, which is merged into, to be needed
Seek file.
Illustratively, the second memory node receives the unique identifying information of demand file segment A, demand file segment B
Unique identifying information and demand file segment C unique identifying information after, according to the unique of the demand file segment of acquisition
Whether identification information is stored with demand file segment A, demand file piece by the way that the inventory of the acquisition detection in the second account book is local
Section B and/or demand file segment C sends demand file if demand file segment A has been locally stored to the first memory node
Segment A;If demand file segment A and demand file segment B has been locally stored, demand file is sent to the first memory node
Segment A and demand file segment B;If demand file segment A and demand file segment C has been locally stored, deposited to first
It stores up node and sends demand file segment A and demand file segment C;If demand file segment B and demand text has been locally stored
Part segment C then sends demand file segment B and demand file segment C to the first memory node.First memory node receives
Demand file segment A, the demand file segment B and demand file segment C that at least two second memory nodes are sent, by demand
File fragment A, demand file segment B and demand file segment C merge into demand file.
Fig. 3 is the framework of a specific embodiment of the file acquisition method that one exemplary embodiment of the application provides
Figure.As shown, the user B in distributed file storage system initializes the account book of itself first in step 1;In step 2
It is middle to memory node send public information and itself account book, wherein public information be used for block platform chain broadcasting user B with
Data exchange will occur for memory node;In step 3, memory node judges whether the account book of user B and the account book of itself match;
In step 4, memory node judges that the account book of user B is established and connected with user B with after the account book matching of itself;In step 5
In, user B sends demand inventory to memory node;In step 6, whether memory node detection is local is stored with demand inventory
In content;In step 7, memory node calculates the debt ratio of user B;In step 8, when being stored with demand in memory node
The debt ratio of content and user B in inventory is not high, and memory node sends the content of user's B demands to user B.
In conclusion in the embodiment of the present application, by the first account for detecting the first memory node when the second memory node
Originally it is demand file segment to be sent to the first memory node, due to first when being matched with the second account book in the second memory node
Include operation note of first memory node to the file fragment stored in distributed file storage system, therefore second in account book
Memory node can according to judge the first account book whether with the second account book match to judge whether first node is distributed document
Validated user in storage system is solved and caused may be closed by irregularly changing filename door chain institute in the related technology
The problem of access and/or download behavior failure of method user, on the basis of realizing door chain, due to reducing under validated user
The mortality for carrying and/or accessing file improves the fluency that user obtains file.
Optionally, the second memory node in the embodiment of the present application calculates the debt of the first memory node by the first account book
Rate sends connection to the first memory node and establishes instruction, avoid node of doing evil and account for when debt ratio is not higher than debt ratio threshold value
With the resource of distributed file storage system, the working efficiency of distributed file storage system is improved.
Since each file is stored on multiple second memory nodes, when the first memory node needs to obtain demand file
When, the first memory node can be inquired by block platform chain corresponding at least two second memory node of the demand file (
It is stored with the second memory node of demand file segment), connect to send the first account book at least two memory nodes and establish
It connects.Wherein, block platform chain is communicated to connect at least one memory node in distributed file storage system, obtains distributed text
The account book of at least one node broadcasts in part storage system.The embodiment of Fig. 3 will pass through block platform chain to the first memory node
Determine that corresponding at least two second memory node of demand file illustrates.
Referring to FIG. 3, the method flow of the file acquisition method provided it illustrates one exemplary embodiment of the application
Figure.This method can be applied in the first memory node of the distributed storage node in implementation environment as shown in Figure 1, this method
The step of before being Fig. 1 embodiment steps 201, this method includes:
Step 301, the cryptographic Hash of demand file segment is sent to block platform chain.
Cryptographic Hash of first memory node to block platform chain broadcast requests file fragment.Wherein, block platform chain with point
At least one memory node communication connection, obtains at least one section in distributed file storage system in cloth document storage system
The account book of point broadcast.
Block platform chain is stored with total account book, which includes each file being stored in distributed file storage system
Operation note comprising store the cryptographic Hash to the file in distributed file storage system, storage is deposited to distributed document
It is stored in each memory node in the cryptographic Hash of the corresponding file fragment of file in storage system, distributed file storage system
The device identification of account book and the corresponding memory node of each account book.
Illustratively, the memory node 1 in distributed file storage system, which stores file Z storages to distributed document, is
It, can be in the cryptographic Hash of block platform chain registration documents Z, since file Z deposit distributed file storage systems need to divide when in system
It is segmented into file fragment M and file fragment N, and by file fragment M deposit memory nodes 2, file fragment M is stored in memory node
In 3, then record has the device identification of the corresponding memory node of the cryptographic Hash of file Z, the cryptographic Hash of file Z 1, file in total account book
The correspondence and file fragment of Z and file fragment M, the correspondence of file fragment N, file fragment M and memory node 2
The correspondence of N and memory node 3.
Illustratively, if the first memory node demand is demand file X, to one block chain node of block platform chain
Send the name of demand file X, the name query of block chain node file X according to demand is to the Kazakhstan of corresponding demand file X
The cryptographic Hash of uncommon value and the corresponding demand file segment A of demand file X, demand file segment B and demand file segment C,
The cryptographic Hash of demand file segment A, demand file segment B and demand file segment C are sent to the first memory node, first deposits
Storing up node, that the cryptographic Hash of demand file segment A, demand file segment B and demand file segment C is recorded in demand file is clear
Dan Zhong.
First memory node is to the cryptographic Hash of block platform chain broadcast requests file fragment A, the Kazakhstan of demand file segment B
Value and the cryptographic Hash of demand file C are wished, a block chain node in block platform chain responds the broadcast of the first memory node
, the device identification for the second memory node 4 for being stored with demand file segment A is inquired on total account book, is stored with demand text
The device identification of the second memory node 5 of part segment B and demand segment C.
Step 302, the device identification at least two second memory nodes that block platform chain is sent is received.
First memory node receives the device identification at least two second memory nodes that block platform chain is sent.
Illustratively, if block platform chain inquires the second memory node 4 and is stored with demand file segment A, the second storage
Node 5 is stored with demand file segment B and demand file segment C, then sends the second memory node 4 and the to the first memory node
The device identification of two memory nodes 5.
Step 303, it according to the device identification of at least two second memory nodes, is sent at least two second memory nodes
First account book.
First memory node is according to the device identifications of at least two second memory nodes, at least two second memory nodes
Send the first account book.
Illustratively, the first memory node is in the second memory node 4 and second storage for receiving the transmission of block platform chain
After the device identification of node 5, the first account book is sent to the second memory node 4 and the second memory node 5.
In conclusion in the embodiment of the present application, the first memory node to block platform chain by sending demand file segment
Cryptographic Hash, block platform chain according to demand inquire in general ledger and be stored at least the two of demand file segment by the cryptographic Hash of segment
A second memory node sends the device identification of at least two second memory nodes to the first memory node, to make first to deposit
Storage node accurately can establish connection at least two second memory nodes for being stored with demand file segment.
Referring to FIG. 5, the method flow of the file acquisition method provided it illustrates one exemplary embodiment of the application
Figure.This method can be applied in the first memory node of the distributed storage node in implementation environment as shown in Figure 1, this method
The step of being after Fig. 1 embodiment steps 204, this method includes:
Step 401, the cryptographic Hash for the demand file segment that the second memory node is sent is received.
While second memory node sends demand file segment to the first memory node, the demand file segment is sent
Cryptographic Hash.
Step 402, the cryptographic Hash of the demand file segment sent according to the second memory node, detection the second memory node hair
Whether the demand file segment sent is that the first memory node needs the demand file segment obtained.
The cryptographic Hash for the demand file segment that first memory node is sent according to the second memory node, by the first account book
Demand inventory, whether the demand file segment that the second memory node of detection is sent is that the first memory node needs the demand that obtains
File fragment.
Step 403, however, it is determined that the demand file segment that the second memory node is sent is that the first memory node needs obtain
Demand file segment then deletes the cryptographic Hash of demand file segment from demand inventory, and by the Hash of demand file segment
Value, which is added to, have been obtained in inventory, and updated first account book is obtained.
If the demand file piece stored in the cryptographic Hash and demand inventory of the demand file segment that the second memory node is sent
The Hash values match of section, it is determined that the demand file segment that the second memory node is sent is that the first memory node needs the need obtained
File fragment is sought, the cryptographic Hash of demand file segment is deleted from demand inventory, and the cryptographic Hash of demand file segment is added
It is added to and has obtained in inventory, obtain updated first account book.
Step 404, updated first account book is sent to block platform chain, for making block platform chain update total account book.
First memory node broadcasts updated first account book, a block chain in block platform chain to block platform chain
After node responds the broadcast, the total account book being locally stored is updated according to updated first account book, and into block platform chain
Other updated total account books of block chain node broadcasts are to synchronize total account book.
Fig. 6 is the framework of a specific embodiment of the file acquisition method that one exemplary embodiment of the application provides
Figure.As shown, in step 1, the user B in distributed file storage system verifies the content received from memory node
Cryptographic Hash whether there is in demand inventory;In step 2, if verification passes through, to memory node return authentication;In step
In 3, memory node updates the account book of itself according to the user B certifications returned;In step 4, memory node is to block platform chain
Itself updated account book is broadcasted, with total account book of more new block platform chain;In steps of 5, user B reception content from demand
It is deleted in inventory, increases to and obtained in inventory;In step 6, user B updates the account book of itself;In step 7, user B to
Block platform chain broadcasts itself updated account book, with total account book of more new block platform chain.
In conclusion in the embodiment of the present application, demand file piece that the first memory node is sent by the second memory node
The cryptographic Hash of section verifies whether the demand file segment that the second memory node is sent is that the first memory node needs the demand obtained
File fragment improves the accuracy of file fragment acquisition.
Further, in the embodiment of the present application, updated first is broadcasted to block platform chain by the first memory node
Account book, block platform chain update total account book according to updated first account book, improve the total account book stored in block platform chain
Timeliness.
Referring to FIG. 7, the method flow of the file acquisition method provided it illustrates one exemplary embodiment of the application
Figure.This method can be applied in the first memory node of the distributed storage node in implementation environment as shown in Figure 1, this method
Including:
Step 501, the first memory node sends the cryptographic Hash of demand file segment to block platform chain.
Cryptographic Hash of first memory node to block platform chain broadcast requests file fragment.Wherein, demand file segment is
The file fragment of file is obtained required for first memory node.
Step 502, the cryptographic Hash of block platform chain file fragment according to demand, the demand of being stored with is inquired by total account book
The device identification of at least two second memory nodes of file fragment.
A block chain node in block platform chain responds the broadcast of the first memory node, according to demand file fragment
Cryptographic Hash inquires the device identification at least two second memory nodes for being stored with demand file segment in total account book.
Step 503, block platform chain sends the device identification of at least two second memory nodes to the first memory node.
A block chain node in block platform chain sends at least two second memory nodes to the first memory node
Mark.
Step 504, the first memory node is according to the device identifications of at least two second memory nodes, to this at least two
Two memory nodes send the first account book.
The device identification at least two second memory nodes that first memory node is sent according to block platform chain, extremely to this
Few two the second memory nodes send the first account book.
Step 505, the second memory node is determining that the first account book is calculated according to the first account book with after the matching of the second account book
The debt ratio of first memory node.
Second memory node after receiving the first account book, the first account book of detection whether with store in the second memory node
Second account book matches, if the first account book and the matching of the second account book, according to the file piece sent in inventory in the first bill
File fragment data in hop count mesh and unfinished inventory calculate the debt ratio of the first memory node.
Wherein, the first account book and the matching of the second account book refer to the operation behavior of the first memory node recorded in the second account book
It is identical with the operation behavior of the first memory node recorded in the first account book.
Step 506, if the first account book and the second account book match, and the debt ratio of the first memory node is not higher than debt ratio threshold
Value, then the second memory node, which sends to connect to the first memory node, establishes instruction.
Determine the first account book and the matching of the second account book, it is determined that the first memory node is in distributed file storage system
Validated user is not to steal chain user, determines that the debt ratio of the first memory node is not higher than debt ratio threshold value, it is determined that the first storage
Node is not node of doing evil, then the second memory node sends connection to the first memory node and establishes instruction.
Optionally, the second memory node according to the debt ratio of the first memory node the ranking in all effective nodes, according to
The sequence of ranking from back to front sends connection to the first memory node and establishes instruction.Wherein, effective node is that distributed document is deposited
In storage system, has sent account book to the second memory node and debt ratio is not higher than the node of debt ratio threshold value.
Second memory node may respond the transmission request of a number of other memory nodes, therefore the second memory node needs
Sequence to sending file fragment is ranked up.Second memory node obtains after the debt ratio for calculating all effective nodes
To the first memory node debt ratio in all effective nodes ranking, if effectively node be 10, the first memory node
Debt ratio ranking the 3rd in all effective nodes, then the second memory node to the first memory node send file fragment cis-position
It is the 7th.
Step 507, the first memory node establishes instruction according to connection and the second memory node establishes connection, to the second storage
Node sends the cryptographic Hash of demand file segment.
First memory node establishes link order and the foundation connection of the second memory node according to what the second memory node was sent
Afterwards, the cryptographic Hash of demand file segment is sent to the second memory node.
Step 508, the cryptographic Hash for the demand file segment that the second memory node is sent according to the first memory node, to first
Memory node sends the cryptographic Hash of demand file segment and demand file segment.
Illustratively, after the second memory node receives the cryptographic Hash of demand file segment, by the second account book
Obtain whether inventory detection is local is stored with demand file segment, if demand file segment has been locally stored, to the first storage
Node sends the demand file segment and the cryptographic Hash of the demand file segment.
Step 509, the first memory node receives the demand file segment that the second memory node is sent, and merges and obtain demand
File.
After first memory node receives the demand file segment of at least two second memory nodes transmission, by demand file
Segment merges into demand file.
Step 510, the cryptographic Hash for the demand file segment that the first memory node is sent according to the second memory node, detection the
Whether the demand file segment that two memory nodes are sent is that the first memory node needs the demand file segment obtained.
The cryptographic Hash for the demand file segment that first memory node is sent according to the second memory node, by the first account book
Demand inventory, whether the demand file segment that the second memory node of detection is sent is that the first memory node needs the demand that obtains
File fragment.
If demand file segment, which is the first memory node, needs the demand file segment obtained, 511 are entered step;If
Demand file segment is not that the first memory node needs the demand file segment obtained, then retransmits and transmit to block platform chain
The cryptographic Hash of the demand file segment of mistake.
Step 511, the first memory node determines that the demand file segment that the second memory node is sent is the first memory node
After needing the demand file segment obtained, the cryptographic Hash of demand file segment is deleted from demand inventory, and by demand file
The cryptographic Hash of segment, which is added to, have been obtained in inventory, and updated first account book is obtained.
If the demand file piece stored in the cryptographic Hash and demand inventory of the demand file segment that the second memory node is sent
The Hash values match of section, it is determined that the demand file segment that the second memory node is sent is that the first memory node needs the need obtained
File fragment is sought, the cryptographic Hash of demand file segment is deleted from demand inventory, and the cryptographic Hash of demand file segment is added
It is added to and has obtained in inventory, obtain updated first account book.
Step 512, the first memory node sends updated first account book to block platform chain, for making block platform chain
Update total account book.
First memory node broadcasts updated first account book, multiple block chains in block platform chain to block platform chain
Broadcasted content of the node in inquiring block platform chain, one of block chain node respond the broadcast of the first memory node
Afterwards, the total account book being locally stored, and other block chain nodes into block platform chain are updated according to updated first account book
Updated total account book is broadcasted to synchronize total account book.
Step 513, the first memory node is sent to the second memory node confirms result.
First memory node determines that the demand file segment that the second memory node is sent is that the first memory node needs to obtain
Demand file segment after, to the second memory node send confirm as a result, the confirmation result for inform the second memory node its
The demand file segment of transmission is the demand file segment of the first memory node demand.
Step 514, the cryptographic Hash of demand file segment is added in the transmission inventory of the second account book by the second memory node,
Obtain updated second account book.
After second memory node receives the confirmation result of the first memory node transmission, by the cryptographic Hash of demand file segment
It is added in the transmission inventory of the second account book, obtains updated second account book.
Step 515, updated second account book is sent.
Second memory node broadcasts updated second account book, multiple block chains in block platform chain to block platform chain
Broadcasted content of the node in inquiring block platform chain, one of block chain node respond the broadcast of the second memory node
Afterwards, the total account book being locally stored, and other block chain nodes into block platform chain are updated according to updated second account book
Updated total account book is broadcasted to synchronize total account book.
In conclusion in the embodiment of the present application, by the first account for detecting the first memory node when the second memory node
Originally it is demand file segment to be sent to the first memory node, due to first when being matched with the second account book in the second memory node
Include operation note of first memory node to the file fragment stored in distributed file storage system, therefore second in account book
Memory node can according to judge the first account book whether with the second account book match to judge whether first node is distributed document
Validated user in storage system is solved and caused may be closed by irregularly changing filename door chain institute in the related technology
The problem of access and/or download behavior failure of method user, on the basis of realizing door chain, due to reducing under validated user
The mortality for carrying and/or accessing file improves the fluency that user obtains file.
Optionally, the second memory node in the embodiment of the present application calculates the debt of the first memory node by the first account book
Rate sends connection to the first memory node and establishes instruction, avoid node of doing evil and account for when debt ratio is not higher than debt ratio threshold value
With the resource of distributed file storage system, the working efficiency of distributed file storage system is improved.
Optionally, the first memory node in the embodiment of the present application to block platform chain by sending demand file segment
Cryptographic Hash, block platform chain according to demand inquire in general ledger and be stored at least two of demand file segment by the cryptographic Hash of segment
Second memory node sends the device identification of at least two second memory nodes to the first memory node, to make the first storage
Node accurately can establish connection at least two second memory nodes for being stored with demand file segment.
Optionally, the demand file segment that the first memory node in the embodiment of the present application is sent by the second memory node
Cryptographic Hash verify the second memory node send demand file segment whether be the first memory node need obtain demand text
Part segment is avoided because the system failure of the second memory node causes the first memory node to receive wrong file segment, is carried
The accuracy that high file fragment obtains.
Optionally, it in the embodiment of the present application, is broadcasted to block platform chain by the first memory node and the second memory node
Updated first account book and updated second account book, block platform chain is according to updated first account book and updated
Two account books update total account book, improve the timeliness of the total account book stored in block platform chain.
Before the first memory node obtains demand file segment from least two second memory nodes, at least two second
Second memory node in memory node can store file destination into distributed file storage system.Fig. 8 and Fig. 9
Embodiment will to the second memory node by file destination be stored in distributed file storage system storing process illustrate.
Referring to FIG. 8, the method flow of the file memory method provided it illustrates one exemplary embodiment of the application
Figure.This method can be applied in second memory node of the distributed storage node in implementation environment as shown in Figure 1, should
Method can be the step 201 in Fig. 2 embodiments before method, this method includes:
Step 601, the second memory node sends storage request to block platform chain.
Second memory node broadcasts storage request to block platform chain, and storage request to block platform chain for informing the
The request of two memory nodes stores file destination in distributed file storage system.
Step 602, n block chain node in block platform chain asks to start the timing of a random duration according to storage
Device, n are natural number, n >=2.
Illustratively, n block chain node responds the storage request of the second memory node, after first time period, n
A block chain link point enters state of activation, sends activation signaling between each other;After second time period, it is active
N block chain node synchronization start a random duration timer.
Step 603, i-th of block chain node in n block chain node is after timer expired, to n block chain link
Other n-1 block chain nodes that i-th block chain node is removed in point send i-th of timing and complete signaling, and i is natural number, and 1
≤i≤n。
I-th of block chain node is after timer expired, other n-1 block chain nodes into n block chain node
It sends i-th of timing and completes signaling.Wherein, the timer expired that signaling carries i-th of block chain node is completed in i-th of timing
At the time of and i-th of block chain node device identification.
Step 604, j-th of block chain node in n block chain node is when receiving timing completion signaling, if jth
The timer of a block chain node is not timed-out, then stops timer, and j-th of block chain link is removed into n block chain node
Other n-1 block chain nodes transmission of point has received signaling, and j is natural number, 1≤j≤n.
J-th of block chain node is when receiving the timing completion signaling that other block chain nodes are sent, the areas RuojGe
The timer of block chain node is not timed-out, then stops timer, and signaling has been received to the transmission of other n-1 block chain nodes.Its
In, receive the device identification that signaling carries j-th of block chain node j-th.
Step 605, n block chain node completes signaling and after having received signaling receiving timing between any two, according to
Signaling is completed in timing, using timer expired moment earliest block chain node as leader node.
Either block chain node in n block chain node is after receiving the signaling that other block chain nodes are sent, root
According to timing the device identification that moment and block chain node are completed in the timing that carries in signaling is completed, it is earliest that the moment is completed in timing
The election of block chain link point is leader node, which is used for and the second memory node is communicated and forwarded the second storage section
The information that point is sent.
Step 606, the second memory node sends the cryptographic Hash of file destination to leader node.
The cryptographic Hash for the file destination for needing to store is calculated in second memory node, and target text is sent to leader node
The cryptographic Hash of part segment.
Step 607, other block chain nodes of the leader node into block platform chain send the cryptographic Hash of file destination.
After leader node receives the cryptographic Hash of file destination, file destination is sent to other (n-1) a block chain node
Cryptographic Hash.
Step 608, leader node and other block chain nodes detect the cryptographic Hash of file destination with the presence or absence of in area respectively
In block platform chain, obtains node and veritify result.
Leader node and other block chain nodes detect the cryptographic Hash of file destination with the presence or absence of in total account book respectively, obtain
Node veritifies result.If leader node or other block chain nodes determine the Hash for not including file destination segment in total account book
Value, then it is to pass through that node, which veritifies result,.The cryptographic Hash of file destination segment is not present on total account book, illustrates that distributed document is deposited
Any memory node is without storage file destination segment on storage system, so that it is determined that file destination is that the second memory node is original
, rather than the content plagiarized.
Storage is had recorded in total account book of block platform chain to the cryptographic Hash of the file in distributed file storage system, neck
The cryptographic Hash in the total account book of node and other block chain nodes by inquiring itself with the presence or absence of file destination is led to judge whether
There are other memory nodes to store file destination into distributed file storage system, to judge the originality of file destination.
Step 609, leader node determine node veritify in result comprising (n/2+1) a node veritify result be by when,
Then determine that it is to pass through to veritify result, is sent to the second memory node for indicating the veritification result passed through.
Leader node counts leader node and the node of other block chain nodes veritifies result, however, it is determined that node veritifies result
In to veritify result comprising (n/2+1) a node be to pass through, it is determined that it is to pass through to veritify result, is used for the transmission of the second memory node
Indicate the veritification result passed through;If it is determined that node, which is veritified, does not include (n/2+1) a node veritification result to pass through, then in result
Determine veritify result be do not pass through, to the second memory node send for indicates not by veritify as a result, this not by core
Result is tested for forbidding the second memory node to store file destination segment in distributed file storage system.
Step 610, the second memory node according to by veritification result distributed file storage system store target text
Part segment.
Second memory node is according to the veritification for indicating to pass through as a result, in distributed file storage system storage target text
Part segment.
Fig. 9 is the framework of a specific embodiment of the file memory method that one exemplary embodiment of the application provides
Figure.As shown, in step 1, user A production contents and the cryptographic Hash for calculating content;In step 2, user A is to block chain
Platform broadcast storage request, the validation group of at least one block chain node composition respond its broadcast;In step 3, validation group is selected
It lifts and generates leader node;In step 4, leader node replys the storage request of user A;In steps of 5, user A is saved to leader
Point, which is sent, veritifies request, which carries the cryptographic Hash of the content of storage in need;In step 7 and step 8, in validation group
Each block chain node veritifies the cryptographic Hash for the content that storage in need whether is preserved in the total account book of block chain;In step 8,
Validation group sends respective verification result between any two, initially forms common recognition;In step 9, leader node statistics veritifies result;
In step 10, leader node sends to user A and veritifies result.
Figure 10 is a specific embodiment of file storage and acquisition methods that one exemplary embodiment of the application provides
Organization Chart.As shown, the framework is divided into two parts, a part is that user A stores the content of generation to IPFS systems
In, another part is the content that user B obtains user's A storages from IPFS systems, and specific implementation can refer to Fig. 3, Fig. 6
And the embodiment in Fig. 9, this will not be repeated here.
In conclusion in the embodiment of the present application, the Hash of file destination is sent to leader node by the second memory node
The cryptographic Hash of value, leader node and other block chain nodal test file destinations whether there is to be veritified on block platform chain
As a result, if the cryptographic Hash of file destination is not present on block platform chain, illustrate that file destination is that the second memory node is original
Rather than plagiarize, allow for the second memory node to store file destination on distributed file storage system, reduce point
The risk of infringement of the file stored on cloth document storage system.
1 is please referred to Fig.1, it illustrates the structural frames for the file acquisition device that one exemplary embodiment of the application provides
Figure, as shown, the device can be applied to first memory node of the memory node in implementation environment as shown in Figure 1
In, which includes sending module 810, receiving module 820 and processing module 830:
Sending module 810, for executing step 201, the step realized in above-mentioned Fig. 2, Fig. 3, Fig. 5 or Fig. 7 embodiment
203, the transmissions such as step 301, step 303, step 404, step 501, step 504, step 507, step 512, step 513 walk
Suddenly and other implicit forwarding steps.
Receiving module 820, for executing step 202, the step realized in above-mentioned Fig. 2, Fig. 3, Fig. 5 or Fig. 7 embodiment
204, step 302, step 401, step 503, step 506, step 508 and other implicit receiving steps.
Processing module 830, for executing step 402, step 403, the step realized in above-mentioned Fig. 5 or Fig. 7 embodiments
509, step 510, step 511 and other implicit processing steps.
2 are please referred to Fig.1, it illustrates the structural frames for the file acquisition device that one exemplary embodiment of the application provides
Figure, as shown, the device can be applied to second memory node of the memory node in implementation environment as shown in Figure 1
In, which includes sending module 910, receiving module 920 and processing module 930:
Sending module 910, for executing the hairs such as step 506, step 508, the step 515 realized in above-mentioned Fig. 7 embodiments
Send step and other implicit forwarding steps.
Receiving module 920 is used to execute step 504, step 507, the step 513 realized in above-mentioned Fig. 7 embodiments, and
Other implicit receiving steps.
Processing module 930, for executing step 505 and the other implicit processing steps realized in above-mentioned Fig. 7 embodiments
Suddenly.
Figure 13 is referred to, it illustrates the structure diagrams for the electronic equipment that one exemplary embodiment of the application provides.
The equipment includes:Processor 1010, memory 1020 and communication interface 1030.
Processor 1010 can be central processing unit (English:Central processing unit, CPU), network processes
Device (English:Network processor, NP) or CPU and NP combination.Processor 1010 can further include firmly
Part chip.Above-mentioned hardware chip can be application-specific integrated circuit (English: application-specific integrated
Circuit, ASIC), programmable logic device (English:Programmable logic device, PLD) or combinations thereof.On
It can be Complex Programmable Logic Devices (English to state PLD:Complex programmable logic device, CPLD), it is existing
Field programmable logic gate array (English:Field-programmable gate array, FPGA), Universal Array Logic (English
Text:Generic array logic, GAL) or its arbitrary combination.
Memory 1020 is connected by bus or other means with processor 1010, and at least one is stored in memory 1020
Item instruction, at least one section of program, code set or instruction set, above-mentioned at least one instruction, at least one section of program, code set or instruction
Collection is loaded by processor 1010 and is executed to realize the file acquisition method in above-described embodiment.Memory 1020 can be volatile
Property memory (English:Volatile memory), nonvolatile memory (English:Non-volatile memory) or it
Combination.Volatile memory can be random access memory (English:Random-access memory, RAM), such as
Static RAM (English:Static random access memory, SRAM), dynamic random access memory
(English:Dynamic random access memory, DRAM).Nonvolatile memory can be read-only memory (English:
Read only memory image, ROM), such as programmable read only memory (English: programmable read only
Memory, PROM), Erasable Programmable Read Only Memory EPROM (English: erasable programmable read only
Memory, EPROM), electrically erasable programmable read-only memory (English:electrically erasable
Programmable read-only memory, EEPROM).Nonvolatile memory may be flash memory (English:
Flash memory), magnetic memory, such as tape (English:Magnetic tape), floppy disk (English:Floppy disk),
Hard disk.Nonvolatile memory may be CD.
Communication interface 1030 is connected by bus or other means with memory 1020 and processor 1010, and electronic equipment can
Information is sent to other memory nodes or block chain node by communication interface 1030, or, receiving it by communication interface 1030
The information that its memory node or block chain node are sent.
The application also provides a kind of computer readable storage medium, be stored in the storage medium at least one instruction,
At least one section of program, code set or instruction set, at least one instruction or refer at least one section of program, the code set
Collection is enabled to be loaded by the processor and executed to realize the file acquisition method of above method embodiment offer.
Present invention also provides a kind of computer program products including instruction, when run on a computer so that
Computer executes the file acquisition method described in above-mentioned various aspects.
Figure 14 is referred to, it illustrates the structure diagrams for the electronic equipment that one exemplary embodiment of the application provides.
The equipment includes:Processor 1110, memory 1120 and communication interface 1130.
Processor 1110 can be central processing unit (English:Central processing unit, CPU), network processes
Device (English:Network processor, NP) or CPU and NP combination.Processor 1110 can further include firmly
Part chip.Above-mentioned hardware chip can be application-specific integrated circuit (English: application-specific integrated
Circuit, ASIC), programmable logic device (English:Programmable logic device, PLD) or combinations thereof.On
It can be Complex Programmable Logic Devices (English to state PLD:Complex programmable logic device, CPLD), it is existing
Field programmable logic gate array (English:Field-programmable gate array, FPGA), Universal Array Logic (English
Text:Generic array logic, GAL) or its arbitrary combination.
Memory 1120 is connected by bus or other means with processor 1110, and at least one is stored in memory 1120
Item instruction, at least one section of program, code set or instruction set, above-mentioned at least one instruction, at least one section of program, code set or instruction
Collection is loaded by processor 1110 and is executed to realize the file memory method in above-described embodiment.Memory 1120 can be volatile
Property memory (English:Volatile memory), nonvolatile memory (English:Non-volatile memory) or it
Combination.Volatile memory can be random access memory (English:Random-access memory, RAM), such as
Static RAM (English:Static random access memory, SRAM), dynamic random access memory
(English:Dynamic random access memory, DRAM).Nonvolatile memory can be read-only memory (English:
Read only memory image, ROM), such as programmable read only memory (English: programmable read only
Memory, PROM), Erasable Programmable Read Only Memory EPROM (English: erasable programmable read only
Memory, EPROM), electrically erasable programmable read-only memory (English:electrically erasable
Programmable read-only memory, EEPROM).Nonvolatile memory may be flash memory (English:
Flash memory), magnetic memory, such as tape (English:Magnetic tape), floppy disk (English:Floppy disk),
Hard disk.Nonvolatile memory may be CD.
Communication interface 1130 is connected by bus or other means with memory 1120 and processor 1110, and electronic equipment can
Information is sent to other memory nodes or block chain node by communication interface 1130, or, receiving it by communication interface 1130
The information that its memory node or block chain node are sent.
The application also provides a kind of computer readable storage medium, be stored in the storage medium at least one instruction,
At least one section of program, code set or instruction set, at least one instruction or refer at least one section of program, the code set
Collection is enabled to be loaded by the processor and executed to realize the file memory method of above method embodiment offer.
Present invention also provides a kind of computer program products including instruction, when run on a computer so that
Computer executes the file memory method described in above-mentioned various aspects.
It should be understood that referenced herein " multiple " refer to two or more."and/or", description association
The incidence relation of object indicates may exist three kinds of relationships, for example, A and/or B, can indicate:Individualism A, exists simultaneously A
And B, individualism B these three situations.It is a kind of relationship of "or" that character "/", which typicallys represent forward-backward correlation object,.
Above-mentioned the embodiment of the present application serial number is for illustration only, can not represent the quality of embodiment.
One of ordinary skill in the art will appreciate that realizing that all or part of step of above-described embodiment can pass through hardware
It completes, relevant hardware can also be instructed to complete by program, the program can be stored in a kind of computer-readable
In storage medium, storage medium mentioned above can be read-only memory, disk or CD etc..
The foregoing is merely the preferred embodiments of the application, not to limit the application, it is all in spirit herein and
Within principle, any modification, equivalent replacement, improvement and so on should all be included within the protection domain of the application.
Claims (21)
1. a kind of file acquisition method, which is characterized in that the method is applied to the first storage of distributed file storage system
In node, the method includes:
The second memory node into the distributed file storage system sends the first account book;Distributed document storage system
Account book is stored in memory node in system, the account book includes that the memory node is stored to being stored in the distributed document
The operation note that file fragment in system is operated, first account book be stored in first memory node it is described
Account book;
It receives the connection that second memory node is sent and establishes instruction, it is second memory node that instruction is established in the connection
It is sent after determining first account book and the matching of the second account book, second account book stored in second memory node
The account book;
Instruction is established according to the connection and second memory node establishes connection, and demand is sent to second memory node
The unique identifying information of file fragment;
The demand file segment that second memory node is sent is received, and merges and obtains demand file;The demand text
Part segment is that second memory node is obtained according to the unique identifying information in local search.
2. according to the method described in claim 1, it is characterized in that, the account book, which includes the memory node, has obtained file piece
The unique identifying information of section, the method further include:
Index node into the distributed file storage system sends the unique identifying information of the demand file segment;Institute
It states index node to communicate to connect at least one distributed file storage system memory node, the index node is stored with
Total account book, total account book include the account book of each memory node storage in the distributed file storage system, with
And the device identification of the corresponding memory node of the account book;
Receive the device identification for second memory node that the index node is sent;The equipment mark of second memory node
Knowledge is that the index node is inquired in total account book according to the unique identifying information of the demand file segment and obtained;
Second memory node into the distributed file storage system sends the first account book, including:
According to the device identification of second memory node, first account book is sent to second memory node.
3. method according to claim 1 or 2, which is characterized in that the account book includes demand inventory and has obtained inventory,
The demand inventory includes the unique identifying information that the memory node needs the demand file segment obtained, described to have obtained clearly
Single includes the unique identifying information for the demand file segment that the memory node has obtained, and the method further includes:
Receive the unique identifying information for the demand file segment that second memory node is sent;
According to the unique identifying information of the demand file segment, the demand file segment that second memory node is sent is detected
Whether it is that first memory node needs the demand file segment obtained;
If it is determined that the demand file segment that second memory node is sent, which is first memory node, needs the demand obtained
File fragment then deletes the unique identifying information of the demand file segment from the demand inventory of first account book, and
The unique identifying information of the demand file segment is added in the inventory of acquisition of first account book, is obtained updated
First account book;
Updated first account book is sent for making the index node update total account book to the index node.
4. method according to claim 1 or 2, which is characterized in that the company for receiving second memory node and sending
Foundation instruction is connect, including:
It receives the connection that second memory node is sent and establishes instruction;It is second memory node that instruction is established in the connection
Determine first account book and second account book matching, and the debt ratio of first memory node is less than after debt ratio threshold value
It sends;
Wherein, the debt ratio is second memory node according to first memory node for including in first account book
The file fragment number and first memory node sent to the distributed file storage system should be to the distributed text
Part storage system is sent, but and does not complete what the file fragment number sent was calculated.
5. a kind of file acquisition method, which is characterized in that the method is deposited applied to second in distributed file storage system
It stores up in node, the method includes:
Receive the first account book that the first memory node in the distributed file storage system is sent;The distributed document is deposited
Account book is stored in memory node in storage system, the account book includes the memory node to being stored in the distributed document
The operation note that file fragment in storage system is operated, first account book are stored in first memory node
The account book;
If first account book and second account book matching, sends connection to first memory node and establish instruction, it is described
Connection establishes instruction and is used to indicate first memory node and second memory node foundation connection, and second account book is
The account book stored in second memory node;
It establishes and connects with first memory node;
Receive the unique identifying information for the demand file segment that first memory node is sent;
Demand file segment is sent to first memory node;The demand file segment is according to the unique identifying information
It is obtained in local search.
6. according to the method described in claim 5, it is characterized in that, the method, further includes:
The debt ratio of first memory node is calculated according to first account book;The debt ratio is according to first account book
In include the file fragment number and described first that is sent to the distributed file storage system of first memory node deposit
Storage node should be sent to the distributed file storage system, but and not complete what the file fragment number sent was calculated;
Detect whether the debt ratio is higher than debt ratio threshold value;
Described and described first memory node establishes connection, including:
If the debt ratio is not higher than the debt ratio threshold value, and first memory node establishes connection.
7. according to the method described in claim 6, it is characterized in that, whether the detection debt ratio is higher than debt ratio threshold value
Later, further include:
If the debt ratio is not higher than the debt ratio threshold value, according to the debt ratio, calculates first memory node and exist
Ranking in all effective nodes;Effective node is in the distributed file storage system, to the second storage section
Point has sent the account book and debt ratio is not higher than the memory node of the debt ratio threshold value;
Described and described first memory node establishes connection, including:
Connection is established according to the sequence from back to front of the ranking and first memory node.
8. according to claim 5 to 7 any one of them method, which is characterized in that the method further includes:
The unique identifying information of the demand file segment is added in the transmission inventory of second account book, after obtaining update
The second account book;The transmission inventory of second account book is second memory node into the distributed file storage system
Memory node send demand file segment unique identifying information;
Index node into the distributed file storage system sends updated second general ledger;The index node
It is communicated to connect at least one memory node, total account book is stored in the index node, total account book includes described
Each of the distribution file formula storage system account book.
9. according to claim 5 to 7 any one of them method, which is characterized in that described to be sent to first memory node
Demand file segment, including:
The unique identifying information of demand file segment and the demand file segment is sent to first memory node;It is described
The unique identifying information of file fragment is for making first memory node be believed according to the unique identification of the demand file segment
Breath, detects whether the demand file segment that second memory node is sent is that first memory node needs the demand obtained
File fragment.
10. according to the method described in claim 5, it is characterized in that, described receive in the distributed file storage system
Before the first account book that first memory node is sent, further include:
Leader node into the index node sends the unique identifying information of file destination;The leader node is the rope
Draw the node being responsible in node with second memory node communication;
Receive that the leader node sends be used to indicate the file destination whether be original file veritification result;The core
It tests the result is that other index nodes that the leader node removes the leader node into the index node send the mesh
After the unique identifying information for marking file, the node sent according to the other index nodes received is veritified as a result, and originally
The node on ground counts obtaining as a result, the node is veritified the result is that the leader node or any described other after veritifying result
The unique identifying information that index node detects the file destination whether there is the result obtained in total account book;
If the veritification result is to veritify to pass through, the file destination is stored into the distributed file storage system.
11. according to the method described in claim 10, it is characterized in that, the leader node into the index node is sent
Before the unique identifying information of file destination, further include:
Storage request is sent to the distributed file storage system, the storage request is for asking in the distributed document
Storage system stores the file destination;
Receive the veritification request that the leader node is sent;Veritification request is that the leader node receives the storage and asks
After asking, the instruction that the file destination is veritified that is sent out to second memory node.
12. a kind of file memory method, which is characterized in that the method is applied in distributed file storage system, the side
Method includes:
Leader node in the distributed file storage system receives the second storage in the distributed file storage system
The unique identifying information for the file destination that node is sent;The leader node is to be responsible in index node and the second storage section
The index node of point communication;The index node includes the unique of the All Files stored in the distributed file storage system
Identification information, the index node are communicated to connect at least one memory node;
Other index nodes that the leader node removes the leader node into the index node send the target text
The unique identifying information of part;
The unique identifying information that the leader node and other index nodes detect the file destination respectively whether there is
In the distributed file storage system, obtains node and veritify result;
The leader node counts the node veritification result and obtains veritifying result;
The leader node sends the veritification result to second memory node;If the veritification result is to pass through, institute
It states veritification result and is used to indicate second memory node in the distributed file storage system storage file destination.
13. according to the method for claim 12, which is characterized in that the leader node counts the node veritification result and obtains
To veritification as a result, including:
Whether it is to pass through comprising n/2+1 node veritification result that the leader node detects the node and veritifies in result;It is described
It is by indicating that the leader node or any other index nodes determine that the distributed document is deposited that node, which veritifies result,
The unique identifying information of the file destination is not included in storage system, n is the leader node and other index nodes
Sum, n are natural number, n >=1;
If the node is veritified in result veritifies result to pass through, described in the leader node determination comprising n/2+1 node
It is to pass through to veritify result;
If the node, which is veritified, does not include n/2+1 node veritification result to pass through in result, the leader node determines institute
It is not pass through to state and veritify result.
14. method according to claim 12 or 13, which is characterized in that the method further includes:
The n index node receives the storage request of second memory node;The storage request is for asking described
Distributed file storage system stores the file destination;
Each index node in the n index node starts the timer of a random duration according to the storage request;
I-th of index node in the n index node is after the timer expired of i-th of index node, to the n
Other n-1 index nodes that i-th of index node is removed in a index node send i-th of timing completion signaling, and i is
Natural number, 1≤i≤n;At the time of i-th of timing completion signaling carries the timer expired of i-th of index node
With the device identification of i-th of index node;
J-th of index node in the n index node is when receiving the timing completion signaling, if j-th of rope
The timer for drawing node is not timed-out, then stops the timer of j-th of index node, is removed into the n index node
It goes other n-1 index nodes of j-th of index node to send j-th and has received signaling, j is natural number, 1≤j≤n;It is described
The device identification that signaling carries j-th of index node is received j-th;
The n index node between any two receive the timing complete signaling and it is described received signaling after, according to institute
It states timing and completes signaling, using timer expired moment earliest index node as the leader node.
15. according to the method for claim 14, which is characterized in that each index node root in the n index node
Start the timer of a random duration according to the storage request, including:
It is asked according to the storage, after more than first time threshold, the n index node enters state of activation;
Signaling is activated into mutually being sent between the n index node of state of activation;
After more than second time threshold, if the n index node into state of activation does not retransmit the activation signaling,
Then each index node in the n index node starts the timer of a random duration.
16. a kind of file acquisition device, which is characterized in that described device is applied to the first storage of distributed file storage system
In node, described device includes:
Sending module sends the first account book for the second memory node into the distributed file storage system;Described point
Account book is stored in memory node in cloth document storage system, the account book includes that the memory node is described to being stored in
The operation note that file fragment in distributed file storage system is operated, first account book are the first storage sections
The account book stored in point;
Receiving module establishes instruction for receiving the connection that second memory node is sent, and it is institute that instruction is established in the connection
It states after the second memory node determines first account book and the matching of the second account book and sends, second account book is described second to deposit
The account book stored in storage node;
The sending module is additionally operable to establish instruction according to the connection and second memory node establishes connection, to described
Second memory node sends the unique identifying information of demand file segment;
The receiving module is additionally operable to receive the demand file segment that second memory node is sent;The demand text
Part segment is that second memory node is obtained according to the unique identifying information in local search;
Processing module is used for and closes the demand file segment and obtains demand file.
17. a kind of file acquisition device, which is characterized in that described device is deposited applied to second in distributed file storage system
It stores up in node, described device includes:
Receiving module, the first account book for receiving the transmission of the first memory node in the distributed file storage system;Institute
It states and is stored with account book in the memory node in distributed file storage system, the account book includes the memory node to being stored in
The operation note that file fragment in the distributed file storage system is operated, first account book are described first to deposit
The account book stored in storage node;
Sending module sends to first memory node and connects if being matched for first account book and second account book
Instruction is established, the connection establishes instruction and is used to indicate first memory node and second memory node foundation connection,
Second account book is the account book stored in second memory node;
Processing module is connected for being established with first memory node;
The receiving module is additionally operable to receive the unique identifying information for the demand file segment that first memory node is sent;
Sending module is additionally operable to send demand file segment to first memory node;The demand file segment is basis
What the unique identifying information was obtained in local search.
18. a kind of electronic equipment, which is characterized in that the electronic equipment includes processor and memory, is deposited in the memory
At least one instruction is contained, at least one instruction is loaded by the processor and executed to realize such as claim 1 to 11
Any file acquisition method.
19. a kind of electronic equipment, which is characterized in that the electronic equipment includes processor and memory, is deposited in the memory
At least one instruction is contained, at least one instruction is loaded by the processor and executed to realize such as claim 12 to 15
Any file memory method.
20. a kind of computer readable storage medium, which is characterized in that be stored at least one in the computer readable storage medium
Item instructs, and at least one instruction is loaded by processor and executed to realize any file acquisition side of claim 1 to 11
Method.
21. a kind of computer readable storage medium, which is characterized in that be stored at least one in the computer readable storage medium
Item instructs, and at least one instruction is loaded by processor and executed to realize any file storage side of claim 12 to 15
Method.
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810482561.8A CN108710681B (en) | 2018-05-18 | 2018-05-18 | File acquisition method, device, equipment and storage medium |
CN202010047750.XA CN111291000B (en) | 2018-05-18 | 2018-05-18 | File acquisition method, equipment and storage medium based on block chain |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810482561.8A CN108710681B (en) | 2018-05-18 | 2018-05-18 | File acquisition method, device, equipment and storage medium |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202010047750.XA Division CN111291000B (en) | 2018-05-18 | 2018-05-18 | File acquisition method, equipment and storage medium based on block chain |
Publications (2)
Publication Number | Publication Date |
---|---|
CN108710681A true CN108710681A (en) | 2018-10-26 |
CN108710681B CN108710681B (en) | 2022-02-22 |
Family
ID=63869123
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201810482561.8A Active CN108710681B (en) | 2018-05-18 | 2018-05-18 | File acquisition method, device, equipment and storage medium |
CN202010047750.XA Active CN111291000B (en) | 2018-05-18 | 2018-05-18 | File acquisition method, equipment and storage medium based on block chain |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202010047750.XA Active CN111291000B (en) | 2018-05-18 | 2018-05-18 | File acquisition method, equipment and storage medium based on block chain |
Country Status (1)
Country | Link |
---|---|
CN (2) | CN108710681B (en) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109831527A (en) * | 2019-03-13 | 2019-05-31 | 试金石信用服务有限公司 | Document handling method, user terminal, server and readable storage medium storing program for executing |
CN111563083A (en) * | 2020-04-30 | 2020-08-21 | 中国银行股份有限公司 | Report data query method, device and system |
CN111767427A (en) * | 2019-04-02 | 2020-10-13 | 浙江宇视科技有限公司 | Video information storage method and data storage domain |
CN112069165A (en) * | 2019-06-11 | 2020-12-11 | 国际商业机器公司 | Document redaction and coordination |
CN112100171A (en) * | 2020-08-12 | 2020-12-18 | 北京大学 | Method and device for establishing content index for random consensus diagram book |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112054990B (en) * | 2020-07-21 | 2022-09-16 | 杜晓楠 | Method for preventing Hash flood attack in blockchain system, computer readable medium and blockchain system |
CN112311798A (en) * | 2020-11-02 | 2021-02-02 | 大连理工大学 | Data block exchange method based on peer-to-peer hypermedia distribution protocol |
CN112749144B (en) * | 2021-01-15 | 2023-06-30 | 云南云电同方科技有限公司 | System and method for storing persistent file based on blockchain |
EP4191976A1 (en) * | 2021-12-06 | 2023-06-07 | Wyplay | Methods and devices for content distribution |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102752326A (en) * | 2011-04-19 | 2012-10-24 | 腾讯科技(深圳)有限公司 | Method, client, server and system for processing data in file downloading |
US8990248B1 (en) * | 2006-12-13 | 2015-03-24 | Cisco Technology, Inc. | Peer-to-peer network image distribution hierarchy |
CN104731516A (en) * | 2013-12-18 | 2015-06-24 | 腾讯科技(深圳)有限公司 | Method and device for accessing files and distributed storage system |
CN105068757A (en) * | 2015-07-23 | 2015-11-18 | 浙江大学 | File semantics and system real-time state based redundant data deduplication method |
CN106911751A (en) * | 2015-12-23 | 2017-06-30 | 北京奇虎科技有限公司 | File acquisition method, device and system |
CN107172090A (en) * | 2017-07-03 | 2017-09-15 | 郑州云海信息技术有限公司 | The acquisition methods and acquisition device of a kind of file |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101599994B (en) * | 2009-06-01 | 2012-07-18 | 中兴通讯股份有限公司 | Distributed file system (DFS), access node (AN) and method of transmitting file data among nodes |
US9881176B2 (en) * | 2015-06-02 | 2018-01-30 | ALTR Solutions, Inc. | Fragmenting data for the purposes of persistent storage across multiple immutable data structures |
US10491378B2 (en) * | 2016-11-16 | 2019-11-26 | StreamSpace, LLC | Decentralized nodal network for providing security of files in distributed filesystems |
CN106815530B (en) * | 2016-12-26 | 2020-04-24 | 北京爱接力科技发展有限公司 | Data storage method, data verification method and device |
CN107147704B (en) * | 2017-04-21 | 2019-12-13 | 杭州趣链科技有限公司 | block chain-oriented universal service middleware system |
CN107171829B (en) * | 2017-04-24 | 2019-12-24 | 杭州趣链科技有限公司 | Dynamic node management method realized based on BFT consensus algorithm |
CN107273410B (en) * | 2017-05-03 | 2020-07-07 | 上海点融信息科技有限责任公司 | Block chain based distributed storage |
CN107239940A (en) * | 2017-05-11 | 2017-10-10 | 北京博晨技术有限公司 | Network trading method and device based on block catenary system |
CN107147735B (en) * | 2017-05-12 | 2020-08-11 | 北京博晨技术有限公司 | Distributed account book system based on hierarchical structure |
CN107819891B (en) * | 2017-10-16 | 2020-01-24 | 平安科技(深圳)有限公司 | Data processing method, data processing device, computer equipment and storage medium |
CN107819789A (en) * | 2017-12-07 | 2018-03-20 | 北京泛融科技有限公司 | A kind of content anti-hijack system and method based on block chain |
CN107944868A (en) * | 2017-12-07 | 2018-04-20 | 杭州趣链科技有限公司 | A kind of electronics deposit system and management method based on block chain intelligence contract |
-
2018
- 2018-05-18 CN CN201810482561.8A patent/CN108710681B/en active Active
- 2018-05-18 CN CN202010047750.XA patent/CN111291000B/en active Active
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8990248B1 (en) * | 2006-12-13 | 2015-03-24 | Cisco Technology, Inc. | Peer-to-peer network image distribution hierarchy |
CN102752326A (en) * | 2011-04-19 | 2012-10-24 | 腾讯科技(深圳)有限公司 | Method, client, server and system for processing data in file downloading |
CN104731516A (en) * | 2013-12-18 | 2015-06-24 | 腾讯科技(深圳)有限公司 | Method and device for accessing files and distributed storage system |
CN105068757A (en) * | 2015-07-23 | 2015-11-18 | 浙江大学 | File semantics and system real-time state based redundant data deduplication method |
CN106911751A (en) * | 2015-12-23 | 2017-06-30 | 北京奇虎科技有限公司 | File acquisition method, device and system |
CN107172090A (en) * | 2017-07-03 | 2017-09-15 | 郑州云海信息技术有限公司 | The acquisition methods and acquisition device of a kind of file |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109831527A (en) * | 2019-03-13 | 2019-05-31 | 试金石信用服务有限公司 | Document handling method, user terminal, server and readable storage medium storing program for executing |
CN109831527B (en) * | 2019-03-13 | 2021-12-28 | 试金石信用服务有限公司 | File processing method, user side, server and readable storage medium |
CN111767427A (en) * | 2019-04-02 | 2020-10-13 | 浙江宇视科技有限公司 | Video information storage method and data storage domain |
CN111767427B (en) * | 2019-04-02 | 2024-04-05 | 浙江宇视科技有限公司 | Video information storage method and data storage domain |
CN112069165A (en) * | 2019-06-11 | 2020-12-11 | 国际商业机器公司 | Document redaction and coordination |
CN111563083A (en) * | 2020-04-30 | 2020-08-21 | 中国银行股份有限公司 | Report data query method, device and system |
CN112100171A (en) * | 2020-08-12 | 2020-12-18 | 北京大学 | Method and device for establishing content index for random consensus diagram book |
Also Published As
Publication number | Publication date |
---|---|
CN111291000A (en) | 2020-06-16 |
CN108710681B (en) | 2022-02-22 |
CN111291000B (en) | 2023-11-03 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN108710681A (en) | File acquisition method, device, equipment and storage medium | |
CN110311790B (en) | Method and device for sending authenticable message in cross-link mode | |
CN109347955B (en) | Block chain network system and information processing method | |
CN106528432B (en) | The construction method and device of test scene data bury a test method | |
CN110430162B (en) | Method and device for sending authenticable message in cross-link mode | |
CN101409706B (en) | Method, system and relevant equipment for distributing data of edge network | |
US8260820B2 (en) | Method and apparatus for searching | |
CN102656922B (en) | Utilize for using swarm intelligence to carry out the system and method for the framework of information router at large scale distributed system | |
CN100413290C (en) | Method for setting up notification function for route selection according to border gateway protocol | |
CN102741845A (en) | URL reputation system | |
CN109040252A (en) | Document transmission method, system, computer equipment and storage medium | |
CN103179148B (en) | A kind of processing method sharing adnexa in the Internet and system | |
CN109981279B (en) | Block chain system, communication method, device, equipment and medium | |
CN105321108A (en) | System and method for creating a list of shared information on a peer-to-peer network | |
CN105357110B (en) | E-mail sending method, apparatus and system | |
CN108959457A (en) | A kind of inquiry of certificate, verification method and system | |
CN111651525A (en) | Block chain data storage method and device | |
CN108540505B (en) | Content updating method and device | |
CN112671908B (en) | Network management method and device, electronic equipment and readable storage medium | |
CN111506589A (en) | Block chain data service system based on alliance chain, access method and storage medium | |
CN106254528A (en) | A kind of resource downloading method and buffer memory device | |
CN111899019A (en) | Method and system for cross validation and sharing of blacklist and multiple parties | |
CN112817867A (en) | Interface test script generation method and device, computer equipment and medium | |
CN112737782A (en) | Method and apparatus for providing cross-chain messages | |
CN114363352A (en) | Block chain-based Internet of things system cross-chain interaction 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 |