Data processing method and device, computer device and storage medium

Abstract

The application relates to a data processing method and device, computer equipment and a storage medium, and relates to the technical field of computers. The application can be used in the field of financial technology or other related fields. The method comprises the following steps: determining whether a risk guarantee ring exists in a quota tree according to a risk allocation mode of a risk allocation object connected to each quota node in the quota tree; wherein the risk guarantee ring is formed by different quota nodes guaranteed by the same risk allocation object under a non-fixed risk allocation mode; and if the risk guarantee ring exists, performing data processing on the quota nodes in the quota tree based on the risk guarantee ring. The method can reduce the complexity of the data processing process of the quota nodes in the quota tree and save computing resources.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of computer, in particular to a data processing method and device, computer equipment and storage medium. BACKGROUND

[0002] With the development of financial technology, the types of financial products are increasingly diversified. For resource borrowing products in the financial products, in order to facilitate the management of such products, an amount tree can be constructed based on the borrowing agreement of the resource borrowing product, and the management of the resource borrowing product can be realized by managing the amount nodes in the amount tree. Each amount node in the amount tree can define the name and risk amount of the corresponding resource borrowing product and other agreement elements, and one or more risk allocation objects (such as risk guarantee products of resource borrowing products) that allocate the risk amount of the amount node can be connected to the amount node.

[0003] However, with the increase in the number of resource borrowing products and risk allocation objects, the structure of the amount tree connected with the risk allocation objects becomes more and more complex. In this scenario, the current way of data processing of the amount nodes in the amount tree is to loop through the amount nodes and their connected risk allocation objects, which has defects such as complex processing process and high consumption of computing resources, and needs to be improved. SUMMARY

[0004] Therefore, it is necessary to provide a data processing method, device, computer equipment and readable storage medium capable of reducing the complexity of the data processing process of the amount nodes in the amount tree and saving computing resources.

[0005] In a first aspect, the present application provides a data processing method. The method comprises:

[0006] determining whether there is a risk guarantee circle in the amount tree according to the risk allocation mode of the risk allocation objects connected to each amount node in the amount tree; wherein the risk guarantee circle is composed of different amount nodes guaranteed by the same risk allocation object under a non-fixed risk allocation mode;

[0007] if there is, performing data processing on the amount nodes in the amount tree based on the risk guarantee circle.

[0008] In one of the embodiments, determining whether there is a risk guarantee circle in the amount tree according to the risk allocation mode of the risk allocation objects connected to each amount node in the amount tree comprises:

[0009] determining at least two target nodes from the amount tree according to the risk allocation mode of the risk allocation objects connected to each amount node in the amount tree, the target node being an amount node connected to a target object, and the target object being a risk allocation object under a non-fixed risk allocation mode;

[0010] According to the overlapping between the target objects hung by each target node, it is determined whether there is a risk guarantee circle in the credit tree.

[0011] In one embodiment, according to the overlapping between the target objects hung by each target node, it is determined whether there is a risk guarantee circle in the credit tree, comprising:

[0012] For each target node, according to the overlapping between the target objects hung by the target node and the target objects hung by other target nodes, the number of object overlaps between the target node and other target nodes is determined respectively;

[0013] According to the number of object overlaps corresponding to each target node, it is determined whether there is a risk guarantee circle in the credit tree.

[0014] In one embodiment, according to the number of object overlaps corresponding to each target node, it is determined whether there is a risk guarantee circle in the credit tree, comprising:

[0015] According to the size relationship between the first number threshold and the number of object overlaps corresponding to each target node, it is determined whether there is a long chain node and / or a ring chain node in the credit tree, and a node judgment result is obtained;

[0016] According to the node judgment result, it is determined whether there is a long chain guarantee relationship and / or a ring chain guarantee relationship in the credit tree, and a relationship determination result is obtained;

[0017] According to the relationship determination result, it is determined that there is a risk guarantee circle in the credit tree.

[0018] In one embodiment, according to the size relationship between the first number threshold and the number of object overlaps corresponding to each target node, it is determined whether there is a long chain node in the credit tree, and a node judgment result is obtained, comprising:

[0019] A first starting node is selected from the target nodes, and the first starting node is added to the long chain node set;

[0020] According to the number of object overlaps corresponding to the first starting node, a first screening node corresponding to the case that the number of object overlaps is the first number threshold is determined; wherein the first screening node is not included in the long chain node set;

[0021] The first screening node is taken as a new first starting node, and the first screening node is added to the long chain node set, and the operation of determining the first screening node corresponding to the case that the number of object overlaps is the first number threshold according to the number of object overlaps corresponding to the first starting node is returned to be executed until there is no new first screening node.

[0022] The nodes included in the long chain node set are taken as long chain nodes, and a node judgment result is obtained.

[0023] In one of the embodiments, according to the node judgment result, it is determined whether there is a long chain guarantee relationship in the credit tree, comprising:

[0024] According to the node judgment result, the node quantity of the long chain node is determined;

[0025] According to the node quantity and the object total quantity of the target object connected to the long chain node, it is determined whether there is a long chain guarantee relationship in the credit tree.

[0026] In one of the embodiments, according to the node judgment result, it is determined whether there is a ring chain guarantee relationship in the credit tree, and a relationship determination result is obtained, comprising:

[0027] A second starting node is selected from the target node, and the second starting node is added to the ring chain node set;

[0028] According to the object overlap quantity corresponding to the second starting node, a second screening node corresponding to the object overlap quantity greater than the first quantity threshold is determined; wherein the second screening node is not included in the ring chain node set;

[0029] The second screening node is taken as a new second starting node, and the second screening node is added to the ring chain node set, and the operation of determining the second screening node corresponding to the object overlap quantity greater than the first quantity threshold according to the object overlap quantity corresponding to the second starting node is executed until there is no new second screening node.

[0030] The nodes included in the ring chain node set are taken as ring chain nodes, and the node judgment result is obtained.

[0031] In one of the embodiments, according to the node judgment result, it is determined whether there is a ring chain guarantee relationship in the credit tree, comprising:

[0032] According to the node judgment result, the node quantity of the ring chain node is determined;

[0033] According to the node quantity, it is determined whether there is a ring chain guarantee relationship in the credit tree.

[0034] In one of the embodiments, according to the relationship determination result, it is determined that there is a risk guarantee circle in the credit tree, comprising:

[0035] If the relationship determination result is a long chain guarantee relationship and / or a ring chain guarantee relationship, the guarantee complexity of the long chain guarantee relationship and / or the ring chain guarantee relationship is determined;

[0036] If the guarantee complexity is greater than the complexity threshold, it is determined that there is a risk guarantee circle in the credit tree.

[0037] In one of the embodiments, determining the guarantee complexity of the long-chain guarantee relationship and / or the ring-chain guarantee relationship comprises:

[0038] determining the guarantee complexity of the long-chain guarantee relationship according to the number of nodes of the long-chain node contained in the long-chain guarantee relationship and the number of target objects to which the long-chain node is attached; and / or

[0039] determining the guarantee complexity of the ring-chain guarantee relationship according to the number of nodes of the ring-chain node contained in the ring-chain guarantee relationship and the number of target objects to which the ring-chain node is attached.

[0040] In one of the embodiments, for each target node, determining the number of object overlaps between the target node and other target nodes according to the overlap between the target object attached to the target node and the target objects attached to other target nodes comprises:

[0041] for each target node, determining whether the target node falls into the risk guarantee circle determined in the credit tree;

[0042] if not, determining the number of object overlaps between the target node and other target nodes according to the overlap between the target object attached to the target node and the target objects attached to other target nodes.

[0043] In one of the embodiments, based on the risk guarantee circle, performing data processing on the credit nodes in the credit tree comprises:

[0044] outputting prompt information containing the guarantee circle nodes according to the risk guarantee circle, the prompt information being used to prompt the attachment adjustment of the risk allocation objects of the credit tree; the guarantee circle nodes are the credit nodes falling into the risk guarantee circle.

[0045] In one of the embodiments, based on the risk guarantee circle, performing data processing on the credit nodes in the credit tree comprises:

[0046] determining the risk quota allocated to the guarantee circle nodes according to the target objects attached to the guarantee circle nodes; the guarantee circle nodes are the credit nodes falling into the risk guarantee circle; the target objects are the risk allocation objects in the non-fixed risk allocation mode;

[0047] performing structural reduction on the credit tree according to the guarantee circle nodes and the target objects attached to the guarantee circle nodes, to obtain a reduced tree;

[0048] determining the unguaranteed risk amount of each credit node in the reduced tree;

[0049] determining the unguaranteed risk amount of each credit node in the credit tree according to the risk quota allocated to the guarantee circle nodes according to the target objects attached to the guarantee circle nodes and the unguaranteed risk amount of each credit node in the reduced tree.

[0050] In one of the embodiments, the structure pruning of the quota tree is performed according to the guarantee circle node and the target object linked by the guarantee circle node, including:

[0051] If the guarantee circle node only links the target object in the quota tree, the guarantee circle node and the target object linked by the guarantee circle node are deleted in the quota tree.

[0052] In one of the embodiments, the structure pruning of the quota tree is performed according to the guarantee circle node and the target object linked by the guarantee circle node, including:

[0053] If the guarantee circle node links other risk sharing objects except the target object in the quota tree, the target object linked by the guarantee circle node is deleted in the quota tree.

[0054] In one of the embodiments, the target object linked by the guarantee circle node is determined as the risk quota shared by the guarantee circle node, including:

[0055] According to at least one of the value information, the linking sequence or the discount rate of the target object linked by the guarantee circle node, the quota sharing priority of the target object is determined;

[0056] According to the risk quota to be shared by the guarantee circle node, the value information of the target object and the quota sharing priority, the target object linked by the guarantee circle node is determined as the risk quota shared by the guarantee circle node.

[0057] In a second aspect, the present application further provides a data processing device. The device comprises:

[0058] The determining module is configured to determine whether there is a risk guarantee circle in the quota tree according to the risk sharing mode of the risk sharing object linked by each quota node in the quota tree; wherein the risk guarantee circle is composed of different quota nodes guaranteed by the same risk sharing object under the non-fixed risk sharing mode;

[0059] The processing module is configured to, if there is, perform data processing on the quota node in the quota tree based on the risk guarantee circle.

[0060] In a third aspect, the present application further provides a computer device. The computer device comprises a memory and a processor, the memory stores a computer program, and the processor implements the following steps when executing the computer program:

[0061] The determining module is configured to determine whether there is a risk guarantee circle in the quota tree according to the risk sharing mode of the risk sharing object linked by each quota node in the quota tree; wherein the risk guarantee circle is composed of different quota nodes guaranteed by the same risk sharing object under the non-fixed risk sharing mode;

[0062] If there is, data processing is performed on the credit nodes in the credit tree based on the risk guarantee circle.

[0063] In a fourth aspect, the present application further provides a computer readable storage medium. The computer readable storage medium has a computer program stored thereon, and the computer program, when executed by a processor, implements the following steps:

[0064] According to the risk allocation mode of the risk allocation objects hung by each credit node in the credit tree, it is determined whether there is a risk guarantee circle in the credit tree; wherein the risk guarantee circle is composed of different credit nodes guaranteed by the same risk allocation object under a non-fixed risk allocation mode;

[0065] If there is, data processing is performed on the credit nodes in the credit tree based on the risk guarantee circle.

[0066] In a fifth aspect, the present application further provides a computer program product. The computer program product comprises a computer program, and the computer program, when executed by a processor, implements the following steps:

[0067] According to the risk allocation mode of the risk allocation objects hung by each credit node in the credit tree, it is determined whether there is a risk guarantee circle in the credit tree; wherein the risk guarantee circle is composed of different credit nodes guaranteed by the same risk allocation object under a non-fixed risk allocation mode;

[0068] If there is, data processing is performed on the credit nodes in the credit tree based on the risk guarantee circle.

[0069] The above data processing method, device, computer equipment, storage medium and computer program product detect the risk guarantee circle existing in the credit tree according to the risk allocation mode of the risk allocation objects hung by each credit node in the credit tree, and perform data processing on the credit nodes in the credit tree based on the detected risk guarantee circle. The present application introduces the risk guarantee circle and performs data processing on the credit nodes in the credit tree in units of the risk guarantee circle. Compared with the prior art which performs data processing on the credit nodes in the credit tree by cyclically traversing the credit nodes and the risk allocation objects hung thereby, the present application reduces the complexity of the data processing process of the credit nodes and saves the consumption of computing resources. BRIEF DESCRIPTION OF DRAWINGS

[0070] Figure 1 An application environment diagram of the data processing method in one embodiment;

[0071] Figure 2 A flowchart of the data processing method in one embodiment;

[0072] Figure 3 A flowchart of the step of determining whether there is a risk guarantee circle in the credit tree in one embodiment;

[0073] Figure 4A Flowchart for determining whether there is a risk guarantee circle in the credit tree in another embodiment;

[0074] Figure 4B And Figure 4C Schematic diagram of the credit tree with risk allocation objects in one embodiment;

[0075] Figure 5 Flowchart of the data processing method in another embodiment;

[0076] Figure 6A Flowchart of the data processing method in another embodiment;

[0077] Figure 6B Schematic diagram of the credit tree with risk allocation objects in another embodiment;

[0078] Figure 7 Flowchart of the step of determining the risk quota of the guarantee circle node allocated by the target object to which the guarantee circle node is connected in one embodiment;

[0079] Figure 8 Flowchart of the data processing method in another embodiment;

[0080] Figure 9 Structural block diagram of the data processing device in one embodiment;

[0081] Figure 10 Structural block diagram of the determination module in one embodiment;

[0082] Figure 11 Structural block diagram of the second determination module in one embodiment;

[0083] Figure 12 Structural block diagram of the second determination subunit in one embodiment;

[0084] Figure 13 Structural block diagram of the guarantee circle judgment subunit in one embodiment;

[0085] Figure 14 Structural block diagram of the processing module in one embodiment;

[0086] Figure 15 Internal structural diagram of the computer device in one embodiment. DETAILED DESCRIPTION

[0087] In order to make the purposes, technical solutions and advantages of the present application clearer, further detailed description will be given below in combination with the drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and not intended to limit the present application.

[0088] The data processing method provided by the embodiments of the present application can be applied to an application environment as shown in Figure 1 . In the application environment, the terminal 102 communicates with the server 104 through a network. The data storage system can store data required to be processed by the server 104. The data storage system can be integrated on the server 104, or placed on a cloud or other network server. Specifically, the method of the present embodiment can be executed only by the server 104 in the application environment, or executed only by the terminal 102 with strong computing capability in the application environment, or executed by the terminal 102 and the server 104 in interaction. For example, the terminal 102 can provide an interface for interaction with a user, and the user can trigger an indication operation of data processing on the credit nodes in the credit tree through the interface. The terminal 102 generates a processing request based on the indication operation triggered by the user and sends the processing request to the server 104. The server 104 responds to the processing request, finds the credit tree required to be processed from the data storage system, and determines that there is a risk guarantee circle based on the risk sharing mode of the risk sharing object hung on each credit node in the credit tree. In the case where there is a risk guarantee circle, the terminal 102 performs data processing on the credit nodes in the credit tree based on the determined risk guarantee circle. The terminal 102 can be, but is not limited to, various personal computers, notebook computers, smart phones, tablet computers, Internet of Things devices and portable wearable devices. The Internet of Things device can be a smart speaker, a smart television, a smart air conditioner, a smart vehicle device, etc. The portable wearable device can be a smart watch, a smart bracelet, a head-mounted device, etc. The server 104 can be implemented by an independent server or a server cluster composed of multiple servers.

[0089] In one embodiment, as shown in Figure 2 , a data processing method is provided. Taking the server in the application environment as an example, the method comprises the following steps: Figure 1

[0090] S201, determining whether there is a risk guarantee circle in the credit tree according to the risk sharing mode of the risk sharing object hung on each credit node in the credit tree.

[0091] ​The credit tree is a tree structure based on a large number of resource loaning products. Each node in the credit tree can be a credit node, or a node other than the root node in the credit tree can be a credit node. Each credit node can correspond to a resource loaning product, and can define the name, risk credit, and risk subject of the resource loaning product. The risk credit can be the risk credit of the resource loaning product, that is, the value of the resource loaning product. The risk subject can be a party that needs to loan the resource loaning product. It should be noted that the parent credit node controls the risk credit limit of the child credit node, and the risk credit of the parent credit node is dynamically allocated among the child credit nodes under the same parent credit node to achieve credit sharing among agreements.

[0092] To prevent the risk subject from not returning the resource loaning product after loaning it, the risk subject needs to provide some objects that can share the risk credit of the resource loaning product, that is, risk sharing objects, before loaning the resource loaning product. For example, if the resource loaning product is a financial credit product, the risk subject can be a user applying for the financial credit product, and the risk sharing object can be a mortgage item provided for applying for the financial credit product. The risk sharing object can be attached to the corresponding credit node. For a credit node, the risk sharing objects attached thereto can form a guarantee attachment tree. From the perspective of the attachment relationship, the attachment relationship between the credit node and the risk sharing object is a loose coupling relationship. It can be a one-to-one, one-to-many, or many-to-many mapping relationship.

[0093] The risk sharing mode of the risk sharing object in the embodiment can include a fixed risk sharing mode and a non-fixed risk sharing mode. In the fixed risk sharing mode, the risk credit shared by the risk sharing object for the resource loaning product is fixed, for example, it can be shared according to a fixed amount, or it can be shared according to a fixed proportion. In the non-fixed risk sharing mode, the risk credit shared by the risk sharing object for the resource loaning product is not fixed, and can be automatically determined according to the attachment order and value information of the risk sharing object on the credit node, according to a certain allocation logic. For each risk sharing object, it can be attached to a credit node that needs to share the risk credit in the credit tree. When a credit node is attached to multiple risk sharing objects, the attachment order of the multiple risk sharing objects can be set. It should be noted that the strategy of how to allocate the risk attachment object to the credit node, determine the attachment order of the risk attachment object, and determine the risk sharing mode can be set by the risk subject, or can be set by the attachment personnel of the risk attachment object, or can be randomly set by the system, and is not limited in this regard.

[0094] The risk guarantee circle in the embodiment can refer to a closed loop structure of multi-to-multi cross guarantee formed by the same risk allocation object guaranteeing different nodes with different amounts under a non-fixed risk allocation mode. Specifically, the risk guarantee circle can be composed of different nodes with different amounts guaranteed by the same risk allocation object under a non-fixed risk allocation mode.

[0095] Specifically, there are many ways to determine whether there is a risk guarantee circle in the credit tree according to the risk allocation mode of the risk allocation object hung by each node in the credit tree, and the present embodiment is not limited in this regard. One of the ways to achieve this is to input the hanging relationship of each node in the credit tree and its risk allocation object, and the risk allocation mode of each risk allocation object hung by the node into a pre-trained guarantee circle detection model. The guarantee circle detection model can analyze whether there is a risk guarantee circle in the credit tree based on the input information.

[0096] Since the risk guarantee circle is composed of different nodes with different amounts guaranteed by the same risk allocation object under a non-fixed risk allocation mode, another way to achieve the present embodiment is to find all risk allocation objects belonging to a non-fixed risk allocation mode hung by the credit tree, i.e., target objects, and then analyze whether there is a case where the same target object is hung to different nodes according to the hanging relationship between the found target objects and the nodes. If there is, it is considered that there is a risk guarantee circle between different nodes hung with the same target object.

[0097] S202, if there is, data processing is performed on the nodes in the credit tree based on the risk guarantee circle.

[0098] Optionally, if S201 determines that there is a risk guarantee circle in the credit tree, it means that the hanging relationship of the risk allocation object of the non-fixed risk allocation mode on the nodes in the credit tree is complex. At this time, in order to simplify the data processing process of the nodes in the credit tree, the risk guarantee circle determined by S201 can be introduced to perform data processing on the nodes in the credit tree in units of risk guarantee circles.

[0099] Specifically, the way to perform data processing on the nodes in the credit tree based on the risk guarantee circle can include but is not limited to the following.

[0100] Method one: adjusting the hanging relationship of each node in the credit tree and the risk allocation object based on the risk guarantee circle, for example, for the nodes falling into the guarantee circle, adjusting the hung risk allocation object to reduce the case where the same risk allocation object is hung to multiple different nodes, i.e., reducing the probability of occurrence of the risk guarantee circle, thereby reducing the complexity of the hanging relationship between the nodes in the credit tree and the risk allocation object.

[0101] The second mode is to adjust the risk allocation mode of the risk allocation object connected to each credit node in the credit tree based on the risk guarantee circle. For example, for the same risk allocation object connected to different credit nodes in the risk guarantee circle, the risk allocation mode is adjusted to the fixed risk allocation mode. Since the risk allocation object of the fixed risk allocation mode has a fixed risk quota allocated to the credit node, a large amount of calculation is not required, and therefore, the complexity of the subsequent risk amount index calculation process of the credit node can be greatly reduced by modifying the mode.

[0102] The third mode is to calculate the risk quota of the risk allocation object connected to the credit node in the credit tree based on the risk guarantee circle. Specifically, since the risk allocation object of the fixed risk allocation mode has a fixed risk quota allocated to the connected credit node, the embodiment can be based on the risk guarantee circle and use a pre-set allocation logic to determine the risk quota of the same risk allocation object allocated to different credit nodes connected to each credit node in the risk guarantee circle. Optionally, the specific determination method will be described in detail in subsequent embodiments.

[0103] In the above data processing method, the risk guarantee circle existing in the credit tree is detected according to the risk allocation mode of the risk allocation object connected to the credit node in the credit tree, and the credit nodes in the credit tree are processed based on the detected risk guarantee circle. The present scheme introduces the risk guarantee circle and processes the credit nodes in the credit tree based on the risk guarantee circle. Compared with the prior art, which processes the credit nodes in the credit tree by cyclically traversing the credit nodes and the connected risk allocation objects, the complexity of the data processing process of the credit nodes is reduced, and the consumption of computing resources is saved.

[0104] Optionally, in the case where the credit tree contains a large number of credit nodes and each credit node is connected to a large number of risk allocation objects, it is difficult to analyze whether the same risk allocation object is connected to different credit nodes. Therefore, based on the above embodiments, how to determine whether the risk guarantee circle exists in the credit tree is further explained as shown in the following. Figure 3

[0105] S301, determining at least two target nodes from the credit tree according to the risk allocation mode of the risk allocation object connected to each credit node in the credit tree.

[0106] The target node is a credit node connected to a target object, and the target object is a risk allocation object of a non-fixed risk allocation mode.

[0107] ​Specifically, the risk allocation object of the non-fixed risk allocation mode can be searched from the credit tree as the target object, and then the credit node to which the target object is connected is further searched as the target object.

[0108] In S302, whether there is a risk guarantee circle in the credit tree is determined according to the overlapping condition between the target objects connected to each target node.

[0109] Specifically, for each determined target node, it is determined whether the target object connected to the target node overlaps with the target objects connected to other target nodes, and then whether there is a risk guarantee circle in the credit tree is determined according to the determination result. For example, if the target objects connected to at least two target nodes overlap, it is considered that the at least two target nodes constitute a risk guarantee circle.

[0110] Optionally, the embodiment can further introduce other judgment logic to determine whether the at least two target nodes constitute a risk guarantee circle in the case that the target objects connected to the at least two target nodes overlap. For example, for each target node, the object overlapping number between the target node and other target nodes is determined according to the overlapping condition between the target object connected to the target node and the target objects connected to other target nodes, and whether there is a risk guarantee circle in the credit tree is determined according to the object overlapping number corresponding to each target node. Specifically, for each target node, if the target objects connected to the target node and other target nodes overlap, the number of overlapping target objects, i.e., the object overlapping number, is determined. After the object overlapping number between each target node and other target nodes is determined, all the determined object overlapping numbers are further combined to analyze whether there is a risk guarantee circle in the credit tree. When the risk guarantee circle is determined in this way, the object overlapping number of the target objects connected to each target node and other target nodes is considered, which provides a new solution for the determination of the risk guarantee circle and guarantees the subsequent data processing of the credit nodes in the credit tree based on the risk guarantee circle.

[0111] In the embodiment, a part of target nodes are first selected from the credit tree, and then whether there is a risk guarantee circle is analyzed based on the target objects connected to the target nodes. For a credit tree with complex structure, the determination efficiency of the risk guarantee circle is greatly improved while ensuring the accuracy of the determination of the risk guarantee circle.

[0112] Optionally, in the above embodiment, for each target node, if the operation of determining whether there is a risk guarantee circle is performed according to the object overlap quantity between the target node and each of the other target nodes respectively, the same target node may be repeatedly determined to be a node in the risk guarantee circle, that is, the final determined risk guarantee circle may exist repeatedly. In order to solve this problem, the embodiment can specifically include the following steps when performing the operation of determining the object overlap quantity between the target node and each of the other target nodes according to the overlap between the target objects connected to the target node and the target objects connected to the other target nodes for each target node: determining whether the target node falls into the risk guarantee circle determined in the credit tree for each target node; if not, determining the object overlap quantity between the target node and each of the other target nodes according to the overlap between the target objects connected to the target node and the target objects connected to the other target nodes. Specifically, for the target node that is determined for the first time, since the risk guarantee circle judgment operation has not been performed before, the process of determining the object overlap quantity between the target node and each of the other target nodes according to the overlap between the target objects connected to the target node and the target objects connected to the other target nodes can be directly performed based on the target node. For any target node that is determined subsequently, it is necessary to first determine whether it falls into the risk guarantee circle that has been determined before, that is, whether it belongs to the target node in the risk guarantee circle that has been determined. If yes, the target node is skipped and the determination of whether the next target node falls into the risk guarantee circle determined in the credit tree is returned. If not, the process of determining the object overlap quantity between the target node and each of the other target nodes according to the overlap between the target objects connected to the target node and the target objects connected to the other target nodes is performed for the target node. Until all target nodes are analyzed.

[0113] In the embodiment, when the target node is traversed to determine the corresponding object overlap quantity, the target node that does not fall into the determined risk guarantee circle is calculated only, so as to avoid the repeated risk guarantee circle and reduce the power consumption of the risk guarantee circle determination process.

[0114] Figure 4A For another embodiment, a flowchart of the step of determining whether there is a risk guarantee circle in the credit tree, Figure 4B and Figure 4C For an embodiment, a schematic diagram of the credit tree having a risk allocation object connected thereto; the embodiment further explains how to determine whether there is a risk guarantee circle in the credit tree according to the object overlap quantity corresponding to each target node based on the above embodiment, which specifically includes the following steps:

[0115] S401, determining, according to a size relationship between the first quantity threshold and the object overlap quantity corresponding to each target node, whether there is a long-chain node and / or a ring-chain node in the quota tree, to obtain a node judgment result.

[0116] The first quantity threshold can be a pre-set fixed value, for example, can be 1. The long-chain node is a long-chain structure formed by two target nodes due to the same target object. As shown in FIG. 12, because node A and node B are connected to the same object 12, and node B and node C are connected to the same object 15, node A, node B and node C form a long-chain structure based on the connection of object 12 and object 15, and node A, node B and node C belong to the long-chain node. Figure 4B Figure 4C As shown in FIG. 13, because node E and node F are connected to the same object 21 and object 22, node E and node F form a ring-chain structure based on the connection of object 21 and object 22, and node E and node F belong to the ring-chain node.

[0117] It should be noted that the embodiment can only determine whether there is a long-chain node in the quota tree according to the size relationship between the first quantity threshold and the object overlap quantity corresponding to each target node. It can also be to only determine whether there is a ring-chain node in the quota tree. It can also be to simultaneously determine whether there is a long-chain node and a ring-chain node in the quota tree.

[0118] Optionally, the process of determining, according to the size relationship between the first quantity threshold and the object overlap quantity corresponding to each target node, whether there is a long-chain node in the quota tree can include:

[0119] Step A, selecting a first starting node from the target nodes, and adding the first starting node to the long-chain node set. Specifically, the embodiment can be to sequentially take each target node as the first starting node, and after the operation of steps A-D is performed for each first starting node, the next target node is taken as the first starting node, and the operation of steps A-D is repeated again. For example, assuming that node A in FIG. 11 is selected as the first starting node, node A can be added to the long-chain node set, that is, node A is taken as a long-chain node. Figure 4B

[0120] ​​Step B, determining a first screening node corresponding to a case that the number of object overlaps is the first number threshold according to the number of object overlaps corresponding to the first starting node. The first screening node is not included in the long chain node set. Specifically, it is determined in turn whether the number of object overlaps between the target object connected to the first starting node and the target object connected to each other target node is the first number threshold. If yes, it is further determined whether the other target object is included in the long chain node set. If not, the other target node is taken as the first screening node. For example, Figure 4B In this case, it is assumed that the first number threshold is 1. At this time, it is determined in turn whether the number of object overlaps between node A and node B, node A and node C, and node A and node D is 1. Since only the number of object overlaps between node A and node B is 1, and the long chain node set does not include node B at this time, node B is determined as the first screening node.

[0121] Step C, taking the first screening node determined in step B as a new first starting node, and adding the first screening node to the long chain node set. The operation of step B is returned to be executed, that is, the first screening node corresponding to a case that the number of object overlaps is the first number threshold is determined according to the number of object overlaps corresponding to the first starting node, until there is no new first screening node. For example, Figure 4B As shown in FIG. 4B, node B determined in step B is taken as a new first starting node, and node B is added to the long chain node set. The operation of step B is returned to be re-executed. At this time, the new first screening node determined is node C. Then, node C is taken as a new first starting node, and node C is added to the long chain node set. The operation of step B is returned to be re-executed. At this time, since there is no overlapping target object between node C and node D, and although there is an overlapping target object between node A and node B, node A and node B already belong to the nodes in the long chain node set. Therefore, at this time, there is no new first screening node, that is, the loop ends. At this time, the long chain node set includes node A, node B and node C.

[0122] Step D, taking the nodes included in the long chain node set as long chain nodes to obtain a node judgment result. Specifically, the node judgment result can include but is not limited to whether there is a long chain node, and which nodes are the long chain nodes. For example, Figure 4B The corresponding node judgment result can be three long chain nodes, which are node A, node B and node C.

[0123] The process of determining whether there is a ring chain node in the quota tree according to the size relationship between the first number threshold and the number of object overlaps corresponding to each target node can include:

[0124] Step E, selecting a second starting node from the target nodes, and adding the second starting node to the ring chain node set. Specifically, the embodiment can be to sequentially take each target node as the second starting node, and perform the operations of steps E-H for each second starting node, and then take the next target node as the second starting node, and repeat the operations of steps E-H again. For example, assuming that node E in the figure is selected as the second starting node, node E can be added to the ring chain node set first, that is, node E is taken as a ring chain node. Figure 4C

[0125] Step F, determining the second screening node corresponding to the object overlap quantity greater than the first quantity threshold value according to the object overlap quantity corresponding to the second starting node. The second screening node is not included in the ring chain node set.

[0126] Specifically, it is determined whether the object overlap quantity between the target object hung by the second starting node and the target object hung by each other target node is greater than the first quantity threshold value, and if so, it is determined whether the other target object is included in the ring chain node set, and if not, the other target node is taken as the second screening node. For example, Figure 4C In the figure, assuming that the first quantity threshold value is 1, it can be determined whether the object overlap quantity between node E and node F, node E and node G, node E and node H, and node E and node I is greater than 1. Since the object overlap quantity between node E and node F is 2, the object overlap quantity between node E and node G is also 2, and the ring chain node set does not include node F and node G at this time, it is determined that node F and node G are the second screening nodes.

[0127] Step G, taking the second screening node determined in step F as a new second starting node, and adding the second screening node to the ring chain node set, returning to perform the operation of step B of determining the second screening node corresponding to the object overlap quantity greater than the first quantity threshold value according to the object overlap quantity corresponding to the second starting node until no new second screening node appears. For example, Figure 4C As shown in the figure, node F and node G determined in step F are taken as two new second starting nodes respectively, and node F and node G are added to the ring chain node set, and the operation of step B is re-executed, and the new second screening node determined at this time is node H; node H is taken as a new second starting node, and node H is added to the ring chain node set, and the operation of step B is re-executed, and no new second screening node appears at this time, that is, the loop ends, and the ring chain node set at this time includes node E, node F, node G and node H.

[0128] ​Step H, taking the nodes included in the ring chain node set as ring chain nodes, to obtain a node judgment result. Specifically, the node judgment result can include but is not limited to: whether there are ring chain nodes, and which nodes are ring chain nodes. For example, if the node judgment result of the pair is that there are four ring chain nodes, namely, nodes E, F, G, and H. Figure 4C The node judgment result of the pair can be that there are four ring chain nodes, namely, nodes E, F, G, and H.

[0129] S402, determining, according to the node judgment result, whether there is a long chain guarantee relationship and / or a ring chain guarantee relationship in the credit tree, to obtain a relationship determination result.

[0130] The long chain guarantee relationship refers to a chain-shaped guarantee relationship formed by different long chain nodes due to being guaranteed by the same target object, and the ring chain guarantee relationship refers to a ring-shaped guarantee relationship formed by different ring chain nodes due to being guaranteed by multiple same target objects.

[0131] Optionally, for the judgment result determined in steps A-D, this step can be determining, according to the node judgment result, the number of long chain nodes, and determining, according to the number of long chain nodes and the total number of target objects to which the long chain nodes are connected, whether there is a long chain guarantee relationship in the credit tree. Specifically, according to the node judgment result of the long chain nodes, it is determined whether the number of long chain nodes is greater than a second number threshold and whether the total number of target objects to which the multiple long chain nodes are connected is greater than a third number threshold. If both conditions are met, it is considered that the multiple long chain nodes constitute a long chain guarantee relationship, that is, the relationship determination result is that there is a long chain guarantee relationship in the long chain nodes in the credit tree.

[0132] For the judgment result determined in steps E-H, this step can be determining, according to the node judgment result, the number of ring chain nodes, and determining, according to the number of nodes, whether there is a ring chain guarantee relationship in the credit tree. Specifically, according to the node judgment result of the ring chain nodes, it is determined whether the number of ring chain nodes is greater than a fourth number threshold. If yes, it is considered that the multiple ring chain nodes constitute a ring chain guarantee relationship, that is, the relationship determination result is that there is a ring chain guarantee relationship in the ring chain nodes in the credit tree.

[0133] It should be noted that the sizes of the first number threshold, the second number threshold, the third number threshold, and the fourth number threshold in this embodiment can be determined according to requirements, and can be the same or different, which is not limited.

[0134] S403, determining, according to the relationship determination result, whether there is a risk guarantee circle in the credit tree.

[0135] Optionally, when determining whether the risk guarantee circle exists in the quota tree according to the relationship determination result, it can be determined whether the relationship determination result is at least one of the long-chain guarantee relationship and the ring-chain guarantee relationship, and if so, it is considered that the risk guarantee relationship exists in the quota tree.

[0136] Optionally, the first quantity threshold and the number of objects corresponding to each target node are used to determine whether the long-chain node and / or the ring-chain node exists in the quota tree, and then determine whether the long-chain guarantee relationship and / or the ring-chain guarantee relationship exists, and finally determine whether the risk guarantee circle exists according to the analysis results of the long-chain guarantee relationship and the ring-chain guarantee relationship. Since the process of determining the risk guarantee circle considers both the long-chain guarantee relationship and the ring-chain guarantee relationship, the determined risk guarantee circle is more comprehensive. In addition, the embodiment also provides an optional implementation manner for analyzing the long-chain node and the ring-chain node, and the long-chain guarantee relationship and the ring-chain guarantee relationship. This manner analyzes the long-chain guarantee relationship and the ring-chain guarantee relationship with a wider coverage, thereby reducing the number of risk guarantee circles and improving the breadth of the risk guarantee circle.

[0137] Optionally, in order to further ensure the structural complexity of the determined risk guarantee circle, one optional manner of the embodiment for determining whether the risk guarantee circle exists in the quota tree according to the relationship determination result in S403 is as follows: if the relationship determination result is that the long-chain guarantee relationship and / or the ring-chain guarantee relationship exists, the guarantee complexity of the long-chain guarantee relationship and / or the ring-chain guarantee relationship is determined; if the guarantee complexity is greater than the complexity threshold, it is determined that the risk guarantee circle exists in the quota tree.

[0138] Specifically, the guarantee complexity of the long-chain guarantee relationship can be determined according to the number of nodes of the long-chain node included in the long-chain guarantee relationship and the number of target objects connected by the long-chain node. For example, if the number of nodes of the long-chain node is N1, and the sum of the number of target objects connected by all long-chain nodes is P1, the guarantee complexity of the long-chain guarantee relationship can be (N1+P1).

[0139] The guarantee complexity of the ring chain guarantee relationship is determined according to the number of ring chain nodes contained in the ring chain guarantee relationship and the number of target objects to which the ring chain nodes are hung. For example, if the number of ring chain nodes is N2 and the sum of the number of target objects to which all ring chain nodes are hung is P2, when the data of the quota nodes in the quota tree is processed by means of circularly traversing the quota nodes and the risk allocation objects hung by the quota nodes, the calculation process of the risk amount of the quota nodes needs to traverse and calculate the ring chain nodes and the target objects in the risk guarantee circle once, and the calculation process of the risk allocation amount of the target objects for each ring chain node also needs to traverse and calculate the ring chain nodes and the target objects once. Therefore, when the risk guarantee circle of the ring chain guarantee relationship is processed by using the existing calculation, the guarantee complexity is (N+P) 2 .

[0140] In the process of determining the risk guarantee circle, the guarantee complexity of the long chain guarantee relationship and / or the ring chain guarantee relationship is introduced in the embodiment, which ensures that the determined risk guarantee circle is composed of long chain nodes and / or ring chain nodes with complex guarantee relationships. Since the quota nodes with complex guarantee relationships are the key to the complexity of the data processing process of the quota nodes in the quota tree, the risk guarantee circle with complex guarantee relationships is determined in the embodiment to assist in the data processing of the quota nodes with complex guarantee relationships, which greatly improves the data processing efficiency and saves the consumption of computing resources.

[0141] Figure 5 For the flowchart of the data processing method in another embodiment, the embodiment further explains how to process the data of the quota nodes in the quota tree based on the risk guarantee circle on the basis of the above-mentioned embodiment, specifically including:

[0142] S501, determining whether there is a risk guarantee circle in the quota tree according to the risk allocation mode of the risk allocation objects hung by each quota node in the quota tree.

[0143] The risk guarantee circle is composed of different quota nodes guaranteed by the same risk allocation object under a non-fixed risk allocation mode.

[0144] S502, if there is, outputting prompt information containing the nodes of the guarantee circle according to the risk guarantee circle, the prompt information being used to prompt the adjustment of the hanging of the risk allocation objects of the quota tree.

[0145] The guarantee circle node is a quota node falling into the risk guarantee circle. The prompt information can be prompt information for prompting a linking party (such as a linking personnel of the risk allocation object) of the risk allocation object to adjust the linking relationship of the risk allocation object linked by the guarantee circle node. The prompt information at least includes the quota node falling into the risk guarantee circle, that is, the guarantee circle node. The prompt information can also include the risk allocation object of the non-fixed risk allocation mode linked by the guarantee circle node, that is, the target object.

[0146] Optionally, after the risk guarantee circle is determined in S501, the quota node constituting the risk guarantee circle, that is, the guarantee circle node, and the risk allocation object of the non-fixed risk allocation mode linked by the guarantee circle node, that is, the target object, can be recorded in a preset storage space, such as a guarantee circle structure. At this time, the prompt information at least containing the guarantee circle node can be generated based on the recording of the above information in the preset storage space. Optionally, the target object linked by the guarantee circle node can also be added to the prompt information.

[0147] When the prompt information is output, the local output device (such as a display screen) can be used to output the prompt information. The prompt information can also be output to a subsequent process for adjusting the linking relationship of the risk allocation object of the quota tree. The prompt information can also be sent to the terminal device of the linking personnel for adjusting the linking relationship of the risk allocation object, so that the terminal device of the linking personnel displays the prompt information to the linking personnel.

[0148] The process of the embodiment can be performed after the risk allocation object is linked to the quota node in the quota tree, that is, in the linking stage of the risk allocation object. Whether the risk guarantee circle exists in the quota tree to which the risk allocation object is linked is determined. If the risk guarantee circle exists, the guarantee circle node falling into the risk guarantee circle is output to prompt the linking personnel of the risk allocation object or a related process to adjust the risk allocation object linked by the guarantee circle node in the quota tree, so as to reduce the occurrence of the risk guarantee circle in the quota tree, and thus to reduce the occurrence of the risk guarantee circle, thereby providing a guarantee for subsequent rapid and accurate calculation of the risk amount index of each quota node in the quota tree. In addition, compared with the prior art of circularly traversing each quota node in the quota tree, the complexity of the adjustment of the linking relationship of the risk allocation object is reduced, and the adjustment efficiency is improved.

[0149] Figure 6A The flowchart of the data processing method in another embodiment is shown in FIG. 2. Figure 6B The quota tree linked with the risk allocation object in another embodiment is shown in FIG. 2. Based on the above embodiment, the process of how to perform data processing on the quota node in the quota tree based on the risk guarantee circle is further explained and described. Specifically, the process includes the following steps:

[0150] S601, determining whether there is a risk guarantee circle in the credit tree according to a risk allocation mode of a risk allocation object hung by each credit node in the credit tree.

[0151] The risk guarantee circle is composed of different credit nodes guaranteed by the same risk allocation object in a non-fixed risk allocation mode.

[0152] For example, based on the above-mentioned implementation mode, it can be determined that Figure 6B In the credit tree shown, node 1, node 2 and node 5 fall into the risk guarantee circle, that is, node 1, node 2 and node 5 belong to the guarantee circle nodes, and correspondingly, object A and object B hung by node 1 in a non-fixed allocation mode belong to the target objects corresponding to node 1; object A, object B, object D and object E hung by node 2 in a non-fixed allocation mode belong to the target objects corresponding to node 2; object D and object E hung by node 5 in a non-fixed allocation model belong to the target objects corresponding to node 5.

[0153] S602, if there is, determining the target objects hung by the guarantee circle nodes as the risk quota allocated by the guarantee circle nodes according to the risk guarantee circle.

[0154] The guarantee circle node is a credit node falling into the risk guarantee circle; and the target object is a risk allocation object in a non-fixed risk allocation mode.

[0155] Optionally, the prior art usually starts from the dimension of the credit node to analyze the risk allocation objects hung thereon as the risk quota allocated thereby. However, since the hanging relationship of the target objects of the guarantee circle nodes is complex, if the dimension of the guarantee circle node is still used to determine the target objects hung thereby as the risk quota allocated thereby, the calculation amount is complex, and a dead loop may occur, and no calculation result may appear. Therefore, in view of the problem, the present embodiment can directly analyze how much risk quota each risk object hung by the multiple guarantee circle nodes allocates according to the related information (such as value information, hanging sequence and discount rate) of each risk object and the risk quota to be allocated by each guarantee circle node according to a preset calculation logic from the dimension of the risk object. The specific implementation process will be described in detail in subsequent embodiments.

[0156] S603, performing structural reduction on the credit tree according to the guarantee circle nodes and the target objects hung by the guarantee circle nodes, to obtain a reduced tree.

[0157] Optionally, this embodiment may determine whether each guarantee circle node has only a target object attached to it in the credit limit tree. If the guarantee circle node has only a target object attached to it in the credit limit tree, then the guarantee circle node and the target object attached to it are deleted from the credit limit tree. If the guarantee circle node also has other risk-sharing objects (i.e., risk-sharing objects with a fixed risk-sharing mode) attached to it in the credit limit tree, then the target object attached to it is deleted from the credit limit tree.

[0158] For example, such as Figure 6B As shown, the guarantee circle nodes include node 1, node 2, and node 5. Nodes 1 and 5 are connected to target objects (i.e., risk-sharing objects with non-fixed risk-sharing modes). Therefore, node 1 and its connected objects A and B can be deleted from the credit limit, and node 5 and its connected objects D and E can be deleted from the credit limit tree. For node 2, in addition to connecting to target objects (objects A, B, D, and E), it also connects to a risk-sharing object with a fixed risk-sharing mode (object C). In this case, node 2 is not deleted from the credit limit tree; only objects A, B, D, and E connected to node 2 are deleted. The resulting pruning tree contains node 2 and its connected object C, node 3 and its connected objects F and G, and node 4 and its connected object H.

[0159] This embodiment employs different deletion logics depending on whether the guarantee circle node is attached to a risk-sharing object with a fixed risk-sharing mode. It flexibly executes the structural deletion operation of the quota tree, which can remove related guarantee branches with complex guarantee relationships while deleting as few quota trees as possible. This provides a guarantee for the subsequent rapid and accurate calculation of the unsecured risk amount of the quota node.

[0160] S604, determine the amount of unsecured risk for each quota node in the pruning tree.

[0161] The unsecured risk amount of a credit limit node can be the total risk amount that the credit limit node needs to bear, minus the risk amount that each risk-sharing object attached to it can share for it, and the remaining unsecured risk amount.

[0162] After the quota is pruned through S603, the risk allocation objects hung by each quota node in the pruned tree include two types, one is the risk allocation object of the fixed risk allocation mode (i.e. the first type of object), and the other is the risk allocation object of the non-fixed risk allocation mode without the overlapping guarantee phenomenon (i.e. the second type of object). At this time, each quota node in the pruned tree can be traversed in turn to determine whether the risk allocation object hung by the quota node belongs to the first type of object or the second type of object. For the first type of object, since the risk allocation mode is fixed, the risk quota allocated to the quota node by the first type of object can be determined according to the fixed allocation amount or allocation ratio. For example, for the object C hung by the node 2 in Figure 6B , the risk quota allocated to the node 2 by the object C is 1 million, the risk quota allocated to the node 3 by the object F is 200 thousand, and the risk quota allocated to the node 4 by the object H is 1 million.

[0163] For the second type of object, since there is no repeated guarantee phenomenon of other quota nodes, the risk quota that can be allocated to the quota node by the second type of object can be calculated based on the preset calculation rule of the automatic allocation quota, according to one or more of the value information, the hanging sequence, and the discount rate of the second type of object, and the risk quota that still needs to be allocated to the quota node after the risk quota allocated by the first type of object is removed. For example, for the object G hung by the node 3 in Figure 6B , since the object F has allocated 200 thousand, the risk quota that still needs to be allocated is 800 thousand. At this time, the risk quota allocated to the node 3 by the object G can be obtained based on the value of the object G itself and the discount rate according to the formula: target object allocated risk quota = target object value information * target object discount rate.

[0164] For each quota node, after the risk quota that can be allocated to the quota node by the first type of object and the second type of object is obtained, the unguaranteed risk amount of the quota node can be calculated based on the following formula: unguaranteed risk amount = total risk amount that needs to be borne by the quota node - ∑ risk quota allocated to the quota node by the hung risk allocation objects. That is, the total risk amount that needs to be borne by the quota node is subtracted by the risk quota that can be allocated to the quota node by the first type of object, and then subtracted by the risk quota that can be allocated to the quota node by the second type of object, and the result is the unguaranteed risk amount of the quota node.

[0165] For example, for the node 3 in Figure 6BNode 2 in the guarantee circle, the total risk amount it needs to bear 5 million, minus the 1 million allocated by object C, the remaining 4 million is the unsecured risk amount of node 2 in the deletion tree. For node 3, assuming that the risk amount allocated by object G is 0.5 million, at this time the total risk amount it needs to bear 1 million, minus the 0.2 million allocated by object F and the 0.5 million allocated by object G, the remaining 0.3 million is the unsecured risk amount of node 3 in the deletion tree. For node 4, the total risk amount it needs to bear 2 million, minus the 1 million allocated by object H, the remaining 1 million is the unsecured risk amount of node 4 in the deletion tree.

[0166] S605, according to the risk amount allocated by the target object hung by the guarantee circle node for the guarantee circle node, and the unsecured risk amount of each amount node in the deletion tree, determine the unsecured risk amount of each amount node in the amount tree.

[0167] Optionally, this step can be for each amount node in the amount tree, determine whether it belongs to the guarantee circle node or the amount node in the deletion tree. If it only belongs to the guarantee circle node, the risk amount to be allocated by the amount node (i.e. the total risk amount it needs to bear) can be subtracted from the risk amount that can be allocated by the target object hung by the guarantee circle node, to obtain the unsecured risk amount of the amount node in the amount tree. It should be noted that the risk amount that can be allocated by the target object hung by the guarantee circle node can refer to the risk amount allocated by the target object hung by the guarantee circle node for the guarantee circle node.

[0168] If the amount node only belongs to the amount node in the deletion tree, the unsecured risk amount of the amount node in the deletion tree can be taken as the unsecured risk amount of the amount node in the amount tree.

[0169] If the amount node belongs to both the guarantee circle node and the amount node in the deletion tree, the unsecured risk amount of the amount node in the deletion tree can be subtracted from the risk amount that can be allocated by the target object hung by the guarantee circle node, to obtain the unsecured risk amount of the amount node in the amount tree.

[0170] For example, as shown in FIG. 6, the unsecured risk amount of each amount node in the amount tree can be determined as follows. Figure 6BAs shown, it is assumed that the risk quota of object A allocated by node 1 is 500,000, and the risk quota of object A allocated by node 2 is 500,000; the risk quota of object B allocated by node 1 is 200,000, and the risk quota of object B allocated by node 2 is 300,000, the risk quota of object D allocated by node 2 is 300,000, and the risk quota of object D allocated by node 5 is 800,000, the risk quota of object E allocated by node 2 is 200,000, and the risk quota of object E allocated by node 5 is 500,000. At this time, the unsecured risk amount of node 1 in the quota tree is: 1,000,000 minus 500,000 and 200,000, respectively, to get 30,000 as the unsecured risk amount of node 1; the unsecured risk amount of node 2 is: 4,000,000 determined by S604, minus 500,000, 300,000, 30,000 and 20,000, respectively, to get 270,000 as the final unsecured risk amount of node 2. The unsecured risk amount of node 3 is 30,000 determined by S604. The unsecured risk amount of node 4 is 1,000,000 determined by S604.

[0171] The process of the embodiment can be performed when calculating the unsecured risk amount index of the quota node in the quota tree, that is, in the unsecured risk amount index calculation stage, after the complex guarantee structure branch of the quota tree is pruned according to the risk guarantee circle, the calculation of the unsecured risk amount is performed according to the conventional method, for the pruned guarantee circle node and the target object connected thereto, the risk quota of each target object is calculated separately, and then based on the risk quota of the target object in the guarantee circle and the unsecured risk amount of the quota node in the pruned tree, the unsecured risk amount of each quota node in the complete quota tree is determined. Since the risk quota of each target object in the risk guarantee circle is calculated separately in the embodiment, the complexity of the unsecured risk amount calculation process is greatly reduced, and the calculation efficiency is improved.

[0172] Figure 7 For a flowchart of the process of determining the risk quota of the target object connected to the guarantee circle node allocated by the guarantee circle node in an embodiment, the embodiment further explains and describes the process of determining the risk quota of the target object connected to the guarantee circle node allocated by the guarantee circle node based on the above-mentioned embodiment, which specifically includes:

[0173] S701, determining the quota allocation priority of the target object according to at least one of the value information, the connection order or the discount rate of the target object connected to the guarantee circle node.

[0174] The value information of the target object can be the amount equivalent to the target object. The connection order can be the connection order of the target object to the guarantee circle node. For example, Figure 6BThe node 1 in the figure has two target objects, object A and object B, attached thereto. The attachment order of object A is 1, and the attachment order of object B is 2. The discount rate can be the proportion of the value decrease of the target object due to damage or devaluation. The quota allocation priority of the target object can be the priority of the plurality of target objects for allocating the risk quota of the guarantee circle node.

[0175] Optionally, the process of determining the quota allocation priority of the target object according to at least one of the value information, the attachment order or the discount rate of the target object attached to the guarantee circle node in the embodiment can include but is not limited to: if the quota allocation priority of the target object is determined according to any one of the value information, the attachment order and the discount rate, the priority can be directly proportional or inversely proportional to the value; the priority can also be directly proportional or inversely proportional to the attachment order; the priority can also be directly proportional or inversely proportional to the discount rate. If the quota allocation priority of the target object is determined according to at least two of the value information, the attachment order and the discount rate, the value information, the attachment order and the discount rate can be sorted first, for example, the value information is sorted before the attachment order, and the attachment order is sorted before the discount rate. At this time, the target objects can be sorted according to the comparison item in the first sorting position, i.e. the value information. For the target objects with the same value information, the target objects are sorted according to the comparison item in the next sorting position, i.e. the attachment order. For the target objects with the same attachment order, the target objects are sorted according to the comparison item in the next sorting position, i.e. the discount rate. For the sorted target objects, the higher the sorting position, the higher the corresponding quota allocation priority.

[0176] S702, determining the risk quota allocated to the target object attached to the guarantee circle node for the guarantee circle node according to the risk quota to be allocated by the guarantee circle node, the value information of the target object and the quota allocation priority.

[0177] The risk quota to be allocated by the guarantee circle node can be all the risk quotas that the guarantee circle node needs to be allocated by one or more target nodes attached to the guarantee circle node. Specifically, if the guarantee circle node only attaches target objects, the risk quota to be allocated is the total risk quota of the guarantee circle node, for example, Figure 6B The node 1 in the figure is a guarantee circle node, and its corresponding total risk quota is 1 million. The object A and the object B attached to the node 1 are both target objects. At this time, the risk quota to be allocated by the node 1 is 1 million. If the guarantee circle node also attaches a risk allocation object of a fixed risk allocation mode, the risk quota to be allocated can be the remaining risk quota after the total risk quota of the guarantee circle node is reduced by the risk quota that can be allocated by the risk allocation object of the fixed risk allocation mode. For example, Figure 6BThe node 2 in the guarantee circle is a guarantee circle node, and the corresponding total risk amount of the node 2 is 5 million. The object C connected to the node 2 is a non-target object, and the remaining connected objects are target objects. At this time, the risk amount to be allocated by the node 2 is 4 million.

[0178] Optionally, in the embodiment, the process of determining the target objects connected to the guarantee circle nodes as the risk amounts allocated by the guarantee circle nodes can be: for all the target objects connected to each guarantee circle node, in the order from high to low of the amount allocation priority, for each target object, according to the value information of the target object, the connection order of the target object under different guarantee circle nodes and the discount rate, and the risk amount to be allocated by the guarantee circle node connected to the target object, the risk amount allocated by each guarantee circle node connected to the target object is determined according to a preset allocation calculation rule. For example, the value information of the target object can be multiplied by the discount rate to obtain the actual value of the target object, and then the connection order of the target object under different guarantee circle nodes is determined to determine the proportion of the risk amount allocated by the different guarantee circle nodes connected to the target object, and then the actual value of the target object is combined to obtain the risk amount allocated by each guarantee circle node connected to the target object.

[0179] In the embodiment, the amount allocation priority of the target objects connected to the guarantee circle nodes is determined, and the risk amount allocated by each guarantee circle node connected to each target object is analyzed from the dimension of the target object in the order of the amount allocation priority. This provides a new solution for determining the amount allocation mode between the guarantee circle nodes with complex guarantee relationships and the target objects connected to the guarantee circle nodes. Compared with the prior art, the amount allocation mode is determined from the dimension of the amount node, and the target objects and the amount nodes connected to the target objects are iterated, which greatly reduces the complexity of the calculation process and saves the consumption of computing resources.

[0180] Figure 8 For another flowchart of the data processing method, the embodiment provides an optional implementation manner of data processing based on the amount nodes in the amount tree and the risk allocation objects connected to the amount nodes. Specifically, the embodiment includes the following steps:

[0181] S801, determining at least two target nodes from the amount tree according to the risk allocation mode of the risk allocation objects connected to the amount nodes in the amount tree.

[0182] The target node is an amount node connected to a target object, and the target object is a risk allocation object with a non-fixed risk allocation mode.

[0183] S802, for each target node, it is judged whether the target node falls into the determined risk guarantee circle in the credit tree, if yes, for the next target node, the operation of S802 is executed, if not, S803 is executed.

[0184] S803, if not, according to the overlapping condition between the target object connected by the target node and the target object connected by other target nodes, the object overlapping quantity between the target node and other target nodes is determined respectively.

[0185] S804, according to the size relationship between the first quantity threshold and the object overlapping quantity corresponding to each target node, it is determined whether there is a long chain node and / or a ring chain node in the credit tree, and the node judgment result is obtained.

[0186] Further, the optional implementation mode of the step of determining whether there is a long chain node in the credit tree is that: a first starting node is selected from the target nodes, and the first starting node is added to the long chain node set; according to the object overlapping quantity corresponding to the first starting node, a first screening node corresponding to the case that the object overlapping quantity is the first quantity threshold is determined; wherein the first screening node is not included in the long chain node set; the first screening node is taken as a new first starting node, and the first screening node is added to the long chain node set, and the operation of determining the first screening node corresponding to the case that the object overlapping quantity is the first quantity threshold according to the object overlapping quantity corresponding to the first starting node is executed, until there is no new first screening node; the nodes included in the long chain node set are taken as long chain nodes, and the node judgment result is obtained.

[0187] The optional implementation mode of the step of determining whether there is a ring chain node in the credit tree is that: a second starting node is selected from the target nodes, and the second starting node is added to the ring chain node set; according to the object overlapping quantity corresponding to the second starting node, a second screening node corresponding to the case that the object overlapping quantity is greater than the first quantity threshold is determined; wherein the second screening node is not included in the ring chain node set; the second screening node is taken as a new second starting node, and the second screening node is added to the ring chain node set, and the operation of determining the second screening node corresponding to the case that the object overlapping quantity is greater than the first quantity threshold according to the object overlapping quantity corresponding to the second starting node is executed, until there is no new second screening node; the nodes included in the ring chain node set are taken as ring chain nodes, and the node judgment result is obtained.

[0188] It should be noted that if according to the node judgment result, it is determined that there is no long chain node and no ring chain node in the credit tree, the subsequent operation is not executed, but for the next target node, the operation of S802 is executed.

[0189] S805, determining, according to the node judgment result, whether there is a long chain guarantee relationship and / or a ring chain guarantee relationship in the quota tree, to obtain a relationship determination result;

[0190] Further, the manner of determining whether there is a long chain guarantee relationship in the quota tree can be: determining the number of nodes of the long chain node according to the node judgment result, and determining whether there is a long chain guarantee relationship in the quota tree according to the number of nodes and the total number of target objects to which the long chain node is connected.

[0191] The manner of determining whether there is a ring chain guarantee relationship in the quota tree can be: determining the number of nodes of the ring chain node according to the node judgment result; and determining whether there is a ring chain guarantee relationship in the quota tree according to the number of nodes.

[0192] It should be noted that if it is determined according to the relationship judgment result that there is no long chain guarantee relationship and no ring chain guarantee relationship in the quota tree, the subsequent operation is not performed, but the operation of S802 is returned for the next target node.

[0193] S806, if the relationship determination result is that there is a long chain guarantee relationship and / or a ring chain guarantee relationship, the guarantee complexity of the long chain guarantee relationship and / or the ring chain guarantee relationship is determined.

[0194] Further, one optional implementation manner of the present step is: determining the guarantee complexity of the long chain guarantee relationship according to the number of nodes of the long chain node contained in the long chain guarantee relationship and the number of target objects to which the long chain node is connected; and / or, determining the guarantee complexity of the ring chain guarantee relationship according to the number of nodes of the ring chain node contained in the ring chain guarantee relationship and the number of target objects to which the ring chain node is connected.

[0195] S807, determining whether the guarantee complexity is greater than a complexity threshold value, if yes, performing S808, and if no, returning to perform the operation of S802 for the next target node.

[0196] S808, if the guarantee complexity is greater than the complexity threshold value, it is determined that there is a risk guarantee circle in the quota tree.

[0197] S809, determining the quota allocation priority of the target object according to at least one of the value information, the connection order or the discount rate of the target object to which the guarantee circle node in the risk guarantee circle is connected.

[0198] Among them, the guarantee circle node is the quota node falling into the risk guarantee circle; the target object is a risk allocation object of a non-fixed risk allocation mode;

[0199] S810, determining, according to the risk quota to be shared by the guarantee circle node, the value information of the target object and the quota sharing priority, the target object to which the guarantee circle node is connected as the risk quota to be shared by the guarantee circle node.

[0200] S811, performing structural reduction on the quota tree according to the guarantee circle node and the target object to which the guarantee circle node is connected, to obtain a reduced tree.

[0201] Further, an optional implementation manner of the step of reducing the quota tree is that if the guarantee circle node only connects the target object in the quota tree, the guarantee circle node and the target object to which the guarantee circle node is connected are deleted in the quota tree. If the guarantee circle node also connects other risk sharing objects except the target object in the quota tree, the target object to which the guarantee circle node is connected is deleted in the quota tree.

[0202] S812, determining the unsecured risk amount of each quota node in the reduced tree.

[0203] S813, determining the unsecured risk amount of each quota node in the quota tree according to the risk quota to be shared by the target object to which the guarantee circle node is connected and the unsecured risk amount of each quota node in the reduced tree.

[0204] Optionally, the embodiment can further comprise, after S808, determining that the risk guarantee circle exists in the quota tree, outputting prompt information containing the guarantee circle node according to the risk guarantee circle, wherein the prompt information is used to prompt the connection adjustment of the risk sharing object of the quota tree; and the guarantee circle node is the quota node falling into the risk guarantee circle.

[0205] The specific processes of S801-S813 can be referred to the description of the above method embodiments, which have similar implementation principles and technical effects, and will not be described here.

[0206] It should be understood that, although each step in the flowchart involved in the above embodiments is displayed in sequence according to the arrow, these steps are not necessarily executed in sequence according to the arrow. Unless otherwise specified herein, the execution of these steps has no strict sequence limitation, and these steps can be executed in other sequences. Moreover, at least part of the steps in the flowchart involved in the above embodiments can include multiple steps or stages, which are not necessarily executed at the same time, but can be executed at different times, and the execution sequence of these steps or stages is not necessarily sequential, but can be executed in rotation or alternation with other steps or steps or stages in other steps.

[0207] Based on the same inventive concept, this application also provides a data processing apparatus for implementing the data processing method described above. The solution provided by this apparatus is similar to the implementation scheme and beneficial effects described in the above method. Therefore, the specific limitations in one or more data processing apparatus embodiments provided below can be found in the limitations of the data processing method described above, and will not be repeated here.

[0208] In one embodiment, such as Figure 9 As shown, a data processing device 1 is provided, comprising: a determining module 1 and a processing module 2, wherein:

[0209] The determination module 10 is used to determine whether there is a risk guarantee circle in the credit limit tree based on the risk sharing mode of the risk sharing object attached to each credit limit node in the credit limit tree; wherein, the risk guarantee circle consists of different credit limit nodes guaranteed by the same risk sharing object under the non-fixed risk sharing mode;

[0210] Processing module 20 is used to process the data of the credit limit nodes in the credit limit tree based on the risk guarantee circle if they exist.

[0211] In one embodiment, such as Figure 10 As shown, above Figure 9 The determining module 10 may include:

[0212] The first determining unit 11 is used to determine at least two target nodes from the credit tree according to the risk sharing mode of the risk sharing objects attached to each credit node in the credit tree. The target nodes are credit nodes attached to target objects; the target objects are risk sharing objects with non-fixed risk sharing modes.

[0213] The second determining unit 12 is used to determine whether there is a risk guarantee circle in the quota tree based on the overlap between the target objects attached to each target node.

[0214] In one embodiment, such as Figure 11 As shown, above Figure 10 The second determining unit 12 may include:

[0215] The first determining subunit 121 is used to determine, for each target node, the number of objects overlapping between the target node and other target nodes based on the overlap between the target objects attached to the target node and the target objects attached to other target nodes.

[0216] The second determining subunit 122 is used to determine whether there is a risk guarantee circle in the quota tree based on the number of overlapping objects corresponding to each target node.

[0217] In one embodiment, such as Figure 12 As shown, aboveFigure 11 The second determining subunit 122 may include:

[0218] The node judgment unit 1221 is used to determine whether there are long chain nodes and / or ring chain nodes in the quota tree based on the size relationship between the first quantity threshold and the number of overlapping objects corresponding to each target node, and to obtain the node judgment result.

[0219] The relationship determination unit 1222 is used to determine whether there is a long-chain guarantee relationship and / or a ring-chain guarantee relationship in the credit limit tree based on the node determination result, and obtain the relationship determination result;

[0220] The guarantee circle determination, starting from unit 1223, is used to determine the result based on the relationship and to determine whether a risk guarantee circle exists in the credit limit tree.

[0221] In one embodiment, above Figure 12 The node determination in unit 1221 is specifically used for:

[0222] Select a first starting node from the target nodes and add the first starting node to the long chain node set;

[0223] Based on the number of overlapping objects corresponding to the first starting node, determine the first filter node corresponding to the number of overlapping objects being a first threshold; wherein, the first filter node is not included in the long chain node set;

[0224] The first filter node is used as the new first starting node, and the first filter node is added to the long chain node set. Then, the operation of the first filter node corresponding to the first number threshold when the number of object overlap is determined based on the number of object overlap corresponding to the first starting node is executed, until no new first filter node appears.

[0225] The nodes contained in the long chain node set are taken as long chain nodes, and the node judgment result is obtained.

[0226] In one embodiment, above Figure 12 The relation judgment in unit 1222 is specifically used for:

[0227] Based on the node judgment results, determine the number of nodes in the long chain;

[0228] Based on the number of nodes and the total number of target objects connected to the long chain nodes, determine whether a long chain guarantee relationship exists in the quota tree.

[0229] In one embodiment, above Figure 12 The node determination in unit 1221 is also specifically used for:

[0230] Select a second starting node from the target nodes and add the second starting node to the ring chain node set;

[0231] Based on the number of overlapping objects corresponding to the second starting node, determine the second filtering node when the number of overlapping objects is greater than the first threshold; wherein, the second filtering node is not included in the set of ring chain nodes;

[0232] The second filter node is used as the new second starting node, and the second filter node is added to the ring chain node set. Then, the operation of determining the second filter node corresponding to the object overlap number that is greater than the first quantity threshold is performed based on the object overlap number corresponding to the second starting node, until no new second filter node appears.

[0233] The nodes contained in the ring chain node set are taken as ring chain nodes, and the node judgment result is obtained.

[0234] In one embodiment, above Figure 12 The relation judgment in unit 10222 is also specifically used for:

[0235] Based on the node determination results, determine the number of nodes in the ring chain;

[0236] Based on the number of nodes, determine whether a chain guarantee relationship exists in the quota tree.

[0237] In one embodiment, such as Figure 13 As shown, above Figure 12 The guarantee circle determination in unit 1223 may include:

[0238] Complexity determination component 12231 is used to determine the guarantee complexity of the long-chain guarantee relationship and / or the ring-chain guarantee relationship if the relationship determination result is that there is a long-chain guarantee relationship and / or a ring-chain guarantee relationship.

[0239] The guarantee circle determination component 12232 is used to determine the existence of a risk guarantee circle in the credit limit tree if the guarantee complexity is greater than the complexity threshold.

[0240] In one embodiment, above Figure 12 The complexity determination component 12231 is specifically used for:

[0241] The guarantee complexity of the long-chain guarantee relationship is determined based on the number of long-chain nodes included in the long-chain guarantee relationship and the number of target objects to which the long-chain nodes are attached; and / or

[0242] The guarantee complexity of the chain guarantee relationship is determined based on the number of chain nodes included in the chain guarantee relationship and the number of target objects attached to the chain nodes.

[0243] In one embodiment, above Figure 11 The first defined subunit 121 in the middle is specifically used for:

[0244] For each target node, determine whether the target node falls within the established risk guarantee circle in the credit limit tree;

[0245] If not, then determine the number of objects overlapping between the target node and other target nodes based on the overlap between the target objects attached to the target node and the target objects attached to other target nodes.

[0246] In one embodiment, above Figure 9 The processing module 20 is specifically used for:

[0247] Based on the risk guarantee circle, output prompt information containing guarantee circle nodes. The prompt information is used to prompt the adjustment of the risk sharing objects in the credit limit tree; the guarantee circle node is the credit limit node that falls into the risk guarantee circle.

[0248] In one embodiment, such as Figure 14 As shown, above Figure 9 The processing module 20 may include:

[0249] The third determining unit 21 is used to determine the target object to which the guarantee circle node is attached, based on the risk guarantee circle, as the risk amount shared by the guarantee circle node; the guarantee circle node is the amount node that falls into the risk guarantee circle; the target object is the risk sharing object of the non-fixed risk sharing mode;

[0250] The deletion unit 22 is used to perform structural deletion on the quota tree based on the guarantee circle node and the target object attached to the guarantee circle node, so as to obtain the deletion tree;

[0251] The fourth determining unit 23 is used to determine the amount of unsecured risk for each quota node in the pruning tree;

[0252] The fifth determining unit 24 is used to determine the unsecured risk amount of each credit node in the credit tree based on the risk amount allocated to the credit tree node by the target object attached to the credit tree node, and the unsecured risk amount of each credit tree node in the credit tree is reduced.

[0253] In one embodiment, above Figure 14 The deletion unit 22 in the text is specifically used to include:

[0254] If a guarantee circle node only has a target object attached to it in the credit limit tree, then delete the guarantee circle node and the target object attached to it from the credit limit tree.

[0255] In one embodiment, above Figure 14 The deletion unit 22 in the text is also specifically used to include:

[0256] If the guarantee circle node has other risk-sharing objects attached to it in the credit limit tree besides the target object, then the target object attached to the guarantee circle node will be deleted from the credit limit tree.

[0257] In one embodiment, above Figure 14 The third determining unit 21 is specifically used to include:

[0258] The priority of credit allocation for the target object is determined based on at least one of the following: the value information of the target object linked to the guarantee circle node, the linking order, or the discount rate.

[0259] Based on the risk amount to be shared by the guarantee circle node, the value information of the target object, and the priority of the risk sharing, the target object attached to the guarantee circle node is determined as the risk amount to be shared by the guarantee circle node.

[0260] Each module in the aforementioned data processing 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.

[0261] In one embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be as follows: Figure 15 As shown, the computer device includes a processor, memory, and a network interface connected via a system bus. 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, computer programs, and a database. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The database stores data related to the credit limit tree and its associated risk-sharing objects. The network interface communicates with external terminals via a network connection. When executed by the processor, the computer program implements a data processing method.

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

[0263] In one embodiment, a computer device is provided, 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:

[0264] determining whether there is a risk guarantee circle in the credit tree according to the risk allocation mode of the risk allocation objects hung to each credit node in the credit tree; wherein the risk guarantee circle is composed of different credit nodes guaranteed by the same risk allocation object under a non-fixed risk allocation mode;

[0265] if there is, performing data processing on the credit nodes in the credit tree based on the risk guarantee circle.

[0266] In one embodiment, a computer readable storage medium is provided, which stores a computer program, and the computer program is executed by a processor to implement the following steps:

[0267] determining whether there is a risk guarantee circle in the credit tree according to the risk allocation mode of the risk allocation objects hung to each credit node in the credit tree; wherein the risk guarantee circle is composed of different credit nodes guaranteed by the same risk allocation object under a non-fixed risk allocation mode;

[0268] if there is, performing data processing on the credit nodes in the credit tree based on the risk guarantee circle.

[0269] In one embodiment, a computer program product is provided, which comprises a computer program, and the computer program is executed by a processor to implement the following steps:

[0270] determining whether there is a risk guarantee circle in the credit tree according to the risk allocation mode of the risk allocation objects hung to each credit node in the credit tree; wherein the risk guarantee circle is composed of different credit nodes guaranteed by the same risk allocation object under a non-fixed risk allocation mode;

[0271] if there is, performing data processing on the credit nodes in the credit tree based on the risk guarantee circle.

[0272] It should be noted that the related information (such as risk credit) of the credit nodes in the credit tree and the related information (such as hanging sequence, value information and discount rate) of the risk allocation objects hung to the credit nodes in the credit tree are all authorized information and data.

[0273] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a non-volatile computer readable storage medium, and when the computer program is executed, the processes of the above-mentioned embodiments of the methods can be included. Any reference to memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile and volatile memory. The non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical storage, high-density embedded non-volatile memory, resistive memory (ReRAM), magnetoresistive random access memory (MRAM), ferroelectric memory (FRAM), phase change memory (PCM), graphene memory, etc. The volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration but not limitation, the RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM), etc. The database involved in the embodiments provided in the present application can include at least one of a relational database and a non-relational database. The non-relational database can include a distributed database based on a block chain, etc., without being limited thereto. The processor involved in the embodiments provided in the present application can be a general-purpose processor, a central processing unit, a graphics processing unit, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, etc., without being limited thereto.

[0274] Any combination of the technical features of the above embodiments can be made. In order to make the description simple, all possible combinations of the technical features in the above embodiments are not described, however, as long as the combination of the technical features does not exist, it should be considered as the scope of the present application.

[0275] The above embodiments only express several implementation manners of the present application, and the description is more specific and detailed, but it should not be understood as a limitation on the scope of the patent of the present application. It should be pointed out that for ordinary skilled in the art, without departing from the concept of the present application, a number of modifications and improvements can be made, which are all within the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the appended claims.

Claims

1. A data processing method, characterized by, The method comprises: determining at least two target nodes from the credit tree according to a risk allocation mode of risk allocation objects hung on each credit node in the credit tree, the target nodes being credit nodes hung with target objects; the target objects being risk allocation objects in a non-fixed risk allocation mode; for each target node, determining the number of object overlaps between the target node and other target nodes according to overlaps between the target object hung on the target node and the target objects hung on the other target nodes; determining whether there is a long-chain node and / or a ring-chain node in the credit tree according to a size relationship between a first number threshold and the number of object overlaps corresponding to each target node, to obtain a node judgment result; determining whether there is a long-chain guarantee relationship and / or a ring-chain guarantee relationship in the credit tree according to the node judgment result, to obtain a relationship determination result; the long-chain guarantee relationship refers to a chain-shaped guarantee relationship formed by different long-chain nodes due to being guaranteed by the same target object; the ring-chain guarantee relationship refers to a ring-shaped guarantee relationship formed by different ring-chain nodes due to being guaranteed by multiple same target objects; if the number of long-chain nodes is greater than a second number threshold, and the total number of target objects hung on the multiple long-chain nodes is greater than a third number threshold, the multiple long-chain nodes constitute the long-chain guarantee relationship; if the number of ring-chain nodes is greater than a fourth number threshold, the multiple ring-chain nodes constitute the ring-chain guarantee relationship; if the relationship determination result is at least one of the long-chain guarantee relationship and the ring-chain guarantee relationship, it is determined that there is a risk guarantee circle in the credit tree; the risk guarantee circle is composed of different credit nodes guaranteed by the same risk allocation object in a non-fixed risk allocation mode; if there is, performing data processing on the credit nodes in the credit tree based on the risk guarantee circle.

2. The method of claim 1, wherein, determining whether there is a long-chain node in the credit tree according to a size relationship between a first number threshold and the number of object overlaps corresponding to each target node, to obtain a node judgment result, comprising: selecting a first starting node from the target nodes, and adding the first starting node to a long-chain node set; determining a first screening node corresponding to when the number of object overlaps corresponding to the first starting node is the first number threshold; the first screening node is not included in the long-chain node set; taking the first screening node as a new first starting node, adding the first screening node to the long-chain node set, and returning to perform the operation of determining the first screening node corresponding to when the number of object overlaps is the first number threshold according to the number of object overlaps corresponding to the first starting node until no new first screening node appears; taking the nodes included in the long-chain node set as long-chain nodes to obtain the node judgment result.

3. The method of claim 2, wherein, determining whether there is a long-chain guarantee relationship in the credit tree according to the node judgment result, comprising: determining the number of nodes of the long-chain nodes according to the node judgment result; According to the node quantity and the total number of target objects to which the long-chain nodes are connected, it is determined whether there is a long-chain guarantee relationship in the credit tree.

4. The method of claim 1, wherein, According to the node determination result, it is determined whether there is a ring-chain guarantee relationship in the credit tree, and a relationship determination result is obtained, including: A second starting node is selected from the target nodes, and the second starting node is added to the ring-chain node set; According to the number of overlapped objects corresponding to the second starting node, a second screening node corresponding to the case that the number of overlapped objects is greater than a first number threshold is determined; wherein the second screening node is not included in the ring-chain node set; The second screening node is taken as a new second starting node, the second screening node is added to the ring-chain node set, and the operation of determining the second screening node corresponding to the case that the number of overlapped objects is greater than the first number threshold according to the number of overlapped objects corresponding to the second starting node is executed until no new second screening node appears; The nodes included in the ring-chain node set are taken as ring-chain nodes, and a node determination result is obtained.

5. The method of claim 4, wherein, According to the node determination result, it is determined whether there is a ring-chain guarantee relationship in the credit tree, including: According to the node quantity, it is determined whether there is a ring-chain guarantee relationship in the credit tree. The relationship determination result includes:

6. The method according to any one of claims 1 to 5, characterized in that, If the relationship determination result is a long-chain guarantee relationship and / or a ring-chain guarantee relationship, the guarantee complexity of the long-chain guarantee relationship and / or the ring-chain guarantee relationship is determined; If the guarantee complexity is greater than a complexity threshold, it is determined that there is a risk guarantee circle in the credit tree. The determination of the guarantee complexity of the long-chain guarantee relationship and / or the ring-chain guarantee relationship includes:

7. The method of claim 6, wherein, According to the number of long-chain nodes included in the long-chain guarantee relationship and the number of target objects to which the long-chain nodes are connected, the guarantee complexity of the long-chain guarantee relationship is determined; and / or According to the number of ring-chain nodes included in the ring-chain guarantee relationship and the number of target objects to which the ring-chain nodes are connected, the guarantee complexity of the ring-chain guarantee relationship is determined. The determination of the number of overlapped objects between each target node and other target nodes according to the overlapping between the target objects connected by the target node and the target objects connected by other target nodes includes:

8. The method of claim 1, wherein, For each target node, it is determined whether the target node falls into the risk guarantee circle that has been determined in the credit tree; If not, the number of overlapped objects between the target node and other target nodes is determined according to the overlapping between the target objects connected by the target node and the target objects connected by other target nodes. The data processing of the credit nodes in the credit tree based on the risk guarantee circle includes:

9. The method of claim 1, wherein, ​ According to the risk guarantee circle, prompt information containing a guarantee circle node is output, the prompt information being used to prompt a risk allocation object to adjust a connection of the credit tree; the guarantee circle node being a credit node falling into the risk guarantee circle.

10. The method of claim 1, wherein, The data processing of the credit nodes in the credit tree based on the risk guarantee circle comprises: According to the risk guarantee circle, a target object connected to the guarantee circle node is determined as a risk credit of the guarantee circle node; the guarantee circle node is a credit node falling into the risk guarantee circle; the target object is a risk allocation object in a non-fixed risk allocation mode; According to the guarantee circle node and the target object connected to the guarantee circle node, a structure of the credit tree is pruned to obtain a pruned tree; A risk amount without guarantee of each credit node in the pruned tree is determined; According to the risk credit of the target object connected to the guarantee circle node and the risk amount without guarantee of each credit node in the pruned tree, a risk amount without guarantee of each credit node in the credit tree is determined.

11. The method of claim 10, wherein, According to the guarantee circle node and the target object connected to the guarantee circle node, the structure of the credit tree is pruned, comprising: If the guarantee circle node only has the target object connected in the credit tree, the guarantee circle node and the target object connected to the guarantee circle node are deleted in the credit tree.

12. The method of claim 10, wherein, According to the guarantee circle node and the target object connected to the guarantee circle node, the structure of the credit tree is pruned, comprising: If the guarantee circle node has other risk allocation objects besides the target object connected in the credit tree, the target object connected to the guarantee circle node is deleted in the credit tree.

13. The method of claim 10, wherein, The determination of the target object connected to the guarantee circle node as the risk credit of the guarantee circle node comprises: According to at least one of value information, connection order or discount rate of the target object connected to the guarantee circle node, an allocation priority of the credit of the target object is determined; According to the risk credit to be allocated of the guarantee circle node, the value information and the allocation priority of the credit of the target object, the target object connected to the guarantee circle node is determined as the risk credit of the guarantee circle node.

14. A data processing apparatus, characterized by The device for implementing the data processing method in any one of claims 1-13 comprises: A determination module is configured to determine whether there is a risk guarantee circle in the credit tree according to a risk allocation mode of a risk allocation object connected to each credit node in the credit tree; wherein the risk guarantee circle is composed of different credit nodes guaranteed by the same risk allocation object in a non-fixed risk allocation mode; A processing module is configured to perform data processing on the credit nodes in the credit tree based on the risk guarantee circle if there is the risk guarantee circle.

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 13.

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 13.

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 13.

Images