CN111126930A - Node data processing method and device, computer equipment and storage medium - Google Patents
Node data processing method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN111126930A CN111126930A CN201910968320.9A CN201910968320A CN111126930A CN 111126930 A CN111126930 A CN 111126930A CN 201910968320 A CN201910968320 A CN 201910968320A CN 111126930 A CN111126930 A CN 111126930A
- Authority
- CN
- China
- Prior art keywords
- node
- chain
- data
- nodes
- relief
- 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.)
- Granted
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 18
- 238000000034 method Methods 0.000 claims abstract description 54
- 238000012545 processing Methods 0.000 claims description 70
- 238000004590 computer program Methods 0.000 claims description 12
- 238000012544 monitoring process Methods 0.000 claims description 9
- 230000000977 initiatory effect Effects 0.000 claims description 6
- 238000004891 communication Methods 0.000 claims description 4
- 238000011156 evaluation Methods 0.000 claims description 4
- 230000004913 activation Effects 0.000 claims 1
- 210000000988 bone and bone Anatomy 0.000 description 6
- 230000001960 triggered effect Effects 0.000 description 4
- 238000004458 analytical method Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000003384 imaging method Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
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
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Human Resources & Organizations (AREA)
- General Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Marketing (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Physics & Mathematics (AREA)
- Finance (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Technology Law (AREA)
- Data Mining & Analysis (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a node data processing method, a device, computer equipment and a storage medium, wherein rejected data of rejected nodes are used as accessories for a node chain used for saving the approval process of the corresponding rejected nodes, so that a saving chain for the approval of rejected examination is formed. The node chain is applied to the mobile terminal, the mobile terminal can automatically call the node chain corresponding to the refute node, the refute reason is used as an accessory and attached to the node chain, an agent does not need to initiate an approval process again, the agent or a user does not need to modify various data in the approval process, the operation complexity of the agent or the user is reduced, and the working efficiency is improved.
Description
Technical Field
The present application relates to the field of data processing, and in particular, to a node data processing method, apparatus, computer device, and storage medium.
Background
The mobile order issuing means that the mobile terminal such as a mobile phone completes the issuing of insurance such as quotation and insurance check.
In the process of moving out the order, due to the existence of the underwriting rule or other restrictions, the situation that the quoted price of the insurance agent is not passed or the related information underwriting of the applicant and the like is not passed occurs. The current processing mode is to interrupt the quotation insurance process, and the insurance agent or the subscriber line goes down to modify the limited corresponding information, so that the quotation or the underwriting can pass.
Aiming at the aspect of users, the limited corresponding information is modified offline, the process is complex, and the loss of the users is easily caused.
For the insurance agent, the process is troublesome in terms of modification of the commission charge or discount, and the work efficiency of the insurance agent is low.
Disclosure of Invention
The application mainly aims to provide a node data processing method, a node data processing device, a computer device and a storage medium, and aims to solve the problem that a process of modifying node data by a user or an agent is complex.
In order to achieve the above object, the present application provides a node data processing method applied to a mobile terminal, including:
receiving a starting command of a preset node chain, wherein the node chain comprises a plurality of nodes for data processing according to a preset execution sequence;
obtaining overlap data corresponding to overlap nodes in an associated node chain associated with the node chain, wherein the overlap nodes are nodes which do not normally enter a next node when data processing is carried out on the nodes in the associated node chain;
adding the refund data as an attachment to the chain of nodes;
and processing data of each node on the node chain with the refund data according to the preset execution sequence.
Further, before the step of receiving a preset node chain start command, the method includes:
monitoring processing data of the current associated node in the associated node chain;
judging whether the associated node is the refute node or not according to the processing data;
and if the associated node is the refute node, generating the starting command.
Further, the step of generating the start command if the associated node is the rejected node includes:
if the associated node is the refute node, judging whether an associated node chain where the refute node is located is a preset relief chain with a possibility of communication;
and if the associated node chain is a preset relief chain with a possibility of traffic, generating the starting command.
Further, the step of generating the start command if the associated node chain is a preset relief chain with a possibility of wildcard includes:
acquiring the data information of a user who initiates the relief chain;
calling a judgment rule corresponding to the relief chain, and judging whether the data information meets the requirement of initiating a relief program by using the judgment rule;
and if the relief program is satisfied, generating the starting command.
Further, the step of acquiring reject data corresponding to a reject node associated with the chain of nodes comprises:
obtaining refuting processing data generated by a refuting node, and performing screenshot on an interface where the refuting node is located to obtain a refuting screenshot;
and integrating the rejection processing data and the rejection screenshot into a preset template to form the rejection data.
Further, the step of processing data of each node on the node chain with the reject data according to the preset execution sequence includes:
obtaining an approval result of a current node of the node chain;
and if the evaluation result passes, calling an email system and/or a short message system to notify an approver of the next node of the current node.
The present application further provides a node data processing apparatus, which is applied to a mobile terminal, and includes:
the node chain comprises a receiving unit and a processing unit, wherein the receiving unit is used for receiving a starting command of a preset node chain, and the node chain comprises a plurality of nodes for processing data according to a preset execution sequence;
an obtaining unit, configured to obtain reject data corresponding to a reject node in an associated node chain associated with the node chain, where the reject node is a node that does not normally enter a next node when data processing is performed on a node in the associated node chain;
an adding unit configured to add the reject data as an attachment to the node chain;
and the execution unit is used for carrying out data processing on each node on the node chain with the refund data according to the preset execution sequence.
Further, the node data processing apparatus further includes:
the monitoring unit is used for monitoring the processing data of the current associated node in the associated node chain;
a judging unit, configured to judge whether the associated node is the rejected node according to the processing data;
and the generating unit is used for generating the starting command if the associated node is the refute node.
The present application also includes a computer device comprising a memory storing a computer program and a processor implementing the steps of any of the above methods when the processor executes the computer program.
The present application also provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, carries out the steps of the method of any of the above.
According to the node data processing method, the device, the computer equipment and the storage medium, the refund data of the refund node can be used as an accessory for a node chain used for saving the approval process of the corresponding refund node, and a saving chain for approving the refuted refund is formed. The node chain is applied to the mobile terminal, the mobile terminal can automatically call the node chain corresponding to the refute node, the refute reason is used as an accessory and attached to the node chain, an agent does not need to initiate an approval process again, the agent or a user does not need to modify various data in the approval process, the operation complexity of the agent or the user is reduced, and the working efficiency is improved.
Drawings
Fig. 1 is a schematic flowchart of a node data processing method according to an embodiment of the present application;
fig. 2 is a schematic block diagram of a node data processing apparatus according to an embodiment of the present application;
fig. 3 is a block diagram illustrating a structure of a computer device according to an embodiment of the present application.
The implementation, functional features and advantages of the objectives of the present application will be further explained with reference to the accompanying drawings.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application 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 present application and are not intended to limit the present application.
Referring to fig. 1, a node data processing method applied to a mobile terminal includes the following steps:
s1, receiving a preset starting command of a node chain, wherein the node chain comprises a plurality of nodes for data processing according to a preset execution sequence;
s2, obtaining overlap data corresponding to overlap nodes in the associated node chain associated with the node chain, wherein the overlap nodes are nodes which do not normally enter the next node when the data processing is carried out on the nodes in the associated node chain;
s3, adding the refund data into the node chain as an accessory;
and S4, processing data of each node on the node chain with the refund data according to the preset execution sequence.
As described in step S1, the node chain includes a plurality of nodes, and different nodes have different data processing procedures. For example, the node chain is an approval chain for moving out of the list, and the processing process of each node on approval data may be different, specifically, when approving the quotation, the data processing process is to determine whether the quotation is greater than a preset maximum quotation, determine whether the quotation is less than a preset minimum quotation, and the like; when the user information is approved, reading specified information in the user information, such as age and the like, then comparing the read specified information with preset standard information and the like, and then judging whether the approval chain carries out data processing of the next node or not according to a comparison processing result; in another embodiment, the data processing process may also be directly and visually presenting the examination and approval contents, and then receiving the examination and approval result input by the administrator of the corresponding examination and approval node, and the like. The start command may be a start command received from a user, or a start command triggered by an event. Such as a start command triggered when another chain of approval associated with the chain of nodes terminates abnormally, etc.
As described in the step S2, when the above-mentioned rejected node is generated, a corresponding rejected data is inevitably generated, for example, the chain of the related nodes is a conventional single-chain for moving out, when the offer of the offer node is higher than the preset maximum value, the conventional process of moving out the sheet is ended at the offer node, and the next node of the conventional sheet will not be entered, where the offer node is the above-mentioned rejected node, and correspondingly, data such as reason analysis for ending the conventional sheet for moving out is generated, which is the above-mentioned rejected data.
As described in step S3, the node chain is present for solving the event corresponding to the rejected node, and is used to save the continuation of the event corresponding to the rejected node. Then, in order to continue the event corresponding to the rejection node, the approval node must attach the rejection data so as to save the continuation of the event corresponding to the rejection node.
As described in step S4, the chain of nodes can be regarded as a special chain of approval process for relieving the process that the chain of nodes is terminated in accordance with the approval request. Since the node chain for relief needs to be started, there is a reason for being relieved, and some nodes in the node chain need to use the above-mentioned refund data as a reference factor to determine whether relief can be performed or not, and the like. For example, when the rejectional data is an age exceeding a preset maximum age X (X is a positive integer), the bone age of the user is read, the difference between the bone age and the maximum age is calculated, and when the bone age is smaller than the maximum age Y (Y is a positive integer) and Y-X is 0 or larger, it is determined that the relief requirement is satisfied.
In an embodiment, before the step S1 of receiving the preset node chain start command, the method includes:
s101, monitoring processing data of a current associated node in the associated node chain;
s102, judging whether the associated node is the refute node or not according to the processing data;
s103, if the associated node is the refute node, generating the starting command.
As described in step S101, the related node in the related node chain may be a node on any chain, for example, an approval node, the related node may be any node on the approval chain, and the processing data may be passage, refund, remark, refund reason, etc., where the refund reason, etc., form the refund data, and the passage and remark, etc., form the passage data, etc.
As described in steps S102 and S103, if the approval process does not enter the next node of the approval chain, the relevant node may be determined to be a reject node. Alternatively, whether or not a designation signal corresponding to a reject is generated is directly read, and if so, the associated node may be determined to be a reject node. Since the reject node is generated, the steps of the above steps S1-S4 are required to be proceeded to, so that a preset node chain start command corresponding to the chain where the reject node is located is generated to proceed to the above step S1, that is, the node chains have a plurality of types, and different associated node chains correspond to different node chains.
In an embodiment, the step S103 of generating the start command if the associated node is the rejected node includes:
s1031, if the associated node is the refute node, judging whether the chain of the associated node where the refute node is located is a preset relief chain with a possibility of communication;
s1032, if the chain of the associated node is a preset relief chain with a possibility of traffic, generating the starting command.
In this embodiment, the relief chain is a chain in which a corresponding relief program exists when one of the nodes is a refuge node. For example, the relief chain is a car insurance approval chain, when the car insurance amount filled in the money approval node is smaller than the preset minimum amount, the money approval node is necessarily rejected, and at this time, if the car insurance approval chain belongs to the relief chain, the start command is generated. In one embodiment, each relief chain has a corresponding relief code identifier, and when the chain with the refund node is read to have the relief code identifier, the chain can be determined to be the relief chain.
In an embodiment, the step S1032 of generating the start command if the chain of the associated node is a preset relief chain with a possibility of yielding includes:
s10321, obtaining the data information of the user who initiates the relief chain;
s10322, calling a judgment rule corresponding to the relief chain, and judging whether the data information meets the requirement of initiating a relief program by using the judgment rule;
s10323, if the relief program is satisfied, generating the starting command.
In this embodiment, even if the chain of the related node where the refuge node is located is a relief chain, the start command is not directly generated, but it is determined whether or not the user who initiated the relief chain qualifies to initiate the relief program. Different relief chains have different judgment rules. For example, the data information includes the name, work, income, credit, age, hospitalization record, etc. of the user, if the relief chain is an approval chain for purchasing medical insurance, the judgment rule can be based on the age and hospitalization record; if the relief chain is the approval chain for credit loan, the judgment rule can be based on the work, income, credit value, etc.
In one embodiment, the step S2 of acquiring reject data corresponding to the reject node associated with the node chain includes:
s21, obtaining overlap processing data generated by overlap nodes, and performing screenshot on an interface where the overlap nodes are located to obtain overlap screenshots;
and S22, integrating the reject processing data and the reject screenshot into a preset template to form the reject data.
In this embodiment, the reject processing data generally includes examination and approval opinions manually input by the user during node examination and approval, automatically generated reject reasons, user certificate information, and the like; the rejection screenshot refers to a screenshot of an interface where the rejection node is located. The approval opinions and the reject screenshots are used as reject data together, so that a person who approves the node chain can know the reason why the node chain is started more clearly, and whether the node chain passes through the corresponding node or not is determined. The template refers to a template into which characters and pictures can be inserted, for example, characters are doped in the upper part of the template, pictures are doped in the lower part of the template, and the like. The rejected data are templated, so that the rejected data are conveniently used as accessories and checked by a user. In this embodiment, the above-mentioned rejected screenshot is typically uploaded to an IM (Instant Messaging) imaging system and associated with the ID of the relief chain.
In one embodiment, the step S4 of performing data processing on each node on the node chain with the reject data according to the preset execution order includes:
s41, obtaining the approval result of the current node of the node chain;
and S42, if the evaluation result passes, calling an email system and/or a short message system to notify an approver of the next node of the current node.
In this embodiment, if the node passes the approval, the mailbox, the sms number, and other messages corresponding to the next node are called to remind the node, so that the approver of the next node can timely process the approval work. In other real-time situations, when the approval state changes, the system notifies the APP mobile terminal (the terminal initiating the node chain) in an MQ message manner, and the mobile terminal can acquire the latest approval state and the like.
In other embodiments, the background may create an approval record save when the chain of nodes is started.
In the node data processing method according to the embodiment of the application, the refute data of the refute node is used as an accessory for a node chain used for saving the approval process of the corresponding refute node, so that a saving chain for approval of refute is formed. And the node chain is applied to the mobile terminal, the mobile terminal can automatically call the node chain corresponding to the refute node, the refute reason is taken as an accessory to be attached to the node chain, an agent is not needed to initiate an approval process again, the agent is not needed to modify various data in the approval process, and the like, and the working efficiency is improved.
Referring to fig. 2, an embodiment of the present application further provides a node data processing apparatus, which is applied to a mobile terminal, and includes:
a receiving unit 10, configured to receive a start command of a preset node chain, where the node chain includes a plurality of nodes that perform data processing according to a preset execution sequence;
an obtaining unit 20, configured to obtain reject data corresponding to a reject node in an associated node chain associated with the node chain, where the reject node is a node that does not normally enter a next node when data processing is performed on a node in the associated node chain;
an adding unit 30 for adding the refund data as an accessory to the node chain;
and the execution unit 40 is configured to perform data processing on each node on the node chain with the refund data according to the preset execution sequence.
In this embodiment, the node chain includes a plurality of nodes, and different nodes have different data processing processes. For example, the node chain is an approval chain for moving out of the list, and the processing process of each node on approval data may be different, specifically, when approving the quotation, the data processing process is to determine whether the quotation is greater than a preset maximum quotation, determine whether the quotation is less than a preset minimum quotation, and the like; when the user information is approved, reading specified information in the user information, such as age and the like, then comparing the read specified information with preset standard information and the like, and then judging whether the approval chain carries out data processing of the next node or not according to a comparison processing result; in another embodiment, the data processing process may also be directly and visually presenting the examination and approval contents, and then receiving the examination and approval result input by the administrator of the corresponding examination and approval node, and the like. The start command may be a start command received from a user, or a start command triggered by an event. Such as a start command triggered when another chain of approval associated with the chain of nodes terminates abnormally, etc. When the refute node is generated, corresponding refute data is necessarily generated, for example, the associated node chain is a conventional single moving-out chain, when the quotation of the quotation node is higher than a preset maximum value, the conventional single moving-out process is ended at the quotation node, the node cannot enter the next node of the conventional single moving-out, the quotation node is the refute node at the moment, correspondingly, data such as reason analysis for ending the conventional single moving-out process is generated, and the data is the refute data. The node chain is actually present for solving the event corresponding to the refute node, and is used for saving the continuation of the event corresponding to the refute node. Then, in order to continue the event corresponding to the rejection node, the approval node must attach the rejection data so as to save the continuation of the event corresponding to the rejection node. The chain of nodes can be regarded as a special chain of approval processes for relieving the process that the chain of nodes is terminated in accordance with the corresponding requirements of the approval. Since the node chain for relief needs to be started, there is a reason for being relieved, and some nodes in the node chain need to use the above-mentioned refund data as a reference factor to determine whether relief can be performed or not, and the like. For example, when the rejectional data is an age exceeding a preset maximum age X (X is a positive integer), the bone age of the user is read, the difference between the bone age and the maximum age is calculated, and when the bone age is smaller than the maximum age Y (Y is a positive integer) and Y-X is 0 or larger, it is determined that the relief requirement is satisfied.
In one embodiment, the node data processing apparatus further includes:
the monitoring unit is used for monitoring the processing data of the current associated node in the associated node chain;
a judging unit, configured to judge whether the associated node is the rejected node according to the processing data;
and the generating unit is used for generating the starting command if the associated node is the refute node.
In this embodiment, the related node in the related node chain may be a node on any chain, for example, an approval node, the related node may be any node on the approval chain, and the processing data may be passage data, refund data, remarks, refund reason, and the like, where the refund reason, and the like form the refund data, and the passage data, the remarks, and the like form the passage data. If the approval process does not enter the next node of the approval chain, the related node can be judged as a reject node. Alternatively, whether or not a designation signal corresponding to a reject is generated is directly read, and if so, the associated node may be determined to be a reject node. Since the rejected node is generated, the receiving unit 10, the obtaining unit 20, the adding unit 30 and the executing unit 40 need to be operated to complete the relief process, so that a start command of a corresponding preset node chain of a chain where the rejected node is located is generated, the node chain has a plurality of types, and different associated node chains correspond to different node chains.
In one embodiment, the generating unit includes:
the judging module is used for judging whether the chain of the associated node where the refuting node is located is a preset relief chain with the possibility of communication if the associated node is the refuting node;
and the generation module is used for generating the starting command if the associated node chain is a preset relief chain with a possibility of traffic.
In this embodiment, the relief chain is a chain in which a corresponding relief program exists when one of the nodes is a refuge node. For example, the relief chain is a car insurance approval chain, when the car insurance amount filled in the money approval node is smaller than the preset minimum amount, the money approval node is necessarily rejected, and at this time, if the car insurance approval chain belongs to the relief chain, the start command is generated. In one embodiment, each relief chain has a corresponding relief code identifier, and when the chain with the refund node is read to have the relief code identifier, the chain can be determined to be the relief chain.
Further, the generating module includes:
the obtaining submodule is used for obtaining the data information of a user who initiates the relief chain;
the calling judgment submodule is used for calling a judgment rule corresponding to the relief chain and judging whether the data information meets the requirement of initiating a relief program or not by utilizing the judgment rule;
and the generation submodule is used for generating the starting command if the relief program is met.
In this embodiment, even if the chain of the related node where the refuge node is located is a relief chain, the start command is not directly generated, but it is determined whether or not the user who initiated the relief chain qualifies to initiate the relief program. Different relief chains have different judgment rules. For example, the data information includes the name, work, income, credit, age, hospitalization record, etc. of the user, if the relief chain is an approval chain for purchasing medical insurance, the judgment rule can be based on the age and hospitalization record; if the relief chain is the approval chain for credit loan, the judgment rule can be based on the work, income, credit value, etc.
In one embodiment, the obtaining unit 20 includes:
the acquisition module is used for acquiring the refund processing data generated by the refund node and carrying out screenshot on an interface where the refund node is located to obtain a refund screenshot;
and the synthesis module is used for integrating the refuting processing data and the refuting screenshot into a preset template to form the refuting data.
In this embodiment, the reject processing data generally includes examination and approval opinions manually input by the user during node examination and approval, automatically generated reject reasons, user certificate information, and the like; the rejection screenshot refers to a screenshot of an interface where the rejection node is located. The approval opinions and the reject screenshots are used as reject data together, so that a person who approves the node chain can know the reason why the node chain is started more clearly, and whether the node chain passes through the corresponding node or not is determined. The template refers to a template into which characters and pictures can be inserted, for example, characters are doped in the upper part of the template, pictures are doped in the lower part of the template, and the like. The rejected data are templated, so that the rejected data are conveniently used as accessories and checked by a user. In this embodiment, the above-mentioned rejected shots are typically uploaded to the IM imaging system and associated with the ID of the relief chain.
In an embodiment, the execution unit 40 includes:
the execution acquisition module is used for acquiring the approval result of the current node of the node chain by a user;
and calling a notification module, and if the user passes the evaluation result, calling an email system and/or a short message system to notify an approver of the next node of the current node.
In this embodiment, if the node passes the approval, the mailbox, the sms number, and other messages corresponding to the next node are called to remind the node, so that the approver of the next node can timely process the approval work. In other real-time situations, when the approval state changes, the system notifies the APP mobile terminal (the terminal initiating the node chain) in an MQ message manner, and the mobile terminal can acquire the latest approval state and the like.
In other embodiments, the background may create an approval record save when the chain of nodes is started.
The node data processing device of the embodiment of the application can use the refute data of the refute node as an accessory for a node chain used for saving the approval process of the corresponding refute node, so as to form a saving chain for the approval of the refute node. And the node chain is applied to the mobile terminal, the mobile terminal can automatically call the node chain corresponding to the refute node, the refute reason is taken as an accessory to be attached to the node chain, an agent is not needed to initiate an approval process again, the agent is not needed to modify various data in the approval process, and the like, and the working efficiency is improved.
Referring to fig. 3, a computer device, which may be a server and whose internal structure may be as shown in fig. 3, is also provided in the embodiment of the present application. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the computer designed processor is used to provide computational and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database of the computer device is used for data such as running programs of chains of all preset nodes. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement the node data processing method described in any of the above embodiments.
The embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the node data processing method described in any of the above embodiments.
It will be understood by those skilled in the art that all or part of the processes of the methods of the above embodiments may be implemented by hardware associated with instructions of a computer program, which may be stored on a non-volatile computer-readable storage medium, and when executed, may include processes of the above embodiments of the methods. Any reference to memory, storage, database, or other medium provided herein and used in the examples may include non-volatile and/or volatile memory. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), double-rate SDRAM (SSRSDRAM), Enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, apparatus, article, or method that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, apparatus, article, or method. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, apparatus, article, or method that includes the element.
The above description is only a preferred embodiment of the present application, and not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings of the present application, or which are directly or indirectly applied to other related technical fields, are also included in the scope of the present application.
Claims (10)
1. A node data processing method is applied to a mobile terminal, and is characterized by comprising the following steps:
receiving a starting command of a preset node chain, wherein the node chain comprises a plurality of nodes for data processing according to a preset execution sequence;
obtaining overlap data corresponding to overlap nodes in an associated node chain associated with the node chain, wherein the overlap nodes are nodes which do not normally enter a next node when data processing is carried out on the nodes in the associated node chain;
adding the refund data as an attachment to the chain of nodes;
and processing data of each node on the node chain with the refund data according to the preset execution sequence.
2. The node data processing method according to claim 1, wherein the step of receiving a preset node chain start command is preceded by:
monitoring processing data of the current associated node in the associated node chain;
judging whether the associated node is the refute node or not according to the processing data;
and if the associated node is the refute node, generating the starting command.
3. The node data processing method according to claim 2, wherein the step of generating the activation command if the associated node is the rejected node comprises:
if the associated node is the refute node, judging whether an associated node chain where the refute node is located is a preset relief chain with a possibility of communication;
and if the associated node chain is a preset relief chain with a possibility of traffic, generating the starting command.
4. The node data processing method according to claim 3, wherein the step of generating the start command if the associated node chain is a predetermined relief chain with a possibility of wildcard comprises:
acquiring the data information of a user who initiates the relief chain;
calling a judgment rule corresponding to the relief chain, and judging whether the data information meets the requirement of initiating a relief program by using the judgment rule;
and if the relief program is satisfied, generating the starting command.
5. The node data processing method according to claim 1, wherein the step of acquiring reject data corresponding to a reject node associated with the chain of nodes comprises:
obtaining refuting processing data generated by a refuting node, and performing screenshot on an interface where the refuting node is located to obtain a refuting screenshot;
and integrating the rejection processing data and the rejection screenshot into a preset template to form the rejection data.
6. The node data processing method according to claim 1, wherein the step of processing data for each node on the chain of nodes with the reject data according to the preset execution order includes:
obtaining an approval result of a current node of the node chain;
and if the evaluation result passes, calling an email system and/or a short message system to notify an approver of the next node of the current node.
7. A node data processing device applied to a mobile terminal is characterized by comprising:
the node chain comprises a receiving unit and a processing unit, wherein the receiving unit is used for receiving a starting command of a preset node chain, and the node chain comprises a plurality of nodes for processing data according to a preset execution sequence;
an obtaining unit, configured to obtain reject data corresponding to a reject node in an associated node chain associated with the node chain, where the reject node is a node that does not normally enter a next node when data processing is performed on a node in the associated node chain;
an adding unit configured to add the reject data as an attachment to the node chain;
and the execution unit is used for carrying out data processing on each node on the node chain with the refund data according to the preset execution sequence.
8. The node data processing apparatus according to claim 7, further comprising:
the monitoring unit is used for monitoring the processing data of the current associated node in the associated node chain;
a judging unit, configured to judge whether the associated node is the rejected node according to the processing data;
and the generating unit is used for generating the starting command if the associated node is the refute node.
9. A computer device comprising a memory and a processor, the memory storing a computer program, wherein the processor implements the steps of the method of any one of claims 1 to 6 when executing the computer program.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910968320.9A CN111126930B (en) | 2019-10-12 | 2019-10-12 | Node data processing method, device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910968320.9A CN111126930B (en) | 2019-10-12 | 2019-10-12 | Node data processing method, device, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111126930A true CN111126930A (en) | 2020-05-08 |
| CN111126930B CN111126930B (en) | 2024-04-09 |
Family
ID=70495297
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910968320.9A Active CN111126930B (en) | 2019-10-12 | 2019-10-12 | Node data processing method, device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111126930B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111882293A (en) * | 2020-07-06 | 2020-11-03 | 珠海格力电器股份有限公司 | Application software checking method and device, computer equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007105512A1 (en) * | 2006-03-10 | 2007-09-20 | Matsushita Electric Industrial Co., Ltd. | Forwarded data managing system |
| JP2013084114A (en) * | 2011-10-07 | 2013-05-09 | Fujitsu Ltd | Information processing program, information processing device, and information processing method |
| CN103365528A (en) * | 2012-04-02 | 2013-10-23 | 鸿富锦精密工业（深圳）有限公司 | Patent rejection process display system and method |
| CN106651112A (en) * | 2016-11-01 | 2017-05-10 | 金蝶软件（中国）有限公司 | Method and system for reverse approval of workflow |
| WO2018224024A1 (en) * | 2017-06-08 | 2018-12-13 | 成都牵牛草信息技术有限公司 | Efficient approval method for workflow approval node |
| CN109784859A (en) * | 2019-01-17 | 2019-05-21 | 四川驹马科技有限公司 | A kind of work process flow configuration method without configuring rejection node |
-
2019
- 2019-10-12 CN CN201910968320.9A patent/CN111126930B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007105512A1 (en) * | 2006-03-10 | 2007-09-20 | Matsushita Electric Industrial Co., Ltd. | Forwarded data managing system |
| JP2013084114A (en) * | 2011-10-07 | 2013-05-09 | Fujitsu Ltd | Information processing program, information processing device, and information processing method |
| CN103365528A (en) * | 2012-04-02 | 2013-10-23 | 鸿富锦精密工业（深圳）有限公司 | Patent rejection process display system and method |
| CN106651112A (en) * | 2016-11-01 | 2017-05-10 | 金蝶软件（中国）有限公司 | Method and system for reverse approval of workflow |
| WO2018224024A1 (en) * | 2017-06-08 | 2018-12-13 | 成都牵牛草信息技术有限公司 | Efficient approval method for workflow approval node |
| CN109784859A (en) * | 2019-01-17 | 2019-05-21 | 四川驹马科技有限公司 | A kind of work process flow configuration method without configuring rejection node |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111882293A (en) * | 2020-07-06 | 2020-11-03 | 珠海格力电器股份有限公司 | Application software checking method and device, computer equipment and storage medium |
| CN111882293B (en) * | 2020-07-06 | 2024-06-07 | 珠海格力电器股份有限公司 | Application software signing and checking method and device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111126930B (en) | 2024-04-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109636317B (en) | Service control method, device, system and storage medium | |
| CN108416485B (en) | User identity recognition method, electronic device and computer readable storage medium | |
| CN110489415B (en) | Data updating method and related equipment | |
| CN109816399A (en) | Complain management method, device, computer equipment and the storage medium of part | |
| CN109726987B (en) | Event reporting method, device, equipment and computer readable storage medium | |
| CN111243596A (en) | Insurance information acquisition method, device and equipment based on voice recognition and storage medium | |
| CN108765175A (en) | Declaration form saves information processing method, device, computer equipment and storage medium from damage | |
| CN112163945B (en) | ETC binding method, terminal equipment and readable storage medium | |
| CN109034603B (en) | Business process execution method, device and computer readable storage medium | |
| CN111126930A (en) | Node data processing method and device, computer equipment and storage medium | |
| CN110083782B (en) | Electronic policy checking method and device, computer equipment and storage medium | |
| CN111027954A (en) | Travel fee deduction method and device based on ETC system, computer equipment and medium | |
| CN114240524A (en) | Platform-based unified billing method and system, computer equipment and storage medium | |
| CN108038667B (en) | Policy generation method, device and equipment | |
| CN113947368A (en) | Contract early warning method, contract early warning equipment and computer readable storage medium | |
| CN113794999A (en) | Short message distribution method, device and storage medium | |
| CN111369354A (en) | Data monitoring method and device for block chain application and storage medium | |
| CN111340635A (en) | Data checking method, equipment, server and readable storage medium | |
| CN110166530B (en) | Processing method based on micro-service return value, electronic device and computer equipment | |
| CN106408425A (en) | Social information cautioning method, apparatus and cautioning server | |
| CN110992116A (en) | Electronic invoice generation method, device, equipment and storage medium based on ETC system | |
| CN110544087A (en) | Mobile payment method, device, equipment and computer readable storage medium | |
| CN109801149A (en) | The method for creating tax return, device, storage medium and electronic equipment | |
| CN115146270A (en) | Privacy monitoring method, device, equipment and medium based on code development | |
| CN115130577A (en) | Method and device for identifying fraudulent number and electronic equipment |
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 |