CN108710681A - File acquisition method, device, equipment and storage medium - Google Patents

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

File acquisition method, device, equipment and storage medium

technical field

The present application relates to the field of network technology, and in particular to a file acquisition method, device, equipment and storage medium.

Background technique

Bad service providers usually store Uniform Resource Locators (Uniform Resource Locators, URLs) of files (or services) provided by other service providers in their own databases. When users access the network platform of bad service providers, the access and/or the URL of the downloaded file is the URL of the hotlinked file.

In related technologies, in order to prevent the files published on the network platform from being hotlinked, the service provider usually modifies the file name irregularly to prevent the file from being hotlinked, because modifying the file name will change the URL of the hotlinked file accordingly, Therefore, the URL of the hotlinked file stored by the bad service provider will become invalid, thereby realizing the purpose of anti-hotlinking.

Modifying the file name irregularly will cause the URL to be modified. When the legitimate user accesses and/or downloads the file, the URL of the file is modified, which will cause the legitimate user's access and/or download behavior to fail.

Contents of the invention

The embodiment of the present application provides a file acquisition method, device, device, and storage medium, which can be used to solve the problem of modifying file names irregularly in related technologies to prevent files from being hotlinked, resulting in failure of legitimate users to access and/or download files The problem. Described technical scheme is as follows:

On the one hand, an embodiment of the present application provides a file acquisition method, the method is applied to a first storage node of a distributed file storage system, and the method includes:

Sending a first ledger to a second storage node in the distributed file storage system; a ledger is stored in a storage node in the distributed file storage system, and the ledger includes a pair of storage nodes stored in the distributed file storage system. An operation record of operations performed on file fragments in the file storage system, the first ledger is the ledger stored in the first storage node;

receiving a connection establishment instruction sent by the second storage node, the connection establishment instruction is sent by the second storage node after determining that the first ledger and the second ledger match, and the second ledger is the second ledger storing the ledger stored in the node;

Establishing a connection with the second storage node according to the connection establishment instruction, and sending the unique identification information of the required file segment to the second storage node;

receiving the demand file fragments sent by the second storage node, and combining them to obtain a demand file; the demand file fragments are obtained by the second storage node through local query according to the unique identification information.

On the one hand, the embodiment of the present application provides a file acquisition device, the device is applied to the first storage node of the distributed file storage system, and the device includes:

A sending module, configured to send a first ledger to a second storage node in the distributed file storage system; a ledger is stored in a storage node in the distributed file storage system, and the ledger includes the pair of storage nodes stored by the storage node An operation record of operations performed on file fragments in the distributed file storage system, the first ledger is the ledger stored in the first storage node;

A receiving module, configured to receive a connection establishment instruction sent by the second storage node, the connection establishment instruction is sent by the second storage node after determining that the first ledger matches the second ledger, and the second ledger is the ledger stored in the second storage node;

The sending module is further configured to establish a connection with the second storage node according to the connection establishment instruction, and send the unique identification information of the required file segment to the second storage node;

The receiving module is further configured to receive the demand file fragment sent by the second storage node; the demand file fragment is obtained by the second storage node through local query according to the unique identification information;

The processing module is used to combine the requirement file fragments to obtain the requirement file.

On the one hand, an embodiment of the present application provides a file acquisition device, the device is applied to a second storage node in a distributed file storage system, and the device includes:

The receiving module is configured to receive the first ledger sent by the first storage node in the distributed file storage system; the ledger is stored in the storage node in the distributed file storage system, and the ledger includes the pair of storage nodes An operation record of operations performed on file fragments stored in the distributed file storage system, the first ledger is the ledger stored in the first storage node;

a sending module, configured to send a connection establishment instruction to the first storage node if the first ledger matches the second ledger, and the connection establishment instruction is used to instruct the first storage node and the second The storage node establishes a connection, and the second ledger is the ledger stored in the second storage node;

a processing module, configured to establish a connection with the first storage node;

The receiving module is further configured to receive the unique identification information of the required file segment sent by the first storage node;

The sending module is further configured to send a demand file fragment to the first storage node; the demand file fragment is obtained through local query according to the unique identification information.

On the one hand, an embodiment of the present application provides an electronic device, the electronic device includes a processor and a memory, at least one instruction is stored in the memory, and the at least one instruction is loaded and executed by the processor to implement the above The described method of obtaining the file.

On the one hand, an embodiment of the present application provides an electronic device. The electronic device includes a processor and a memory, at least one instruction is stored in the memory, and the at least one instruction is loaded and executed by the processor to realize the above-mentioned The file storage method described above.

On the one hand, the embodiment of the present application provides a computer-readable storage medium, at least one instruction is stored in the computer-readable storage medium, and the at least one instruction is loaded and executed by a processor to implement the file acquisition method as described above.

On the one hand, an embodiment of the present application provides a computer-readable storage medium, at least one instruction is stored in the computer-readable storage medium, and at least one instruction is loaded and executed by a processor to implement the file storage method as described above.

The beneficial effects brought by the technical solutions provided by the embodiments of the present application are at least:

When the second storage node detects that the first ledger of the first storage node matches the second ledger in the second storage node, it sends the required file fragment to the first storage node, since the first ledger contains the first storage node The operation records of the file fragments stored in the distributed file storage system, so the second storage node can determine whether the first node is a legitimate user in the distributed file storage system based on whether the first ledger matches the second ledger, and solve Solve the problem of the access and/or download behavior failure of legal users that may be caused by irregularly modifying the file name anti-hotlinking in related technologies. On the basis of realizing anti-hotlinking, the failure of legitimate users to download and/or access files The rate improves the fluency of users obtaining files.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings that need to be used in the description of the embodiments will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present application. For those skilled in the art, other drawings can also be obtained based on these drawings without creative effort.

Fig. 1 is a schematic diagram of an implementation environment of a file acquisition method provided by an exemplary embodiment of the present application;

Fig. 2 is a method flowchart of a file acquisition method provided by an exemplary embodiment of the present application;

Fig. 3 is a structure diagram of a specific embodiment of a file acquisition method provided by an exemplary embodiment of the present application;

Fig. 4 is a method flowchart of a file acquisition method provided by an exemplary embodiment of the present application;

Fig. 5 is a method flowchart of a file acquisition method provided by an exemplary embodiment of the present application;

Fig. 6 is a structure diagram of a specific embodiment of a file acquisition method provided by an exemplary embodiment of the present application;

Fig. 7 is a method flowchart of a file acquisition method provided by an exemplary embodiment of the present application;

Fig. 8 is a method flowchart of a file storage method provided by an exemplary embodiment of the present application;

Fig. 9 is a structure diagram of a specific embodiment of a file storage method provided by an exemplary embodiment of the present application;

Fig. 10 is an architecture diagram of a specific embodiment of a file storage and acquisition method provided by an exemplary embodiment of the present application;

Fig. 11 is a device block diagram of a file acquisition device provided by an exemplary embodiment of the present application;

Fig. 12 is a device block diagram of a file acquisition device provided by an exemplary embodiment of the present application;

Fig. 13 is a device block diagram of an electronic device provided by an exemplary embodiment of the present application;

Fig. 14 is a device block diagram of an electronic device provided by an exemplary embodiment of the present application.

Detailed ways

In order to make the purpose, technical solution and advantages of the present application clearer, the implementation manners of the present application will be further described in detail below in conjunction with the accompanying drawings.

For the convenience of understanding, the nouns involved in the embodiments of the present application are explained below:

Distributed file storage system: It is a storage system that divides a file into multiple file fragments and stores them in at least two electronic devices; or stores multiple sub-files of a file in at least two electronic devices; this application expresses File fragments and sub-files are collectively referred to as file fragments in . Optionally, the distributed file storage system in this application is an interplanetary file system.

Storage node: It is an electronic device that stores file fragments in a distributed file storage system, and each storage node stores a ledger.

Index node: It is an electronic device that stores the operation records of each file fragment in the distributed file storage system. Each index node stores the unique identification information of the files stored in the distributed file storage system and the general ledger. Among them, the operation record of each file segment refers to the operation record of each storage node in the distributed file storage system on the file segment stored in the distributed file storage system, and the storage node can query and store the required file segment through the index node other storage nodes; optionally, the index nodes in the distributed storage nodes can constitute a blockchain platform, and each index node can be a blockchain node in the blockchain platform. Exemplarily, in the embodiment of this application, the block chain platform is taken as an example, which refers to the index node of the distributed file storage system.

Inter Planetary File System (IPFS): It is a global, peer-to-peer distributed file storage system.

Ledger: It is the operation record of storage nodes operating on file fragments stored in the distributed file storage system. Optionally, the ledger includes at least one of a sent list, an acquired list, a modified list, a deleted list, and an unfinished list. The sending list is the operation record of the file fragment sent by the storage node to other storage nodes, which includes the unique identification information of the file fragment sent by the storage node and the device identification of the sending object; the obtained list is the file obtained by the storage node from other storage nodes Fragment operation records, which include the unique identification information of the file fragment acquired by the storage node, the device identifier of the storage node that sent the file fragment, and the device identifier of the storage node that modified, sent and/or received the file fragment; The modification list is the unique identification information of the file fragments modified by the storage node; the deletion list is the unique identification information of the file fragments that the storage node has acquired but deleted; the unfinished list is the storage node’s response to the acquisition requests of other storage nodes. Unique identification information for file fragments that have not yet been sent.

For example, storage node 1 sends file segment A to storage node 2, receives file segment B sent by storage node 3, modifies file segment C, deletes file segment D, and needs to send file E to storage node 4, then storage node 1 The sending list of ledger 1 contains the unique identification information of file fragment A and the device identifier of storage node 2; the acquired list of ledger 1 contains the unique identification information of file fragment B and the device identifier of storage node 3; the modification of ledger 1 The list contains the unique identification information of file fragment C and/or the unique identification information of the modified file fragment C; the deletion list of ledger 1 contains the unique identification information of file fragment D; the unfinished list of ledger 1 contains the unique identification information of file fragment E identifying information.

Device ID: It is the number identification of storage nodes and index nodes in the distributed file storage system. Any storage node or index node in the distributed file storage system can establish a connection with the electronic device corresponding to the device ID through the device ID.

Unique identification information: It is the unique coded information corresponding to the file fragment stored in the distributed file storage system, and the storage node can generate the unique identification information of the file fragment according to the file fragment. Wherein, the unique identification information of each file or file fragment is unique. Optionally, in the distributed file storage system, the unique identification may be the hash value of the file and the file fragment. In the following description, the hash value is used as an example to refer to the unique identification information of the file and the file fragment.

Blockchain platform: It is a network platform composed of index nodes in the distributed storage system. In the blockchain platform, the index nodes are called blockchain nodes, and each blockchain node stores data stored in distributed files. The hash value of the file of the storage system and the general ledger. The blockchain platform includes at least two index nodes connected by communication, each index node is a blockchain node in the blockchain platform, and each blockchain node stores the general ledger of the blockchain platform. At least two blockchain nodes synchronize their respective stored ledgers through a wired or wireless network. The blockchain platform communicates with at least one storage node in the distributed file storage system, and receives the ledger sent by at least one storage node in the distributed file storage system.

General ledger: It is the ledger of each storage node in the distributed file storage system, which contains the operation record of each file fragment stored in the distributed file storage system, the device identification of each storage node, and the ledger of the storage node. content.

Leader Node: It is the blockchain node responsible for communicating with storage nodes in the blockchain platform. The leader node is elected from the blockchain nodes that respond to the deposit request sent by the storage node to the blockchain platform.

Please refer to FIG. 1 , which shows a schematic diagram of an implementation environment of a file acquisition method provided by an exemplary embodiment of the present application. As shown in FIG. 1 , the implementation environment includes a blockchain platform 100 and a distributed file storage system 200 .

As shown in the figure, the block chain platform 100 includes a plurality of block chain nodes 110, 111, 112, 113, 114, 115, etc., each block chain node stores the general ledger book of the block chain platform, and multiple block chain nodes Block chain nodes can synchronize the ledger through wired or wireless networks.

For example, when the general ledger stored in the blockchain node 110 changes, the blockchain node 110 broadcasts the changed general ledger to other blockchain nodes in the blockchain platform 100, and other blockchain nodes receive the broadcast After that, update the general ledger it stores. Among them, the general ledger includes the operation records of each storage node in the distributed file storage system 200 on the files stored in the distributed file storage system 200, and the block chain platform 100 and the storage nodes in the distributed file storage system 200 The communication connection acquires the ledger sent by the storage nodes, so as to obtain the operation record of each storage node on the files stored in the distributed file storage system 200 .

The distributed file storage system 200 includes a plurality of storage nodes 210, 211, 212, 213, 214, etc., and a user can divide a target file to be stored into at least two target file segments and store them in at least two storage nodes. Each storage node in the distributed file storage system 200 stores its own ledger.

For example, the storage node 210 has sent the file fragment X to the storage node 211, then the hash value of the file fragment X and the device identification of the storage node 211 are stored in the delivery list in the ledger of the storage node 210, indicating that the file fragment X has been sent to the storage node 211. Send the file fragment X; at the same time, the hash value of the file fragment X and the device identifier of the storage node 210 are stored in the acquired list in the ledger of the storage node 211, indicating that the file fragment X has been obtained from the storage node 210. Storage nodes operate on file fragments, such as sending file fragments, or modifying, deleting, and copying file fragments, etc., will be recorded in the ledger to update the ledger, and broadcast the updated ledger to the blockchain platform 100, after at least one blockchain node in the blockchain platform 100 receives the updated account book, it updates the general ledger stored in the node, and broadcasts the updated general ledger to other blockchain nodes, so that every The general ledgers stored on each blockchain node are synchronized and consistent.

Please refer to FIG. 2 , which shows a method flow chart of a file acquisition method provided by an exemplary embodiment of the present application. The method can be applied to the first storage node of the distributed storage nodes in the implementation environment shown in Figure 1, and the method includes:

Step 201, sending the first ledger to the second storage node in the distributed file storage system.

The first storage node sends the first ledger to the second storage node. Generally speaking, the first storage node sends the first ledger to at least two second storage nodes. When the file fragment of , send the first ledger to a second storage node.

Optionally, the first ledger includes operation records of the first storage node on the file fragments stored in the distributed file storage system. For example, if the first storage node receives the file fragment X sent by the third storage node, and the first storage node modifies the file fragment X, then the unique ID of the file fragment X is stored in the acquired list in the first ledger. Identification information, and the device identification of the third storage node; the unique identification information of the file fragment X and/or the unique identification information of the modified file fragment X are stored in the modification list of the first ledger.

It should be noted that a storage node can be a storage node that requests to obtain a file fragment, or a storage node that sends a file fragment or stores a file fragment. In this application, the first storage node is used to refer to the request The storage node of the file fragment is obtained, and the second storage node refers to the storage node that sends the file fragment and stores the file fragment.

Step 202: Receive a connection establishment instruction sent by the second storage node, where the connection establishment instruction is sent by the second storage node after determining that the first ledger matches the second ledger.

The first storage node receives the connection establishment instruction sent by the second storage node.

Exemplarily, after receiving the first ledger, the second storage node detects whether the first ledger matches the second ledger stored in the second storage node, and if the first ledger matches the second ledger, sends the first ledger to the first storage node Sending a connection establishment instruction, where the connection establishment instruction is used to instruct the first storage node to establish a connection with the second storage node.

The matching between the first ledger and the second ledger means that the operation behavior of the first storage node recorded in the second ledger is the same as that of the first storage node recorded in the first ledger.

For example, if the first storage node sends the file fragment Y to the third storage node in the distributed file storage system, the unique identification information of the file fragment Y will be recorded in the acquired list of the third ledger stored in the third storage node And the device identification of the first storage node; if the third storage node sends the file fragment Y to the second storage node, the unique identification information of the file fragment Y and the device of the third storage node will be recorded on the acquired list of the second ledger. identification, and the device identification of the first storage node; therefore, when the unique identification information of the file segment Y and the device identification of the third storage node are recorded on the sent list of the first ledger, and the obtained list of the second ledger records There is the unique identification information of the file fragment Y, the device identifier of the third storage node and the device identifier of the first storage node, indicating the operation of the first storage node recorded in the first ledger on the file fragment Y (that is, sending the file fragment Y to the first storage node Three nodes) and the operation of the first node recorded in the second account book on the file segment Y (that is, the second storage node receives the file segment Y from the third storage node, and the third storage node receives the file segment Y from the first storage node) is Matched, so the first ledger and the second ledger match.

Optionally, the connection establishment instruction is sent by the second storage node after determining that the first ledger matches the second ledger, and the debt ratio of the first storage node is not higher than the debt ratio threshold. The debt ratio is used to indicate the proportion of the file fragments that the first storage node needs to send to the distributed storage nodes but have not sent to the file fragments transmitted by the first storage node.

Exemplarily, after the second storage node determines that the first ledger matches the second ledger, according to the number of file fragments in the sent list in the first bill and the file fragment data in the unfinished list, the first storage node calculates debt ratio. If the debt ratio is higher than the debt ratio threshold, determine that the first storage node is a malicious node, and stop communicating with the first storage node; if the debt ratio is not higher than the debt ratio threshold, send a connection establishment instruction to the first storage node . Among them, malicious nodes refer to storage nodes with a high debt ratio. Nodes with a high debt ratio are usually storage nodes with system failures. Evil nodes will send wrong ledgers to other storage nodes, or, after responding to transmission requests from other storage nodes, do not send file fragments requested by other storage nodes .

Step 203: Establish a connection with the second storage node according to the connection establishment instruction, and send the unique identification information of the required file segment to the second storage node.

After the first storage node establishes a connection with the second storage node according to the connection establishment instruction sent by the second storage node, it sends the unique identification information of the required file segment to the second storage node. Optionally, the unique identification information of the requirement file segment is a hash value of the requirement file segment.

Exemplarily, when the connection between the first storage node and the second storage node is established, if the first storage node requires file fragment A, file fragment B, and file fragment C, the first storage node sends The node sends the unique identification information of the requirement file fragment A, the unique identification information of the requirement file fragment B, and the unique identification information of the requirement file fragment C.

Step 204: Receive the demand file fragments sent by the second storage node, and combine them to obtain the demand file.

The first storage node receives the demand file fragments sent by the second storage node, and merges the demand file fragments into a demand file.

Exemplarily, after the second storage node receives the unique identification information of the required file segment A, the unique identification information of the required file segment B, and the unique identification information of the required file segment C, according to the acquired unique identification information of the required file segment, through The obtained list in the second account book detects whether there is a required file fragment A, a required file fragment B and/or a required file fragment C locally, and if the required file fragment A is stored locally, then send the required file fragment A to the first storage node ; If there are demand file fragment A and demand file fragment B stored locally, then send demand file fragment A and demand file fragment B to the first storage node; if locally store demand file fragment A and demand file fragment C, send to the first storage node The storage node sends the required file segment A and the required file segment C; if the required file segment B and the required file segment C are stored locally, the required file segment B and the required file segment C are sent to the first storage node. The first storage node receives demand file fragment A, demand file fragment B and demand file fragment C sent by at least two second storage nodes, and merges demand file fragment A, demand file fragment B and demand file fragment C into a demand file.

Fig. 3 is a structure diagram of a specific embodiment of a file acquisition method provided by an exemplary embodiment of the present application. As shown in the figure, user B in the distributed file storage system first initializes its own ledger in step 1; in step 2, it sends the public information and its own ledger to the storage node, where the public information is used to send to the blockchain platform Broadcast user B and the storage node will exchange data; in step 3, the storage node judges whether user B’s ledger matches its own ledger; in step 4, after the storage node judges that user B’s ledger matches its own ledger, and User B establishes a connection; in step 5, user B sends the demand list to the storage node; in step 6, the storage node detects whether the content in the demand list is stored locally; in step 7, the storage node calculates user B's debt ratio ; In step 8, when the content in the demand list is stored in the storage node and the debt ratio of user B is not high, the storage node sends the content required by user B to user B.

To sum up, in this embodiment of the present application, when the second storage node detects that the first ledger of the first storage node matches the second ledger in the second storage node, the required file fragment is sent to the first storage node , since the first ledger contains the operation records of the first storage node on the file fragments stored in the distributed file storage system, the second storage node can determine whether the first node is The legal user in the distributed file storage system solves the problem of the legitimate user’s access and/or download failure that may be caused by irregularly modifying the file name anti-leech link in related technologies. On the basis of realizing the anti-leech link, due to reducing This reduces the failure rate of legitimate users downloading and/or accessing files, and improves the fluency of users obtaining files.

Optionally, the second storage node in the embodiment of the present application calculates the debt ratio of the first storage node through the first ledger, and when the debt ratio is not higher than the debt ratio threshold, sends a connection establishment instruction to the first storage node, avoiding Evil nodes occupy the resources of the distributed file storage system, which improves the work efficiency of the distributed file storage system.

Since each file is stored on a plurality of second storage nodes, when the first storage node needs to obtain a demand file, the first storage node can query at least two second storage nodes ( That is, the second storage node that stores the required file fragment), so as to send the first ledger to at least two storage nodes to establish a connection. Wherein, the blockchain platform communicates with at least one storage node in the distributed file storage system, and obtains the ledger broadcast by at least one node in the distributed file storage system. The embodiment in FIG. 3 will illustrate that the first storage node determines at least two second storage nodes corresponding to the demand file through the blockchain platform.

Please refer to FIG. 3 , which shows a method flow chart of a method for obtaining files provided by an exemplary embodiment of the present application. The method can be applied to the first storage node of the distributed storage nodes in the implementation environment shown in FIG. 1, and the method can be a step before step 201 in the embodiment of FIG. 1, and the method includes:

Step 301, sending the hash value of the required file fragment to the blockchain platform.

The first storage node broadcasts the hash value of the required file segment to the blockchain platform. Wherein, the blockchain platform communicates with at least one storage node in the distributed file storage system, and obtains the ledger broadcast by at least one node in the distributed file storage system.

The blockchain platform stores a general ledger, which includes the operation record of each file stored in the distributed file storage system, including the hash value of the file stored in the distributed file storage system, the hash value stored in the distributed file storage system The hash value of the file segment corresponding to the file in the file storage system, the ledger stored in each storage node in the distributed file storage system, and the device identifier of the storage node corresponding to each ledger.

Exemplarily, when storage node 1 in the distributed file storage system stores file Z in the distributed file storage system, it will register the hash value of file Z on the blockchain platform, since file Z is stored in the distributed file storage The system needs to be divided into file fragment M and file fragment N, and file fragment M is stored in storage node 2, and file fragment M is stored in storage node 3, then the general ledger records the hash value of file Z, file Z The device identifier of storage node 1 corresponding to the hash value of , the correspondence between file Z and file fragment M, file fragment N, the correspondence between file fragment M and storage node 2, and the correspondence between file fragment N and storage node 3.

Exemplarily, if the first storage node requires a demand file X, then send the name of the demand file X to a blockchain node on the blockchain platform, and the blockchain node can query the corresponding demand according to the name of the demand file X The hash value of file X, and the hash values of demand file fragment A, demand file fragment B, and demand file fragment C corresponding to demand file X, and send demand file fragment A, demand file fragment B, and demand file to the first storage node For the hash value of fragment C, the first storage node records the hash values of required file fragment A, required file fragment B, and required file fragment C in the required file list.

The first storage node broadcasts the hash value of required file fragment A, the hash value of required file fragment B, and the hash value of required file C to the blockchain platform, and a blockchain node in the blockchain platform responds with the first Whether the storage node is broadcasting, the device identification of the second storage node 4 storing the required file segment A, the device identification of the second storage node 5 storing the required file segment B and the required segment C are queried on the general ledger.

Step 302, receiving device identifications of at least two second storage nodes sent by the blockchain platform.

The first storage node receives the device identifications of at least two second storage nodes sent by the blockchain platform.

Exemplarily, if the blockchain platform inquires that the second storage node 4 stores the required file segment A, and the second storage node 5 stores the required file segment B and the required file segment C, then the second storage node is sent to the first storage node. Node 4 and the device ID of the second storage node 5.

Step 303: Send the first ledger to at least two second storage nodes according to the device identifiers of the at least two second storage nodes.

The first storage node sends the first ledger to the at least two second storage nodes according to the device identifiers of the at least two second storage nodes.

Exemplarily, the first storage node sends the first ledger to the second storage node 4 and the second storage node 5 after receiving the device identifications of the second storage node 4 and the second storage node 5 sent by the blockchain platform.

To sum up, in the embodiment of this application, the first storage node sends the hash value of the required file fragment to the blockchain platform, and the blockchain platform queries and stores the required file fragment in the general ledger according to the hash value of the required fragment. at least two second storage nodes, and send the device identifiers of the at least two second storage nodes to the first storage node, so that the first storage node can accurately establish the connect.

Please refer to FIG. 5 , which shows a flowchart of a method for obtaining files provided by an exemplary embodiment of the present application. The method can be applied to the first storage node of the distributed storage nodes in the implementation environment shown in Figure 1, and the method can be a step after step 204 in the embodiment of Figure 1, and the method includes:

Step 401: Receive the hash value of the required file segment sent by the second storage node.

When the second storage node sends the required file segment to the first storage node, it also sends the hash value of the required file segment.

Step 402: According to the hash value of the required file segment sent by the second storage node, it is detected whether the required file segment sent by the second storage node is the required file segment to be acquired by the first storage node.

According to the hash value of the demand file fragment sent by the second storage node, the first storage node detects whether the demand file fragment sent by the second storage node is the demand file fragment to be obtained by the first storage node through the demand list in the first ledger .

Step 403, if it is determined that the demand file segment sent by the second storage node is the demand file segment to be acquired by the first storage node, then delete the hash value of the demand file segment from the demand list, and save the hash value of the demand file segment Add it to the acquired list to get the updated first ledger.

If the hash value of the demand file segment sent by the second storage node matches the hash value of the demand file segment stored in the demand list, it is determined that the demand file segment sent by the second storage node is the demand file that the first storage node needs to obtain Fragment, delete the hash value of the required file fragment from the requirement list, and add the hash value of the required file fragment to the acquired list to obtain the updated first ledger.

Step 404, sending the updated first ledger to the blockchain platform for updating the general ledger on the blockchain platform.

The first storage node broadcasts the updated first ledger to the blockchain platform. After a blockchain node in the blockchain platform responds to the broadcast, it updates the locally stored general ledger according to the updated first ledger, and reports to the district Other blockchain nodes in the blockchain platform broadcast the updated ledger to synchronize the ledger.

Fig. 6 is a structure diagram of a specific embodiment of a file acquisition method provided by an exemplary embodiment of the present application. As shown in the figure, in step 1, user B in the distributed file storage system verifies whether the hash value of the content received from the storage node exists in the demand list; in step 2, if the verification is passed, Then return the authentication to the storage node; in step 3, the storage node updates its own ledger according to the authentication returned by user B; in step 4, the storage node broadcasts the updated own ledger to the blockchain platform to update the blockchain platform ledger; in step 5, user B deletes the received content from the demand list and adds it to the obtained list; in step 6, user B updates his own ledger; in step 7, user B sends the blockchain The platform broadcasts the updated self-ledger to update the general ledger of the blockchain platform.

To sum up, in the embodiment of this application, the first storage node verifies whether the demand file fragment sent by the second storage node is the demand file that the first storage node needs to obtain through the hash value of the demand file fragment sent by the second storage node Fragments, improving the accuracy of file fragment acquisition.

Further, in the embodiment of the present application, the updated first ledger is broadcast to the blockchain platform through the first storage node, and the blockchain platform updates the general ledger according to the updated first ledger, which improves the storage capacity of the blockchain platform. The timeliness of the general ledger.

Please refer to FIG. 7 , which shows a flow chart of a method for obtaining files provided by an exemplary embodiment of the present application. The method can be applied to the first storage node of the distributed storage nodes in the implementation environment shown in Figure 1, and the method includes:

Step 501, the first storage node sends the hash value of the required file segment to the blockchain platform.

The first storage node broadcasts the hash value of the required file segment to the blockchain platform. Wherein, the required file fragment is a file fragment of the file that the first storage node needs to obtain.

In step 502, the blockchain platform queries the device identifiers of at least two second storage nodes storing the required file segments through the general ledger according to the hash values of the required file segments.

A block chain node in the block chain platform responds to the broadcast of the first storage node, and according to the hash value of the required file segment, queries the device identification of at least two second storage nodes storing the required file segment in the general ledger .

Step 503, the blockchain platform sends at least two device identifications of the second storage node to the first storage node.

A block chain node in the block chain platform sends identifications of at least two second storage nodes to the first storage node.

Step 504, the first storage node sends the first ledger to the at least two second storage nodes according to the device identifiers of the at least two second storage nodes.

The first storage node sends the first ledger to the at least two second storage nodes according to the device identifiers of the at least two second storage nodes sent by the blockchain platform.

In step 505, the second storage node calculates the debt ratio of the first storage node according to the first ledger after determining that the first ledger matches the second ledger.

After receiving the first ledger, the second storage node detects whether the first ledger matches the second ledger stored in the second storage node, and if the first ledger matches the second ledger, then according to the sent list in the first bill The number of file fragments in , and the file fragment data in the unfinished list, calculate the debt ratio of the first storage node.

Wherein, the matching between the first ledger and the second ledger means that the operation behavior of the first storage node recorded in the second ledger is the same as the operation behavior of the first storage node recorded in the first ledger.

Step 506: If the first ledger matches the second ledger and the debt ratio of the first storage node is not higher than the debt ratio threshold, the second storage node sends a connection establishment instruction to the first storage node.

If it is determined that the first ledger and the second ledger match, then it is determined that the first storage node is a legitimate user in the distributed file storage system, not a hotlink user, and it is determined that the debt ratio of the first storage node is not higher than the debt ratio threshold, then it is determined that the second If one storage node is not a malicious node, the second storage node sends a connection establishment instruction to the first storage node.

Optionally, the second storage node ranks all valid nodes according to the debt ratio of the first storage node, and sends the connection establishment instruction to the first storage node in order of ranking from back to front. Wherein, the valid node is a node in the distributed file storage system that has sent the ledger to the second storage node and whose debt ratio is not higher than the debt ratio threshold.

The second storage node may have responded to the sending requests of multiple other storage nodes, so the second storage node needs to sort the order of sending file segments. After the second storage node calculates the debt ratio of all valid nodes, the debt ratio of the first storage node ranks among all valid nodes. If there are 10 valid nodes, the debt ratio of the first storage node ranks among all valid nodes If the ranking is third, the order in which the second storage node sends file fragments to the first storage node is seventh.

Step 507, the first storage node establishes a connection with the second storage node according to the connection establishment instruction, and sends the hash value of the required file segment to the second storage node.

After the first storage node establishes a connection with the second storage node according to the connection establishment instruction sent by the second storage node, it sends the hash value of the required file segment to the second storage node.

Step 508, the second storage node sends the required file segment and the hash value of the required file segment to the first storage node according to the hash value of the required file segment sent by the first storage node.

Exemplarily, after the second storage node receives the hash value of the required file fragment, it detects whether there is a required file fragment stored locally through the obtained list in the second ledger, and if there is a required file fragment stored locally, it sends a request to the first storage node. The node sends the requirement file fragment and the hash value of the requirement file fragment.

Step 509, the first storage node receives the demand file fragments sent by the second storage node, and combines them to obtain the demand file.

After receiving the demand file fragments sent by at least two second storage nodes, the first storage node merges the demand file fragments into a demand file.

Step 510, the first storage node detects whether the required file segment sent by the second storage node is the required file segment to be acquired by the first storage node according to the hash value of the required file segment sent by the second storage node.

According to the hash value of the demand file fragment sent by the second storage node, the first storage node detects whether the demand file fragment sent by the second storage node is the demand file fragment to be obtained by the first storage node through the demand list in the first ledger .

If the demand file fragment is the demand file fragment that the first storage node needs to obtain, then enter step 511; if the demand file fragment is not the demand file fragment that the first storage node needs to obtain, then resend the wrong demand file to the block chain platform The fragment's hash value.

Step 511, after the first storage node determines that the required file segment sent by the second storage node is the required file segment to be obtained by the first storage node, delete the hash value of the required file segment from the demand list, and save the required file segment The hash value is added to the acquired list to obtain the updated first ledger.

If the hash value of the demand file segment sent by the second storage node matches the hash value of the demand file segment stored in the demand list, it is determined that the demand file segment sent by the second storage node is the demand file that the first storage node needs to obtain Fragment, delete the hash value of the required file fragment from the requirement list, and add the hash value of the required file fragment to the acquired list to obtain the updated first ledger.

Step 512, the first storage node sends the updated first ledger to the blockchain platform, so that the blockchain platform can update the general ledger.

The first storage node broadcasts the updated first account book to the blockchain platform, and multiple blockchain nodes in the blockchain platform are querying the broadcast content in the blockchain platform, and one of the blockchain nodes responds to the first After the broadcast of the storage node, the locally stored general ledger is updated according to the updated first ledger, and the updated general ledger is broadcast to other blockchain nodes in the blockchain platform to synchronize the general ledger.

Step 513, the first storage node sends a confirmation result to the second storage node.

After the first storage node determines that the demand file segment sent by the second storage node is the demand file segment that the first storage node needs to obtain, it sends a confirmation result to the second storage node, and the confirmation result is used to inform the second storage node of the demand file it sends The file fragment is a demand file fragment required by the first storage node.

In step 514, the second storage node adds the hash value of the required file segment to the delivery list of the second ledger to obtain an updated second ledger.

After receiving the confirmation result sent by the first storage node, the second storage node adds the hash value of the required file fragment to the delivery list of the second ledger to obtain an updated second ledger.

Step 515, sending the updated second ledger.

The second storage node broadcasts the updated second account book to the blockchain platform, and multiple blockchain nodes in the blockchain platform are querying the broadcast content in the blockchain platform, and one of the blockchain nodes responds to the second After the broadcast of the storage node, the locally stored general ledger is updated according to the updated second ledger, and the updated general ledger is broadcast to other blockchain nodes in the blockchain platform to synchronize the general ledger.

To sum up, in this embodiment of the present application, when the second storage node detects that the first ledger of the first storage node matches the second ledger in the second storage node, the required file fragment is sent to the first storage node , since the first ledger contains the operation records of the first storage node on the file fragments stored in the distributed file storage system, the second storage node can determine whether the first node is The legal user in the distributed file storage system solves the problem of the legitimate user’s access and/or download failure that may be caused by irregularly modifying the file name anti-leech link in related technologies. On the basis of realizing the anti-leech link, due to reducing This reduces the failure rate of legitimate users downloading and/or accessing files, and improves the fluency of users obtaining files.

Optionally, the second storage node in the embodiment of the present application calculates the debt ratio of the first storage node through the first ledger, and when the debt ratio is not higher than the debt ratio threshold, sends a connection establishment instruction to the first storage node, avoiding Evil nodes occupy the resources of the distributed file storage system, which improves the work efficiency of the distributed file storage system.

Optionally, the first storage node in the embodiment of the present application sends the hash value of the required file fragment to the blockchain platform, and the blockchain platform queries the general ledger for storing the required file fragment according to the hash value of the required file fragment. At least two second storage nodes, sending device identifications of at least two second storage nodes to the first storage node, so that the first storage node can accurately establish a connection with at least two second storage nodes storing required file segments .

Optionally, the first storage node in the embodiment of the present application verifies whether the demand file fragment sent by the second storage node is the demand file fragment that the first storage node needs to obtain by using the hash value of the demand file fragment sent by the second storage node This prevents the first storage node from receiving an incorrect file segment due to a system failure of the second storage node, and improves the accuracy of obtaining the file segment.

Optionally, in this embodiment of the application, the updated first ledger and the updated second ledger are broadcast to the blockchain platform through the first storage node and the second storage node, and the blockchain platform The ledger and the updated second ledger update the general ledger, which improves the timeliness of the general ledger stored in the blockchain platform.

Before the first storage node acquires the required file segments from the at least two second storage nodes, one second storage node of the at least two second storage nodes may store the target file in the distributed file storage system. The embodiments of FIG. 8 and FIG. 9 will illustrate the storage process of the second storage node storing the target file in the distributed file storage system.

Please refer to FIG. 8 , which shows a method flowchart of a file storage method provided by an exemplary embodiment of the present application. The method can be applied to a second storage node of the distributed storage nodes in the implementation environment shown in FIG. 1, and the method can be the method before step 201 in the embodiment of FIG. 2, and the method includes:

Step 601, the second storage node sends a storage request to the blockchain platform.

The second storage node broadcasts a storage request to the blockchain platform, and the storage request is used to inform the blockchain platform that the second storage node requests to store the target file in the distributed file storage system.

Step 602, n blockchain nodes in the blockchain platform start a timer with a random duration according to the storage request, n is a natural number, n≥2.

Exemplarily, n blockchain nodes respond to the storage request of the second storage node, and after the first time period passes, the n blockchain nodes enter the activation state and send activation signaling to each other; after the second time period After a period, the n blockchain nodes in the activated state start a timer with a random duration at the same time.

Step 603, the i-th blockchain node among the n blockchain nodes removes the other n-1 blockchain nodes of the i-th blockchain node from the n blockchain nodes after the timer expires Send the i-th timing completion signaling, i is a natural number, 1≤i≤n.

After the timer expires, the i-th blockchain node sends the i-th timing completion signaling to the other n-1 blockchain nodes among the n blockchain nodes. Wherein, the i-th timing completion signaling carries the time when the timer of the i-th blockchain node expires and the device identifier of the i-th blockchain node.

Step 604, when the j-th blockchain node among the n blockchain nodes receives the timing completion signaling, if the timer of the j-th blockchain node has not timed out, stop the timer and send to the n districts The other n-1 blockchain nodes except the jth blockchain node among the blockchain nodes send received signaling, j is a natural number, 1≤j≤n.

When the j-th blockchain node receives the timing completion signaling sent by other blockchain nodes, if the timer of the j-th blockchain node has not timed out, it will stop the timer and send data to other n-1 blocks Chain nodes send received signaling. Among them, the jth received signaling carries the device identification of the jth blockchain node.

Step 605, after receiving the timing completion signaling and the received signaling between the n blockchain nodes, according to the timing completion signaling, the blockchain node with the earliest timer timeout time is taken as the leader node.

After receiving the signaling sent by other blockchain nodes, any blockchain node in the n blockchain nodes will time the timing according to the timing completion time carried in the timing completion signaling and the The blockchain node with the earliest completion time is elected as the leader node, which is used to communicate with the second storage node and forward the information sent by the second storage node.

Step 606, the second storage node sends the hash value of the target file to the leader node.

The second storage node calculates the hash value of the target file to be stored, and sends the hash value of the target file fragment to the leader node.

Step 607, the leader node sends the hash value of the target file to other blockchain nodes in the blockchain platform.

After the leader node receives the hash value of the target file, it sends the hash value of the target file to other (n-1) blockchain nodes.

Step 608, the leader node and other blockchain nodes respectively detect whether the hash value of the target file exists in the blockchain platform, and obtain node verification results.

The leader node and other blockchain nodes respectively detect whether the hash value of the target file exists in the general ledger, and obtain the node verification results. If the leader node or other blockchain nodes determine that the general ledger does not contain the hash value of the target file fragment, the node verification result is passed. The hash value of the target file fragment does not exist on the general ledger, indicating that any storage node on the distributed file storage system does not store the target file fragment, so it is determined that the target file is the original content of the second storage node, not plagiarized content.

The general ledger of the blockchain platform records the hash value of the file stored in the distributed file storage system. The leader node and other blockchain nodes judge whether there is a hash value of the target file in their own general ledger. There are other storage nodes to store the target file in the distributed file storage system, so as to judge the originality of the target file.

Step 609 , when the leader node determines that the verification results of the nodes include (n/2+1) nodes whose verification results are passed, then determine that the verification results are passed, and send the verification result to the second storage node to indicate the passed.

The leader node counts the node verification results of the leader node and other blockchain nodes. If it is determined that (n/2+1) node verification results are passed in the node verification result, then the verification result is determined to be passed and sent to the second storage node. It is used to indicate the verification result of passing; if it is determined that the node verification result does not contain (n/2+1) node verification results are passed, then it is determined that the verification result is not passed, and the second storage node is sent to the second storage node. A verification result, where the failed verification result is used to prohibit the second storage node from storing the target file segment in the distributed file storage system.

Step 610, the second storage node stores the target file segment in the distributed file storage system according to the passed verification result.

The second storage node stores the target file segment in the distributed file storage system according to the verification result indicating passing.

Fig. 9 is a structural diagram of a specific embodiment of a file storage method provided by an exemplary embodiment of the present application. As shown in the figure, in step 1, user A produces content and calculates the hash value of the content; in step 2, user A broadcasts a storage request to the blockchain platform, and a verification group composed of at least one blockchain node responds to its Broadcast; in step 3, the verification group elects a leader node; in step 4, the leader node replies to user A’s storage request; in step 5, user A sends a verification request to the leader node, which carries the content to be stored hash value; in steps 7 and 8, each blockchain node in the verification group checks whether the hash value of the content to be stored is saved in the blockchain general ledger; in step 8, the verification group Send their verification results to each other to start to form a consensus; in step 9, the leader node counts the verification results; in step 10, the leader node sends the verification result to user A.

Fig. 10 is an architecture diagram of a specific embodiment of a file storage and retrieval method provided by an exemplary embodiment of the present application. As shown in the figure, the architecture is divided into two parts. One part is that user A stores the generated content in the IPFS system, and the other part is that user B obtains the content stored by user A from the IPFS system. The specific implementation method can refer to the figure 3. The implementation manners in FIG. 6 and FIG. 9 will not be repeated here.

To sum up, in the embodiment of this application, the second storage node sends the hash value of the target file to the leader node, and the leader node and other blockchain nodes detect whether the hash value of the target file exists on the blockchain platform Get the verification result, if the hash value of the target file does not exist on the blockchain platform, it means that the target file is original and not plagiarized by the second storage node, and then allows the second storage node to store the target file on the distributed file storage system files, reducing the risk of infringement of files stored on the distributed file storage system.

Please refer to FIG. 11 , which shows a structural block diagram of a file acquisition device provided by an exemplary embodiment of the present application. As shown in the figure, the device can be applied to one of the storage nodes in the implementation environment shown in FIG. 1 In the first storage node, the device includes a sending module 810, a receiving module 820, and a processing module 830:

The sending module 810 is configured to implement step 201, step 203, step 301, step 303, step 404, step 501, step 504, step 507, and step 512 in the above-mentioned embodiment of FIG. 2, FIG. 3, FIG. 5 or FIG. , step 513 and other sending steps, and other implicit sending steps.

The receiving module 820 is configured to implement step 202, step 204, step 302, step 401, step 503, step 506, step 508, and other implicit Receive steps.

The processing module 830 is configured to implement step 402, step 403, step 509, step 510, step 511, and other implicit processing steps in the above embodiment in FIG. 5 or FIG. 7 .

Please refer to FIG. 12 , which shows a structural block diagram of a file acquisition device provided by an exemplary embodiment of the present application. As shown in the figure, the device can be applied to one of the storage nodes in the implementation environment shown in FIG. 1 In the second storage node, the device includes a sending module 910, a receiving module 920, and a processing module 930:

The sending module 910 is configured to implement sending steps such as step 506, step 508, and step 515 in the above-mentioned embodiment in FIG. 7, and other implicit sending steps.

The receiving module 920 is configured to implement step 504, step 507, step 513, and other implicit receiving steps in the above embodiment in FIG. 7 .

The processing module 930 is configured to implement step 505 in the above embodiment of FIG. 7 and other implicit processing steps.

Please refer to FIG. 13 , which shows a structural block diagram of an electronic device provided by an exemplary embodiment of the present application. The device includes: a processor 1010 , a memory 1020 and a communication interface 1030 .

The processor 1010 may be a central processing unit (English: central processing unit, CPU), a network processor (English: network processor, NP) or a combination of CPU and NP. The processor 1010 may further include a hardware chip. The aforementioned hardware chip may be an application-specific integrated circuit (English: application-specific integrated circuit, ASIC), a programmable logic device (English: programmable logic device, PLD) or a combination thereof. The above-mentioned PLD may be a complex programmable logic device (English: complex programmable logic device, CPLD), field-programmable logic gate array (English: field-programmable gate array, FPGA), general array logic (English: generic array logic, GAL) or any combination thereof.

The memory 1020 is connected to the processor 1010 through a bus or other means, at least one instruction, at least one section of program, code set or instruction set is stored in the memory 1020, and the above-mentioned at least one instruction, at least one section of program, code set or instruction set is controlled by the processor 1010 Load and execute to realize the file acquisition method in the above embodiment. The memory 1020 may be a volatile memory (English: volatile memory), a non-volatile memory (English: non-volatile memory) or a combination thereof. The volatile memory can be random access memory (English: random-access memory, RAM), such as static random access memory (English: static random access memory, SRAM), dynamic random access memory (English: dynamic random access memory) , DRAM). The non-volatile 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 (English: erasable programmable read only memory, EPROM), electrically erasable programmable read-only memory (English: electrically erasable programmable read-only memory, EEPROM). The non-volatile memory may also be a flash memory (English: flash memory), a magnetic memory, such as a magnetic tape (English: magnetic tape), a floppy disk (English: floppy disk), and a hard disk. The non-volatile memory can also be an optical disk.

The communication interface 1030 is connected to the memory 1020 and the processor 1010 through a bus or other means, and the electronic device can send information to other storage nodes or blockchain nodes through the communication interface 1030, or receive information from other storage nodes or blockchain nodes through the communication interface 1030. The information sent by the node.

The present application also provides a computer-readable storage medium, wherein at least one instruction, at least one program, code set or instruction set is stored in the storage medium, and the at least one instruction, the at least one program, the code set or The instruction set is loaded and executed by the processor to implement the file acquisition method provided by the above method embodiment.

The present application also provides a computer program product containing instructions, which, when run on a computer, causes the computer to execute the file acquisition method described in the above aspects.

Please refer to FIG. 14 , which shows a structural block diagram of an electronic device provided by an exemplary embodiment of the present application. The device includes: a processor 1110 , a memory 1120 and a communication interface 1130 .

The processor 1110 may be a central processing unit (English: central processing unit, CPU), a network processor (English: network processor, NP) or a combination of CPU and NP. The processor 1110 may further include a hardware chip. The aforementioned hardware chip may be an application-specific integrated circuit (English: application-specific integrated circuit, ASIC), a programmable logic device (English: programmable logic device, PLD) or a combination thereof. The above-mentioned PLD may be a complex programmable logic device (English: complex programmable logic device, CPLD), field-programmable logic gate array (English: field-programmable gate array, FPGA), general array logic (English: generic array logic, GAL) or any combination thereof.

The memory 1120 is connected to the processor 1110 through a bus or in other ways, at least one instruction, at least one section of program, code set or instruction set is stored in the memory 1120, and the above-mentioned at least one instruction, at least one section of program, code set or instruction set is controlled by the processor 1110 Load and execute to implement the file storage method in the above embodiment. The memory 1120 may be a volatile memory (English: volatile memory), a non-volatile memory (English: non-volatile memory) or a combination thereof. The volatile memory can be random access memory (English: random-access memory, RAM), such as static random access memory (English: static random access memory, SRAM), dynamic random access memory (English: dynamic random access memory) , DRAM). The non-volatile 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 (English: erasable programmable read only memory, EPROM), electrically erasable programmable read-only memory (English: electrically erasable programmable read-only memory, EEPROM). The non-volatile memory may also be a flash memory (English: flash memory), a magnetic memory, such as a magnetic tape (English: magnetic tape), a floppy disk (English: floppy disk), and a hard disk. The non-volatile memory can also be an optical disk.

The communication interface 1130 is connected to the memory 1120 and the processor 1110 through a bus or other means, and the electronic device can send information to other storage nodes or blockchain nodes through the communication interface 1130, or receive information from other storage nodes or blockchain nodes through the communication interface 1130. The information sent by the node.

The present application also provides a computer-readable storage medium, wherein at least one instruction, at least one program, code set or instruction set is stored in the storage medium, and the at least one instruction, the at least one program, the code set or The instruction set is loaded and executed by the processor to implement the file storage method provided by the above method embodiments.

The present application also provides a computer program product containing instructions, which, when run on a computer, causes the computer to execute the file storage method described in the above aspects.

It should be understood that the "plurality" mentioned herein refers to two or more than two. "And/or" describes the association relationship of associated objects, indicating that there may be three types of relationships, for example, A and/or B may indicate: A exists alone, A and B exist simultaneously, and B exists independently. The character "/" generally indicates that the contextual objects are an "or" relationship.

The serial numbers of the above embodiments of the present application are for description only, and do not represent the advantages and disadvantages of the embodiments.

Those of ordinary skill in the art can understand that all or part of the steps for implementing the above embodiments can be completed by hardware, and can also be completed by instructing related hardware through a program. The program can be stored in a computer-readable storage medium. The above-mentioned The storage medium mentioned may be a read-only memory, a magnetic disk or an optical disk, and the like.

The above descriptions are only preferred embodiments of the application, and are not intended to limit the application. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the application shall be included in the protection of the application. within range.

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.