CN119066060A - A data processing method, system, computer device and readable storage medium - Google Patents

Abstract

The application relates to the technical field of data processing, and discloses a data processing method, a data processing system, computer equipment and a readable storage medium; the data processing method comprises the steps of responding to a distribution request, obtaining data sources and rule queues of a plurality of target clients, wherein the rule queues comprise a plurality of admittance rules of each cooperative mechanism, all admittance rules are arranged in descending order according to refused times, the data sources comprise data information corresponding to each admittance rule, and checking the data sources of the plurality of target clients and configuration data of the admittance rules of each cooperative mechanism to judge whether each target client accords with inflow requirements of the corresponding cooperative mechanism. The rule queues are arranged in descending order according to the reject times, so that when the data source of the target client and the admission rules are checked later, the rules with more reject times can be checked first and the check process of the next cooperation mechanism can be directly jumped into when the check fails, and the efficiency of the whole data processing can be improved.

Description

Data processing method, system, computer equipment and readable storage medium

Technical Field

The present application relates to the field of data processing technologies, and in particular, to a data processing method, a data processing system, a computer device, and a readable storage medium.

Background

And (3) screening the resources in the list according to a certain rule, and distributing the resources to the matched partner according to the requirement, namely executing a certain distribution rule, and distributing the data to the corresponding partner (mechanism) according to the distribution request.

The business requirement can feed back all mechanisms capable of passing the rule check and all failure reasons incapable of passing the rule check, and each cooperative mechanism executes a shunt rule according to business scenes of the shunt rule, as shown in fig. 1, according to a serial mode, a shunt request is firstly carried out, all data sources are called and data encapsulation is carried out, whether encapsulated data meet all rules of each mechanism is judged, in the process, each mechanism dimension is required to traverse all rule check structures, then the next mechanism rule structure is continuously traversed, the rule check cycle times are 25 times 100=2500, average parameter encapsulation consumption of each parameter and single rule check consumption are calculated, and a longer time consumption is generated in an independent shunt process.

Disclosure of Invention

In view of this, embodiments of the present application provide a data processing method, system, computer device, and readable storage medium, which can effectively solve the problem of long time consumption in the data processing process.

In a first aspect, an embodiment of the present application provides a data processing method, where the method includes:

Responding to the distribution request, and acquiring data sources and rule queues of a plurality of target clients, wherein the rule queues comprise a plurality of admittance rules of each cooperative mechanism, and all the admittance rules are arranged in descending order according to refused times;

And verifying the data sources of the target clients and the configuration data of the admission rules of each cooperative mechanism so as to judge whether each target client meets the inflow requirement of the corresponding cooperative mechanism.

In some embodiments, said verifying the data sources of a plurality of said target clients with configuration data of said admission rules of each said partner comprises:

and checking each data source with all the admission rules of each cooperative mechanism in sequence according to the ordering in the rule queue, and checking all the admission rules of the next cooperative mechanism directly if the current admission rules of the current cooperative mechanism are not met.

In some embodiments, the rule queue is pre-constructed and includes:

acquiring the data sources of a plurality of clients;

Determining configuration data of all the admission rules of a plurality of cooperators;

Checking the data sources of all clients with the configuration data of all the admission rules of each cooperative organization to obtain the refused times of each admission rule;

And according to the refused times of the admittance rules, all the admittance rules are arranged in a descending order to obtain the rule queue.

In some embodiments, said verifying said data sources of all clients with said configuration data of all said admission rules of each said partner organization to obtain a number of rejections of each said admission rule comprises:

Checking the data source of each client and the configuration data of all the admission rules of each cooperative mechanism in sequence, and counting the refused times of each admission rule under each cooperative mechanism when the checking fails;

and accumulating the refused times of each admittance rule under all the cooperation institutions to obtain the refused times of each admittance rule.

In some embodiments, a parallel calling mode is adopted to obtain data sources of a plurality of target clients, all the obtained data sources are subjected to data encapsulation to obtain a data set, and the data set is checked with configuration data of all the admission rules of each cooperation mechanism in sequence.

In some embodiments, the data sources of a plurality of said target clients are stored in a cache and/or database according to set requirements;

when the data source of the target client is stored in the cache, directly calling the data source of the target client in the cache;

When the data source of the target client is stored in the database, the database is read to call the data source of the target client.

In some embodiments, verifying the data source of each of the target clients with configuration data of the admission rules of each of the partnerships comprises:

According to the order of the admission rules in the rule queue, firstly checking the data source of the target client and the configuration data of the first admission rule of the cooperative mechanism;

If the verification is successful, the configuration data of the next admission rule in the rule queue is circularly executed for verification until all the admission rules are successfully verified, and the current target client is judged to accord with the inflow requirement of the current cooperative mechanism;

If the verification fails, directly stopping the continuous verification of the current cooperative mechanism, and judging that the current target client does not meet the inflow requirement of the current cooperative mechanism.

In a second aspect, an embodiment of the present application provides a data processing system, including:

The rule queue module is configured to acquire a rule queue, wherein the rule queue comprises a plurality of admittance rules of each cooperative mechanism, and all the admittance rules are arranged in descending order according to refused times;

the data acquisition module is configured to respond to the distribution request and acquire data sources of a plurality of target clients, wherein the data sources comprise data information corresponding to each admission rule;

And the response verification module is configured to verify the data sources of the target clients and the configuration data of the admission rules of each cooperative organization so as to judge whether each target client meets the inflow requirement of the corresponding cooperative organization.

In a third aspect, an embodiment of the present application provides a computer apparatus, where the computer apparatus includes a processor and a memory, where the memory stores a computer program, and the processor is configured to execute the computer program to implement the data processing method described above.

In a fourth aspect, embodiments of the present application provide a computer readable storage medium storing a computer program which, when executed on a processor, implements a data processing method according to the above.

The embodiment of the application has the following beneficial effects:

The data processing method provided by the application has the advantages that the rule queues are arranged in a descending order according to the refused times, so that when the data source of the target client and the admittance rules are checked later, the rules with more refused times can be checked first, the target client is checked to be out of the admittance rules of the current cooperative mechanism in a high-efficiency way, and then the check process of the next cooperative mechanism is directly jumped into.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments will be briefly described below, it being understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

FIG. 1 is a flow diagram of a prior art data processing method;

FIG. 2 shows a flow chart of a data processing method in an embodiment of the application;

FIG. 3 is a flow chart of a rule queue acquisition process according to an embodiment of the present application;

FIG. 4 is a schematic diagram of a parallel call acquisition data source according to an embodiment of the present application;

FIG. 5 is a schematic diagram of a data processing system in an embodiment of the application.

Detailed Description

The following description of the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present application, but not all embodiments.

The components of the embodiments of the present application generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the application, as presented in the figures, is not intended to limit the scope of the application, as claimed, but is merely representative of selected embodiments of the application. All other embodiments, which can be made by a person skilled in the art without making any inventive effort, are intended to be within the scope of the present application.

The terms "comprises," "comprising," "including," or any other variation thereof, are intended to cover a specific feature, number, step, operation, element, component, or combination of the foregoing, which may be used in various embodiments of the present application, and are not intended to first exclude the presence of or increase the likelihood of one or more other features, numbers, steps, operations, elements, components, or combinations of the foregoing. Furthermore, the terms "first," "second," "third," and the like are used merely to distinguish between descriptions and should not be construed as indicating or implying relative importance.

Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which various embodiments of the application belong. The terms (such as those defined in commonly used dictionaries) will be interpreted as having a meaning that is the same as the context of the relevant art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein in connection with the various embodiments of the application.

Some embodiments of the present application are described in detail below with reference to the accompanying drawings. The embodiments described below and features of the embodiments may be combined with each other without conflict.

In-bank banking cooperation projects, considering property admittance and insufficient money in self-bank tables, the whole loan scale is required to be enlarged by utilizing the diversion effect of a cooperative bank, namely an off-table bank, or the cost is controlled, the cost is reduced and the efficiency is improved, the fund cost of self-camping and off-table institutions is required to be comprehensively measured and calculated, and in order to realize benefit maximization, the most suitable property is required to be distributed to the most suitable cooperative institutions at the most suitable time. Therefore, a data processing method is provided, namely, according to a pre-obtained rule ordering result, data in a streaming request process is responded quickly and in real time, so that the data processing efficiency is improved, and suitable assets can be distributed to suitable cooperation institutions at suitable time.

The data processing method is described below in connection with some specific embodiments.

Fig. 2 shows a flow chart of a data processing method according to an embodiment of the application. The data processing method comprises the following steps:

S100, a rule queue is obtained in advance, the rule queue comprises a plurality of admittance rules of each cooperative mechanism, and all admittance rules are arranged in descending order according to the refused times.

When a rule queue is obtained in advance, a large number of data sources of target clients are obtained, verification processing is carried out on the data sources and admission rules of a cooperation mechanism, and then sequencing is carried out on the basis of a verification result, so that the rule queue is obtained.

The pre-construction process of the rule queue acquisition method comprises the following steps of:

S110, acquiring data sources of a plurality of clients;

In one example of the present application, the plurality of data information included in the data source is a borrowing amount and an enterprise size, wherein the borrowing amount is determined according to an actual determination, and the enterprise size includes micro, medium and large. As other implementation manners, the method can also comprise credit rating and the like, the data information type of the specific data source can be set according to service requirements, and the application does not limit the items of the data source.

In a specific example, the target clients include a target client 1, a target client 2 and a target client 3, the data source of the target client 1 includes 1 ten thousand of borrowing amount, the enterprise scale is miniature, the data source of the target client 2 includes 5 ten thousand of borrowing amount, the enterprise scale is miniature, the data source of the target client 3 includes 10 ten thousand of borrowing amount, and the enterprise scale is miniature.

S120, determining configuration data of all admission rules of a plurality of cooperative institutions;

The admission rules in the application are in one-to-one correspondence with the data information in the data source, in some embodiments, the admission rules at least comprise borrowing amount and enterprise scale, the quantity and the rule content of the admission rules are set according to the service requirement, and the admission rules can be matched with the data.

In a specific example, the admission rules of the partner 1 include the borrowing amount [10 ten thousand, 50 ten thousand ] and the enterprise scale [ large and medium ], and the admission rules of the partner 2 include the borrowing amount [50 ten thousand, 100 ten thousand ] and the enterprise scale [ medium and small ].

S130, checking the data sources of all clients and the configuration data of all admission rules of each cooperative institution to obtain the refused times of each admission rule;

the implementation method comprises the steps of checking the data source of each client and the configuration data of all the admission rules of each cooperative organization, judging that each admission rule is refused when the checking fails, and counting the refused times of each admission rule.

Illustratively, all data information of the client 1 is first sequentially combined with the partner 1, The configuration data of all the admittance rules of the cooperative institution 2 are checked, specifically, the data information 1 (borrowed amount [1 ] is checked with the admittance rules 1 (borrowed amount [10 ] and 50 ] of the cooperative institution 1), if the check fails, the data information 1 (borrowed amount [1 ] is refused by the admittance rules 1 (borrowed amount) of the cooperative institution 1, at this time, the refused times of the admittance rules 1 are counted as1, the data information 2 (enterprise scale [ micro ]) of the client 1 is checked with the admittance rules 2 (enterprise scale [ large and medium-sized ]) of the cooperative institution 1, if the check fails, the data information 2 (enterprise scale [ micro ]) is refused by the admittance rules 2 (enterprise scale) of the cooperative institution 1, at this time, the refused times of the admittance rules 2 are counted as1, and the data information 1 (borrowed amount [50 ] and 100 ] of the cooperative institution 2) of the client 1 is checked to be refused by the admittance rules 2 (enterprise scale of the cooperative institution 1, if the data information 1 (borrowed amount [1 ] and the admittance rules 2 of the medium-size of the cooperative institution 2) are refused by the data rules 2 (enterprise scale) of the cooperative institution 1, at this time, the number of refusal times of the admission rule 2 is counted as 2, and then all data information of the client 2 is sequentially combined with the cooperative institution 1, The configuration data of all the admittance rules of the cooperative institution 2 are checked, specifically, the data information 1 (borrowed amount [5 ] in ten thousand) of the client 2 is checked with the admittance rules 1 (borrowed amount [10 in ten thousand, 50 in ten thousand) of the cooperative institution 1, if the check fails, the data information 1 (borrowed amount [5 in ten thousand) is refused by the admittance rules 1 (borrowed amount) of the cooperative institution 1, at this time, the refused times of the admittance rules 1 are statistically 3, the data information 2 (enterprise-size [ micro ]) of the client 2 is checked with the admittance rules 2 (enterprise-size [ large-scale and medium-scale ]) of the cooperative institution 1, if the check fails, the data information 2 (enterprise-size [ micro ]) is refused by the admittance rules 2 (enterprise-size) of the cooperative institution 1, at this time, the refused times of the data information 2 (borrowed amount [ micro ]) of the client 2 is statistically 3, and if the data information 1 (borrowed amount [5 in ten thousand ]) of the cooperative institution 2 is checked with the admittance rules 1 (borrowed amount [50 in ten thousand, 100 in ten thousand ]) of the check fails, and if the data information 1 (refused amount of the data 1 (borrowed amount [5 in ten thousand ]) is refused by the enterprise-size of the cooperative institution) is refused by the data rules 2 (micro-size of the enterprise-size) of the client 2) and the data rules 2 (refused by the data rules) of the data 1 (refused by the micro-size of the enterprise-size [ micro-size and the data 1), at this time, the number of refused times of the admission rule 2 is counted to be 4, and finally, all data information of the client 3 is sequentially combined with the cooperative institution 1, Verifying configuration data of all admittance rules of the cooperative institution 2, specifically, verifying the data information 1 (borrowing amount [10 ten thousand ]) of the client 3 with the admittance rules 1 (borrowing amount [10 ten thousand, 50 ten thousand ]) of the cooperative institution 1, if the verification is successful, the data information 1 (borrowing amount [10 ten thousand ]) can be received by the admittance rules 1 (borrowing amount) of the cooperative institution 1, and at this time, the refusal times statistics of the admittance rules 1 are maintained to be 4; checking the data information 2 (enterprise scale [ micro ]) of the client 3 with the admittance rule 2 (enterprise scale [ large and medium ]) of the cooperative mechanism 1, if the checking fails, the data information 2 (enterprise scale [ micro ]) is refused by the admittance rule 2 (enterprise scale) of the cooperative mechanism 1, when the refused times of the admittance rule 2 is counted as 5, then checking the data information 1 (borrowed amount [10 ten thousand ]) of the client 3 with the admittance rule 1 (borrowed amount [50 ten thousand, 100 ten thousand ]), if the checking fails, then the data information 1 (borrowed amount [10 ten thousand ]) is refused by the admittance rule 1 (borrowed amount) of the cooperative mechanism 2, when the refused times of the admittance rule 1 is counted as 5, if the checking fails, the data information 2 (enterprise scale [ micro ]) of the client 3 is checked by the admittance rule 2 (enterprise scale [ medium and small ]), when the checking fails, the data information 2 (enterprise scale [ micro ]) is refused by the admittance rule 2 (enterprise scale) of the cooperative mechanism 2), at this time, the reject number of the admission rule 2 is statistically 6. that is, for admission rule 1 (borrowing amount), partner 1 would reject client 1 and client 2, number of times +2, partner 2 would reject client 1, client 2 and client 3, number of times +3, and finally, admission rule 1 (borrowing amount) would be rejected 5 times, for admission rule 2 (enterprise scale), partner 1 would reject client 1, client 2 and client 3, number of times +3, partner 2 would reject client 1, client 2 and client 3, number of times +3, and finally, admission rule 2 (enterprise scale) would be rejected 6 times.

And S140, according to the refused times of the admission rules, all the admission rules are arranged in a descending order to obtain a rule queue.

In the present example, admission rule 1 (borrowing amount) is denied a number of times of 5, and admission rule 2 (enterprise scale) is denied a number of times of 6. The order of descending order is the admittance rule 2 and the admittance rule 1 according to the refused times of the admittance rule, so that a rule queue is obtained as the admittance rule 2 and the admittance rule 1.

The application can clearly record the reasons of refusal of all institutions by checking each admittance rule and counting the refused times of each admittance rule, and then carries out sorting treatment on all admittance rules according to the refused times from big to small, thus ensuring that whether the current cooperation institution is refused or not can be responded quickly when the shunting is responded in real time, thereby skipping the current cooperation institution and continuing to judge that the shunting can be shunted to the next cooperation institution.

And S200, responding to the splitting request, and acquiring data sources of a plurality of target clients, wherein each data source comprises a plurality of data information corresponding to each admission rule.

In the embodiment of the application, the data sources of a plurality of target clients are acquired in a parallel calling mode, as shown in fig. 4, the plurality of data sources are acquired simultaneously in a parallel calling mode, all the acquired data sources are subjected to data encapsulation to obtain the data set, the encapsulated data set is checked with configuration data of all the admission rules of each cooperative mechanism in sequence, and the plurality of data sources can be prevented from being interfered and lost in the transmission process through encapsulation, so that the correctness of the transmission process of the plurality of data sources is ensured.

In practical application, some real-time statistical data cannot be cached, some client loan performance data can be cached for one day, some business information and tax data can be cached for 90 days, so that different data sources can be cached or stored in a database, namely, the caching time of each data source is configured according to the freshness requirement of the data information of the data source, and the corresponding data source is cached or stored in the database according to the caching time of the data source, wherein the freshness requirement refers to the caching time of the data information. When the data source of the target client is stored in the database, the data source of the target client is called directly.

Compared with the prior art that serial calling is adopted, the method can improve the speed of acquiring data and packaging by adopting a parallel calling mode, and then the data sources in the cache are directly called, so that the system overhead can be greatly reduced compared with the method that the data sources are read from the database, and the speed of data packaging is further greatly improved.

And S300, checking the data sources of the target clients and the admission rules of each cooperative mechanism to judge whether each target client meets the inflow requirement of the corresponding cooperative mechanism.

In some embodiments, when checking, each data source is checked with all the admission rules of each coordination mechanism in turn according to the ordering in the rule queue, and if the current admission rule of the current coordination mechanism is not met, the data source is checked with all the admission rules of the next coordination mechanism directly.

The process of checking the data source of each target client and the admission rules of each cooperative mechanism comprises the steps of checking the data source of the target client and the configuration data of the first admission rule of the cooperative mechanism according to the sequence of admission rules in a rule queue, if the check is successful, checking the configuration data of the next admission rule in a loop execution rule queue until all the admission rules are checked successfully, judging that the current target client meets the inflow requirement of the current cooperative mechanism, if the check is failed, directly stopping the continuous check of the current cooperative mechanism, and judging that the current target client does not meet the inflow requirement of the current cooperative mechanism.

Because the admittance rule sequence in the rule queue is arranged in descending order according to the refused times, the refused probability of the first check in the check process is relatively large, and thus the response can be realized quickly. If the data source of the current target client fails to be checked once, the current target client is judged to be unable to be shunted to the current cooperative mechanism, the check of the follow-up admittance rule in the follow-up rule queue is no longer carried out to waste time, and meanwhile, the check is carried out by jumping out from the next cooperative mechanism so as to quickly respond to the check process.

FIG. 5 is a schematic diagram of a data processing system according to an embodiment of the present application. Illustratively, the data processing system includes a rule queue module, a data acquisition module, and a response verification module;

The rule queue module is configured to acquire a rule queue, wherein the rule queue comprises a plurality of admittance rules of each cooperative mechanism, and all admittance rules are arranged in descending order according to refused times;

the data acquisition module is configured to respond to the distribution request and acquire data sources of a plurality of target clients, wherein the data sources comprise data information corresponding to each admission rule;

The response verification module is configured to verify the data sources of the plurality of target clients with the configuration data of the admission rules of each cooperative organization to determine whether each target client meets the inflow requirements of the corresponding cooperative organization.

It will be appreciated that the apparatus of this embodiment corresponds to the data processing method of the above embodiment, and the options in the above embodiment are equally applicable to this embodiment, so the description will not be repeated here.

The data processing system provided by the application can ensure the response efficiency of the client and meet the requirement of subsequent data analysis through the splitting of the rule queue module and the response verification module, the response service of the target client and the processing rule service of the background can not be influenced by the split rule queue module and the response verification module, the system can automatically adjust the rule queue according to the refused times, namely the rule sequence of the admission rule which is checked in priority, the automatic performance tuning of the system is realized, and the development, test and operation cost is greatly saved.

The present application also provides a computer device, which illustratively comprises a processor and a memory, wherein the memory stores a computer program, and the processor causes the computer device to execute the above-mentioned data processing method or the functions of the respective modules in the above-mentioned data processing system by running the computer program.

The processor may be an integrated circuit chip with signal processing capabilities. The processor may be a general purpose processor including at least one of a central processing unit (Central Processing Unit, CPU), a graphics processor (Graphics Processing Unit, GPU) and a network processor (Network Processor, NP), a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware components. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like that may implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present application.

The Memory may be, but is not limited to, random access Memory (Random Access Memory, RAM), read Only Memory (ROM), programmable Read Only Memory (Programmable Read-Only Memory, PROM), erasable Read Only Memory (Erasable Programmable Read-Only Memory, EPROM), electrically erasable Read Only Memory (Electric Erasable Programmable Read-Only Memory, EEPROM), etc. The memory is used for storing a computer program, and the processor can correspondingly execute the computer program after receiving the execution instruction.

The present application also provides a computer readable storage medium storing the computer program for use in the above computer device. For example, the computer readable storage medium may include, but is not limited to, U disk, removable hard disk, read-Only Memory (ROM), random access Memory (RAM, random Access Memory), magnetic or optical disk, etc. various media that can store program code.

In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other manners. The apparatus embodiments described above are merely illustrative, for example, of the flow diagrams and block diagrams in the figures, which illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

In addition, functional modules or units in various embodiments of the application may be integrated together to form a single part, or the modules may exist alone, or two or more modules may be integrated to form a single part.

The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a smart phone, a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present application.

The foregoing is merely illustrative of the present application, and the present application is not limited thereto, and any person skilled in the art will readily recognize that variations or substitutions are within the scope of the present application.

Claims (10)

1. A data processing method, characterized in that the method comprises: In response to the diversion request, a data source and a rule queue of multiple target customers are obtained; the rule queue includes multiple access rules of each cooperative institution, and all the access rules are arranged in descending order according to the number of rejections; the data source includes data information corresponding to each access rule; The data sources of the plurality of target customers are verified with the configuration data of the access rules of each of the cooperation institutions to determine whether each of the target customers meets the inflow requirements of the corresponding cooperation institution. 2. The data processing method according to claim 1, characterized in that the step of verifying the data sources of the plurality of target customers with the configuration data of the access rules of each of the cooperation institutions comprises: According to the order in the rule queue, each data source is verified with all the access rules of each cooperative institution in turn. If it does not comply with the current access rule of the current cooperative institution, it is directly verified with all the access rules of the next cooperative institution. 3. The data processing method according to claim 1, wherein the rule queue is pre-built and comprises: Obtaining the data sources of multiple customers; determining configuration data of all said access rules for a plurality of partner organizations; Verify the data sources of all customers with the configuration data of all the access rules of each of the cooperation institutions to obtain the number of rejections of each access rule; According to the number of rejections of the access rules, all the access rules are arranged in descending order to obtain the rule queue. 4. The data processing method according to claim 3, characterized in that the step of verifying the data sources of all customers with the configuration data of all the access rules of each of the cooperative institutions to obtain the number of rejections of each access rule comprises: Verify the data source of each customer with the configuration data of all access rules of each cooperative institution in turn, and when the verification fails, count the number of rejections of each access rule under each cooperative institution; The number of rejections for each access rule under all the cooperation institutions is accumulated to obtain the number of rejections for each access rule. 5. The data processing method according to claim 1 is characterized in that a plurality of data sources of the target customers are obtained by parallel calling, and all the obtained data sources are encapsulated to obtain a data set, and the data set is verified in turn with the configuration data of all the access rules of each of the cooperative institutions. 6. The data processing method according to claim 5, characterized in that the data sources of the plurality of target customers are stored in a cache and/or a database according to set requirements; When the data source of the target customer is stored in the cache, directly calling the data source of the target customer in the cache; When the data source of the target customer is stored in the database, the data source of the target customer is called by reading the database. 7. The data processing method according to claim 2, characterized in that verifying the data source of each target customer with the configuration data of the access rule of each cooperative institution comprises: According to the order of the access rules in the rule queue, the data source of the target customer is first verified with the configuration data of the first access rule of the cooperative institution; If the verification is successful, the configuration data of the next access rule in the rule queue is executed cyclically for verification until all the access rules are verified successfully, and it is determined that the current target customer meets the inflow requirements of the current cooperative institution; If the verification fails, the verification of the current cooperation institution will be stopped directly, and it will be determined that the current target customer does not meet the inflow requirements of the current cooperation institution. 8. A data processing system, comprising: A rule queue module is configured to obtain a rule queue, wherein the rule queue includes a plurality of access rules of each cooperative institution, and all the access rules are arranged in descending order according to the number of rejections; A data acquisition module, configured to respond to the diversion request and acquire data sources of multiple target customers; the data sources include data information corresponding to each access rule; The response verification module is configured to verify the data sources of the plurality of target customers with the configuration data of the access rules of each of the cooperation institutions to determine whether each of the target customers meets the inflow requirements of the corresponding cooperation institution. 9. A computer device, characterized in that the computer device comprises a processor and a memory, the memory stores a computer program, and the processor is used to execute the computer program to implement the data processing method according to any one of claims 1 to 7. 10. A computer-readable storage medium, characterized in that it stores a computer program, and when the computer program is executed on a processor, it implements the data processing method according to any one of claims 1 to 7.