CN116305000A - Data circulation method, device and storage medium based on distributed file system - Google Patents

Abstract

The application discloses a data circulation method, device and storage medium based on a distributed file system. Among them, a data circulation method based on a distributed file system includes: the first data owner node confirms the data copyright of the first data it owns through the distributed file system; The first data is stored in the block chain system; and the data user node acquires the data copyright of the first data according to the first data confirmation information.

Description

Data circulation method, device and storage medium based on distributed file system

technical field

The present application relates to the field of information technology, in particular to a data circulation method, device and storage medium based on a distributed file system.

Background technique

Data has become the fifth largest factor of production after land, capital, labor and technology, and plays a decisive role in digital production. As an integration of technologies such as asymmetric encryption, distributed computing, hash pointers, Merkle trees, and digital signatures, blockchain can run through the entire life cycle of data confirmation, storage, circulation, and use. Most of the existing digital copyright technologies extract the feature code of digital copyright, store it in the blockchain as the ID of the copyright, and then assist in extracting the feature code and blockchain by crawling digital resources across the entire network. Compare the feature codes stored in , if the similarity is high, it is judged as plagiarism. However, for all copyright data, especially large file data, there is a problem of low efficiency when directly stored on the blockchain, and the storage and circulation value of copyright data lacks a quantitative evaluation mechanism. In the existing technology, the BitSwap protocol in distributed file systems such as IPFS (Interplanetary File System) defines data exchange rules, manages the distribution of data, and promotes a tradable data market through an incentive mechanism. BitSwap can provide data-level solutions for data storage and circulation, but it still lacks a mechanism for digital copyright confirmation and capitalization of circulation links.

For the above-mentioned technical problems existing in the prior art that cannot satisfy data copyright confirmation, data circulation and data storage at the same time, no effective solution has been proposed yet.

Contents of the invention

Embodiments of the present application provide a data circulation method, device and storage medium based on a distributed file system, so as to at least solve the technical problems existing in the prior art that data copyright confirmation, data circulation and data storage cannot be simultaneously satisfied.

According to an aspect of the embodiment of the present application, a data circulation method based on a distributed file system is provided, including: the first data owner node confirms the data copyright of the first data it owns through the distributed file system; A data owner node stores the confirmed first data in the block chain system; and the data user node obtains the data copyright of the first data according to the first data confirmation information.

According to another aspect of the embodiments of the present application, a storage medium is further provided, and the storage medium includes a stored program, wherein, when the program is running, a processor executes any one of the methods described above.

According to another aspect of the embodiment of the present application, there is also provided a data circulation device based on a distributed file system, including: a data right confirmation module, used for the first data owner node to verify the first The data copyright of the data is confirmed; the data storage module is used for the first data owner node to store the confirmed first data in the block chain system; and the data copyright acquisition module is used for the data user node according to the first data The copyright confirmation information acquires the data copyright of the first data.

According to another aspect of the embodiment of the present application, there is also provided a data circulation device based on a distributed file system, including: a processor; and a memory, connected to the processor, for providing the processor with instructions for processing the following processing steps : The first data owner node confirms the data copyright of the first data owned by the distributed file system; the first data owner node stores the first data whose rights are confirmed in the blockchain system; and the data user node The data copyright of the first data is acquired according to the first data confirmation information.

In the embodiment of this application, the data that needs to be confirmed is confirmed by comparing the hash value through the distributed file system, and the hash value of the confirmed data is stored on the block chain, thereby avoiding the need to Large file data is directly stored, which improves the performance of the blockchain. In addition, the technical solution increases the user's willingness to share data by dividing the nodes participating in the data sharing, thereby enhancing the data circulation. Furthermore, the technical problem existing in the prior art that cannot satisfy data copyright confirmation, data circulation and data storage at the same time is solved.

Description of drawings

The drawings described here are used to provide a further understanding of the application and constitute a part of the application. The schematic embodiments and descriptions of the application are used to explain the application and do not constitute an improper limitation to the application. In the attached picture:

FIG. 1 is a block diagram of a hardware structure for implementing a computing device according to the method described in Embodiment 1 of the present application;

FIG. 2 is a schematic diagram of a data circulation system based on a distributed file system according to Embodiment 1 of the present application;

FIG. 3 is a schematic flowchart of a data circulation method based on a distributed file system according to the first aspect of Embodiment 1 of the present application;

Fig. 4a is another partial flowchart of the distributed file system-based data circulation method according to the first aspect of Embodiment 1 of the present application;

Fig. 4b is a schematic flowchart of yet another part of the distributed file system-based data circulation method according to the first aspect of Embodiment 1 of the present application;

FIG. 5 is a schematic diagram of a data circulation device based on a distributed file system according to Embodiment 2 of the present application; and

FIG. 6 is a schematic diagram of a data circulation device based on a distributed file system according to Embodiment 3 of the present application.

Detailed ways

In order to enable those skilled in the art to better understand the technical solutions of the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Apparently, the described embodiments are only some of the embodiments of the present application, not all of them. Based on the embodiments in this application, all other embodiments obtained by persons of ordinary skill in the art without creative efforts shall fall within the scope of protection of this application.

It should be noted that the terms "first" and "second" in the description and claims of the present application and the above drawings are used to distinguish similar objects, but not necessarily used to describe a specific sequence or sequence. It is to be understood that the data so used are interchangeable under appropriate circumstances such that the embodiments of the application described herein can be practiced in sequences other than those illustrated or described herein. Furthermore, the terms "comprising" and "having", as well as any variations thereof, are intended to cover a non-exclusive inclusion, for example, a process, method, system, product or device comprising a sequence of steps or elements is not necessarily limited to the expressly listed instead, may include other steps or elements not explicitly listed or inherent to the process, method, product or apparatus.

Example 1

According to this embodiment, a method embodiment of a data circulation method based on a distributed file system is provided. It should be noted that the steps shown in the flow charts of the accompanying drawings can be implemented in a computer system such as a set of computer-executable instructions and, although a logical order is shown in the flowcharts, in some cases the steps shown or described may be performed in an order different from that shown or described herein.

The method embodiments provided in this embodiment can be executed in mobile terminals, computer terminals, servers or similar computing devices. FIG. 1 shows a block diagram of a hardware structure of a computing device for implementing a data circulation method based on a distributed file system. As shown in Figure 1, a computing device may include one or more processors (processors may include but not limited to processing devices such as microprocessors MCUs or programmable logic devices FPGAs), memory for storing data, and memory for storing data. Transmission device for communication functions. In addition, it can also include: a display, an input/output interface (I/O interface), a universal serial bus (USB) port (which can be included as one of the ports of the I/O interface), a network interface, a power supply and/or camera. Those of ordinary skill in the art can understand that the structure shown in FIG. 1 is only a schematic diagram, and it does not limit the structure of the above-mentioned electronic device. For example, a computing device may also include more or fewer components than shown in FIG. 1 , or have a different configuration than that shown in FIG. 1 .

It should be noted that the one or more processors and/or other data processing circuits described above may generally be referred to herein as "data processing circuits". The data processing circuit may be implemented in whole or in part as software, hardware, firmware or other arbitrary combinations. Furthermore, the data processing circuitry may be a single independent processing module, or be fully or partially integrated into any of the other elements in the computing device. As mentioned in the embodiment of the present application, the data processing circuit is used as a processor control (for example, the selection of the terminal path of the variable resistor connected to the interface).

The memory can be used to store software programs and modules of application software, such as the program instruction/data storage device corresponding to the data circulation method based on the distributed file system in the embodiment of the present application, and the processor runs the software programs and modules stored in the memory , so as to execute various functional applications and data processing, that is, to realize the data circulation method based on the distributed file system of the above-mentioned application program. The memory may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory may further include memory located remotely from the processor, which remote memory may be connected to the computing device through a network. Examples of the aforementioned networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

Transmission means are used to receive or transmit data via a network. Specific examples of the networks described above may include wireless networks provided by the communications provider of the computing device. In one example, the transmission device includes a network interface controller (NIC), which can be connected to other network devices through a base station so as to communicate with the Internet. In one example, the transmission device may be a radio frequency (Radio Frequency, RF) module, which is used to communicate with the Internet in a wireless manner.

The display can be, for example, a touchscreen liquid crystal display (LCD) that enables a user to interact with a user interface of the computing device.

It should be noted here that, in some optional embodiments, the computing device shown in FIG. 1 above may include hardware elements (including circuits), software elements (including computer codes stored on computer-readable media), or hardware elements. Combination of both Components and Software Components. It should be noted that FIG. 1 is only one example of a particular embodiment, and is intended to illustrate the types of components that may be present in the computing devices described above.

Fig. 2 is a schematic diagram of a data circulation system based on a distributed file system according to this embodiment. Referring to FIG. 2 , the system includes: a distributed file system 100 and a blockchain system 200 . The distributed file system 100 may be, for example, an interplanetary file system, including nodes 110 - 140 . The nodes 110 and 140 are data owner nodes, the node 120 is a data user node, and the node 130 is an issuing agent node.

And the data owner nodes 110 and 140 are used to confirm the rights of the data that they need to publish, and share the confirmed data they own with the data user node 120 and the issuing agent node 130, and through the block chain system 200 to collect corresponding copyright fees from nodes that need to obtain data.

The data user node 140 is used to obtain data from the data owner nodes 110 and 140 or the issuing agent node 130, and pay corresponding copyright fees through the blockchain system 200.

The issuing proxy node 130 is used to obtain data from the data owner nodes 110 and 140 and send data to the data user node 120 .

The data owner nodes 110 and 140, the data user node 120, and the issuing agent node 130 are all nodes in the distributed file system 100, and the roles of each node are not unique. For example, the node 110 in the scenario of this embodiment can be used as a data owner node, but it can also be used as a data user node or an issuing proxy node in other scenarios. The node 120 in the scenario of this embodiment can be used as a data user node, a data owner node or a distribution proxy node, and the node 130 can be used as a distribution proxy node or a data owner node or a data user node.

The block chain system 200 is used to store the data whose rights have been confirmed by the data owner nodes 110 and 140 , and keep accounts for the copyright fees of each node in the distributed file system 100 .

It should be noted that both the distributed file system 100 and the blockchain system 200 in the system are applicable to the hardware structure described above.

In the above operating environment, according to the first aspect of this embodiment, a data circulation method based on a distributed file system is provided. Figure 3 shows a schematic flow chart of the method, as shown in Figure 3, the method includes:

S302: The first data owner node confirms the data copyright of the owned first data through the distributed file system;

S304: the first data owner node stores the confirmed first data in the blockchain system; and

S306: The data user node obtains the data copyright of the first data according to the first data confirmation information.

Specifically, the node 110 (that is, the first data owner node) owns certain data (that is, the first data), and then the node 110 (that is, the first data owner node) confirms the data copyright of the first data The right to publish the first data in the distributed file system 100 . Wherein the distributed file system 100 is, for example, the IPFS distributed file system.

More specifically, the node 110 (that is, the first data owner node) generates a hash value of the first data, and searches in the distributed file system 100 according to the hash value of the first data, thereby determining that in the distributed file Whether there is the same data as the first data in the system 100. When the node 110 (that is, the first data owner node) does not find the same data as the first data in the distributed file system 100, the data copyright of the first data is confirmed. When the node 110 (that is, the first data owner node) searches for the same data as the first data in the distributed file system 100, it is determined that the first data already has a data copyright in the distributed file system 100 (S302) .

Further, after the node 110 (that is, the first data owner node) confirms the data copyright of the first data, the hash value of the confirmed first data and the node 110 (that is, the first data owner node) node) is stored in the blockchain system (S304).

Further, for example, the node 110 (that is, the first data owner node) has confirmed the ownership of the first data in the distributed file system 100 , thus completing the publication of the first data in the distributed file system 100 . Afterwards, node 110 (i.e., the first data owner node) broadcasts the information that the first data has been released, and then other nodes receive the information that the first data has been confirmed, so that other nodes can send information to node 110 (i.e., The first data owner node) requests to obtain the first data.

When the node 120 (ie, the data user node) needs to obtain the first data, it will pay the corresponding copyright fee to the node 110 (ie, the first data owner node), so as to obtain the first data. The copyright fee paid by the node 120 (ie, the data user node) for obtaining the first data is set by the node 110 (ie, the first data owner node). In addition, when the node 120 (that is, the data user node) obtains the first data, it can also serve as an issuing agent node and share the first data with other nodes. For example, when other nodes obtain the first data from the node 120, when the node 120 shares the first data with the node, it will charge the node the copyright fee for sharing the first data, so as to obtain the sharing of the first data (S306).

As mentioned in the background technology, data has become the fifth largest factor of production after land, capital, labor and technology, and plays a decisive role in digital production. As an integration of technologies such as asymmetric encryption, distributed computing, hash pointers, Merkle trees, and digital signatures, blockchain can run through the entire life cycle of data confirmation, storage, circulation, and use. Most of the existing digital copyright technologies extract the feature code of digital copyright, store it in the blockchain as the ID of the copyright, and then assist in extracting the feature code and blockchain by crawling digital resources across the entire network. Compare the feature codes stored in , if the similarity is high, it is judged as plagiarism. However, for all copyright data, especially large file data, there is a problem of low efficiency when directly stored on the blockchain, and the storage and circulation value of copyright data lacks a quantitative evaluation mechanism. In the existing technology, the BitSwap protocol in the IPFS distributed file system defines data exchange rules, manages the distribution of data, and promotes a tradable data market through incentive mechanisms. BitSwap can provide data-level solutions for data storage and circulation, but it still lacks a mechanism for digital copyright confirmation and capitalization of circulation links.

In view of the technical problems described above, through the technical solution of the embodiment of the present application, through the distributed file system, the data that needs to be confirmed is confirmed by comparing the hash value, and the hash value of the confirmed data is stored in the On the blockchain system, it avoids directly storing large file data and improves the performance of the blockchain. In addition, the technical solution increases the user's willingness to share data by dividing the nodes participating in the data sharing, thereby enhancing the data circulation. Furthermore, the technical problem existing in the prior art that cannot satisfy data copyright confirmation, data circulation and data storage at the same time is solved.

Optionally, the first data owner node performs the operation of confirming the data copyright of the owned first data through the distributed file system, including: the first data owner node uses the distributed file system according to the hash of the first data confirming the data copyright of the first data; and storing the hash value of the first data in the block chain system.

Specifically, as shown in FIG. 4a and FIG. 4b, the node 110 (that is, the first data owner node) wants to publish the first data, so as to confirm the right of the first data, then the node 110 (that is, the first data owner node) or node) generates a hash value of the first data according to the first data. Then the node 110 (that is, the first data owner node) obtains the hash values of all data in the distributed file system 100, and sequentially compares the hash values of all data obtained with the hash value of the first data, thereby The node 110 (that is, the first data owner node) can search the distributed file system 100 for the hash values of other data that are the same as the hash value of the first data according to the hash value of the first data, so as to find the distributed file system. Whether the same data as the first data is stored in the file 100 system.

Further, when the node 110 (that is, the first data owner node) does not search for the same data as the first data in the distributed file system 100, it means that no data that is the same as the first data has been confirmed. , so that the node 110 (ie, the first data owner node) confirms the data copyright of the first data.

Further, the node 110 (that is, the first data owner node) sends the hash value of the first data, the data version ID of the first data after confirmation, and the author ID of the first data (that is, the data owner node ID ) is stored in the block chain system 200.

Therefore, this technical solution uses the distributed file system to confirm the rights of the data that needs to be confirmed by comparing the hash value, and stores the hash value of the confirmed data on the blockchain system, thus avoiding the need to transfer large data. The file data is directly stored, which improves the performance of the blockchain system.

Optionally, the method further includes: the second data owner node determines the second data that is the same as the first data through the distributed file system according to the hash value of the first data; The stamp is compared with the timestamp of the first data; and in the case that the timestamp of the second data is different from the timestamp of the first data, the data copyright of the first data is confirmed.

Specifically, as shown in FIG. 4a and FIG. 4b, the node 140 (the second data owner node) needs to publish data (that is, the second data) in the distributed file system 100, so as to confirm the right of the second data, Then the node 140 (the second data owner node) will obtain the hash value of the second data, and search the distributed file system 100 for the hash value of the data that is the same as the hash value of the second data. When the node 140 (the second data owner node) searches the distributed file system 100 for the same data as the second data as the first data, it obtains the first data from the block chain system 200 when the right is confirmed. timestamp, and obtain the timestamp of the second data, then node 140 (the second data owner node) compares the timestamp corresponding to the first data with the timestamp corresponding to the second data, when the timestamp corresponding to the first data If it is before the time stamp of the second data, it means that the right of the first data has been confirmed before the confirmation of the second data, so the confirmation of the second data fails. Since the second data is the same as the first data, the data copyright of the second data issued by the node 140 (the second data owner node) still belongs to the data owner 110, and the node 140 can be used as a data user node with the second data same first data.

In addition, after the ownership of the first data is confirmed, the node 110 (the first data owner node) updates the first data to obtain a new version of the first data. Then the node 110 (the first data owner node) records the association relationship between the first data version and the second data version of the first data in the blockchain system 200 . In addition, the node 110 (the first data owner node) will also store its private information in the blockchain system 200 .

Therefore, the technical solution confirms the data rights, updates the data version, and associates different versions of data through the distributed file system, thereby avoiding data copyright conflicts in different versions of data. In addition, the author's personal information and other private data are stored in the blockchain system, and only the author's ID participates in the confirmation of the first data, ensuring the privacy of user data.

Optionally, the operation for the data user node to obtain the data copyright of the first data according to the confirmation information of the first data includes: the data user node pays the copyright fee to the data owner node according to the first data; and the data user node Obtain the corresponding first data from the first data owner node.

Specifically, as shown in FIG. 4a and FIG. 4b, when node 120 (that is, a data user node) wants to acquire the first data of node 110 (that is, a first data owner node), it will send a request to node 110 (that is, a The first data owner node) sends a data acquisition request, and the node 120 (that is, the data user node) will pay the node 110 (that is, the first data owner node) through the blockchain system 200 for obtaining the first data. Royalty fees. More specifically, the node 110 (that is, the first data owner node) generates a transaction about the data copyright of the first data in the block chain system 200, and then the block chain system 200 puts the transaction in the block chain system 200, so that the participating nodes in the blockchain system 200 receive the broadcast, and then the participating nodes in the blockchain system 200 stamp the transaction with a time stamp and store it in a block. After that, each participating node determines the verification node through the calculation of the proof of work. Afterwards, the verification node broadcasts its own block to other participating nodes. Each participating node verifies and connects the block. Other participating nodes will confirm whether the transaction contained in this blockchain is valid, confirm that it has not been duplicated and has After a valid digital signature, the block is accepted, and the block is connected to the blockchain at this time.

Thus, the blockchain system 200 completes the recording of the copyright fee received by the node 120 (ie, the data user node) and the copyright fee paid by the node 120 (ie, the data user node).

Further, after paying the copyright fee, the node 120 (ie, the data user node) acquires the corresponding first data from the node 110 (ie, the first data owner node).

Therefore, the technical solution obtains data by paying copyright fees, protects the legitimate rights and interests of data owners, and encourages data owners to make data owners willing to share data.

Optionally, the operation for the data user node to obtain the corresponding first data from the first data owner node includes: the data user node sends a data acquisition request for obtaining the first data to the data owner node; When the node detects that the data user node has acquired the data copyright of the first data according to the data acquisition request, the data user node acquires the first data from the data owner node.

Specifically, as shown in FIG. 4a and FIG. 4b, when the node 120 (that is, the data user node) wants to obtain the first data, it will send a query request to the adjacent node for querying the node to which the first data belongs. If the adjacent node does not own the data copyright of the first data, it will send a query request to other adjacent nodes for querying the node to which the first data belongs, until the node 110 (that is, the first data owner node). Then the node 110 (ie, the first data owner node) returns the response information to the node 120 (ie, the data user node) through the adjacent nodes. The response information includes the ID of the node 110 (ie, the first data owner node).

Further, the node 120 (that is, the data user node) sends a query request to the blockchain system 200 to check whether it has obtained the data copyright of the first data. After receiving the query request, the blockchain system 200, according to The ID of the data copyright of the first data is inquired in the data table whether the node 120 (ie, the data user node) has acquired the data copyright of the data. The data table is stored in the block chain system 200, and the data table is used to record the situation of each node in the distributed file system 100, including information such as node ID and data copyright owned by the node.

For example, the block chain system 200 inquires from the data table whether the node 120 (ie, the data user node) obtains the data copyright of the first data, and then sends the query result to the node 120 (ie, the data user node). When the result of the query is that the node 120 (that is, the data user node) has not obtained the data copyright of the first data, then the node 120 (that is, the data user node) sends the data copyright to the node 110 (that is, the first data owner) through the block chain system 200 . or node) to pay the data copyright of the first data.

Afterwards, node 120 (i.e., the data user node) sends a data acquisition request for obtaining the first data to node 110 (i.e., the first data owner node), and node 110 (i.e., the first data owner node) receives the data acquisition request After the request, a query request for querying whether the node 120 (that is, the data user node) has obtained the data copyright of the first data is sent to the block chain system 200 . After the block chain system 200 receives the query request, it queries the data table whether the node 120 (that is, the data user node) has paid the copyright fee and obtained the data copyright of the first data, and then sends the query result to the node 110 ( That is, the first data owner node). When the query result is that the node 120 (i.e., the data user node) has paid the copyright fee and obtained the data copyright of the first data, then the node 110 (i.e., the first data owner node) sends the data to the node 120 in the distributed file system 100 (ie, the data user node) sends the first data. When the query result is that the node 120 (i.e., the data user node) has not paid the copyright fee, thereby not obtaining the data copyright of the first data, then the node 110 (i.e., the first data owner node) refuses to provide the data copyright to the node 120 (i.e., the data user node) to send the first data.

Therefore, in this technical solution, data security is guaranteed by detecting whether the data user node has paid the copyright fee.

Optionally, the method further includes: when the data user node detects an issuing agent node related to the first data, comparing the performance of the issuing agent node with the performance of the first data owner node; When the performance of the node is better than that of the first data owner node, the first data is acquired from the issuing proxy node.

Specifically, after the node 130, as a data user node, obtains the data copyright of the first data from the node 110 (that is, the first data owner node), it applies to the block chain system 200 to become an issuing agent node, and the block chain system 200 according to After the application request of the node 130, it is determined whether the node 130 has acquired the data copyright of the first data. When the block chain system 200 determines that the node 130 has obtained the data copyright of the first data, it agrees with the application request of the node 130 to become an issuing agent node, and stores the information of the node 130 in the data table for storing the information of the issuing agent node. register. Thus, the node 130 becomes an issuing agent node that can issue the first data on behalf of the agent.

Further, as shown in FIG. 4a and FIG. 4b, before the node 120 (that is, the data user node) obtains the data copyright of the first data, it sends to the blockchain system 200 a query for inquiring whether there is an agent issuing the first data. Issue query requests for agent nodes. After block chain system 200 receives this query request, according to the ID of the data copyright of the first data, query from the data table whether there is an issuing agent node that issues the first data by proxy, and returns the query result to node 120 (that is, data consumer nodes). The issuing agent node is also a data user node, that is, when the data user node applies to the blockchain system 200 for issuing data as an agent, it can become an issuing agent node.

Further, when the result of the query is that the block chain system 200 inquires that there is an issuing agent node that issues the first data, the node 120 (that is, the data user node) will obtain the node list from the adjacent nodes. The node list includes index information such as the transmission rate of the node.

Then the node 120 (that is, the data user node) obtains the index information of the node 110 (that is, the first data owner node) and the index information of the issuing agent node (for example, the node 130) from the node list, and uses the preset The weight calculates respectively the performance value of the node 110 (ie, the first data owner node) and the performance value of the node 130 (ie, the issuing proxy node) according to the index information. Then the node 120 (ie, the data consumer node) compares the performance value of the node 110 (ie, the first data owner node) with the performance value of the node 130 (ie, the issuing agent node).

When the node 120 (that is, the data user node) determines that the performance of the node 130 (that is, the issuing agent node) is better than the performance of the node 110 (that is, the first data owner node), then the node 130 (that is, the issuing agent node) ) sending a data acquisition request for acquiring the first data. After receiving the data acquisition request, the node 130 (ie, the issuing agent node) sends a query request to the blockchain system 200 to check whether the node 120 (ie, the data user node) has acquired the data copyright of the first data. After the blockchain system 200 receives the query request, it queries the data table whether the node 120 (that is, the data user node) has obtained the data copyright of the first data, and then sends the query result to the node 130 (that is, the issuing agent node). node). When the result of the query is that the node 120 (ie, the data user node) has obtained the data copyright of the first data, the issuing proxy node sends the first data to the node 120 (ie, the data user node). When the result of the query is that the node 120 (ie, the data user node) has not acquired the data copyright of the first data, the node 130 (ie, the issuing agent node) refuses to send the first data to the node 120 (ie, the data user node).

When the node 120 (i.e., the data user node) determines that the performance of the node 110 (i.e., the first data owner node) is better than that of the node 130 (i.e., the issuing agent node), the node 110 (i.e., the first data owner node) The owner node) sends a data acquisition request for acquiring the first data. After the node 110 (ie, the first data owner node) receives the data acquisition request, it sends to the blockchain system 200 a query for inquiring whether the node 120 (ie, the data user node) has acquired the data copyright of the first data ask. After the blockchain system 200 receives the query request, it queries the data table whether the node 120 (that is, the data user node) has obtained the data copyright of the first data, and then sends the query result to the node 110 (that is, the first data user node). data owner node). When the query result is that the node 120 (that is, the data user node) has obtained the data copyright of the first data, the node 110 (that is, the first data owner node) sends the first data copyright to the node 120 (that is, the data user node). data. When the query result is that the node 120 (that is, the data user node) has not obtained the data copyright of the first data, then the node 110 (that is, the first data owner node) refuses to send the first data to the node 120 (that is, the data user node). a data.

Therefore, the technical solution acquires the first data through the node with the best performance, which can improve the efficiency and speed of acquiring data.

Optionally, the method further includes: after the data user node acquires the first data from the first data owner node, paying data credits to the first data owner node.

Specifically, the blockchain system is preset with credit rules. The credit rules are: sending data to other nodes can increase the credit value, and receiving data from other nodes can reduce the credit value. Thus, while the node 110 (that is, the first data owner node) sends the first data to the node 120 (that is, the data user node), the blockchain system 200 is the node 120 (that is, the data user node) in the ledger. The corresponding credit points are decreased, and the corresponding credit points are increased for the node 110 (ie, the first data owner node).

Therefore, this technical solution promotes nodes to share data by sharing data with other nodes to increase the credit value and receiving data from other nodes to reduce the credit value.

Optionally, the method further includes: the issuing agent node obtains the first data from the first data owner; and when the issuing agent node shares the first data, obtains a corresponding share from the first data owner node.

Specifically, after acquiring the first data, the node 140 sends an application request to the block chain system 200 to apply for becoming an issuing agent node for issuing the first data, and the block chain system 200 queries the node 140 according to the received application request. Whether the copyright fee for obtaining the first data has been paid, and whether the query node 140 has obtained the first data from the node 110 (ie, the first data owner node). When the blockchain system 200 inquires that the node 140 has not only paid the corresponding copyright fee but also obtained the first data, the blockchain system 200 will record that the node 140 becomes the agency node for issuing the first data. When other nodes also want to obtain the first data, they can obtain the first data from the data user node, and at the same time, the node 140 (that is, the issuing agent node) will charge other nodes that need to obtain the first data Royalty fees. The copyright fee collected by the node 140 (ie, the issuing agent node) is the share from the data owner to the data user.

Therefore, in this technical solution, the data owner node transfers part of the profits from the copyright income to encourage the distribution agent node to share the data, so that the data can be forwarded and the author's copyright income can be promoted.

In addition, referring to FIG. 1 , according to a second aspect of this embodiment, a storage medium is provided. The storage medium includes a stored program, wherein, when the program is running, the processor executes any one of the methods described above.

Therefore, according to this embodiment, through the distributed file system, the data that needs to be confirmed is confirmed by comparing the hash value, and the hash value of the confirmed data is stored on the block chain, thereby avoiding the need for large The file data of the file is directly stored, which improves the performance of the blockchain. In addition, the technical solution increases the user's willingness to share data by dividing the nodes participating in the data sharing, thereby enhancing the data circulation. Furthermore, the technical problem existing in the prior art that cannot satisfy data copyright confirmation, data circulation and data storage at the same time is solved.

It should be noted that for the foregoing method embodiments, for the sake of simple description, they are expressed as a series of action combinations, but those skilled in the art should know that the present invention is not limited by the described action sequence. Because of the present invention, certain steps may be performed in other orders or simultaneously. Secondly, those skilled in the art should also know that the embodiments described in the specification belong to preferred embodiments, and the actions and modules involved are not necessarily required by the present invention.

Through the description of the above embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by means of software plus a necessary general-purpose hardware platform, and of course also by hardware, but in many cases the former is better implementation. Based on such an understanding, the essence of the technical solution of the present invention or the part that contributes to the prior art can be embodied in the form of software products, and the computer software products are stored in a storage medium (such as ROM/RAM, disk, CD) contains several instructions to enable a terminal device (which may be a mobile phone, a computer, a server, or a network device, etc.) to execute the methods described in various embodiments of the present invention.

Example 2

FIG. 5 shows a data circulation device 500 based on a distributed file system according to the first aspect of this embodiment, and the device 500 corresponds to the method according to the first aspect of Embodiment 1. As shown in FIG. 5 , the device 500 includes: a data right confirmation module 510, used for the first data owner node to confirm the data copyright of the first data owned by the first data owner node through a distributed file system; a data storage module 520 for The first data owner node stores the confirmed first data in the blockchain system; and the data copyright acquisition module 530 is used for the data user node to acquire the data copyright of the first data according to the confirmation information of the first data.

Optionally, the data right confirmation module 510 includes: a data right confirmation submodule, the first data owner node confirms the data copyright of the first data according to the hash value of the first data through the distributed file system; The storage submodule stores the hash value of the first data in the block chain system.

Optionally, the device 500 further includes: a first determination module, the second data owner node determines the second data that is the same as the first data through the distributed file system according to the hash value of the first data; the data comparison module compares the second data with The timestamp of the second data that is the same as the first data is compared with the timestamp of the first data; and the first confirmation module, in the case that the timestamp of the second data is different from the timestamp of the first data, Confirm the data copyright of a data.

Optionally, the data copyright acquisition module 530 includes: a fee payment submodule, the data user node pays the copyright fee to the data owner node according to the first data; and a data acquisition submodule, the data user node pays the first data owner node The node acquires the corresponding first data.

Optionally, the data acquisition submodule includes: a request sending unit, the data user node sends a data acquisition request for acquiring the first data to the data owner node; and a data acquisition unit, when the data owner node detects according to the data acquisition request When the data user node has obtained the data copyright of the first data, the data user node obtains the first data from the data owner node.

Optionally, the apparatus 500 further includes: a first comparison module, in the case that the data user node detects an issuing agent node related to the first data, compares the performance of the issuing agent node with the performance of the first data owner node comparison; and the first acquisition module, if the performance of the issuing agent node is better than that of the first data owner node, acquire the first data from the issuing agent node.

Optionally, the apparatus 500 further includes: a point payment module, after the data user node obtains the first data from the first data owner node, pays the data credit points to the first data owner node.

Optionally, the apparatus 500 further includes: a second acquisition module, configured to obtain the first data from the first data owner by the issuing agent node; and a third acquisition module, configured to share the first data by the issuing agent node, Obtain the corresponding share from the first data owner node.

Therefore, according to this embodiment, through the distributed file system, the data that needs to be confirmed is confirmed by comparing the hash value, and the hash value of the confirmed data is stored on the block chain, thereby avoiding the need for large The file data of the file is directly stored, which improves the performance of the blockchain. In addition, the technical solution increases the user's willingness to share data by dividing the nodes participating in the data sharing, thereby enhancing the data circulation. Furthermore, the technical problem existing in the prior art that cannot satisfy data copyright confirmation, data circulation and data storage at the same time is solved.

Example 3

FIG. 6 shows a data circulation device 600 based on a distributed file system according to the first aspect of this embodiment, and the device 600 corresponds to the method according to the first aspect of Embodiment 1. As shown in FIG. 6 , the device 600 includes: a processor 610; and a memory 620 connected to the processor 610 for providing the processor 510 with instructions for processing the following processing steps: the first data owner node passes through the distributed file system Confirm the data copyright of the owned first data; the first data owner node stores the confirmed first data in the blockchain system; and the data user node obtains the first data according to the first data confirmation information data copyright.

Optionally, the first data owner node performs the operation of confirming the data copyright of the owned first data through the distributed file system, including: the first data owner node uses the distributed file system according to the hash of the first data confirming the data copyright of the first data; and storing the hash value of the first data in the block chain system.

Optionally, the apparatus 600 further includes: the second data owner node determines the second data that is the same as the first data through the distributed file system according to the hash value of the first data; comparing the time stamp with the time stamp of the first data; and confirming the data copyright of the first data when the time stamp of the second data is different from the time stamp of the first data.

Optionally, the operation for the data user node to obtain the data copyright of the first data according to the confirmation information of the first data includes: the data user node pays the copyright fee to the data owner node according to the first data; and the data user node Obtain the corresponding first data from the first data owner node.

Optionally, the operation for the data user node to obtain the corresponding first data from the first data owner node includes: the data user node sends a data acquisition request for obtaining the first data to the data owner node; When the node detects that the data user node has acquired the data copyright of the first data according to the data acquisition request, the data user node acquires the first data from the data owner node.

Optionally, the device 600 further includes: when the data user node detects the issuing agent node related to the first data, comparing the performance of the issuing agent node with the performance of the first data owner node; When the performance of the proxy node is better than that of the first data owner node, the first data is acquired from the issuing proxy node.

Optionally, the apparatus 600 further includes: after the data user node acquires the first data from the first data owner node, paying data credits to the first data owner node.

Optionally, the apparatus 600 further includes: the publishing proxy node obtains the first data from the first data owner; and the publishing proxy node obtains a corresponding share from the first data owner node in the case of sharing the first data.

Therefore, according to this embodiment, through the distributed file system, the data that needs to be confirmed is confirmed by comparing the hash value, and the hash value of the confirmed data is stored on the block chain, thereby avoiding the need for large The file data of the file is directly stored, which improves the performance of the blockchain. In addition, the technical solution increases the user's willingness to share data by dividing the nodes participating in the data sharing, thereby enhancing the data circulation. Furthermore, the technical problem existing in the prior art that cannot satisfy data copyright confirmation, data circulation and data storage at the same time is solved.

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

In the above-mentioned embodiments of the present invention, the descriptions of each embodiment have their own emphases, and for parts not described in detail in a certain embodiment, reference may be made to relevant descriptions of other embodiments.

In the several embodiments provided in this application, it should be understood that the disclosed technical content can be realized in other ways. Wherein, the device embodiments described above are only illustrative, for example, the division of the units is only a logical function division, and there may be other division methods in actual implementation, for example, multiple units or components can be combined or can be Integrate into another system, or some features may be ignored, or not implemented. In another point, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces, and the indirect coupling or communication connection of units or modules may be in electrical or other forms.

The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or may be distributed to multiple network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, each unit may exist separately physically, or two or more units may be integrated into one unit. The above-mentioned integrated units can be implemented in the form of hardware or in the form of software functional units.

If the integrated unit is realized in the form of a software function unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on such an understanding, the essence of the technical solution of the present invention or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium , including several instructions to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in various embodiments of the present invention. The aforementioned storage media include: U disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), mobile hard disk, magnetic disk or optical disk and other media that can store program codes. .

The above is only a preferred embodiment of the present invention, it should be pointed out that, for those of ordinary skill in the art, without departing from the principle of the present invention, some improvements and modifications can also be made, and these improvements and modifications can also be made. It should be regarded as the protection scope of the present invention.

Claims (10)

1. A data circulation method based on a distributed file system, comprising: The first data owner node confirms the data copyright of the owned first data through the distributed file system; The first data owner node stores the confirmed first data in the blockchain system; and The data user node acquires the data copyright of the first data according to the first data confirmation information. 2. The method according to claim 1, wherein the first data owner node confirms the data copyright of the owned first data through the distributed file system, including: The first data owner node confirms the data copyright of the first data according to the hash value of the first data through the distributed file system; and storing the hash value of the first data in the block chain system. 3. The method according to claim 2, further comprising: The second data owner node determines the same second data as the first data through the distributed file system according to the hash value of the first data; comparing a timestamp of second data identical to said first data with a timestamp of said first data; and If the time stamp of the second data is different from the time stamp of the first data, the data copyright of the first data is confirmed. 4. The method according to claim 1, wherein the operation for the data user node to obtain the data copyright of the first data according to the right confirmation information of the first data includes: The data user node pays a copyright fee to the data owner node according to the first data; and The data user node obtains corresponding first data from the first data owner node. 5. The method according to claim 4, wherein the operation for the data user node to obtain the corresponding first data from the first data owner node comprises: The data user node sends a data acquisition request for acquiring the first data to the data owner node; and When the data owner node detects that the data user node has acquired the data copyright of the first data according to the data acquisition request, the data user node acquires the data copyright of the first data from the data owner node. Describe the first data. 6. The method according to claim 5, further comprising: In the event that the data consumer node detects an issuing agent node associated with the first data, comparing the performance of the issuing agent node with the performance of the first data owner node; and If the performance of the issuing proxy node is better than that of the first data owner node, the first data is acquired from the issuing proxy node. 7. The method according to claim 5, further comprising: After the data user node obtains the first data from the first data owner node, it pays data credits to the first data owner node. 8. The method of claim 1, further comprising: an issuing agent node acquires the first data from the first data owner; and In the case of sharing the first data, the issuing proxy node obtains corresponding shares from the first data owner node. 9. A storage medium, characterized in that the storage medium includes a stored program, wherein the method according to any one of claims 1 to 8 is executed by a processor when the program is running. 10. A data circulation device based on a distributed file system, characterized in that it comprises: The data right confirmation module is used for the first data owner node to confirm the data copyright of the first data owned by the first data owner node through the distributed file system; A data storage module, used for the first data owner node to store the confirmed first data in the block chain system; and The data copyright acquisition module is used for the data user node to acquire the data copyright of the first data according to the first data confirmation information.

Images