Relationship network and method and apparatus for implementing the same
By storing link information and issuing certificates in blockchain nodes, the shortcomings of blockchain technology in relational networks are addressed, enabling reliable joining and business interaction of relational network members. This approach is suitable for scenarios such as the Internet of Things and enterprise organizations.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- BEIJING QIHOOD TECHNOLOGY CO LTD
- Filing Date
- 2020-01-08
- Publication Date
- 2026-04-14
AI Technical Summary
The application scenarios of existing blockchain technology have not been fully expanded, especially in the implementation of relationship networks, where there is a lack of effective association methods, which limits its application.
By storing the link information from the root node to the parent node of the relationship network in the blockchain nodes, receiving and verifying the target node's joining request, issuing relationship network certificates, controlling node joining according to access permissions, setting request level limits, and processing business requests to ensure the reliability and legitimacy of network members.
It enables reliable joining of network members and trusted business interactions, and is applicable to specific business scenarios such as the Internet of Things and enterprise organizations, ensuring data traceability and reliability.
Smart Images

Figure CN113094760B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of blockchain technology, specifically to relational networks and their implementation methods and apparatus. Background Technology
[0002] Currently, blockchain technology is mainly used for storing and trading data assets. However, the essence of blockchain is a decentralized, highly reliable database, and its application scenarios still need to be explored in depth. For example, the decentralization of blockchain is achieved through multiple nodes, and similar networks such as relationship networks are also achieved through multiple nodes. How to connect these nodes and broaden the application scenarios of blockchain technology is a problem that needs to be solved. Summary of the Invention
[0003] In view of the above problems, the present invention is proposed to provide a relational network and its implementation method and apparatus that overcome or at least partially solve the above problems.
[0004] According to one aspect of the present invention, a method for implementing a relational network is provided, comprising:
[0005] The block of this node stores the link information from the root node to the parent node of the relationship network;
[0006] Receive a request with a node signature to add the target node to the relationship network;
[0007] If this node has access permission to the relationship network, it issues a relationship network certificate for the target node; otherwise, it sends a request with this node's signature to the parent node to allow the target node to join the relationship network, based on the link information, until a node with access permission issues a relationship network certificate for the target node.
[0008] Optionally, issuing a relationship network certificate for the target node includes:
[0009] When issuing a relationship network certificate, set a limit on the number of request levels that the target node can transmit, and the limit on the number of request levels that the target node can transmit cannot exceed the limit on the number of request levels that this node can transmit.
[0010] Optionally, the method further includes:
[0011] Receive the service request sent by the target child node and process the service request.
[0012] Optionally, processing the service request includes:
[0013] Determine whether the business request is valid. If it is invalid, return a response message of refusal to execute to the target child node.
[0014] Optionally, the method further includes: storing the permissions of each child node in the block of this node;
[0015] The processing of the service request includes:
[0016] Determine whether the permissions corresponding to the business request match the permissions of the target child node; if they do not match, return a reply message of refusal to execute to the target child node.
[0017] Optionally, processing the service request includes:
[0018] If at least one recipient of the service request is an ancestor node included in the link information, then the service request is forwarded to the parent node.
[0019] Optionally, processing the service request includes:
[0020] The appropriate processing is performed based on the type of the business request, which includes transactions and / or messages.
[0021] Optionally, performing the corresponding processing based on the type of the service request includes:
[0022] If the service request is a message, and at least one recipient of the service request is another child node, then the message is forwarded to the corresponding child node, and a reply message with the signature of this node is sent to the corresponding child node and the target child node.
[0023] Optionally, performing the corresponding processing based on the type of the service request includes:
[0024] If the business request is a transaction, then the contract is deployed and / or executed on this node according to the content of the business request.
[0025] According to another aspect of the present invention, an apparatus for implementing a relationship network is provided, comprising:
[0026] Storage unit, suitable for storing link information from the root node to the parent node of the relational network in the block of this node;
[0027] The receiving unit is adapted to receive a request with a node signature to add the target node to the relationship network;
[0028] The processing unit is adapted to issue a relationship network certificate for the target node if the node has access permission to the relationship network; otherwise, it sends a request with the node's signature to the parent node to allow the target node to join the relationship network, based on the link information, until a node with access permission issues a relationship network certificate for the target node.
[0029] Optionally, the processing unit is adapted to set a limit on the number of request levels that a target node can transmit when issuing a relational network certificate, and the limit on the number of request levels that a target node can transmit does not exceed the limit on the number of request levels that this node can transmit.
[0030] Optionally, the processing unit is further adapted to receive service requests sent by the target child node and process the service requests.
[0031] Optionally, the processing unit is adapted to determine whether the service request is valid, and if it is invalid, to return a response message of refusal to execute to the target child node.
[0032] Optionally, the storage unit is also adapted to store the permissions of each child node in the block of this node;
[0033] The processing unit is adapted to determine whether the permissions corresponding to the service request match the permissions of the target child node; if they do not match, it returns a response message of refusal to execute to the target child node.
[0034] Optionally, the processing unit is adapted to forward the service request to the parent node if at least one recipient of the service request is an ancestor node included in the link information.
[0035] Optionally, the processing unit is adapted to perform corresponding processing according to the type of the business request, the type of the business request including transactions and / or messages.
[0036] Optionally, the processing unit is adapted to forward the message to the corresponding sub-node and send a reply message with its own signature to the corresponding sub-node and the target sub-node if the service request is a message and at least one recipient of the service request is another sub-node.
[0037] Optionally, the processing unit is adapted to deploy and / or execute a contract on this node according to the content of the business request if the business request is a transaction.
[0038] According to another aspect of the present invention, an electronic device is provided, comprising: a processor; and a memory arranged to store computer-executable instructions, which, when executed, cause the processor to perform any of the methods described above.
[0039] According to another aspect of the present invention, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores one or more programs that, when executed by a processor, implement the method described above.
[0040] As described above, the technical solution of this invention stores the link information from the root node to the parent node of the relationship network in the block of this node. It receives a request with a node signature to allow a target node to join the relationship network. If this node has the access permission for the relationship network, it issues a relationship network certificate for the target node; otherwise, it sends a request with its own signature to the parent node to allow the target node to join the relationship network, based on the link information, until a node with access permission issues a relationship network certificate for the target node. The beneficial effect of this technical solution is that it uses blockchain technology to establish a relationship network and ensures the reliability of joining the relationship network through access permission and certificate issuance, making it particularly suitable for specific business scenarios such as the Internet of Things and enterprise organizations.
[0041] The above description is merely an overview of the technical solution of the present invention. In order to better understand the technical means of the present invention and to implement it in accordance with the contents of the specification, and in order to make the above and other objects, features and advantages of the present invention more apparent and understandable, specific embodiments of the present invention are described below. Attached Figure Description
[0042] Various other advantages and benefits will become apparent to those skilled in the art upon reading the following detailed description of preferred embodiments. The accompanying drawings are for illustrative purposes only and are not intended to limit the invention. Furthermore, the same reference numerals denote the same parts throughout the drawings. In the drawings:
[0043] Figure 1 A flowchart illustrating a method for implementing a relational network according to an embodiment of the present invention is shown.
[0044] Figure 2 A schematic diagram of the structure of an apparatus for implementing a relational network according to an embodiment of the present invention is shown;
[0045] Figure 3 A schematic diagram of a relational network structure according to an embodiment of the present invention is shown;
[0046] Figure 4 A schematic diagram of the structure of an electronic device according to an embodiment of the present invention is shown;
[0047] Figure 5 A schematic diagram of the structure of a computer-readable storage medium according to an embodiment of the present invention is shown. Detailed Implementation
[0048] Exemplary embodiments of the invention will now be described in more detail with reference to the accompanying drawings. While exemplary embodiments of the invention are shown in the drawings, it should be understood that the invention may be implemented in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this invention will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.
[0049] Figure 1 A flowchart illustrating a method for implementing a relational network according to an embodiment of the present invention is shown. Figure 1 As shown, the method includes:
[0050] Step S110: Store the link information from the root node to the parent node of the relational network in the block of this node.
[0051] In this embodiment of the invention, the node has two meanings: in the first meaning, the node is a node in the blockchain; in the second meaning, the node is also a node in a relational network, and there can be multiple relational networks.
[0052] In a specific scenario, a company-specific app can be developed, and the accounts registered by employees using the app become accounts on the blockchain. Employees typically belong to only one department, but may participate in the development of multiple projects simultaneously. Therefore, each employee belongs to multiple different relationship networks.
[0053] Relationship networks are typically tree-like structures. Therefore, an employee's position within the relationship network can be determined, and correspondingly, the link information from the root node to the parent node of the relationship network can be stored in the locally stored block information.
[0054] Step S120: Receive a request with a node signature to add the target node to the relationship network.
[0055] Requests include node signatures, ensuring reliability and facilitating storage and traceability. For example, if employee A is a deputy manager of a project and wants employee B to join, they can invite B or have B proactively join the project's network.
[0056] Step S130: If this node has access permission to the relationship network, then issue a relationship network certificate for the target node; otherwise, send a request with this node's signature to the parent node to enable the target node to join the relationship network, based on the link information, until a node with access permission issues a relationship network certificate for the target node.
[0057] If employee A only has referral privileges but lacks access to the network of relationships (e.g., only supervisors have access), then a request with the target node's signature needs to be sent to the parent node based on the link information to add the target node to the network. This continues until a node with access privileges issues a network certificate for the target node. Conversely, if employee A has access privileges to the network of relationships, then a network certificate can be issued directly for the target node.
[0058] Each node's certificate issuance authority can only be granted by a node with the "authorize other nodes to issue certificates" permission to ensure reliability. The issued certificate serves as proof of identity.
[0059] It is easy to understand that although the above examples only illustrate enterprise organizations, they can be extended to other business scenarios and should not be construed as limiting the present invention. For example, in the Internet of Things (IoT) scenario, many smart terminals form a relationship network, such as the currently popular smart home, and this relationship network can also be implemented in the manner described above.
[0060] visible, Figure 1 The method shown has the advantage of establishing a relationship network using blockchain technology and ensuring the reliability of network members' joining through access permissions and certificate issuance, making it particularly suitable for specific business scenarios such as the Internet of Things and enterprise organizations.
[0061] In one embodiment of the present invention, the above method of issuing a relationship network certificate for the target node includes: when issuing the relationship network certificate, setting a limit on the number of levels of requests that the target node can transmit, and the limit on the number of levels of requests that the target node can transmit does not exceed the limit on the number of levels of requests that this node can transmit.
[0062] After joining a network of relationships, a node can interact with other nodes in the network to make business requests based on the blockchain, which can be understood as a "transaction" in the blockchain. Of course, the transactions here are not limited to the trading of financial assets, but also include the deployment of smart contracts.
[0063] To ensure the standardization of the relationship network, for example, since ordinary employees typically do not have direct business interactions with the CEO, it is required that ordinary employees cannot directly send business requests to the CEO. Therefore, a limit can be set on the number of levels at which target nodes can transmit requests.
[0064] It's easy to understand that when nodes are in the same network of relationships, the node with access permissions to the network is the ancestor node of the newly joined node. Taking a corporate organization as an example, this is usually at a relatively high leadership level. Therefore, the limit on the number of levels of requests that a newly joined node can transmit should not exceed the limit on the number of levels of requests that the node can transmit. Otherwise, it might lead to the strange situation where the team leader cannot communicate directly with the department head, but team members can.
[0065] In one embodiment of the present invention, the method further includes: receiving a service request sent by a target child node and processing the service request.
[0066] The business requests here are also implemented based on blockchain, which ensures the traceability and reliability of business requests. A detailed explanation follows.
[0067] In one embodiment of the present invention, the above method for processing a business request includes: determining whether the business request is valid; if it is invalid, returning a response message of refusal to execute to the target child node.
[0068] The term "legality" here can encompass multiple dimensions, such as whether the data format is a pre-agreed format, whether the data content is compliant, and so on.
[0069] In one embodiment of the present invention, the method further includes: storing the permissions of each child node in the block of the current node; processing the business request includes: determining whether the permissions corresponding to the business request match the permissions of the target child node; if they do not match, returning a reply message of refusal to execute to the target child node.
[0070] In a smart home scenario, a smart device can send detected information such as humidity and temperature to an app, which can then adjust accordingly. The smart device can be considered a child node of the app. Therefore, the smart device does not have the authority to terminate the app's operation. If a hacker infiltrates the smart device and attempts to cause further damage by terminating the app, the app can refuse to execute the termination request based on its permissions.
[0071] In one embodiment of the present invention, the above method of processing a service request includes: if at least one recipient of the service request is an ancestor node contained in the link information, then the service request is forwarded to the parent node.
[0072] For example, some approvals require more than one node to complete. In such cases, the business request may involve multiple recipients. If the recipient is an ancestor node contained in the link information, the business request is forwarded to the parent node. This process is repeated layer by layer to ensure the correct processing of the business request.
[0073] In one embodiment of the present invention, the above method for processing a business request includes: performing corresponding processing according to the type of the business request, wherein the type of the business request includes transactions and / or messages.
[0074] A business request can be formatted as follows: {signature (node signature), recipient address, message / transaction, certificate, other}
[0075] The receiver address format can be: parent + N-level address... parent + 1-level address, parent address, current node address. Furthermore, this address can follow the simplest principle, meaning it only needs to be written up to the lowest address of the same branch level.
[0076] For example, the root node ROOt has two sibling nodes A and B. A has two sibling nodes A1 and A2. A1 has two sibling nodes A11 and A12. A2 has two sibling nodes A21 and A22. B has three sibling nodes B1, B2 and B3. B1 has two sibling nodes B11 and B12.
[0077] Therefore, for a service request sent from A11 to A12, the recipient address only needs to be A12. For a service request sent from A21 to B11, the recipient address needs to be B, B1, or B11.
[0078] Specifically, in one embodiment of the present invention, the above method includes performing corresponding processing according to the type of business request: if the business request is a message and at least one recipient of the business request is another child node, then the message is forwarded to the corresponding child node, and a reply message with the signature of this node is sent to the corresponding child node and the target child node.
[0079] This enables the parent node to monitor messages from child nodes. It can also be combined with the aforementioned embodiments, for example, by first determining whether a business request is legitimate, and then forwarding it if it is legitimate.
[0080] For example, if a malicious employee wants to spread false information within the company, the parent node can quickly detect this and promptly cut off the propagation path, and take further action.
[0081] In one embodiment of the present invention, the above method, performing corresponding processing according to the type of business request, includes: if the business request is a transaction, then deploying and / or executing the contract on this node according to the content of the business request.
[0082] Specifically, smart contracts can be pre-deployed on the blockchain, such as awarding employees corresponding rewards based on their quarterly workload reaching a certain level. Business requests can then be considered workload, and rewards can be distributed according to the contract.
[0083] Figure 2 A schematic diagram of a device for implementing a relational network according to an embodiment of the present invention is shown. Figure 2 As shown, the apparatus 200 for implementing the relational network includes:
[0084] Storage unit 210 is adapted to store the link information from the root node to the parent node of the relational network in the block of this node.
[0085] In this embodiment of the invention, the node has two meanings: in the first meaning, the node is a node in the blockchain; in the second meaning, the node is also a node in a relational network, and there can be multiple relational networks.
[0086] In a specific scenario, a company-specific app can be developed, and the accounts registered by employees using the app become accounts on the blockchain. Employees typically belong to only one department, but may participate in the development of multiple projects simultaneously. Therefore, each employee belongs to multiple different relationship networks.
[0087] Relationship networks are typically tree-like structures. Therefore, an employee's position within the relationship network can be determined, and correspondingly, the link information from the root node to the parent node of the relationship network can be stored in the locally stored block information.
[0088] The receiving unit 220 is adapted to receive a request with a node signature to add the target node to the relational network.
[0089] Requests include node signatures, ensuring reliability and facilitating storage and traceability. For example, if employee A is a deputy manager of a project and wants employee B to join, they can invite B or have B proactively join the project's network.
[0090] The processing unit 230 is adapted to issue a relationship network certificate to the target node if the node has access permission to the relationship network; otherwise, it sends a request with the node's signature to the parent node to enable the target node to join the relationship network, based on the link information, until a node with access permission issues a relationship network certificate to the target node.
[0091] If employee A only has referral privileges but lacks access to the network of relationships (e.g., only supervisors have access), then a request with the target node's signature needs to be sent to the parent node based on the link information to add the target node to the network. This continues until a node with access privileges issues a network certificate for the target node. Conversely, if employee A has access privileges to the network of relationships, then a network certificate can be issued directly for the target node.
[0092] Each node's certificate issuance authority can only be granted by a node with the "authorize other nodes to issue certificates" permission to ensure reliability. The issued certificate serves as proof of identity.
[0093] It is easy to understand that although the above examples only illustrate enterprise organizations, they can be extended to other business scenarios and should not be construed as limiting the present invention. For example, in the Internet of Things (IoT) scenario, many smart terminals form a relationship network, such as the currently popular smart home, and this relationship network can also be implemented in the manner described above.
[0094] visible, Figure 2 The device shown has the advantage of establishing a relationship network using blockchain technology and ensuring the reliability of network members' joining through access permissions and certificate issuance, making it particularly suitable for specific business scenarios such as the Internet of Things and enterprise organizations.
[0095] In one embodiment of the present invention, in the above-described apparatus, the processing unit 230 is adapted to set a limit on the number of levels of requests that a target node can transmit when issuing a relational network certificate, and the limit on the number of levels of requests that a target node can transmit does not exceed the limit on the number of levels of requests that the node itself can transmit.
[0096] After joining a network of relationships, a node can interact with other nodes in the network to make business requests based on the blockchain, which can be understood as a "transaction" in the blockchain. Of course, the transactions here are not limited to the trading of financial assets, but also include the deployment of smart contracts.
[0097] To ensure the standardization of the relationship network, for example, since ordinary employees typically do not have direct business interactions with the CEO, it is required that ordinary employees cannot directly send business requests to the CEO. Therefore, a limit can be set on the number of levels at which target nodes can transmit requests.
[0098] It's easy to understand that when nodes are in the same network of relationships, the node with access permissions to the network is the ancestor node of the newly joined node. Taking a corporate organization as an example, this is usually at a relatively high leadership level. Therefore, the limit on the number of levels of requests that a newly joined node can transmit should not exceed the limit on the number of levels of requests that the node can transmit. Otherwise, it might lead to the strange situation where the team leader cannot communicate directly with the department head, but team members can.
[0099] In one embodiment of the present invention, the processing unit 230 in the above-described apparatus is further adapted to receive service requests sent by the target child node and process the service requests.
[0100] The business requests here are also implemented based on blockchain, which ensures the traceability and reliability of business requests. A detailed explanation follows.
[0101] In one embodiment of the present invention, in the above-described apparatus, the processing unit 230 is adapted to determine whether the service request is valid, and if it is invalid, to return a response message of refusal to execute to the target child node.
[0102] The term "legality" here can encompass multiple dimensions, such as whether the data format is a pre-agreed format, whether the data content is compliant, and so on.
[0103] In one embodiment of the present invention, in the above-described apparatus, the storage unit 210 is further adapted to store the permissions of each child node in the block of the local node; the processing unit 230 is adapted to determine whether the permissions corresponding to the service request match the permissions of the target child node; if they do not match, a reply message of refusal to execute is returned to the target child node.
[0104] In a smart home scenario, a smart device can send detected information such as humidity and temperature to an app, which can then adjust accordingly. The smart device can be considered a child node of the app. Therefore, the smart device does not have the authority to terminate the app's operation. If a hacker infiltrates the smart device and attempts to cause further damage by terminating the app, the app can refuse to execute the termination request based on its permissions.
[0105] In one embodiment of the present invention, in the above-described apparatus, the processing unit 210 is adapted to forward the service request to the parent node if at least one recipient of the service request is an ancestor node contained in the link information.
[0106] For example, some approvals require more than one node to complete. In such cases, the business request may involve multiple recipients. If the recipient is an ancestor node contained in the link information, the business request is forwarded to the parent node. This process is repeated layer by layer to ensure the correct processing of the business request.
[0107] In one embodiment of the present invention, the processing unit 230 in the above-described apparatus is adapted to perform corresponding processing according to the type of business request, the type of business request including transactions and / or messages.
[0108] A business request can be formatted as follows: {signature (node signature), recipient address, message / transaction, certificate, other}
[0109] The receiver address format can be: parent + N-level address... parent + 1-level address, parent address, current node address. Furthermore, this address can follow the simplest principle, meaning it only needs to be written up to the lowest address of the same branch level.
[0110] For example, the root node ROOt has two sibling nodes A and B. A has two sibling nodes A1 and A2. A1 has two sibling nodes A11 and A12. A2 has two sibling nodes A21 and A22. B has three sibling nodes B1, B2 and B3. B1 has two sibling nodes B11 and B12.
[0111] Therefore, for a service request sent from A11 to A12, the recipient address only needs to be A12. For a service request sent from A21 to B11, the recipient address needs to be B, B1, or B11.
[0112] Specifically, in one embodiment of the present invention, in the above-described apparatus, the processing unit 230 is adapted to forward the message to the corresponding sub-node and send a reply message with the signature of the current node to the corresponding sub-node and the target sub-node if the service request is a message and at least one recipient of the service request is another sub-node.
[0113] This enables the parent node to monitor messages from child nodes. It can also be combined with the aforementioned embodiments, for example, by first determining whether a business request is legitimate, and then forwarding it if it is legitimate.
[0114] For example, if a malicious employee wants to spread false information within the company, the parent node can quickly detect this and promptly cut off the propagation path, and take further action.
[0115] In one embodiment of the present invention, in the above-described apparatus, the processing unit 230 is adapted to deploy and / or execute a contract on this node according to the content of the business request if the business request is a transaction.
[0116] Specifically, smart contracts can be pre-deployed on the blockchain, such as awarding employees corresponding rewards based on their quarterly workload reaching a certain level. Business requests can then be considered workload, and rewards can be distributed according to the contract.
[0117] Figure 3 A schematic diagram of a relational network according to an embodiment of the present invention is shown. Figure 3 As shown, the relational network 300 includes several implementation devices 200 for relational networks as described in any of the above items.
[0118] In summary, the technical solution of this invention stores the link information from the root node to the parent node of the relationship network in the block of this node. It receives a request with a node signature to allow a target node to join the relationship network. If this node has the access permission for the relationship network, it issues a relationship network certificate for the target node; otherwise, it sends a request with its own signature to the parent node to allow the target node to join the relationship network, based on the link information, until a node with access permission issues a relationship network certificate for the target node. The beneficial effect of this technical solution is that it uses blockchain technology to establish a relationship network and ensures the reliability of joining the relationship network through access permission and certificate issuance, making it particularly suitable for specific business scenarios such as the Internet of Things and enterprise organizations.
[0119] It should be noted that:
[0120] The algorithms and displays provided herein are not inherently related to any particular computer, virtual device, or other equipment. Various general-purpose devices can also be used in conjunction with the teachings herein. The required structure for constructing such devices is apparent from the above description. Furthermore, this invention is not directed to any particular programming language. It should be understood that the contents of the invention described herein can be implemented using various programming languages, and the above description of specific languages is for the purpose of disclosing the best mode of implementation of the invention.
[0121] Numerous specific details are set forth in the specification provided herein. However, it will be understood that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures, and techniques have not been shown in detail so as not to obscure the understanding of this specification.
[0122] Similarly, it should be understood that, in order to simplify the invention and aid in understanding one or more of the various inventive aspects, in the above description of exemplary embodiments of the invention, various features of the invention are sometimes grouped together in a single embodiment, figure, or description thereof. However, this disclosure should not be construed as reflecting an intention that the claimed invention requires more features than are expressly recited in each claim. Rather, as reflected in the following claims, inventive aspects lie in fewer than all features of a single foregoing disclosed embodiment. Therefore, the claims following the detailed description are hereby expressly incorporated into this detailed description, wherein each claim itself is a separate embodiment of the invention.
[0123] Those skilled in the art will understand that modules in the device of the embodiments can be adaptively changed and placed in one or more devices different from that embodiment. Modules, units, or components in the embodiments can be combined into a single module, unit, or component, and further, they can be divided into multiple sub-modules, sub-units, or sub-components. Except where at least some of such features and / or processes or units are mutually exclusive, any combination can be used to combine all features disclosed in this specification (including the accompanying claims, abstract, and drawings) and all processes or units of any method or device so disclosed. Unless expressly stated otherwise, each feature disclosed in this specification (including the accompanying claims, abstract, and drawings) may be replaced by an alternative feature that serves the same, equivalent, or similar purpose.
[0124] Furthermore, those skilled in the art will understand that although some embodiments described herein include certain features but not others included in other embodiments, combinations of features from different embodiments are intended to be within the scope of the invention and form different embodiments. For example, in the following claims, any of the claimed embodiments can be used in any combination.
[0125] The various component embodiments of the present invention can be implemented in hardware, or as software modules running on one or more processors, or a combination thereof. Those skilled in the art will understand that microprocessors or digital signal processors (DSPs) can be used in practice to implement some or all of the functions of some or all of the components in the apparatus for implementing the relational network according to embodiments of the present invention. The present invention can also be implemented as a device or apparatus program (e.g., a computer program and computer program product) for performing part or all of the methods described herein. Such programs implementing the present invention can be stored on a computer-readable medium or can be in the form of one or more signals. Such signals can be downloaded from an Internet website, provided on a carrier signal, or provided in any other form.
[0126] For example, Figure 4 A schematic diagram of an electronic device according to an embodiment of the present invention is shown. The electronic device 400 includes a processor 410 and a memory 420 arranged to store computer-executable instructions (computer-readable program code). The memory 420 may be an electronic memory such as flash memory, EEPROM (Electrically Erasable Programmable Read-Only Memory), EPROM, hard disk, or ROM. The memory 420 has a storage space 430 for storing computer-readable program code 431 for performing any of the method steps described above. For example, the storage space 430 for storing computer-readable program code may include various computer-readable program codes 431 respectively for implementing the various steps in the methods described above. The computer-readable program code 431 can be read from or written to one or more computer program products. These computer program products include program code carriers such as hard disks, CDs, memory cards, or floppy disks. Such computer program products are typically, for example... Figure 5 The aforementioned computer-readable storage medium. Figure 5A schematic diagram of a computer-readable storage medium according to an embodiment of the present invention is shown. The computer-readable storage medium 500 stores computer-readable program code 431 for performing the method steps according to the present invention, which can be read by the processor 410 of an electronic device 400. When the computer-readable program code 431 is executed by the electronic device 400, it causes the electronic device 400 to perform the various steps of the method described above. Specifically, the computer-readable program code 431 stored in the computer-readable storage medium can perform the methods shown in any of the above embodiments. The computer-readable program code 431 can be compressed in a suitable form.
[0127] It should be noted that the above embodiments are illustrative of the invention and not restrictive, and that those skilled in the art can devise alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses should not be construed as limiting the claims. The word "comprising" does not exclude the presence of elements or steps not listed in the claims. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention can be implemented by means of hardware comprising several different elements and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by the same item of hardware. The use of the words first, second, and third, etc., does not indicate any order. These words can be interpreted as names.
[0128] Embodiments of the present invention disclose A1, a method for implementing a relational network, comprising:
[0129] The block of this node stores the link information from the root node to the parent node of the relationship network;
[0130] Receive a request with a node signature to add the target node to the relationship network;
[0131] If this node has access permission to the relationship network, it issues a relationship network certificate for the target node; otherwise, it sends a request with this node's signature to the parent node to allow the target node to join the relationship network, based on the link information, until a node with access permission issues a relationship network certificate for the target node.
[0132] A2. The method as described in A1, wherein issuing a relationship network certificate for the target node includes:
[0133] When issuing a relationship network certificate, set a limit on the number of request levels that the target node can transmit, and the limit on the number of request levels that the target node can transmit cannot exceed the limit on the number of request levels that this node can transmit.
[0134] A3. The method as described in A1, wherein the method further includes:
[0135] Receive the service request sent by the target child node and process the service request.
[0136] A4. The method as described in A3, wherein processing the service request includes:
[0137] Determine whether the business request is valid. If it is invalid, return a response message of refusal to execute to the target child node.
[0138] A5. The method described in A3, wherein the method further includes: storing the permissions of each child node in the block of this node;
[0139] The processing of the service request includes:
[0140] Determine whether the permissions corresponding to the business request match the permissions of the target child node; if they do not match, return a reply message of refusal to execute to the target child node.
[0141] A6. The method as described in A3, wherein processing the service request includes:
[0142] If at least one recipient of the service request is an ancestor node included in the link information, then the service request is forwarded to the parent node.
[0143] A7. The method as described in A3, wherein processing the service request includes:
[0144] The appropriate processing is performed based on the type of the business request, which includes transactions and / or messages.
[0145] A8. The method described in A7, wherein performing the corresponding processing according to the type of the business request includes:
[0146] If the service request is a message, and at least one recipient of the service request is another child node, then the message is forwarded to the corresponding child node, and a reply message with the signature of this node is sent to the corresponding child node and the target child node.
[0147] A9. The method described in A7, wherein performing the corresponding processing according to the type of the business request includes:
[0148] If the business request is a transaction, then the contract is deployed and / or executed on this node according to the content of the business request.
[0149] Embodiments of the present invention also disclose B10, an apparatus for implementing a relational network, comprising:
[0150] Storage unit, suitable for storing link information from the root node to the parent node of the relational network in the block of this node;
[0151] The receiving unit is adapted to receive a request with a node signature to add the target node to the relationship network;
[0152] The processing unit is adapted to issue a relationship network certificate for the target node if the node has access permission to the relationship network; otherwise, it sends a request with the node's signature to the parent node to allow the target node to join the relationship network, based on the link information, until a node with access permission issues a relationship network certificate for the target node.
[0153] B11. The apparatus as described in B10, wherein...
[0154] The processing unit is adapted to set a limit on the number of request levels that a target node can transmit when issuing a relational network certificate, and the limit on the number of request levels that a target node can transmit does not exceed the limit on the number of request levels that this node can transmit.
[0155] B12. The apparatus as described in B10, wherein...
[0156] The processing unit is also adapted to receive service requests sent by the target child node and process the service requests.
[0157] B13. The apparatus as described in B12, wherein...
[0158] The processing unit is adapted to determine whether the service request is valid. If it is invalid, it returns a response message of refusal to execute to the target child node.
[0159] B14. The apparatus as described in B12, wherein...
[0160] The storage unit is also adapted to store the permissions of each child node in the block of this node;
[0161] The processing unit is adapted to determine whether the permissions corresponding to the service request match the permissions of the target child node; if they do not match, it returns a response message of refusal to execute to the target child node.
[0162] B15. The apparatus as described in B12, wherein...
[0163] The processing unit is adapted to forward the service request to the parent node if at least one recipient of the service request is an ancestor node included in the link information.
[0164] B16. The apparatus as described in B12, wherein...
[0165] The processing unit is adapted to perform corresponding processing according to the type of the business request, the type of which includes transactions and / or messages.
[0166] B17. The apparatus as described in B16, wherein...
[0167] The processing unit is adapted to forward the message to the corresponding sub-node and send a reply message with its own signature to the corresponding sub-node and the target sub-node if the service request is a message and at least one recipient of the service request is another sub-node.
[0168] B18. The apparatus as described in B16, wherein...
[0169] The processing unit is adapted to deploy and / or execute a contract on this node according to the content of the business request if the business request is a transaction.
[0170] Embodiments of the present invention also disclose C19, a relational network, wherein the relational network includes a plurality of implementation devices for relational networks as described in any one of B10-B18.
[0171] Embodiments of the present invention also disclose D20, an electronic device comprising: a processor; and a memory arranged to store computer-executable instructions, which, when executed, cause the processor to perform a method as described in any one of A1-A9.
[0172] Embodiments of the present invention also disclose E21, a computer-readable storage medium, wherein the computer-readable storage medium stores one or more programs, which, when executed by a processor, implement the method as described in any one of A1-A9.
Claims
1. A method for implementing a relational network, comprising: The block of this node stores the link information from the root node to the parent node of the relationship network; And store the permissions of each child node in the block of this node; Receive a request with a node signature to add the target node to the relationship network; If this node has access permission to the relationship network, then issue a relationship network certificate for the target node; Otherwise, based on the link information, a request with the signature of this node to join the relationship network is sent to the parent node until a node with access permission issues a relationship network certificate for the target node; when issuing the relationship network certificate, a limit is set on the number of levels of requests that the target node can transmit, and the limit on the number of levels of requests that the target node can transmit does not exceed the limit on the number of levels of requests that this node can transmit. When a service request is received from a target sub-node, it is determined whether the permissions corresponding to the service request match the permissions of the target sub-node. If they do not match, a reply message of refusal to execute is returned to the target sub-node. The service request includes at least a receiver address format, and the receiver address format specifies the link information to the lowest branch level address where the receiver and sender of the service request are located, using the simplest principle.
2. The method as described in claim 1, wherein, After receiving the service request sent by the target child node, the method further includes: Determine whether the business request is valid. If it is invalid, return a response message of refusal to execute to the target child node.
3. The method as described in claim 1, wherein, After receiving the service request sent by the target child node, the method further includes: If at least one recipient of the service request is an ancestor node included in the link information, then the service request is forwarded to the parent node.
4. The method of claim 1, wherein, After receiving the service request sent by the target child node, the method further includes: The appropriate processing is performed based on the type of the business request, which includes transactions and / or messages.
5. The method of claim 4, wherein, The step of performing corresponding processing based on the type of the service request includes: If the service request is a message, and at least one recipient of the service request is another child node, then the message is forwarded to the corresponding child node, and a reply message with the signature of this node is sent to the corresponding child node and the target child node.
6. The method of claim 4, wherein, The step of performing corresponding processing based on the type of the service request includes: If the business request is a transaction, then the contract is deployed and / or executed on this node according to the content of the business request.
7. An apparatus for implementing a relational network, comprising: Storage unit, suitable for storing link information from the root node to the parent node of the relational network in the block of this node; And store the permissions of each child node in the block of this node; The receiving unit is adapted to receive a request with a node signature to add the target node to the relationship network; The processing unit is adapted to issue a relational network certificate to the target node if the node has access permission to the relational network. Otherwise, based on the link information, a request with the signature of this node to join the relationship network is sent to the parent node until a node with access permission issues a relationship network certificate for the target node; when issuing the relationship network certificate, a limit is set on the number of levels of requests that the target node can transmit, and the limit on the number of levels of requests that the target node can transmit does not exceed the limit on the number of levels of requests that this node can transmit. The request processing unit is adapted to determine whether the permissions corresponding to the service request match the permissions of the target child node when it receives a service request sent by the target child node; if they do not match, it returns a reply message of refusal to execute to the target child node; the service request includes at least a receiver address format, and the receiver address format specifies the link information to the lowest branch level address where the receiver and sender of the service request are located using the simplest principle.
8. The apparatus of claim 7, wherein, The processing unit is adapted to determine whether the service request is valid. If it is invalid, it returns a response message of refusal to execute to the target child node.
9. The apparatus of claim 7, wherein, The processing unit is adapted to forward the service request to the parent node if at least one recipient of the service request is an ancestor node included in the link information.
10. The apparatus of claim 7, wherein, The processing unit is adapted to perform corresponding processing according to the type of the business request, the type of which includes transactions and / or messages.
11. The apparatus of claim 7, wherein, The processing unit is adapted to forward the message to the corresponding sub-node and send a reply message with its own signature to the corresponding sub-node and the target sub-node if the service request is a message and at least one recipient of the service request is another sub-node.
12. The apparatus of claim 7, wherein, The processing unit is adapted to deploy and / or execute a contract on this node according to the content of the business request if the business request is a transaction.
13. A relational network, wherein, The relationship network includes multiple means for implementing a relationship network as described in any one of claims 7-12.
14. An electronic device, wherein, The electronic device includes: a processor; and a memory arranged to store computer-executable instructions, which, when executed, cause the processor to perform the method as described in any one of claims 1-6.
15. A computer-readable storage medium, wherein, The computer-readable storage medium stores one or more programs that, when executed by a processor, implement the method as described in any one of claims 1-6.
Citation Information
Patent Citations
Medical record permission management method and device, readable storage medium and server
CN109871712A
Block chain alliance chain construction method, device and system
CN110572262A