CN110035130B - Data processing method and device - Google Patents

Data processing method and device Download PDF

Info

Publication number
CN110035130B
CN110035130B CN201910334940.7A CN201910334940A CN110035130B CN 110035130 B CN110035130 B CN 110035130B CN 201910334940 A CN201910334940 A CN 201910334940A CN 110035130 B CN110035130 B CN 110035130B
Authority
CN
China
Prior art keywords
node
data
block
module
block chain
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910334940.7A
Other languages
Chinese (zh)
Other versions
CN110035130A (en
Inventor
龙岳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China United Network Communications Group Co Ltd
Original Assignee
China United Network Communications Group Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China United Network Communications Group Co Ltd filed Critical China United Network Communications Group Co Ltd
Priority to CN201910334940.7A priority Critical patent/CN110035130B/en
Publication of CN110035130A publication Critical patent/CN110035130A/en
Application granted granted Critical
Publication of CN110035130B publication Critical patent/CN110035130B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1097Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]

Abstract

The invention provides a data processing method and a data processing device, wherein the address of a node is obtained from a block chain according to the identifier of the node corresponding to data to be stored, and the data to be stored is sent to the corresponding node according to the address of the node, so that the node stores the data to be stored; and storing the data in a block chain mode, so that each node can receive the data sent by the data processing device of the headquarters and respond to local query requirements. According to the invention, data is stored in a block chain mode, cross-node data query can be realized by each node, storage and calculation resources of each node can be fully utilized, and software and hardware investment of a central server is reduced, so that the cost is reduced; each node can inquire data locally, and network transmission resources and time are saved.

Description

Data processing method and device
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a data processing method and apparatus.
Background
For a group company with branches, a central server is generally established in the headquarters, so data all exist in the central server, and branches log in the central server to inquire data. However, most companies specify that each branch can only query its own data, and cannot query across branches. This results in data being too concentrated at the central server, which is a significant investment in both hardware and software. While the branch can waste much time on network transmission when inquiring data, and in addition, the storage and calculation resources of the branch server can not be fully utilized.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides a data processing method and a data processing device, which are used for solving the problems of high data query cost, low efficiency and resource waste of branch institutions.
In order to solve the technical problems, the invention adopts the following technical scheme:
the invention provides a data processing method, which is applied to a peer-to-peer network and comprises the following steps:
determining the identifier of a node corresponding to data to be stored;
acquiring the address of the node from the block chain according to the identifier of the node; the block chain comprises a plurality of sequentially connected data blocks, and each data block is used for storing node data corresponding to the data block;
and sending the data to be stored to a corresponding node according to the address of the node so as to enable the node to store the data to be stored.
Preferably, the sending the data to be stored to the corresponding node specifically includes:
and sending the data to be stored to a corresponding node by adopting an asymmetric encryption mode so as to store the data to be stored in the local after the node decrypts the data.
Further, the method further comprises:
when a joining request sent by a node to be joined is received, node information carried in the joining request is obtained;
initiating a broadcast carrying the node information in a network where the block chain is located, so that each node in the block chain verifies the node information;
and receiving a verification result fed back by each node in the block chain, if the node exceeding a preset threshold passes the verification, generating a data block corresponding to the node to be added, and connecting the generated data block to the tail end of the block chain.
Preferably, the data block includes a block header and a block body, and the block header includes the following field information: the block identification, the Merkle tree root value, the hash value of the previous data block in the block chain and the generation time of the block;
the block body includes the following information: the address, description, authority and identification of the node corresponding to the block.
Further, the method further comprises:
receiving an inquiry scene sent by a node, wherein the inquiry scene is determined after the node counts inquiry frequency based on an inquiry request;
establishing a corresponding relation between a query scene and a node;
and when a scene query request is received, determining a node according to the corresponding relation, and acquiring data of a query scene from the node.
The present invention also provides a data processing apparatus, the apparatus comprising: the device comprises an acquisition module and a sending module;
the acquisition module is used for determining the identifier of the node corresponding to the data to be stored and acquiring the address of the node from the block chain according to the identifier of the node; the block chain comprises a plurality of sequentially connected data blocks, and each data block is used for storing node data corresponding to the data block;
the sending module is used for sending the data to be stored to the corresponding node according to the address of the node, so that the node stores the data to be stored.
Preferably, the sending module is specifically configured to send the data to be stored to a corresponding node in an asymmetric encryption manner, so that the node decrypts the data to be stored and stores the decrypted data in the local area.
Furthermore, the data processing device also comprises a receiving module, a broadcasting module, a judging module and a block chain generating module;
the receiving module is used for receiving a joining request sent by a node to be joined; receiving a verification result fed back by each node in the block chain;
the obtaining module is further configured to obtain node information carried in the joining request sent by the node to be joined when the receiving module receives the joining request;
the broadcast module is configured to initiate a broadcast carrying the node information in a network where the block chain is located, so that each node in the block chain verifies the node information;
and the judging module is used for indicating the block chain generating module to generate a data block corresponding to the node to be added when the node exceeding the preset threshold passes the verification, and connecting the generated data block to the tail end of the block chain.
Preferably, the data block includes a block header and a block body, and the block header includes the following field information: the block identification, the Merkle tree root value, the hash value of the previous data block in the block chain and the generation time of the block;
the block body includes the following information: the address, description, authority and identification of the node corresponding to the block.
Further, the data processing device further comprises an establishing module and a processing module;
the receiving module is further used for receiving an inquiry scene sent by the node, wherein the inquiry scene is determined by the node after the node counts inquiry frequency based on the inquiry request; receiving a scene query request;
the establishing module is used for establishing a corresponding relation between a query scene and a node;
and the processing module is used for determining the nodes according to the corresponding relation and acquiring the data of the query scene from the nodes when the receiving module receives the scene query request sent by the nodes.
The invention utilizes P2P networking technology to establish a collaborative query distributed management platform, namely, a block chain comprising a plurality of sequentially connected data blocks is established, each data block is used for storing node data corresponding to the data block, and each node participates in the recording, storing, maintaining and other works of node information. The data processing device of the headquarter acquires the address of the node from the block chain according to the identifier of the node corresponding to the data to be stored, and sends the data to be stored to the corresponding node according to the address of the node so that the node stores the data to be stored; and storing the data in a block chain mode, so that each node can receive the data sent by the data processing device of the headquarters and respond to local query requirements. According to the invention, data is stored in a block chain mode, cross-node data query can be realized by each node, storage and calculation resources of each node can be fully utilized, and software and hardware investment of a central server is reduced, so that the cost is reduced; each node can inquire data locally, and network transmission resources and time are saved.
Drawings
FIG. 1 is a flow chart of data storage according to an embodiment of the present invention;
FIG. 2 is a block diagram of an embodiment of the present invention;
FIG. 3 is a flow chart of block chain generation according to an embodiment of the present invention;
FIG. 4 is a flow chart of data query according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a data processing apparatus according to an embodiment of the present invention;
FIG. 6 is a second schematic structural diagram of a data processing apparatus according to an embodiment of the present invention;
fig. 7 is a third schematic structural diagram of a data processing apparatus according to an embodiment of the present invention.
Detailed Description
The technical solution of the present invention will be described clearly and completely with reference to the accompanying drawings, and it should be understood that the described embodiments are a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, are within the scope of the present invention.
The embodiment of the invention provides a data processing method, which is applied to a peer-to-peer network, wherein each branch mechanism corresponds to a node in the peer-to-peer network, and each node participates in the recording, storage, maintenance and other work of node information. The data is stored in a block chain mode, the block chain comprises a plurality of sequentially connected data blocks, and each data block is used for storing node data corresponding to the data block.
The data processing flow of an embodiment of the present invention is described in detail below with reference to fig. 1, and as shown in fig. 1, the data processing flow includes the following steps:
and step 11, determining the identifier of the node corresponding to the data to be stored.
Specifically, the data of each branch office is collected to the headquarters, and is issued by the data processing device of the headquarters, and the data processing device of the headquarters determines the identifier of the node for storing the data according to the source of the data to be stored. For example, the operator of each province reports the communication data of the month to the headquarters, and the data processing device of the headquarters determines which province the data comes from, and then determines the identity of the server (i.e., node) of the province.
And step 12, acquiring the address of the node from the block chain according to the identifier of the node.
As shown in fig. 2, the data blocks in the block chain specifically include: the block header and the block body, the block header includes the following field information: a chunk Identification (ID), a Merkle tree root value, a hash value of a previous data chunk in the chunk chain, and a generation time (i.e., timestamp) of the chunk. The Merkle tree root value is the summary of all records on the data block main body and is calculated according to the timestamp and the block main body information; the hash value of the data block can be obtained by calculating the hash value of the Merkle tree root and the hash value of the previous data block, and is written into the block header of the next data block.
The tile body may include the following information: the address of the node corresponding to the block, the description of the node, the authority of the node and the identification of the node.
And the data processing device of the headquarter acquires the address of the node from the block chain according to the identifier of the node.
And step 13, sending the data to be stored to the corresponding node according to the address of the node, so that the node stores the data to be stored.
Specifically, the data processing device of the headquarters adopts an asymmetric encryption mode to send the data to be stored to the corresponding node, so that the node decrypts the data to be stored and stores the decrypted data in the local.
It can be seen from the foregoing steps 11-13 that, in the present invention, a collaborative query distributed management platform is created by using a P2P networking technology, that is, a blockchain including a plurality of sequentially connected data blocks is established, each data block is used for storing node data corresponding to the data block, and each node participates in the recording, storing, maintaining, and the like of node information. The data processing device of the headquarter acquires the address of the node from the block chain according to the identifier of the node corresponding to the data to be stored, and sends the data to be stored to the corresponding node according to the address of the node so that the node stores the data to be stored; and storing the data in a block chain mode, so that each node can receive the data sent by the data processing device of the headquarters and respond to local query requirements. According to the invention, data is stored in a block chain mode, cross-node data query can be realized by each node, storage and calculation resources of each node can be fully utilized, and software and hardware investment of a central server is reduced, so that the cost is reduced; each node can inquire data locally, and network transmission resources and time are saved.
In the embodiment of the present invention, a block chain generation procedure may also be included, and the following describes in detail the block chain generation procedure provided in the embodiment of the present invention with reference to fig. 3. As shown in fig. 3, the block chain generation process includes the following steps:
and step 31, receiving a join request sent by a node to be joined, and acquiring node information carried in the join request.
And a VPN (Virtual Private Network) is used to enable all nodes (including a headquarters node) to be in a local area Network, all nodes in the Network are equally accessed to the Network to form a P2P peer-to-peer Network, and each node participates in the recording of data of all nodes together.
When a new node (i.e., a node to be added) is generated, the new node sends an addition request to a data processing device of the headquarters, the addition request carries node information of the new node, and the data processing device of the headquarters acquires the node information from the addition request.
And step 32, initiating a broadcast carrying node information in the network where the block chain is located, so that each node in the block chain verifies the node information.
Specifically, the node receiving the broadcast message acquires the node information carried in the broadcast message, verifies the validity of the new node by using a public key generated by an asymmetric encryption algorithm, and feeds back the verification result to the data processing device of the headquarters.
And step 33, each node in the block chain feeds back a verification result.
Step 34, if the node exceeding the preset threshold passes the verification, executing step 35; otherwise, the flow ends.
Specifically, the data processing device of the headquarters counts the verification results fed back by each node, and if the node exceeding the preset threshold passes the verification of the node to be added, which indicates that the node to be added is legal, a new data block is generated, and the newly generated data block is added into the block chain (i.e., step 35 is executed); and if the node to be added which is smaller than or equal to the preset threshold passes the verification of the node to be added, the node to be added is proved to be illegal, the node to be added cannot be added into the block chain, and the process is ended.
Preferably, the threshold may be 80%.
And step 35, generating a data block corresponding to the node to be added, and connecting the generated data block to the tail end of the block chain.
Specifically, the newly generated data block is used to store data corresponding to the node to be added, and the structure of the data block is shown in fig. 2, which is not described herein again.
In the embodiment of the present invention, the data processing method further includes a data query process, which is described in detail below with reference to fig. 4. As shown in fig. 4, the data query process includes the following steps:
and step 41, receiving the query scene sent by the node.
Specifically, the query scenario is determined by the node after counting query frequency based on the query request. That is, when a user queries local data on a node, the node records query content, counts query frequency, determines a query scene according to the query frequency and the query content, stores the data according to the query scene, and reports the query scene to a data processing device of the headquarter.
The query scene can include "query according to package money", "query according to the number of people who order the package", "query according to month", and the like, and each node can sort the locally stored data according to the query scene.
And step 42, establishing a corresponding relation between the query scene and the node.
Specifically, for a node, there may be a plurality of query scenarios, and in this case, the correspondence between each query scenario and the node is respectively established.
And 43, when a scene query request is received, determining a node according to the corresponding relation, and acquiring data of a query scene from the node.
Specifically, the scene query request carries a query scene, and the data processing device of the headquarters can determine which nodes store data related to the query scene according to the query scene and the corresponding relationship, and correspondingly acquire data corresponding to the query scene from the nodes.
It can be seen from steps 41-43 that when a user needs to cross-node query a common scene, result data can be directly obtained from a corresponding node, so that the calculation time is saved, and the calculation resources of the data processing device of the headquarters are saved.
In the embodiment of the invention, a collaborative query distributed management platform is created by utilizing a P2P networking technology asymmetric encryption algorithm and a Hash cipher algorithm and combining the verification, decryption, computing capacity and storage capacity of network nodes, so as to ensure that result data are queried quickly and reduce the investment of a central server.
Each branch organization of the headquarters deploys a data query computing node, accesses the data query computing node in a P2P mode to form a peer-to-peer network, and each node can report data and receive the data issued by the headquarters server. And generating a self public and private key by using an asymmetric encryption technology to uniquely identify each branch office. In the peer-to-peer network, each node is an individual of behavior right peer, and participates in the recording, storage, maintenance and other work of node information together. The trueness and the effectiveness of the nodes are ensured by the common auditing, generating and recording of the metadata description at all the nodes in the network and the common storage mode of all the nodes in the network. Moreover, the blockchain has the characteristic of being not tampered once generated, and the data description information generated by the node network end is always valid until the new data description is accepted and recorded to the new node.
Each node is responsible for receiving data issued by the headquarter, responding to local query requirements, counting the frequency of query contents, returning a common query scene to the headquarter, and recording query result data in the local. When the headquarter user inquires the common scenes, the headquarter user can obtain inquiry result data from the corresponding node without calculation, so that the inquiry speed is increased.
Based on the same technical concept, an embodiment of the present invention further provides a data processing apparatus, as shown in fig. 5, the data processing apparatus may include: an acquisition module 51 and a sending module 52.
The obtaining module 51 is configured to determine an identifier of a node corresponding to data to be stored, and obtain an address of the node from a block chain according to the identifier of the node; the block chain comprises a plurality of sequentially connected data blocks, and each data block is used for storing node data corresponding to the data block.
The sending module 52 is configured to send the data to be stored to a corresponding node according to the address of the node, so that the node stores the data to be stored.
Preferably, the sending module 52 is specifically configured to send the data to be stored to a corresponding node in an asymmetric encryption manner, so that the node decrypts the data to be stored and stores the decrypted data in the local area.
Further, in another embodiment of the present invention, as shown in fig. 6, the data processing apparatus further includes a receiving module 53, a broadcasting module 54, a determining module 55, and a block chain generating module 56.
The receiving module 53 is configured to receive a join request sent by a node to be joined; and receiving the verification result fed back by each node in the block chain.
The obtaining module 51 is further configured to, when the receiving module 53 receives a join request sent by a node to be joined, obtain node information carried in the join request.
The broadcast module 54 is configured to initiate a broadcast carrying the node information in a network where the block chain is located, so that each node in the block chain verifies the node information.
The judging module 55 is configured to, when the node exceeding the preset threshold passes verification, instruct the block chain generating module 56 to generate a data block corresponding to the node to be added, and connect the generated data block to the end of the block chain.
Preferably, the data block includes a block header and a block body, and the block header includes the following field information: the block identification, the Merkle tree root value, the hash value of the previous data block in the block chain and the generation time of the block;
the block body includes the following information: the address, description, authority and identification of the node corresponding to the block.
Further, in another embodiment of the present invention, as shown in fig. 7, the data processing apparatus further includes a creating module 57 and a processing module 58.
The receiving module 53 is further configured to receive an inquiry scenario sent by a node, where the inquiry scenario is determined by the node after counting inquiry frequency based on an inquiry request; and receiving a scene query request.
The establishing module 57 is configured to establish a correspondence between the query scene and the node.
The processing module 58 is configured to, when the receiving module 53 receives a scene query request sent by a node, determine the node according to the corresponding relationship, and obtain data of a query scene from the node.
It will be understood that the above embodiments are merely exemplary embodiments taken to illustrate the principles of the present invention, which is not limited thereto. It will be apparent to those skilled in the art that various modifications and improvements can be made without departing from the spirit and substance of the invention, and these modifications and improvements are also considered to be within the scope of the invention.

Claims (8)

1. A data processing method, applied to a peer-to-peer network, the method comprising:
determining the identifier of a node corresponding to data to be stored;
acquiring the address of the node from the block chain according to the identifier of the node; the block chain comprises a plurality of sequentially connected data blocks, and each data block is used for storing node data corresponding to the data block;
according to the address of the node, sending the data to be stored to the corresponding node so that the node stores the data to be stored;
the method further comprises the following steps:
receiving an inquiry scene sent by a node, wherein the inquiry scene is determined after the node counts inquiry frequency based on an inquiry request;
establishing a corresponding relation between a query scene and a node;
and when a scene query request is received, determining a node according to the corresponding relation, and acquiring data of a query scene from the node.
2. The method according to claim 1, wherein the sending the data to be stored to the corresponding node specifically includes:
and sending the data to be stored to a corresponding node by adopting an asymmetric encryption mode so as to store the data to be stored in the local after the node decrypts the data.
3. The method of claim 1, wherein the method further comprises:
when a joining request sent by a node to be joined is received, node information carried in the joining request is obtained;
initiating a broadcast carrying the node information in a network where the block chain is located, so that each node in the block chain verifies the node information;
and receiving a verification result fed back by each node in the block chain, if the node exceeding a preset threshold passes the verification, generating a data block corresponding to the node to be added, and connecting the generated data block to the tail end of the block chain.
4. The method of claim 3, wherein the data block comprises a block header and a block body, the block header comprising the following field information: the block identification, the Merkle tree root value, the hash value of the previous data block in the block chain and the generation time of the block;
the block body includes the following information: the address, description, authority and identification of the node corresponding to the block.
5. A data processing apparatus, comprising: the device comprises an acquisition module and a sending module;
the acquisition module is used for determining the identifier of the node corresponding to the data to be stored and acquiring the address of the node from the block chain according to the identifier of the node; the block chain comprises a plurality of sequentially connected data blocks, and each data block is used for storing node data corresponding to the data block;
the sending module is used for sending the data to be stored to the corresponding node according to the address of the node so as to enable the node to store the data to be stored;
the data processing device also comprises a receiving module, an establishing module and a processing module;
the receiving module is used for receiving a query scene sent by a node, wherein the query scene is determined by the node after the node counts query frequency based on a query request; receiving a scene query request;
the establishing module is used for establishing a corresponding relation between a query scene and a node;
and the processing module is used for determining the nodes according to the corresponding relation and acquiring the data of the query scene from the nodes when the receiving module receives the scene query request sent by the nodes.
6. The data processing apparatus according to claim 5, wherein the sending module is specifically configured to send the data to be stored to a corresponding node in an asymmetric encryption manner, so that the node decrypts the data to be stored and stores the decrypted data locally.
7. The data processing apparatus of claim 5, further comprising a broadcasting module, a judging module, and a block chain generating module;
the receiving module is further used for receiving a joining request sent by a node to be joined; receiving a verification result fed back by each node in the block chain;
the obtaining module is further configured to obtain node information carried in the joining request sent by the node to be joined when the receiving module receives the joining request;
the broadcast module is configured to initiate a broadcast carrying the node information in a network where the block chain is located, so that each node in the block chain verifies the node information;
and the judging module is used for indicating the block chain generating module to generate a data block corresponding to the node to be added when the node exceeding the preset threshold passes the verification, and connecting the generated data block to the tail end of the block chain.
8. The data processing apparatus of claim 7, wherein the data block comprises a block header and a block body, the block header comprising the following field information: the block identification, the Merkle tree root value, the hash value of the previous data block in the block chain and the generation time of the block;
the block body includes the following information: the address, description, authority and identification of the node corresponding to the block.
CN201910334940.7A 2019-04-24 2019-04-24 Data processing method and device Active CN110035130B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910334940.7A CN110035130B (en) 2019-04-24 2019-04-24 Data processing method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910334940.7A CN110035130B (en) 2019-04-24 2019-04-24 Data processing method and device

Publications (2)

Publication Number Publication Date
CN110035130A CN110035130A (en) 2019-07-19
CN110035130B true CN110035130B (en) 2021-07-13

Family

ID=67240136

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910334940.7A Active CN110035130B (en) 2019-04-24 2019-04-24 Data processing method and device

Country Status (1)

Country Link
CN (1) CN110035130B (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101504670A (en) * 2009-03-04 2009-08-12 成都市华为赛门铁克科技有限公司 Data operation method, system, client terminal and data server
CN106991334A (en) * 2016-11-24 2017-07-28 阿里巴巴集团控股有限公司 A kind of method, system and device of data access
CN108932297A (en) * 2018-06-01 2018-12-04 阿里巴巴集团控股有限公司 A kind of data query, data sharing method, device and equipment
WO2019061983A1 (en) * 2017-09-30 2019-04-04 深圳壹账通智能科技有限公司 Blockchain data uploading method, system, computer system and storage medium
CN109617900A (en) * 2018-12-28 2019-04-12 有份儿智慧科技股份有限公司 The method of information data encryption based on Internet of Things in conjunction with block chain technology
CN109670321A (en) * 2018-11-30 2019-04-23 深圳灵图慧视科技有限公司 Date storage method, data query method and device

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101504670A (en) * 2009-03-04 2009-08-12 成都市华为赛门铁克科技有限公司 Data operation method, system, client terminal and data server
CN106991334A (en) * 2016-11-24 2017-07-28 阿里巴巴集团控股有限公司 A kind of method, system and device of data access
WO2019061983A1 (en) * 2017-09-30 2019-04-04 深圳壹账通智能科技有限公司 Blockchain data uploading method, system, computer system and storage medium
CN108932297A (en) * 2018-06-01 2018-12-04 阿里巴巴集团控股有限公司 A kind of data query, data sharing method, device and equipment
CN109670321A (en) * 2018-11-30 2019-04-23 深圳灵图慧视科技有限公司 Date storage method, data query method and device
CN109617900A (en) * 2018-12-28 2019-04-12 有份儿智慧科技股份有限公司 The method of information data encryption based on Internet of Things in conjunction with block chain technology

Also Published As

Publication number Publication date
CN110035130A (en) 2019-07-19

Similar Documents

Publication Publication Date Title
CN109409122B (en) File storage method, electronic device and storage medium
CN109587253B (en) Method for realizing distributed storage of files based on block chain
CN110011988B (en) Block chain-based certificate verification method and device, storage medium and electronic device
CN108681965B (en) Block chain network transaction processing method and device for offline node
WO2020258846A1 (en) Method and apparatus for sending certifiable messages across chains
CN111556120B (en) Data processing method and device based on block chain, storage medium and equipment
US20180205555A1 (en) Contract Agreement Method, Agreement Verification Method, Contract Agreement System, Agreement Verification Device, Contract Agreement Device, Contract Agreement Program and Agreement Verification Program
WO2019184210A1 (en) Multi-warehouse data management method based on block chain and related device
CN108848080A (en) Data-sharing systems based on the storage verification of alliance's chain
WO2022100679A1 (en) Data communication method and apparatus, computer device, and storage medium
CN108768672B (en) Data processing method, device and storage medium
CN113065961A (en) Power block chain data management system
CN112035895A (en) Electronic contract evidence obtaining method and system based on transaction mode
CN109377220B (en) Block chain-based media data transaction method and system and computer storage medium
CN113255014B (en) Data processing method based on block chain and related equipment
WO2022068356A1 (en) Blockchain-based information encryption method and apparatus, device and medium
CN113824563A (en) Cross-domain identity authentication method based on block chain certificate
CN109918867B (en) Peer-to-peer system file tracing method based on block chain
CN112039837B (en) Electronic evidence preservation method based on block chain and secret sharing
CN110035130B (en) Data processing method and device
CN101010923B (en) Billing method and system in a peer-to-peer network
CN111865983A (en) Block chain-based data security tracing method
CN108882230B (en) Call record management method, device and system
CN114666060B (en) Hyperledger Fabric-based electronic data security method and system
CN107426452B (en) Internet call method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant