CN111126930B - Node data processing method, device, computer equipment and storage medium - Google Patents
Node data processing method, device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN111126930B CN111126930B CN201910968320.9A CN201910968320A CN111126930B CN 111126930 B CN111126930 B CN 111126930B CN 201910968320 A CN201910968320 A CN 201910968320A CN 111126930 B CN111126930 B CN 111126930B
- Authority
- CN
- China
- Prior art keywords
- node
- reject
- chain
- data
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 17
- 238000000034 method Methods 0.000 claims abstract description 51
- 238000012545 processing Methods 0.000 claims description 66
- 238000004590 computer program Methods 0.000 claims description 12
- 230000004927 fusion Effects 0.000 claims description 11
- 230000000977 initiatory effect Effects 0.000 claims description 10
- 238000012544 monitoring process Methods 0.000 claims description 9
- 210000000988 bone and bone Anatomy 0.000 description 6
- 230000001960 triggered effect Effects 0.000 description 4
- 238000011156 evaluation Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000003384 imaging method Methods 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
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)
- Accounting & Taxation (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Marketing (AREA)
- Finance (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Data Mining & Analysis (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Technology Law (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 reject data of reject nodes are used as accessories and used for node chains for rescuing approval processes corresponding to the reject nodes, so that a rescuing chain for rejected approval is formed. The node chain is applied to the mobile terminal, the mobile terminal can automatically call the node chain corresponding to the reject node, and the reject reason is attached to the node chain as an accessory, so that an agent is not required to initiate an approval process again, various data in the approval process are not required to be modified by the agent or a user, the operation complexity of the agent or the user is reduced, and the working efficiency is improved.
Description
Technical Field
The present invention 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 bill issuing means that quotation, check and other insurance are completed through mobile terminals such as mobile phones.
In the process of mobile bill delivery, due to the existence of a check-out rule or other restrictions, the situation that the quotation of an insurance agent does not pass or the check-out of relevant information such as an applicant does not pass occurs. The current processing method is to interrupt the bid application flow, and the insurance agent or the user line goes down to modify the limited corresponding information so that the bid or the insurance 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 easy to cause.
Aiming at the aspects of insurance agents, the process is troublesome in terms of modification of commission or discount, and the working efficiency of the insurance agents is low.
Disclosure of Invention
The main purpose of the application is to provide a node data processing method, a device, a computer device and a storage medium, which aim to solve the problem that a user or an agent modifies a node data process.
In order to achieve the above object, the present application proposes a node data processing method, applied to a mobile terminal, including:
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;
acquiring reject data corresponding to reject nodes in an associated node chain associated with the node chain, wherein the reject nodes are nodes which do not normally enter the next node when the nodes in the associated node chain perform data processing;
adding the reject data as an attachment to the node chain;
and according to the preset execution sequence, carrying out data processing on each node on the node chain with the reject data.
Further, before the step of receiving the 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 reject node according to the processing data;
and if the associated node is the reject node, generating the starting command.
Further, the step of generating the start command if the associated node is the reject node includes:
if the associated node is the reject node, judging whether an associated node chain where the reject node is located is a preset relief chain with fusion possibility;
and if the associated node chain is a preset relief chain with fusion possibility, generating the starting command.
Further, the step of generating the start command if the associated node chain is a preset relief chain with a fusion possibility includes:
acquiring information of a user initiating the relief chain;
invoking a judging rule corresponding to the relief chain, and judging whether the data information meets the requirement of initiating a relief program by utilizing the judging rule;
and if the relief program is satisfied, generating the start command.
Further, the step of acquiring reject data corresponding to reject nodes associated with the node chain includes:
obtaining reject processing data generated by reject nodes, and capturing a screen of an interface where the reject nodes are located to obtain reject screen;
integrating the reject processing data and the reject screenshot into a preset template to form the reject data.
Further, the step of performing data processing on each node on the node chain with the rejected 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 a mail system and/or a short message system to inform an approver of a next node of the current node.
The application also provides a node data processing device, which is applied to a mobile terminal and comprises:
the device comprises a receiving unit, a processing unit and a processing unit, wherein the receiving unit is used for receiving a preset starting command of a node chain, and the node chain comprises a plurality of nodes for data processing according to a preset execution sequence;
the acquiring unit is used for acquiring reject data corresponding to reject nodes in the associated node chain associated with the node chain, wherein the reject nodes are nodes which do not normally enter the next node when the nodes in the associated node chain perform data processing;
an adding unit for adding 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 reject data according to the preset execution sequence.
Further, the node data processing device further includes:
the monitoring unit is used for monitoring the processing data of the current associated node in the associated node chain;
the judging unit is used for judging whether the associated node is the reject node according to the processing data;
and the generation unit is used for generating the starting command if the associated node is the reject 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 methods described above when the computer program is executed by the processor.
The present application also provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method of any of the above.
The node data processing method, the device, the computer equipment and the storage medium can take the reject data of the reject node as an accessory, and are used for using the node chain for carrying out relief on the approval process of the corresponding reject node, so as to form a relief chain for the rejected approval. The node chain is applied to the mobile terminal, the mobile terminal can automatically call the node chain corresponding to the reject node, and the reject reason is attached to the node chain as an accessory, so that an agent is not required to initiate an approval process again, various data in the approval process are not required to be modified by the agent or a user, the operation complexity of the agent or the user is reduced, and the working efficiency is improved.
Drawings
FIG. 1 is a flow chart of a node data processing method according to an embodiment of the present application;
FIG. 2 is a block diagram schematically illustrating a structure of a node data processing apparatus according to an embodiment of the present application;
fig. 3 is a block diagram schematically illustrating a structure of a computer device according to an embodiment of the present application.
The realization, functional characteristics and advantages of the present application will be further described with reference to the embodiments, referring to the attached drawings.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only 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 steps of:
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 reject data corresponding to reject nodes in an associated node chain associated with the node chain, wherein the reject nodes are nodes which do not normally enter the next node when the nodes in the associated node chain perform data processing;
s3, adding the reject data into the node chain as an accessory;
and S4, carrying out data processing on each node on the node chain with the reject data according to the preset execution sequence.
As described in the above step S1, the node chain includes a plurality of nodes, and the data processing process is different for different nodes. For example, the node chain is an approval chain of a mobile bill, and each node may have different processing procedures on approval data, specifically, when approving the quotation, the data processing procedures are to judge whether the quotation is greater than a preset maximum quotation, judge whether the quotation is less than a preset minimum quotation, and the like; when the user information is approved, the appointed information in the user information such as age and the like is read, then the read appointed information is compared with the preset standard information and the like, and then whether the approval chain performs the data processing of the next node or not is judged according to the comparison processing result; in another embodiment, the data processing process may also be to directly visually present approval content, then receive approval results input by the administrator of the corresponding approval node, and so on. The start command may be a start command received from a user, or may be a start command triggered by a certain event. Such as a start command triggered when another approval chain associated with the node chain abnormally ends, etc.
As described in step S2, when the above-mentioned reject node is generated, a corresponding reject data is necessarily generated, for example, the related node chain is a conventional mobile single chain, when the offer of the offer node is higher than the preset maximum value, the conventional mobile single process is ended at the offer node, the next node of the conventional mobile single will not be entered, at this time, the offer node is the above-mentioned reject node, and a data such as a reason analysis for ending the conventional mobile single is generated correspondingly, and the data is the above-mentioned reject data.
As described in the above step S3, the node chain is actually present to solve the event corresponding to the rejected node, and is used for rescuing the continuation of the event corresponding to the rejected node. Then, in order to continue the event corresponding to the reject node, the reject data must be added to the approving node, so as to save the continuation of the event corresponding to the reject node.
As described in the above step S4, the node chain may be regarded as a special approval process chain for relieving the process that the associated node chain is terminated due to the occurrence of the corresponding requirement of the approval. Since the node chain for relief is started, the reason for being relieved is that some nodes in the node chain need to use the above-described reject data as a reference factor to determine whether relief or the like is possible. For example, when the reject data is of 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 less than the maximum age Y (Y is a positive integer) and y—x is 0 or more, it is determined that the relief requirement is satisfied.
In one embodiment, before the step S1 of receiving a 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 reject node according to the processing data;
and S103, if the associated node is the reject node, generating the starting command.
As described in the above step S101, the associated node in the associated node chain may be a node on any chain, for example, an approval node, and the associated node may be any node on the approval chain, and the processed data may be pass, reject, remark, reject reason, etc., where the reject data may be formed by reject and reject reason, etc., and pass data may be formed by pass and remark, etc.
As described in the above steps S102 and S103, that is, if the approval process does not enter the next node of the approval chain, it may be determined that the associated node is a reject node. Alternatively, whether or not a designation signal corresponding to the rejection is generated is directly read, and if so, it may be determined that the associated node is the rejection node. Because the step S1-S4 is performed when the reject node is generated, a start command of the corresponding preset node chain of the chain where the reject node is located is generated to enter the step S1, that is, the node chains have multiple types, and different associated node chains correspond to different node chains.
In one embodiment, the step S103 of generating the start command if the associated node is the reject node includes:
s1031, if the associated node is the reject node, judging whether the associated node chain where the reject node is located is a preset relief chain with fusion possibility;
s1032, if the associated node chain is a preset relief chain with fusion possibility, generating the starting command.
In the present embodiment, the relief chain is a chain in which a corresponding relief program exists when any one of the nodes becomes a reject node. For example, the relief chain is a car insurance approval chain, when the car insurance amount filled in the amount approval node is smaller than the preset minimum amount, the amount approval node is necessarily rejected, and at this time, if the car insurance approval chain belongs to the relief chain, the starting command is generated. In one embodiment, each relief chain has a corresponding relief code identifier or the like, and when the chain where the reject node is located is read to have a relief code identifier, the chain can be determined to be a relief chain.
In one embodiment, the step S1032 of generating the start command if the associated node chain is a preset relief chain with a fusion possibility includes:
s10321, acquiring information of a user initiating the relief chain;
s10322, calling a judging rule corresponding to the relief chain, and judging whether the data information meets the requirement of initiating a relief program by utilizing the judging rule;
s10323, if the relief program is satisfied, generating the start command.
In this embodiment, even if the associated node chain in which the reject 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 information includes the name, work, income, credit value, age, hospitalization record, etc. 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 an approval chain of credit, the judgment rule can be based on work, income, credit value and the like.
In one embodiment, the step S2 of obtaining reject data corresponding to a reject node associated with the node chain includes:
s21, obtaining reject processing data generated by reject nodes, and capturing a screen of an interface where the reject nodes are located to obtain reject screen;
s22, integrating the reject processing data and the reject screenshot into a preset template to form the reject data.
In this embodiment, the rejection processing data generally includes approval comments manually input by the user during node approval, automatically generated rejection reasons, certificate information of the user, and the like; the above-mentioned reject screenshot refers to a screenshot of an interface where the reject node is located. The approval opinion and the rejection screenshot are taken as the rejection data, so that a person who approves the node chain can more clearly know the reason that the node chain is started, and whether the approval passes through the corresponding node or not is determined. The template refers to a template into which characters and pictures can be inserted, such as the characters are doped in the working part of the template, the pictures are doped in the lower half part of the template, and the like. The reject data is templated, so that the reject data can be conveniently used as an accessory and checked by a user. In this embodiment, the above-mentioned reject screen is generally 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 sequence includes:
s41, obtaining an approval result of a current node of the node chain;
s42, if the evaluation result passes, the mail system and/or the short message system is/are called to inform the approver of the next node of the current node.
In this embodiment, if the node approves, a mailbox, a short message number, and other messages corresponding to the next node are called to remind, so that an approver of the next node can process the approval in time. In other real-time, when the approval state changes, the system notifies the APP mobile terminal (the terminal initiating the node chain) in a mode of MQ information, and the mobile terminal can acquire the latest approval state and the like.
In other embodiments, when the chain of nodes is started, the background creates an approval record to save.
According to the node data processing method, the reject data of the reject node is used as an accessory, and the node chain for carrying out relief use on the approval process of the corresponding reject node is used, so that a relief chain for the rejected approval is formed. The node chain is applied to the mobile terminal, the mobile terminal can automatically call the node chain corresponding to the reject node, and the reject reason is attached to the node chain as an accessory, so that an agent is not required to initiate an approval process again, various data in the approval process are not required to be modified by the agent, and the working efficiency is improved.
Referring to fig. 2, an embodiment of the present application further provides a node data processing device, which is applied to a mobile terminal, including:
a receiving unit 10, configured to receive a preset start command of a 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 reject nodes in an associated node chain associated with the node chain, where the reject nodes are nodes that do not normally enter a next node when the nodes in the associated node chain perform data processing;
an adding unit 30 for adding the reject data as an attachment to the node chain;
and the execution unit 40 is used for carrying out data processing on each node on the node chain with the reject data according to the preset execution sequence.
In this embodiment, the node chain includes a plurality of nodes, and different nodes process data. For example, the node chain is an approval chain of a mobile bill, and each node may have different processing procedures on approval data, specifically, when approving the quotation, the data processing procedures are to judge whether the quotation is greater than a preset maximum quotation, judge whether the quotation is less than a preset minimum quotation, and the like; when the user information is approved, the appointed information in the user information such as age and the like is read, then the read appointed information is compared with the preset standard information and the like, and then whether the approval chain performs the data processing of the next node or not is judged according to the comparison processing result; in another embodiment, the data processing process may also be to directly visually present approval content, then receive approval results input by the administrator of the corresponding approval node, and so on. The start command may be a start command received from a user, or may be a start command triggered by a certain event. Such as a start command triggered when another approval chain associated with the node chain abnormally ends, etc. When the above-mentioned reject node is generated, a corresponding reject data must be generated, for example, the above-mentioned associated node chain is a conventional mobile single-chain, when the offer of the offer node is higher than the preset maximum value, the conventional mobile bill-out process can be ended at the offer node, the next node of the conventional mobile bill-out can not be entered, at this time, the offer node is the above-mentioned reject node, and correspondingly, a data such as reason analysis for ending the conventional mobile bill-out is generated, and the data is the above-mentioned reject data. The node chain is actually present to solve the event corresponding to the reject node, and is used for saving the continuation of the event corresponding to the reject node. Then, in order to continue the event corresponding to the reject node, the reject data must be added to the approving node, so as to save the continuation of the event corresponding to the reject node. The node chain can be regarded as a special approval process chain for relieving the process that the associated node chain is terminated without corresponding approval requirements. Since the node chain for relief is started, the reason for being relieved is that some nodes in the node chain need to use the above-described reject data as a reference factor to determine whether relief or the like is possible. For example, when the reject data is of 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 less than the maximum age Y (Y is a positive integer) and y—x is 0 or more, 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;
the judging unit is used for judging whether the associated node is the reject node according to the processing data;
and the generation unit is used for generating the starting command if the associated node is the reject node.
In this embodiment, the associated node in the associated node chain may be a node on any chain, and taking an approval node as an example, the associated node may be any node on the approval chain, and the processed data may be pass, reject, remark, reject reason, etc., where the reject and reject reason, etc., may form the reject data, and the pass and remark form the pass data, etc. If the approval process does not enter the next node of the approval chain, the associated node can be judged to be a reject node. Alternatively, whether or not a designation signal corresponding to the rejection is generated is directly read, and if so, it may be determined that the associated node is the rejection node. Because the reject node is generated, the receiving unit 10, the acquiring 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 the chain where the reject node is located is generated, and the node chains have 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 associated node chain where the reject node is located is a preset relief chain with fusion possibility if the associated node is the reject node;
the generation module is used for generating the starting command if the associated node chain is a preset relief chain with fusion possibility.
In the present embodiment, the relief chain is a chain in which a corresponding relief program exists when any one of the nodes becomes a reject node. For example, the relief chain is a car insurance approval chain, when the car insurance amount filled in the amount approval node is smaller than the preset minimum amount, the amount approval node is necessarily rejected, and at this time, if the car insurance approval chain belongs to the relief chain, the starting command is generated. In one embodiment, each relief chain has a corresponding relief code identifier or the like, and when the chain where the reject node is located is read to have a relief code identifier, the chain can be determined to be a relief chain.
Further, the generating module includes:
the acquisition submodule is used for acquiring the data information of the user initiating the relief chain;
the calling judging submodule is used for calling a judging 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 judging rule;
and the generation submodule is used for generating the starting command if the relief program is met.
In this embodiment, even if the associated node chain in which the reject 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 information includes the name, work, income, credit value, age, hospitalization record, etc. 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 an approval chain of credit, the judgment rule can be based on work, income, credit value and the like.
In one embodiment, the acquiring unit 20 includes:
the system comprises an acquisition module, a data storage module and a data storage module, wherein the acquisition module is used for acquiring reject processing data generated by reject nodes and performing screenshot on interfaces where the reject nodes are positioned to obtain reject screenshots;
and the synthesis module is used for integrating the reject processing data and the reject screenshot into a preset template to form the reject data.
In this embodiment, the rejection processing data generally includes approval comments manually input by the user during node approval, automatically generated rejection reasons, certificate information of the user, and the like; the above-mentioned reject screenshot refers to a screenshot of an interface where the reject node is located. The approval opinion and the rejection screenshot are taken as the rejection data, so that a person who approves the node chain can more clearly know the reason that the node chain is started, and whether the approval passes through the corresponding node or not is determined. The template refers to a template into which characters and pictures can be inserted, such as the characters are doped in the working part of the template, the pictures are doped in the lower half part of the template, and the like. The reject data is templated, so that the reject data can be conveniently used as an accessory and checked by a user. In this embodiment, the above-described screen shot is generally uploaded to the IM imaging system and associated with the ID of the relief chain.
In one embodiment, the execution unit 40 includes:
the execution acquisition module is used for acquiring an approval result of a current node of the node chain by a user;
and calling a notification module, wherein if the evaluation result passes, the user calls a mail system and/or a short message system to notify an approver of a next node of the current node.
In this embodiment, if the node approves, a mailbox, a short message number, and other messages corresponding to the next node are called to remind, so that an approver of the next node can process the approval in time. In other real-time, when the approval state changes, the system notifies the APP mobile terminal (the terminal initiating the node chain) in a mode of MQ information, and the mobile terminal can acquire the latest approval state and the like.
In other embodiments, when the chain of nodes is started, the background creates an approval record to save.
According to the node data processing device, the reject data of the reject node can be used as an accessory, and the node chain for carrying out relief on the approval process of the corresponding reject node is used, so that a relief chain for the approval of the rejected node is formed. The node chain is applied to the mobile terminal, the mobile terminal can automatically call the node chain corresponding to the reject node, and the reject reason is attached to the node chain as an accessory, so that an agent is not required to initiate an approval process again, various data in the approval process are not required to be modified by the agent, and the working efficiency is improved.
Referring to fig. 3, a computer device is further provided in the embodiment of the present application, where the computer device may be a server, and the internal structure of the computer device may be as shown in fig. 3. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the computer is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, computer programs, and a database. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The database of the computer equipment is used for data such as running programs of each preset node chain. The network interface of the computer device is used for communicating with an external terminal through a network connection. Which when executed by a processor, is adapted to carry out the node data processing method as described in any of the embodiments above.
An embodiment of the present application further provides a computer readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement the node data processing method described in any one of the foregoing embodiments.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by hardware associated with a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium provided herein and used in embodiments may include non-volatile and/or volatile memory. The nonvolatile 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), dual speed data rate SDRAM (SSRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), memory bus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), among others.
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 one … …" does not exclude the presence of other like elements in a process, apparatus, article or method that comprises the element.
The foregoing description is only of the preferred embodiments of the present application, and is not intended to limit the scope of the claims, and all equivalent structures or equivalent processes using the descriptions and drawings of the present application, or direct or indirect application in other related technical fields are included in the scope of the claims of the present application.
Claims (6)
1. A node data processing method applied to a mobile terminal, comprising:
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;
acquiring reject data corresponding to reject nodes in an associated node chain associated with the node chain, wherein the reject nodes are nodes which do not normally enter the next node when the nodes in the associated node chain perform data processing;
adding the reject data as an attachment to the node chain;
according to the preset execution sequence, carrying out data processing on each node on the node chain with the reject data;
before the step of receiving the preset node chain starting command, the method comprises the following steps:
monitoring processing data of the current associated node in the associated node chain;
judging whether the associated node is the reject node according to the processing data;
if the associated node is the reject node, generating the starting command;
and if the associated node is the reject node, generating the start command, including:
if the associated node is the reject node, judging whether an associated node chain where the reject node is located is a preset relief chain with fusion possibility;
if the associated node chain is a preset relief chain with a fusion possibility, generating the starting command;
the step of generating the start command if the associated node chain is a preset relief chain with fusion possibility, includes:
acquiring information of a user initiating the relief chain;
invoking a judging rule corresponding to the relief chain, and judging whether the data information meets the requirement of initiating a relief program by utilizing the judging rule;
and if the relief program is satisfied, generating the start command.
2. The node data processing method according to claim 1, wherein the step of acquiring reject data corresponding to a reject node associated with the node chain comprises:
obtaining reject processing data generated by reject nodes, and capturing a screen of an interface where the reject nodes are located to obtain reject screen;
integrating the reject processing data and the reject screenshot into a preset template to form the reject data.
3. The node data processing method according to claim 1, wherein the step of performing data processing on each node on the node chain 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 approval result passes, calling a mail system and/or a short message system to inform an approver of a next node of the current node.
4. A node data processing apparatus applied to a mobile terminal for implementing a node data processing method according to any one of claims 1-3, characterized in that the apparatus comprises:
the device comprises a receiving unit, a processing unit and a processing unit, wherein the receiving unit is used for receiving a preset starting command of a node chain, and the node chain comprises a plurality of nodes for data processing according to a preset execution sequence;
the acquiring unit is used for acquiring reject data corresponding to reject nodes in the associated node chain associated with the node chain, wherein the reject nodes are nodes which do not normally enter the next node when the nodes in the associated node chain perform data processing;
an adding unit for adding the reject data as an attachment to the node chain;
the execution unit is used for carrying out data processing on each node on the node chain with the reject data according to the preset execution sequence;
the monitoring unit is used for monitoring the processing data of the current associated node in the associated node chain;
the judging unit is used for judging whether the associated node is the reject node according to the processing data;
and the generation unit is used for generating the starting command if the associated node is the reject node.
5. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any of claims 1 to 3 when the computer program is executed.
6. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 3.
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 CN111126930A (en) | 2020-05-08 |
| CN111126930B true 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) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111882293B (en) * | 2020-07-06 | 2024-06-07 | 珠海格力电器股份有限公司 | Application software signing and 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111126930A (en) | 2020-05-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108416485B (en) | User identity recognition method, electronic device and computer readable storage medium | |
| CN109034603B (en) | Business process execution method, device and computer readable storage medium | |
| CN108765175A (en) | Declaration form saves information processing method, device, computer equipment and storage medium from damage | |
| WO2019061998A1 (en) | Intelligent breakpoint distribution method, electronic device, and computer readable storage medium | |
| CN110780883A (en) | Method call chain tracking method, electronic device, and computer-readable storage medium | |
| CN111126930B (en) | Node data processing method, device, computer equipment and storage medium | |
| CN113794999A (en) | Short message distribution method, device and storage medium | |
| CN113687800A (en) | File printing processing method and device, computer equipment and storage medium | |
| CN114240524A (en) | Platform-based unified billing method and system, computer equipment and storage medium | |
| CN108038667B (en) | Policy generation method, device and equipment | |
| CN112235471B (en) | Call center work order processing method and device, computer equipment and storage medium | |
| CN113468212A (en) | Event execution method and device and electronic equipment | |
| CN113590308A (en) | Workflow processing method, device, equipment and medium for applying for cloud resources | |
| CN112990902A (en) | Service processing method, device, computer equipment and storage medium | |
| CN112634090A (en) | Home decoration information reporting management method, system, computer device and storage medium | |
| CN114862428B (en) | Inline enterprise authentication method, terminal device and computer-readable storage medium | |
| CN108090771A (en) | Payment method, mobile terminal and storage medium | |
| CN115130577A (en) | Method and device for identifying fraudulent number and electronic equipment | |
| CN113556430A (en) | Outbound system and outbound method | |
| CN110908820A (en) | Asynchronous task execution method, device, equipment and storage medium | |
| CN109214932A (en) | Order processing method, apparatus, computer equipment and storage medium | |
| CN111639085B (en) | Data asynchronous checking method and device | |
| CN116561795B (en) | Data parallel desensitization processing method | |
| CN111049675B (en) | Online number selection anti-brushing method and device | |
| CN111178044B (en) | Method and device for determining target text elements |
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 |