CN111737323B - Information query method and device based on block chain and electronic equipment - Google Patents
Information query method and device based on block chain and electronic equipment Download PDFInfo
- Publication number
- CN111737323B CN111737323B CN202010817846.XA CN202010817846A CN111737323B CN 111737323 B CN111737323 B CN 111737323B CN 202010817846 A CN202010817846 A CN 202010817846A CN 111737323 B CN111737323 B CN 111737323B
- Authority
- CN
- China
- Prior art keywords
- node
- target
- monitoring space
- inquirer
- graph database
- 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
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2471—Distributed queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/604—Tools and structures for managing or administering access control systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/2141—Access rights, e.g. capability lists, access control lists, access tables, access matrices
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- General Health & Medical Sciences (AREA)
- Bioethics (AREA)
- Health & Medical Sciences (AREA)
- Automation & Control Theory (AREA)
- Computing Systems (AREA)
- Fuzzy Systems (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present specification provides a block chain-based information query method, an apparatus, and an electronic device, including: when the access right binding relationship between the inquiring party node and the monitoring space node is confirmed in the block chain, establishing a connecting edge between the inquiring party node and the monitoring space node in a graph database; the graph database is pre-established with the connection edges of the monitoring space nodes and the acquisition nodes corresponding to the monitoring space nodes; when receiving a query request aiming at a target monitoring space node sent by a target query party, returning acquisition information acquired by an acquisition node corresponding to the target monitoring space node under the condition that the target monitoring space node connected with the target query party node exists in the graph database.
Description
Technical Field
One or more embodiments of the present disclosure relate to the field of block chain technologies, and in particular, to a method and an apparatus for querying information based on a block chain, and an electronic device.
Background
The block chain technology, also called distributed ledger technology, is an emerging technology in which several computing devices participate in "accounting" together, and a complete distributed database is maintained together. The blockchain technology has been widely used in many fields due to its characteristics of decentralization, transparency, participation of each computing device in database records, and rapid data synchronization between computing devices.
Disclosure of Invention
According to a first aspect of the present specification, there is provided a block chain-based information query method, the method including:
when the access right binding relationship between the inquiring party node and the monitoring space node is confirmed in the block chain, establishing a connecting edge between the inquiring party node and the monitoring space node in a graph database; the graph database is pre-established with the connection edges of the monitoring space nodes and the acquisition nodes corresponding to the monitoring space nodes;
when receiving a query request aiming at a target monitoring space node sent by a target query side node, returning acquisition information acquired by an acquisition node corresponding to the target monitoring space node under the condition that the target monitoring space node connected with the target query side node exists in the graph database.
Optionally, the method further includes:
marking the created continuous edge as valid;
the determining that the target monitoring space node connected with the target inquirer node exists in the graph database includes:
and under the condition that the graph database has a target monitoring space node connected with the target inquiring party node through an effective connecting edge, determining that the graph database has the target monitoring space node connected with the target inquiring party node.
Optionally, the method further includes:
and when determining that the block chain certificate aims at the release information of the access right binding relationship, marking the connecting edge of the inquirer node and the monitoring space node in the graph database as invalid.
Optionally, the method further includes:
recording the creation time and the invalid time of the connecting edge between the inquirer node and the monitoring space node;
the query request further comprises a query time point;
the determining that the target monitoring space node connected with the target inquirer node exists in the graph database includes:
when the monitoring space node connected with the target inquirer node through the effective connecting edge is determined to exist, under the condition that the creating time of the effective connecting edge is before the inquiring time point, the target monitoring space node connected with the target inquirer node is determined to exist;
when the monitoring space node connected with the target inquirer node through the invalid connecting edge is determined to exist, the target monitoring space node connected with the target inquirer node is determined to exist under the condition that the time period formed by the creation time and the invalid time of the invalid connecting edge contains the inquiry time point.
Optionally, the returning of the acquisition information acquired by the acquisition node corresponding to the target monitoring space node includes:
and returning the acquisition information acquired by all the acquisition nodes corresponding to the target monitoring space node.
According to a second aspect of the present specification, there is provided an information query apparatus based on a block chain, the apparatus including:
the creating module is used for creating a connecting edge between the inquiring party node and the monitoring space node in the graph database when the access right binding relationship between the inquiring party node and the monitoring space node is confirmed in the block chain; the graph database is pre-established with the connection edges of the monitoring space nodes and the acquisition nodes corresponding to the monitoring space nodes;
and the query module is used for returning the acquisition information acquired by the acquisition node corresponding to the target monitoring space node under the condition that the target monitoring space node connected with the target inquirer node exists in the graph database when receiving a query request aiming at the target monitoring space node sent by the target inquirer node.
Optionally, the creating module is further configured to mark the created continuous edge as valid;
and the query module is used for determining that the target monitoring space node connected with the target inquirer node exists in the graph database under the condition that the target monitoring space node connected with the target inquirer node through an effective connecting edge exists in the graph database when the target monitoring space node connected with the target inquirer node exists in the graph database.
Optionally, the creating module is further configured to mark a connecting edge between the querying party node and the monitoring space node in the graph database as invalid when determining that the block chaining certificate is directed at the release information of the access right binding relationship.
Optionally, the creating module is further configured to record creating time and invalid time of a connecting edge between the inquirer node and the monitoring space node;
the query request further comprises a query time point;
the query module is used for determining that a target monitoring space node connected with the target inquirer node exists when determining that the target monitoring space node connected with the target inquirer node exists in the graph database and determining that the target monitoring space node connected with the target inquirer node exists under the condition that the creation time of the effective connecting edge is before the query time point when determining that the monitoring space node connected with the target inquirer node exists;
when the monitoring space node connected with the target inquirer node through the invalid connecting edge is determined to exist, the target monitoring space node connected with the target inquirer node is determined to exist under the condition that the time period formed by the creation time and the invalid time of the invalid connecting edge contains the inquiry time point.
Optionally, the query module is configured to, when returning the acquisition information acquired by the acquisition node corresponding to the target monitoring space node, return the acquisition information acquired by all the acquisition nodes corresponding to the target monitoring space node.
According to a third aspect of the present specification, there is provided an electronic apparatus comprising:
a processor;
a memory for storing processor-executable instructions;
the processor executes the executable instructions to realize the information query method based on the block chain.
According to a fourth aspect of the present specification, there is provided a block chain-based warehouse video stream query method, the method including:
when the asset warehousing information of the storage certificate in the block chain is determined, acquiring the asset warehousing information; the asset warehousing information comprises: the access authority binding relationship between the asset associator node and the library level node;
establishing a connecting edge of an asset related party node and a library position node in a graph database; the graphic database is pre-established with the connection edges of the library position nodes and the monitoring nodes corresponding to the library position nodes;
when an inquiry request aiming at the warehousing video stream of the target depot node sent by the target asset associator is received, under the condition that whether the target monitoring depot node connected with the target asset associator node exists or not is inquired in the graph database, if yes, the warehousing video stream shot by the monitoring node corresponding to the target depot node is returned.
As can be seen from the above description, on the one hand, when the collection node is authorized to the inquiring party, the present specification utilizes the existing binding relationship between the monitoring space and the collection node, and the monitoring space is used as a medium, and the monitoring space is authorized to the inquiring party, so that the collection node is indirectly authorized to the inquiring party.
The method has the advantages that when the acquisition node indirectly authorized to the inquiring party is replaced, the authority management party only needs to modify the corresponding relation between the preset monitoring space node and the acquisition node without changing the access authority of the inquiring party, so that the inquiring party can achieve the purpose of accessing the monitoring space by the inquiring party under the condition that the inquiring party does not feel the change of the access authority of the inquiring party, and the authority establishing mode is more flexible.
In addition, when the query space corresponds to a plurality of acquisition nodes, the monitoring space is authorized to the query party, and then a plurality of acquisition devices can be indirectly authorized to the query party at one time. Therefore, the indirect authorization mode also improves the authorization efficiency.
On the other hand, compared with the method of managing the access authority of the inquirer by adopting a relational database, the authority management is carried out by adopting a graphic database, and the inquiry authority of different inquirers can be shown only by connecting edges between nodes without involving external keys or out-of-band processing, so that the authority management is simpler and more intuitive.
Drawings
Fig. 1 is a network architecture diagram of a blockchain-based information query system according to an exemplary embodiment of the present disclosure;
FIG. 2 is a flow chart illustrating a blockchain-based information query method in an exemplary embodiment of the present specification;
FIG. 3a is a schematic diagram of a graphic database shown in an exemplary embodiment of the present description;
FIG. 3b is a schematic diagram of another graphical database shown in an exemplary embodiment of the present description;
FIG. 4a is a schematic diagram of another graphical database shown in an exemplary embodiment of the present description;
FIG. 4b is a schematic diagram of another graphical database shown in an exemplary embodiment of the present description;
FIG. 4c is a schematic diagram of another graphical database shown in an exemplary embodiment of the present description;
FIG. 4d is a schematic diagram of another graphical database shown in an exemplary embodiment of the present description;
FIG. 5 is a diagram illustrating a hardware configuration of an electronic device in accordance with an exemplary embodiment of the present disclosure;
fig. 6 is a block diagram illustrating an information query apparatus based on a blockchain according to an exemplary embodiment of the present disclosure.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated.
It should be noted that: in other embodiments, the steps of the corresponding methods are not necessarily performed in the order shown and described herein. In some other embodiments, the method may include more or fewer steps than those described herein. Moreover, a single step described in this specification may be broken down into multiple steps for description in other embodiments; multiple steps described in this specification may be combined into a single step in other embodiments.
In some scenes of the internet of things, a collection node is deployed in a monitoring space and is used for collecting relevant information of the monitoring space. After the collection node is authorized to the inquiring party, the inquiring party has the access right of the monitoring space related information collected by the collection node.
Based on the scene of the internet of things, the specification aims to provide an information query method based on a block chain. In this specification, when determining that the access right binding relationship between the inquiring party node and the monitoring space node exists in the block chain, creating a connecting edge between the inquiring party node and the monitoring space node in a graph database; the graph database is pre-established with the connection edges of the monitoring space nodes and the acquisition nodes corresponding to the monitoring space nodes; when receiving a query request aiming at a target monitoring space node sent by a target query side node, returning acquisition information acquired by an acquisition node corresponding to the target monitoring space node under the condition that the target monitoring space node connected with the target query side node exists in the graph database.
On one hand, when the acquisition node is authorized to the inquiring party, the present specification utilizes the existing binding relationship between the monitoring space and the acquisition node, takes the monitoring space as a medium, and authorizes the monitoring space to the inquiring party, thereby indirectly authorizing the acquisition node to the inquiring party.
The method has the advantages that when the acquisition node indirectly authorized to the inquiring party is replaced, the authority management party only needs to modify the corresponding relation between the preset monitoring space node and the acquisition node without changing the access authority of the inquiring party, so that the inquiring party can achieve the purpose of accessing the monitoring space by the inquiring party under the condition that the inquiring party does not feel the change of the access authority of the inquiring party, and the authority establishing mode is more flexible.
In addition, when the query space corresponds to a plurality of acquisition nodes, the monitoring space is authorized to the query party, and then a plurality of acquisition devices can be indirectly authorized to the query party at one time. Therefore, the indirect authorization mode also improves the authorization efficiency.
On the other hand, compared with the method of managing the access authority of the inquirer by adopting a relational database, the authority management is carried out by adopting a graphic database, and the inquiry authority of different inquirers can be shown only by connecting edges between nodes without involving external keys or out-of-band processing, so that the authority management is simpler and more intuitive.
It should be noted that the information query method based on the block chain in the present specification can be applied to various internet of things scenarios. As long as the physical network scene has a monitoring space, and the collection nodes are deployed on the monitoring space. When the inquiring party needs to access the acquired information acquired by the acquisition node, the information inquiring method based on the block chain provided by the specification can be adopted.
For example, the scene may be a warehousing scene, in the warehousing scene, the space may be a warehouse location, the acquisition node is a camera deployed on the warehouse location, and the camera may acquire a warehousing video stream of the warehouse location. When the camera is authorized to a certain inquiring party, the inquiring party can access the warehousing video stream collected by the camera.
For example, the scene may be a monitoring scene, in the monitoring scene, the space may be a floor, the acquisition node is a camera deployed on each floor, and the camera may acquire a video stream of the floor. When a camera is granted to a querying party, the querying party may access the floor video stream captured by the camera.
For another example, the scene may be a shipping scene, in which the space may be a shipping tool, and the collection node is a thermometer for collecting the temperature of the shipping tool. When the thermometer is authorized by a querying party, the querying party has access to the temperature collected by the thermometer.
Here, the internet of things scenario is only exemplarily illustrated, and is not specifically limited.
Since this description refers to blockchain techniques, concepts related to blockchain techniques are introduced.
Blockchains are generally divided into three types: public chain (Public Blockchain), Private chain (Private Blockchain) and alliance chain (Consortium Blockchain). Furthermore, there may be a combination of the above types, such as private chain + federation chain, federation chain + public chain, and so on.
Among them, the most decentralized is the public chain. The public chain is represented by bitcoin and ether house, and participants (also called nodes in the block chain) joining the public chain can read data records on the chain, participate in transactions, compete for accounting rights of new blocks, and the like. Moreover, each node can freely join or leave the network and perform related operations.
Private chains are the opposite, with the network's write rights controlled by an organization or organization and the data read rights specified by the organization. Briefly, a private chain may be a weakly centralized system with strict restrictions on nodes and a small number of nodes. This type of blockchain is more suitable for use within a particular establishment.
A federation chain is a block chain between a public chain and a private chain, and "partial decentralization" can be achieved. Each node in a federation chain typically has a physical organization or organization corresponding to it; the nodes are authorized to join the network and form a benefit-related alliance, and block chain operation is maintained together.
Based on the basic characteristics of a blockchain, a blockchain is usually composed of several blocks. The time stamps corresponding to the creation time of the block are recorded in the blocks respectively, and all the blocks form a time-ordered data chain according to the time stamps recorded in the blocks strictly.
The real data generated by the physical world can be constructed into a standard transaction (transaction) format supported by a block chain, then is issued to the block chain, the node equipment in the block chain performs consensus processing on the received transaction, and after the consensus is achieved, the node equipment serving as an accounting node in the block chain packs the transaction into a block and performs persistent evidence storage in the block chain.
The consensus algorithm supported in the blockchain may include:
the first kind of consensus algorithm, namely the consensus algorithm that the node device needs to contend for the accounting right of each round of accounting period; consensus algorithms such as Proof of Work (POW), Proof of equity (POS), Proof of commission rights (DPOS), etc.;
the second kind of consensus algorithm, namely the consensus algorithm which elects accounting nodes in advance for each accounting period (without competing for accounting right); for example, a consensus algorithm such as a Practical Byzantine Fault Tolerance (PBFT) is used.
In a blockchain network employing a first type of consensus algorithm, node devices competing for billing rights can execute a transaction upon receipt. One of the node devices competing for the accounting right may win in the process of competing for the accounting right in the current round, and become an accounting node. The accounting node may package the received transaction with other transactions to generate a latest block and send the generated latest block or a block header of the latest block to other node devices for consensus.
In the block chain network adopting the second type of consensus algorithm, the node equipment with the accounting right is agreed before accounting in the current round. Thus, the node device, after receiving the transaction, may send the transaction to the accounting node if it is not the accounting node of its own round. For the accounting node of the current round, the transaction may be performed during or before packaging the transaction with other transactions to generate the latest block. After generating the latest block, the accounting node may send the latest block or a block header of the latest block to other node devices for consensus.
As described above, regardless of which consensus algorithm is used by the blockchain, the accounting node of the current round may pack the received transaction to generate the latest block, and send the generated latest block or the block header of the latest block to other node devices for consensus verification. If no problem is verified after other node equipment receives the latest block or the block header of the latest block, the latest block can be added to the tail of the original block chain, so that the accounting process of the block chain is completed. The transaction contained in the block may also be performed by other nodes in verifying the new block or block header sent by the accounting node.
After introducing the related concepts of the blockchain technology, the method for querying a warehouse video stream based on a blockchain provided in the present specification is described in detail below.
Referring to fig. 1, fig. 1 is a network architecture diagram of a block chain based information query system according to an exemplary embodiment of the present disclosure.
The networking architecture includes: block chain, inquiry party and authority management party.
And the authority management party is used for managing the access authority of different inquiring parties to the acquisition node. In this specification, the authority manager may interface with a node device of the blockchain, and may perform operations such as related authority establishment based on information determined from the blockchain.
The inquiring party can communicate with the authority management party and inquire the acquisition information of the acquisition nodes which can be accessed by the inquiring party from the authority management party.
In practical application, under different scenes, the authority management party and the inquiring party have different roles.
For example, in a warehousing scenario, the authority manager is a warehousing system of a warehousing manager, and the inquiring party may be a goods owner of goods on a warehouse location. Of course the inquiring party may also be a party involved in the processing of the good. For example, after a cargo on a storage location is mortgaged, a bank or a third-party organization needs to acquire a warehousing video stream acquired by a camera on the storage location in order to know whether the cargo really exists and the existence condition of the cargo. The inquiring party may also be a banking institution or a third party vouching institution or the like.
For example, in the monitoring scenario, the authority management party may be a property of a building, and the querying party may be a tenant of the building.
For example, in the shipping scenario, the rights manager may be a party managing shipping information, and the inquiring party may be a shipper or a consignee, etc.
Here, the rights manager and the inquirer are only exemplified and not particularly limited.
Referring to fig. 2, fig. 2 is a flowchart illustrating a block chain-based information query method, which may be applied to a rights manager, according to an exemplary embodiment of the present disclosure, and may include the following steps.
Step 202: when the authority management party determines that the access authority binding relationship between the inquiring party node and the monitoring space node exists in the block chain, establishing a connecting edge between the inquiring party node and the monitoring space node in a graphic database; and the graph database is pre-established with the connection edges of the monitoring space nodes and the acquisition nodes corresponding to the monitoring space nodes.
In addition, in the implementation of this specification, since the correspondence between the monitoring space nodes and the collection nodes is preset, and will not change due to the change of the object placed in the monitoring space, in creating the graph database, the monitoring space nodes and the collection nodes may be created in advance, and the connection edges between the collection nodes corresponding to the monitoring space nodes may be created.
In this specification, the blockchain may store the access right binding relationship between the inquiring node and the monitoring node.
And when the authority management party determines that the access authority binding relationship between the inquiring party and the monitoring space exists in the block chain, establishing a connecting edge between the inquiring party node and the monitoring space node in the graph database.
The following description is made in terms of "determining the access right binding relationship between the inquiring party node and the monitoring space node stored in the block chain" and "creating the connecting edge between the inquiring party node and the monitoring space node".
1) Determining the access authority binding relationship between the evidence storing inquirer node and the monitoring space node in the block chain
In an optional implementation manner, the authority management party may monitor data of the certificate stored in the block chain, and the authority management party may monitor the access authority binding relationship between the certificate storage inquiry party node and the monitoring space node in the block chain through a monitoring mechanism.
In another alternative implementation manner, a node device of the block chain may install a subscription plug-in, and the rights manager may subscribe data required by itself (i.e., the access rights binding relationship between the querier node and the monitoring space node) on the plug-in on the block chain node device. The plug-in can send the access right binding relationship between the inquirer node and the monitoring space node subscribed by the right manager to the right manager.
2) Creating a connecting edge between an inquirer node and a monitored space node
During creation, in order to save the storage space of the graph database and improve the query performance of the graph database, the nodes in the graph database can be reused. Thus, at creation time, the warehousing system may check whether the querier node is created in the graph database.
If the asset owner node is not created in the graph database, an inquirer node corresponding to the inquirer is created in the graph database, a monitoring space node corresponding to the monitoring space is searched, and a connecting edge between the inquirer node and the monitoring space node is established.
If the inquiring party node corresponding to the inquiring party is created in the graph database, a connecting edge between the created inquiring node and the monitoring space node corresponding to the monitoring space is established.
It should be noted that, because the connection edges between the querying side node and the monitoring space node are established, and the connection edges between the monitoring space node and the collection node are established in advance, the querying side node and the collection node are connected. The connection between the inquiring party node and the collecting node indicates that the inquiring party can access the collected information collected by the collecting node.
For example, assuming that the collection device 31 is disposed on the monitoring space 31, the collection device 32 is disposed on the monitoring space 32, and the collection device 33 is disposed on the monitoring space 33, as shown in fig. 3a, a monitoring space node 31 representing the monitoring space 31, a monitoring space node 32 representing the monitoring space 32, a monitoring space node 33 representing the monitoring space 33, a collection node 31 representing the collection device 31, a collection node 32 representing the collection device 32, and a collection node 33 representing the collection device 33 are established in the graph database.
A connecting edge is arranged between a monitoring space node 31 and a collection node 31 in the graph database, a connecting edge is arranged between a monitoring space node 32 and a collection node 32, and a connecting edge is arranged between a monitoring space node 33 and a collection node 33.
When determining the access right binding relationship between the block chaining evidence storage inquirer node 31 and the monitoring space node 31, the right manager can detect whether the inquirer node 31 corresponding to the inquirer node 31 exists in the graph database as shown in fig. 3 a. In this example, the graph database does not have the querier node 31, so the rights manager can establish the querier node 31 in the graph database and look up the monitored space node 31 in the graph database. The rights manager may then establish a connecting edge between the querier node 31 and the monitored space node 31, forming figure 3 b.
As can be seen from fig. 3b, since the monitoring space node 31 is connected to the collection node 31, after the connecting edge between the inquiring node 31 and the monitoring space node 31 is established, the inquiring node 31 is also connected to the collection node 31. The inquiring party node 31 is connected to the collecting node 31, which indicates that the inquiring party node 31 has the right to access the collecting information collected by the collecting node 31.
Step 204: when receiving a query request aiming at a target monitoring space node sent by a target query party node, an authority management party returns acquisition information acquired by an acquisition node corresponding to the target monitoring space node under the condition that the target monitoring space node connected with the target query party node exists in the graph database.
When the method is realized, when the authority management party receives the query request sent by the target query party, the query request carries the target query party node. The authority management party can search whether a target monitoring space node connected with the target inquiry party node exists in the graph database.
And if the target monitoring space node connected with the target inquiry side node exists, returning the acquisition information acquired by the acquisition node connected with the target monitoring space node.
And if the target monitoring space node connected with the target inquirer node does not exist, returning prompt information of no access permission.
Still taking fig. 3b as an example, it is assumed that the query request received by the rights manager carries the querier node 31. The rights manager may look up the querier node 31 in the graph database and then check if the querier node 31 has a connected monitoring space node 31. In this example, since the inquiring party node 31 is connected to the monitored space node 31, the authority manager may return the collection information collected by the collection node 31 connected to the monitored space node 31.
In addition, in this embodiment of the present specification, the rights management party may further mark a continuous edge of the querying party node and the monitoring space node as valid after creating the continuous edge.
When the authority management party determines the release information of the access authority binding relationship between the block link evidence storage inquiry party node and the monitoring space node, the authority management party can mark the connection edge as invalid.
In the scenario marked in this way, when the step of "inquiring whether there is a target monitoring space node connected to the target inquiring party node in the graph data" is implemented, the authority management party may search whether there is a target monitoring space node connected to the target inquiring party node through an effective connection edge in the graph database.
And if the target monitoring space node connected with the target inquiring party node through the effective connecting edge exists, determining that the target monitoring space node connected with the target inquiring party node exists.
And if the target monitoring space node connected with the target inquiring party node through the effective connecting edge does not exist, determining that the target monitoring space node connected with the target inquiring party node does not exist.
Furthermore, in order to enable the target inquirer to access not only the current relevant information of the monitored space but also the historical relevant information of the monitored space, the right management party marks the continuous edge as valid after the continuous edge of the inquirer node and the monitored space node is created, and records the creation time of the continuous edge.
When the authority management party determines the release information of the access authority binding relationship between the block link evidence storage inquiry party node and the monitoring space node, the authority management party can mark the connection edge as invalid and record the invalid time of the connection edge.
Since the nodes of the graph database can be reused, at least one connecting edge can exist between the inquirer node and the monitoring space node.
For example, if the monitored space is authorized to the query party from 3/5/2020 to 3/10/2020, the connection between the node of the query party and the node of the monitored space is marked as invalid, the creation time of the connection is 3/5/2020, and the invalid time is 3/10/2020.
Assuming that the monitoring space is authorized to the inquiring party again in the past at 4/1/2020, the connection edge between the node of the inquiring party and the node of the monitoring space is valid, and the creation time is 4/1/2020.
In this scenario, when the step of "inquiring whether there is a target monitoring space node connected to the target inquirer node in the graph data" is implemented, there are many cases, which are as follows:
when the monitoring space node connected with the target inquirer node through the effective connecting edge is determined to exist, under the condition that the creating time of the effective connecting edge is before the inquiring time point, the target monitoring space node connected with the target inquirer node is determined to exist.
When the monitoring space node connected with the target inquirer node through the invalid connecting edge is determined to exist, the target monitoring space node connected with the target inquirer node is determined to exist under the condition that the time period formed by the creation time and the invalid time of the invalid connecting edge contains the inquiry time point.
And if the creation time of the effective continuous edge is not before the query time point, and/or the time period formed by the creation time and the invalid time of the invalid continuous edge does not contain the query time point, determining that no acquisition node connected with the target inquirer node exists.
In addition, in this embodiment of the present specification, in a case that it is determined that a target monitoring space node connected to the target querying party node exists in the graph database, the authority management party may return the collection information collected by all collection nodes connected to the target monitoring space node to the target querying party.
It should be noted that, when the collection node is authorized to the inquiring party, the present specification utilizes the existing binding relationship between the monitoring space and the collection node, and the monitoring space is used as a medium, and the collection node is indirectly authorized to the inquiring party by authorizing the monitoring space to the inquiring party. Therefore, when the monitoring space corresponds to a plurality of acquisition devices, in this specification, the plurality of acquisition devices can be indirectly authorized to the inquiring party only by authorizing the monitoring space to the inquiring party. During inquiry, the inquiring party can inquire the acquisition information of a plurality of acquisition devices. Therefore, the authorization efficiency is improved by the indirect authorization mode.
Of course, in practical applications, in a case that it is determined that the target monitoring space node connected to the target querying party node exists in the graph database, the authority management party may also return the collection information of one or more collection nodes connected to the target monitoring node to the target querying party, which is only described by way of example and is not specifically limited herein.
As can be seen from the above description, on the one hand, when the collection node is authorized to the inquiring party, the present specification utilizes the existing binding relationship between the monitoring space and the collection node, and the monitoring space is used as a medium, and the monitoring space is authorized to the inquiring party, so that the collection node is indirectly authorized to the inquiring party.
The method has the advantages that when the acquisition node indirectly authorized to the inquiring party is replaced, the authority management party only needs to modify the corresponding relation between the preset monitoring space node and the acquisition node without changing the access authority of the inquiring party, so that the inquiring party can achieve the purpose of accessing the monitoring space by the inquiring party under the condition that the inquiring party does not feel the change of the access authority of the inquiring party, and the authority establishing mode is more flexible.
On the other hand, compared with the method of managing the access authority of the inquirer by adopting a relational database, the authority management is carried out by adopting a graphic database, and the inquiry authority of different inquirers can be shown only by connecting edges between nodes without involving external keys or out-of-band processing, so that the authority management is simpler and more intuitive.
In the third aspect, in this specification, after the continuous edge between the querier node and the monitoring space node is established, the continuous edge is marked as valid, and the time of establishing the continuous edge is recorded. After the access right binding relationship between the inquirer and the monitored space is unbound, the continuous edges of the inquirer node and the monitored space node in the graphic database are not deleted, but are marked as invalid, and the invalid time of the continuous edges is recorded, so that the inquirer can access not only the related information of the current monitored space, but also the historical related information of the monitored space.
The information query method based on the block chain is described in detail below by taking a warehousing scene as an example.
In a warehousing scenario, the authority manager may be a warehousing system. The inquiring party may be an asset associating party, the monitoring space may be a storage location, the collecting device may be a monitoring device (such as a camera) deployed on the storage location, and the collected information may be a warehouse video stream on the storage location collected by the monitoring device.
Where asset associator refers to a participant that is related to an asset at a library location. For example, the asset associated parties may include the owner of the asset, the banking institution involved in the mortgage of the asset, the guarantor, and so on. The asset associator is here only illustrated by way of example and not specifically limited.
When the method is realized, the warehousing system acquires asset warehousing information when the warehousing information of assets stored in the block chain is determined; the asset warehousing information comprises: the access authority binding relationship between the asset associator node and the library level node; establishing a connecting edge of an asset related party node and a library position node in a graph database; the graphic database is pre-established with the connection edges of the library position nodes and the monitoring nodes corresponding to the library position nodes;
and when receiving a query request aiming at the target storage position node sent by the target asset associated party, the warehousing system returns the warehousing video stream shot by the monitoring node corresponding to the target storage position node under the condition of determining that the target storage position node connected with the target asset associated party node exists in the graph database in the query.
Optionally, the method further includes:
the warehousing system marks the created connecting edge as valid;
the determining that there is a target library location node connected to the target asset related party node in the query of the graph database includes:
and under the condition that the database position node connected with the target asset related party node through the effective connecting edge is inquired in the graph database, determining that the database position node connected with the target asset related party node exists in the graph database.
Optionally, the method further includes:
and when determining that the block chain evidence aims at the asset delivery information of the asset delivery information, marking the connecting edge of the asset associated party node and the library position node in the graph database as invalid.
Optionally, the method further includes:
recording the creation time and the invalid time of the connecting edge between the asset associator node and the library position node;
the query request further comprises a query time point;
the determining that there is a target library location node connected to the target asset related party node in the query of the graph database includes:
when a library position node connected with the target asset related party node through an effective connecting edge exists, determining that the library position node connected with the target asset related party node exists under the condition that the creating time of the effective connecting edge is before the query time point;
and when the library position node connected with the target asset associated side node through the invalid connecting edge exists, determining that the library position node connected with the target asset associated side node exists under the condition that a time period formed by the creation time and the invalid time of the invalid connecting edge contains the query time point.
The block chain based warehouse video stream query method provided in the present specification is described in detail below with reference to fig. 4a to 4 d.
In reality, assuming that the monitoring device 41 is disposed on the library site 41, the monitoring device 42 is disposed on the library site 42, and the monitoring device 43 is disposed on the library site 43, as shown in fig. 4a, a library site node 41 representing the library site 41, a library site node 42 representing the library site 42, a library site node 43 representing the library site 43, the monitoring node 41 representing the monitoring device 41, the monitoring node 42 representing the monitoring device 42, and the monitoring node 43 representing the monitoring device 43 are established in the graph database.
A connecting edge is arranged between the library position node 41 and the monitoring node 41 in the graph database, a connecting edge is arranged between the library position node 42 and the monitoring node 42, and a connecting edge is arranged between the library position node 43 and the monitoring node 43.
Suppose that the warehousing system can acquire the asset warehousing information when determining the asset warehousing information of the block chain at 12:00 at 3/5/2020. It is assumed that the asset warehousing information includes an asset associator 41, and a warehouse location 41.
The warehousing system may detect whether an asset associate node 41 corresponding to an asset associate 41 exists in the graph database shown in fig. 4 a. In this example, the graphical database does not have an asset associator node 41, so the warehousing system can establish the asset associator node 41 in the graphical database and look up the bin node 41 corresponding to the bin 41 in the graphical database as shown in FIG. 4 a. The warehousing system may then establish a continuous edge 401 between the asset associator node 41 and the depot node 41, mark the continuous edge 401 as a valid continuous edge, and record the creation time (i.e., 2020.3.5.12: 00) of the continuous edge 401, forming fig. 4 b.
Suppose that, when the warehousing system determines that the block chain node verifies the asset ex-warehouse information corresponding to the above-mentioned asset in-warehouse information at 20: 00/3/10/2020, the connected edge 401 shown in fig. 4b may be marked as invalid, and the invalid time (i.e., 2020.3.10.20: 00) of the connected edge 401 is recorded, so as to form fig. 4 c.
Suppose that the warehousing system determines that the block chain node verifies the asset warehousing information again in 2020, 4, 1, 13: 00. The asset associating party of the asset warehousing information is the asset associating party 41 and the storage location node is the storage location node 41.
The warehousing system may establish a connecting edge 411 between the asset associator node 41 and the bay node 41 in the graph database shown in fig. 4c, mark the connecting edge as a valid connecting edge, and record the creation time (i.e., 2020.4.1.13: 00) of the connecting edge 411, forming fig. 4 d.
Assume that the warehousing system receives a query request at 2/4/2020, carrying the asset associate 41, and a query time point (assuming the indicating information for indicating the current time point, assuming the current time point is 2020.4.2.13: 00). The warehousing system may look up in the graph database shown in fig. 4d whether there is a bay node connected to the asset associate node 41. Since the creation time of the effective connecting edge 411 between the asset associator node 41 and the depot node 41 is before the query time point, it is determined that there is a depot node 41 connected to the asset associator node 41, and a monitoring node 41 connected to the depot node 41 is determined, and a warehousing video stream currently shot by the monitoring node 41 is returned.
Assume that the warehousing system receives a query request at 4/2/2020, carrying the asset associate 41 and the query time point (i.e., 3/10/2020). The warehousing system may look up in the graph database shown in fig. 4d whether there is a bay node connected to the asset associate node 41. Since the time period formed by the creation time and the invalid time of the invalid connecting edge 401 between the asset associator node 41 and the library position node 41 contains the query time point, it is determined that there is a library position node connected to the asset associator node 41, and the monitoring node 41 connected to the library position node 41 is determined, and the warehouse video stream shot by the monitoring node 41 in 3, 10/2020 is returned.
In addition, in the embodiment of the present specification, in addition to establishing a connection edge between the library-level node and the monitoring node in advance in the graph database, relevant information of the library-level node may be established. Such as the warehouse to which the warehouse location node belongs, the warehouse manager to which the warehouse belongs, and so on.
The access right binding relationship between the asset associator and the library location may be a direct binding relationship or an indirect binding relationship (for example, the asset associator is bound with the warehouse slip, the warehouse slip is bound with the library location, etc.). Therefore, the asset related party nodes in the graphic database can establish the connecting edges with the library position nodes through the warehouse single nodes. For example, the asset related party node establishes a connecting edge with the warehouse bill node, and the warehouse bill node connects an edge with the warehouse location node. The manifest node is used here to indicate that the asset is stored in a bay.
Corresponding to the above embodiment of the information query method based on the block chain, the present specification also provides an embodiment of an information query apparatus based on the block chain.
Corresponding to the above embodiment of the information query method based on the block chain, the present specification further provides an embodiment of an information query apparatus based on the block chain. The embodiment of the information query device based on the block chain in the present specification can be applied to an electronic device. The device embodiments may be implemented by software, or by hardware, or by a combination of hardware and software. Taking a software implementation as an example, as a logical device, the device is formed by reading, by a processor of the electronic device where the device is located, a corresponding computer program instruction in the nonvolatile memory into the memory for operation. From a hardware aspect, as shown in fig. 5, the hardware structure diagram of an electronic device where an information query apparatus based on a block chain according to this specification is located is shown in fig. 5, except for the processor, the memory, the network interface, and the nonvolatile memory shown in fig. 5, the electronic device where the apparatus is located in the embodiment may also include other hardware according to an actual function of the electronic device, which is not described again.
Referring to fig. 6, fig. 6 is a block diagram illustrating an information query apparatus based on a block chain according to an exemplary embodiment of the present disclosure. The device can be applied to a warehousing system and can comprise the following modules.
A creating module 601, configured to create a connecting edge between an inquiring party node and a monitoring space node in a graph database when determining that the access right binding relationship between the inquiring party node and the monitoring space node exists in the block chain; the graph database is pre-established with the connection edges of the monitoring space nodes and the acquisition nodes corresponding to the monitoring space nodes;
the query module 602 is configured to, when receiving a query request for a target monitoring space node sent by a target querier node, return acquisition information acquired by an acquisition node corresponding to the target monitoring space node when it is determined that the target monitoring space node connected to the target querier node exists in the graph database.
Optionally, the creating module 601 is further configured to mark the created continuous edge as valid;
the query module 602, when determining that a target monitoring space node connected to the target querier node exists in the graph database, is configured to determine that a target monitoring space node connected to the target querier node exists in the graph database under the condition that it is determined that a target monitoring space node connected to the target querier node exists in the graph database through an effective connection edge.
Optionally, the creating module 601 is further configured to mark a connecting edge between the querying party node and the monitoring space node in the graph database as invalid when determining that the block chaining certificate is directed to the information for removing the access right binding relationship.
Optionally, the creating module 601 is further configured to record creating time and invalid time of a connection between the inquirer node and the monitoring space node;
the query request further comprises a query time point;
the query module 602, when determining that a target monitoring space node connected to the target querier node exists in the graph database, is configured to determine that a target monitoring space node connected to the target querier node exists when determining that a monitoring space node connected to the target querier node through an effective connection edge exists, and when the creation time of the effective connection edge is before the query time point;
when the monitoring space node connected with the target inquirer node through the invalid connecting edge is determined to exist, the target monitoring space node connected with the target inquirer node is determined to exist under the condition that the time period formed by the creation time and the invalid time of the invalid connecting edge contains the inquiry time point.
Optionally, the query module 602 is configured to, when returning the acquisition information acquired by the acquisition node corresponding to the target monitoring space node, return the acquisition information acquired by all the acquisition nodes corresponding to the target monitoring space node.
The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. A typical implementation device is a computer, which may take the form of a personal computer, laptop computer, cellular telephone, camera phone, smart phone, personal digital assistant, media player, navigation device, email messaging device, game console, tablet computer, wearable device, or a combination of any of these devices.
In a typical configuration, a computer includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic disk storage, quantum memory, graphene-based storage media or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
It should be understood that although the terms first, second, third, etc. may be used in one or more embodiments of the present description to describe various information, such information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of one or more embodiments herein. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
The above description is only for the purpose of illustrating the preferred embodiments of the one or more embodiments of the present disclosure, and is not intended to limit the scope of the one or more embodiments of the present disclosure, and any modifications, equivalent substitutions, improvements, etc. made within the spirit and principle of the one or more embodiments of the present disclosure should be included in the scope of the one or more embodiments of the present disclosure.
Claims (12)
1. An information query method based on a block chain, the method is applied to a rights management party, and the method comprises the following steps:
when the access right binding relationship between an inquiring party node and a monitoring space node is confirmed in a block chain, establishing a connecting edge between the inquiring party node and the monitoring space node in a graph database; the graph database is pre-established with the connection edges of the monitoring space nodes and the acquisition nodes corresponding to the monitoring space nodes;
when receiving a query request aiming at a target monitoring space node sent by a target query party, returning acquisition information acquired by an acquisition node corresponding to the target monitoring space node under the condition that the target monitoring space node connected with the target query party node exists in the graph database;
the determining of the access right binding relationship between the evidence storing inquirer node and the monitoring space node in the block chain comprises:
and monitoring the access right binding relationship between the inquiring party node and the monitoring space node which exist in the block chain, or receiving the access right binding relationship between the inquiring party node and the monitoring space node which are subscribed by the right manager and returned by the node equipment of the block chain.
2. The method of claim 1, further comprising:
marking the created continuous edges as valid;
the determining that the target monitoring space node connected with the target inquirer node exists in the graph database includes:
and under the condition that the graph database has a target monitoring space node connected with the target inquiring party node through an effective connecting edge, determining that the graph database has the target monitoring space node connected with the target inquiring party node.
3. The method of claim 2, further comprising:
and when determining that the block chain certificate aims at the release information of the access right binding relationship, marking the connecting edge of the inquirer node and the monitoring space node in the graph database as invalid.
4. The method of claim 3, further comprising:
recording the creation time and the invalid time of the connecting edge between the inquirer node and the monitoring space node;
the query request further comprises a query time point;
the determining that the target monitoring space node connected with the target inquirer node exists in the graph database includes:
when the monitoring space node connected with the target inquirer node through the effective connecting edge is determined to exist, under the condition that the creating time of the effective connecting edge is before the inquiring time point, the target monitoring space node connected with the target inquirer node is determined to exist;
when the monitoring space node connected with the target inquirer node through the invalid connecting edge is determined to exist, the target monitoring space node connected with the target inquirer node is determined to exist under the condition that the time period formed by the creation time and the invalid time of the invalid connecting edge contains the inquiry time point.
5. The method according to claim 1, wherein the returning of the acquisition information acquired by the acquisition node corresponding to the target monitoring space node comprises:
and returning the acquisition information acquired by all the acquisition nodes corresponding to the target monitoring space node.
6. An information inquiry apparatus based on a block chain, the apparatus being applied to a rights manager, the apparatus comprising:
the system comprises a creating module, a judging module and a judging module, wherein the creating module is used for creating a connecting edge between an inquirer node and a monitoring space node in a graph database when the access right binding relationship between the inquirer node and the monitoring space node is confirmed in a block chain; the graph database is pre-established with the connection edges of the monitoring space nodes and the acquisition nodes corresponding to the monitoring space nodes; the creating module is used for monitoring the access authority binding relationship between the evidence storing inquirer node and the monitoring space node in the block chain when the access authority binding relationship between the evidence storing inquirer node and the monitoring space node in the block chain is determined, or receiving the access authority binding relationship between the inquirer node and the monitoring space node subscribed by the authority manager and returned by the node equipment of the block chain;
and the query module is used for returning the acquisition information acquired by the acquisition node corresponding to the target monitoring space node under the condition that the target monitoring space node connected with the target inquirer node exists in the graph database when receiving a query request aiming at the target monitoring space node sent by the target inquirer node.
7. The apparatus of claim 6, the creation module further configured to mark the created even edge as valid;
and the query module is used for determining that the target monitoring space node connected with the target inquirer node exists in the graph database under the condition that the target monitoring space node connected with the target inquirer node through an effective connecting edge exists in the graph database when the target monitoring space node connected with the target inquirer node exists in the graph database.
8. The apparatus of claim 7, wherein the creating module is further configured to mark a connecting edge between the querier node and the monitor space node in the graph database as invalid when determining that the block chaining certificate is used for removing the access right binding relationship.
9. The apparatus of claim 8, the creating module further configured to record creation time and invalidation time of a connection between the querier node and the monitored space node;
the query request further comprises a query time point;
the query module is used for determining that a target monitoring space node connected with the target inquirer node exists when determining that the target monitoring space node connected with the target inquirer node exists in the graph database and determining that the target monitoring space node connected with the target inquirer node exists under the condition that the creation time of the effective connecting edge is before the query time point when determining that the monitoring space node connected with the target inquirer node exists;
when the monitoring space node connected with the target inquirer node through the invalid connecting edge is determined to exist, the target monitoring space node connected with the target inquirer node is determined to exist under the condition that the time period formed by the creation time and the invalid time of the invalid connecting edge contains the inquiry time point.
10. The device according to claim 6, wherein the query module is configured to return the collected information collected by all the collection nodes corresponding to the target monitoring space node when returning the collected information collected by the collection node corresponding to the target monitoring space node.
11. An electronic device, comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor implements the method of any one of claims 1-4 by executing the executable instructions.
12. A warehousing video stream query method based on block chains, the method comprising:
when the asset warehousing information of the storage certificate in the block chain is determined, acquiring the asset warehousing information; the asset warehousing information comprises: the access authority binding relationship between the asset associator node and the library level node;
establishing a connecting edge of an asset related party node and a library position node in a graph database; the graphic database is pre-established with the connection edges of the library position nodes and the monitoring nodes corresponding to the library position nodes;
when receiving a query request aiming at a target storage position node sent by a target asset associator, returning a warehousing video stream shot by a monitoring node corresponding to the target storage position node under the condition that the target storage position node connected with the target asset associator node is determined to exist in the graph database in the query;
the determining of the access right binding relationship between the evidence storing inquirer node and the monitoring space node in the block chain comprises: and monitoring the access right binding relationship between the inquiring party node and the monitoring space node stored in the block chain, or receiving the access right binding relationship between the inquiring party node and the monitoring space node subscribed by the right manager returned by the node device of the block chain.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010817846.XA CN111737323B (en) | 2020-08-14 | 2020-08-14 | Information query method and device based on block chain and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010817846.XA CN111737323B (en) | 2020-08-14 | 2020-08-14 | Information query method and device based on block chain and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111737323A CN111737323A (en) | 2020-10-02 |
| CN111737323B true CN111737323B (en) | 2021-03-16 |
Family
ID=72658442
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010817846.XA Active CN111737323B (en) | 2020-08-14 | 2020-08-14 | Information query method and device based on block chain and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111737323B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112328712B (en) * | 2021-01-04 | 2021-05-18 | 清华四川能源互联网研究院 | Graph database-based authority management method and device and electronic equipment |
| CN113760971B (en) * | 2021-11-09 | 2022-02-22 | 通联数据股份公司 | Method, computing device and storage medium for retrieving data of a graph database |
| CN116684207B (en) * | 2023-08-03 | 2023-10-20 | 杭州字节方舟科技有限公司 | Method, device, equipment and medium for processing monitoring data based on blockchain |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105488431A (en) * | 2015-11-30 | 2016-04-13 | 布比（北京）网络技术有限公司 | Authority management method and device for block chain system |
| CN111427865A (en) * | 2020-03-18 | 2020-07-17 | 北京明略软件系统有限公司 | Method and device for managing objects of database |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105550590A (en) * | 2015-09-09 | 2016-05-04 | 上海赞越软件服务中心 | Role-based access control mechanism |
| CN106780033A (en) * | 2016-12-16 | 2017-05-31 | 杭州云象网络技术有限公司 | A kind of digital ticket transaction system construction method based on alliance's chain |
| CN109102849A (en) * | 2018-07-18 | 2018-12-28 | 郑州云海信息技术有限公司 | A kind of health account application method and device based on block chain |
| CN110532084B (en) * | 2019-09-04 | 2024-05-31 | 深圳前海微众银行股份有限公司 | Platform task scheduling method, device, equipment and storage medium |
| CN110580262B (en) * | 2019-11-08 | 2020-03-10 | 支付宝(杭州)信息技术有限公司 | Private data query method and device based on intelligent contract |
| CN111008228A (en) * | 2020-03-09 | 2020-04-14 | 支付宝(杭州)信息技术有限公司 | Method and device for inquiring account privacy information in block chain |
-
2020
- 2020-08-14 CN CN202010817846.XA patent/CN111737323B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105488431A (en) * | 2015-11-30 | 2016-04-13 | 布比（北京）网络技术有限公司 | Authority management method and device for block chain system |
| CN111427865A (en) * | 2020-03-18 | 2020-07-17 | 北京明略软件系统有限公司 | Method and device for managing objects of database |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111737323A (en) | 2020-10-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111737323B (en) | Information query method and device based on block chain and electronic equipment | |
| TWI762818B (en) | Blockchain-based invoice creation method and device, electronic device | |
| CN109067541B (en) | Data verification method and device based on block chain and electronic equipment | |
| CN110471986B (en) | Bill real name getting method and device based on block chain and electronic equipment | |
| WO2020215836A1 (en) | Blockchain-based housing information attest and application method and device | |
| CN110046998B (en) | Cross-chain right using system, method, device, electronic equipment and storage medium | |
| CN110598454B (en) | Data processing method and device in block chain, storage medium and computer equipment | |
| US10956903B2 (en) | Obtaining a blockchain-based, real-name, electronic bill | |
| CN109299336A (en) | Data back up method, device, storage medium and calculating equipment | |
| CN111898139B (en) | Data reading and writing method and device and electronic equipment | |
| CN113409045B (en) | Data processing method and device based on block chain and electronic equipment | |
| CN110148017A (en) | Equity distribution method and device, electronic equipment, storage medium based on block chain | |
| CN110046999A (en) | Block chain method of commerce and device | |
| CN110032598B (en) | Method and device for updating field and electronic equipment | |
| CN111476667A (en) | Block chain-based original work transaction method and device and electronic equipment | |
| CN110189122B (en) | Method and device for anchoring time for data on block chain and electronic equipment | |
| CN111488291B (en) | Pressure testing method, device and system for block chain network | |
| CN111177800A (en) | Data processing method and device based on block chain and electronic equipment | |
| TW202026926A (en) | Blockchain-based recordkeeping method and apparatus | |
| US20200175622A1 (en) | Processing ledger transactions in a blockchain | |
| CN110020945B (en) | Data reading method and system based on multiple block chain networks | |
| CN111737654A (en) | Infringement detection method and device based on block chain and electronic equipment | |
| CN115131034A (en) | Block chain-based rights and interests digital collection verification method and equipment | |
| US11907391B2 (en) | Method for performing segmenting locking and merging control of encrypted digital assets based on time dimension | |
| CN110060151B (en) | Service execution 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 |