CN115544171A - Heterogeneous physical resource data processing method and device, electronic equipment and storage medium - Google Patents

Heterogeneous physical resource data processing method and device, electronic equipment and storage medium Download PDF

Info

Publication number
CN115544171A
CN115544171A CN202211478675.8A CN202211478675A CN115544171A CN 115544171 A CN115544171 A CN 115544171A CN 202211478675 A CN202211478675 A CN 202211478675A CN 115544171 A CN115544171 A CN 115544171A
Authority
CN
China
Prior art keywords
data
uplink
target
index
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.)
Pending
Application number
CN202211478675.8A
Other languages
Chinese (zh)
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.)
6th Research Institute of China Electronics Corp
Original Assignee
6th Research Institute of China Electronics Corp
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 6th Research Institute of China Electronics Corp filed Critical 6th Research Institute of China Electronics Corp
Priority to CN202211478675.8A priority Critical patent/CN115544171A/en
Publication of CN115544171A publication Critical patent/CN115544171A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2246Trees, e.g. B+trees
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2255Hash tables

Abstract

The application provides a heterogeneous physical resource data processing method, a heterogeneous physical resource data processing device, an electronic device and a storage medium, wherein the method comprises the following steps: the method comprises the steps of obtaining data to be uplink from target equipment, responding to an uplink request of the target equipment, carrying out verification processing on the data to be uplink, when the data to be uplink does not have repetition in a block chain system and is in an effective period, constructing a target index for the data to be uplink according to a preset index construction rule, storing the target index on a chain of the block chain system to form an index table, and storing the data to be uplink under the chain. According to the method and the device, a sharing mode combining uplink and downlink storage is adopted to improve the storage efficiency, release a large amount of space on a block chain, and improve the efficiency of information inquiry and sharing.

Description

Heterogeneous physical resource data processing method and device, electronic equipment and storage medium
Technical Field
The present application relates to the field of block chaining technologies, and in particular, to a method and an apparatus for processing data of heterogeneous physical resources, an electronic device, and a storage medium.
Background
The blockchain has mature application in a plurality of fields by the characteristics of decentralization, non-tampering, whole-course trace retention, traceability, collective maintenance, public transparency and the like, provides rich query functions for massive applications from the initial digital currency item to the current application, and enables the system to have higher security level and better privacy protection capability by the blockchain technology. The quantity of generated data in practical application is increasingly huge along with the development of the internet, the quality of the data is lower and lower, the data is dispersedly stored in respective information systems, the data are heterogeneous in format and cannot be effectively integrated, how to effectively fuse a heterogeneous platform and heterogeneous data is to complete the association between the human society and the physical resource information world, construct a unified information system, perform data management, construct a storage system and set an efficient query mechanism is an important problem to be solved currently.
For the heterogeneous physical resource mapping problem, data from the real world is collected mainly by various sensors, attribute characteristics of the real physical world are represented by state information of terminal equipment, and finally data transmission is performed through a network. And then, the data reusability applied in a special scene is poor, generally only a specific scene can be supported, and the data value in a big data environment cannot be fully exerted. On the other hand, the traditional block chain data storage, chaining and source tracing query technology has the problems of large node storage pressure, low access efficiency, single query and the like, only supports the query based on the data hash value, the query mode is traversal query, the created blocks need to be traversed in the worst case, the data on the block chain is discretized data, and the quick query requirement of the time-space data is difficult to meet.
Disclosure of Invention
In view of this, embodiments of the present application provide a method, an apparatus, an electronic device, and a storage medium for processing data of heterogeneous physical resources, which can adopt a sharing mode combining uplink and downlink storage to improve storage efficiency, release a large amount of space on a block chain, and improve efficiency of information query and sharing.
The technical scheme of the embodiment of the application is realized as follows:
in a first aspect, an embodiment of the present application provides a method for processing data of heterogeneous physical resources, including the following steps:
acquiring data to be uplink from target equipment, wherein the target equipment corresponds to a target node in a block chain system, the block chain system comprises at least one type of target equipment, and the data structures to be uplink generated by different types of target equipment are different;
responding to a uplink request of the target equipment, checking the data to be uplink, and constructing a target index for the data to be uplink according to a preset index construction rule when the data to be uplink does not have repetition in the block chain system and is in an effective period, wherein the target index comprises the category information of the data to be uplink and the storage address of the data to be uplink;
storing the target index on a chain of the block chain system, forming an index table, and storing the data to be uplink under the chain.
In one possible embodiment, the method further comprises:
responding to a registration request of a newly added device, and acquiring a device identifier and device information of the newly added device, wherein the device information comprises a device public key and a device private key;
storing the device public key on a chain of the blockchain system and the device private key under the chain of the blockchain system.
In one possible embodiment, the method further comprises:
determining the privacy level of the data to be uplink according to a preset data division rule;
and responding to an access request of a user for the data to be uplink, determining the permission level of the user, and allowing the user to access when the permission level of the user is not lower than the privacy level.
In a possible embodiment, the performing, in response to the uplink request of the target device, a checking process on the data to be uplink-transmitted includes:
searching the index on the chain in the block chain system, determining whether the target index matched with the data to be uplink exists in the index on the chain, acquiring the valid period data of the data to be uplink, and determining whether the valid period data is expired.
In a possible implementation manner, the constructing a target index for the to-be-uplink data according to a preset index construction rule includes:
constructing a data abstract according to a preset field extraction rule aiming at the data to be linked;
calculating a hash value of the data abstract, and constructing a dictionary tree by taking the hash value as a key value;
and taking the dictionary tree as the target index.
In a possible embodiment, the constructing a target index for the to-be-uplink data according to a preset index construction rule includes:
constructing a Merkel tree according to the data to be uplink, wherein each sub-node of the Merkel tree stores keyword information corresponding to the data to be uplink;
taking the Merkel tree as the target index.
In one possible embodiment, the method further comprises:
receiving a query request, wherein the query request carries a target category;
according to the target category, acquiring the category information matched with the target category from the index table;
according to the storage address corresponding to the category information, acquiring stored first target data from a link;
and decrypting the first target data to obtain decrypted second target data.
In a second aspect, an embodiment of the present application further provides a heterogeneous physical resource data processing apparatus, where the apparatus includes:
an obtaining module, configured to obtain data to be uplink from a target device, where the target device corresponds to a target node in a block chain system, the block chain system includes at least one type of target device, and data structures to be uplink generated by different types of target devices are different;
a processing module, configured to perform a verification process on the to-be-uplink data in response to an uplink request of the target device, and construct a target index for the to-be-uplink data according to a preset index construction rule when the to-be-uplink data does not have repetition in the block chain system and is within an effective period, where the target index includes category information of the to-be-uplink data and a storage address of the to-be-uplink data;
and the storage module is used for storing the target index on a chain of the block chain system, forming an index table and storing the data to be uplink under the chain.
In a third aspect, an embodiment of the present application further provides an electronic device, including: the heterogeneous physical resource data processing system comprises a processor, a storage medium and a bus, wherein the storage medium stores machine-readable instructions executable by the processor, when an electronic device runs, the processor and the storage medium communicate through the bus, and the processor executes the machine-readable instructions to execute the heterogeneous physical resource data processing method of any one of the first aspect.
In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the method for processing data of heterogeneous physical resources according to any one of the first aspect is executed.
The embodiment of the application has the following beneficial effects:
1. the attribute feature definition and access of the heterogeneous physical information nodes are realized, the unified expression of various physical information resources in the real physical world on the same platform is supported, and the data resource sharing capacity among the nodes is further improved.
2. The block chain data storage problem is solved by adopting a sharing mode of combining uplink and downlink storage of a data block chain, wherein original data is stored in the downlink, and data description and a data sharing log are stored in the uplink. The data attribute is graded according to different sensitivities so as to meet the requirement of flexible sharing of data sharing.
3. The method supports category-based quick query, and meets the requirement of quick query of data; the data are shared in a chain uplink and downlink cooperative mode, so that a large amount of space on a block chain can be released, efficient transmission of the data on the chain is guaranteed, and the efficiency of information inquiry and sharing is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained from the drawings without inventive effort.
FIG. 1 is a schematic flow chart of steps S101-S103 provided in an embodiment of the present application;
FIG. 2 is a schematic flow chart of steps S201-S202 provided in the embodiments of the present application;
FIG. 3 is a schematic flow chart of steps S301-S302 provided in the embodiments of the present application;
FIG. 4 is a flowchart illustrating steps S401-S404 according to an embodiment of the present disclosure;
FIG. 5 is a schematic diagram of a memory provided by an embodiment of the present application;
fig. 6 is a data structure diagram of an index block on a chain according to an embodiment of the present application;
FIG. 7 is a schematic diagram of a query provided by an embodiment of the application;
fig. 8 is a schematic structural diagram of a heterogeneous physical resource data processing apparatus according to an embodiment of the present application;
fig. 9 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
In order to make the purpose, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it should be understood that the drawings in the present application are only for illustration and description purposes and are not used to limit the protection scope of the present application. Additionally, it should be understood that the schematic drawings are not necessarily drawn to scale. The flowcharts used in this application illustrate operations implemented according to some embodiments of the present application. It should be understood that the operations of the flow diagrams may be performed out of order, and steps without logical context may be performed in reverse order or simultaneously. One skilled in the art, under the guidance of this application, may add one or more other operations to, or remove one or more operations from, the flowchart.
In the following description, reference is made to "some embodiments" which describe a subset of all possible embodiments, but it is understood that "some embodiments" may be the same subset or different subsets of all possible embodiments, and may be combined with each other without conflict.
In addition, the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. The components of the embodiments of the present application, generally described and illustrated in the figures herein, can be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present application without making any creative effort, shall fall within the protection scope of the present application.
In the following description, references to the terms "first \ second \ third" are only to distinguish similar objects and do not denote a particular order, but rather the terms "first \ second \ third" are used to interchange specific orders or sequences, where appropriate, so as to enable the embodiments of the application described herein to be practiced in other than the order shown or described herein.
It should be noted that in the embodiments of the present application, the term "comprising" is used to indicate the presence of the features stated hereinafter, but does not exclude the addition of further features.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing embodiments of the application and is not intended to be limiting of the application.
Referring to fig. 1, fig. 1 is a schematic flowchart of steps S101 to S103 of a data processing method for heterogeneous physical resources according to an embodiment of the present application, and will be described with reference to steps S101 to S103 shown in fig. 1.
Step S101, obtaining data to be uplink from target equipment, wherein the target equipment corresponds to a target node in a block chain system, the block chain system comprises at least one type of target equipment, and the data structures to be uplink generated by different types of target equipment are different;
step S102, in response to a uplink request of the target device, performing a verification process on the data to be uplink, and when the data to be uplink does not have repetition in the block chain system and is within an effective period, constructing a target index for the data to be uplink according to a preset index construction rule, wherein the target index includes category information of the data to be uplink and a storage address of the data to be uplink;
step S103, storing the target index on a chain of the block chain system, forming an index table, and storing the data to be uplink under the chain.
The heterogeneous physical resource data processing method has the following technical effects:
1. the attribute feature definition and access of the heterogeneous physical information nodes are realized, the unified expression of various physical information resources in the real physical world on the same platform is supported, and the data resource sharing capacity among the nodes is further improved.
2. The block chain data storage problem is solved by adopting a sharing mode of combining uplink and downlink storage of a data block chain, wherein original data is stored in the downlink, and data description and a data sharing log are stored in the uplink. The data attribute is graded according to different sensitivities so as to meet the requirement of flexible sharing of data sharing.
3. The method supports category-based quick query, and meets the requirement of quick query of data; the data are shared in a chain uplink and downlink cooperative mode, so that a large amount of space on a block chain can be released, efficient transmission of the data on the chain is guaranteed, and the efficiency of information inquiry and sharing is improved.
The above exemplary steps of the embodiments of the present application will be described below.
In step S101, data to be uplink is obtained from a target device, where the target device corresponds to a target node in a block chain system, the block chain system includes at least one type of target device, and the data structures to be uplink generated by different types of target devices are different.
In step S102, in response to the uplink request of the target device, performing a verification process on the data to be uplink, and when the data to be uplink does not have repetition in the block chain system and is within an effective period, constructing a target index for the data to be uplink according to a preset index construction rule, where the target index includes category information of the data to be uplink and a storage address of the data to be uplink.
In some embodiments, the target index is stored on a chain of the blockchain system, an index table is formed, and the data to be uplinked is stored under the chain.
Here, the devices in the architecture that spans the physical domain and the information domain are mainly connected to the distributed P2P network by hardware nodes (Windows terminals, linux system terminals, PLC controllers, mac system terminals, including edge gateways and edge servers, etc.), and all the nodes related to the edge of the network are edge nodes by default. Based on the condition of large-scale data analysis, calculation and storage, the invention provides a mode of combining on-chain storage and off-chain storage to store data, index information is stored on a chain, and large-scale data information is stored under the chain, as shown in fig. 5, a user stores the data in an off-chain database and stores address information in an on-chain index table, wherein the on-chain index table comprises an index number, an index category and a corresponding address of the off-chain database. A controllable and safe platform is constructed on the basis of the block chain.
It should be noted that, here, on-chain refers to being stored on a block chain, and off-chain refers to being stored on a database under the block chain.
In some embodiments, referring to fig. 2, fig. 2 is a schematic flowchart of steps S201 to S202 provided in the embodiments of the present application, and will be described with reference to the steps.
In step S201, in response to a registration request of a newly added device, a device identifier and device information of the newly added device are obtained, where the device information includes a device public key and a device private key.
In step S202, the device public key is stored on the chain of the blockchain system, and the device private key is stored under the chain of the blockchain system.
Here, when building a blockchain system, node registration, resource definition, and update are required: the organization uploads data information (including data description, encryption key, organization information, related individuals, access control policy, data address, etc.) to the data sharing platform and stores the data information onto the blockchain.
In a blockchain system, each entity must create at least one master account defined by a pair of keys to join the network. The address of each account is derived from the public key of the querying agent. The specific attributes of the equipment, such as sensing, data sending and receiving, data analysis, controlled property and the like, are distributed, authority is distributed based on the attributes, and information { registration ID, equipment public key, equipment attribute, equipment authority, equipment MAC address and Hash } of the equipment is sent to a block chain for storage. The private key of the device is stored in local data, viewed only by the edge gateway. And calling an intelligent contract by the block chain to store the equipment information one by one. Device and user registration: when a new device needs to apply for joining the system, new node registration is required. Considering that the devices have different communication modes when aiming at a large-scale complex network of heterogeneous devices, the block chain network inquires, updates and registers the node state according to the appointed time period T. Thus, the present invention identifies devices from four dimensions: device ID, device COM port, device MAC, device IP port.
In some embodiments, referring to fig. 3, fig. 3 is a schematic flowchart of steps S301 to S302 provided in the embodiments of the present application, and will be described in conjunction with the steps.
In step S301, a privacy level of the to-be-uplink data is determined according to a preset data partitioning rule.
In step S302, in response to a user' S access request for the to-be-uplink data, determining a permission level of the user, and when the permission level of the user is not lower than the privacy level, allowing the user to access.
Here, the composition structure of the data is complex and various, and the access control policy should be different for data of different sources and different sensitivity degrees. For high-flexibility privacy protection of data, the data is divided into the following three levels: high sensitivity, medium sensitivity and low sensitivity. Different levels of data may implement different access control policies. Specific data ranking criteria are as follows: (1) high sensitivity data: information that can identify an identity or that can be exposed to a significant impact. (2) Medium sensitive data: the information of the personal identity cannot be identified, the data which has significance after fuzzification still exist, and the fuzzified result can be reserved. (3) Low sensitivity data: other non-important information. Meanwhile, in order to realize the access control of the data, the data needs to be divided according to the identity information of the data user, including the type of the user and the authority level of the user.
In some embodiments, the performing, in response to the uplink request of the target device, a verification process on the to-be-uplink data includes:
searching the index on the chain in the block chain system, determining whether the target index matched with the data to be uplink exists in the index on the chain, acquiring the valid period data of the data to be uplink, and determining whether the valid period data is expired.
Here, pre-uplink application and uplink data review are performed. The equipment node initiates an uplink application and performs uplink data examination. The uplink data validity is determined. First, searching the existing uplink index to determine whether the information is existed, and obtaining the validity data of the information to determine whether the information relates to repeated uplink and overdue condition. Reading the whole strategy set of all the materials which are linked with the same type. The full policy set on the intelligent contract for policy management of the information is obtained by a consensus method in the early stage.
In some embodiments, the constructing a target index for the to-be-uplink data according to a preset index construction rule includes:
constructing a data abstract according to a preset field extraction rule aiming at the data to be linked;
calculating a hash value of the data abstract, and constructing a dictionary tree by taking the hash value as a key value;
and taking the dictionary tree as the target index.
Here, the original data to be uplink is structured into data digests according to a set field extraction rule, and a digest index is constructed for each data digest to be uplink, such as constructing a digest dictionary tree index; the abstract dictionary tree is defined by a resource level node structure constructed by taking the hash value of the uplink data abstract distributed in different blocks as a key value. And calculating the hash value of the uplink data abstract, and constructing a dictionary tree by taking the hash values of all the data abstracts as key values, thereby constructing a centralized index for all the data abstracts in the block chain and further accelerating the query efficiency of the data abstracts. The data structure of the index block on the chain as shown in fig. 6. The index blocks (block 1 to block n) are composed of a block header and a block body (index information). The chunk header includes information such as the hash value of the previous chunk (e.g., the hash value of chunk 0), the hash value of the local chunk (e.g., the hash value of chunk 1), and a random number. The block body stores the index information which the inquirer needs to inquire, and the synchronization of the blocks is carried out through the connection between the blocks.
In some embodiments, the constructing a target index for the to-be-uplink data according to a preset index construction rule includes:
constructing a Merkel tree according to the data to be uplink, wherein each sub-node of the Merkel tree stores keyword information corresponding to the data to be uplink;
taking the Merkel tree as the target index.
Here, a hybrid index may also be constructed, and the construction method of the hybrid index is as follows: and providing a mixed index structure based on a Merkle tree for problems such as specific multi-information query in the tracing query process based on the block chain. The mixed index structure adopts the basic structure of the Merkle tree, combines the Merkle index structure and improves the transaction query efficiency by introducing data structures such as hash tables into the Merkle tree. Member presence queries are supported, i.e., whether a collection contains the element. When the Merkle tree nodes are constructed, the transaction keyword information corresponding to the nodes is stored in each node. When inquiring the transaction information corresponding to the key word key, the text starts to calculate from the root node of the Merkle tree, if the key exists in the node BF, whether the inquired key word exists in BF of left and right subtrees of the node is judged in sequence, if yes, the inquiry is continued, otherwise, the none is returned. Multiple pruning operations can be performed in the process of searching and traversing the Merkle tree, so that the searching efficiency is improved. For data which does not exist in the block chain, the last block is directly searched because the key index is not stored in the bloom filter of the root node. In the block header, the present invention introduces a Hash Table, also called Hash Table. The mixed index structure records the transaction information corresponding to the ID in the HashTable, and stores the transaction information in the positions of the leaf nodes of the Merkle tree, so that the leaf node index where the transaction information is located can be quickly positioned according to the ID in the process of tracing the source. An algorithm is constructed based on a Merkle tree mixed index structure: (1) firstly, sorting input transaction sets according to numerical attributes; (2) obtaining the maximum and minimum attributes and then placing the attributes in a block header; traversing transaction, namely calculating the Hash of transaction information, placing the transaction information on leaf nodes of a Merkle tree, taking out the ID in the transaction information and a position index correspondingly stored in the leaf nodes to construct a HashTable, and storing the HashTable in a block header; (3) and carrying out Hash operation on every two Hash values of the leaf nodes, and calculating key words in the transaction information contained in the corresponding nodes in the calculation process to obtain the Hash operation result. And storing a Bloom Filter (BF) in the node, continuously calculating to construct a Merkle tree subsequently, and placing the Merkle tree root Hash in the block head to construct a mixed index structure based on the Merkle tree. The output hMerkleTree is the block chain structure.
In some embodiments, referring to fig. 4, fig. 4 is a schematic flowchart of steps S401 to S404 provided in the embodiments of the present application, and will be described with reference to the steps.
In step S401, receiving a query request, where the query request carries a target category;
in step S402, according to the target category, the category information matched with the target category is obtained from the index table;
in step S403, according to the storage address corresponding to the category information, obtaining first target data stored from a link;
in step S404, the first target data is decrypted to obtain decrypted second target data.
As shown in fig. 7, the inquirer inquires the related data information, and the attribute information of the data to be inquired sends an information inquiry request to the blockchain, after being authorized, the encrypted file can be searched in the database under the chain through the address value in the index table, the encrypted file is secondarily encrypted by using the re-encryption key generated by the user private key and the inquirer public key, the encrypted result is returned to the inquirer, and the information is obtained by decrypting the encrypted result by using the inquirer private key. After a calculation request is generated by a calculation requester, the requester submits a certificate signature and an encrypted public key of the requester to a block chain, mutual trust between nodes is ensured by using consensus nodes of a consensus layer for consensus, and then original data is inquired according to the content of the request.
In addition, if the hybrid index query is provided based on the above embodiment, the metadata is sorted according to the ID primary condition and the ID secondary condition, and the maximum value and the minimum value are stored in the header of the block, and when the leaf node stores the sorted information metadata, the block number where the last interaction record of the device is located is added to the metadata of the current interaction according to some attribute link information in the tracing scene for storage, so that the block where the last task of the node is located can be quickly located in the tracing process, and detailed task data can be taken out. According to the construction method of the Merkle tree, hash operation is carried out on the Hash values of two adjacent nodes above leaf nodes, so that the Hash value of the root node of the Merkle tree of the father node is obtained.
In summary, the embodiments of the present application have the following beneficial effects:
1. the attribute feature definition and access of the heterogeneous physical information nodes are realized, the unified expression of various physical information resources in the real physical world on the same platform is supported, and the data resource sharing capacity among the nodes is further improved.
2. The block chain data storage problem is solved by adopting a sharing mode of combining uplink and downlink storage of a data block chain, wherein original data is stored in the downlink, and data description and a data sharing log are stored in the uplink. The data attribute is graded according to different sensitivities so as to meet the requirement of flexible sharing of data sharing.
3. The method supports category-based quick query, and meets the requirement of quick query of data; the data is shared in a chain uplink and downlink cooperative mode, a large amount of space on a block chain can be released, efficient transmission of the data on the chain is guaranteed, and the efficiency of information inquiry and sharing is improved.
Based on the same inventive concept, the embodiment of the present application further provides a heterogeneous physical resource data processing apparatus corresponding to the heterogeneous physical resource data processing method in the first embodiment, and since the principle of the apparatus in the embodiment of the present application for solving the problem is similar to that of the heterogeneous physical resource data processing method, the apparatus may be implemented by referring to the implementation of the method, and the repeated parts are not described again.
As shown in fig. 8, fig. 8 is a schematic structural diagram of a heterogeneous physical resource data processing apparatus 800 according to an embodiment of the present application. The heterogeneous physical resource data processing apparatus 800 includes:
an obtaining module 801, configured to obtain data to be uplink from a target device, where the target device corresponds to a target node in a block chain system, the block chain system includes at least one type of target device, and data structures to be uplink generated by different types of target devices are different;
a processing module 802, configured to perform a verification process on the to-be-uplink data in response to an uplink request of the target device, and construct a target index for the to-be-uplink data according to a preset index construction rule when the to-be-uplink data does not have repetition in the block chain system and is within an effective period, where the target index includes category information of the to-be-uplink data and a storage address of the to-be-uplink data;
a storage module 803, configured to store the target index on a chain of the block chain system, form an index table, and store the data to be uplink under the chain.
It should be understood by those skilled in the art that the implementation functions of the units in the heterogeneous physical resource data processing apparatus 800 shown in fig. 8 can be understood by referring to the related description of the foregoing heterogeneous physical resource data processing method. The functions of the units in the heterogeneous physical resource data processing apparatus 800 shown in fig. 8 may be implemented by a program running on a processor, or may be implemented by specific logic circuits.
In a possible implementation, the obtaining module 801 further includes:
responding to a registration request of a newly added device, and acquiring a device identifier and device information of the newly added device, wherein the device information comprises a device public key and a device private key;
storing the device public key on a chain of the blockchain system and the device private key under the chain of the blockchain system.
In a possible implementation, the obtaining module 801 further includes:
determining the privacy level of the data to be uplink-linked according to a preset data division rule;
and responding to an access request of a user for the data to be uplink, determining the permission level of the user, and allowing the user to access when the permission level of the user is not lower than the privacy level.
In a possible implementation manner, the processing module 802 performs a checking process on the to-be-uplink data in response to the uplink request of the target device, including:
searching the index on the chain in the block chain system, determining whether the target index matched with the data to be uplink exists in the index on the chain, acquiring the valid period data of the data to be uplink, and determining whether the valid period data is expired.
In a possible implementation manner, the processing module 802 constructs a target index for the to-be-uplink data according to a preset index construction rule, including:
constructing a data abstract according to a preset field extraction rule aiming at the data to be linked;
calculating a hash value of the data abstract, and constructing a dictionary tree by taking the hash value as a key value;
and taking the dictionary tree as the target index.
In a possible implementation manner, the processing module 802 constructs a target index for the to-be-uplink data according to a preset index construction rule, including:
constructing a Merkel tree according to the data to be uplink, wherein each sub-node of the Merkel tree stores keyword information corresponding to the data to be uplink;
taking the Merkel tree as the target index.
In a possible implementation, the storage module 803 further includes:
receiving a query request, wherein the query request carries a target category;
according to the target category, acquiring the category information matched with the target category from the index table;
acquiring stored first target data from a link according to the storage address corresponding to the category information;
and decrypting the first target data to obtain decrypted second target data.
The heterogeneous physical resource data processing device has the following technical effects:
1. the attribute feature definition and access of the heterogeneous physical information nodes are realized, the unified expression of various physical information resources in the real physical world on the same platform is supported, and the data resource sharing capacity among the nodes is further improved.
2. The block chain data storage problem is solved by adopting a sharing mode of combining uplink and downlink storage of a data block chain, wherein original data is stored in the downlink, and data description and a data sharing log are stored in the uplink. The data attribute is graded according to different sensitivities so as to meet the requirement of flexible sharing of data sharing.
3. The method supports category-based quick query, and meets the requirement of quick query of data; the data are shared in a chain uplink and downlink cooperative mode, so that a large amount of space on a block chain can be released, efficient transmission of the data on the chain is guaranteed, and the efficiency of information inquiry and sharing is improved.
As shown in fig. 9, fig. 9 is a schematic view of a composition structure of an electronic device 900 according to an embodiment of the present application, where the electronic device 900 includes:
the device comprises a processor 901, a storage medium 902 and a bus 903, wherein the storage medium 902 stores machine-readable instructions executable by the processor 901, when the electronic device 900 runs, the processor 901 communicates with the storage medium 902 through the bus 903, and the processor 901 executes the machine-readable instructions to execute the steps of the data processing method for the heterogeneous physical resource according to the embodiment of the present application.
In practice, the various components of the electronic device 900 are coupled together by a bus 903. It is understood that the bus 903 is used to enable communications among the components. The bus 903 includes a power bus, a control bus, and a status signal bus in addition to a data bus. But for clarity of illustration the various busses are labeled as bus 903 in figure 9.
The electronic equipment has the following beneficial effects:
1. the attribute feature definition and access of the heterogeneous physical information nodes are realized, the unified expression of various physical information resources in the real physical world on the same platform is supported, and the data resource sharing capacity among the nodes is further improved.
2. The block chain data storage problem is solved by adopting a sharing mode of combining uplink and downlink storage of a data block chain, wherein original data is stored in the downlink, and data description and a data sharing log are stored in the uplink. The data attribute is graded according to different sensitivities so as to meet the requirement of flexible sharing of data sharing.
3. The method supports category-based quick query, and meets the requirement of quick query of data; the data are shared in a chain uplink and downlink cooperative mode, so that a large amount of space on a block chain can be released, efficient transmission of the data on the chain is guaranteed, and the efficiency of information inquiry and sharing is improved.
The embodiment of the present application further provides a computer-readable storage medium, where the storage medium stores executable instructions, and when the executable instructions are executed by at least one processor 901, the method for processing data of heterogeneous physical resources according to the embodiment of the present application is implemented.
In some embodiments, the storage medium may be a Memory such as a magnetic random Access Memory (FRAM), a Read Only Memory (ROM), a Programmable Read Only Memory (PROM), an Erasable Programmable Read Only Memory (EPROM), an Electrically Erasable Programmable Read Only Memory (EEPROM), a Flash Memory (Flash Memory), a magnetic surface Memory, an optical Disc, or a Compact Disc Read-Only Memory (CD-ROM); or may be various devices including one or any combination of the above memories.
In some embodiments, executable instructions may be written in any form of programming language (including compiled or interpreted languages), in the form of programs, software modules, scripts or code, and may be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment.
By way of example, executable instructions may correspond, but do not necessarily have to correspond, to files in a file system, and may be stored in a portion of a file that holds other programs or data, such as in one or more scripts stored in a hypertext markup Language (HTML) document, in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub-programs, or portions of code).
As an example, executable instructions may be deployed to be executed on one computing device or on multiple computing devices located at one site or distributed across multiple sites and interconnected by a communication network.
The computer readable storage medium has the following advantages:
1. the attribute feature definition and access of the heterogeneous physical information nodes are realized, the unified expression of various physical information resources in the real physical world on the same platform is supported, and the data resource sharing capacity among the nodes is further improved.
2. The block chain data storage problem is solved by adopting a sharing mode of combining uplink and downlink storage of a data block chain, wherein original data is stored in the downlink, and data description and a data sharing log are stored in the uplink. The data attribute is graded according to different sensitivities so as to meet the requirement of flexible sharing of data sharing.
3. The method supports category-based quick query, and meets the requirement of quick query of data; the data is shared in a chain uplink and downlink cooperative mode, a large amount of space on a block chain can be released, efficient transmission of the data on the chain is guaranteed, and the efficiency of information inquiry and sharing is improved.
In the several embodiments provided in the present application, it should be understood that the disclosed method and electronic device may be implemented in other ways. The above-described device embodiments are merely illustrative, for example, the division of the unit is only a logical functional division, and there may be other division ways in actual implementation, such as: multiple units or components may be combined, or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the coupling, direct coupling or communication connection between the components shown or discussed may be through some interfaces, and the indirect coupling or communication connection between the devices or units may be electrical, mechanical or other forms.
The modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in software functional units and sold or used as a stand-alone product, may be stored in a non-transitory computer-readable storage medium executable by a processor. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a platform server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a U disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (10)

1. The heterogeneous physical resource data processing method is characterized by comprising the following steps:
acquiring data to be uplink from target equipment, wherein the target equipment corresponds to a target node in a block chain system, the block chain system comprises at least one type of target equipment, and the data structures to be uplink generated by different types of target equipment are different;
responding to a uplink request of the target equipment, checking the data to be uplink, and constructing a target index for the data to be uplink according to a preset index construction rule when the data to be uplink does not have repetition in the block chain system and is in an effective period, wherein the target index comprises the category information of the data to be uplink and the storage address of the data to be uplink;
storing the target index on a chain of the block chain system, forming an index table, and storing the data to be uplink under the chain.
2. The method of claim 1, further comprising:
responding to a registration request of a newly added device, and acquiring a device identifier and device information of the newly added device, wherein the device information comprises a device public key and a device private key;
storing the device public key on a chain of the blockchain system and the device private key under the chain of the blockchain system.
3. The method of claim 1, further comprising:
determining the privacy level of the data to be uplink according to a preset data division rule;
and responding to an access request of a user for the data to be uplink, determining the permission level of the user, and allowing the user to access when the permission level of the user is not lower than the privacy level.
4. The method according to claim 1, wherein said performing a checking process on the to-be-uplink data in response to the uplink request of the target device comprises:
searching the index on the chain in the block chain system, determining whether the target index matched with the data to be uplink exists in the index on the chain, acquiring the effective period data of the data to be uplink, and determining whether the effective period data is overdue.
5. The method of claim 1, wherein the constructing a target index for the to-be-uplink data according to a predetermined index construction rule comprises:
constructing a data abstract according to a preset field extraction rule aiming at the data to be linked;
calculating a hash value of the data abstract, and constructing a dictionary tree by taking the hash value as a key value;
and taking the dictionary tree as the target index.
6. The method of claim 1, wherein the constructing a target index for the to-be-uplink data according to a predetermined index construction rule comprises:
constructing a Merkel tree according to the data to be uplink, wherein each sub-node of the Merkel tree stores keyword information corresponding to the data to be uplink;
taking the Merkel tree as the target index.
7. The method of claim 1, further comprising:
receiving a query request, wherein the query request carries a target category;
according to the target category, acquiring the category information matched with the target category from the index table;
acquiring stored first target data from a link according to the storage address corresponding to the category information;
and decrypting the first target data to obtain decrypted second target data.
8. Heterogeneous physical resource data processing apparatus, said apparatus comprising:
an obtaining module, configured to obtain data to be uplink from a target device, where the target device corresponds to a target node in a block chain system, the block chain system includes at least one type of target device, and data structures to be uplink generated by different types of target devices are different;
a processing module, configured to perform a verification process on the to-be-uplink data in response to an uplink request of the target device, and construct a target index for the to-be-uplink data according to a preset index construction rule when the to-be-uplink data does not have repetition in the block chain system and is within an effective period, where the target index includes category information of the to-be-uplink data and a storage address of the to-be-uplink data;
and the storage module is used for storing the target index on a chain of the block chain system, forming an index table and storing the data to be uplink under the chain.
9. An electronic device, comprising: a processor, a storage medium and a bus, the storage medium storing machine-readable instructions executable by the processor, the processor and the storage medium communicating via the bus when the electronic device is running, the processor executing the machine-readable instructions to perform the heterogeneous physical resource data processing method according to any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored thereon a computer program which, when executed by a processor, performs the heterogeneous physical resource data processing method according to any one of claims 1 to 7.
CN202211478675.8A 2022-11-24 2022-11-24 Heterogeneous physical resource data processing method and device, electronic equipment and storage medium Pending CN115544171A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211478675.8A CN115544171A (en) 2022-11-24 2022-11-24 Heterogeneous physical resource data processing method and device, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211478675.8A CN115544171A (en) 2022-11-24 2022-11-24 Heterogeneous physical resource data processing method and device, electronic equipment and storage medium

Publications (1)

Publication Number Publication Date
CN115544171A true CN115544171A (en) 2022-12-30

Family

ID=84720760

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211478675.8A Pending CN115544171A (en) 2022-11-24 2022-11-24 Heterogeneous physical resource data processing method and device, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN115544171A (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109255056A (en) * 2018-08-16 2019-01-22 北京京东尚科信息技术有限公司 Data referencing processing method, device, equipment and the storage medium of block chain
CN109388960A (en) * 2018-10-24 2019-02-26 全链通有限公司 Information sharing and multi-party computations model based on block chain
CN110275887A (en) * 2019-06-20 2019-09-24 深圳前海微众银行股份有限公司 A kind of data processing method based on block catenary system, system and device
CN111708825A (en) * 2020-06-11 2020-09-25 腾讯科技(深圳)有限公司 Data processing method, device and equipment based on block chain and readable storage medium
US20210160068A1 (en) * 2018-12-14 2021-05-27 Advanced New Technologies Co., Ltd. Data sharing method, apparatus, and system, and electronic device
CN113326317A (en) * 2021-05-24 2021-08-31 中国科学院计算技术研究所 Block chain evidence storing method and system based on isomorphic multi-chain architecture
CN114528331A (en) * 2022-01-12 2022-05-24 盐城矩阵运营管理有限公司 Data query method, device, medium and equipment based on block chain

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109255056A (en) * 2018-08-16 2019-01-22 北京京东尚科信息技术有限公司 Data referencing processing method, device, equipment and the storage medium of block chain
CN109388960A (en) * 2018-10-24 2019-02-26 全链通有限公司 Information sharing and multi-party computations model based on block chain
US20210160068A1 (en) * 2018-12-14 2021-05-27 Advanced New Technologies Co., Ltd. Data sharing method, apparatus, and system, and electronic device
CN110275887A (en) * 2019-06-20 2019-09-24 深圳前海微众银行股份有限公司 A kind of data processing method based on block catenary system, system and device
CN111708825A (en) * 2020-06-11 2020-09-25 腾讯科技(深圳)有限公司 Data processing method, device and equipment based on block chain and readable storage medium
CN113326317A (en) * 2021-05-24 2021-08-31 中国科学院计算技术研究所 Block chain evidence storing method and system based on isomorphic multi-chain architecture
CN114528331A (en) * 2022-01-12 2022-05-24 盐城矩阵运营管理有限公司 Data query method, device, medium and equipment based on block chain

Similar Documents

Publication Publication Date Title
Amudha Dilated transaction access and retrieval: Improving the information retrieval of blockchain-assimilated internet of things transactions
Rouhani et al. Distributed attribute-based access control system using permissioned blockchain
JP7461695B2 (en) Extracting data from a blockchain network
RU2387003C2 (en) Method, system and device for detecting data sources and connection to data sources
CN111368230A (en) Block chain-based industrial internet identification processing method and device
CN115769241A (en) Privacy preserving architecture for licensed blockchains
CN101610190A (en) Data network and system
Panda et al. Optimization of block query response using evolutionary algorithm
CN112699089B (en) Data sharing system, data sharing method and device
CN111931220B (en) Consensus processing method, device, medium and electronic equipment for block chain network
Konoplev et al. A blockchain decentralized public key infrastructure model
Hao et al. Privacy preserving government data sharing based on hyperledger blockchain
EP4120096A1 (en) Method and device for data retrieval, electronic device, and storage medium
Trovò et al. Ants-review: A privacy-oriented protocol for incentivized open peer reviews on Ethereum
CN115292353B (en) Data query method and device, computer equipment and storage medium
CN110928963B (en) Column-level authority knowledge graph construction method for operation and maintenance service data table
Song et al. Smart contract-based trusted content retrieval mechanism for NDN
CN115544171A (en) Heterogeneous physical resource data processing method and device, electronic equipment and storage medium
Buccafurri et al. Range query integrity in cloud data streams with efficient insertion
Pomogalova et al. Identification method for endpoint devices on low-power wide-area networks using digital object architecture with blockchain technology integration
Yan et al. Handling conditional queries and data storage on Hyperledger Fabric efficiently
CN115221558A (en) Digital object efficient evidence storage method and system for multi-subject scientific and technological resources
CN115934832A (en) Metering test detection data credible sharing method based on block chain
CN115238257A (en) Access control face permission updating method and device, computer equipment and storage medium
Xu et al. An ast-based consistency maintenance scheme for cross-chain digital assets

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