Data resource transfer plan information generation method and device, equipment, readable storage medium and program product

Abstract

The invention relates to a data resource transfer plan information generation method and device, computer equipment, a computer readable storage medium and a computer program product, and relates to the technical field of data processing. The method comprises the following steps: detecting a data resource transfer scene according to first plan information of data resource transfer; if the data resource transfer scene is a full-amount transfer scene, splitting the first plan information into second plan information of each participating node according to the proportion information of the data resources transferred out by each participating node in advance; if the data resource transfer scene is a partial transfer scene, acquiring node attribute information of each participating node, and performing priority evaluation on each participating node according to the node attribute information and the data resource proportion information transferred out in advance to obtain a priority evaluation result; and splitting the first plan information into second plan information of each participating node according to a priority evaluation result. By adopting the method, the splitting accuracy of the data resource transfer plan can be improved.

Description

Technical Field

[0001] The present application relates to the field of data processing technology, and in particular to a method, device, computer equipment, computer-readable storage medium and computer program product for generating data resource transfer plan information. Background Art

[0002] With the development of data processing technology, data resource transfer technology has emerged, which can be used to transfer data resources between different systems.

[0003] In traditional technologies, when formulating a data resource transfer plan, the data resource transfer system usually directly splits the total data resource transfer plan artificially according to the data resource transfer amount of each participant.

[0004] However, the current basis for splitting the data resource transfer plan is only the amount of data resource transfer by each participant, which is a relatively simple basis and will lead to insufficient accuracy in the splitting of the data resource transfer plan. Summary of the invention

[0005] Based on this, it is necessary to provide a method, device, computer equipment, computer-readable storage medium and computer program product for generating data resource transfer plan information that can improve the splitting accuracy of data resource transfer plans in response to the above technical problems.

[0006] In a first aspect, the present application provides a method for generating data resource transfer plan information, which is applied to a data resource transfer system, wherein the data resource transfer system includes a plurality of participating nodes; the method includes:

[0007] Acquire first plan information for transferring data resources, and detect a data resource transfer scenario for transferring data resources this time according to the first plan information;

[0008] If the data resource transfer scenario is a full transfer scenario, the first plan information is split according to the data resource ratio information previously transferred out by each participating node to obtain the second plan information of each participating node transferring in data resources;

[0009] If the data resource transfer scenario is a partial transfer scenario, node attribute information of each participating node is obtained, and according to the node attribute information and the data resource ratio information previously transferred out of each participating node, a priority evaluation of data resource transfer in of each participating node is performed to obtain a priority evaluation result;

[0010] The first plan information is split according to the priority evaluation result to obtain the second plan information for each participating node to transfer data resources.

[0011] In one embodiment, the step of evaluating the priority of transferring data resources to each participating node according to the attribute information of each node and the proportion of data resources transferred out by each participating node previously comprises:

[0012] Extracting features from the attribute information of each node respectively to obtain the node attribute features corresponding to each participating node;

[0013] Characteristic encoding is performed on the proportion information of the data resources transferred out previously by each of the participating nodes to obtain the characteristic of the amount of data resources transferred out previously;

[0014] According to the data resource quantity characteristics of each participating node, the node attribute characteristics of each participating node are weighted respectively to obtain the first target characteristics corresponding to each participating node;

[0015] According to the first target feature corresponding to each participating node, a priority evaluation of data resource transfer is performed on each participating node.

[0016] In one embodiment, the step of evaluating the priority of transferring data resources to each participating node according to the first target feature corresponding to each participating node includes:

[0017] Sending a data resource transfer plan request to each participating node, and obtaining response information from each participating node;

[0018] Generate a response information feature corresponding to each of the response information, and fuse the response information feature corresponding to each of the participating nodes with the first target feature to obtain a second target feature of each of the participating nodes;

[0019] According to the second target feature corresponding to each participating node, a priority evaluation of data resource transfer is performed on each participating node.

[0020] In one embodiment, the node attribute information includes data resource transfer time information and data resource turnover plan information; the feature extraction of each node attribute information is performed to obtain the node attribute features corresponding to each participating node, including:

[0021] For any of the participating nodes, feature extraction is performed on the data resource transfer time information to obtain time information features, and feature extraction is performed on the data resource turnover plan information to obtain data resource turnover information features;

[0022] The time information feature and the data resource turnover information feature are feature-fused to obtain the node attribute feature of the participating node.

[0023] In one embodiment, the first plan information is split to obtain the second plan information of each participating node when transferring data resources, including:

[0024] Detecting the number of plan splits corresponding to the first plan information;

[0025] If the number of plan splits is less than a preset number threshold, the first plan information is split in real time to obtain the second plan information of each participating node in transferring data resources;

[0026] If the number of plan splits is not less than a preset number threshold, the first plan information is asynchronously split within a preset time period to obtain the second plan information for each participating node to transfer data resources.

[0027] In one embodiment, the method further comprises:

[0028] According to the second plan information of each participating node when transferring data resources, detecting whether there is tail difference data resource when transferring data resources this time;

[0029] If there is tail difference data resource, generating tail difference processing plan information according to the tail difference data resource;

[0030] According to the preset priority order of each participating node, the tail difference processing plan information is distributed to the corresponding participating node.

[0031] In a second aspect, the present application further provides a device for generating data resource transfer plan information, which is applied to a data resource transfer system, wherein the data resource transfer system includes a plurality of participating nodes; the device includes:

[0032] A detection module, used to obtain first plan information for transferring data resources, and detect a data resource transfer scenario for transferring data resources this time according to the first plan information;

[0033] A splitting module, for splitting the first plan information according to the data resource ratio information previously transferred out by each participating node, to obtain the second plan information for each participating node to transfer in data resources, if the data resource transfer scenario is a full transfer scenario;

[0034] A priority evaluation module, for obtaining node attribute information of each participating node if the data resource transfer scenario is a partial transfer scenario, and performing a priority evaluation of data resource transfer in for each participating node according to the node attribute information and the data resource ratio information previously transferred out by each participating node, to obtain a priority evaluation result;

[0035] The splitting module is further used to split the first plan information according to the priority evaluation result to obtain the second plan information of each participating node when transferring data resources.

[0036] In one embodiment, the priority evaluation module is further configured to:

[0037] Extracting features from the attribute information of each node respectively to obtain the node attribute features corresponding to each participating node;

[0038] Characteristic encoding is performed on the proportion information of the data resources transferred out previously by each of the participating nodes to obtain the characteristic of the amount of data resources transferred out previously;

[0039] According to the data resource quantity characteristics of each participating node, the node attribute characteristics of each participating node are weighted respectively to obtain the first target characteristics corresponding to each participating node;

[0040] According to the first target feature corresponding to each participating node, a priority evaluation of data resource transfer is performed on each participating node.

[0041] In one embodiment, the priority evaluation module is further configured to:

[0042] Sending a data resource transfer plan request to each participating node, and obtaining response information from each participating node;

[0043] Generate a response information feature corresponding to each of the response information, and fuse the response information feature corresponding to each of the participating nodes with the first target feature to obtain a second target feature of each of the participating nodes;

[0044] According to the second target feature corresponding to each participating node, a priority evaluation of data resource transfer is performed on each participating node.

[0045] In one embodiment, the node attribute information includes data resource transfer time information and data resource turnover plan information; the priority evaluation module is further used to:

[0046] For any of the participating nodes, feature extraction is performed on the data resource transfer time information to obtain time information features, and feature extraction is performed on the data resource turnover plan information to obtain data resource turnover information features;

[0047] The time information feature and the data resource turnover information feature are feature-fused to obtain the node attribute feature of the participating node.

[0048] In one embodiment, the splitting module is further used for:

[0049] Detecting the number of plan splits corresponding to the first plan information;

[0050] If the number of plan splits is less than a preset number threshold, the first plan information is split in real time to obtain the second plan information of each participating node in transferring data resources;

[0051] If the number of plan splits is not less than a preset number threshold, the first plan information is asynchronously split within a preset time period to obtain the second plan information for each participating node to transfer data resources.

[0052] In one embodiment, the device for generating data resource transfer plan information further includes:

[0053] A tail difference processing module is used to detect whether there is a tail difference data resource when transferring data resources this time according to the second plan information of each participating node when transferring data resources;

[0054] If there is tail difference data resource, generating tail difference processing plan information according to the tail difference data resource;

[0055] According to the preset priority order of each participating node, the tail difference processing plan information is distributed to the corresponding participating node.

[0056] In a third aspect, the present application further provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0057] Obtain first plan information for transferring in data resources, and detect the data resource transfer scenario for this data resource transfer based on the first plan information; if the data resource transfer scenario is a full transfer scenario, split the first plan information based on the data resource ratio information previously transferred out by each participating node, and obtain second plan information for data resource transfer for each participating node; if the data resource transfer scenario is a partial transfer scenario, obtain node attribute information of each participating node, and evaluate the priority of data resource transfer for each participating node based on the node attribute information and the data resource ratio information previously transferred out by each participating node, and obtain a priority evaluation result; split the first plan information based on the priority evaluation result, and obtain second plan information for data resource transfer for each participating node.

[0058] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the following steps are implemented:

[0059] Obtain first plan information for transferring in data resources, and detect the data resource transfer scenario for this data resource transfer based on the first plan information; if the data resource transfer scenario is a full transfer scenario, split the first plan information based on the data resource ratio information previously transferred out by each participating node, and obtain second plan information for data resource transfer for each participating node; if the data resource transfer scenario is a partial transfer scenario, obtain node attribute information of each participating node, and evaluate the priority of data resource transfer for each participating node based on the node attribute information and the data resource ratio information previously transferred out by each participating node, and obtain a priority evaluation result; split the first plan information based on the priority evaluation result, and obtain second plan information for data resource transfer for each participating node.

[0060] In a fifth aspect, the present application further provides a computer program product, including a computer program, which implements the following steps when executed by a processor:

[0061] Obtain first plan information for transferring in data resources, and detect the data resource transfer scenario for this data resource transfer based on the first plan information; if the data resource transfer scenario is a full transfer scenario, split the first plan information based on the data resource ratio information previously transferred out by each participating node, and obtain second plan information for data resource transfer for each participating node; if the data resource transfer scenario is a partial transfer scenario, obtain node attribute information of each participating node, and evaluate the priority of data resource transfer for each participating node based on the node attribute information and the data resource ratio information previously transferred out by each participating node, and obtain a priority evaluation result; split the first plan information based on the priority evaluation result, and obtain second plan information for data resource transfer for each participating node.

[0062] In the above-mentioned data resource transfer plan information generation method, device, computer equipment, computer-readable storage medium and computer program product, when the data resource system obtains the first plan information for data resource transfer, it will first detect the data resource transfer scenario of this data resource transfer according to the first plan information; when the data resource transfer scenario is a full transfer scenario, the first plan information is directly split into second plan information for data resource transfer for each participating node according to the data resource proportion information previously transferred out by each participating node; when the data resource transfer scenario is a partial transfer scenario, the node attribute information of each participating node and the data resource proportion information previously transferred out are used to evaluate the data resource transfer of each participating node. Priority, so that the first plan information can be reliably split according to the priority evaluation result, and the second plan information of each participating node when transferring in data resources is obtained. In this way, under the premise of the data resource transfer scenario, the present application realizes that for different data resource scenarios, the first plan information of data resource transfer is reasonably split into the second plan information of each participating node based on different data splitting bases. When splitting the data resource transfer plan, multiple factors such as the data resource transfer scenario, the node attribute information of each participating node, and the proportion information of the data resources transferred out first are taken into consideration, and the impact on the splitting of the data resource transfer plan is rich. Therefore, the splitting accuracy of the data resource transfer plan can be improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0063] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the drawings required for use in the embodiments of the present application or related technical descriptions will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0064] Figure 1 This is a schematic diagram of the architecture of a data resource transfer system in one embodiment of the present application;

[0065] Figure 2 A flowchart of a method for generating data resource transfer plan information in one embodiment of the present application;

[0066] Figure 3 A schematic diagram of a process for performing priority evaluation in one embodiment of the present application;

[0067] Figure 4 A schematic diagram of a process of splitting first plan information into multiple second plan information in one embodiment of the present application;

[0068] Figure 5It is a structural block diagram of a device for generating data resource transfer plan information in one embodiment;

[0069] Figure 6 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0070] In order to make the purpose, technical solutions and advantages of the present application clearer, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application. It should be noted that in the embodiments of the present application, certain software, components, models and other existing solutions in the industry may be mentioned, which should be considered as exemplary, and their purpose is only to illustrate the feasibility of the implementation of the technical solution of the present application, but it does not mean that the applicant has or will necessarily use the solution.

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

[0072] The method for generating data resource transfer plan information of the present application is applied to a data resource transfer system, which is composed of multiple participating nodes. There may be an agent node among the multiple participating nodes, and the agent node can execute the implementation process of the above-mentioned method for generating data resource transfer plan information; there may also be no agent node among the multiple participating nodes, and there may be a control component in the above-mentioned data resource transfer system, and the control component executes the implementation process of the above-mentioned method for generating data resource transfer plan information.

[0073] As an example, the above-mentioned data resource transfer system may be a bank consortium, each participating node may be a participating bank in the bank consortium, and the agent node may be an agent bank.

[0074] As an example, see Figure 1 , Figure 1 Schematic diagram of the architecture of the data resource transfer system in the present application. The data resource transfer system includes N participating nodes, and there is an agent node among the N participating nodes.

[0075] In an exemplary embodiment, Figure 2As shown, a method for generating data resource transfer plan information is provided, which is applied to a data resource transfer system, the data resource transfer system includes multiple participating nodes, and includes the following steps 202 to 206. Among them:

[0076] Step 202, obtaining first plan information for transferring data resources, and detecting a data resource transfer scenario for this data resource transfer according to the first plan information.

[0077] The first plan information represents a plan of how the external object transfers data resources to each participating node in the data resource transfer system, and may include information such as the amount of data resources transferred by the external object to each participating node and the transfer time.

[0078] As an example, step 202 includes: obtaining first plan information for data resource transfer-in, and detecting the data resource transfer-in object and the data resource transfer-in amount for this data resource transfer based on the first plan information; determining the data resource transfer-out amount of the data resource transfer system for the data resource transfer-in object; if the data resource transfer-in amount is consistent with the data resource transfer-out amount, determining that the data resource transfer scenario for this data resource transfer-in is a full transfer scenario; if the data resource transfer-in amount is less than the data resource transfer-out amount, determining that the data resource transfer scenario for this data resource transfer-in is a partial transfer scenario.

[0079] Step 204, if the data resource transfer scenario is a full transfer scenario, the first plan information is split according to the data resource ratio information previously transferred out by each participating node to obtain the second plan information for each participating node to transfer in data resources.

[0080] The data resource ratio information is information representing the proportion of data resources transferred from each participating node to the data resource transfer object; the second plan information represents the plan of how the external object transfers data resources to a participating node.

[0081] As an example, step 204 includes: if the data resource transfer scenario is a full transfer scenario, obtaining the data resource ratio information of each participating node for transferring data resources to the data resource transfer-in object; according to the data resource ratio information, splitting the first plan information into plan information for each participating node to transfer data resources in, and obtaining the second plan information corresponding to each participating node.

[0082] For example, assuming that there are participating nodes A, B and C, and the ratio information of data resource transfer from participating nodes A, B and C to the data resource transfer-in object is 1:2:3, and the total amount of data resources transferred by the data resource transfer-in object to the data resource transfer system in the first plan information is 60, then the second plan information corresponding to A is that the data resource transfer-in amount is 10, and the transfer time is t1, the second plan information corresponding to B is that the data resource transfer-in amount is 20, and the transfer time is t2, and the second plan information corresponding to C is that the data resource transfer-in amount is 30, and the transfer time is t3, among which the transfer time is agreed upon by each participating node and the data resource transfer-in object.

[0083] Step 206, if the data resource transfer scenario is a partial transfer scenario, the node attribute information of each participating node is obtained, and the priority of data resource transfer of each participating node is evaluated based on the node attribute information and the data resource ratio information previously transferred out of each participating node to obtain a priority evaluation result.

[0084] Among them, the node attribute information can be the data resource transfer time information, data resource turnover plan information and node portrait information of the participating nodes. Based on the data resource transfer time information, it can be known when the participating nodes need data resource transfer; based on the data resource turnover plan information, it can be known whether the data resources of the participating nodes are turning over smoothly and whether the demand for data resources is urgent; the node portrait information can be the historical data resource transfer-out information and transfer-in information, node name and node type and other information for the participating nodes.

[0085] As an example, step 206 includes: if the data resource transfer scenario is a partial transfer scenario, obtaining the node attribute information of each participating node, and performing feature extraction on the node attribute information of each participating node to obtain node attribute features; performing feature encoding on the data resource proportion information previously transferred out by each participating node to obtain data resource quantity features; and evaluating the priority of each participating node for data resource transfer according to the node attribute features and data resource quantity features to obtain a priority evaluation result.

[0086] Step 208: split the first plan information according to the priority evaluation result to obtain the second plan information for each participating node to transfer data resources.

[0087] As an example, step 208 includes: determining the data resource transfer ratio and data resource transfer time of each participating node according to the priority evaluation result, wherein the higher the priority of the participating node, the higher the data resource transfer ratio of the participating node for data resource transfer, and the earlier the data resource transfer time; according to the data resource transfer ratio and data resource transfer time of each participating node for data resource transfer, the first plan information is split to obtain the second plan information of each participating node for data resource transfer.

[0088] In the above-mentioned method for generating data resource transfer plan information, when the data resource system obtains the first plan information for data resource transfer, it will first detect the data resource transfer scenario of this data resource transfer according to the first plan information; when the data resource transfer scenario is a full transfer scenario, the first plan information is directly split into the second plan information for data resource transfer of each participating node according to the data resource proportion information transferred out previously by each participating node; when the data resource transfer scenario is a partial transfer scenario, the priority of data resource transfer of each participating node is evaluated according to the node attribute information of each participating node and the data resource proportion information transferred out previously, so that priority can be evaluated according to As a result, the first plan information is reliably split to obtain the second plan information of each participating node when transferring in data resources. In this way, under the premise of the data resource transfer scenario, the present application realizes that for different data resource scenarios, the first plan information of data resource transfer is reasonably split into the second plan information of each participating node based on different data splitting bases. When splitting the data resource transfer plan, multiple factors such as the data resource transfer scenario, the node attribute information of each participating node, and the proportion information of the data resources transferred out previously are taken into consideration, and the impact on the splitting of the data resource transfer plan is richer. The basis for splitting the data resource transfer plan is therefore more accurate, thereby improving the splitting accuracy of the data resource transfer plan.

[0089] In an exemplary embodiment, Figure 3 As shown, according to the attribute information of each node and the proportion of data resources transferred out by each participating node in advance, the priority of data resource transfer in of each participating node is evaluated, including:

[0090] Step 302 , extracting features from attribute information of each node respectively, and obtaining node attribute features corresponding to each participating node.

[0091] Among them, in this embodiment, a target feature extractor is provided, and the target feature extractor can be a trained AI model for extracting node attribute features from node attribute information.

[0092] As an example, step 302 includes: for the node attribute information of each participating node, feature encoding the node attribute information to obtain a first encoding feature, and inputting the first encoding feature into a target feature extractor; feature extracting the first encoding feature through the target feature extractor to obtain the node attribute feature of the participating node.

[0093] Step 304 , weighting the node attribute characteristics of each participating node according to the data resource quantity characteristics of each participating node, and obtaining the first target characteristics corresponding to each participating node.

[0094] Among them, the data resource quantity characteristic can be a normalized data resource quantity ratio, which can be the proportion of the data resource quantity previously transferred out by the participating node to the data resource transfer-in object in the total data resource quantity transferred out by the data resource transfer system to the data resource transfer-in object.

[0095] As an example, step 304 includes: multiplying the data resource quantity feature and the node attribute feature of each participating node to obtain the first target feature corresponding to each participating node.

[0096] Step 306: perform a data resource transfer priority evaluation on each participating node according to the first target feature corresponding to each participating node.

[0097] As an example, step 306 includes: for the first target feature of each participating node, inputting the first target feature into a preset evaluation model, mapping the first target feature into a corresponding priority evaluation value, wherein the larger the priority evaluation value, the higher the priority of the participating node for transferring data resources.

[0098] As an example, the node attribute information includes data resource transfer time information and data resource turnover plan information; feature extraction is performed on each node attribute information to obtain node attribute features corresponding to each participating node, including:

[0099] For any participating node, feature extraction is performed on the data resource transfer time information to obtain the time information feature, and feature extraction is performed on the data resource turnover plan information to obtain the data resource turnover information feature; the time information feature and the data resource turnover information feature are feature fused to obtain the node attribute feature of the participating node.

[0100] Specifically, for any participating node, the time feature of the data resource transfer time information is extracted to obtain the time information feature; the data resource turnover plan information is one-hot encoded to obtain the one-hot encoded feature; the one-hot encoded feature is converted into an embedded feature and the one-hot encoded feature is reduced in dimension to obtain the data resource turnover information feature; the time information feature and the data resource turnover information feature are concatenated to obtain the node attribute feature of the participating node.

[0101] In the above embodiment, priority evaluation is performed based on the node attributes of the participating nodes and the amount of data resources transferred out previously. The priority evaluation of data resource transfer-in has two reliable bases, thereby improving the accuracy of the priority evaluation of data resource transfer-in for the participating nodes.

[0102] As an example, according to the first target feature corresponding to each participating node, the priority of data resource transfer to each participating node is evaluated, including:

[0103] Send a data resource transfer plan request to each participating node, and obtain the response information of each participating node; generate a response information feature corresponding to each response information, and fuse the response information feature corresponding to each participating node with the first target feature to obtain the second target feature of each participating node; according to the second target feature corresponding to each participating node, evaluate the priority of data resource transfer for each participating node.

[0104] Among them, when the participating nodes in the data resource transfer system are transferring data resources, in order to ensure the efficiency of data resource transfer, the node network status of each participating node also needs to be considered; the above-mentioned response information represents the node network status of the participating nodes, which may be whether the participating nodes can respond to the data resource transfer plan request, and the time taken to respond to the data resource transfer plan request.

[0105] Specifically, a data resource transfer plan request is sent to each participating node, and response information of each participating node is received, wherein the response information can be a response success information or a response failure information; the response time corresponding to each response information is obtained, and the response information feature corresponding to each response information is generated according to each response information and the response time corresponding to each response information; the response information feature corresponding to each participating node and the first target feature are spliced ​​to obtain the second target feature of each participating node; for the second target feature of each participating node, the second target feature is input into a preset evaluation model, and the second target feature is mapped to a corresponding priority evaluation value, wherein the larger the priority evaluation value, the higher the priority of the participating node for data resource transfer. In this way, in this embodiment, on the basis of considering the data resource quantity feature and node attribute feature of each participating node for priority evaluation, the influence of the node network status of the participating node on the priority evaluation is also considered, and priority evaluation is realized from multiple aspects such as node network status, node attributes and the amount of data resources transferred out first, and the basis for priority evaluation is more, so the accuracy of priority evaluation of data resource transfer to participating nodes can be further improved.

[0106] In one embodiment, referring to Figure 4 , split the first plan information to obtain the second plan information of each participating node in transferring data resources, including:

[0107] Step 402: Detect the plan split quantity corresponding to the first plan information.

[0108] Among them, the data resource transfer system is splitting the plan information. Due to the limited number of system threads, the number of plan splits for synchronously splitting the first plan information into multiple second plan information is usually limited. If the number of plan splits is too large, it is usually difficult to synchronously split the first plan information into multiple second plan information at one time.

[0109] Step 404: If the number of plan splits is less than a preset number threshold, the first plan information is split in real time to obtain the second plan information for each participating node to transfer data resources.

[0110] Step 406: If the number of plan splits is not less than a preset number threshold, the first plan information is asynchronously split in a preset time period to obtain second plan information for each participating node to transfer data resources.

[0111] As an example, steps 404 to 406 include: if the number of plan splits is less than a preset number threshold, the first plan information is split in real time and synchronously into the second plan information for each participating node to transfer data resources; if the number of plan splits is not less than the preset number threshold, the first plan information is marked as asynchronous split plan information, and the first plan information is asynchronously split into the second plan information for each participating node to transfer data resources during a preset time period. The preset time period may be a time period when the data resource transfer system is not busy, such as a night time period.

[0112] In the above embodiment, when the plan information is split, the number of plan splits corresponding to the first plan information is first detected. When the number of plan splits is less than the preset number threshold, the first plan information is split in real time to obtain the second plan information for each participating node to transfer data resources, thereby ensuring the real-time and efficiency of the plan information splitting; when the number of plan splits is not less than the preset number threshold, the first plan information is split asynchronously within a preset time period to obtain the second plan information for each participating node to transfer data resources, thereby ensuring that the next plan information splitting process is not affected, maintaining the smooth assembly line operation of the data resource transfer information, and ensuring that the first plan information can be accurately and asynchronously split into each second plan information.

[0113] In one embodiment, the method for generating the data resource transfer plan information further includes:

[0114] According to the second plan information of each participating node when transferring data resources, it is detected whether there are tail difference data resources when transferring data resources this time; if there are tail difference data resources, the tail difference processing plan information is generated according to the tail difference data resources; according to the preset priority order of each participating node, the tail difference processing plan information is allocated to the corresponding participating node.

[0115] Among them, since there is a limit to the number of digits that can be recorded in the data resource transfer coefficient, for example, a maximum of 2 decimal places can be recorded, there may be a tail difference when executing the data resource transfer.

[0116] Specifically, according to the second plan information of each participating node when transferring data resources, the data resource transfer amount of each participating node is detected respectively; if the sum of the data resource transfer amounts is consistent with the data resource transfer amount corresponding to the first plan information, then there is no tail difference data resource when the data resource is transferred this time; if the sum of the data resource transfer amounts is inconsistent with the data resource transfer amount corresponding to the first plan information, then there is a tail difference data resource when the data resource is transferred this time; if there is a tail difference data resource, then the tail difference processing plan information corresponding to the tail difference data resource is generated, wherein the tail difference processing plan information includes the amount of tail difference data resources to be processed, and the tail difference processing time, etc.; according to the preset priority order of each participating node, the tail difference processing plan information is allocated to the participating node with the highest priority, wherein the preset priority order is the pre-set order for each participating node to process the tail difference data resources.

[0117] In the above embodiment, when there are tail difference data resources in the data resource transfer system, the tail difference processing plan information corresponding to the tail difference data resources can be promptly distributed to the corresponding participating nodes for tail difference processing according to the preset priority order of each participating node, thereby ensuring the timeliness of the tail difference processing.

[0118] As an example, the above-mentioned data resource transfer system can be a bank consortium, and the participating nodes are participating banks. The above-mentioned first plan information can be the total repayment plan information of the data resource transferee for the bank consortium, and the above-mentioned second plan information can be the repayment plan information of the data resource transferee for the participating banks.

[0119] In one embodiment, a method for generating data resource transfer plan information is applied to a data resource transfer system, the data resource transfer system includes multiple participating nodes, the data resource transfer system first obtains first plan information for data resource transfer-in, and detects the data resource transfer-in object and the data resource transfer-in amount for this data resource transfer based on the first plan information; determines the data resource transfer-out amount of the data resource transfer system for the data resource transfer-in object, if the data resource transfer-in amount is consistent with the data resource transfer-out amount, then determines that the data resource transfer scenario for this data resource transfer-in is a full transfer scenario; if the data resource transfer-in amount is less than the data resource transfer-out amount, then determines that the data resource transfer scenario for this data resource transfer-in is a partial transfer scenario.

[0120] Furthermore, if the data resource transfer scenario is a full transfer scenario, the data resource ratio information of each participating node transferring data resources to the data resource transfer-in object is obtained; according to the data resource ratio information, the first plan information is split into plan information for each participating node to transfer data resources, and the second plan information corresponding to each participating node is obtained.

[0121] If the data resource transfer scenario is a partial transfer scenario, for the node attribute information of each participating node, feature encoding is performed on the node attribute information to obtain a first encoding feature, and the first encoding feature is input into a target feature extractor; the first encoding feature is feature extracted by the target feature extractor to obtain the node attribute feature of the participating node; the data resource quantity feature and the node attribute feature of each participating node are multiplied to obtain the first target feature corresponding to each participating node; a data resource transfer plan request is sent to each participating node, and response information of each participating node is received, wherein the response information can be a successful response information or a failed response information; the response time corresponding to each response information is obtained, and a response information feature corresponding to each response information is generated according to each response information and the response time corresponding to each response information; the response information feature corresponding to each participating node and the first target feature are spliced ​​to obtain the second target feature of each participating node; for the second target feature of each participating node, the second target feature is input into a preset evaluation model, and the second target feature is mapped into a corresponding priority evaluation value to obtain a priority evaluation result, wherein the larger the priority evaluation value, the higher the priority of the participating node in data resource transfer.

[0122] Furthermore, based on the priority evaluation results, the data resource transfer ratio and data resource transfer time of each participating node are determined respectively, wherein the higher the priority of the participating node, the higher the data resource transfer ratio of the participating node and the earlier the data resource transfer time; based on the data resource transfer ratio and data resource transfer time of each participating node, the first plan information is split to obtain the second plan information of each participating node when performing data resource transfer.

[0123] In the above embodiment, when splitting the data resource transfer plan, multiple factors such as the data resource transfer scenario, the node attribute information of each participating node, and the proportion information of the data resources transferred out previously are taken into consideration, and the impact on the splitting of the data resource transfer plan is enriched. The basis for splitting the data resource transfer plan is rich, and thus the accuracy of splitting the data resource transfer plan can be improved.

[0124] It should be understood that, although the various steps in the flowcharts involved in the above-mentioned embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above-mentioned embodiments can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0125] Based on the same inventive concept, the embodiment of the present application also provides a device for generating data resource transfer plan information for implementing the method for generating data resource transfer plan information involved above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations in the embodiments of one or more devices for generating data resource transfer plan information provided below can refer to the limitations of the method for generating data resource transfer plan information above, and will not be repeated here.

[0126] In an exemplary embodiment, Figure 5 As shown, a device for generating data resource transfer plan information is provided, which is applied to a data resource transfer system, wherein the data resource transfer system includes a plurality of participating nodes; the device includes: a detection module 502, a splitting module 504 and a priority evaluation module 506, wherein:

[0127] The detection module 502 is used to obtain first plan information for transferring data resources, and detect a data resource transfer scenario for this data resource transfer based on the first plan information.

[0128] The splitting module 504 is used to split the first plan information according to the data resource proportion information previously transferred out by each participating node if the data resource transfer scenario is a full transfer scenario, so as to obtain the second plan information for each participating node to transfer in data resources.

[0129] The priority evaluation module 506 is used to obtain the node attribute information of each participating node if the data resource transfer scenario is a partial transfer scenario, and to perform a priority evaluation on the data resource transfer of each participating node based on the node attribute information and the data resource proportion information previously transferred out by each participating node, to obtain a priority evaluation result.

[0130] The splitting module 504 is further used to split the first plan information according to the priority evaluation result to obtain the second plan information of each participating node when transferring data resources.

[0131] In one embodiment, the priority evaluation module is further configured to:

[0132] Extracting features from the attribute information of each node respectively to obtain the node attribute features corresponding to each participating node;

[0133] Characteristic encoding is performed on the proportion information of the data resources transferred out previously by each of the participating nodes to obtain the characteristic of the amount of data resources transferred out previously;

[0134] According to the data resource quantity characteristics of each participating node, the node attribute characteristics of each participating node are weighted respectively to obtain the first target characteristics corresponding to each participating node;

[0135] According to the first target feature corresponding to each participating node, a priority evaluation of data resource transfer is performed on each participating node.

[0136] In one embodiment, the priority evaluation module is further configured to:

[0137] Sending a data resource transfer plan request to each participating node, and obtaining response information from each participating node;

[0138] Generate a response information feature corresponding to each of the response information, and fuse the response information feature corresponding to each of the participating nodes with the first target feature to obtain a second target feature of each of the participating nodes;

[0139] According to the second target feature corresponding to each participating node, a priority evaluation of data resource transfer is performed on each participating node.

[0140] In one embodiment, the node attribute information includes data resource transfer time information and data resource turnover plan information; the priority evaluation module is further used to:

[0141] For any of the participating nodes, feature extraction is performed on the data resource transfer time information to obtain time information features, and feature extraction is performed on the data resource turnover plan information to obtain data resource turnover information features;

[0142] The time information feature and the data resource turnover information feature are feature-fused to obtain the node attribute feature of the participating node.

[0143] In one embodiment, the splitting module is further used for:

[0144] Detecting the number of plan splits corresponding to the first plan information;

[0145] If the number of plan splits is less than a preset number threshold, the first plan information is split in real time to obtain the second plan information of each participating node in transferring data resources;

[0146] If the number of plan splits is not less than a preset number threshold, the first plan information is asynchronously split within a preset time period to obtain the second plan information for each participating node to transfer data resources.

[0147] In one embodiment, the device for generating data resource transfer plan information further includes:

[0148] A tail difference processing module is used to detect whether there is a tail difference data resource when transferring data resources this time according to the second plan information of each participating node when transferring data resources;

[0149] If there is tail difference data resource, generating tail difference processing plan information according to the tail difference data resource;

[0150] According to the preset priority order of each participating node, the tail difference processing plan information is distributed to the corresponding participating node.

[0151] Each module in the above-mentioned data resource transfer plan information generation device can be implemented in whole or in part by software, hardware and a combination thereof. Each of the above-mentioned modules can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute the operations corresponding to each of the above modules.

[0152] In an exemplary embodiment, a computer device is provided. The computer device may be a terminal, and its internal structure diagram may be as shown in FIG. Figure 6As shown. The computer device includes a processor, a memory, an input / output interface, a communication interface, a display unit and an input device. The processor, the memory and the input / output interface are connected through a system bus, and the communication interface, the display unit and the input device are connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner can be implemented through WIFI, a mobile cellular network, near field communication (NFC) or other technologies. When the computer program is executed by the processor, a method for generating data resource transfer plan information is implemented.

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

[0154] In an exemplary embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, the following steps are implemented:

[0155] Acquire first plan information for transferring data resources, and detect a data resource transfer scenario for transferring data resources this time according to the first plan information;

[0156] If the data resource transfer scenario is a full transfer scenario, the first plan information is split according to the data resource ratio information previously transferred out by each participating node to obtain the second plan information of each participating node transferring in data resources;

[0157] If the data resource transfer scenario is a partial transfer scenario, node attribute information of each participating node is obtained, and according to the node attribute information and the data resource ratio information previously transferred out of each participating node, a priority evaluation of data resource transfer in of each participating node is performed to obtain a priority evaluation result;

[0158] The first plan information is split according to the priority evaluation result to obtain the second plan information for each participating node to transfer data resources.

[0159] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0160] Extracting features from the attribute information of each node respectively to obtain the node attribute features corresponding to each participating node;

[0161] Characteristic encoding is performed on the proportion information of the data resources transferred out previously by each of the participating nodes to obtain the characteristic of the amount of data resources transferred out previously;

[0162] According to the data resource quantity characteristics of each participating node, the node attribute characteristics of each participating node are weighted respectively to obtain the first target characteristics corresponding to each participating node;

[0163] According to the first target feature corresponding to each participating node, a priority evaluation of data resource transfer is performed on each participating node.

[0164] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0165] Sending a data resource transfer plan request to each participating node, and obtaining response information from each participating node;

[0166] Generate a response information feature corresponding to each of the response information, and fuse the response information feature corresponding to each of the participating nodes with the first target feature to obtain a second target feature of each of the participating nodes;

[0167] According to the second target feature corresponding to each participating node, a priority evaluation of data resource transfer is performed on each participating node.

[0168] In one embodiment, the node attribute information includes data resource transfer time information and data resource turnover plan information; when the processor executes the computer program, the following steps are also implemented:

[0169] For any of the participating nodes, feature extraction is performed on the data resource transfer time information to obtain time information features, and feature extraction is performed on the data resource turnover plan information to obtain data resource turnover information features;

[0170] The time information feature and the data resource turnover information feature are feature-fused to obtain the node attribute feature of the participating node.

[0171] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0172] Detecting the number of plan splits corresponding to the first plan information;

[0173] If the number of plan splits is less than a preset number threshold, the first plan information is split in real time to obtain the second plan information of each participating node in transferring data resources;

[0174] If the number of plan splits is not less than a preset number threshold, the first plan information is asynchronously split within a preset time period to obtain the second plan information for each participating node to transfer data resources.

[0175] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0176] According to the second plan information of each participating node when transferring data resources, detecting whether there is tail difference data resource when transferring data resources this time;

[0177] If there is tail difference data resource, generating tail difference processing plan information according to the tail difference data resource;

[0178] According to the preset priority order of each participating node, the tail difference processing plan information is distributed to the corresponding participating node.

[0179] In one embodiment, a computer readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:

[0180] Acquire first plan information for transferring data resources, and detect a data resource transfer scenario for transferring data resources this time according to the first plan information;

[0181] If the data resource transfer scenario is a full transfer scenario, the first plan information is split according to the data resource ratio information previously transferred out by each participating node to obtain the second plan information of each participating node transferring in data resources;

[0182] If the data resource transfer scenario is a partial transfer scenario, node attribute information of each participating node is obtained, and according to the node attribute information and the data resource ratio information previously transferred out of each participating node, a priority evaluation of data resource transfer in of each participating node is performed to obtain a priority evaluation result;

[0183] The first plan information is split according to the priority evaluation result to obtain the second plan information for each participating node to transfer data resources.

[0184] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0185] Extracting features from the attribute information of each node respectively to obtain the node attribute features corresponding to each participating node;

[0186] Characteristic encoding is performed on the proportion information of the data resources transferred out previously by each of the participating nodes to obtain the characteristic of the amount of data resources transferred out previously;

[0187] According to the data resource quantity characteristics of each participating node, the node attribute characteristics of each participating node are weighted respectively to obtain the first target characteristics corresponding to each participating node;

[0188] According to the first target feature corresponding to each participating node, a priority evaluation of data resource transfer is performed on each participating node.

[0189] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0190] Sending a data resource transfer plan request to each participating node, and obtaining response information from each participating node;

[0191] Generate a response information feature corresponding to each of the response information, and fuse the response information feature corresponding to each of the participating nodes with the first target feature to obtain a second target feature of each of the participating nodes;

[0192] According to the second target feature corresponding to each participating node, a priority evaluation of data resource transfer is performed on each participating node.

[0193] In one embodiment, the node attribute information includes data resource transfer time information and data resource turnover plan information; when the computer program is executed by the processor, the following steps are also implemented:

[0194] For any of the participating nodes, feature extraction is performed on the data resource transfer time information to obtain time information features, and feature extraction is performed on the data resource turnover plan information to obtain data resource turnover information features;

[0195] The time information feature and the data resource turnover information feature are feature-fused to obtain the node attribute feature of the participating node.

[0196] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0197] Detecting the number of plan splits corresponding to the first plan information;

[0198] If the number of plan splits is less than a preset number threshold, the first plan information is split in real time to obtain the second plan information of each participating node in transferring data resources;

[0199] If the number of plan splits is not less than a preset number threshold, the first plan information is asynchronously split within a preset time period to obtain the second plan information for each participating node to transfer data resources.

[0200] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0201] According to the second plan information of each participating node when transferring data resources, detecting whether there is tail difference data resource when transferring data resources this time;

[0202] If there is tail difference data resource, generating tail difference processing plan information according to the tail difference data resource;

[0203] According to the preset priority order of each participating node, the tail difference processing plan information is distributed to the corresponding participating node.

[0204] In one embodiment, a computer program product is provided, comprising a computer program, which, when executed by a processor, implements the following steps:

[0205] Acquire first plan information for transferring data resources, and detect a data resource transfer scenario for transferring data resources this time according to the first plan information;

[0206] If the data resource transfer scenario is a full transfer scenario, the first plan information is split according to the data resource ratio information previously transferred out by each participating node to obtain the second plan information of each participating node transferring in data resources;

[0207] If the data resource transfer scenario is a partial transfer scenario, node attribute information of each participating node is obtained, and according to the node attribute information and the data resource ratio information previously transferred out of each participating node, a priority evaluation of data resource transfer in of each participating node is performed to obtain a priority evaluation result;

[0208] The first plan information is split according to the priority evaluation result to obtain the second plan information for each participating node to transfer data resources.

[0209] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0210] Extracting features from the attribute information of each node respectively to obtain the node attribute features corresponding to each participating node;

[0211] Characteristic encoding is performed on the proportion information of the data resources transferred out previously by each of the participating nodes to obtain the characteristic of the amount of data resources transferred out previously;

[0212] According to the data resource quantity characteristics of each participating node, the node attribute characteristics of each participating node are weighted respectively to obtain the first target characteristics corresponding to each participating node;

[0213] According to the first target feature corresponding to each participating node, a priority evaluation of data resource transfer is performed on each participating node.

[0214] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0215] Sending a data resource transfer plan request to each participating node, and obtaining response information from each participating node;

[0216] Generate a response information feature corresponding to each of the response information, and fuse the response information feature corresponding to each of the participating nodes with the first target feature to obtain a second target feature of each of the participating nodes;

[0217] According to the second target feature corresponding to each participating node, a priority evaluation of data resource transfer is performed on each participating node.

[0218] In one embodiment, the node attribute information includes data resource transfer time information and data resource turnover plan information; when the computer program is executed by the processor, the following steps are also implemented:

[0219] For any of the participating nodes, feature extraction is performed on the data resource transfer time information to obtain time information features, and feature extraction is performed on the data resource turnover plan information to obtain data resource turnover information features;

[0220] The time information feature and the data resource turnover information feature are feature-fused to obtain the node attribute feature of the participating node.

[0221] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0222] Detecting the number of plan splits corresponding to the first plan information;

[0223] If the number of plan splits is less than a preset number threshold, the first plan information is split in real time to obtain the second plan information of each participating node in transferring data resources;

[0224] If the number of plan splits is not less than a preset number threshold, the first plan information is asynchronously split within a preset time period to obtain the second plan information for each participating node to transfer data resources.

[0225] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0226] According to the second plan information of each participating node when transferring data resources, detecting whether there is tail difference data resource when transferring data resources this time;

[0227] If there is tail difference data resource, generating tail difference processing plan information according to the tail difference data resource;

[0228] According to the preset priority order of each participating node, the tail difference processing plan information is distributed to the corresponding participating node.

[0229] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.

[0230] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0231] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be construed as limiting the scope of the present application. It should be noted that, for a person of ordinary skill in the art, several modifications and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A method for generating data resource transfer plan information, characterized in that: Applied to a data resource transfer system, the data resource transfer system includes a plurality of participating nodes; the method includes: Acquire first plan information for transferring data resources, and detect a data resource transfer scenario for transferring data resources this time according to the first plan information; If the data resource transfer scenario is a full transfer scenario, the first plan information is split according to the data resource ratio information previously transferred out by each participating node to obtain the second plan information of each participating node transferring in data resources; If the data resource transfer scenario is a partial transfer scenario, node attribute information of each participating node is obtained, and according to the node attribute information and the data resource ratio information previously transferred out of each participating node, a priority evaluation of data resource transfer in of each participating node is performed to obtain a priority evaluation result; The first plan information is split according to the priority evaluation result to obtain the second plan information for each participating node to transfer data resources.

2. The method according to claim 1, characterized in that The step of evaluating the priority of transferring data resources to each participating node according to the attribute information of each node and the proportion information of data resources transferred out previously by each participating node includes: Extracting features from the attribute information of each node respectively to obtain the node attribute features corresponding to each participating node; Characteristic encoding is performed on the proportion information of the data resources transferred out previously by each of the participating nodes to obtain the characteristic of the amount of data resources transferred out previously; According to the data resource quantity characteristics of each participating node, the node attribute characteristics of each participating node are weighted respectively to obtain the first target characteristics corresponding to each participating node; According to the first target feature corresponding to each participating node, a priority evaluation of data resource transfer is performed on each participating node.

3. The method according to claim 2, characterized in that The step of evaluating the priority of transferring data resources to each participating node according to the first target feature corresponding to each participating node includes: Sending a data resource transfer plan request to each participating node, and obtaining response information from each participating node; Generate a response information feature corresponding to each of the response information, and fuse the response information feature corresponding to each of the participating nodes with the first target feature to obtain a second target feature of each of the participating nodes; According to the second target feature corresponding to each participating node, a priority evaluation of data resource transfer is performed on each participating node.

4. The method according to claim 2, characterized in that: The node attribute information includes data resource transfer time information and data resource turnover plan information; the feature extraction of each node attribute information is performed to obtain the node attribute features corresponding to each participating node, including: For any of the participating nodes, feature extraction is performed on the data resource transfer time information to obtain time information features, and feature extraction is performed on the data resource turnover plan information to obtain data resource turnover information features; The time information feature and the data resource turnover information feature are feature-fused to obtain the node attribute feature of the participating node.

5. The method according to claim 1, characterized in that The first plan information is split to obtain the second plan information of each participating node in transferring data resources, including: Detecting the number of plan splits corresponding to the first plan information; If the number of plan splits is less than a preset number threshold, the first plan information is split in real time to obtain the second plan information of each participating node in transferring data resources; If the number of plan splits is not less than a preset number threshold, the first plan information is asynchronously split within a preset time period to obtain the second plan information for each participating node to transfer data resources.

6. The method according to claim 1, characterized in that The method further comprises: According to the second plan information of each participating node when transferring data resources, detecting whether there is tail difference data resource when transferring data resources this time; If there is tail difference data resource, generating tail difference processing plan information according to the tail difference data resource; According to the preset priority order of each participating node, the tail difference processing plan information is distributed to the corresponding participating node.

7. A device for generating data resource transfer plan information, characterized in that: Applied to a data resource transfer system, the data resource transfer system includes a plurality of participating nodes; the device includes: A detection module, used to obtain first plan information for transferring data resources, and detect a data resource transfer scenario for transferring data resources this time according to the first plan information; A splitting module, for splitting the first plan information according to the data resource ratio information previously transferred out by each participating node, to obtain the second plan information for each participating node to transfer in data resources, if the data resource transfer scenario is a full transfer scenario; A priority evaluation module, for obtaining node attribute information of each participating node if the data resource transfer scenario is a partial transfer scenario, and performing a priority evaluation of data resource transfer in for each participating node according to the node attribute information and the data resource ratio information previously transferred out by each participating node, to obtain a priority evaluation result; The splitting module is further used to split the first plan information according to the priority evaluation result to obtain the second plan information of each participating node when transferring data resources.

8. The device according to claim 7, characterized in that The priority evaluation module is also used to: Extracting features from the attribute information of each node respectively to obtain the node attribute features corresponding to each participating node; Characteristic encoding is performed on the proportion information of the data resources transferred out previously by each of the participating nodes to obtain the characteristic of the amount of data resources transferred out previously; According to the data resource quantity characteristics of each participating node, the node attribute characteristics of each participating node are weighted respectively to obtain the first target characteristics corresponding to each participating node; According to the first target feature corresponding to each participating node, a priority evaluation of data resource transfer is performed on each participating node.

9. The device according to claim 8, characterized in that The priority evaluation module is also used to: Sending a data resource transfer plan request to each participating node, and obtaining response information from each participating node; Generate a response information feature corresponding to each of the response information, and fuse the response information feature corresponding to each of the participating nodes with the first target feature to obtain a second target feature of each of the participating nodes; According to the second target feature corresponding to each participating node, a priority evaluation of data resource transfer is performed on each participating node.

10. The device according to claim 8, characterized in that The node attribute information includes data resource transfer time information and data resource turnover plan information; the priority evaluation module is also used to: For any of the participating nodes, feature extraction is performed on the data resource transfer time information to obtain time information features, and feature extraction is performed on the data resource turnover plan information to obtain data resource turnover information features; The time information feature and the data resource turnover information feature are feature-fused to obtain the node attribute feature of the participating node.

11. The device according to claim 7, characterized in that The splitting module is also used for: Detecting the number of plan splits corresponding to the first plan information; If the number of plan splits is less than a preset number threshold, the first plan information is split in real time to obtain the second plan information of each participating node in transferring data resources; If the number of plan splits is not less than a preset number threshold, the first plan information is asynchronously split within a preset time period to obtain the second plan information for each participating node to transfer data resources.

12. The device according to claim 7, characterized in that The data resource transfer plan information generating device further includes: A tail difference processing module is used to detect whether there is a tail difference data resource when transferring data resources this time according to the second plan information of each participating node when transferring data resources; If there is tail difference data resource, generating tail difference processing plan information according to the tail difference data resource; According to the preset priority order of each participating node, the tail difference processing plan information is distributed to the corresponding participating node.

13. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

14. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

15. A computer program product comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

Images