Business processing method and apparatus

Abstract

The application provides a business processing method and device, which can be used in the financial field or other fields. The method comprises the following steps: receiving a business processing request of a target business scenario, wherein the business processing request comprises multiple types of business data; determining whether the business processing request is verified according to a preset switch rule decision tree and each type of business data, and if yes, completing the business processing corresponding to the business processing request; wherein the preset switch rule decision tree comprises rules of multiple business scenarios and corresponding relationships between the rules, and the corresponding relationships comprise and relationships. The application can guarantee the universality and reliability of the business switch, thereby improving the reliability of the business processing.

Description

Technical Field

[0001] This application relates to the field of data processing technology, and in particular to a business processing method and apparatus. Background Technology

[0002] With the development of technology, the business scenarios of systems are becoming increasingly diverse. Currently, when performing business processing in scenarios such as traffic switching, decoupling, simulation, container switching, and routing, it is usually necessary to configure business switches separately, controlling whether the business is executed by turning the switches on and off. However, configuring a separate business switch for each scenario is undoubtedly cumbersome and redundant, affecting development efficiency and reusability, and may lead to lower reliability of business processing. Summary of the Invention

[0003] To address at least one problem in the prior art, this application proposes a service processing method and apparatus that can ensure the versatility and reliability of service switching, thereby improving the reliability of service processing.

[0004] To address the aforementioned technical problems, this application provides the following technical solution:

[0005] Firstly, this application provides a business processing method, including:

[0006] Receive business processing requests for the target business scenario, which include: multiple types of business data;

[0007] Based on the preset switch rule decision tree and various business data, determine whether the business processing request has been verified. If so, complete the business processing corresponding to the business processing request.

[0008] The preset switch rule decision tree includes: rules for multiple business scenarios and the correspondence between the rules, including AND and OR relationships.

[0009] In one embodiment, the business processing method further includes:

[0010] Obtain the rule files for each business scenario. Each rule file includes: a rule that uniquely corresponds to the business scenario, the business type corresponding to the rule, the level, and the correspondence between the rules.

[0011] Based on the rule files for various business scenarios, the preset switch rule decision tree is constructed.

[0012] In the preset switch rule decision tree, the nodes other than the root node and the intermediate node represent rules for multiple business scenarios, and the node name represents the business type. Nodes at the same level are divided into at least one group of nodes. The nodes in each group are connected sequentially by a line. The connection indicates that the two connected nodes have an AND relationship, and the nodes in each group have an OR relationship. In the same level, the node connected to the intermediate node has an AND relationship with the subtree corresponding to the intermediate node.

[0013] In one embodiment, the business processing method further includes:

[0014] Obtain the rule file for the target business scenario;

[0015] A matching tree is constructed based on the rule file of the target business scenario;

[0016] Each type of business data is determined as the attribute value of a node in the matching tree, excluding the root node and intermediate nodes.

[0017] In the matching tree, the names of nodes other than the root node and intermediate nodes represent the business types corresponding to various types of business data; nodes at the same level are divided into at least one group of nodes, and the nodes in each group are connected sequentially by a line. This line indicates that there is an AND relationship between the two connected nodes, an OR relationship between the nodes, and an AND relationship between the nodes connected to the intermediate node and the subtree corresponding to the intermediate node at the same level.

[0018] In one embodiment, determining whether the business processing request has passed verification based on a preset switch rule decision tree and various business data, and if so, completing the business processing corresponding to the business processing request, includes:

[0019] All rule paths are obtained from the matching tree. Each rule path includes a group of nodes at each level of the matching tree and there are connections between the node groups. The node groups in each rule path are different.

[0020] If all nodes to be verified in a rule path obtain matching nodes with the same node name from the preset switch rule decision tree, and the node to be verified and its corresponding matching node are at the same level, and the attribute value matches the rule corresponding to the matching node, then the rule path is determined to match the preset switch rule decision tree, the business processing request is verified, and the business processing corresponding to the business processing request is completed.

[0021] In one embodiment, the business processing method further includes:

[0022] If a node in the rule path does not find a matching node with the same name from the preset switch rule decision tree, an alarm message is output.

[0023] In one embodiment, the business processing method further includes:

[0024] If a node to be verified in the rule path has an attribute value that is empty, then the rule path is determined to be mismatched with the preset switch rule decision tree.

[0025] In one embodiment, the business processing method further includes:

[0026] If none of the rule paths match the preset switch rule decision tree, the current operation is terminated.

[0027] Secondly, this application provides a business processing apparatus, comprising:

[0028] The receiving module is used to receive business processing requests from the target business scenario, which include: multiple types of business data;

[0029] The verification module is used to determine whether the business processing request has been verified based on a preset switch rule decision tree and various business data. If so, the business processing corresponding to the business processing request is completed.

[0030] The preset switch rule decision tree includes: rules for multiple business scenarios and the correspondence between the rules, including AND and OR relationships.

[0031] In one embodiment, the service processing apparatus further includes:

[0032] The first acquisition module is used to acquire rule files for various business scenarios. Each rule file includes: a rule that uniquely corresponds to a business scenario, the business type corresponding to the rule, the level, and the correspondence between the rules.

[0033] The first construction module is used to construct the preset switch rule decision tree based on the rule files of various business scenarios;

[0034] In the preset switch rule decision tree, the nodes other than the root node and the intermediate node represent rules for multiple business scenarios, and the node name represents the business type. Nodes at the same level are divided into at least one group of nodes. The nodes in each group are connected sequentially by a line. The connection indicates that the two connected nodes have an AND relationship, and the nodes in each group have an OR relationship. In the same level, the node connected to the intermediate node has an AND relationship with the subtree corresponding to the intermediate node.

[0035] In one embodiment, the service processing apparatus further includes:

[0036] The second acquisition module is used to acquire the rule file of the target business scenario;

[0037] The second construction module is used to construct a matching tree based on the rule file of the target business scenario;

[0038] The determination module is used to determine the attribute values ​​of various types of business data as nodes in the matching tree, excluding the root node and intermediate nodes.

[0039] In the matching tree, the names of nodes other than the root node and intermediate nodes represent the business types corresponding to various types of business data; nodes at the same level are divided into at least one group of nodes, and the nodes in each group are connected sequentially by a line. This line indicates that there is an AND relationship between the two connected nodes, an OR relationship between the nodes, and an AND relationship between the nodes connected to the intermediate node and the subtree corresponding to the intermediate node at the same level.

[0040] In one embodiment, the verification module includes:

[0041] A rule path determination unit is used to obtain all rule paths from the matching tree. Each rule path includes a group of nodes in each level of the matching tree and there are connections between the node groups. The node groups in each rule path are different.

[0042] The determining unit is configured to determine that if each node to be verified in a rule path obtains a matching node with the same node name from the preset switch rule decision tree, and the node to be verified and its corresponding matching node are at the same level, and the attribute value matches the rule corresponding to the matching node, then the rule path is determined to match the preset switch rule decision tree, the business processing request is verified, and the business processing corresponding to the business processing request is completed.

[0043] In one embodiment, the service processing apparatus further includes:

[0044] The alarm module is used to output alarm information if a node in the rule path does not obtain a matching node with the same node name from the preset switch rule decision tree.

[0045] In one embodiment, the service processing apparatus further includes:

[0046] The matching module is used to determine that the rule path does not match the preset switch rule decision tree if there is a node to be verified in the rule path with a corresponding empty attribute value.

[0047] In one embodiment, the business processing method further includes:

[0048] The abort module is used to abort the current operation if none of the rule paths match the preset switch rule decision tree.

[0049] Thirdly, this application provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the aforementioned business processing method.

[0050] Fourthly, this application provides a computer-readable storage medium storing computer instructions thereon, which, when executed, implement the aforementioned business processing method.

[0051] As can be seen from the above technical solutions, this application provides a business processing method and apparatus. The method includes: receiving a business processing request for a target business scenario, the business processing request including multiple types of business data; determining whether the business processing request has passed verification based on a preset switch rule decision tree and various types of business data; if so, completing the business processing corresponding to the business processing request; wherein the preset switch rule decision tree includes rules for multiple business scenarios and the correspondence between the rules, the correspondence including AND and OR relationships, which can ensure the universality and reliability of the business switch, thereby improving the reliability of business processing; specifically, by configuring a universal business switch, the amount of development can be reduced, the reliability of the development process can be improved, and the occurrence of abnormal situations such as business switch errors can be reduced, thereby improving the reliability of business processing when applying the business switch; a new universal switch rule tree is designed based on a tree structure, which can be independently deployed as a service to realize unified management, invocation, updating and cleanup of switch rules, improving development efficiency; the universal switch can achieve universality across all scenarios through simple rule syntax, avoiding redundant development of switch rules for individual scenarios, greatly reducing the development burden of developers; the universal switch can support infinite nesting of switch rules through simple syntax rules, that is, logical statements can be used to replace complex code writing. This solution is language-independent and can be created as a standalone service. Compared to the current approach of writing separate switch code for different systems and language environments, it is much simpler to implement and reduces coding workload. Furthermore, this solution can continuously learn from the input matching logic, enabling the rule tree to match a wider range of scenarios. This avoids the difficulty of writing and debugging code with numerous nested rules, significantly reducing the cost and difficulty of later maintenance. Even with incomplete rule items, it can still make relatively reliable predictions, ensuring the availability of the function under extreme conditions. Attached Figure Description

[0052] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0053] Figure 1 This is a first flowchart illustrating the business processing method in an embodiment of this application;

[0054] Figure 2 This is a second flowchart illustrating the business processing method in the embodiments of this application;

[0055] Figure 3 This is a schematic diagram of a switch rule decision tree as an example in this application;

[0056] Figure 4 This is a schematic diagram of the third process of the business processing method in the embodiments of this application;

[0057] Figure 5 This is a schematic diagram of a matching tree as an example in this application;

[0058] Figure 6 This is a schematic diagram of a matching tree, as illustrated in another example of this application;

[0059] Figure 7 This is a schematic diagram of a switch rule decision tree, as illustrated in another example of this application.

[0060] Figure 8 This is a schematic diagram of the structure of the service processing device in the embodiments of this application;

[0061] Figure 9 This is a schematic block diagram illustrating the system configuration of an electronic device according to an embodiment of this application. Detailed Implementation

[0062] To enable those skilled in the art to better understand the technical solutions in this specification, the technical solutions in the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments in this application, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of this application.

[0063] In existing business processing methods, configuring business switches still requires writing different switches for individual scenarios, which limits the supported scenarios; the support for switch length is limited, and long nested logic is complex; based on specific code writing, debugging and maintaining complex logic is difficult and costly, and updating rules later is difficult and prone to errors; in particular, in extreme scenarios where rule item values ​​are lacking, existing rule switches become invalid and cannot be used.

[0064] It should be noted that the business processing methods and apparatus disclosed in this application can be used in the field of financial technology, as well as in any other field. The application areas of the business processing methods and apparatus disclosed in this application are not limited. The acquisition, storage, use, and processing of data in the technical solutions of each embodiment of this application all comply with relevant laws and regulations.

[0065] The following examples illustrate this in detail.

[0066] To ensure the versatility and reliability of service switches, and thus improve the reliability of service processing, this embodiment provides a service processing method in which the execution subject is a service processing device. This service processing device includes, but is not limited to, a server, such as... Figure 1 As shown, this method specifically includes the following:

[0067] Step 100: Receive the business processing request for the target business scenario. The business processing request includes multiple types of business data.

[0068] Specifically, the target business scenario can be one of the following: flow switching, decoupling, simulation, container switching, routing, etc.

[0069] For example, in a traffic switching scenario, the types of business data include: region code, scenario switch, and receiving line region; region code, for example, 200 represents Guangdong; scenario switch: 1 indicates traffic switching is effective, 2 indicates traffic switching is ineffective; receiving line region: the region code of the receiving line, such as 100 representing Beijing. In a routing scenario, the types of business data include: the region where the route is located, the network location where the route is located, the region where the subordinate line is located, the network location where the subordinate line is located, and the cost; the region where the route is located: 200, the network location where the route is located: 62, the region where the subordinate line is located: 100, the network location where the subordinate line is located: 52, and the cost: 30.

[0070] Step 200: Based on the preset switch rule decision tree and various business data, determine whether the business processing request has been verified. If so, complete the business processing corresponding to the business processing request. The preset switch rule decision tree includes rules for multiple business scenarios and the correspondence between the rules. The correspondence includes AND and OR relationships.

[0071] Specifically, the function implemented by the preset switch rule decision tree is equivalent to the function implemented by the aforementioned business switch. Passing the verification of the business processing request is equivalent to turning on the business switch. After the business processing request passes verification, if the target business scenario is a flow-switching scenario, the flow-switching operation corresponding to the business processing request can be completed; if the target business scenario is a routing scenario, the routing operation corresponding to the business processing request can be completed.

[0072] To improve the reliability and versatility of the switch rule decision tree, such as Figure 2 As shown, in one embodiment, the business processing method further includes:

[0073] Step 001: Obtain the rule files for each business scenario. Each rule file includes: a rule that uniquely corresponds to the business scenario, the business type corresponding to the rule, the level, and the correspondence between the rules.

[0074] Specifically, the rule file can be formatted as: {key:{value:{...},rule:$rule}}, or as: {$group:{value:[{key1:{value:{...},rule:$rule}},{key2:{value:{...},rule:$rule}}],rule:$rule},{key:{...},rule:$rule}}, where key represents the business type, key:value:{...} represents the rule, $rule represents the logical operator of the rule, i.e., the correspondence between the rule and the next rule, and $group represents nested key-value pairs, which can be used to reflect the hierarchy of the rules.

[0075] For example, the rule file for a traffic switching scenario is: {"szoneno":{"value":200,"rule"="and"},"switchkind":{"value":1,"rule"="or"},"rzoneno":{"value":100,"rule"=null}}. The corresponding rules include: szoneno=200, switchkind=1, rzoneno=100. The business types (i.e., rule names) corresponding to the rules include: area code szoneno, scenario switch switchkind, and receiving line area rzoneno. The correspondence between rules includes: the area code and the scenario switch are ANDed, and the scenario switch and the receiving line area are ORed. Since $group does not exist in the rule file, all rules have the same level and can be set as the first level.

[0076] For example, the rule file for a routing scenario is: {"szoneno":{"value":200,"rule":"and"},"sbrno":{"value":62,"rule":"and"},"$group":{"value":[{"rzoneno":{"value":100,"rule":"and"}},{"rbrno":{"value":52,"rule":"and"}},{"fee":{"value":30,"rule":null}}]}}, and the corresponding rules include: szo The rules have the following parameters: neno=200, sbrno=62, rzoneno=100, rbrno=52, fee=30. The corresponding business types include: the route's location (szoneno), the route's destination (sbrno), the subordinate branch's location (rzoneno), the subordinate branch's destination (rbrno), and the fee. The relationships between rules are as follows: there is an AND relationship between the route's location and its destination, and an AND relationship between the destination and the nested key value `$group`. The keys corresponding to the nested key values ​​include: the subordinate branch's location, the subordinate branch's destination, and the fee. There is also an AND relationship between the subordinate branch's location, its destination, and the fee. Rules corresponding to the route's location and its destination have the same level and can both be set to level one. If a `$group` exists in the rule file and it is not nested within another `$group`, then the rule level within `$group` is incremented by 1, meaning the subordinate branch's location, its destination, and the fee can all be set to level two. In the rules file, for each additional nested key-value pair within a nested key-value pair, the rule hierarchy within that nested key-value pair can be increased by 1 compared to the rule hierarchy of its outermost nested key-value pair.

[0077] Step 002: Based on the rule files of each business scenario, construct the preset switch rule decision tree; wherein, the nodes other than the root node and intermediate nodes in the preset switch rule decision tree represent the rules of multiple business scenarios, and the node name represents the business type; the nodes at the same level are divided into at least one group of nodes, and the nodes in each group of nodes are connected sequentially by a line, which indicates that the two nodes connected by the line have an AND relationship, the nodes of each group of nodes have an OR relationship, and the nodes connected to the intermediate node at the same level have an AND relationship with the subtree corresponding to the intermediate node.

[0078] Specifically, if different business scenarios correspond to the same business type but different rules, the same node can be used to represent different rules in the switch rule decision tree. For example, the rules corresponding to the szoneno node include: szoneno=200, szoneno=100. If the area code in the business processing request is 200, which matches one of the rules in the szoneno node, then the area code 200 in the business processing request is considered to be true when it matches the szoneno node.

[0079] In one example, the decision trees for switching rules corresponding to flow-cutting and routing scenarios can be as follows: Figure 3 As shown. First, the rule file for the aforementioned traffic-switching scenario can be used to construct an initial switch rule decision tree, including: Rsl1 node, szoneno node, switchkind node, rzoneno node, and the connections between them. Second, the rule file for the aforementioned routing scenario can be used. Since the initial switch rule decision tree already contains an szoneno node, all nodes are at the first level and use the same AND logical operator, no further szoneno nodes are added to the initial switch rule decision tree. Similarly, no further sbrno nodes are added. In the routing scenario rule file, the lower-level network and cost levels are both at the second level. Therefore, rzoneno, rbrno, and fee nodes are added to the next level in the initial switch rule decision tree. The rzoneno, rbrno, and fee nodes are all connected to the sbrno node via an AND relationship. An Rsl2 intermediate node is constructed between the rzoneno and sbrno nodes. Since the node uses an AND logical operator, it is connected to the next node.

[0080] To improve the efficiency of the business request verification process, such as Figure 4 As shown, in one embodiment, the business processing method further includes:

[0081] Step 003: Obtain the rule file for the target business scenario.

[0082] Step 004: Based on the rule file of the target business scenario, construct a matching tree.

[0083] For example, if the target business scenario is a traffic switching scenario, the matching tree obtained based on the rule file corresponding to the traffic switching scenario can be as follows: Figure 5 As shown. The target business scenario is a routing scenario. The matching tree obtained based on the rule file corresponding to the above routing scenario can be as follows: Figure 6 As shown.

[0084] Step 005: Determine the attribute values ​​of the nodes in the matching tree, excluding the root node and intermediate nodes, for each type of business data; wherein, the names of the nodes in the matching tree, excluding the root node and intermediate nodes, represent the business types corresponding to each type of business data; nodes at the same level are divided into at least one group of nodes, and the nodes in each group are connected sequentially by lines, which indicate that the two connected nodes have an AND relationship, the nodes in each group have an OR relationship, and the nodes connected to the intermediate node at the same level have an AND relationship with the subtree corresponding to the intermediate node.

[0085] To improve the efficiency of business processing request verification, in one embodiment, step 200 includes:

[0086] Step 201: Obtain all rule paths from the matching tree. Each rule path includes a group of nodes at each level of the matching tree and there are connections between these groups of nodes. The groups of nodes in each rule path are different.

[0087] Step 202: If each node to be verified in a rule path obtains a matching node with the same node name from the preset switch rule decision tree, and the node to be verified and its corresponding matching node are at the same level, and the attribute value matches the rule corresponding to the matching node, then it is determined that the rule path matches the preset switch rule decision tree, the business processing request is verified, and the business processing corresponding to the business processing request is completed.

[0088] Specifically, the node to be verified refers to a node in the rule path, and the matching node refers to a node in the preset switch rule decision tree with the same node name as the node to be verified. Alternatively, if there exists a rule path where each node to be verified obtains a matching node with the same node name from the preset switch rule decision tree, and the node to be verified and its corresponding matching node are at the same level, have the same logical operator, and their attribute values ​​match the rule corresponding to the matching node, then the rule path is determined to match the preset switch rule decision tree.

[0089] For example, Figure 5There are two corresponding rule paths: one includes the `switchkind` node and the `szoneno` node, and the other includes the `rzoneno` node. Assuming the root node is at level 0, if the preset switch rule decision tree contains both `switchkind` and `szoneno` nodes, both at level 1, and the `switchkind` nodes in both trees have the same attribute value of 1 (both are AND operators), and the `szoneno` nodes have the same attribute value of 200, then the rule path consisting of the `switchkind` and `szoneno` nodes matches the preset switch rule decision tree. If either the `switchkind` and `szoneno` node rule path matches the preset switch rule decision tree, or the rule path consisting of the `rzoneno` node matches the preset switch rule decision tree, then the business processing request verification is successful; that is, as long as one of the rule paths matches the switch rule decision tree, the business processing request verification is successful. Figure 6 Each node group at each level is unique, and there are connections between node groups. Figure 6 There is only one corresponding rule path.

[0090] To facilitate timely adjustments to abnormal business types, in one embodiment, the business processing method further includes: if a node in the rule path does not obtain a matching node with the same node name from the preset switch rule decision tree, then an alarm message is output.

[0091] To avoid the presence of nodes with empty attribute values ​​in one rule path, which could affect the matching between other rule paths and the switch rule decision tree and thus affect the accuracy of the verification results, in one embodiment, the business processing method further includes: if a node to be verified in the rule path has a corresponding empty attribute value, then it is determined that the rule path does not match the preset switch rule decision tree.

[0092] To improve the efficiency of matching rule paths with the switch rule decision tree, in one embodiment, the business processing method further includes: if each rule path does not match the preset switch rule decision tree, then the current operation is terminated.

[0093] To further illustrate this solution, this application provides an application example of a business processing method, as described in detail below:

[0094] Step 1: Collect input data. Input data is typically in JSON format. The rule file contains rules consisting of manually set switch conditions, also in JSON format, with the following two input format conventions:

[0095] 1. Non-nested key-value pairs:

[0096] {key:{value:{...},rule:$rule}}; where key represents the key value, such as the row number field; rule represents the merging rule for nodes at the same level, with values ​​of or|and.

[0097] 2. Nested key-value pairs: {$group:{value:[{key1:{value:{...},rule:$rule}},{key2:{value:{...},rule:$rule}}],rule:$rule},{key:{...},rule:$rule}}; where $group represents nested key-value pairs.

[0098] 3. Rule file:

[0099] Taking A&(D&E||F) as an example, the rule file is generated using a stack-based algorithm:

[0100] 1) If rule A is detected, the output is a non-nested key-value rule, where the rule is the first merged rule encountered after A;

[0101] 2) If parentheses are detected, the rule inside the parentheses will be output as a nested key-value rule. The elements within the nested key-value rule will be generated into non-nested key-value rules and nested key-value rules according to rules 1) and 2) respectively.

[0102] 3) After repeating rules 1) and 2), output the rule text to the specified JSON file to obtain the rule file.

[0103] Taking the flow switching scenario as an example, the input data includes: region code + scenario switch + receiving line region. Region code, for example: 200 represents Guangdong; scenario switch: 1 indicates flow switching is active, 2 indicates flow switching is inactive; receiving line region: the region code of the receiving line, such as 100 for Beijing. The flow switching scenario rule is as follows: szoneno = 200 && switchkind = 1 || rzoneno = 100, and the corresponding rule file includes: {"szoneno":{"value":200,"rule":"and"},"switchkind":{"value":1,"rule":"or"},"rzoneno":{"value":100,"rule":null}}.

[0104] Taking a routing scenario as an example: Input data includes: the region where the route is located + the network point where the route is located + the region where the subordinate line is located + the network point where the subordinate line is located + the cost, such as: 200+62+100+52+30. A rule in a routing scenario is: sz oneno=200&&sbrno=62&&(rzoneno=100&&rbrno=52&&fee=30), and the corresponding rule file includes: {"szoneno":{"value":200,"rule":"and"},"sbrno":{"value":62,"rule":"and"},"$gr oup":{"value":[{"rzoneno":{"value":100,"rule":"and"}},{"rbrno":{"value":52,"rule":"and"}},{"fee":{"value":30,"rule":null}}]}}.

[0105] Step 2: Construct a general switch rule decision tree.

[0106] The construction of the general switch rule decision tree (hereinafter referred to as the rule tree) is the core of this general switch solution. To this end, this solution proposes a targeted tree structure based on the structure of the rule file mentioned above to meet the construction of the rule tree, and makes the following switch rule tree generation rules:

[0107] 1. A rule tree must have a root node, and the root node is an intermediate node without rule processing functionality;

[0108] 2. Within the same subtree at the same level of the rule tree, there is only one node with the same rule name; that is, there are no two identical sibling nodes. Rules with the same node will be merged into the set during the rule tree construction process. For example... Figure 7 As shown, in this application example, sibling nodes can represent nodes at the same level that are connected sequentially by lines, while non-sibling nodes can represent nodes at the same level that do not have a direct or indirect connection.

[0109] 3. All leaf nodes in the rule tree are rule processing nodes, and only leaf nodes can perform rule processing. Each leaf node processes only one rule.

[0110] 4. The intermediate nodes of the rule tree are used to store the execution results of the subtrees. After storing the execution nodes of the subtrees, they will be transformed into leaf nodes.

[0111] 5. If a rule is encountered in the rule tree, it is divided into a subtree; if an AND rule is encountered, they are considered adjacent nodes. That is to say, nodes at the same level have an OR relationship in different subtrees, but an AND relationship when they are adjacent in the same subtree.

[0112] Based on the rules for the above-mentioned flow cutting and routing scenarios, a rule tree is constructed.

[0113] Step 3: Apply the rule tree.

[0114] To facilitate operation and expand the functionality of the general switch rule tree, avoid rebuilding the rule tree every time it starts, accelerate rule matching, and clean up obsolete rule chains, this solution defines two threads for each rule: one is a job thread for providing services; the other is a daemon thread for maintaining the rule tree itself. The following attributes and operations are defined on the rule tree:

[0115] 1. Serialization: The rule tree can be serialized to disk in binary format or deserialized and loaded into memory.

[0116] 2. Call Count: Each leaf node has a call count attribute. Whenever a leaf node is called, the call count is increased, and the last call time is recorded. The daemon process will traverse each leaf node within a set time, deduct the call count, and calculate the average call count within the set time.

[0117] 3. Update: The rule links that need to be updated also need to be translated into rule files. A rule update tree is generated according to the generated rules. The corresponding subtree structure in the rule tree is matched by selecting an appropriate traversal algorithm, and the update flag of the node is set to 1. The rule tree daemon process executes the update operation of the node with the update flag set to 1.

[0118] 4. Cleanup: Cleanup is divided into intelligent cleanup and manual cleanup. Manual cleanup: The rule links that need to be cleaned also need to be translated into rule files, a rule cleanup tree is generated according to the generated rules, the corresponding subtree structure in the rule tree is matched by selecting an appropriate traversal algorithm, and the deletion flag of the node is set to 1. The daemon process of the rule tree performs the cleanup operation on the nodes with the deletion flag set to 1. Intelligent cleanup: The daemon process of the rule tree will clean up the leaf nodes on each link whose recent average call count is less than a set threshold at a set time.

[0119] Step 4: Rule tree modeling.

[0120] Rule trees can achieve both deterministic rule matching results and binary classification prediction of on / off states, similar to decision trees, depending on the training method. If matching results are required based on deterministic rules, unsupervised modeling of the rule tree is sufficient. If the rule tree needs to provide a reliable prediction of on / off states based on incomplete rules, supervised modeling with pre-labeled data is required. These two modeling methods can be combined to allow the rule tree to provide deterministic results based on deterministic rules and to predict on / off states based on incomplete rules. Rule trees can be trained either unsupervised or supervised. The difference between unsupervised and supervised training lies in whether labels are provided. The choice between unsupervised, supervised, or a combination of both training methods depends on the rule tree's preference for predicting when input values ​​are missing.

[0121] Unsupervised modeling: This means that the modeling data does not need to be labeled in advance. The rule tree will read the rules, construct the rules according to the rule tree construction method described above, and merge the rules of the same subtree at the same level.

[0122] Supervised modeling: This involves using pre-labeled data of switch results to model the rule tree. The creation steps for the rule tree are the same as unsupervised modeling, the difference being that the attributes under the rule nodes are not fixed attribute values, but weight coefficients with values ​​in the range [0,1]. The weight coefficients determine the degree of influence of the rule node on the prediction result. This scheme can use the C4.5 algorithm to calculate the weight coefficients based on the labeled data, taking the softmax normalized result of the information gain ratio of the attribute; that is, attributes with higher information gain ratios have higher weights.

[0123] Step 5: Matching operation. Unsupervised rule tree matching:

[0124] 1. Read the input communication area Map and generate a matching tree according to the rule tree generation rules mentioned above.

[0125] 2. Apply the level-order traversal algorithm to both the matching tree and the rule tree. In order to quickly match nodes at the same level, this scheme uses the form of "rule name-rule node" to store the child nodes of the rule tree. The required rule tree node can be quickly matched by taking the rule name of the child node in the current level of the matching tree.

[0126] 3. If the rule tree node does not exist, it means that the current rule has not been created in the rule tree and a matching rule needs to be added. Returning a "not implemented" error.

[0127] 4. If the rule tree node exists, the principle of matching branches at the same level equals matching at the current level and all levels below it is applied, and rule matching is performed according to the following steps:

[0128] (1) If the matching rule is at level 2, if the rule matches and there are no sibling nodes, or the results of all sibling nodes are true, then stop the matching and return the result true; if the rule does not match, check if there are any non-sibling nodes at the same level. If there are none, stop the matching and return the result false. If there are, match the non-sibling nodes at the same level and continue to execute the matching rule in this step. In this application example, the root node can be set to level 1.

[0129] (2) If the matching rule is applied to a node at a level greater than 2, and the rule matches, check if there are sibling nodes. If they do, prioritize matching the sibling nodes. If no sibling nodes exist, find the parent node at the next higher level, set the parent node's rule matching result field to true, and stop searching for nodes below that level in the next round of rule matching. If the rule does not match, check if there are non-sibling nodes at the same level. If they do, continue matching non-sibling nodes at the same level. If no sibling nodes exist, find the parent node, set the rule matching result field to false, and stop searching for nodes below that level in the next round of rule matching. When the level is reduced to only levels 1 and 2, proceed with step (1).

[0130] (3) The returned true or false result is used as the final result of rule matching.

[0131] 5. Abort the matching and return the result.

[0132] Step 6: Rule tree prediction matching.

[0133] In some scenarios, each rule item of the rule that needs to be matched may not be complete, but the on / off result still needs to be obtained. While ensuring reliability as much as possible, the rule tree provides predictive matching functionality for the rules.

[0134] In such scenarios, the matching process of rule trees is basically similar to that of unsupervised rule matching, with the following differences:

[0135] 1. Missing rule items will default to false.

[0136] Specifically, a trained rule tree can provide predictions for both complete and incomplete inputs. Since most business scenarios in this industry require definite results, necessitating the rejection of incomplete inputs, the prediction method is controlled by external parameters. No additional imputation of missing values ​​for incomplete inputs is needed, nor is pruning required. Intermediate nodes are not rule processing nodes, and the definite attribute values ​​of rule processing nodes are not singular. The C4.5 algorithm is only used when calculating node weights to determine the node's impact on the prediction result, fundamentally different from a decision tree.

[0137] 2. The matching result of each rule item will be converted into {0,1}, where false is 0 and true is 1. Then, it will be multiplied by its respective weight coefficient. Only when the final result is greater than the set threshold will it be considered a true result.

[0138] In other words, in scenarios involving predictive matching, the rule tree imposes stricter restrictions on the action of turning on the switch; in scenarios with many missing rule items, the rule tree will tend not to turn on the switch.

[0139] From a software perspective, to ensure the versatility and reliability of the service switch, and thus improve the reliability of service processing, this application provides an embodiment of a service processing apparatus for implementing all or part of the service processing method, see [link to relevant documentation]. Figure 8 The business processing device specifically includes the following components:

[0140] The receiving module 01 is used to receive business processing requests for the target business scenario, which include: multiple types of business data;

[0141] Verification module 02 is used to determine whether the business processing request has been verified based on a preset switch rule decision tree and various business data. If so, the business processing corresponding to the business processing request is completed. The preset switch rule decision tree includes rules for multiple business scenarios and the correspondence between the rules. The correspondence includes AND and OR relationships.

[0142] In one embodiment, the service processing apparatus further includes:

[0143] The first acquisition module is used to acquire rule files for various business scenarios. Each rule file includes: a rule that uniquely corresponds to a business scenario, the business type corresponding to the rule, the level, and the correspondence between the rules.

[0144] The first construction module is used to construct the preset switch rule decision tree based on the rule files of various business scenarios;

[0145] In the preset switch rule decision tree, the nodes other than the root node and the intermediate node represent rules for multiple business scenarios, and the node name represents the business type. Nodes at the same level are divided into at least one group of nodes. The nodes in each group are connected sequentially by a line. The connection indicates that the two connected nodes have an AND relationship, and the nodes in each group have an OR relationship. In the same level, the node connected to the intermediate node has an AND relationship with the subtree corresponding to the intermediate node.

[0146] In one embodiment, the service processing apparatus further includes:

[0147] The second acquisition module is used to acquire the rule file of the target business scenario;

[0148] The second construction module is used to construct a matching tree based on the rule file of the target business scenario;

[0149] The determination module is used to determine the attribute values ​​of various types of business data as nodes in the matching tree, excluding the root node and intermediate nodes.

[0150] In the matching tree, the names of nodes other than the root node and intermediate nodes represent the business types corresponding to various types of business data; nodes at the same level are divided into at least one group of nodes, and the nodes in each group are connected sequentially by a line. This line indicates that there is an AND relationship between the two connected nodes, an OR relationship between the nodes, and an AND relationship between the nodes connected to the intermediate node and the subtree corresponding to the intermediate node at the same level.

[0151] In one embodiment, the verification module includes:

[0152] A rule path determination unit is used to obtain all rule paths from the matching tree. Each rule path includes a group of nodes in each level of the matching tree and there are connections between the node groups. The node groups in each rule path are different.

[0153] The determining unit is configured to determine that if each node to be verified in a rule path obtains a matching node with the same node name from the preset switch rule decision tree, and the node to be verified and its corresponding matching node are at the same level, and the attribute value matches the rule corresponding to the matching node, then the rule path is determined to match the preset switch rule decision tree, the business processing request is verified, and the business processing corresponding to the business processing request is completed.

[0154] In one embodiment, the service processing apparatus further includes:

[0155] The alarm module is used to output alarm information if a node in the rule path does not obtain a matching node with the same node name from the preset switch rule decision tree.

[0156] In one embodiment, the service processing apparatus further includes:

[0157] The matching module is used to determine that the rule path does not match the preset switch rule decision tree if there is a node to be verified in the rule path with a corresponding empty attribute value.

[0158] In one embodiment, the business processing method further includes:

[0159] The abort module is used to abort the current operation if none of the rule paths match the preset switch rule decision tree.

[0160] The embodiments of the business processing apparatus provided in this specification can be used to execute the processing flow of the embodiments of the above-described business processing methods. Its functions will not be repeated here, but can be referred to the detailed description of the embodiments of the above-described business processing methods.

[0161] From a hardware perspective, in order to ensure the versatility and reliability of the service switch, and thus improve the reliability of service processing, this application provides an embodiment of an electronic device for implementing all or part of the service processing method. The electronic device specifically includes the following:

[0162] The device comprises a processor, memory, a communications interface, and a bus; wherein the processor, memory, and communications interface communicate with each other via the bus; the communications interface is used to realize information transmission between the service processing device and related devices such as user terminals; the electronic device can be a desktop computer, tablet computer, or mobile terminal, etc., and this embodiment is not limited to these. In this embodiment, the electronic device can be implemented with reference to the embodiments for implementing the service processing method and the embodiments for implementing the service processing device, the content of which is incorporated herein, and repeated details are not described again.

[0163] Figure 9 This is a schematic block diagram illustrating the system configuration of the electronic device 9600 according to an embodiment of this application. Figure 9 As shown, the electronic device 9600 may include a central processing unit 9100 and a memory 9140; the memory 9140 is coupled to the central processing unit 9100. It is worth noting that... Figure 9 This is an example; other types of structures can also be used to supplement or replace this structure to achieve telecommunications functions or other functions.

[0164] In one or more embodiments of this application, business processing functions can be integrated into a central processing unit 9100. The central processing unit 9100 can be configured to perform the following controls:

[0165] Step 100: Receive a business processing request for the target business scenario. This business processing request includes: multiple types of business data;

[0166] Step 200: Based on the preset switch rule decision tree and various business data, determine whether the business processing request has been verified. If so, complete the business processing corresponding to the business processing request. The preset switch rule decision tree includes rules for multiple business scenarios and the correspondence between the rules. The correspondence includes AND and OR relationships.

[0167] As can be seen from the above description, the electronic equipment provided by the embodiments of this application can ensure the universality and reliability of the service switch, thereby improving the reliability of service processing.

[0168] In another embodiment, the service processing device can be configured separately from the central processing unit 9100. For example, the service processing device can be configured as a chip connected to the central processing unit 9100, and the service processing function can be implemented through the control of the central processing unit.

[0169] like Figure 9 As shown, the electronic device 9600 may further include: a communication module 9110, an input unit 9120, an audio processor 9130, a display 9160, and a power supply 9170. It is worth noting that the electronic device 9600 does not necessarily need to include these components. Figure 9 All components shown; in addition, the electronic device 9600 may also include Figure 9 For components not shown, please refer to existing technologies.

[0170] like Figure 9 As shown, the central processing unit 9100, sometimes also referred to as a controller or operating control, may include a microprocessor or other processor device and / or logic device, which receives inputs and controls the operation of various components of the electronic device 9600.

[0171] The memory 9140 may be, for example, one or more of a cache, flash memory, hard drive, removable media, volatile memory, non-volatile memory, or other suitable devices. It may store the aforementioned failure-related information, and also store a program for executing that information. The central processing unit 9100 may execute the program stored in the memory 9140 to perform information storage or processing, etc.

[0172] Input unit 9120 provides input to central processing unit 9100. Input unit 9120 may be, for example, a keypad or touch input device. Power supply 9170 provides power to electronic device 9600. Display 9160 displays images and text. Display may be, for example, an LCD display, but is not limited thereto.

[0173] The memory 9140 can be a solid-state memory, such as a read-only memory (ROM), random access memory (RAM), a SIM card, etc. It can also be a memory that retains information even when power is off, can be selectively erased, and contains more data; examples of this type of memory are sometimes referred to as EPROMs. The memory 9140 can also be some other type of device. The memory 9140 includes a buffer memory 9141 (sometimes referred to as a buffer). The memory 9140 may include an application / function storage unit 9142 for storing application programs and function programs or processes for executing the operation of the electronic device 9600 via the central processing unit 9100.

[0174] The memory 9140 may also include a data storage unit 9143 for storing data, such as contacts, digital data, pictures, sounds, and / or any other data used by the electronic device. The driver storage unit 9144 of the memory 9140 may include various drivers for the electronic device's communication functions and / or for performing other functions of the electronic device (such as messaging applications, address book applications, etc.).

[0175] The communication module 9110 is a transmitter / receiver 9110 that transmits and receives signals via the antenna 9111. The communication module (transmitter / receiver) 9110 is coupled to the central processing unit 9100 to provide input signals and receive output signals, which can be the same as in a conventional mobile communication terminal.

[0176] Based on different communication technologies, multiple communication modules 9110 can be configured in the same electronic device, such as cellular network modules, Bluetooth modules, and / or wireless LAN modules. The communication module (transmitter / receiver) 9110 is also coupled to a speaker 9131 and a microphone 9132 via an audio processor 9130 to provide audio output via the speaker 9131 and receive audio input from the microphone 9132, thereby realizing typical telecommunications functions. The audio processor 9130 may include any suitable buffer, decoder, amplifier, etc. Additionally, the audio processor 9130 is coupled to a central processing unit 9100, enabling on-device recording via the microphone 9132 and on-device playback of stored sound via the speaker 9131.

[0177] As can be seen from the above description, the electronic equipment provided in the embodiments of this application can ensure the universality and reliability of the service switch, thereby improving the reliability of service processing.

[0178] Embodiments of this application also provide a computer-readable storage medium capable of implementing all steps of the business processing method in the above embodiments. The computer-readable storage medium stores a computer program that, when executed by a processor, implements all steps of the business processing method in the above embodiments. For example, when the processor executes the computer program, it implements the following steps:

[0179] Step 100: Receive a business processing request for the target business scenario. This business processing request includes: multiple types of business data;

[0180] Step 200: Based on the preset switch rule decision tree and various business data, determine whether the business processing request has been verified. If so, complete the business processing corresponding to the business processing request. The preset switch rule decision tree includes rules for multiple business scenarios and the correspondence between the rules. The correspondence includes AND and OR relationships.

[0181] As can be seen from the above description, the computer-readable storage medium provided in the embodiments of this application can ensure the universality and reliability of service switching, thereby improving the reliability of service processing.

[0182] The various embodiments of the methods described in this application are presented in a progressive manner. Similar or identical parts between embodiments can be referred to mutually. Each embodiment focuses on explaining the differences from other embodiments. Relevant details can be found in the descriptions of the method embodiments.

[0183] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0184] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1A device that provides the functions specified in one or more boxes.

[0185] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0186] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0187] This application uses specific embodiments to illustrate the principles and implementation methods of this application. The description of the above embodiments is only for the purpose of helping to understand the method and core ideas of this application. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this application. Therefore, the content of this specification should not be construed as a limitation of this application.

Claims

1. A business processing method, characterized in that, include: Receive business processing requests for the target business scenario, which include: multiple types of business data; Based on the preset switch rule decision tree and various business data, determine whether the business processing request has been verified. If so, complete the business processing corresponding to the business processing request. The preset switch rule decision tree includes: rules for multiple business scenarios and the correspondence between the rules, wherein the correspondence includes: AND relationship and OR relationship; The method further includes: Obtain the rule files for each business scenario. Each rule file includes: a rule that uniquely corresponds to the business scenario, the business type corresponding to the rule, the level, and the correspondence between the rules. Based on the rule files for various business scenarios, the preset switch rule decision tree is constructed. In the preset switch rule decision tree, the nodes other than the root node and the intermediate node represent rules for multiple business scenarios, and the node name represents the business type. Nodes at the same level are divided into at least one group of nodes. The nodes in each group are connected sequentially by a line. The connection indicates that there is an AND relationship between the two connected nodes, an OR relationship between the nodes, and an AND relationship between the nodes connected to the intermediate node and the subtree corresponding to the intermediate node at the same level. If different business scenarios correspond to the same business type but different rules, then the same node is used to represent different rules in the switch rule decision tree. The step of determining whether the business processing request has passed verification based on a preset switch rule decision tree and various business data, and if so, completing the business processing corresponding to the business processing request, includes: All rule paths are obtained from the matching tree. Each rule path includes a group of nodes at each level of the matching tree and there are connections between these groups of nodes. The groups of nodes in each rule path are different. If all nodes to be verified in a rule path obtain matching nodes with the same node name from the preset switch rule decision tree, and the node to be verified and its corresponding matching node are at the same level, and the attribute value matches the rule corresponding to the matching node, then the rule path is determined to match the preset switch rule decision tree, the business processing request is verified, and the business processing corresponding to the business processing request is completed.

2. The business processing method according to claim 1, characterized in that, Also includes: Obtain the rule file for the target business scenario; A matching tree is constructed based on the rule file of the target business scenario; Each type of business data is determined as the attribute value of a node in the matching tree, excluding the root node and intermediate nodes. In the matching tree, the names of nodes other than the root node and intermediate nodes represent the business types corresponding to various types of business data; nodes at the same level are divided into at least one group of nodes, and the nodes in each group are connected sequentially by a line. This line indicates that there is an AND relationship between the two connected nodes, an OR relationship between the nodes, and an AND relationship between the nodes connected to the intermediate node and the subtree corresponding to the intermediate node at the same level.

3. The business processing method according to claim 2, characterized in that, Also includes: If a node in the rule path does not find a matching node with the same name from the preset switch rule decision tree, an alarm message is output.

4. The business processing method according to claim 2, characterized in that, Also includes: If a node to be verified in the rule path has an attribute value that is empty, then the rule path is determined to be mismatched with the preset switch rule decision tree.

5. The business processing method according to claim 2, characterized in that, Also includes: If none of the rule paths match the preset switch rule decision tree, the current operation is terminated.

6. A business processing apparatus, characterized in that, include: The receiving module is used to receive business processing requests from the target business scenario, which include: multiple types of business data; The verification module is used to determine whether the business processing request has been verified based on a preset switch rule decision tree and various business data. If so, the business processing corresponding to the business processing request is completed. The preset switch rule decision tree includes: rules for multiple business scenarios and the correspondence between the rules, wherein the correspondence includes: AND relationship and OR relationship; The business processing device further includes: The first acquisition module is used to acquire rule files for various business scenarios. Each rule file includes: a rule that uniquely corresponds to a business scenario, the business type corresponding to the rule, the level, and the correspondence between the rules. The first construction module is used to construct the preset switch rule decision tree based on the rule files of various business scenarios; In the preset switch rule decision tree, the nodes other than the root node and the intermediate node represent rules for multiple business scenarios, and the node name represents the business type. Nodes at the same level are divided into at least one group of nodes. The nodes in each group are connected sequentially by a line. The connection indicates that there is an AND relationship between the two connected nodes, an OR relationship between the nodes, and an AND relationship between the nodes connected to the intermediate node and the subtree corresponding to the intermediate node at the same level. If different business scenarios correspond to the same business type but different rules, then the same node is used to represent different rules in the switch rule decision tree. The verification module includes: A rule path determination unit is used to obtain all rule paths from the matching tree. Each rule path includes a group of nodes in each level of the matching tree and there are connections between the node groups. The node groups in each rule path are different. The determining unit is configured to determine that if each node to be verified in a rule path obtains a matching node with the same node name from the preset switch rule decision tree, and the node to be verified and its corresponding matching node are at the same level, and the attribute value matches the rule corresponding to the matching node, then the rule path is determined to match the preset switch rule decision tree, the business processing request is verified, and the business processing corresponding to the business processing request is completed.

7. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the business processing method according to any one of claims 1 to 5.

8. A computer-readable storage medium storing computer instructions thereon, characterized in that, When the instruction is executed, it implements the business processing method according to any one of claims 1 to 5.

Images