WO2019019381A1 - 批量处理保单任务的方法、装置、计算机设备及存储介质 - Google Patents

批量处理保单任务的方法、装置、计算机设备及存储介质 Download PDF

Info

Publication number
WO2019019381A1
WO2019019381A1 PCT/CN2017/104643 CN2017104643W WO2019019381A1 WO 2019019381 A1 WO2019019381 A1 WO 2019019381A1 CN 2017104643 W CN2017104643 W CN 2017104643W WO 2019019381 A1 WO2019019381 A1 WO 2019019381A1
Authority
WO
WIPO (PCT)
Prior art keywords
sub
policy
tasks
task
preset threshold
Prior art date
Application number
PCT/CN2017/104643
Other languages
English (en)
French (fr)
Inventor
邵正铂
李斌
陈杰
高雪
马向东
丁杰
张捷
Original Assignee
平安科技（深圳）有限公司
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 平安科技（深圳）有限公司 filed Critical 平安科技（深圳）有限公司
Publication of WO2019019381A1 publication Critical patent/WO2019019381A1/zh

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/08—Insurance
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2246—Trees, e.g. B+trees

Definitions

  • the present application relates to the field of insurance technology, and in particular, to a method, an apparatus, a computer device, and a storage medium for processing a policy task in batches.
  • the amount of the group insurance will be very large, and thousands or even tens of thousands of policies can be reached.
  • a method, apparatus, computer device, and storage medium for batch processing a policy task are provided.
  • a method for processing a policy task in batches comprising: extracting a policy task to be processed of the same category from a plurality of pending policies; splitting the policy task into sub-child according to the number of tasks of the same category of policy tasks and a preset threshold range a policy task, wherein the number of tasks of the sub-policy task is within the preset threshold range; and the plurality of sub-processes are opened to process the sub-policy task; When the sub-policy task has been processed, the processing results of the sub-policy task are summarized and displayed.
  • An apparatus for batch processing a policy task comprising: an extraction module, configured to extract the same category of policy tasks to be processed from a plurality of pending policies; and a splitting module for using the number of policy tasks of the same category And the preset threshold range is divided into the sub-policy task, and the number of the sub-policy tasks is within the preset threshold range; the processing module is configured to enable multiple sub-processes to process the sub-policy task And a display module for summarizing and displaying the processing results of the sub-policy task when all sub-policy tasks have been processed.
  • a computer device comprising a memory and one or more processors, the memory storing computer readable instructions, the computer readable instructions being executed by the processor, causing the one or more processors to execute The following steps: extracting the same category of pending policy tasks from a plurality of pending policies; splitting the policy tasks into sub-policy tasks according to the number of tasks of the same category of policy tasks and a preset threshold range, and the sub-policies The number of tasks of the task is all within the preset threshold range; multiple sub-processes are enabled to process the sub-policy task; and when all sub-policy tasks have been processed, the processing results of the sub-policy tasks are summarized and displayed.
  • One or more non-transitory readable storage media storing computer readable instructions, when executed by one or more processors, cause the one or more processors to perform the steps of: Extracting the same category of pending policy tasks from a plurality of pending policies; splitting the policy tasks into sub-policy tasks according to the number of tasks of the same category of policy tasks and a preset threshold range, and the number of tasks of the sub-policy tasks All are within the preset threshold range; multiple sub-processes are opened to process the sub-policy task; and when all sub-policy tasks have been processed, the processing results of the sub-policy task are summarized and displayed.
  • 1 is a flow chart of a method for batch processing a policy task in an embodiment
  • FIG. 2 is a flow chart of a method for batch processing a policy task in another embodiment
  • FIG. 3 is a flow chart of a method for batch processing a policy task in still another embodiment
  • FIG. 4 is a schematic diagram of a binary tree using a scene in an embodiment
  • FIG. 5 is a schematic diagram of a binary tree using a scenario in another embodiment
  • FIG. 6 is a block diagram showing an exemplary structure of an apparatus for batch processing a policy task in an embodiment
  • FIG. 7 is a schematic diagram showing the internal structure of a computer device in an embodiment.
  • FIG. 1 is a flowchart of a method for batch processing a policy task according to an embodiment of the present application.
  • a method for batch processing a policy task according to an embodiment of the present application is described in detail with reference to FIG. 1, as shown in FIG. 1, as shown in FIG.
  • the method of batch processing a policy task includes the following steps S101, S102, S103, S104, S105, and S106.
  • the type of policy task to be processed includes, but is not limited to, the age of the insured, the occupation of the insured person, and the like, and the policy task to be processed is extracted from a plurality of pending policies.
  • the policy task of the same category, the extracted policy task is regarded as the policy task to be processed, and the policy identifier of the policy to which the policy task belongs is added to each policy task, wherein the policy identifier is, for example, the policy number of the policy, the policy insured ID number, etc., this step extracts and classifies the pending policy tasks with the same underwriting rules in different insurance policies, so that the computer equipment can set the rules for automatic review of the same category of pending policy tasks. To improve self-nuclear effectiveness.
  • the policy to be automatically audited is a group policy of a company, and the number of policies to be automatically reviewed is 1000, wherein each policy has the age of the insured, the insured The occupational industry, the guarantee amount of the policy, etc., can extract the age of the insured person of all policies as one of the pending policy tasks, and extract the industries in which the policyholders of all policies are engaged. As another batch of policy tasks to be processed, a similar withdrawal can be made for the guarantee amount of the policy.
  • the policy task is split into sub-policy tasks according to the number of policy tasks of the same category and a preset threshold range, and the number of sub-policy tasks is within a preset threshold range.
  • the specific splitting step includes the following steps S103 and S104.
  • the threshold range is a value preset by the user, for example, when the preset threshold range is 0-200, and the number of pending policy tasks extracted according to the age of the insured person is 1000.
  • the policy task to be processed needs to be split.
  • the splitting may be based on the number of policy tasks.
  • the splitting may be split layer by layer according to the form of a binary tree, or may be equally divided according to the obtained quantity, and the split sub-policy task may be split.
  • the number of the policy can 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 layer is split in the form of a binary tree, the 1000 pending policy tasks can be split. For 200 and 800, if the split is performed in the form of equalization, the 1000 pending policy tasks can be split into 200, 200, 200, 200, and 200.
  • S104 Determine whether the number of the split sub-policy tasks is greater than a preset threshold range. If yes, split the sub-policy task into new sub-policy tasks and cycle the judgment and splitting steps until the split The number of all sub-policy tasks is within the preset threshold range.
  • the looping step of the determining and splitting causes the number of split final sub-policy tasks to be within a preset threshold range, so as to control the complexity of each sub-policy task to a certain extent.
  • the computer device can process the pending policy task by turning on multiple sub-processes.
  • each sub-policy task can be processed simultaneously by using multiple sub-processes that are turned on to speed up the processing efficiency of the task.
  • the summary manner may be that the policy relationship between the policy task and the policy is established by adding the policy identifier of the policy to which the policy task belongs to each policy task, and the processing result of the order task belonging to the same policy identifier is processed. Make a summary.
  • the policy task to be processed extracted from 1000 policies to be processed is the age of 1000 insured persons
  • the sub-policy task is processed, for example, Determine whether the age of the insured is in compliance with the underwriting regulations, and determine whether the age of the insured is in compliance with the underwriting regulations, such as the underwriting process of the group policy, when the age of the insured exceeds a preset value (for example, 60 years old)
  • a preset value for example, 60 years old
  • the age of the extracted 1000 insured persons is treated as such, and it is judged whether the age of each insured person exceeds 60 years old, if it is not exceeded, then the approval is passed, otherwise, the approval is not passed.
  • the policy task to be processed is to extract the industry in which the insured person is engaged in 1000 policies, the sub-policy
  • the task is processed, for example, to determine whether the occupation in which the insured person is engaged is a dangerous occupation, and whether the occupation in which the insured person is engaged is a dangerous occupation can be achieved by the following steps: obtaining the occupation of the insured person stored in the electronic policy, judging the acquisition Whether the occupation contains a preset keyword, and if so, it is judged that the insured person is engaged in a dangerous occupation, and the result of the treatment is that the underwriting does not pass; otherwise, the result of the treatment is the approval of the underwriting. Then, according to the correspondence between each policy task and the policy to which the policy task belongs, the processing result of the policy task is summarized into the corresponding policy.
  • a plurality of group policies are divided into different types of policy tasks to be processed according to different auditing rules, and then the number of pending policy tasks for each category is entered according to the number of policies.
  • all pending insurance policies include a group policy of the insured person as Zhang San and a group policy of the insured person as Li Si.
  • the group policy may contain thousands of policies.
  • the underwriting task of Rule A is to review the insured.
  • the age, the underwriting work of Rule B is to review the occupations of the insured.
  • the insured person Zhang San’s group electronic policy stores the age of Zhang San and the occupation of Zhang San, and the insured’s Li Si’s group electronic policy.
  • the age of Li Si and the career of Li Si are stored.
  • the split policy tasks to be processed include the first policy task - the age of the insured, the second policy task - the occupation of the insured, and then Judging, disassembling, and processing the quantity included in the policy task in units of policy tasks.
  • each task belongs to The policy will summarize the processing results of the policy corresponding to the same policy.
  • the processing result of the first policy task is the age of Zhang San
  • the age of Li Si is not passed
  • the result of the second policy is the occupation of Zhang San.
  • the treatment results of the policy tasks belonging to the insured's policies for Zhang San and Li Si are summarized, and the contents displayed after the summary are as follows:
  • the specifically displayed content may be determined according to the corresponding output display parameters preset by the user's actual needs to determine which content is specifically displayed.
  • a method for batch processing a policy task according to another embodiment of the present application, the method further comprising:
  • FIG. 4 is a sub-policy task according to the present application.
  • a preset threshold range for example, 200
  • the underwriting task of rule A is the root node of the binary tree, and the underwriting task under rule A is split into a binary tree.
  • the sub-policy task otherwise, the sub-policy task is used as the leaf node of the binary tree, and then the judgment and splitting steps are repeated until the number of all sub-policy tasks is within the preset threshold range.
  • a usage scenario when the number of underwriting tasks of rule A exceeds a preset threshold range, splits the underwriting task of rule A into sub-policy tasks Task1.1 and Task1. 2, the splitting may be based on the form of a binary tree shown in FIG.
  • the number of 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 ⁇ 200, the underwriting task under rule A includes 550 hours, then splits 200 sub-policy tasks into Task1.1, splits the remaining sub-policy tasks 450 into Task1.2, and then judges each sub-policy Whether the number of tasks exceeds the preset threshold range, and the result is that Task 1.2 exceeds the preset threshold range, and Task 1.1 does not exceed the preset threshold range, and Task 1.1 is used as the leaf node of the binary tree. Task1.2.
  • Task1.2.1 and Task1.2.2 is the leaf node of the binary tree, and the creation of the binary tree is completed.
  • the step of enabling the plurality of sub-processes to process the sub-policy task comprises:
  • the multiple sub-processes are simultaneously processed for the sub-policy task of the intermediate node of the same depth and the sub-policy task of the leaf node, and the number of the sub-processes is the number of intermediate nodes in the corresponding depth. The sum of the number of leaf nodes.
  • the depth in the above refers to the number of layers of the intermediate node or the leaf node in the binary tree, such as The leaf node Task1.1 and the intermediate node Task1.2 shown in Fig. 4 have a depth of 2, and the leaf node Task1.2.1 and the leaf node Task1.2.2 have a depth of 3.
  • the two sub-processes are preferentially opened simultaneously to process the leaf nodes Task1.2.1 and Task1 of depth 3.
  • the sub-policy task in 2.2 is then processed in the sub-policy task of the leaf node Task1.1 with a depth of 2 and the intermediate node Task1.2.
  • FIG. 2 is a flowchart of a method for batch processing a policy task according to another embodiment of the present application, as shown in FIG. 2, a method for batch processing a policy task, the method further including the above steps S101, S102, and S106 The following steps S201 to S206 are included.
  • step S202 Determine whether the number of sub-policy tasks is greater than a preset threshold range. If yes, go to step S203. If no, go to step S204.
  • the sub-policy task is used as an intermediate node of the binary tree, and the sub-policy task of the intermediate node is split into sub-policy tasks of the next node of the intermediate node.
  • the sub-policy task is used as a leaf node of the binary tree.
  • S206 Open the sub-policy task of the intermediate node of the same depth and the sub-policy task of the leaf node in the order that the depth is deeper and the priority is higher, and the number of the sub-processes is the intermediate node of the corresponding depth. The sum of the number and the number of leaf nodes.
  • step S301 is a flowchart of a method for batch processing a policy task according to still another embodiment of the present application. As shown in FIG. 3, the method includes the above steps S101 to S104 and S105, and the foregoing step S105 is in an embodiment. The middle is step S301.
  • S301 Open multiple sub-processes to automatically review the sub-policy task according to a preset rule.
  • the preset rule performs different presets according to different check-off tasks, for example, when the pending order task is the age of the insured, the preset rule for the sub-policy task It can be judged whether the age of the insured is in compliance with the underwriting regulations, when the age of the insured exceeds the pre- When setting the value (for example, 60 years old), the default processing result is that the underwriting does not pass, otherwise, the processing result is the underwriting.
  • the pending order task is an occupation in which the insured person is engaged
  • it is judged whether the occupation in which the insured person is engaged is a dangerous occupation, and whether the occupation in which the insured person is engaged is a dangerous occupation can be achieved by the following steps:
  • the insured person's occupation stored in the electronic policy determines whether the acquired occupation contains a preset keyword, and if so, determines that the insured person is engaged in a dangerous occupation, and the default processing result is that the underwriting is not Pass, otherwise, the default processing result is passed by the underwriting.
  • the processing of one sub-policy task requires the processing result of other sub-policy tasks as a basis
  • the highest priority is defined for other sub-policy tasks, and the other sub-policy tasks are preferentially processed.
  • “other sub-policy tasks” means that the policy tasks are dependent, and the priority of the other sub-policy tasks is defined higher than the priority of the policy tasks defined by the depth.
  • the labels of the foregoing steps S101-S301 are not used to limit the sequence of the steps in the embodiment, and the numbers of the steps are only for the convenience of referring to the labels of the steps when describing the steps. It is to be noted that as long as the order in which the steps are performed does not affect the logical relationship of the embodiment, it is considered to be within the scope of the present application.
  • FIG. 6 is an exemplary structural block diagram of an apparatus for batch processing a policy task according to an embodiment of the present application.
  • the device 10 for batch processing policy tasks includes: an extracting module 11 configured to extract policy tasks of the same category from a plurality of pending policies, and use the extracted policy tasks as policy tasks to be processed.
  • the splitting module is configured to split the policy task into sub-policy tasks according to the number of policy tasks of the same category and a preset threshold range, and the number of sub-policy tasks are within a preset threshold range.
  • the splitting module further includes: a splitting unit 12, configured to split the policy task when the number of the extracted policy tasks of the same category is greater than a preset threshold range It is divided into sub-policy tasks; the loop unit 13 is configured to determine whether the number of split sub-policy tasks is greater than a preset threshold range, and if so, split the sub-policy task into new sub-policy tasks and cycle the judgment And the splitting step, until the number of all the sub-policy tasks after the splitting is within the preset threshold range; the processing module 14 is configured to enable the plurality of sub-processes to process the sub-policy task; and the display module 15 is configured to: When all sub-policy tasks have been processed, the processing results of the sub-policy tasks are summarized and displayed.
  • a splitting unit 12 configured to split the policy task when the number of the extracted policy tasks of the same category is greater than a preset threshold range It is divided into sub-policy tasks
  • the loop unit 13 is configured to determine whether the number of split sub-policy tasks is greater than
  • the display module 15 is specifically configured to summarize the processing result of the policy task into the corresponding policy according to the corresponding relationship between each policy task and the policy to which the policy task belongs, and display the policy of each policy in the summarized policy. process result.
  • the apparatus 10 for processing a policy task further includes: a quantity acquisition module, configured to acquire the number of billing tasks to be processed in the same category.
  • the apparatus further includes: an identifier adding module, configured to add, to each policy task, a policy identifier of the policy to which the policy task belongs, to associate each policy task with a policy to which the policy task belongs.
  • an identifier adding module configured to add, to each policy task, a policy identifier of the policy to which the policy task belongs, to associate each policy task with a policy to which the policy task belongs.
  • the device 10 for processing a policy task further includes: a binary tree creation module, configured to determine the policy task as a root node of the binary tree when the number of the obtained policy tasks is greater than a preset threshold range The binary tree is divided into the sub-policy task; the node determining module is configured to determine whether the number of the sub-policy tasks is greater than a preset threshold range, and if so, the sub-policy task is used as an intermediate node of the binary tree And splitting the sub-policy task of the intermediate node into sub-policy tasks of the next node of the intermediate node; otherwise, using the sub-policy task as the leaf node of the binary tree, and then looping the judgment and splitting steps until all the sub-tasks The number of policy tasks is within the preset threshold range.
  • a binary tree creation module configured to determine the policy task as a root node of the binary tree when the number of the obtained policy tasks is greater than a preset threshold range
  • the binary tree is divided into the sub-policy task
  • the processing module 14 includes: a quantity obtaining unit, configured to acquire the number of intermediate nodes having the same depth and the number of leaf nodes in the binary tree; and the processing unit is configured to use the deeper depth according to the depth The higher the order of the level, the multiple sub-processes are simultaneously processed for the sub-policy task of the intermediate node of the same depth and the sub-policy task of the leaf node, and the number of the sub-processes is corresponding vertical The sum of the number of intermediate nodes in the middle and the number of leaf nodes.
  • the processing module 14 preferentially processes the other sub-policy tasks.
  • the processing module 14 preferentially processes the Other sub-policy tasks facilitate the smooth processing of the sub-policy task.
  • the processing module 14 is specifically configured to enable multiple sub-processes to perform automatic auditing on the sub-policy task according to a preset rule.
  • the different rules preset according to the different tasks of the underwriting task may be stored in the system.
  • the processing module 14 is specifically configured to determine the age of the insured. Whether the insured person's age exceeds the preset value (for example, 60 years old), the default processing result is that the underwriting does not pass, otherwise, the result of the processing is that the underwriting does not pass.
  • the processing module 14 is specifically configured to determine whether the occupation to be insured is a dangerous occupation, and if the processing result is that the underwriting fails, otherwise The processing result is that the underwriting fails.
  • the processing module 14 is specifically configured to determine whether the industry in which the insured person is engaged is a dangerous industry by obtaining the following steps: obtaining the occupation of the insured stored in the electronic policy, and judging the obtained Whether the occupation contains a preset keyword, and if so, it is judged that the insured person is engaged in a dangerous occupation, and the default processing result is that the underwriting does not pass; otherwise, the preset processing result is the approval of the underwriting.
  • Each of the above-described devices for batch processing policy tasks may be implemented in whole or in part by software, hardware, and combinations thereof.
  • the above modules may be embedded in the hardware of the terminal or may be stored in the memory of the terminal in a software form, so that the processor calls the execution of the operations corresponding to the above modules.
  • the processor can be a central processing unit (CPU), a microprocessor, a microcontroller, or the like.
  • the above apparatus for batch processing policy tasks may be implemented in the form of a computer readable instruction. Run on a computer device as shown in FIG.
  • the embodiment further provides a computer device comprising a memory, a processor, and computer readable instructions stored on the memory and operable on the processor, the processor executing the program to implement a method for batch processing a policy task as described above.
  • a computer apparatus comprising a memory and one or more processors having stored therein computer readable instructions that, when executed by a processor, cause one or more processors to execute The following steps: extracting the same category of pending policy tasks from a plurality of pending policies; splitting the policy tasks into sub-policy tasks according to the number of policy tasks of the same category and a preset threshold range, and the number of sub-policy tasks All are within the preset threshold range; multiple sub-processes are opened to process sub-policy tasks; when all sub-policy tasks have been processed, the processing results of sub-policy tasks are summarized and displayed.
  • the processor performs the steps of splitting the policy task into sub-policy tasks according to the number of policy tasks of the same category and a preset threshold range, and the number of sub-policy tasks are within a preset threshold range.
  • the method includes: when the number of acquired policy tasks is greater than a preset threshold range, determining a policy task as a root node of the binary tree to create a binary tree, and splitting the policy task into sub-policy tasks; determining whether the number of sub-policy tasks is greater than a pre- Set the threshold range, if yes, use the sub-policy task as the intermediate node of the binary tree, and split the sub-policy task of the intermediate node into the sub-policy task of the next node of the intermediate node; otherwise, use the sub-policy task as the leaf of the binary tree
  • the node then loops through the decision and split steps until the number of all child policy tasks is within a preset threshold.
  • the step of processing the plurality of sub-processes to process the sub-policy task performed by the processor includes: acquiring the number of intermediate nodes having the same depth in the binary tree and the number of leaf nodes; The higher the order, the multiple sub-processes are simultaneously processed for the sub-policy task of the intermediate node of the same depth and the sub-policy task of the leaf node.
  • the number of sub-processes is the number of intermediate nodes and the number of leaf nodes in the corresponding depth. with.
  • the processor performs the sub-policy task of the intermediate node of the same depth and the sub-guarantee of the leaf node in the order that the depth is deeper and the priority is higher.
  • the single task step includes: when the processing of one sub-policy task requires the processing result of other sub-policy tasks as a basis, the highest priority is defined for other sub-policy tasks, and other sub-policy tasks are prioritized.
  • the step of processing, by the processor, the plurality of sub-processes to process the sub-policy task comprises: enabling the plurality of sub-processes to perform automatic review on the sub-policy task according to a preset rule.
  • FIG. 7 is a schematic diagram of an internal structure of a computer device according to an embodiment of the present application, which may be a server.
  • the computer device includes a processor coupled through a system bus, a non-volatile storage medium, an internal memory, an input device, and a display screen.
  • the non-volatile storage medium of the computer device can store an operating system and computer readable instructions, and when the computer readable instructions are executed, the processor can be caused to perform a method for batch processing policy tasks of various embodiments of the present application.
  • the specific implementation process of the method may refer to the specific content of each embodiment in FIG. 1 to FIG. 5, and details are not described herein again.
  • the processor of the computer device is used to provide computing and control capabilities to support the operation of the entire computer device.
  • the internal memory can store computer readable instructions that, when executed by the processor, cause the processor to perform a method of batch processing the policy task.
  • the input device of the computer device is used for input of various parameters, and the display screen of the computer device is used for display. It will be understood by those skilled in the art that the structure shown in FIG. 7 is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation of the computer device to which the solution of the present application is applied.
  • the specific computer device may It includes more or fewer components than those shown in the figures, or some components are combined, or have different component arrangements.
  • one or more non-transitory readable storage mediums storing computer readable instructions that, when executed by one or more processors, cause one or more processors to execute The following steps: extracting the same category of pending policy tasks from a plurality of pending policies; splitting the policy tasks into sub-policy tasks according to the number of policy tasks of the same category and a preset threshold range, and the number of sub-policy tasks All are within the preset threshold range; multiple sub-processes are opened to process sub-policy tasks; when all sub-policy tasks have been processed, the processing results of sub-policy tasks are summarized and displayed.
  • the processor performs the steps of splitting the policy task into sub-policy tasks according to the number of policy tasks of the same category and a preset threshold range, and the number of sub-policy tasks are within a preset threshold range.
  • the method includes: when the number of acquired policy tasks is greater than a preset threshold range, determining a policy task as a root node of the binary tree to create a binary tree, and splitting the policy task into sub-policy tasks; determining whether the number of sub-policy tasks is greater than a pre- Set the threshold range, if yes, use the sub-policy task as the intermediate node of the binary tree, and split the sub-policy task of the intermediate node into the sub-policy task of the next node of the intermediate node; otherwise, use the sub-policy task as the leaf of the binary tree
  • the node then loops through the decision and split steps until the number of all child policy tasks is within a preset threshold.
  • the step of processing the plurality of sub-processes to process the sub-policy task performed by the processor includes: acquiring the number of intermediate nodes having the same depth in the binary tree and the number of leaf nodes; The higher the order, the multiple sub-processes are simultaneously processed for the sub-policy task of the intermediate node of the same depth and the sub-policy task of the leaf node.
  • the number of sub-processes is the number of intermediate nodes and the number of leaf nodes in the corresponding depth. with.
  • the steps performed by the processor to open the sub-policy task of the intermediate node of the same depth and the sub-policy task of the leaf node in the order that the depth is deeper and the priority is higher includes: when: When the processing of a sub-policy task requires the processing results of other sub-policy tasks as the basis, the highest priority is defined for other sub-policy tasks, and other sub-policy tasks are prioritized.
  • the step of processing, by the processor, the plurality of sub-processes to process the sub-policy task comprises: enabling the plurality of sub-processes to perform automatic review on the sub-policy task according to a preset rule.
  • all or part of the processes in the foregoing embodiment may be completed by using computer readable instructions to instruct related hardware, and the program may be stored in a computer readable storage medium, as implemented in the present application.
  • the program can be stored in a storage medium of a computer system and executed by at least one processor in the computer system to implement a process comprising an embodiment of the methods described above.
  • the storage medium includes but is not limited to a magnetic disk, a USB flash drive, an optical disk, and a read-only storage record. Read-Only Memory (ROM), etc.
  • a plurality of group policies are split into different types of policy tasks to be processed according to different auditing rules, and then the policy tasks to be processed for each category are split according to the quantity, and the split is ensured.
  • the number of final sub-policy tasks is within a certain range, so that the system can process multiple pending policy tasks simultaneously through multiple sub-processes, and finally summarize the processing results to adapt to the self-nuclear of large-volume insurance policies. Work to improve the processing efficiency of large-volume insurance policies.

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

一种批量处理保单任务的方法，包括：从若干个待处理的保单中提取相同类别的待处理的保单任务；根据同一类别的保单任务的数量及预设的阈值范围将保单任务拆分成子保单任务，且子保单任务的数量均在预设的阈值范围内；开启多个子进程对该子保单任务进行处理；当所有子保单任务均已处理时，将该子保单任务的处理结果汇总并显示。

Description

批量处理保单任务的方法、装置、计算机设备及存储介质
本申请要求于2017年07月25日提交中国专利局、申请号为201710614396.2、发明名称为“批量处理保单任务的方法、装置、计算机设备及存储介质”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及保险技术领域，特别是涉及一种批量处理保单任务的方法、装置、计算机设备及存储介质。
背景技术
在保险这一领域内，经常需要涉及对客户的投保单的审核工作，为了降低核保人员的工作量，提高核保效率，对于具有某些共性的保单的审核工作可以由计算机设备或者服务器按照预定的规则进行自动核保。
目前对于由计算机设备或者服务器进行自动核保的操作流程中，当涉及团体保险的核保时，会遇到团体保险的报单量非常大的情况，可以达到几千甚至上万个保单，对于每个保单设定的审核规则往往也不止一个，在这种情况下如果按照目前的处理方法对每个保单一个个的自核所需要的处理时间比较长，使得计算机设备或服务器的处理效率比较低。
发明内容
根据本申请个各种实施例，提供一种批量处理保单任务的方法、装置、计算机设备及存储介质。
一种批量处理保单任务的方法，包括：从若干个待处理的保单中提取相同类别的待处理的保单任务；根据同一类别的保单任务的任务数量及预设的阈值范围将保单任务拆分成子保单任务，且所述子保单任务的任务数量均在所述预设的阈值范围内；开启多个子进程对该子保单任务进行处理；及当所 有子保单任务均已处理时，将该子保单任务的处理结果汇总并显示。
一种批量处理保单任务的装置，该装置包括：提取模块，用于从若干个待处理的保单中提取相同类别的待处理的保单任务；拆分模块，用于根据同一类别的保单任务的数量及预设的阈值范围将保单任务拆分成子保单任务，且所述子保单任务的数量均在所述预设的阈值范围内；处理模块，用于开启多个子进程对该子保单任务进行处理；及显示模块，用于当所有子保单任务均已处理时，将该子保单任务的处理结果汇总并显示。
一种计算机设备，包括存储器和一个或多个处理器，所述存储器中存储有计算机可读指令，所述计算机可读指令被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：从若干个待处理的保单中提取相同类别的待处理的保单任务；根据同一类别的保单任务的任务数量及预设的阈值范围将保单任务拆分成子保单任务，且所述子保单任务的任务数量均在所述预设的阈值范围内；开启多个子进程对该子保单任务进行处理；及当所有子保单任务均已处理时，将该子保单任务的处理结果汇总并显示。
一个或多个存储有计算机可读指令的非易失性可读存储介质，所述计算机可读指令被一个或多个处理器执行时，使得所述一个或多个处理器执行以下步骤：从若干个待处理的保单中提取相同类别的待处理的保单任务；根据同一类别的保单任务的任务数量及预设的阈值范围将保单任务拆分成子保单任务，且所述子保单任务的任务数量均在所述预设的阈值范围内；开启多个子进程对该子保单任务进行处理；及当所有子保单任务均已处理时，将该子保单任务的处理结果汇总并显示。
本申请的一个或多个实施例的细节在下面的附图和描述中提出。本申请的其它特征、目的和优点将从说明书、附图以及权利要求书变得明显。
附图说明
为了更清楚地说明本申请实施例中的技术方案，下面将对实施例中所需 要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本申请的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其它的附图。
图1为一个实施例中批量处理保单任务的方法的流程图；
图2为另一实施例中批量处理保单任务的方法的流程图；
图3为又一实施例中批量处理保单任务的方法的流程图；
图4为一个实施例中使用场景的二叉树的示意图；
图5为另一实施例中使用场景的二叉树的示意图；
图6为一个实施例中批量处理保单任务的装置的示范性结构框图；
图7为一个实施例中计算机设备的内部结构示意图。
具体实施方式
为了使本申请的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本申请进行进一步详细说明。应当理解，此处所描述的具体实施例仅仅用以解释本申请，并不用于限定本申请。
图1为根据本申请的一个实施例的批量处理保单任务的方法的流程图，下面结合图1来详细描述根据本申请的一个实施例的批量处理保单任务的方法，如图1所示，该批量处理保单任务的方法包括以下步骤S101、S102、S103、S104、S105及S106。
S101、从若干个待处理的保单中提取相同类别的待处理的保单任务。
根据本实施例的一个示例，待处理的保单任务的类型包括但不限于被保人的年龄、被保人从事的职业等等，该待处理的保单任务为从若干个待处理的保单中提取相同类别的保单任务，将提取的保单任务作为待处理的保单任务，对每个保单任务添加该保单任务所属保单的保单标识，其中，该保单标识例如该保单的保单号、该保单被保人的身份证号等等，该步骤将不同投保单中核保规则相同的待处理的保单任务提取出来并归类到一起，使得计算机设备可以对同一类别的待处理的保单任务设定自动审核的规则，以提高自核 效率。
S102、获取同一类别的待处理的保单任务的数量。
根据本实施例的一个使用场景，例如待自动审核的保单为某公司的团体保单，该待自动审核的保单的数量有1000个，其中每个保单中都有被保人的年龄、被保人所从事的职业行业、该保单的担保金额等等，则可以将所有保单的被保人的年龄提取出来作为其中一批待处理的保单任务，将所有保单的被保人所从事的行业提取出来作为另一批待处理的保单任务，对于该保单的担保金额也可以做相似的提取。
然后根据同一类别的保单任务的数量及预设的阈值范围将保单任务拆分成子保单任务，且子保单任务的数量均在预设的阈值范围内。其中，具体的拆分步骤包括以下步骤S103和S104。
S103、当获取的该数量大于预设的阈值范围时，将该保单任务拆分为子保单任务。
根据本实施例的一个示例，该阈值范围为用户预先设置的数值，例如当预设的阈值范围为0～200，且依据被保人的年龄提取的待处理的保单任务包含的数量为1000时，需要对该待处理的保单任务进行拆分。
其中，拆分的依据可以是按照保单任务的数量进行拆分，拆分的方式可以是按照二叉树的形式逐层拆分，也可以是按照获取的该数量进行均分，拆分的子保单任务的数量可以与该预设的阈值范围中的最大值相同，例如当预设的阈值范围为0～200时，若按照二叉树的形式逐层拆分可以将该1000份待处理的保单任务拆分为200、800，若按照均分的形式进行拆分可以将该1000份待处理的保单任务拆分为200、200、200、200和200。
S104、判断拆分后的子保单任务的数量是否大于预设的阈值范围，若是，则将该子保单任务拆分为新的子保单任务并循环本判断及拆分步骤，直至拆分后的所有子保单任务的数量均在该预设的阈值范围内。
本步骤通过该判断及拆分的循环步骤使得拆分的最终子保单任务的数量均在预设的阈值范围内，以将每个子保单任务的复杂度都控制在一定的程度， 使得计算机设备可以通过开启多个子进程对该待处理的保单任务进行处理。
S105、开启多个子进程对该子保单任务进行处理。
根据本实施例的一个示例，可以利用开启的多个子进程对各个子保单任务同时进行处理以加快任务的处理效率。
S106、当所有子保单任务均已处理时，将该子保单任务的处理结果汇总并显示。
根据本实施例的一个示例，该汇总的方式可以是通过给每个保单任务添加的该保单任务所属保单的保单标识建立保单任务与保单的对应关系，将属于同一保单标识的报单任务的处理结果进行汇总。
根据本实施例的续上述步骤S102和S103的使用场景，例如从1000份待处理的保单中提取出的待处理的保单任务为1000个被保人的年龄，该对该子保单任务进行处理例如判断被保人的年龄是否符合核保规定，判断被保人的年龄是否符合核保规定例如该团体保单的核保流程中，当被保人的年龄超过预设值(例如60岁)时，处理结果为核保不通过，否则，处理结果为核保不通过，则对提取出的1000个被保人的年龄均做这类的处理，判断提取出的每个被保人的年龄是否超过60岁，若没有超过，则判断审批通过，否则，判断审批不通过。
当提取的待处理的保单任务为审核提取的被保人的职业时，根据上述使用场景类似的，待处理的保单任务为提取1000份保单中被保人所从事的行业，该对该子保单任务进行处理例如判断被保人所从事的职业是否为危险职业，被保人所从事的职业是否为危险职业可以通过以下步骤来实现：获取电子保单中所存储的被保人的职业，判断获取的职业中是否包含有预设的关键字，若是，则判断该被保人所从事职业为危险职业，处理结果为核保不通过，否则，处理结果为核保通过。然后根据每个保单任务与该保单任务所属的保单的对应关系，将该保单任务的处理结果汇总到对应的保单中。
本实施例通过将若干个团体保单按照审核规则的不同拆分为不同类别的待处理的保单任务，然后对每种类别的待处理的保单任务按照数量的多少进 行拆分，并确保拆分的最终子保单任务的数量均在一定的范围内，以使得系统可以通过多个子进程对多个待处理的保单任务同时进行处理，最后将处理结果进行汇总，以适应大批量的投保单的自核工作，提高大批量的投保单的处理效率。
图5为根据本申请的另一使用场景的二叉树的示意图，根据本实施例的一个使用场景例如，所有待核保保单包括被保人为张三的团体保单和被保人为李四的团体保单，当然此处只是为了便于理解仅举团体保单包括两个人情况，在实际业务作业的过程中，团体保单可能包含几千个保单的情况，参照图5，规则A的核保任务为审核被保人的年龄，规则B的核保任务为审核被保人所从事的职业，被保人张三的团体电子保单中存储了张三的年龄和张三的职业，被保人李四的团体电子保单中存储了李四的年龄和李四的职业，被拆分的待处理的保单任务包括第一保单任务——被保人的年龄、第二保单任务——被保人所从事的职业，然后以保单任务为单位对该保单任务中所包含的数量进行判断、是否拆分及处理，当所有保单任务均处理完毕时，根据每个保单任务所属的保单，将同一保单标识对应保单的处理结果汇总，例如第一保单任务的处理结果为张三的年龄审核通过、李四的年龄审核不通过，第二保单任务的处理结果为张三从事的职业为危险职业、李四从事的职业不为危险职业，则分别将属于被保人为张三和李四的保单中的保单任务的处理结果汇总，汇总后显示的内容例如：
张三的年龄审核通过、张三从事的职业为危险职业审核不通过；
李四的年龄审核不通过，李四从事的职业不为危险职业审核通过。
具体显示的内容可根据用户的实际需求预设的对应的输出显示参数来确定具体显示哪些内容。
根据本申请另一实施例提供的批量处理保单任务的方法，该方法还包括：
当获取的该保单任务的数量大于预设的阈值范围时，将该保单任务确定为二叉树的根节点创建该二叉树，并将该保单任务拆分为子保单任务，图4为根据本申请的一个使用场景的二叉树的示意图，如图4所示的使用场景， 当规则A的核保任务的数量大于预设的阈值范围(例如为200)时，将规则A的核保任务最为二叉树的根节点，将规则A下的核保任务以二叉树的形式拆分为子保单任务Task1.1和Task1.2；
判断该子保单任务的数量是否大于预设的阈值范围，若是，则将该子保单任务作为该二叉树的中间节点，并将该中间节点的子保单任务拆分为该中间节点的下一节点的子保单任务，否则，将该子保单任务作为该二叉树的叶子节点，然后循环本判断及拆分步骤直至所有子保单任务的数量均在该预设的阈值范围内。
根据本实施例的一个使用场景参照图4所示，当规则A的核保任务的数量超过预设的阈值范围时，将规则A的核保任务拆分为子保单任务Task1.1和Task1.2，拆分的依据可以是按照图4所示的二叉树的形式逐层拆分，拆分的子保单任务的数量可以与该预设的阈值范围中的最大值相同，例如预设阈值范围为0～200，该规则A下的核保任务包括550时，则将其中的200个子保单任务拆分为Task1.1，将剩余的子保单任务450拆分为Task1.2，然后判断每个子保单任务的数量是否超过预设的阈值范围，判断结果是Task1.2超出了预设的阈值范围，而Task1.1未超出预设的阈值范围，则将Task1.1作为该二叉树的叶子节点，将Task1.2.作为该二叉树的中间节点对Task1.2继续拆分，将其中的200拆分为Task1.2.1，将剩下的150拆分为Task1.2.2，再次判断该Task1.2.1和Task1.2.2均未超出预设的阈值范围，则将Task1.2.1和Task1.2.2最为该二叉树的叶子节点，至此完成该二叉树的创建。
在一个实施例中，该开启多个子进程对该子保单任务进行处理的步骤包括：
获取该二叉树中具有同一纵深的中间节点的个数及叶子节点的个数；
按照纵深越深优先级越高的顺序，开启多个子进程同时处理同一纵深的中间节点的子保单任务及叶子节点的子保单任务，该子进程的个数为对应纵深中中间节点的个数与叶子节点的个数之和。
其中，上述的纵深是指该中间节点或叶子节点在该二叉树中的层数，如 图4所示叶子节点Task1.1和中间节点Task1.2的纵深为2，叶子节点Task1.2.1和叶子节点Task1.2.2的纵深为3。根据本实施例的结合图4中的一个使用场景，由于纵深为3的优先级高于纵深为2的优先级，则优先开启两个子进程同时处理纵深为3的叶子节点Task1.2.1和Task1.2.2中的子保单任务，然后在处理纵深为2的叶子节点Task1.1和中间节点Task1.2的子保单任务。
图2为根据本申请的另一实施例的批量处理保单任务的方法的流程图，如图2所示的批量处理保单任务的方法，该方法在包括上述步骤S101、S102和S106的基础上还包括以下步骤S201至S206。
S201、当获取的该数量大于预设的阈值范围时，将该保单任务拆分为子保单任务，将该保单任务确定为二叉树的根节点创建该二叉树。
S202、判断子保单任务的数量是否大于预设的阈值范围，若是则跳转至步骤S203，若否，则跳转至步骤S204。
S203、将该子保单任务作为该二叉树的中间节点，并将该中间节点的子保单任务拆分为该中间节点的下一节点的子保单任务。
S204、将该子保单任务作为该二叉树的叶子节点。
S205、获取该二叉树中具有同一纵深的中间节点的个数及叶子节点的个数。
S206、按照纵深越深优先级越高的顺序，开启多个子进程同时处理同一纵深的中间节点的子保单任务及叶子节点的子保单任务，该子进程的个数为对应纵深中中间节点的个数与叶子节点的个数之和。
图3为根据本申请的又一实施例的批量处理保单任务的方法的流程图，如图3所示，该方法在包括上述步骤S101至S104及S105的基础上，上述步骤S105在一个实施例中为步骤S301。
S301、开启多个子进程对该子保单任务按照预设的规则进行自动审核。
根据本实施例的一个示例，该预设的规则根据核保任务的不同做不同的预设，例如当待处理的报单任务为被保人的年龄时，该对该子保单任务预设的规则可以是判断被保人的年龄是否符合核保规定，当被保人的年龄超过预 设值(例如60岁)时，预设的处理结果为核保不通过，否则，处理结果为核保通过。再例如当待处理的报单任务为被保人所从事的职业时，判断被保人所从事的职业是否为危险职业，被保人所从事的职业是否为危险职业可以通过以下步骤来实现：获取电子保单中所存储的被保人的职业，判断获取的职业中是否包含有预设的关键字，若是，则判断该被保人所从事职业为危险职业，预设的处理结果为核保不通过，否则，预设的处理结果为核保通过。
根据本实施例的一个示例，当一个子保单任务的处理过程需要其它子保单任务的处理结果作为依据时，对其它子保单任务定义最高的优先级，优先处理该其它子保单任务。其中，“其它子保单任务”表示被依赖的保单任务，对该其它子保单任务定义的优先级高于按照纵深定义的保单任务的优先级。
在该步骤中，如果一个子保单任务的处理过程需要其它子保单任务的处理结果作为依据才可完成该子保单的处理工作，表示该子保单任务与该其它子保单任务存在依赖关系，优先处理该其它子保单任务有利于该子保单任务的处理流程顺利进行。
根据本实施例的一个示例，上述步骤S101～S301的标号并不用于限定本实施例中各个步骤的先后顺序，各个步骤的编号只是为了使得描述各个步骤时可以通用引用该步骤的标号进行便捷的指代，只要各个步骤执行的顺序不影响本实施例的逻辑关系都视为在本申请的保护范围之内。
图6为根据本申请的一个实施例的批量处理保单任务的装置的示范性结构框图，下面结合图6来详细描述根据本申请的一个实施例的批量处理保单任务的装置，如图6所示，该批量处理保单任务的装置10包括：提取模块11，用于从若干个待处理的保单中提取相同类别的保单任务，将提取的保单任务作为待处理的保单任务。拆分模块，用于根据同一类别的保单任务的数量及预设的阈值范围将保单任务拆分成子保单任务，且子保单任务的数量均在预设的阈值范围内。
在一个实施例中，该拆分模块还包括：拆分单元12，用于当提取的同一类别的该待处理的保单任务的数量大于预设的阈值范围时，将该保单任务拆 分为子保单任务；循环单元13，用于判断拆分后的子保单任务的数量是否大于预设的阈值范围，若是，则将该子保单任务拆分为新的子保单任务并循环本判断及拆分步骤，直至拆分后的所有子保单任务的数量均在该预设的阈值范围内；处理模块14，用于开启多个子进程对该子保单任务进行处理；显示模块15，用于当所有子保单任务均已处理时，将该子保单任务的处理结果汇总并显示。
其中，上述显示模块15具体用于根据每个保单任务与该保单任务所属的保单的对应关系，将该保单任务的处理结果汇总到对应的保单中，显示汇总后的保单中每个保单任务的处理结果。
在一个实施例中，该批量处理保单任务的装置10还包括：数量获取模块，用于获取同一类别的待处理的报单任务的数量。
在一个实施例中，该装置还包括：标识添加模块，用于对每个保单任务添加该保单任务所属保单的保单标识，以将每个保单任务与该保单任务所属的保单的建立对应关系，便于拆分后汇总，其中，该保单标识例如该保单的保单号、该保单被保人的身份证号等等。
在一个实施例中，该批量处理保单任务的装置10还包括：二叉树创建模块，用于当获取的该保单任务的数量大于预设的阈值范围时，将该保单任务确定为二叉树的根节点创建该二叉树，并将该保单任务拆分为子保单任务；节点确定模块，用于判断该子保单任务的数量是否大于预设的阈值范围，若是，则将该子保单任务作为该二叉树的中间节点，并将该中间节点的子保单任务拆分为该中间节点的下一节点的子保单任务，否则，将该子保单任务作为该二叉树的叶子节点，然后循环本判断及拆分步骤直至所有子保单任务的数量均在该预设的阈值范围内。
根据本实施例的一个示例，该处理模块14包括：数量获取单元，用于获取该二叉树中具有同一纵深的中间节点的个数及叶子节点的个数；处理单元，用于按照纵深越深优先级越高的顺序，开启多个子进程同时处理同一纵深的中间节点的子保单任务及叶子节点的子保单任务，该子进程的个数为对应纵 深中中间节点的个数与叶子节点的个数之和。
在一个实施例中，当一个子保单任务的处理过程需要其它子保单任务的处理结果作为依据时，对其它子保单任务定义最高的优先级，该处理模块14优先处理该其它子保单任务。
如果一个子保单任务的处理过程需要其它子保单任务的处理结果作为依据才可完成该子保单的处理工作，表示该子保单任务与该其它子保单任务存在依赖关系，该处理模块14优先处理该其它子保单任务有利于该子保单任务的处理流程顺利进行。
在一个实施例中，该处理模块14具体用于开启多个子进程对该子保单任务按照预设的规则进行自动审核。
其中，可以将根据核保任务的不同预设的不同规则存储在系统中，例如当存储的待处理的报单任务为被保人的年龄时，该处理模块14具体用于判断被保人的年龄是否符合核保规定，当被保人的年龄超过预设值(例如60岁)时，预设的处理结果为核保不通过，否则，处理结果为核保不通过。再例如当存储的待处理的报单任务为被保人所从事的职业时，该处理模块14具体用于判断被保人所从事的职业是否为危险职业，若是处理结果为核保不通过，否则，处理结果为核保不通过，该处理模块14具体用于通过实现以下步骤来判断被保人所从事的行业是否为危险行业：获取电子保单中所存储的被保人的职业，判断获取的职业中是否包含有预设的关键字，若是，则判断该被保人所从事职业为危险职业，预设的处理结果为核保不通过，否则，预设的处理结果为核保通过。
上述批量处理保单任务的装置中的各个模块可全部或部分通过软件、硬件及其组合来实现。上述各模块可以硬件形式内嵌于或独立于终端的存储器中，也可以以软件形式存储于终端的存储器中，以便于处理器调用执行以上各个模块对应的操作。该处理器可以为中央处理单元(CPU)、微处理器、单片机等。
上述批量处理保单任务的装置可以实现为一种计算机可读指令的形式， 在如图7所示的计算机设备上运行。
本实施例还提供一种计算机设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机可读指令，该处理器执行该程序时实现如上述批量处理保单任务的方法。
在一个实施例中，提供了一种计算机设备，包括存储器和一个或多个处理器，存储器中存储有计算机可读指令，计算机可读指令被处理器执行时，使得一个或多个处理器执行以下步骤：从若干个待处理的保单中提取相同类别的待处理的保单任务；根据同一类别的保单任务的数量及预设的阈值范围将保单任务拆分成子保单任务，且子保单任务的数量均在预设的阈值范围内；开启多个子进程对子保单任务进行处理；当所有子保单任务均已处理时，将子保单任务的处理结果汇总并显示。
在一个实施例中，处理器所执行的根据同一类别的保单任务的数量及预设的阈值范围将保单任务拆分成子保单任务，且子保单任务的数量均在预设的阈值范围内的步骤，包括：当获取的保单任务的数量大于预设的阈值范围时，将保单任务确定为二叉树的根节点创建二叉树，并将保单任务拆分为子保单任务；判断子保单任务的数量是否大于预设的阈值范围，若是，则将子保单任务作为二叉树的中间节点，并将中间节点的子保单任务拆分为中间节点的下一节点的子保单任务，否则，将子保单任务作为二叉树的叶子节点，然后循环本判断及拆分步骤直至所有子保单任务的数量均在预设的阈值范围内。
在一个实施例中，处理器所执行的开启多个子进程对子保单任务进行处理的步骤，包括：获取二叉树中具有同一纵深的中间节点的个数及叶子节点的个数；按照纵深越深优先级越高的顺序，开启多个子进程同时处理同一纵深的中间节点的子保单任务及叶子节点的子保单任务，子进程的个数为对应纵深中中间节点的个数与叶子节点的个数之和。
在一个实施例中，处理器所执行的按照纵深越深优先级越高的顺序，开启多个子进程同时处理同一纵深的中间节点的子保单任务及叶子节点的子保 单任务的步骤，包括：当一个子保单任务的处理过程需要其它子保单任务的处理结果作为依据时，对其它子保单任务定义最高的优先级，优先处理其它子保单任务。
在一个实施例中，处理器所执行的开启多个子进程对子保单任务进行处理的步骤，包括：开启多个子进程对子保单任务按照预设的规则进行自动审核。
图7为根据本申请的一个实施例的计算机设备的内部结构示意图，该计算机设备可以为服务器。参照图7，该计算机设备包括通过系统总线连接的处理器、非易失性存储介质、内存储器、输入装置和显示屏。其中，该计算机设备的非易失性存储介质可存储操作系统和计算机可读指令，该计算机可读指令被执行时，可使得处理器执行本申请各实施例的一种批量处理保单任务的方法，该方法的具体实现过程可参考图1至图5各实施例的具体内容，在此不再赘述。该计算机设备的处理器用于提供计算和控制能力，支撑整个计算机设备的运行。该内存储器中可储存有计算机可读指令，该计算机可读指令被处理器执行时，可使得处理器执行一种批量处理保单任务的方法。计算机设备的输入装置用于各个参数的输入，计算机设备的显示屏用于进行显示。本领域技术人员可以理解，图7中示出的结构，仅仅是与本申请方案相关的部分结构的框图，并不构成对本申请方案所应用于其上的计算机设备的限定，具体的计算机设备可以包括比图中所示更多或更少的部件，或者组合某些部件，或者具有不同的部件布置。
在一个实施例中，提供了一个或多个存储有计算机可读指令的非易失性可读存储介质，计算机可读指令被一个或多个处理器执行时，使得一个或多个处理器执行以下步骤：从若干个待处理的保单中提取相同类别的待处理的保单任务；根据同一类别的保单任务的数量及预设的阈值范围将保单任务拆分成子保单任务，且子保单任务的数量均在预设的阈值范围内；开启多个子进程对子保单任务进行处理；当所有子保单任务均已处理时，将子保单任务的处理结果汇总并显示。
在一个实施例中，处理器所执行的根据同一类别的保单任务的数量及预设的阈值范围将保单任务拆分成子保单任务，且子保单任务的数量均在预设的阈值范围内的步骤，包括：当获取的保单任务的数量大于预设的阈值范围时，将保单任务确定为二叉树的根节点创建二叉树，并将保单任务拆分为子保单任务；判断子保单任务的数量是否大于预设的阈值范围，若是，则将子保单任务作为二叉树的中间节点，并将中间节点的子保单任务拆分为中间节点的下一节点的子保单任务，否则，将子保单任务作为二叉树的叶子节点，然后循环本判断及拆分步骤直至所有子保单任务的数量均在预设的阈值范围内。
在一个实施例中，处理器所执行的开启多个子进程对子保单任务进行处理的步骤，包括：获取二叉树中具有同一纵深的中间节点的个数及叶子节点的个数；按照纵深越深优先级越高的顺序，开启多个子进程同时处理同一纵深的中间节点的子保单任务及叶子节点的子保单任务，子进程的个数为对应纵深中中间节点的个数与叶子节点的个数之和。
在一个实施例中，处理器所执行的按照纵深越深优先级越高的顺序，开启多个子进程同时处理同一纵深的中间节点的子保单任务及叶子节点的子保单任务的步骤，包括：当一个子保单任务的处理过程需要其它子保单任务的处理结果作为依据时，对其它子保单任务定义最高的优先级，优先处理其它子保单任务。
在一个实施例中，处理器所执行的开启多个子进程对子保单任务进行处理的步骤，包括：开启多个子进程对子保单任务按照预设的规则进行自动审核。
根据本实施例的一个示例，上述实施例方法中的全部或部分流程，可以通过计算机可读指令来指令相关的硬件来完成，程序可存储于一计算机可读取存储介质中，如本申请实施例中，该程序可存储于计算机系统的存储介质中，并被该计算机系统中的至少一个处理器执行，以实现包括如上述各方法的实施例的流程。该存储介质包括但不限于磁碟、优盘、光盘、只读存储记 忆体(Read-Only Memory，ROM)等。
本实施例通过将若干个团体保单按照审核规则的不同拆分为不同类别的待处理的保单任务，然后对每种类别的待处理的保单任务按照数量的多少进行拆分，并确保拆分的最终子保单任务的数量均在一定的范围内，以使得系统可以通过多个子进程对多个待处理的保单任务同时进行处理，最后将处理结果进行汇总，以适应大批量的投保单的自核工作，提高大批量的投保单的处理效率。
以上所述实施例的各技术特征可以进行任意的组合，为使描述简洁，未对上述实施例中的各个技术特征所有可能的组合都进行描述，然而，只要这些技术特征的组合不存在矛盾，都应当认为是本说明书记载的范围。
以上所述实施例仅表达了本申请的几种实施方式，其描述较为具体和详细，但并不能因此而理解为对发明专利范围的限制。应当指出的是，对于本领域的普通技术人员来说，在不脱离本申请构思的前提下，还可以做出若干变形和改进，这些都属于本申请的保护范围。因此，本申请专利的保护范围应以所附权利要求为准。

Claims (20)

  1. 一种批量处理保单任务的方法，包括：
    从若干个待处理的保单中提取相同类别的待处理的保单任务；
    根据同一类别的保单任务的数量及预设的阈值范围将保单任务拆分成子保单任务，且所述子保单任务的数量均在所述预设的阈值范围内；
    开启多个子进程对所述子保单任务进行处理；及
    当所有子保单任务均已处理时，将所述子保单任务的处理结果汇总并显示。
  2. 根据权利要求1所述的方法，其特征在于，所述根据同一类别的保单任务的数量及预设的阈值范围将保单任务拆分成子保单任务，且所述子保单任务的数量均在所述预设的阈值范围内，包括：
    当获取的所述保单任务的数量大于预设的阈值范围时，将所述保单任务确定为二叉树的根节点创建所述二叉树，并将所述保单任务拆分为子保单任务；及
    判断所述子保单任务的数量是否大于预设的阈值范围，若是，则将所述子保单任务作为所述二叉树的中间节点，并将所述中间节点的子保单任务拆分为所述中间节点的下一节点的子保单任务，否则，将所述子保单任务作为所述二叉树的叶子节点，然后循环本判断及拆分步骤直至所有子保单任务的数量均在所述预设的阈值范围内。
  3. 根据权利要求1所述的方法，其特征在于，所述开启多个子进程对所述子保单任务进行处理，包括：
    获取所述二叉树中具有同一纵深的中间节点的个数及叶子节点的个数；及
    按照纵深越深优先级越高的顺序，开启多个子进程同时处理同一纵深的中间节点的子保单任务及叶子节点的子保单任务，所述子进程的个数为对应纵深中中间节点的个数与叶子节点的个数之和。
  4. 根据权利要求3所述的方法，其特征在于，所述按照纵深越深优先级 越高的顺序，开启多个子进程同时处理同一纵深的中间节点的子保单任务及叶子节点的子保单任务，包括：
    当一个子保单任务的处理过程需要其它子保单任务的处理结果作为依据时，对所述其它子保单任务定义最高的优先级，优先处理所述其它子保单任务。
  5. 根据权利要求1所述的方法，其特征在于，所述开启多个子进程对所述子保单任务进行处理，包括：
    开启多个子进程对所述子保单任务按照预设的规则进行自动审核。
  6. 一种批量处理保单任务的装置，其特征在于，所述装置包括：
    提取模块，用于从若干个待处理的保单中提取相同类别的待处理的保单任务；
    拆分模块，用于根据同一类别的保单任务的数量及预设的阈值范围将保单任务拆分成子保单任务，且所述子保单任务的数量均在所述预设的阈值范围内；
    处理模块，用于开启多个子进程对所述子保单任务进行处理；及
    显示模块，用于当所有子保单任务均已处理时，将所述子保单任务的处理结果汇总并显示。
  7. 根据权利要求6所述的装置，其特征在于，所述装置还包括：
    二叉树创建模块，用于当获取的所述保单任务的数量大于预设的阈值范围时，将所述保单任务确定为二叉树的根节点创建所述二叉树，并将所述保单任务拆分为子保单任务；及
    节点确定模块，用于判断所述子保单任务的数量是否大于预设的阈值范围，若是，则将所述子保单任务作为所述二叉树的中间节点，并将所述中间节点的子保单任务拆分为所述中间节点的下一节点的子保单任务，否则，将所述子保单任务作为所述二叉树的叶子节点，然后循环本判断及拆分步骤直至所有子保单任务的数量均在所述预设的阈值范围内。
  8. 根据权利要求6所述的装置，其特征在于，所述处理模块14包括：
    数量获取单元，用于获取该二叉树中具有同一纵深的中间节点的个数及叶子节点的个数；及
    处理单元，用于按照纵深越深优先级越高的顺序，开启多个子进程同时处理同一纵深的中间节点的子保单任务及叶子节点的子保单任务，该子进程的个数为对应纵深中中间节点的个数与叶子节点的个数之和。
  9. 根据权利要求8所述的装置，其特征在于，所述处理单元还用于当一个子保单任务的处理过程需要其它子保单任务的处理结果作为依据时，对所述其它子保单任务定义最高的优先级，优先处理所述其它子保单任务。
  10. 根据权利要求6所述的装置，其特征在于，所述处理模块还用于开启多个子进程对所述子保单任务按照预设的规则进行自动审核。
  11. 一种计算机设备，包括存储器和一个或多个处理器，所述存储器中存储有计算机可读指令，所述计算机可读指令被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：
    从若干个待处理的保单中提取相同类别的待处理的保单任务；
    根据同一类别的保单任务的数量及预设的阈值范围将保单任务拆分成子保单任务，且所述子保单任务的数量均在所述预设的阈值范围内；
    开启多个子进程对所述子保单任务进行处理；及
    当所有子保单任务均已处理时，将所述子保单任务的处理结果汇总并显示。
  12. 根据权利要求11所述的计算机设备，其特征在于，所述处理器所执行的根据同一类别的保单任务的数量及预设的阈值范围将保单任务拆分成子保单任务，且所述子保单任务的数量均在所述预设的阈值范围内的步骤，包括：
    当获取的所述保单任务的数量大于预设的阈值范围时，将所述保单任务确定为二叉树的根节点创建所述二叉树，并将所述保单任务拆分为子保单任务；及
    判断所述子保单任务的数量是否大于预设的阈值范围，若是，则将所述 子保单任务作为所述二叉树的中间节点，并将所述中间节点的子保单任务拆分为所述中间节点的下一节点的子保单任务，否则，将所述子保单任务作为所述二叉树的叶子节点，然后循环本判断及拆分步骤直至所有子保单任务的数量均在所述预设的阈值范围内。
  13. 根据权利要求11所述的计算机设备，其特征在于，所述处理器所执行的开启多个子进程对所述子保单任务进行处理的步骤，包括：
    获取所述二叉树中具有同一纵深的中间节点的个数及叶子节点的个数；及
    按照纵深越深优先级越高的顺序，开启多个子进程同时处理同一纵深的中间节点的子保单任务及叶子节点的子保单任务，所述子进程的个数为对应纵深中中间节点的个数与叶子节点的个数之和。
  14. 根据权利要求13所述的计算机设备，其特征在于，所述处理器所执行的按照纵深越深优先级越高的顺序，开启多个子进程同时处理同一纵深的中间节点的子保单任务及叶子节点的子保单任务的步骤，包括：
    当一个子保单任务的处理过程需要其它子保单任务的处理结果作为依据时，对所述其它子保单任务定义最高的优先级，优先处理所述其它子保单任务。
  15. 根据权利要求11所述的计算机设备，其特征在于，所述处理器所执行的开启多个子进程对所述子保单任务进行处理的步骤，包括：
    开启多个子进程对所述子保单任务按照预设的规则进行自动审核。
  16. 一个或多个存储有计算机可读指令的非易失性可读存储介质，所述计算机可读指令被一个或多个处理器执行时，使得所述一个或多个处理器执行以下步骤：
    从若干个待处理的保单中提取相同类别的待处理的保单任务；
    根据同一类别的保单任务的数量及预设的阈值范围将保单任务拆分成子保单任务，且所述子保单任务的数量均在所述预设的阈值范围内；
    开启多个子进程对所述子保单任务进行处理；及
    当所有子保单任务均已处理时，将所述子保单任务的处理结果汇总并显示。
  17. 根据权利要求16所述的存储介质，其特征在于，所述处理器所执行的根据同一类别的保单任务的数量及预设的阈值范围将保单任务拆分成子保单任务，且所述子保单任务的数量均在所述预设的阈值范围内的步骤，包括：
    当获取的所述保单任务的数量大于预设的阈值范围时，将所述保单任务确定为二叉树的根节点创建所述二叉树，并将所述保单任务拆分为子保单任务；及
    判断所述子保单任务的数量是否大于预设的阈值范围，若是，则将所述子保单任务作为所述二叉树的中间节点，并将所述中间节点的子保单任务拆分为所述中间节点的下一节点的子保单任务，否则，将所述子保单任务作为所述二叉树的叶子节点，然后循环本判断及拆分步骤直至所有子保单任务的数量均在所述预设的阈值范围内。
  18. 根据权利要求16所述的存储介质，其特征在于，所述处理器所执行的开启多个子进程对所述子保单任务进行处理的步骤，包括：
    获取所述二叉树中具有同一纵深的中间节点的个数及叶子节点的个数；及
    按照纵深越深优先级越高的顺序，开启多个子进程同时处理同一纵深的中间节点的子保单任务及叶子节点的子保单任务，所述子进程的个数为对应纵深中中间节点的个数与叶子节点的个数之和。
  19. 根据权利要求18所述的存储介质，其特征在于，所述处理器所执行的按照纵深越深优先级越高的顺序，开启多个子进程同时处理同一纵深的中间节点的子保单任务及叶子节点的子保单任务的步骤，包括：
    当一个子保单任务的处理过程需要其它子保单任务的处理结果作为依据时，对所述其它子保单任务定义最高的优先级，优先处理所述其它子保单任务。
  20. 根据权利要求16所述的存储介质，其特征在于，所述处理器所执行 的开启多个子进程对所述子保单任务进行处理的步骤，包括：
    开启多个子进程对所述子保单任务按照预设的规则进行自动审核。
PCT/CN2017/104643 2017-07-25 2017-09-29 批量处理保单任务的方法、装置、计算机设备及存储介质 WO2019019381A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710614396.2 2017-07-25
CN201710614396.2A CN107689010B (zh) 2017-07-25 2017-07-25 批量处理保单任务的方法、装置、计算机设备及存储介质

Publications (1)

Publication Number Publication Date
WO2019019381A1 true WO2019019381A1 (zh) 2019-01-31

Family

ID=61152988

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/104643 WO2019019381A1 (zh) 2017-07-25 2017-09-29 批量处理保单任务的方法、装置、计算机设备及存储介质

Country Status (2)

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

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111126935A (zh) * 2019-11-19 2020-05-08 泰康保险集团股份有限公司 保全数据的处理方法、装置、电子设备和存储介质
CN111190703A (zh) * 2019-12-11 2020-05-22 平安医疗健康管理股份有限公司 实时数据处理方法、装置、计算机设备和存储介质
CN111222845A (zh) * 2019-12-27 2020-06-02 北京健康之家科技有限公司 资源流转方法、装置、设备及可读存储介质
CN111507850A (zh) * 2020-03-25 2020-08-07 上海商汤智能科技有限公司 核保方法及相关装置、设备
CN111626870A (zh) * 2020-05-25 2020-09-04 泰康保险集团股份有限公司 清洁体检件的核保数据处理方法、装置及设备
CN111680974A (zh) * 2020-05-29 2020-09-18 泰康保险集团股份有限公司 电子化承保流程的问题定位方法及装置
CN111813515A (zh) * 2020-06-29 2020-10-23 中国平安人寿保险股份有限公司 基于多进程的任务调度方法、装置、计算机设备及介质
CN111932047A (zh) * 2019-05-13 2020-11-13 北京京东尚科信息技术有限公司 分配多任务集的方法、装置、设备和计算机可读介质
CN112330472A (zh) * 2020-11-17 2021-02-05 中国平安财产保险股份有限公司 业务数据处理方法、装置、计算机设备及存储介质
CN112668951A (zh) * 2019-10-16 2021-04-16 北京京东乾石科技有限公司 一种任务处理方法、装置、服务器及存储介质
CN113065973A (zh) * 2021-04-22 2021-07-02 中国平安财产保险股份有限公司 基于大数据的农险理赔处理方法、装置、设备及存储介质
CN113609178A (zh) * 2021-08-12 2021-11-05 深圳壹账通智能科技有限公司 数据推送方法、装置、设备以及存储介质
CN113703934A (zh) * 2020-05-22 2021-11-26 腾讯科技（深圳）有限公司 任务处理方法、装置、计算机设备和存储介质

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109255569B (zh) * 2018-08-24 2021-03-12 北京极智嘉科技有限公司 库内理货方法、装置、服务器和存储介质
CN109064295A (zh) * 2018-09-05 2018-12-21 中国平安财产保险股份有限公司 投保报价的计算方法、装置、计算机设备和存储介质
CN110351100A (zh) * 2019-05-31 2019-10-18 平安科技（深圳）有限公司 数据传输方法、装置、计算机设备及计算机可读存储介质
CN110674106B (zh) * 2019-08-30 2022-03-15 中国人民财产保险股份有限公司 保单数据的存储方法、装置、设备及计算机可读存储介质
CN111047277B (zh) * 2019-11-19 2023-07-07 泰康保险集团股份有限公司 核保系统、方法、设备和计算机可读介质
CN111045825A (zh) * 2019-12-12 2020-04-21 深圳前海环融联易信息科技服务有限公司 批处理性能优化方法、装置、计算机设备及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102790698A (zh) * 2012-08-14 2012-11-21 南京邮电大学 一种基于节能树的大规模计算集群任务调度方法
US20130346033A1 (en) * 2012-06-21 2013-12-26 Jianqiang Wang Tree-based regression
CN105117283A (zh) * 2015-08-26 2015-12-02 深圳市华验防伪科技有限公司 一种任务拆分方法及系统
CN105700958A (zh) * 2016-01-07 2016-06-22 北京京东尚科信息技术有限公司 一种任务自动拆分以及子任务并行执行的方法及其系统
CN106844018A (zh) * 2015-12-07 2017-06-13 阿里巴巴集团控股有限公司 一种任务处理方法、装置及系统

Family Cites Families (4)

* 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
CN102681902A (zh) * 2012-05-15 2012-09-19 浙江大学 一种基于多核系统任务分配的负载均衡方法
CN102882981B (zh) * 2012-10-19 2015-01-28 南京邮电大学 一种对等结构云平台下节点任务的负载均衡方法
CN106952163B (zh) * 2016-01-07 2021-04-13 平安科技（深圳）有限公司 保险数据处理方法及系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130346033A1 (en) * 2012-06-21 2013-12-26 Jianqiang Wang Tree-based regression
CN102790698A (zh) * 2012-08-14 2012-11-21 南京邮电大学 一种基于节能树的大规模计算集群任务调度方法
CN105117283A (zh) * 2015-08-26 2015-12-02 深圳市华验防伪科技有限公司 一种任务拆分方法及系统
CN106844018A (zh) * 2015-12-07 2017-06-13 阿里巴巴集团控股有限公司 一种任务处理方法、装置及系统
CN105700958A (zh) * 2016-01-07 2016-06-22 北京京东尚科信息技术有限公司 一种任务自动拆分以及子任务并行执行的方法及其系统

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111932047A (zh) * 2019-05-13 2020-11-13 北京京东尚科信息技术有限公司 分配多任务集的方法、装置、设备和计算机可读介质
CN112668951A (zh) * 2019-10-16 2021-04-16 北京京东乾石科技有限公司 一种任务处理方法、装置、服务器及存储介质
CN111126935A (zh) * 2019-11-19 2020-05-08 泰康保险集团股份有限公司 保全数据的处理方法、装置、电子设备和存储介质
CN111190703A (zh) * 2019-12-11 2020-05-22 平安医疗健康管理股份有限公司 实时数据处理方法、装置、计算机设备和存储介质
CN111190703B (zh) * 2019-12-11 2023-02-07 深圳平安医疗健康科技服务有限公司 实时数据处理方法、装置、计算机设备和存储介质
CN111222845A (zh) * 2019-12-27 2020-06-02 北京健康之家科技有限公司 资源流转方法、装置、设备及可读存储介质
CN111507850A (zh) * 2020-03-25 2020-08-07 上海商汤智能科技有限公司 核保方法及相关装置、设备
CN113703934A (zh) * 2020-05-22 2021-11-26 腾讯科技（深圳）有限公司 任务处理方法、装置、计算机设备和存储介质
CN111626870A (zh) * 2020-05-25 2020-09-04 泰康保险集团股份有限公司 清洁体检件的核保数据处理方法、装置及设备
CN111680974A (zh) * 2020-05-29 2020-09-18 泰康保险集团股份有限公司 电子化承保流程的问题定位方法及装置
CN111680974B (zh) * 2020-05-29 2023-09-22 泰康保险集团股份有限公司 电子化承保流程的问题定位方法及装置
CN111813515A (zh) * 2020-06-29 2020-10-23 中国平安人寿保险股份有限公司 基于多进程的任务调度方法、装置、计算机设备及介质
CN112330472A (zh) * 2020-11-17 2021-02-05 中国平安财产保险股份有限公司 业务数据处理方法、装置、计算机设备及存储介质
CN112330472B (zh) * 2020-11-17 2023-10-27 中国平安财产保险股份有限公司 业务数据处理方法、装置、计算机设备及存储介质
CN113065973A (zh) * 2021-04-22 2021-07-02 中国平安财产保险股份有限公司 基于大数据的农险理赔处理方法、装置、设备及存储介质
CN113065973B (zh) * 2021-04-22 2022-08-02 中国平安财产保险股份有限公司 基于大数据的农险理赔处理方法、装置、设备及存储介质
CN113609178A (zh) * 2021-08-12 2021-11-05 深圳壹账通智能科技有限公司 数据推送方法、装置、设备以及存储介质

Also Published As

Publication number Publication date
CN107689010B (zh) 2022-04-29
CN107689010A (zh) 2018-02-13

Similar Documents

Publication Publication Date Title
WO2019019381A1 (zh) 批量处理保单任务的方法、装置、计算机设备及存储介质
WO2020157607A1 (en) Patch management in a hybrid computing environment
US10318894B2 (en) Conformance authority reconciliation
US10073683B2 (en) System and method for providing software build violation detection and self-healing
US20190155941A1 (en) Generating asset level classifications using machine learning
US11036491B1 (en) Identifying and resolving firmware component dependencies
US8904240B2 (en) Monitoring and resolving deadlocks, contention, runaway CPU and other virtual machine production issues
US11016805B2 (en) Programmatically applying labels to nodes in cluster orchestration platforms
US11366745B2 (en) Testing program code created in a development system
WO2019019379A1 (zh) 业务模板的匹配方法、装置、计算机设备及存储介质
CN109710624B (zh) 数据处理方法、装置、介质及电子设备
US20200026859A1 (en) Methods and systems for system call reduction
EP2983117A1 (en) Event processing method in stream processing system and stream processing system
US9003231B1 (en) System for instantiating service instances for testing in a known state
CN106685894B (zh) 一种风险识别方法、装置及系统
WO2020029400A1 (zh) 项目推荐方法、装置、计算机设备及存储介质
CN111177113A (zh) 数据迁移方法、装置、计算机设备和存储介质
WO2021143055A1 (zh) 智能化的数据优化方法、装置、电子设备及存储介质
WO2019061667A1 (zh) 电子装置、数据处理方法、系统及计算机可读存储介质
US20120317537A1 (en) Task management for changes to shared artifacts
US7979743B2 (en) Determining correctness of job plans in a stream processing application
US9442698B2 (en) Migration between model elements of different types in a modeling environment
KR102141084B1 (ko) 애플리케이션 프로그램 사용자 인터페이스 자동화 테스트 방법, 전자 기기, 시스템 및 저장 매체
US20100153950A1 (en) Policy management to initiate an automated action on a desktop source
Krintz et al. Cloud platform support for api governance

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17918757

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17918757

Country of ref document: EP

Kind code of ref document: A1

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC , EPO FORM 1205A DATED 04.08.2020.

122 Ep: pct application non-entry in european phase

Ref document number: 17918757

Country of ref document: EP

Kind code of ref document: A1