[go: up one dir, main page]

CN107689010B - Method and device for batch processing policy tasks, computer equipment and storage medium - Google Patents

Method and device for batch processing policy tasks, computer equipment and storage medium Download PDF

Info

Publication number
CN107689010B
CN107689010B CN201710614396.2A CN201710614396A CN107689010B CN 107689010 B CN107689010 B CN 107689010B CN 201710614396 A CN201710614396 A CN 201710614396A CN 107689010 B CN107689010 B CN 107689010B
Authority
CN
China
Prior art keywords
policy
tasks
sub
preserving
task
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201710614396.2A
Other languages
Chinese (zh)
Other versions
CN107689010A (en
Inventor
邵正铂
李斌
陈杰
高雪
马向东
丁杰
张捷
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ping An Technology Shenzhen Co Ltd
Original Assignee
Ping An Technology Shenzhen Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Ping An Technology Shenzhen Co Ltd filed Critical Ping An Technology Shenzhen Co Ltd
Priority to CN201710614396.2A priority Critical patent/CN107689010B/en
Priority to PCT/CN2017/104643 priority patent/WO2019019381A1/en
Publication of CN107689010A publication Critical patent/CN107689010A/en
Application granted granted Critical
Publication of CN107689010B publication Critical patent/CN107689010B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2246Trees, e.g. B+trees
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/08Insurance

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • General Physics & Mathematics (AREA)
  • Development Economics (AREA)
  • Technology Law (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • Software Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)

Abstract

The embodiment of the invention provides a method and a device for processing policy maintenance tasks in batch, computer equipment and a storage medium. The method for processing policy tasks in batches comprises the following steps: extracting the to-be-processed policy tasks of the same category from a plurality of to-be-processed policies; splitting the policy maintenance tasks into sub policy maintenance tasks according to the number of the policy maintenance tasks of the same category and a preset threshold range, wherein the number of the sub policy maintenance tasks is within the preset threshold range; starting a plurality of subprocesses to process the child policy-preserving task; and when all the sub-policy tasks are processed, summarizing and displaying the processing results of the sub-policy tasks. The invention improves the processing efficiency of large-batch insurance policies.

Description

Method and device for batch processing policy tasks, computer equipment and storage medium
Technical Field
The invention relates to the technical field of insurance, in particular to a method and a device for processing policy tasks in batches, computer equipment and a storage medium.
Background
In the field of insurance, auditing work related to insurance policies of clients is often required, and in order to reduce the workload of underwriters and improve underwriting efficiency, auditing work related to insurance policies with certain commonalities can be automatically underwritten by a computer device or a server according to a preset rule.
At present, in an operation flow of performing automatic underwriting by a computer device or a server, when underwriting involves group insurance, a case that an amount of report of the group insurance is very large can be encountered, which can reach thousands or even tens of thousands of insurance policies, and an audit rule set for each insurance policy is often not only one, in which case, if a processing time required for performing self-underwriting on each insurance policy one by one according to a current processing method is relatively long, a processing efficiency of the computer device or the server is relatively low.
Disclosure of Invention
The embodiment of the invention provides a method, a device, computer equipment and a storage medium for batch processing of policy maintenance tasks, which can improve the processing efficiency of the batch policy maintenance tasks.
A method of batch processing policy tasks, the method comprising:
extracting the to-be-processed policy tasks of the same category from a plurality of to-be-processed policies;
splitting the policy maintenance tasks into sub policy maintenance tasks according to the task number of the policy maintenance tasks of the same category and a preset threshold range, wherein the task number of the sub policy maintenance tasks is within the preset threshold range;
starting a plurality of subprocesses to process the child policy-preserving task;
and when all the sub-policy tasks are processed, summarizing and displaying the processing results of the sub-policy tasks.
Further, the step of splitting the policy tasks into sub policy tasks according to the number of tasks of the policy tasks of the same category and a preset threshold range, wherein the number of tasks of the sub policy tasks is within the preset threshold range includes:
when the number of the obtained policy tasks is larger than a preset threshold range, determining the policy tasks as root nodes of a binary tree to create the binary tree, and splitting the policy tasks into sub policy tasks;
and judging whether the number of the sub policy preserving tasks is larger than a preset threshold range, if so, taking the sub policy preserving tasks as intermediate nodes of the binary tree, splitting the sub policy preserving tasks of the intermediate nodes into the sub policy preserving tasks of the next node of the intermediate nodes, otherwise, taking the sub policy preserving tasks as leaf nodes of the binary tree, and then, circulating the judging and splitting steps until the number of all the sub policy preserving tasks is within the preset threshold range.
Further, the step of starting a plurality of sub-processes to process the sub-policy-preserving task comprises:
acquiring the number of intermediate nodes with the same depth and the number of leaf nodes in the binary tree;
and according to the sequence that the depth is deeper and the priority is higher, starting a plurality of subprocesses to simultaneously process the child policy-preserving tasks of the middle nodes and the child policy-preserving tasks of the leaf nodes in the same depth, wherein the number of the subprocesses is the sum of the number of the middle nodes and the number of the leaf nodes in the corresponding depth.
Further, the step of starting a plurality of sub-processes to process the sub-policy-preserving task further comprises:
when the processing process of one sub-policy-preserving task needs the processing results of other sub-policy-preserving tasks as the basis, the highest priority is defined for the other sub-policy-preserving tasks, and the other sub-policy-preserving tasks are processed preferentially.
Further, the step of starting the plurality of subprocesses to process the child policy task further comprises:
and starting a plurality of sub processes to automatically audit the sub policy-keeping task according to a preset rule.
An apparatus for batch processing policy tasks, the apparatus comprising:
the extraction module is used for extracting the policy tasks to be processed in the same category from the plurality of policies to be processed;
the system comprises a splitting module, a scheduling module and a scheduling module, wherein the splitting module is used for splitting policy tasks into sub policy tasks according to the number of policy tasks in the same category and a preset threshold range, and the number of the sub policy tasks is within the preset threshold range;
the processing module is used for starting a plurality of subprocesses to process the child policy-preserving task;
and the display module is used for summarizing and displaying the processing results of the sub-policy-keeping tasks when all the sub-policy-keeping tasks are processed.
Further, the apparatus comprises:
a binary tree creating module, configured to determine the policy task as a root node of a binary tree to create the binary tree and split the policy task into sub policy tasks when the number of the policy tasks is greater than a preset threshold range;
and the node determining module is used for judging whether the number of the sub policy-preserving tasks is larger than a preset threshold range, if so, taking the sub policy-preserving tasks as intermediate nodes of the binary tree, splitting the sub policy-preserving tasks of the intermediate nodes into the sub policy-preserving tasks of the next node of the intermediate nodes, otherwise, taking the sub policy-preserving tasks as leaf nodes of the binary tree, and then, circulating the judging and splitting steps until the number of all the sub policy-preserving tasks is within the preset threshold range.
Furthermore, the processing module is also used for starting a plurality of subprocesses to automatically audit the sub-policy-preserving task according to a preset rule.
A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor when executing the program implementing a method of bulk processing policy tasks as described above.
A storage medium configured to store program code for performing the steps of the above-described method of batch policy handling.
The invention splits the multiple policy tasks to be processed according to the number and ensures that the number of the split final sub policy tasks is in a certain range, so that the system can simultaneously process the multiple policy tasks to be processed through multiple sub processes, thereby adapting to the self-checking work of the large-batch policy, and improving the processing efficiency of the large-batch policy.
Drawings
FIG. 1 is a flow diagram of a method of batch processing policy tasks according to one embodiment of the invention;
FIG. 2 is a flow diagram of a method of batch processing policy tasks according to another embodiment of the invention;
FIG. 3 is a flow diagram of a method of batch processing policy tasks according to yet another embodiment of the invention;
FIG. 4 is a schematic diagram of a binary tree for a usage scenario in accordance with the present invention;
FIG. 5 is a schematic diagram of a binary tree for another usage scenario in accordance with the present invention;
FIG. 6 is a block diagram of an exemplary architecture of an apparatus for batch processing policy tasks according to one embodiment of the invention;
fig. 7 is a schematic diagram of an internal structure of a computer device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Fig. 1 is a flowchart of a method for batch processing policy tasks according to an embodiment of the present invention, and the method for batch processing policy tasks according to an embodiment of the present invention is described in detail below with reference to fig. 1, and as shown in fig. 1, the method for batch processing policy tasks includes the following steps S101, S102, S103, S104, S105, and S106.
S101, extracting the to-be-processed policy tasks of the same category from a plurality of to-be-processed policies.
According to one example of the embodiment, the types of the policy tasks to be processed include, but are not limited to, the age of the insured person, the occupation of the insured person, and the like, the policy tasks to be processed are to extract the policy tasks of the same category from a plurality of policies to be processed, the extracted policy tasks are used as the policy tasks to be processed, and the policy identifier of the policy to which the policy tasks belong is added to each policy task, wherein the policy identifier is, for example, the policy number of the policy, the identity number of the insured person, and the like.
And S102, acquiring the number of the policy retaining tasks to be processed in the same category.
According to a usage scenario of this embodiment, for example, the policy to be automatically checked is a group policy of a certain company, the number of the policies to be automatically checked is 1000, wherein each policy has the age of the insured person, the professional industry engaged by the insured person, the guarantee amount of the policy, and so on, the ages of the insured persons of all the policies can be extracted as one of the policy tasks to be processed, the industries engaged by the insured persons of all the policies can be extracted as another policy task to be processed, and the guarantee amount of the policy can be similarly extracted.
And then splitting the policy maintenance tasks into sub policy maintenance tasks according to the number of the policy maintenance tasks of the same category and a preset threshold range, wherein the number of the sub policy maintenance tasks is within the preset threshold range. The specific splitting step includes the following steps S103 and S104.
S103, when the obtained number is larger than a preset threshold range, splitting the policy maintenance task into sub policy maintenance tasks.
According to an example of this embodiment, the threshold range is a value preset by the user, for example, when the preset threshold range is 0 to 200 and the number of policy tasks to be processed extracted according to the age of the insured person is 1000, the policy tasks to be processed need to be split.
The splitting may be based on the number of policy tasks, the splitting may be performed layer by layer in a binary tree manner, or may be performed equally according to the obtained number, the number of split sub policy tasks may be the same as the maximum value in the preset threshold range, for example, when the preset threshold range is 0 to 200, if the split is performed layer by layer in a binary tree manner, 1000 to-be-processed policy tasks may be split into 200 and 800, and if the split is performed in an equally-divided manner, 1000 to-be-processed policy tasks may be split into 200, and 200.
And S104, judging whether the number of the split sub-policy-keeping tasks is larger than a preset threshold range, if so, splitting the sub-policy-keeping tasks into new sub-policy-keeping tasks and circulating the judging and splitting steps until the number of all the split sub-policy-keeping tasks is within the preset threshold range.
In the step, the number of the split final sub-policy tasks is within a preset threshold range through the judging and splitting circulation step, so that the complexity of each sub-policy task is controlled to a certain degree, and the computer equipment can process the policy task to be processed by starting a plurality of sub-processes.
And S105, starting a plurality of subprocesses to process the child policy-preserving task.
According to an example of the embodiment, the sub-policy tasks can be processed simultaneously by utilizing the opened sub-processes so as to accelerate the processing efficiency of the tasks.
And S106, when all the sub-policy-keeping tasks are processed, summarizing and displaying the processing results of the sub-policy-keeping tasks.
According to an example of this embodiment, the summarizing method may be that a corresponding relationship between the policy tasks and the policies is established by adding the policy identifiers of the policies to which the policy tasks belong to each policy task, and the processing results of the reporting tasks belonging to the same policy identifier are summarized.
According to the usage scenario of the present embodiment following steps S102 and S103, for example, the policy task to be processed extracted from 1000 policies to be processed is 1000 insured persons 'ages, the sub policy task is processed to determine whether the insured person' S age meets the underwriting rules, and in the policy process of determining whether the insured person 'S age meets the underwriting rules, for example, the group policy, if the insured person' S age exceeds a preset value (for example, 60 years), the processing result is that the underwriting is not passed, otherwise, the processing result is that the underwriting is not passed, such processing is performed on all of the extracted 1000 insured persons 'ages, and it is determined whether the extracted insured person' S age exceeds 60 years, if not, the approval is passed, otherwise, the approval is determined to be not passed.
When the extracted policy task to be processed is to examine the profession of the extracted insured person, the policy task to be processed is to extract the industry in which the insured person is engaged in 1000 policies, according to the similar usage scenario, the sub policy task is processed, for example, whether the profession in which the insured person is engaged is a dangerous profession or not is judged, and whether the profession in which the insured person is engaged is a dangerous profession or not can be realized through the following steps: acquiring the occupation of the insured person stored in the electronic insurance policy, judging whether the acquired occupation contains preset keywords, if so, judging that the occupation of the insured person is a dangerous occupation, and if not, judging that the underwriting does not pass through a processing result, otherwise, judging that the underwriting passes through the processing result. And then, according to the corresponding relation between each policy task and the policy to which the policy task belongs, summarizing the processing result of the policy task into the corresponding policy.
In the embodiment, a plurality of group policy is split into different categories of to-be-processed policy tasks according to different auditing rules, then each category of to-be-processed policy tasks are split according to the number, and the number of split final sub policy tasks is ensured to be within a certain range, so that the system can process a plurality of to-be-processed policy tasks simultaneously through a plurality of sub processes, and finally, processing results are collected to adapt to self-checking work of large-batch policy casting, and the processing efficiency of large-batch policy casting is improved.
FIG. 5 is a schematic diagram of a binary tree according to another usage scenario of the present invention, for example, all policy to be underwritten includes a group policy of three insured persons and a group policy of four insured persons, but only for easy understanding, the group policy includes two persons, and the group policy may include thousands of policy during the actual business operation, referring to FIG. 5, the policy task of rule A is to examine the age of insured persons, the policy task of rule B is to examine the occupation of insured persons, the group electronic policy of three insured persons stores the age of three and the occupation of three insured persons, the group electronic policy of four insured persons stores the age of four insured persons and the occupation of four insured persons, and the split policy tasks to be processed include the first policy task, the age of insured persons, the age of three insured persons, the age of four insured persons, the number of six insured persons, the number of the two insured persons, and the number of the two insured persons, The second policy task, the job undertaken by the insured person, then judges, splits and processes the number contained in the policy task by taking the policy task as a unit, when all policy tasks are processed, collects the processing results of the policy corresponding to the same policy identifier according to the policy to which each policy task belongs, for example, if the processing result of the first policy task is that the age audit of zhang is passed and the age audit of lie is not passed, if the processing result of the second policy task is that the job undertaken by zhang is dangerous and the job undertaken by lie is not dangerous, collects the processing results of the policy tasks in the policies pertaining to zhang and lie respectively, and the displayed contents after collection are as follows:
the age audit of Zhang III is passed, and the job engaged in Zhang III is a dangerous job audit which is not passed;
the age audit of the plum four is not passed, and the occupation in which the plum four is engaged is not passed for the dangerous occupation audit.
The specific displayed content can be determined according to the corresponding output display parameters preset by the actual requirements of the user.
According to another embodiment of the present invention, a method for batch processing policy tasks is provided, which further includes:
when the number of the policy task obtained is greater than a preset threshold range, determining the policy task as a root node of a binary tree to create the binary tree, and splitting the policy task into sub policy tasks, where fig. 4 is a schematic diagram of a binary tree according to a usage scenario of the present invention, as shown in fig. 4, when the number of the policy tasks of rule a is greater than a preset threshold range (e.g., 200), the policy task of rule a is the root node of the binary tree, and the policy tasks under rule a are split into sub policy tasks task1.1 and task1.2 in a binary tree form;
and judging whether the number of the sub policy preserving tasks is larger than a preset threshold range, if so, taking the sub policy preserving tasks as intermediate nodes of the binary tree, splitting the sub policy preserving tasks of the intermediate nodes into the sub policy preserving tasks of the next node of the intermediate nodes, otherwise, taking the sub policy preserving tasks as leaf nodes of the binary tree, and then, circulating the judging and splitting steps until the number of all the sub policy preserving tasks is within the preset threshold range.
According to a usage scenario of this embodiment, referring to fig. 4, when the number of the underwriting tasks of rule a exceeds a preset threshold range, the underwriting tasks of rule a are split into the sub-policy tasks task1.1 and task1.2, the splitting may be performed layer by layer according to a binary tree form shown in fig. 4, the number of the split sub-policy tasks may be the same as the maximum value in the preset threshold range, for example, the preset threshold range is 0 to 200, when the underwriting tasks under rule a include 550, 200 of the sub-policy tasks are split into task1.1, the remaining sub-policy tasks 450 are split into task1.2, then it is determined whether the number of each sub-policy task exceeds the preset threshold range, and as a result, if the task1.2 exceeds the preset threshold range and the task1.1 does not exceed the preset threshold range, then task1.1 is taken as a leaf node of the binary tree, and as a middle node pair of the task1.2. of the binary tree is taken as a middle node pair of the task1.2, and splitting 200 into task1.2.1, splitting the rest 150 into task1.2.2, judging that neither task1.2.1 nor task1.2.2 exceeds the preset threshold range again, and using task1.2.1 and task1.2.2 as leaf nodes of the binary tree so as to finish the creation of the binary tree.
Further, the step of starting a plurality of sub-processes to process the sub-policy-preserving task comprises:
acquiring the number of intermediate nodes with the same depth and the number of leaf nodes in the binary tree;
and according to the sequence that the depth is deeper and the priority is higher, starting a plurality of subprocesses to simultaneously process the child policy-preserving tasks of the middle nodes and the child policy-preserving tasks of the leaf nodes in the same depth, wherein the number of the subprocesses is the sum of the number of the middle nodes and the number of the leaf nodes in the corresponding depth.
The depth refers to the number of layers of the intermediate node or the leaf node in the binary tree, and as shown in fig. 4, the depths of the leaf node task1.1 and the intermediate node task1.2 are 2, and the depths of the leaf node task1.2.1 and the leaf node task1.2.2 are 3. According to the usage scenario of this embodiment in combination with fig. 4, since the depth 3 has a higher priority than the depth 2, two sub-processes are preferentially started to process the sub-policy tasks in the leaf nodes task1.2.1 and task1.2.2 with the depth 3 at the same time, and then process the sub-policy tasks in the leaf nodes task1.1 and the middle node task1.2 with the depth 2.
Fig. 2 is a flowchart of a method for batch processing policy tasks according to another embodiment of the present invention, such as the method for batch processing policy tasks shown in fig. 2, which further includes the following steps S201 to S206 on the basis of the steps S101, S102 and S106 described above.
S201, when the obtained number is larger than a preset threshold range, splitting the policy-preserving task into sub policy-preserving tasks, and determining the policy-preserving task as a root node of a binary tree to create the binary tree.
S202, judging whether the number of the sub policy preserving tasks is larger than a preset threshold range, if so, jumping to the step S203, and if not, jumping to the step S204.
S203, taking the sub policy holding task as an intermediate node of the binary tree, and splitting the sub policy holding task of the intermediate node into sub policy holding tasks of a next node of the intermediate node.
And S204, taking the child policy-keeping task as a leaf node of the binary tree.
S205, acquiring the number of intermediate nodes and the number of leaf nodes with the same depth in the binary tree.
S206, according to the sequence that the depth is deeper and the priority is higher, starting a plurality of sub-processes to simultaneously process the sub-policy-preserving tasks of the middle nodes and the sub-policy-preserving tasks of the leaf nodes in the same depth, wherein the number of the sub-processes is the sum of the number of the middle nodes and the number of the leaf nodes in the corresponding depth.
Fig. 3 is a flowchart of a method for batch processing policy tasks according to another embodiment of the present invention, as shown in fig. 3, the method further includes step S301 in step S105 based on steps S101 to S104 and S105.
S301, starting a plurality of sub processes to automatically audit the sub policy-insurance policy task according to a preset rule.
According to an example of this embodiment, the preset rule is preset differently according to different underwriting tasks, for example, when the reporting task to be processed is the age of the insured person, the preset rule for the sub-insured task may be to determine whether the age of the insured person meets the underwriting rule, when the age of the insured person exceeds a preset value (for example, 60 years old), the preset processing result is that the underwriting does not pass, otherwise, the processing result is that the underwriting does not pass. For example, when the report task to be processed is the occupation of the insured person, whether the occupation of the insured person is dangerous occupation or not is judged, and whether the occupation of the insured person is dangerous occupation or not can be realized by the following steps: acquiring the occupation of the insured person stored in the electronic insurance policy, judging whether the acquired occupation contains preset keywords, if so, judging that the occupation of the insured person is a dangerous occupation, and if not, judging that the preset processing result is that the underwriting does not pass, otherwise, judging that the preset processing result is that the underwriting passes.
According to an example of this embodiment, when the processing procedure of one sub-policy task requires the processing results of other sub-policy tasks as a basis, the highest priority is defined for the other sub-policy tasks, and the other sub-policy tasks are processed with priority. Wherein "other sub-policy tasks" represent policy tasks that are relied upon, for which the defined priority is higher than the depth-defined priority of policy tasks.
In this step, if the processing procedure of one sub-policy-preserving task needs the processing results of other sub-policy-preserving tasks as the basis to complete the processing work of the sub-policy-preserving task, it indicates that the sub-policy-preserving task has a dependency relationship with the other sub-policy-preserving tasks, and the priority processing of the other sub-policy-preserving tasks is beneficial to the smooth processing procedure of the sub-policy-preserving task.
According to an example of this embodiment, the reference numerals of the above steps S101 to S301 are not used to limit the sequence of each step in this embodiment, and the number of each step is only used to make the reference numeral that generally refers to each step when describing each step perform a convenient reference, so long as the execution sequence of each step does not affect the logical relationship of this embodiment, and all steps are considered to be within the protection scope of this application.
Fig. 6 is a block diagram illustrating an exemplary structure of an apparatus for batch processing policy tasks according to an embodiment of the present invention, and the apparatus for batch processing policy tasks according to an embodiment of the present invention is described in detail below with reference to fig. 6, and as shown in fig. 6, the apparatus 10 for batch processing policy tasks includes:
and the extraction module 11 is configured to extract policy tasks of the same category from the multiple policies to be processed, and use the extracted policy tasks as the policy tasks to be processed.
And the splitting module is used for splitting the policy maintenance tasks into sub policy maintenance tasks according to the number of the policy maintenance tasks of the same category and a preset threshold range, wherein the number of the sub policy maintenance tasks is within the preset threshold range.
Further, the splitting module further comprises:
the splitting unit 12 is configured to split the policy task into sub policy tasks when the number of the extracted policy tasks to be processed in the same category is greater than a preset threshold range;
and a circulating unit 13, configured to determine whether the number of the split sub-policy-preserving tasks is greater than a preset threshold range, and if so, split the sub-policy-preserving task into new sub-policy-preserving tasks and circulate the determining and splitting steps until the number of all the split sub-policy-preserving tasks is within the preset threshold range.
And the processing module 14 is used for starting a plurality of sub processes to process the sub policy-keeping task.
And the display module 15 is used for summarizing and displaying the processing results of all the sub-policy tasks when the sub-policy tasks are processed.
The display module 15 is specifically configured to collect the processing results of the policy tasks into the corresponding policy according to the correspondence between each policy task and the policy to which the policy task belongs, and display the collected processing results of each policy task in the policy.
Further, the apparatus 10 for batch processing policy tasks further comprises:
and the quantity acquisition module is used for acquiring the quantity of the report tasks to be processed in the same category.
Further, the apparatus further comprises:
and the identification adding module is used for adding the policy identification of the policy to which the policy task belongs to each policy task so as to establish a corresponding relation between each policy task and the policy to which the policy task belongs, so that the policy tasks are convenient to split and collect, wherein the policy identification is used for example the policy number of the policy, the identity number of the policy insured person and the like.
Further, the apparatus 10 for batch processing policy tasks further comprises:
a binary tree creating module, configured to determine the policy task as a root node of a binary tree to create the binary tree and split the policy task into sub policy tasks when the number of the policy tasks is greater than a preset threshold range;
and the node determining module is used for judging whether the number of the sub policy-preserving tasks is larger than a preset threshold range, if so, taking the sub policy-preserving tasks as intermediate nodes of the binary tree, splitting the sub policy-preserving tasks of the intermediate nodes into the sub policy-preserving tasks of the next node of the intermediate nodes, otherwise, taking the sub policy-preserving tasks as leaf nodes of the binary tree, and then, circulating the judging and splitting steps until the number of all the sub policy-preserving tasks is within the preset threshold range.
According to an example of this embodiment, the processing module 14 further includes:
the quantity acquisition unit is used for acquiring the number of intermediate nodes with the same depth and the number of leaf nodes in the binary tree;
and the processing unit is used for starting a plurality of subprocesses to simultaneously process the sub policy-preserving tasks of the middle nodes and the sub policy-preserving tasks of the leaf nodes in the same depth according to the sequence that the depth is deeper and the priority is higher, and the number of the subprocesses is the sum of the number of the middle nodes and the number of the leaf nodes in the corresponding depth.
Further, when the processing procedure of one sub-policy task requires the processing results of other sub-policy tasks as the basis, the highest priority is defined for the other sub-policy tasks, and the processing module 14 preferentially processes the other sub-policy tasks.
If the processing procedure of one sub-policy-preserving task needs the processing results of other sub-policy-preserving tasks as the basis to complete the processing work of the sub-policy-preserving task, which indicates that the sub-policy-preserving task has a dependency relationship with the other sub-policy-preserving tasks, the processing module 14 preferentially processes the other sub-policy-preserving tasks, so as to facilitate the processing flow of the sub-policy-preserving task to be smoothly performed.
Further, the processing module 14 is specifically configured to start a plurality of sub-processes to perform automatic audit on the sub-policy-preserving task according to a preset rule.
For example, when the stored report task to be processed is the age of the insured person, the processing module 14 is specifically configured to determine whether the age of the insured person meets the underwriting rule, when the age of the insured person exceeds a preset value (for example, 60 years), the preset processing result is that the underwriting does not pass, otherwise, the processing result is that the underwriting does not pass. For example, when the stored report task to be processed is the job of the insured person, the processing module 14 is specifically configured to determine whether the job of the insured person is a dangerous job, if the processing result is that the underwriting does not pass, otherwise, the processing result is that the underwriting does not pass, and the processing module 14 is specifically configured to further determine whether the job of the insured person is a dangerous job by implementing the following steps: acquiring the occupation of the insured person stored in the electronic insurance policy, judging whether the acquired occupation contains preset keywords, if so, judging that the occupation of the insured person is a dangerous occupation, and if not, judging that the preset processing result is that the underwriting does not pass, otherwise, judging that the preset processing result is that the underwriting passes.
Wherein, the modules included in the device for batch processing policy task can be wholly or partially realized by software, hardware or the combination thereof. Further, each module in the apparatus for batch processing policy tasks may be a program segment for implementing a corresponding function.
The embodiment also provides a computer device, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor executes the program to realize the method for batch processing policy-preserving task.
Fig. 7 is a schematic diagram of an internal structure of a computer device according to an embodiment of the present invention, where the computer device may be a server. Referring to fig. 7, the computer apparatus includes a processor, a non-volatile storage medium, an internal memory, an input device, and a display screen, which are connected through a system bus. The non-volatile storage medium of the computer device may store an operating system and computer readable instructions, and when the computer readable instructions are executed, the processor may execute a method for batch processing policy-preserving tasks according to embodiments of the present application, and specific implementation processes of the method may refer to specific contents of the embodiments in fig. 1 to fig. 5, which are not described herein again. The processor of the computer device is used for providing calculation and control capability and supporting the operation of the whole computer device. The internal memory may have stored therein computer readable instructions that, when executed by the processor, cause the processor to perform a method for batch processing policy tasks. The input device of the computer equipment is used for inputting various parameters, and the display screen of the computer equipment is used for displaying. Those skilled in the art will appreciate that the architecture shown in fig. 7 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
The present embodiment also provides a storage medium configured to store program codes for performing the respective steps in the method of the above-described batch policy handling task.
According to an example of this embodiment, all or part of the processes in the methods of the embodiments described above may be implemented by a computer program to instruct related hardware, where the program may be stored in a computer-readable storage medium, and in this embodiment of the present invention, the program may be stored in the storage medium of a computer system and executed by at least one processor in the computer system, so as to implement the processes including the embodiments of the methods described above. The storage medium includes, but is not limited to, a magnetic disk, a flash disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), and the like.
In the embodiment, a plurality of group policy is split into different categories of to-be-processed policy tasks according to different auditing rules, then each category of to-be-processed policy tasks are split according to the number, and the number of split final sub policy tasks is ensured to be within a certain range, so that the system can process a plurality of to-be-processed policy tasks simultaneously through a plurality of sub processes, and finally, processing results are collected to adapt to self-checking work of large-batch policy casting, and the processing efficiency of large-batch policy casting is improved.
The technical features of the embodiments described above may be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the embodiments described above are not described, but should be considered as being within the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims (8)

1. A method of batch processing policy tasks, the method comprising:
extracting the to-be-processed policy tasks of the same category from a plurality of to-be-processed policies;
when the number of the acquired policy tasks to be processed in the same category is larger than a preset threshold range, determining the policy tasks as root nodes of a binary tree to create the binary tree, and splitting the policy tasks into sub policy tasks;
judging whether the number of the sub policy preserving tasks is larger than a preset threshold range, if so, taking the sub policy preserving tasks as intermediate nodes of the binary tree, splitting the sub policy preserving tasks of the intermediate nodes into sub policy preserving tasks of the next node of the intermediate nodes, otherwise, taking the sub policy preserving tasks as leaf nodes of the binary tree, and then circulating the judging and splitting steps until the number of all the sub policy preserving tasks is within the preset threshold range;
starting a plurality of subprocesses to simultaneously process each sub policy-keeping task according to a preset rule;
and when all the sub-policy tasks are processed, summarizing and displaying the processing results of the sub-policy tasks.
2. The method of claim 1, wherein the step of starting a plurality of sub-processes to process the sub-policy task comprises:
acquiring the number of intermediate nodes with the same depth and the number of leaf nodes in the binary tree;
and according to the sequence that the depth is deeper and the priority is higher, starting a plurality of sub-processes to simultaneously process the sub-policy-preserving tasks of the middle nodes and the sub-policy-preserving tasks of the leaf nodes in the same depth, wherein the number of the sub-processes is the sum of the number of the middle nodes and the number of the leaf nodes in the corresponding depth.
3. The method of claim 2, wherein the step of opening a plurality of sub-processes to process the sub-policy task further comprises:
when the processing process of one sub-policy-preserving task needs the processing results of other sub-policy-preserving tasks as the basis, the highest priority is defined for the other sub-policy-preserving tasks, and the other sub-policy-preserving tasks are processed preferentially.
4. An apparatus for batch processing policy tasks, the apparatus comprising:
the extraction module is used for extracting the policy tasks to be processed in the same category from the plurality of policies to be processed;
the system comprises a splitting module, a scheduling module and a scheduling module, wherein the splitting module is used for splitting policy tasks into sub policy tasks according to the number of policy tasks in the same category and a preset threshold range, and the number of the sub policy tasks is within the preset threshold range;
the processing module is used for starting a plurality of subprocesses to simultaneously process each subproblem task according to a preset rule;
the display module is used for summarizing and displaying the processing results of the sub-policy-keeping tasks when all the sub-policy-keeping tasks are processed;
a binary tree creating module, configured to determine the policy task as a root node of a binary tree to create the binary tree and split the policy task into sub policy tasks when the number of the policy tasks obtained is greater than a preset threshold range;
and the node determining module is used for judging whether the number of the sub policy-preserving tasks is larger than a preset threshold range, if so, taking the sub policy-preserving tasks as intermediate nodes of the binary tree, splitting the sub policy-preserving tasks of the intermediate nodes into sub policy-preserving tasks of the next node of the intermediate nodes, otherwise, taking the sub policy-preserving tasks as leaf nodes of the binary tree, and then, circulating the judging and splitting steps until the number of all the sub policy-preserving tasks is within the preset threshold range.
5. The apparatus of claim 4, further comprising:
and the identifier adding module is used for adding the policy identifier of the policy to which the policy task belongs to each policy task so as to establish a corresponding relationship between each policy task and the policy to which the policy task belongs, so that the policy tasks are convenient to split and gather.
6. The apparatus of claim 4, wherein the processing module further comprises:
the quantity acquisition unit is used for acquiring the number of intermediate nodes with the same depth and the number of leaf nodes in the binary tree;
and the processing unit is used for starting a plurality of subprocesses to simultaneously process the sub policy-preserving tasks of the middle nodes and the sub policy-preserving tasks of the leaf nodes in the same depth according to the sequence that the depth is deeper and the priority is higher, and the number of the subprocesses is the sum of the number of the middle nodes and the number of the leaf nodes in the corresponding depth.
7. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements a method of batching policy tasks according to any one of claims 1 to 3 when executing said program.
8. A storage medium arranged to store program code for performing the steps of the method of bulk policy handling tasks according to any of claims 1 to 3.
CN201710614396.2A 2017-07-25 2017-07-25 Method and device for batch processing policy tasks, computer equipment and storage medium Active CN107689010B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201710614396.2A CN107689010B (en) 2017-07-25 2017-07-25 Method and device for batch processing policy tasks, computer equipment and storage medium
PCT/CN2017/104643 WO2019019381A1 (en) 2017-07-25 2017-09-29 Batch processing method and apparatus for insurance slip tasks, computer device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710614396.2A CN107689010B (en) 2017-07-25 2017-07-25 Method and device for batch processing policy tasks, computer equipment and storage medium

Publications (2)

Publication Number Publication Date
CN107689010A CN107689010A (en) 2018-02-13
CN107689010B true CN107689010B (en) 2022-04-29

Family

ID=61152988

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710614396.2A Active CN107689010B (en) 2017-07-25 2017-07-25 Method and device for batch processing policy tasks, computer equipment and storage medium

Country Status (2)

Country Link
CN (1) CN107689010B (en)
WO (1) WO2019019381A1 (en)

Families Citing this family (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109255569B (en) * 2018-08-24 2021-03-12 北京极智嘉科技有限公司 Warehouse goods sorting method, device, server and storage medium
CN109064295A (en) * 2018-09-05 2018-12-21 中国平安财产保险股份有限公司 It insures calculation method, device, computer equipment and the storage medium of quotation
CN111932047A (en) * 2019-05-13 2020-11-13 北京京东尚科信息技术有限公司 Method, apparatus, device and computer readable medium for assigning a multi-tasking set
CN110351100A (en) * 2019-05-31 2019-10-18 平安科技(深圳)有限公司 Data transmission method, device, computer equipment and computer readable storage medium
CN110674106B (en) * 2019-08-30 2022-03-15 中国人民财产保险股份有限公司 Storage method, device and equipment of policy data and computer readable storage medium
CN112668951B (en) * 2019-10-16 2024-06-21 北京京东乾石科技有限公司 Task processing method, device, server and storage medium
CN111126935B (en) * 2019-11-19 2023-07-21 泰康保险集团股份有限公司 Method and device for processing security data, electronic equipment and storage medium
CN111047277B (en) * 2019-11-19 2023-07-07 泰康保险集团股份有限公司 Nuclear protection system, method, device and computer readable medium
CN111190703B (en) * 2019-12-11 2023-02-07 深圳平安医疗健康科技服务有限公司 Real-time data processing method and device, computer equipment and storage medium
CN111045825A (en) * 2019-12-12 2020-04-21 深圳前海环融联易信息科技服务有限公司 Batch processing performance optimization method and device, computer equipment and storage medium
CN111222845A (en) * 2019-12-27 2020-06-02 北京健康之家科技有限公司 Resource transfer method, device, equipment and readable storage medium
CN111507850A (en) * 2020-03-25 2020-08-07 上海商汤智能科技有限公司 Authority guaranteeing method and related device and equipment
CN113703934B (en) * 2020-05-22 2024-09-06 腾讯科技(深圳)有限公司 Task processing method, device, computer equipment and storage medium
CN111626870B (en) * 2020-05-25 2023-07-21 泰康保险集团股份有限公司 Nuclear data processing method, device and equipment for cleaning physical examination piece
CN111680974B (en) * 2020-05-29 2023-09-22 泰康保险集团股份有限公司 Method and device for positioning problems of electronic underwriting process
CN111813515B (en) * 2020-06-29 2024-08-23 中国平安人寿保险股份有限公司 Multi-process-based task scheduling method, device, computer equipment and medium
CN112330472B (en) * 2020-11-17 2023-10-27 中国平安财产保险股份有限公司 Service data processing method, device, computer equipment and storage medium
CN113065973B (en) * 2021-04-22 2022-08-02 中国平安财产保险股份有限公司 Big data-based agricultural insurance claim settlement processing method, device, equipment and storage medium
CN113609178A (en) * 2021-08-12 2021-11-05 深圳壹账通智能科技有限公司 Data pushing method, device, equipment and storage medium
CN114240675A (en) * 2021-12-03 2022-03-25 泰康保险集团股份有限公司 Method, device, electronic device and storage medium for processing bills
CN115422905A (en) * 2022-09-29 2022-12-02 中国建设银行股份有限公司 Data splitting method and device, electronic equipment, medium and product

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102681902A (en) * 2012-05-15 2012-09-19 浙江大学 Load balancing method based on task distribution of multicore system
CN102882981A (en) * 2012-10-19 2013-01-16 南京邮电大学 Load balancing method of node task under equivalence structural cloud platform
CN106952163A (en) * 2016-01-07 2017-07-14 平安科技(深圳)有限公司 Insurance data processing method and system

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8346655B2 (en) * 2010-05-10 2013-01-01 Ilan Tzroya System and method for providing a platform for the trade of financial instruments
US20130346033A1 (en) * 2012-06-21 2013-12-26 Jianqiang Wang Tree-based regression
CN102790698B (en) * 2012-08-14 2014-08-13 南京邮电大学 Large-scale computing cluster task scheduling method based on energy-saving tree
CN105117283A (en) * 2015-08-26 2015-12-02 深圳市华验防伪科技有限公司 Task splitting method and system
CN106844018A (en) * 2015-12-07 2017-06-13 阿里巴巴集团控股有限公司 A kind of task processing method, apparatus and system
CN105700958B (en) * 2016-01-07 2019-05-03 北京京东尚科信息技术有限公司 The method and its system that a kind of task is split automatically and subtask executes parallel

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102681902A (en) * 2012-05-15 2012-09-19 浙江大学 Load balancing method based on task distribution of multicore system
CN102882981A (en) * 2012-10-19 2013-01-16 南京邮电大学 Load balancing method of node task under equivalence structural cloud platform
CN106952163A (en) * 2016-01-07 2017-07-14 平安科技(深圳)有限公司 Insurance data processing method and system

Also Published As

Publication number Publication date
CN107689010A (en) 2018-02-13
WO2019019381A1 (en) 2019-01-31

Similar Documents

Publication Publication Date Title
CN107689010B (en) Method and device for batch processing policy tasks, computer equipment and storage medium
US20240185130A1 (en) Normalizing text attributes for machine learning models
CN108764674B (en) Risk control method and device based on rule engine
CN110532084B (en) Platform task scheduling method, device, equipment and storage medium
CN109583746B (en) Method and device for setting routing rule of flow and readable storage medium
CN112434952B (en) Service data rule judging method, device, equipment and storage medium
CN113536081B (en) Data center data management method and system based on artificial intelligence
CN109284895A (en) Project task distribution method, device, computer equipment and storage medium
CN111158800B (en) Method and device for constructing task DAG based on mapping relation
EP2983117A1 (en) Event processing method in stream processing system and stream processing system
CN110009347B (en) Block chain transaction information auditing method and device
CN111917769A (en) Automatic handling method and device of security event and electronic equipment
CN110888813A (en) Project scheduling management method, device, equipment and storage medium
CN112633842A (en) Task pushing method, device and system
CN111783099B (en) Equipment safety analysis method, device and equipment
CN112529543A (en) Method, device and equipment for verifying mutual exclusion relationship of workflow and storage medium
CN109857748B (en) Contract data processing method and device and electronic equipment
CN109117202B (en) A method and system for setting audit configuration items
CN101520727A (en) Method and system for protecting key knowledge in software system design
CN119808034A (en) A code obfuscation method, device, equipment and storage medium
CN110968547A (en) Information screening method and system
CN118331732A (en) Task execution method and device, electronic equipment and storage medium
CN112330141A (en) Ship network security assessment method, system, storage medium and terminal
CN110674628A (en) File template generation method and system
CN113780583A (en) Model training monitoring method, device, equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant