Resource transfer control method and device, computer equipment, medium and program product

Abstract

The invention relates to the technical field of computers, and discloses a resource transfer control method and device, computer equipment, a medium and a program product. The method comprises the steps of determining a resource node tree corresponding to a first object in response to a resource adjustment permission confirmation operation for the first object; the root node is set to be in a target state, a child node is newly added to the root node to serve as a first object node, in the target state, the root node forwards a first resource transfer request sent by any external object to the first object node, and the first object node responds to the first resource transfer request; at least one tree node is newly added for the resource node tree, the newly added tree node comprises a second object node, and the second object node responds to a second resource transfer request sent by a second object; and according to the resource node tree, adjusting the resource quantity of the first object when resource transfer is carried out between the first object and different objects. By adopting the method, the resource adjustment of the first object can be accurately performed.

Description

Technical Field

[0001] This application relates to the field of computer technology, and in particular to a resource transfer control method, apparatus, computer equipment, medium, and program product. Background Technology

[0002] Resource transfer regulation technology refers to the process by which a resource transfer initiator transfers resources to a resource transfer recipient. By performing resource transfer operations between two objects, the allocation of resources among different objects can be regulated, thereby promoting economic development.

[0003] In traditional technology, taking the process of transferring resources through a single account opened by a distributor as an example, the resource transfer adjustment here refers to the adjustment of the flow of funds between accounts or between an account and an external entity. Specifically, a certain number of settlement cards for corporate clients are opened through the distributor's settlement account. The settlement cards and settlement accounts have a many-to-one relationship. Each settlement card can directly receive and make payments externally. The distributor's external transactions are realized through multiple settlement cards. After the distributor's external transactions are realized through multiple settlement cards, the balance of the multiple settlement cards is adjusted.

[0004] However, current resource transfer control methods are unable to accurately regulate resources. Summary of the Invention

[0005] Therefore, it is necessary to provide an accurate resource transfer control method, apparatus, computer equipment, computer-readable storage medium, and computer program product to address the aforementioned technical problems.

[0006] Firstly, this application provides a resource transfer control method, including:

[0007] In response to the resource adjustment permission confirmation operation for the first object, determine the resource node tree corresponding to the first object, wherein the resource node tree includes at least the root node corresponding to the first object;

[0008] Set the root node to the target state and add a child node to the root node as the first object node. In the target state, the root node is used to forward the first resource transfer request sent by any external object to the first object node, and the first object node is used to respond to the first resource transfer request.

[0009] Add at least one tree node to the resource node tree, wherein the added at least one tree node includes a second object node, and the second object node is used to respond to a second resource transfer request sent by the second object;

[0010] Based on the resource node tree, the amount of resources of the first object is adjusted when transferring resources between the first object and different objects.

[0011] In one embodiment, adjusting the amount of resources of the first object during resource transfer between the first object and different objects, based on the resource node tree, includes:

[0012] When the root node or the first object node receives the first resource transfer request, it adjusts the resource amount corresponding to the root node and the resource amount corresponding to the first object node according to the resource transfer amount carried in the first resource transfer request.

[0013] When the second object node receives the second resource transfer request, it adjusts the resource quantity corresponding to the second object node and the resource quantity corresponding to at least one of the upper-level nodes of the second object node according to the resource transfer quantity carried in the second resource transfer request.

[0014] In one embodiment, adjusting the amount of resources of the first object during resource transfer between the first object and different objects, based on the resource node tree, includes:

[0015] When the root node receives the first resource transfer request, the maximum resource transfer amount corresponding to the root node is determined to be the resource amount corresponding to the first object node.

[0016] When the first object node receives the first resource transfer request, the maximum resource transfer amount corresponding to the first object node is the smaller of the resource amount corresponding to the root node and the resource amount corresponding to the first object node.

[0017] When the second object node receives the second resource transfer request sent by the second object, the maximum resource transfer amount corresponding to the second object node is the smaller of the resource amount corresponding to the parent node of the second object node and the resource amount corresponding to the second object node.

[0018] In one embodiment, in the resource node tree, the resource quantity of the root node, the resource quantity of the first object node, and the resource quantity of all second object nodes are all greater than 0.

[0019] The root node's resource quantity is equal to the sum of the first object node's resource quantity and the resource quantities of all second object nodes.

[0020] The root node's child nodes include at least one intermediate layer node and / or at least one second object node. Each intermediate layer node's child nodes include at least one next-level intermediate layer node and / or at least one second object node. The second object node is the bottom layer node. The resource quantity of each intermediate layer node is equal to the sum of the resource quantities of all the second object nodes corresponding to the intermediate layer node.

[0021] In one embodiment, the second object node is further configured to respond to a third resource transfer request sent by another second object node or a fourth resource transfer request sent by the first object node; the resource transfer control method further includes:

[0022] When a second object node receives a third resource transfer request from another second object node, the amount of resources corresponding to the common parent node between the two second object nodes does not change.

[0023] When the second object node receives the fourth resource transfer request, the resource amount of the common parent node between the second object node and the first object node does not change.

[0024] When the second object node migrates from a child node of the first intermediate layer node to a child node of the second intermediate layer node, the resource quantities corresponding to the first intermediate layer node, the second intermediate layer node, and the non-public first parent node all change. The first intermediate layer node and the second intermediate layer node are not duplicated. The first parent node refers to a node that is not duplicated between the second parent node of the first intermediate layer node and the third parent node of the second intermediate layer node.

[0025] In one embodiment, the resource transfer control method further includes:

[0026] In response to the operation that removes the resource adjustment permission for the first object, first set the status of the second object node and the status of the intermediate layer node to the invalid state.

[0027] Use the node information of the first object node as the node information of the root node, and set the state of the first object node to the invalid state.

[0028] Specifically, when the state of the second object node is set to the invalid state, the unfinished resource transfer operation of the second object node is executed first, and then the state of the second object node is set to the invalid state when there is no unfinished resource transfer operation of the second object node.

[0029] When setting the state of an intermediate layer node to an invalid state, first set the state of all child nodes corresponding to the intermediate layer node to an invalid state, and then set the state of the intermediate layer node to an invalid state.

[0030] In one embodiment, the resource transfer control method further includes:

[0031] Respond to the identification operation for the node identifier and obtain the identifier of the node to be identified;

[0032] Based on the preset node identifier mapping information, query the node identifier that matches the node identifier to be identified, and query the node information that matches the node identifier in the resource node tree.

[0033] Secondly, this application also provides a resource transfer control device, the device comprising:

[0034] The resource node tree acquisition module is used to respond to the resource adjustment permission confirmation operation for the first object and determine the resource node tree corresponding to the first object, wherein the resource node tree includes at least the root node corresponding to the first object.

[0035] The first object node addition module is used to set the root node to the target state and add a child node to the root node as the first object node. In the target state, the root node is used to forward the first resource transfer request sent by any external object to the first object node, and the first object node is used to respond to the first resource transfer request.

[0036] The second object node addition module is used to add at least one tree node to the resource node tree, wherein the added at least one tree node includes a second object node, and the second object node is used to respond to the second resource transfer request sent by the second object.

[0037] The resource transfer adjustment module is used to adjust the amount of resources of the first object when transferring resources between the first object and different objects, based on the resource node tree.

[0038] In one embodiment, the resource transfer adjustment module is further configured to, when the root node or the first object node receives the first resource transfer request, adjust the resource quantity corresponding to the root node and the resource quantity corresponding to the first object node according to the resource transfer quantity carried in the first resource transfer request; and when the second object node receives the second resource transfer request, adjust the resource quantity corresponding to the second object node and the resource quantity corresponding to at least one of the parent nodes of the second object node according to the resource transfer quantity carried in the second resource transfer request.

[0039] In one embodiment, the resource transfer adjustment module is further configured to: when the root node receives the first resource transfer request, determine the maximum resource transfer amount corresponding to the root node as the resource amount corresponding to the first object node; when the first object node receives the first resource transfer request, determine the maximum resource transfer amount corresponding to the first object node as the smaller of the resource amount corresponding to the root node and the resource amount corresponding to the first object node; when the second object node receives the second resource transfer request sent by the second object, determine the maximum resource transfer amount corresponding to the second object node as the smaller of the resource amount corresponding to the parent node of the second object node and the resource amount corresponding to the second object node.

[0040] In one embodiment, in the resource node tree, the resource quantity of the root node, the resource quantity of the first object node, and the resource quantity of all second object nodes are all greater than 0; the resource quantity of the root node is equal to the sum of the resource quantity of the first object node and the resource quantity of all second object nodes; the child nodes of the root node include at least one intermediate layer node and / or at least one second object node, and the child nodes of each intermediate layer node include at least one next-level intermediate layer node and / or at least one second object node, the second object node is the bottom layer node, and the resource quantity of each intermediate layer node is equal to the sum of the resource quantities of all second object nodes corresponding to the intermediate layer node.

[0041] In one embodiment, the second object node is further configured to respond to a third resource transfer request sent by another second object node or a fourth resource transfer request sent by the first object node; the resource transfer control device further includes an internal adjustment module, which is configured to ensure that when the second object node receives a third resource transfer request from another second object node, the resource quantity corresponding to the common superior node between the two second object nodes remains unchanged; when the first object node receives a fourth resource transfer request, the resource quantity of the common superior node between the second object node and the first object node remains unchanged; when the second object node migrates from a child node of the first intermediate layer node to a child node of the second intermediate layer node, the resource quantities corresponding to the first intermediate layer node, the second intermediate layer node, and the non-common first superior node all change, wherein the first intermediate layer node and the second intermediate layer node are not duplicated, and the first superior node refers to a node that is not duplicated between the second superior node of the first intermediate layer node and the third superior node of the second intermediate layer node.

[0042] In one embodiment, the resource transfer control device further includes a permission release module. This module responds to a resource adjustment permission release operation for the first object by first setting the state of the second object node and the intermediate layer node to an invalid state; then, using the node information of the first object node as the node information of the root node, and setting the state of the first object node to an invalid state. Specifically, when the state of the second object node is set to an invalid state, any incomplete resource transfer operations on the second object node are first executed; if no incomplete resource transfer operations exist on the second object node, the state of the second object node is set to an invalid state. When the state of the intermediate layer node is set to an invalid state, the state of all child nodes corresponding to the intermediate layer node is first set to an invalid state, and then the state of the intermediate layer node is set to an invalid state.

[0043] In one embodiment, the resource transfer control device further includes a node identifier identification module, which is used to respond to an identification operation for a node identifier, obtain the node identifier to be identified, query the node identifier that matches the node identifier to be identified according to the preset node identifier mapping information, and query the node information that matches the node identifier in the resource node tree.

[0044] Thirdly, this application also provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to perform the following steps:

[0045] In response to the resource adjustment permission confirmation operation for the first object, determine the resource node tree corresponding to the first object, wherein the resource node tree includes at least the root node corresponding to the first object;

[0046] Set the root node to the target state and add a child node to the root node as the first object node. In the target state, the root node is used to forward the first resource transfer request sent by any external object to the first object node, and the first object node is used to respond to the first resource transfer request.

[0047] Add at least one tree node to the resource node tree, wherein the added at least one tree node includes a second object node, and the second object node is used to respond to a second resource transfer request sent by the second object;

[0048] Based on the resource node tree, the amount of resources of the first object is adjusted when transferring resources between the first object and different objects.

[0049] Fourthly, this application also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, performs the following steps:

[0050] In response to the resource adjustment permission confirmation operation for the first object, determine the resource node tree corresponding to the first object, wherein the resource node tree includes at least the root node corresponding to the first object;

[0051] Set the root node to the target state and add a child node to the root node as the first object node. In the target state, the root node is used to forward the first resource transfer request sent by any external object to the first object node, and the first object node is used to respond to the first resource transfer request.

[0052] Add at least one tree node to the resource node tree, wherein the added at least one tree node includes a second object node, and the second object node is used to respond to a second resource transfer request sent by the second object;

[0053] Based on the resource node tree, the amount of resources of the first object is adjusted when transferring resources between the first object and different objects.

[0054] Fifthly, this application also provides a computer program product, including a computer program that, when executed by a processor, performs the following steps:

[0055] In response to the resource adjustment permission confirmation operation for the first object, determine the resource node tree corresponding to the first object, wherein the resource node tree includes at least the root node corresponding to the first object;

[0056] Set the root node to the target state and add a child node to the root node as the first object node. In the target state, the root node is used to forward the first resource transfer request sent by any external object to the first object node, and the first object node is used to respond to the first resource transfer request.

[0057] Add at least one tree node to the resource node tree, wherein the added at least one tree node includes a second object node, and the second object node is used to respond to a second resource transfer request sent by the second object;

[0058] Based on the resource node tree, the amount of resources of the first object is adjusted when transferring resources between the first object and different objects.

[0059] The aforementioned resource transfer control method, apparatus, computer equipment, computer-readable storage medium, and computer program product, after performing a resource adjustment permission confirmation operation on the first object, set the root node to the target state and add a child node as the first object node to the root node. At this time, when the root node receives a first resource transfer request sent by any external object, it can forward the first resource transfer request to the first object node, so as to use the first object node to execute the resource transfer operation corresponding to the root node. This avoids the need for the resource quantity of the root node's subordinate nodes, such as the second object node, to change with the resource quantity of the root node when directly transferring resources to the root node, thereby accurately adjusting the resource quantity of the first object. At the same time, at least one tree node is added to the resource node tree, including the second object node, so that the second object node can respond to the second resource transfer request sent by the second object. Therefore, a multi-level node system is set up in the resource node tree based on the root node, the first object node, and the second object node, which can more accurately adjust the resource quantity of the first object when transferring resources between the first object and different objects. Attached Figure Description

[0060] To more clearly illustrate the technical solutions in the embodiments of this application or related technologies, the drawings used in the description of the embodiments of this application or related technologies will be briefly introduced below. Obviously, the drawings described below are some embodiments of this application. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0061] Figure 1 This is a diagram illustrating the application environment of the resource transfer control method in one embodiment;

[0062] Figure 2 This is a flowchart illustrating a resource transfer control method in one embodiment;

[0063] Figure 3 This is a schematic diagram of the multi-level account structure system of the One-Account-Pass product in a specific application example;

[0064] Figure 4 This is a flowchart illustrating the resource transfer control method in another embodiment;

[0065] Figure 5 This is a flowchart illustrating the resource transfer control method in yet another embodiment;

[0066] Figure 6 This is a structural block diagram of a resource transfer control device in one embodiment;

[0067] Figure 7 This is an internal structural diagram of a computer device in one embodiment. Detailed Implementation

[0068] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are for illustrative purposes only and are not intended to limit the scope of this application. It should be noted that certain existing industry solutions, such as software, components, and models, may be mentioned in the embodiments of this application. These should be considered exemplary and intended to illustrate the feasibility of implementing the technical solutions of this application, but do not imply that the applicant has already used or necessarily used such solutions.

[0069] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, data stored, data displayed, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of related data must comply with relevant regulations. The acquisition, storage, use and processing of data in the technical solution of this application all comply with the relevant provisions of national laws and regulations.

[0070] The terms "first," "second," etc., used in this application may be used to describe various elements, but these elements are not limited by these terms. These terms are used only to distinguish the first element from the second element. The terms "comprising" and "having," and any variations thereof, used in this application, are intended to cover non-exclusive inclusion. The term "multiple" used in this application refers to two or more. The term "and / or" used in this application refers to one of the embodiments, or any combination of multiple embodiments.

[0071] The resource transfer control method provided in this application embodiment can be applied to, for example, Figure 1 In the application environment shown, terminal 102 communicates with the user via a network.

[0072] The user triggers a resource adjustment permission confirmation control for the first object on terminal 102. Terminal 102 responds to the resource adjustment permission confirmation operation for the first object, determines the resource node tree corresponding to the first object, wherein the resource node tree includes at least the root node corresponding to the first object; sets the root node to the target state, and adds a child node to the root node as the first object node, wherein, in the target state, the root node is used to forward the first resource transfer request sent by any external object to the first object node, and the first object node is used to respond to the first resource transfer request; adds at least one tree node to the resource node tree, wherein the added at least one tree node includes a second object node, and the second object node is used to respond to the second resource transfer request sent by the second object; according to the resource node tree, terminal 102 adjusts the resource amount of the first object when transferring resources between the first object and different objects.

[0073] The terminal 102 can be, but is not limited to, various personal computers, laptops, smartphones, tablets, drones, low-altitude aircraft, IoT devices, and portable wearable devices. IoT devices can include smart speakers, smart TVs, smart air conditioners, smart in-vehicle devices, and projection equipment. Portable wearable devices can include smartwatches, smart bracelets, and head-mounted displays. Head-mounted displays can be virtual reality (VR) devices, augmented reality (AR) devices, and smart glasses.

[0074] In one exemplary embodiment, such as Figure 2 As shown, a resource transfer control method is provided, which can be applied to... Figure 1 Taking terminal 102 as an example, the explanation includes S200~S800. Among them:

[0075] S200, respond to the resource adjustment permission confirmation operation for the first object, and obtain the resource node tree corresponding to the first object.

[0076] The resource node tree must include at least the root node corresponding to the first object. The first object can be an object that allows resource transfer, such as a company or a user. In practical applications, resources can be items, account balances, or other similar resources.

[0077] The resource adjustment permission confirmation operation for the first object refers to the operation of confirming that the resource quantity of the first object can be adjusted. When the resource adjustment permission confirmation operation for the first object is triggered, the terminal will allow the adjustment of the resource quantity of the first object. In practical applications, when the resource is the account balance and the first object is a certain distributor, the resource adjustment permission confirmation operation for the first object can be to sign up the distributor for "One Account Pass". "One Account Pass" is used to adjust the resource quantity of multiple accounts under the distributor's name after resource transfer.

[0078] The resource node tree is a tree structure that includes at least the root node corresponding to the first object. The initial resource node tree has not yet spawned multiple levels of tree nodes. The root node is the most important and highest-level node in the resource node tree corresponding to the first object. For example, when the first object is a company, the root node could be the company's main account, and the subsequent tree nodes would include at least the company's sub-accounts corresponding to the main account. Similarly, when the first object is a company, the root node could also be the company's main warehouse, and the subsequent tree nodes would include at least the company's sub-warehouses corresponding to the main warehouse.

[0079] Specifically, the user triggers a resource adjustment permission confirmation control for the first object on the terminal. The terminal responds with a resource adjustment permission confirmation operation for the first object, confirming that the resources of the first object can be adjusted. At this time, the resource node tree corresponding to the first object is retrieved from the database in advance, or the resource node tree corresponding to the first object is generated directly. The resource node tree corresponding to the first object is used to adjust the resource amount of the first object. The resource node tree includes at least the root node corresponding to the first object.

[0080] S400 sets the root node to the target state and adds a child node to the root node as the first object node.

[0081] In the target state, the root node is used to forward the first resource transfer request sent by any external object to the first object node, and the first object node is used to respond to the first resource transfer request.

[0082] Specifically, in order to achieve reliable overall planning of all tree nodes in the resource node tree, the root node can be set as the target state, and a child node can be added to the root node in the resource node tree as the first object node. The first object node is used as the execution carrier for resource transfer operations of the root node. At this time, the resource quantity of the root node is registered in the first object node. When no other tree nodes corresponding to the root node are generated, the initial resource quantity of the first object node is equal to the resource quantity of the root node.

[0083] It's important to note that setting the root node to the target state, or virtual state, makes it a virtual node. Virtual nodes are distinct from real nodes. A virtual node is a management node that doesn't have independent resource storage, doesn't directly perform resource transfer operations, and only aggregates the resource quantities of lower-level nodes to form its own resource quantity. It also manages and monitors resource changes in lower-level nodes, imposing overall constraints. A real node, on the other hand, carries real, disposable resources, can directly perform resource transfer operations, and its resources are independently recorded, with changes requiring a hierarchical upward linkage to upper-level virtual nodes.

[0084] S600, add at least one tree node to the resource node tree, wherein the added at least one tree node includes a second object node, and the second object node is used to respond to the second resource transfer request sent by the second object.

[0085] Specifically, the resource transfer relationship between the first object and the second object is obtained, wherein the second object is an object that can transfer resources with the first object, and based on the resource transfer relationship between the first object and the second object, the tree node is extended downward from the root node to add at least one level of tree node to the resource node tree.

[0086] In this tree structure, at least one level of tree nodes includes a second object node. Additionally, it may include intermediate-level nodes. That is, the root node's children include at least one of intermediate-level nodes and second object nodes. Each intermediate-level node's children include at least one of the intermediate-level nodes below it and a second object node. A second object node can be directly assigned to the root node or to a specific intermediate-level node. However, neither the second object node nor the first object node has corresponding children; in other words, the second object node and the first object node are the bottom-level nodes of the resource node tree. At this point, the root node, first object node, intermediate-level nodes, and second object node in the resource node tree form a tree-like topology through a parent-child relationship.

[0087] It should be noted that the second object node is a low-level operation node specifically allocated by the first object for the resource transfer process between the second object and the first object. It is used to respond to the second resource transfer request sent by the second object. This node belongs to the resource node tree corresponding to the first object and is used to perform resource transfer within a specific range, and to update the resource quantity of the parent node and even the root node in a coordinated manner.

[0088] It's also important to note that the state of intermediate-layer nodes is virtual. The difference between intermediate-layer nodes and root nodes is that the root node, as the highest-level virtual node, doesn't need to coordinate resource allocation with higher-level nodes; instead, it's responsible for the final aggregation of all lower-level nodes. Intermediate-layer nodes, however, need to coordinate resource allocation with higher-level nodes, such as the root node, and are responsible for management within a specific region / business scope. Intermediate-layer accounts do not participate in direct external resource transfer processes. Considering practical use cases and non-functional system implementation, all intermediate-layer nodes should not exceed eight layers.

[0089] In one embodiment, different identifiers can be assigned to the root node, the first object node, the intermediate layer node, and the second object node. The identifier assignment rules can also be preset, and the identifier assignment rules for each type of node are different. For example, different number of bits can be assigned to different types of nodes, or a specific prefix matching the type can be assigned to different types of nodes.

[0090] In an exemplary embodiment, taking a multi-level account structure system for a distributor's "One Account for All" product as an example, the root node can be the distributor's main account, the second object node is the sub-account corresponding to the main account, and the first object node is the settlement sub-account corresponding to the main account. In this case, the identification allocation rules for different account nodes can be:

[0091] (1) The identifier allocation rule can be: the identifier of the dealer's settlement account when the dealer has not signed the "One Account" agreement can be used as the identifier of the main account. For example, the identifier of the main account can be named A.

[0092] (2) Settlement sub-accounts. The identifier allocation rule can be: the identifier of the main account + 4 digits, for example, named A-0001, where 0001 is the default number of the settlement sub-account (which can be configured through parameters, such as changing it to 9999).

[0093] (3) Intermediate accounts, the identifier allocation rule is: the identifier of the main account + a 4-digit number starting with 9, such as A-9001.

[0094] (4) Sub-accounts: The identifier allocation rule is: the identifier of the main account + 4, 5, or 6 digits, such as A-0002. The identifier of the sub-account cannot be the same as the identifier of the settlement sub-account or the identifier of the intermediate account. For example, it cannot be a 4-digit number starting with 0001 or 9 to prevent duplication with the settlement sub-account or the intermediate account. Furthermore, sub-accounts can support current accounts or time accounts, providing differentiated pricing and sub-account accounting capabilities. The functions of current accounts and time accounts are different. The former tends to be flexible in terms of income and expenditure, while the latter tends to provide higher interest income. Therefore, different types of sub-accounts can be assigned identifiers with different numbers of digits or different prefixes.

[0095] In one embodiment, the aforementioned resource node tree forms a top-virtual, bottom-real structure. This allows the external display to show the resource quantities of each second object node and the first object node, rather than the root node's resource quantity. Furthermore, by separating multiple second object nodes, it enables individual processing of a single second object node, independent of the others. This structure can be applied to unified account management, where the core is a "virtual master account" at the upper level and multiple "physical sub-accounts" at the lower level. "Virtual" does not mean the accounts do not exist; rather, the master account primarily handles "overall management and fund collection / scheduling" functions and is not directly used for daily payments and receipts. "Physical" refers to the lower-level sub-accounts having complete settlement functions and being able to independently handle specific business transactions such as payments and receipts and reconciliation.

[0096] Taking the resource node tree as an example, the account structure of a corporate current account A that has signed a contract with Yihutong is as follows: Figure 3 The diagram shows a multi-tiered account structure for a single-account product. The first tier includes a main account A; the second tier includes two intermediate accounts A-9001 and A-9002; the third tier includes one intermediate account A-9003; and the fourth tier includes one settlement sub-account A-0001 and five sub-accounts A-0002, A-0003, A-0004, A-0005, and A-0006. Sub-accounts A-0002, A-0003, A-0004, and A-0005 are current accounts, sub-account A-0006 is a time deposit account, and the settlement sub-account is a current account. The main account and intermediate accounts are virtual accounts, meaning they have no independent resource storage and do not directly perform resource transfer operations; they only form their own resource volume by aggregating the resource volume of lower-level nodes.

[0097] S800, based on the resource node tree, adjusts the resource quantity of the first object when transferring resources between the first object and different objects.

[0098] Specifically, the resource node tree is structured with a multi-level node system based on the root node, the first object node, and the second object node. Therefore, the resource quantity of the first object can be adjusted when transferring resources between the first object and different objects, according to the resource node tree.

[0099] It should be noted that the resource transfer operation between the first object and different objects can be between the first object and the second object, or between the first object and other external objects. For example, when the first object is a distributor, the second object can be the first object's downstream buyer. The first object can transfer resources not only with downstream sellers, but also with upstream factories.

[0100] In the aforementioned resource transfer control method, after performing a resource adjustment permission confirmation operation on the first object, the root node is set to the target state, and a child node is added to the root node as the first object node. At this time, when the root node receives a first resource transfer request sent by any external object, it can forward the first resource transfer request to the first object node, so as to use the first object node to execute the resource transfer operation corresponding to the root node. This avoids the need for the resource quantity of the root node's subordinate nodes, such as the second object node, to change with the resource quantity of the root node when directly transferring resources to the root node, thus accurately adjusting the resource quantity of the first object. At the same time, at least one tree node is added to the resource node tree, including the second object node, so that the second object node can respond to the second resource transfer request sent by the second object. Therefore, a multi-level node system is set up in the resource node tree based on the root node, the first object node, and the second object node, which can more accurately adjust the resource quantity of the first object when transferring resources between the first object and different objects.

[0101] In one exemplary embodiment, such as Figure 4 As shown, S500 includes:

[0102] S810, when the root node or the first object node receives the first resource transfer request, the resource amount corresponding to the root node and the resource amount corresponding to the first object node are adjusted according to the resource transfer amount carried in the first resource transfer request.

[0103] S820, when the second object node receives the second resource transfer request, it adjusts the resource quantity corresponding to the second object node and the resource quantity corresponding to at least one superior node of the second object node according to the resource transfer quantity carried in the second resource transfer request.

[0104] Among them, the resource transfer volume refers to the specific resource scale that is changed through resource transfer between the second object node and the second object or between the root node and the external object.

[0105] Specifically, the first object can use the root node or the first object node to perform resource transfer operations with other external objects. At this time, the root node or the first object node receives the first resource transfer request sent by any external object.

[0106] When the root node receives the first resource transfer request, regardless of whether the request represents transferring in or out resources, the root node will synchronize the resource amount of the first object node downwards. In other words, the resource amount corresponding to the first object node can be adjusted based on the resource transfer amount carried in the first resource transfer request. Since the resource amount corresponding to the first object node changes, the resource amount corresponding to the root node will also change. In other words, the purpose of setting a corresponding first object node for the root node is to provide a buffer for resource transfers. When the first object node initiates a resource transfer with an external object using the root node, since the root node has no actual resource amount, all resource inflow / outflow actions must be completed through the first object node. Furthermore, resource transfers initiated by the first object node using the root node will not affect the resource amount of the second object node.

[0107] Similarly, when the first object node receives the first resource transfer request, regardless of whether the first resource transfer request represents a resource transfer in or a resource transfer out, it can coordinate with the root node to synchronously increase or decrease the resource amount. That is, based on the resource transfer amount carried in the first resource transfer request, the resource amount corresponding to the first object node is adjusted, and then based on the resource transfer amount of the first object node during the adjustment process, the resource amount corresponding to the root node is adjusted.

[0108] Furthermore, the first object can also utilize resource transfers between itself and the second object node. In this case, the second object sends a second resource transfer request to the second object node. When the second object node receives the second resource transfer request, the resource quantity corresponding to the second object node will be transferred. At this time, the resource transfer quantity carried in the second resource transfer request is obtained, and the resource quantity corresponding to the second object node is transferred according to the resource transfer quantity carried in the second resource transfer request. Then, the resource quantity of at least one parent node of the second object node is synchronously increased or decreased layer by layer upwards to adjust the resource quantity corresponding to at least one parent node of the second object node. Here, at least one parent node of the second object node includes the first parent node of the second object node, the second parent node of the first parent node, ..., layer by layer upwards, until the root node. That is to say, the resource quantity corresponding to the first parent node, the second parent node of the first parent node, ..., up to the root node of the second object node needs to be adjusted according to the resource transfer quantity corresponding to the second object node.

[0109] In one embodiment, taking the account balance as an example, a "two-line system" exists in actual business scenarios, where the customer's accounts for receiving and making payments are independent. Taking the "One-Account-for-All" product as an example, the root node is the main account, the second object node is the sub-account, and the first object node is the settlement sub-account. The following scenario might occur: An intermediary distributor signs up for the corporate One-Account-for-All product with their settlement account. After signing, the newly added One-Account-for-All sub-accounts are used to pay different downstream end-sellers. For example, after signing up for the One-Account-for-All product, a company adds multiple sub-accounts under its main account, each corresponding to a different downstream end-seller. The company pays the corresponding sellers through these sub-accounts. The distributor then uses the main account to order goods from its upstream factory. In this example, funds from downstream sellers are deposited from different sub-accounts and aggregated into the main account; when the distributor orders goods from upstream, the funds are actually withdrawn from the settlement sub-account linked to the main account. While this "two-line system" of separating funds facilitates accounting audits, the money in the sub-accounts cannot actually be used by the main account.

[0110] In the above embodiments, when the root node or the first object node receives the first resource transfer request, the resource quantity between the root node and the first object node can be increased or decreased synchronously without affecting the resource quantity of the second object node; when the second object node receives the second resource transfer request, the resource quantity corresponding to the second object node and at least one of its parent nodes can be increased synchronously, thereby improving the efficiency and accuracy of resource adjustment.

[0111] In one exemplary embodiment, such as Figure 5 As shown, S800 includes:

[0112] S840, when the root node receives the first resource transfer request, the maximum resource transfer amount corresponding to the root node is determined to be the resource amount corresponding to the first object node.

[0113] S850, when the first object node receives the first resource transfer request, the maximum resource transfer amount corresponding to the first object node is the smaller of the resource amount corresponding to the root node and the resource amount corresponding to the first object node.

[0114] S860, when the second object node receives the second resource transfer request sent by the second object, the maximum resource transfer amount corresponding to the second object node is the smaller of the resource amount corresponding to the parent node of the second object node and the resource amount corresponding to the second object node.

[0115] Specifically, disregarding special business scenarios such as resource freezing, since the first object node is the execution vehicle for the root node's resource transfer operation, when the root node receives the first resource transfer request, it cannot utilize the resource amounts corresponding to other tree nodes for resource transfer. Instead, it needs to coordinate with the resource amounts corresponding to the first object node for resource transfer. Therefore, when the root node receives the first resource transfer request, the maximum resource transfer amount corresponding to the root node is the resource amount corresponding to the first object node, and cannot exceed it; otherwise, the resource transfer cannot be completed using the root node.

[0116] When the first object node receives the first resource transfer request, the maximum resource transfer amount corresponding to the first object node is the smaller of the resource amount corresponding to the first object node and the resource amount corresponding to the root node. In other words, the upper limit of the resource transfer amount of the first object node needs to be controlled by the resource amount corresponding to the parent node of the first object node to ensure that each resource transfer of the first object node is within the controllable range of the root node. That is, the maximum resource transfer amount corresponding to the first object node = min(the resource amount corresponding to the first object node, the resource amount corresponding to the root node).

[0117] When the second object node receives a second resource transfer request sent by the second object, the resource transfer amount corresponding to the second object node is the lesser of the resource amount corresponding to the parent node and the resource amount corresponding to the second object node. In other words, the upper limit of the resource transfer amount of the second object node needs to be controlled by the resource amount of the parent node to ensure that each resource transfer by the second object node is within the controllable range of the parent node. That is, the maximum resource transfer amount corresponding to the second object node = min(the resource amount corresponding to the second object node, the resource amount corresponding to the parent node). In practical applications, the parent node of the second object node is generally an intermediate layer node, such as a district-level node, county-level node, or city-level node.

[0118] In the above embodiments, by determining the maximum resource transfer amount corresponding to the root node as the resource amount corresponding to the first object node, the resource transfer operation corresponding to the root node can be reliably executed. At the same time, by determining the resource transfer amount of the first object node or the second object node as the smaller of the resource amount of its parent node and its own resource amount, it can be ensured that each resource transfer of the first object node or the second object node is within the controllable range of its parent node, so as to accurately manage the resources of the first object node or the second object node.

[0119] In an exemplary embodiment, in the resource node tree, the resource quantity of the root node, the resource quantity of the first object node, and the resource quantity of all second object nodes are all greater than 0.

[0120] The root node's resource quantity is equal to the sum of the first object node's resource quantity and the resource quantities of all second object nodes.

[0121] The root node's child nodes include at least one intermediate layer node and / or at least one second object node. Each intermediate layer node's child nodes include at least one next-level intermediate layer node and / or at least one second object node. The second object node is the bottom layer node. The resource quantity of each intermediate layer node is equal to the sum of the resource quantities of all the second object nodes corresponding to the intermediate layer node.

[0122] Specifically, since the resource node tree corresponds to the resources of the first object, and these resources cannot be overdrawn or exceeded, the resource quantity of the root node, the resource quantity of the first object node, and the resource quantity of all second object nodes in the resource node tree must all be greater than 0 to ensure that the first object can transfer resources to other objects.

[0123] Furthermore, the resource quantity of the root node is equal to the sum of the resource quantities of all underlying nodes. In other words, the resource quantity of the root node is equal to the sum of the resource quantity of the first object node and the resource quantity of all second object nodes.

[0124] Furthermore, the root node's child nodes include not only at least one second object node but also at least one intermediate-level node. Each intermediate-level node's child nodes include at least one next-level intermediate-level node and / or at least one second object node. The second object node is the bottom-level node; that is, the second object node does not have corresponding child nodes. The resource quantity of each intermediate-level node is equal to the sum of the resource quantities of all second object nodes derived from that intermediate-level node, and the resource quantity of each intermediate-level node is independent of the resource quantities of the second object nodes derived from other intermediate-level nodes.

[0125] It should be noted that the management scope of intermediate layer nodes and root nodes is different. The root node is used to manage the resource volume of all second object nodes and first object nodes, while the intermediate layer node is used to manage the resource volume of all second object nodes under the intermediate layer node. In practical applications, intermediate layer nodes can be divided by geographical area. For example, intermediate layer nodes can include city-level, county-level, and district-level nodes. Intermediate layer nodes can also be divided by business line or project cycle, etc., which is not limited here.

[0126] In one embodiment, it remains as follows Figure 3As shown, the resource quantity of the root node is equal to the sum of the resource quantity of the first object node and the resource quantity of all second object nodes. Therefore, the balance (A) = balance (A-0001) + ∑{balance (A-0002) + balance (A-0003) + ... + balance (A-0006)}. At the same time, the resource quantity of each intermediate layer node is equal to the sum of the resource quantities of all second object nodes corresponding to the intermediate layer node. Therefore, the balance (A-9001) = balance (A-0003) + balance (A-0004).

[0127] In the above embodiments, by setting the resource quantity of the root node, the resource quantity of the first object node, and the resource quantity of all second object nodes to be greater than 0, it is ensured that the first object can perform resource transfer operations with other objects. Furthermore, by setting multiple layers of intermediate nodes, the resource quantity of the second object nodes can be accurately and efficiently managed in a hierarchical manner.

[0128] In an exemplary embodiment, based on the resource node tree, this application also provides a complete resource adjustment process, which includes multiple functions, specifically: resource adjustment permission maintenance function, node change function, resource transfer function of underlying nodes, migration function of underlying nodes, node information query function, information change function of each node, and extension functions, etc.

[0129] 1. Regarding the resource adjustment permission maintenance function, it includes the functions of confirming resource adjustment permissions, modifying information, querying and revoking permissions.

[0130] The resource adjustment permission confirmation function refers to, after responding to the resource adjustment permission confirmation operation for the first object, using the root node as a virtual node and copying the root node's attribute information in the resource node tree to generate the first object node corresponding to the root node. The first object node serves as the execution carrier for the resource transfer operation of the root node. When the root node receives a first resource transfer request sent by any external object, it can forward the first resource transfer request to the first object node, causing the first object node to respond to the first resource transfer request. The resource adjustment permission information modification function refers to modifying the information at the time of resource adjustment permission confirmation, such as whether a certain operation in the resource transfer process is supported. The resource adjustment permission query function refers to querying whether the resource adjustment permission has been confirmed and the specific confirmation information. The resource adjustment permission release function refers to releasing the resource adjustment permission of the first object, which requires the resource node tree corresponding to the first object to be in an invalid state.

[0131] 2. Functions for changing nodes, including adding nodes in the resource node tree, modifying node information, querying node permission information, and deleting nodes.

[0132] The resource node tree's node addition function refers to adding intermediate or bottom-level nodes. When adding a node, the parent node of the new node needs to be specified, and the initial resource quantity of the new node is 0. The resource node tree's node information modification function is used to modify the relevant information of each node, such as the internal purpose description of the node. The resource node tree's node permission information query function is used to query the permission information of each node, such as resource transfer permission information. The resource node tree's node deletion function is used to delete nodes in the resource node tree, such as intermediate or bottom-level nodes.

[0133] 3. The resource transfer function and migration function of the underlying nodes are described in detail in the following embodiments, and will not be repeated here.

[0134] 4. Information query functions for nodes, including historical information query function and resource transfer history details query function.

[0135] The historical information query function refers to the addition of corresponding historical record information when performing functions such as resource adjustment permission maintenance, node change, internal transfer of resources to underlying nodes, and migration of underlying nodes. Through this function, the historical information of each node can be queried, such as the object setting time and the change time of related attributes. The resource transfer history details query function means that the node will record the resource transfer time and resource quantity change information during the resource transfer process. In addition, if the resource transfer is achieved through the linkage of lower-level nodes, the node identifier that triggered the linkage will also be recorded in the details. If it is a resource transfer operation related to the root node, the root node will also be recorded as a linkage node in the details information of the first object node for subsequent querying.

[0136] 5. Regarding the node information modification function, most node information is copied from the root node when a node is added. Taking the root node as the main account and the second object node as a sub-account as an example, the sub-account's customer information, accounting institution, and other information can be copied from the main account. When the corresponding attribute of the root node changes, it needs to be synchronized to all intermediate-level nodes, second object nodes, and first object nodes. Furthermore, considering non-functional implementation of the system, a strategy is adopted: after the root node's attribute changes, the system will scan the root node's change information at the end of the day (outside business hours) and trigger automatic information updates for all lower-level nodes belonging to the root node based on the specific changes.

[0137] 6. Regarding the extended functions, including node identification and automatic aggregation, the node identification function is described in detail in the following embodiments and will not be repeated here. The automatic aggregation function refers to automatically filtering second object nodes with non-zero resource amounts during a specified time period each day, and initiating resource transfers from the second object nodes to the first object nodes one by one. The transferred resource amount is the actual resource amount of the corresponding second object node. In this way, the resource amount of the first object node can be used by the root node the next day. The advantage of this automatic aggregation function is that it does not trigger changes in the resource amount of the "common parent node (e.g., the root node)". From the perspective of the root node's resource transfer details, the corresponding record is not visible, and it does not affect the resource adjustment of the resource transfer-in and resource transfer-out lines.

[0138] In the above embodiments, a unified system can be established for resource adjustment of the first object through the various functions provided, so as to execute the complete resource adjustment process efficiently and accurately.

[0139] In an exemplary embodiment, the second object node is further configured to respond to a third resource transfer request sent by another second object node or a fourth resource transfer request sent by the first object node; the resource transfer control method further includes:

[0140] When a second object node receives a third resource transfer request from another second object node, the resource quantity corresponding to the common parent node between the two second object nodes remains unchanged; when a second object node receives a fourth resource transfer request, the resource quantity of the common parent node between the second object node and the first object node remains unchanged; when a second object node migrates from a child node of a first intermediate layer node to a child node of a second intermediate layer node, the resource quantities corresponding to the first intermediate layer node, the second intermediate layer node, and the non-common first parent node all change, wherein the first intermediate layer node and the second intermediate layer node are not duplicated, and the first parent node refers to a node that is not duplicated between the second parent node of the first intermediate layer node and the third parent node of the second intermediate layer node.

[0141] Specifically, this application provides the function of transferring resources within the underlying nodes of the resource node tree and the function of migrating the underlying nodes.

[0142] For the resource transfer function of the underlying nodes, it supports resource transfer between any two second object nodes, and between the first object node and any second object node. According to the resource transfer rules, the resource transfer between any two second object nodes, and between the first object node and any second object node, is actually an increase or decrease in the same amount of resources but in opposite directions.

[0143] When a resource transfer occurs between any two second object nodes, one of the second object nodes receives a third resource transfer request from the other second object node, and the resource quantity corresponding to the common parent node between the two second object nodes remains unchanged. When a resource transfer occurs between the first object node and any second object node, the second object node receives a fourth resource transfer request, and the resource quantity of the common parent node between the second object node and the first object node also remains unchanged. Furthermore, when a resource transfer occurs between the first object node and any second object node, the first object node may also receive a fifth resource transfer request from any second object node, and the resource quantity of the common parent node between the second object node and the first object node also remains unchanged.

[0144] Taking the resource node tree as an example of a multi-level account structure system for a single-user product, it still... Figure 3 As shown, when a transfer occurs between settlement sub-account A-0001 and sub-account A-0002, the balance of the main account remains unchanged. When a transfer occurs between sub-account A-0005 and sub-account A-0006, the balance of the intermediate account A-9003 increases or decreases with A-0006. However, the common parent node A-9002 between sub-accounts A-0005 and A-0006, and even the balance of the main account, remain unchanged.

[0145] Specifically, when the resource is an account balance, referring to the general opening method for corporate fixed deposits, for fixed deposit sub-accounts, the balance can only be transferred from the settlement sub-account or other sub-accounts to the fixed deposit through the "One Account Sub-Account Transfer" function. Similarly, when a fixed deposit sub-account needs to be closed, the account balance needs to be transferred to other sub-accounts through the resource transfer function of the underlying node. The specific process is interest payment, account closure, and transfer.

[0146] Regarding the migration function of the underlying nodes, the second object node in the resource node tree can migrate between different parent nodes. Since the parent node of the second object node can be an intermediate layer node, when the second object node migrates from a child node of the first intermediate layer node to a child node of the second intermediate layer node, the resource quantity corresponding to the second object node does not change. However, the resource quantity corresponding to the first intermediate layer node, the resource quantity corresponding to the second intermediate layer node, and the resource quantity corresponding to the first parent node that is not repeated between the second parent node of the first intermediate layer node and the third parent node of the second intermediate layer node all change.

[0147] Taking the resource node tree as an example of a multi-level account structure system for a single-user product, it still... Figure 3As shown, if sub-account A-0003 is transferred from A-9001 to A-9003, the balance of the direct parent node A-9001 at the time of the transfer-out decreases, and the latest balance (A-9001) = the original balance (A-9001) – balance (A-0003); the balance of the direct parent node A-9003 at the time of the transfer-in increases, and the latest balance (A-9003) = the original balance (A-9003) + balance (A-0003); furthermore, the balances of the non-common parent nodes of nodes A-9001 and A-9003 also change: the balance of the parent node linked to A-9001 decreases (this is not the case in this example), and the balance of the parent node linked to A-9003 increases, such as the balance of A-9002, and the latest balance (A-9002) = the original balance (A-9002) + balance (A-0003).

[0148] In the above embodiments, by providing the resource quantity transfer function of the bottom-level nodes of the resource node tree, the resource quantity transfer between any two second object nodes and between the first object node and any second object node can be accurately adjusted, reducing the cost of resource quantity transfer and thus reducing the cost of resource adjustment; by providing the migration function of the bottom-level nodes, the resource quantity of other affected nodes can also be accurately adjusted when the second object node migrates from the child node of the first intermediate layer node to the child node of the second intermediate layer node.

[0149] In one exemplary embodiment, the resource transfer control method further includes:

[0150] In response to the operation of revoking the resource adjustment permission for the first object, first set the status of the second object node and the intermediate layer node to the invalid state; then use the node information of the first object node as the node information of the root node, and set the status of the first object node to the invalid state.

[0151] Specifically, when the state of the second object node is set to the invalid state, the unfinished resource transfer operation of the second object node is executed first, and then the state of the second object node is set to the invalid state if there is no unfinished resource transfer operation of the second object node; when the state of the intermediate layer node is set to the invalid state, the state of all child nodes corresponding to the intermediate layer node is set to the invalid state first, and then the state of the intermediate layer node is set to the invalid state.

[0152] Specifically, when it is necessary to remove the resource adjustment permission of the first object, the user triggers the resource adjustment permission removal control of the first object, and the terminal responds to the resource adjustment permission removal operation for the first object. It is necessary to set the resource node tree of the first object to an invalid state. Specifically, firstly, the state of the second object node and the state of the intermediate layer node are both set to an invalid state. Then, the node information of the first object node is used as the node information of the root node, and the state of the first object node is set to an invalid state. The root node is updated from a virtual node to an actual node.

[0153] In practical applications, taking resources as account balances and nodes as accounts as an example, setting a node to an invalid state means closing the account corresponding to the node. Before closing the account, the transactions of the corresponding account must be settled to ensure that the balance is 0 before closing the account.

[0154] Furthermore, when setting the state of the second object node to an invalid state, it is necessary to first execute the incomplete resource transfer operation of the second object node and make the resource quantity corresponding to the second object node zero before setting the state of the second object node to an invalid state. However, when setting the state of the intermediate layer node to an invalid state, since the intermediate layer node does not need to execute the resource transfer operation, it is not necessary to execute the incomplete resource transfer operation of the second object node. However, it is necessary to ensure that all the subordinate nodes of the intermediate layer node are in an invalid state before setting the state of the intermediate layer node to an invalid state.

[0155] In the above embodiments, when revoking the resource adjustment permission of the first object, it is necessary to first set the state of the resource node tree corresponding to the first object to an invalid state. When setting the state of the bottom node in the resource node tree to an invalid state, it is necessary to first execute the unfinished resource transfer operation of the bottom node to avoid setting the state of the bottom node to an invalid state before the resource transfer operation is completed, which would interrupt the resource transfer process and trigger the accountability of the second object. Furthermore, when setting the state of the middle layer node in the resource node tree to an invalid state, it is necessary to first set the state of all child nodes corresponding to the middle layer node to an invalid state. That is, it is necessary to gradually make the nodes of the entire resource node tree in an invalid state from the bottom up, so as to make the process of revoking the resource adjustment permission more reliable.

[0156] In one exemplary embodiment, the resource transfer control method further includes:

[0157] In response to the identification operation for the node identifier, obtain the node identifier to be identified; according to the preset node identifier mapping information, query the node identifier that matches the node identifier to be identified, and query the node information that matches the node identifier in the resource node tree.

[0158] Specifically, regarding the extended functionality of the resource node tree, this application also provides a node identifier recognition function. Specifically, during resource transfer using nodes, not all resource transfer systems are compatible with the node identifiers of this application. For example, some node identifiers containing "-" cannot be recognized by other external systems. When an external object uses nodes in the resource node tree to transfer resources with a first object, the passed identifier is one that the external object's system can recognize, which is inconsistent with the node identifiers in the resource node tree. In this case, the node identifier recognition function is needed to map the node identifiers passed from the external object's system to the node identifiers in the resource node tree to identify the corresponding node identifiers.

[0159] Therefore, the terminal can respond to the identification operation for the node identifier, obtain the node identifier to be identified from the system of the external object, and query the node identifier that matches the node identifier to be identified according to the preset node identifier mapping information, and query the node information that matches the node identifier in the resource node tree. For example, the node identifier to be identified from the external system may be "A0001". In this case, it is necessary to query the node identifier "A-0001" that matches the node identifier "A0001", thereby determining the node corresponding to the node identifier "A-0001" and obtaining the node information of the node corresponding to the node identifier "A-0001".

[0160] In one embodiment, the preset node identifier mapping information is generated by the user through custom configuration after confirming the resource adjustment permissions of the first object. After obtaining the node identifier to be identified from the external system, the node identifier matching the node identifier to be identified is queried according to the node identifier mapping information.

[0161] In the above embodiments, when obtaining the identifier of the node to be identified, the identifier of the node to be identified can be accurately mapped to the node identifier in the resource node tree according to the preset node identifier mapping information, so as to accurately query the node information that matches the node identifier in the resource node tree.

[0162] To facilitate understanding of the resource transfer control method of this application by those skilled in the art, it is still as follows: Figure 3As shown, the following example illustrates a distributor ordering goods from an upstream manufacturer and selling them to multiple buyers. In this case, the resource is the account balance, the distributor is the first object, the buyers are the second object, the upstream manufacturer is the external object, and the resource node tree represents the multi-layered account structure of the "One-Account-Pass" product generated after the distributor signs the agreement. The root node is the distributor's main account A, the second object nodes are the distributor's sub-accounts A-0002, A-0003, A-0004, A-0005, and A-0006, the first object node is the distributor's settlement sub-account A-0001, and the intermediate nodes... The points are intermediate-level accounts A-9001, A-9002, and A-9003 set up by the distributor according to the city, county, and district respectively. Specifically, after the main account signs up for the One-Account-Pass, the main account becomes a virtual account, and a settlement sub-account is generated by default to replace the main account to execute transactions. Furthermore, in the multi-level account structure system of the One-Account-Pass product, multiple layers of intermediate-level accounts and sub-accounts corresponding to the main account can be derived. The child nodes of each main account are intermediate-level accounts or sub-accounts, and the child nodes of each intermediate-level account are the next level intermediate-level accounts or sub-accounts. Sub-accounts are the bottom-level accounts and do not have child nodes.

[0163] In this multi-account structure of the "One Account for All" product, the fund relationships between the accounts are as follows:

[0164] 1) After the dealer signs the contract, the balance of the main account A is recorded in the settlement sub-account A-0001. At this time, no sub-accounts of the main account have been generated yet, and the balance (A) = the balance (A-0001).

[0165] 2) When the main account A has a transaction (the balance increases or decreases), the balance of the downstream settlement sub-account A-0001 will increase or decrease synchronously.

[0166] 3) When a transaction occurs in settlement sub-account A-0001, the balance of the main account A will be increased or decreased synchronously.

[0167] 4) For the sub-accounts at the bottom level, when a transaction occurs, the balance increases or decreases layer by layer upwards until the main account A is reached.

[0168] 5) Intermediate accounts cannot directly conduct transactions with external parties.

[0169] 6) The account balance relationships are as follows:

[0170] For example, a. Balance (A) = Balance (A-0001) + ∑{ Balance (A-0002) + Balance (A-0003) + ... + Balance (A-0006)}; b. Balance (A-9001) = Balance (A-0003) + Balance (A-0004).

[0171] 7) Balance control: The balance of all accounts cannot be less than 0. Therefore, the maximum balance that the main account can use for payment is the balance of settlement sub-account 0001; while the balance that 0001 and other sub-accounts can use for payment is min{balance (sub-account), balance (sub-account's parent sub-account or main account)}.

[0172] Based on the multi-level account structure of the unified account product described above, this embodiment also provides a complete set of unified account product management and usage tools throughout its lifecycle:

[0173] 1. Main Contract Maintenance for One-Account Connector:

[0174] A One-Account Master Contract Signing: Convert the master account into a virtual account and copy the master account attributes to generate a settlement sub-account.

[0175] B-One-Account Main Contract Modification: Used to modify relevant information in the main contract, such as whether to support hiding the "-" symbol in the account identifier.

[0176] C-One-Account Master Contract Inquiry: Used to inquire about the signing information of the master contract.

[0177] D. Cancellation of the One-Account Master Contract: This function is used to terminate the overall structure of the One-Account system. A prerequisite is that all sub-accounts, except for the settlement sub-account, are closed. During cancellation, the settlement sub-accounts are first settled and closed, then their status is copied to the master account, and finally, the master account is transferred back to the "real account" attribute.

[0178] 2. Maintenance of Sub-Contracts for One-Account Connectivity:

[0179] Adding a sub-account in the "One Account" feature includes adding a middle-level account or a bottom-level current account. The sub-account must specify the parent node account, and the new account balance must be 0.

[0180] B. Sub-account Modification: Used to modify relevant information about sub-accounts, such as the internal purpose description of the sub-account.

[0181] C-Account Sub-Account Inquiry: Used to inquire about the contract information of sub-accounts.

[0182] D. Closing a Sub-Account in One-Account System: For the bottom-level One-Account sub-accounts, it is necessary to first complete the settlement (calculate the interest due to the customer and complete the payment) and close the account to ensure that the balance is 0 before the sub-account status is invalidated; For the middle-level accounts, there is no settlement involved (virtual accounts do not record transactions and do not involve interest), but it is necessary to ensure that there are no other sub-accounts under this account that have not been "closed".

[0183] 3. Intra-account transfers:

[0184] Internal transfers within a single account are limited to transfers between settlement sub-accounts and underlying accounts, or between underlying accounts. Transactions between settlement sub-accounts and sub-accounts, or between different sub-accounts, are essentially increases or decreases of equal amount in opposite directions; the balance of their common parent account remains unchanged.

[0185] 4. One account can be linked in and out:

[0186] For sub-accounts at the bottom level of a unified account, migration is possible between different upper-level nodes. For example, sub-account A-0003 can be transferred from A-9001 to A-9003. The balance of the sub-account itself remains unchanged. However, the balances of the original upper-level sub-accounts (non-master accounts), the new upper-level sub-accounts (non-master accounts), and their non-public upper-level nodes will change.

[0187] 5. Sub-account inquiry for unified account:

[0188] A. Query historical information of sub-accounts under the unified account system. When data changes occur in functions 1-4 mentioned above, the system will add historical record information. This function allows you to query information such as the opening date and the time of change of related attributes for each sub-account.

[0189] B. Transaction details for sub-accounts. The transaction details record the transaction time and amount changes. Furthermore, for the main account and intermediate accounts, if fund changes are triggered by lower-level accounts, the details will also record the account number that triggered the linkage; if it's a transaction from the main account, the main account will also be recorded as the linked account in the details of settlement sub-account 0001.

[0190] 6. Linked changes to master / servant information for all households:

[0191] Most of the information in sub-accounts is copied from the main account when the account is added, such as the corresponding customer number (associated customer information), accounting institution, etc. When the attributes of the main account change, they need to be synchronized to all sub-accounts.

[0192] 7. Extended Functionality:

[0193] 7.1 Account mapping for a single account.

[0194] Because not all trading systems support the rule of including "-" in account codes when sub-accounts are used in external transactions, a mapping function is provided here for accounts with and without "-" to accommodate cases where external systems do not support accounts with "-". For example, an externally input account code "A0001" can be recognized as "A-0001", thus obtaining the account information corresponding to A-0001.

[0195] 7.2 In response to the situation where there are "two separate lines of income and expenditure" in actual business scenarios, this product provides an automatic collection function for sub-account balances.

[0196] In real-world business scenarios, the following may occur: funds from downstream sellers are deposited into different sub-accounts and then aggregated into the main account; when distributors place orders with upstream suppliers, the funds are actually withdrawn from the settlement sub-account linked to the main account for payment. Thus, while this "two-line system" of separating income and expenditure facilitates company accounting audits, the funds in the sub-accounts cannot actually be used by the main account.

[0197] Furthermore, a "collection function" is provided here. During a specified time period each day (usually before the system's daily accounting ends), the system automatically filters underlying sub-accounts with non-zero balances and initiates transfers from these sub-accounts to the settlement sub-account one by one. The transfer amount is the actual balance of the underlying sub-account. At this time, the balance of the settlement sub-account for the next day is available for use by the main account. Moreover, according to the rules for transfers within sub-accounts, the "collection" function does not trigger changes to the main account's balance. The corresponding records are not visible in the main account's transaction details, and it does not affect the "two-line" fund management system (revenue and expenditure).

[0198] It should be understood that although the steps in the flowcharts of the above embodiments are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowcharts of the above embodiments may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the steps or stages in other steps. It is understood that the steps in different embodiments can be freely combined as needed, and all non-contradictory solutions formed by such combinations are within the scope of protection of this application.

[0199] Based on the same inventive concept, this application also provides a resource transfer control device for implementing the resource transfer control method described above. The solution provided by this device is similar to the solution described in the above method; therefore, the specific limitations in one or more resource transfer control device embodiments provided below can be found in the limitations of the resource transfer control method described above, and will not be repeated here.

[0200] In one exemplary embodiment, such as Figure 6As shown, a resource transfer control device 1000 is provided, including: a resource node tree acquisition module 200, a first object node addition module 400, a second object node addition module 600, and a resource transfer adjustment module 800, wherein:

[0201] The resource node tree acquisition module 200 is used to respond to the resource adjustment permission confirmation operation for the first object and determine the resource node tree corresponding to the first object, wherein the resource node tree includes at least the root node corresponding to the first object.

[0202] The first object node addition module 400 is used to set the root node to the target state and add a child node to the root node as the first object node. In the target state, the root node is used to forward the first resource transfer request sent by any external object to the first object node, and the first object node is used to respond to the first resource transfer request.

[0203] The second object node addition module 600 is used to add at least one tree node to the resource node tree, wherein the added at least one tree node includes a second object node, and the second object node is used to respond to the second resource transfer request sent by the second object.

[0204] The resource transfer adjustment module 800 is used to adjust the amount of resources of the first object when transferring resources between the first object and different objects, based on the resource node tree.

[0205] In one embodiment, the resource transfer adjustment module 800 is further configured to, when the root node or the first object node receives the first resource transfer request, adjust the resource quantity corresponding to the root node and the resource quantity corresponding to the first object node according to the resource transfer quantity carried in the first resource transfer request; and when the second object node receives the second resource transfer request, adjust the resource quantity corresponding to the second object node and the resource quantity corresponding to at least one of the parent nodes of the second object node according to the resource transfer quantity carried in the second resource transfer request.

[0206] In one embodiment, the resource transfer adjustment module 800 is further configured to: when the root node receives the first resource transfer request, determine the maximum resource transfer amount corresponding to the root node as the resource amount corresponding to the first object node; when the first object node receives the first resource transfer request, determine the maximum resource transfer amount corresponding to the first object node as the smaller of the resource amount corresponding to the root node and the resource amount corresponding to the first object node; when the second object node receives the second resource transfer request sent by the second object, determine the maximum resource transfer amount corresponding to the second object node as the smaller of the resource amount corresponding to the parent node of the second object node and the resource amount corresponding to the second object node.

[0207] In one embodiment, in the resource node tree, the resource quantity of the root node, the resource quantity of the first object node, and the resource quantity of all second object nodes are all greater than 0; the resource quantity of the root node is equal to the sum of the resource quantity of the first object node and the resource quantity of all second object nodes; the child nodes of the root node include at least one intermediate layer node and / or at least one second object node, and the child nodes of each intermediate layer node include at least one next-level intermediate layer node and / or at least one second object node, the second object node is the bottom layer node, and the resource quantity of each intermediate layer node is equal to the sum of the resource quantities of all second object nodes corresponding to the intermediate layer node.

[0208] In one embodiment, the second object node is further configured to respond to a third resource transfer request sent by another second object node or a fourth resource transfer request sent by the first object node; the resource transfer control device further includes an internal adjustment module, which is configured to ensure that when the second object node receives a third resource transfer request from another second object node, the resource quantity corresponding to the common superior node between the two second object nodes remains unchanged; when the first object node receives a fourth resource transfer request, the resource quantity of the common superior node between the second object node and the first object node remains unchanged; when the second object node migrates from a child node of the first intermediate layer node to a child node of the second intermediate layer node, the resource quantities corresponding to the first intermediate layer node, the second intermediate layer node, and the non-common first superior node all change, wherein the first intermediate layer node and the second intermediate layer node are not duplicated, and the first superior node refers to a node that is not duplicated between the second superior node of the first intermediate layer node and the third superior node of the second intermediate layer node.

[0209] In one embodiment, the resource transfer control device further includes a permission release module. This module responds to a resource adjustment permission release operation for the first object by first setting the state of the second object node and the intermediate layer node to an invalid state; then, using the node information of the first object node as the node information of the root node, and setting the state of the first object node to an invalid state. Specifically, when the state of the second object node is set to an invalid state, any incomplete resource transfer operations on the second object node are first executed; if no incomplete resource transfer operations exist on the second object node, the state of the second object node is set to an invalid state. When the state of the intermediate layer node is set to an invalid state, the state of all child nodes corresponding to the intermediate layer node is first set to an invalid state, and then the state of the intermediate layer node is set to an invalid state.

[0210] In one embodiment, the resource transfer control device further includes a node identifier identification module, which is used to respond to an identification operation for a node identifier, obtain the node identifier to be identified, query the node identifier that matches the node identifier to be identified according to the preset node identifier mapping information, and query the node information that matches the node identifier in the resource node tree.

[0211] Each module in the aforementioned resource transfer control device can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in or independent of the processor in a computer device, or stored in the memory of a computer device as software, so that the processor can call and execute the operations corresponding to each module.

[0212] In one exemplary embodiment, a computer device is provided, which may be a terminal, and its internal structure diagram may be as follows: Figure 7 As shown, the computer device includes a processor, memory, input / output interfaces, a communication interface, a display unit, and an input device. The processor, memory, and input / output interfaces are connected via a system bus, and the communication interface, display unit, and input device are also connected to the system bus via the input / output interfaces. The processor provides computing and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system and computer programs. The internal memory provides an environment for the operation of the operating system and computer programs stored in the non-volatile storage media. The input / output interfaces are used for exchanging information between the processor and external devices. The communication interface is used for wired or wireless communication with external terminals; wireless communication can be achieved through Wi-Fi, mobile cellular networks, Near Field Communication (NFC), or other technologies. When the computer program is executed by the processor, it implements a resource transfer control method. The display unit is used to form a visually visible image and can be a display screen, a projection device, or a virtual reality imaging device. The display screen can be an LCD screen or an e-ink screen. The input device of the computer device can be a touch layer covering the display screen, or buttons, trackballs, or touchpads set on the casing of the computer device, or external keyboards, touchpads, or mice, etc.

[0213] Those skilled in the art will understand that Figure 7 The structure shown is a block diagram of a partial structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. The specific computer device may include more or fewer components than shown in the figure, or combine certain components, or have different component arrangements.

[0214] In one embodiment, a computer device is also provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps in the above method embodiments.

[0215] In one embodiment, a computer-readable storage medium is provided having a computer program stored thereon that, when executed by a processor, implements the steps in the above method embodiments.

[0216] In one embodiment, a computer program product is provided, including a computer program that, when executed by a processor, implements the steps in the above method embodiments.

[0217] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium. When executed, the computer program can include the processes of the embodiments of the above methods. Any references to memory, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM). The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, graphics processors, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, artificial intelligence (AI) processors, etc., and are not limited to these.

[0218] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0219] The above embodiments merely illustrate several implementation methods of this application, and their descriptions are relatively specific and detailed, but they should not be construed as limiting the scope of this application's patent. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this application should be determined by the appended claims.

Claims

1. A resource transfer control method characterized by, The method comprises: determining a resource node tree corresponding to the first object in response to a resource adjustment permission confirmation operation for the first object, wherein the resource node tree at least comprises a root node corresponding to the first object; setting the root node as a target state, and adding a child node of the root node as a first object node, wherein in the target state, the root node is used to forward a first resource transfer request sent by any external object to the first object node, and the first object node is used to respond to the first resource transfer request; adding at least one tree node to the resource node tree, wherein the added at least one tree node comprises a second object node, and the second object node is used to respond to a second resource transfer request sent by a second object; adjusting the resource amount of the first object when transferring resources between the first object and different objects according to the resource node tree.

2. The method of claim 1, wherein, The adjusting the resource amount of the first object when transferring resources between the first object and different objects according to the resource node tree comprises: when the root node or the first object node receives the first resource transfer request, adjusting the resource amount corresponding to the root node and the resource amount corresponding to the first object node according to the resource transfer amount carried in the first resource transfer request; when the second object node receives the second resource transfer request, adjusting the resource amount corresponding to the second object node and the resource amount corresponding to at least one superior node of the second object node according to the resource transfer amount carried in the second resource transfer request.

3. The method of claim 1, wherein, The adjusting the resource amount of the first object when transferring resources between the first object and different objects according to the resource node tree comprises: when the root node receives the first resource transfer request, the maximum resource transfer amount corresponding to the root node is determined as the resource amount corresponding to the first object node; when the first object node receives the first resource transfer request, the maximum resource transfer amount corresponding to the first object node is the smaller one of the resource amount corresponding to the root node and the resource amount corresponding to the first object node; when the second object node receives the second resource transfer request sent by the second object, the maximum resource transfer amount corresponding to the second object node is the smaller one of the resource amount corresponding to the superior node of the second object node and the resource amount corresponding to the second object node.

4. The method of claim 1, wherein, In the resource node tree, the resource amount of the root node, the resource amount of the first object node, and the resource amount of all the second object nodes are greater than 0; the resource amount of the root node is equal to the sum of the resource amount of the first object node and the resource amount of all the second object nodes; The child nodes of the root node include at least one intermediate layer node and / or at least one second object node, the child nodes of each intermediate layer node include at least one next layer intermediate layer node and / or at least one second object node, the second object node is a bottom layer node, and a resource amount of each intermediate layer node is equal to a sum of resource amounts of all second object nodes corresponding to the intermediate layer node.

5. The method of claim 4, wherein, The second object node is further configured to respond to a third resource transfer request sent by another second object node or a fourth resource transfer request sent by the first object node. The resource transfer control method further includes: When the second object node receives the third resource transfer request sent by another second object node, a resource amount corresponding to a common superior node between the two second object nodes does not change; When the second object node receives the fourth resource transfer request, a resource amount of a common superior node between the second object node and the first object node does not change; When the second object node migrates from a child node of a first intermediate layer node to a child node of a second intermediate layer node, resource amounts corresponding to the first intermediate layer node, the second intermediate layer node, and a first superior node that is not common all change, wherein the first intermediate layer node and the second intermediate layer node are not repeated, and the first superior node refers to a node that is not repeated between a second superior node of the first intermediate layer node and a third superior node of the second intermediate layer node.

6. The method of claim 4, wherein, The resource transfer control method further includes: In response to a resource adjustment authority release operation for the first object, the state of the second object node and the state of the intermediate layer node are both set to an invalid state; The node information of the first object node is taken as the node information of the root node, and the state of the first object node is set to an invalid state; When the state of the second object node is set to an invalid state, a resource transfer operation not completed by the second object node is executed first, and then when there is no resource transfer operation not completed by the second object node, the state of the second object node is set to an invalid state; When the state of the intermediate layer node is set to an invalid state, the states of all child nodes corresponding to the intermediate layer node are all set to invalid states first, and then the state of the intermediate layer node is set to an invalid state.

7. The method of claim 1, wherein, The resource transfer control method further includes: In response to an identification operation for a node identifier, a to-be-identified node identifier is acquired; According to preset node identifier mapping information, a node identifier matched with the to-be-identified node identifier is queried, and node information matched with the node identifier is queried in the resource node tree.

8. A resource transfer control apparatus characterized by comprising: The apparatus includes: A resource node tree acquisition module is configured to, in response to a resource adjustment authority confirmation operation for a first object, determine a resource node tree corresponding to the first object, wherein the resource node tree at least includes a root node corresponding to the first object. The first object node adding module is configured to set the root node as a target state, and add a child node of the root node as a first object node, wherein in the target state, the root node is configured to forward a first resource transfer request sent by any external object to the first object node, and the first object node is configured to respond to the first resource transfer request; The second object node adding module is configured to add at least one tree node to the resource node tree, wherein the added at least one tree node includes a second object node, and the second object node is configured to respond to a second resource transfer request sent by a second object; The resource transfer adjusting module is configured to adjust a resource amount of the first object when transferring resources between the first object and different objects according to the resource node tree.

9. The apparatus of claim 8, wherein, The resource transfer adjusting module is further configured to, when the root node or the first object node receives the first resource transfer request, adjust a resource amount corresponding to the root node and a resource amount corresponding to the first object node according to a resource transfer amount carried in the first resource transfer request; When the second object node receives the second resource transfer request, adjust a resource amount corresponding to the second object node and a resource amount corresponding to at least one superior node of the second object node according to a resource transfer amount carried in the second resource transfer request.

10. The apparatus of claim 8, wherein, The resource transfer adjusting module is further configured to, when the root node receives the first resource transfer request, determine a maximum resource transfer amount corresponding to the root node as the resource amount corresponding to the first object node; When the first object node receives the first resource transfer request, a maximum resource transfer amount corresponding to the first object node is a smaller one of the resource amount corresponding to the root node and the resource amount corresponding to the first object node; When the second object node receives the second resource transfer request sent by the second object, a maximum resource transfer amount corresponding to the second object node is a smaller one of a resource amount corresponding to a superior node of the second object node and the resource amount corresponding to the second object node.

11. The apparatus of claim 8, wherein, In the resource node tree, the resource amount of the root node, the resource amount of the first object node, and the resource amounts of all the second object nodes are greater than 0; the resource amount of the root node is equal to a sum of the resource amount of the first object node and the resource amounts of all the second object nodes; the child nodes of the root node include at least one intermediate layer node and / or at least one second object node, the child nodes of each intermediate layer node include at least one next layer intermediate layer node and / or at least one second object node, and the second object nodes are bottom layer nodes; and a resource amount of each intermediate layer node is equal to a sum of resource amounts of all the second object nodes corresponding to the intermediate layer node.

12. The apparatus of claim 11, wherein, The second object node is also configured to respond to a third resource transfer request sent by another second object node or a fourth resource transfer request sent by the first object node; the resource transfer control device further comprises an internal adjustment module, which is configured to, when the second object node receives the third resource transfer request sent by another second object node, the resource amount corresponding to the common superior node between the two second object nodes does not change; When the first object node receives the fourth resource transfer request, the resource amount of the common superior node between the second object node and the first object node does not change; When the second object node migrates from a child node of a first intermediate layer node to a child node of a second intermediate layer node, the resource amounts corresponding to the first intermediate layer node, the second intermediate layer node, and a non-common first superior node all change, wherein the first intermediate layer node and the second intermediate layer node are not repeated, and the first superior node refers to a node that is not repeated between the second superior node of the first intermediate layer node and the third superior node of the second intermediate layer node.

13. The apparatus of claim 11, wherein, The resource transfer control device further comprises a permission release module, which is configured to, in response to a resource adjustment permission release operation for the first object, first set the state of the second object node and the state of the intermediate layer node to an invalid state; The node information of the first object node is taken as the node information of the root node, and the state of the first object node is set to an invalid state; wherein, when the state of the second object node is set to an invalid state, the resource transfer operation not completed by the second object node is executed first, and then when there is no resource transfer operation not completed by the second object node, the state of the second object node is set to an invalid state; When the state of the intermediate layer node is set to an invalid state, the states of all child nodes corresponding to the intermediate layer node are first set to an invalid state, and then the state of the intermediate layer node is set to an invalid state.

14. The apparatus of claim 8, wherein, The resource transfer control device further comprises a node identifier identification module, which is configured to, in response to an identification operation for a node identifier, acquire a to-be-identified node identifier; according to preset node identifier mapping information, query a node identifier matched with the to-be-identified node identifier, and query node information matched with the node identifier in the resource node tree.

15. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that, The processor executes the computer program to implement the steps of the method in any one of claims 1 to 7.

16. A computer readable storage medium having stored thereon a computer program, characterized in that, The computer program is executed by the processor to implement the steps of the method in any one of claims 1 to 7.

17. A computer program product comprising a computer program, characterized in that, The computer program is executed by the processor to implement the steps of the method in any one of claims 1 to 7.

Images