Sub-data packet generation method, apparatus, electronic device and storage medium

Abstract

This application discloses a method for generating sub-data packets, comprising the steps of: in response to a data packet splitting request, obtaining an initial data packet and a pre-configured packet splitting strategy tree corresponding to the initial data packet; inputting the first data entry in the initial data packet into the root node of the pre-configured packet splitting strategy tree; traversing the pre-configured packet splitting strategy tree; verifying the data based on information stored in intermediate nodes until reaching the leaf nodes for tagging; and finally classifying the data packets based on the tagging attributes to form the target sub-data packet. Different data packet splitting purposes can be achieved by configuring different packet splitting strategy trees, with minimal changes to the main process algorithm calls. It also provides corresponding devices, electronic devices, and computer-readable storage media.

Description

Technical Field

[0001] This application relates to the technical field of computer networks, and more specifically to a method for generating sub-data packets. Additionally, this application also relates to related apparatus, electronic devices, and computer-readable storage media. Background Technology

[0002] With the development of the Internet era, the amount of data has exploded. Enterprise internal data is flexible and ever-changing. In order to adapt to different business purposes, it is necessary to filter and package the data. In the existing technology, manual filtering and packaging are often used, which is costly, error-prone and inefficient. Alternatively, targeted batch processing programs can be written based on the attributes of data packets, but they are not very adaptable to different data packet requirements.

[0003] The background description is provided for the purpose of understanding the relevant technologies in this field and is not intended as an admission of prior art. Summary of the Invention

[0004] Therefore, embodiments of the present invention aim to provide a sub-data packet generation method that, when adding data attributes or data variables to meet different data packet requirements, can effectively reduce development workload while keeping the main process unchanged or requiring minimal modification, thus exhibiting high flexibility and adaptability. Specifically, embodiments of the present invention provide a sub-data packet generation method, including the following steps:

[0005] In response to a data packet splitting request, an initial data packet and a pre-configured packet splitting strategy tree corresponding to the initial data packet are obtained. The data packet includes multiple first data entries, each first data entry has multiple data attributes, the leaf nodes of the pre-configured packet splitting strategy tree store tagging attributes, the intermediate nodes of the pre-configured packet splitting strategy tree store verification attributes, verification attribute values ​​and verification operation identifiers, and the root node of the pre-configured packet splitting strategy tree is a data entry input node.

[0006] The first data entry in the initial data packet is input into the root node of the pre-configured packet splitting strategy tree. The pre-configured packet splitting strategy tree is traversed. When the current node is determined to be the root node, the first data entry input into the current node is output to the child node of the current node. When the current node is determined to be an intermediate node, the verification attribute, verification attribute value and verification operation identifier stored in the current node are obtained. The verification attribute, verification attribute value and verification operation function corresponding to the verification operation identifier are used to perform verification operation on the first data entry input into the current node. If the verification passes, the first data entry is input into the child node of the current node. If the verification fails, the first data entry is input into the remaining sibling nodes of the current node. When the current node is determined to be a leaf node, the first data entry input into the current node is tagged using the tagging attribute stored in the leaf node to generate the second data entry.

[0007] Based on the tagging attributes in the second data entry, the second data entry is classified, and target sub-data packets are generated.

[0008] In some embodiments of the present invention, the data packet splitting request includes an initial data packet name and a packet splitting policy name, and the step of obtaining the initial data packet and the pre-configured packet splitting policy tree corresponding to the initial data packet in response to the data packet splitting request includes:

[0009] Based on the data packet name, obtain the corresponding initial data packet;

[0010] Based on the packet sub-strategy name, obtain the corresponding pre-configured packet sub-strategy tree.

[0011] In some embodiments of the present invention, obtaining the corresponding pre-configured packet splitting strategy tree based on the packet splitting strategy name includes:

[0012] If the initial data packet type is obtained, and the applicable data packet type of the pre-configured packet strategy tree corresponding to the packet strategy name matches the initial data packet type, the corresponding pre-configured packet strategy tree is obtained according to the packet strategy name.

[0013] In some embodiments of the present invention, the verification attributes stored in the intermediate nodes that are siblings in the pre-configured packet sub-strategy tree are consistent.

[0014] In some embodiments of the present invention, during the traversal of the pre-configured packet strategy tree, the method further includes determining that the current node and its sibling nodes are intermediate nodes, and using the verification attributes, verification attribute values, and verification operation functions corresponding to the stored verification operation identifiers stored in the current node and its sibling nodes to perform verification operations on the first data entries input to the current node and its sibling nodes. If all verifications fail, an alarm message is output.

[0015] In some embodiments of the present invention, the step of performing a verification operation on the first data entry input to the current node using the verification attribute, the verification attribute value, and the verification operation function corresponding to the verification operation identifier includes:

[0016] Based on the verification attribute, obtain the corresponding data attribute value from the first data entry;

[0017] Based on the verification operation identifier, call the verification operation function corresponding to the verification operation identifier;

[0018] The data attribute value and the verification attribute value are substituted into the verification operation function to perform the verification operation.

[0019] In some embodiments of the present invention, the response to the data packet splitting request includes:

[0020] In response to the pre-configured sub-packet strategy tree setting request, obtain the verification attributes, verification attribute values, and verification operation types of each intermediate node;

[0021] The verification attribute, the verification attribute value, and the verification operation identifier corresponding to the verification operation type are stored in the intermediate node corresponding to the pre-configured sub-packet strategy tree;

[0022] Obtain the tagging attributes of the leaf nodes and store the tagging attributes in the leaf nodes of the pre-configured packet splitting strategy tree.

[0023] In some embodiments of the present invention, the step of classifying the second data entry according to the tagging attributes in the second data entry and generating a target sub-data packet includes:

[0024] Group second data entries with the same tagging attributes into one category to generate target sub-data packets.

[0025] This invention also provides a method for generating intelligent customer service tasks, including:

[0026] Obtain the customer data packet, use the customer data packet as the initial data packet, and generate the target sub-data packet using the method described above;

[0027] Based on the tagging attributes of the target sub-data packet, generate an intelligent customer service task corresponding to the tagging attributes.

[0028] In this embodiment of the invention, a sub-data packet generation apparatus is also provided, comprising: an acquisition device, a tagging device, and a classification device, wherein,

[0029] The acquisition device is configured to acquire an initial data packet and a pre-configured packet splitting strategy tree corresponding to the initial data packet in response to a data packet splitting request. The data packet includes multiple first data entries, each first data entry has multiple data attributes, the leaf nodes of the pre-configured packet splitting strategy tree store tagging attributes, the intermediate nodes of the pre-configured packet splitting strategy tree store verification attributes, verification attribute values ​​and verification operation identifiers, and the root node of the pre-configured packet splitting strategy tree is a data entry input node.

[0030] The tagging device is configured to input the first data entry in the initial data packet into the root node of a pre-configured packet splitting strategy tree, traverse the pre-configured packet splitting strategy tree, and when the current node is determined to be the root node, output the first data entry input to the current node to the child node of the current node. When the current node is determined to be an intermediate node, obtain the verification attribute, verification attribute value, and verification operation identifier stored in the current node, and perform a verification operation on the first data entry input to the current node using the verification attribute, verification attribute value, and verification operation function corresponding to the verification operation identifier. If the verification passes, the first data entry is input to the child node of the current node. If the verification fails, the first data entry is input to the remaining sibling nodes of the current node, until the current node is determined to be a leaf node. Then, the tagging attribute stored in the leaf node is used to tag the first data entry input to the current node to generate a second data entry.

[0031] The classification device is configured to classify the second data entry according to the tagging attributes in the second data entry, and generate target sub-data packets.

[0032] In this embodiment of the invention, a computer-readable storage medium is provided, on which a computer program is stored, wherein the program, when executed by a processor, implements the sub-data packet generation method of any embodiment of the invention.

[0033] In an embodiment of the present invention, an electronic device is provided, comprising: a processor and a memory storing a computer program, wherein the processor is configured to execute a sub-data packet generation method of any embodiment of the present invention when running the computer program.

[0034] This invention proposes a sub-data packet generation method and apparatus. Based on a data packet splitting request, an initial data packet and a pre-configured packet splitting strategy tree are obtained. First data entries from the initial data packet are input one by one into the root node of the packet splitting strategy tree. Each intermediate node of the strategy tree is traversed, and data verification is performed on the first data entries based on the verification attributes, verification attribute values, and verification algorithm identifiers stored in the intermediate nodes. The verification results are output to sibling nodes or child nodes until the first data entries are output to leaf nodes. Based on the tagging attributes stored in the leaf nodes, the first data entries are tagged to generate second data entries. Finally, all first data entries in the initial data packet are tagged. The second data entries are then classified according to the tagging attributes to form a target sub-data packet. In this application, a corresponding function is retrieved from a function library based on the verification algorithm identifier, and the corresponding data attribute values ​​and verification attribute values ​​from the first data entries are input into the verification function for verification. Different packet splitting strategies can be configured to achieve different data packet splitting purposes for different data packet requirements (e.g., different verification attributes). The main process algorithm calls are changed less. When adding attributes to data entries, intermediate nodes can be added to the basic packet splitting strategy tree to quickly perform packet splitting.

[0035] Other optional features and technical effects of the embodiments of the present invention are partly described below and partly apparent from reading this document. Attached Figure Description

[0036] Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings. The elements shown are not limited to the scale shown in the drawings, and the same or similar reference numerals in the drawings denote the same or similar elements, wherein:

[0037] Figure 1 The system architecture diagram of the sub-data packet generation system is shown;

[0038] Figure 2 This diagram illustrates a partial structure of the pre-configured sub-packet strategy tree.

[0039] Figure 3 An exemplary flowchart of a sub-data packet generation method according to an embodiment of the present invention is shown;

[0040] Figure 4 An exemplary flowchart of obtaining the initial data packet and the pre-configured packet sub-data packet generation method according to an embodiment of the present invention is shown;

[0041] Figure 5 This diagram illustrates the structure of another pre-configured packet sub-strategy tree.

[0042] Figure 6 An exemplary flowchart of a sub-data packet generation method according to other embodiments of the present invention is shown;

[0043] Figure 7 A partial exemplary flowchart of the sub-data packet generation method according to an embodiment of the present invention is shown;

[0044] Figure 8 An exemplary flowchart of a sub-data packet generation method according to other embodiments of the present invention is shown;

[0045] Figure 9 An exemplary structural schematic diagram of a sub-data packet generation apparatus according to an embodiment of the present invention is shown;

[0046] Figure 10 An exemplary structural schematic diagram of an electronic device capable of implementing the method according to an embodiment of the present invention is shown. Detailed Implementation

[0047] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to specific embodiments and accompanying drawings. Here, the illustrative embodiments and descriptions of this invention are used to explain the invention, but are not intended to limit the invention.

[0048] In this embodiment of the invention, "JSON" is a lightweight data exchange format. "MySQL" refers to a relational database. "Distributed lock" refers to a mechanism that controls the orderly operation of shared resources in a distributed system and maintains data consistency through mutual exclusion. "Java" refers to an object-oriented programming language. "Tag" refers to labeling data attribute fields on data entries.

[0049] The inventors discovered that after credit products are issued, when performing batch processing on credit data, it is necessary to filter the data under multiple conditions and at multiple levels (or distribute and filter data according to specified conditions). This involves using functions such as equal to, not equal to, less than, greater than, contain, contain only, not contain, and T-functions to aggregate and group data that meets the conditions. The following technical problems exist during each batch processing:

[0050] A) Each time a new variable is added, the development workload increases;

[0051] B) Each time a new calculation method is added, the main process is significantly modified.

[0052] Therefore, the inventors have developed a method for data segmentation using a pre-configured strategy tree. Users can define valid variables for the data, perform calculations on these variables, support multiple condition configurations, and the data will be effectively filtered according to the parameters configured in the strategy tree. Then, the data will be personalized, satisfying various enterprise data filtering needs. Specifically, for example... Figure 1As shown, this embodiment of the invention provides a sub-data generation system 100, including a configuration terminal 110, a sub-packet request terminal 120, a server terminal 130, and a database 140. The configuration personnel operate the configuration terminal 110 to access the server terminal 130 to configure the sub-packet strategy tree. The server terminal 130 generates a pre-configured sub-packet strategy tree and stores it in the database 140. The leaf nodes of the pre-configured sub-packet strategy tree store tagging attributes, and the intermediate nodes store verification attributes, verification attribute values, and verification operation identifiers. The root node in the data entry tree is the data entry input node. The database 140 can also store data packets, including initial data packets, sub-data packets after packetization, etc. Each data packet includes multiple first data entries, each with multiple data attributes. The sub-data packets after packetization have multiple second data entries. The packetization request terminal 120 can upload data packets to the database 140 and access the server 130, sending a data packetization request to the server 130. The server 130 obtains the pre-configured packetization strategy tree and the initial data packet from the database 140. The initial data packet is processed by packet segmentation. During segmentation, the first data entry in the initial data packet is input into the root node of the pre-configured packet segmentation strategy tree. The pre-configured packet segmentation strategy tree is traversed. If the current node is the root node, the first data entry input to the current node is output to the child node of the current node. If the current node is an intermediate node, the verification attribute, verification attribute value, and verification operation identifier stored in the current node are obtained. The verification attribute, verification attribute value, and verification operation function corresponding to the verification operation identifier are used to perform a verification operation on the first data entry input to the current node. If the verification passes, the first data entry is input into the child node of the current node. If the verification fails, the first data entry is input into the remaining sibling nodes of the current node. This process continues until the current node is determined to be a leaf node. The first data entry input to the current node is tagged using the tagging attribute stored in the leaf node to generate a second data entry. The second data entry is classified according to the tagging attribute, a target sub-data packet is generated, and the target sub-data packet is stored in the database 140. The packet segmentation result is fed back to the packet segmentation request terminal 120.

[0053] In some embodiments of the present invention, the data packet splitting request includes an initial data packet name and a packet splitting strategy name. In response to the data packet splitting request, the server 130 obtains the corresponding initial data packet according to the data packet name and obtains the corresponding pre-configured packet splitting strategy tree according to the packet splitting strategy name.

[0054] In some embodiments of the present invention, the server 130 further performs data packet splitting request verification. Specifically, the server 130 also obtains the initial data packet type, and determines whether the applicable data packet type of the pre-configured packet splitting strategy tree corresponding to the packet splitting strategy name matches the initial data packet type. If the data packet type matches the initial data packet type, the server obtains the corresponding pre-configured packet splitting strategy tree according to the packet splitting strategy name. If the data packet type does not match, an error message is displayed. For example, the packet splitting request terminal 120 requests to split the credit customer data packet using the first pre-configured packet splitting strategy tree. The data packet type of the credit customer data packet is customer type, and the data type that can be split by the first pre-configured packet splitting strategy tree includes customer type, which matches the data packet type of the credit customer data packet. Then, the server 130 obtains the corresponding first pre-configured packet splitting strategy tree according to the packet splitting strategy name. For example, the packet requesting end 120 requests to use the second pre-configured packet splitting strategy tree to split the credit customer data packet. The data packet type of the credit customer data packet is customer type. The data types that can be split according to the second pre-configured packet splitting strategy tree include behavior types but not customer types, so there is no match. The server end 130 generates an alarm message and returns it to the packet requesting end 120.

[0055] In some embodiments of the present invention, the verification attributes stored in the intermediate nodes that are siblings in the pre-configured packet splitting strategy tree are consistent. For example, as... Figure 2 As shown, the child nodes of node A are: node A-1, node A-2, and node A-3. They are sibling nodes and store the customer's region information as the verification attribute. The verification attribute value stored by node A-1 is Beijing, the verification attribute value stored by node A-2 is Shanghai, and the verification attribute value stored by node A-3 is Shenzhen.

[0056] In some embodiments of the present invention, the server 130, during the traversal of the pre-configured packet splitting strategy tree, also performs the following processing: It determines that the current node and its sibling nodes are intermediate nodes, and uses the verification attributes, verification attribute values, and verification operation functions corresponding to the stored verification operation identifiers stored in the current node and its sibling nodes to perform verification operations on the first data entry input to the current node and its sibling nodes. If all verifications fail, an alarm message is output. For example, if the customer's location information in the first data entry is Hangzhou, and the child nodes of the current node A include: node A-1, node A-2, and node A-3, and nodes A-1, A-2, and A-3 are sibling nodes, the verification attribute value stored in node A-1 is Beijing, the verification attribute value stored in node A-2 is Shanghai, and the verification attribute value stored in node A-3 is Shenzhen, and the customer's location information in the first data entry is Hangzhou, and all the information stored in the three nodes fails verification, then an alarm message is output to the packet splitting request terminal 120.

[0057] In some embodiments of the present invention, when the server 130 performs a verification operation on the first data entry input to the current node using the verification attribute, the verification attribute value, and the verification operation function corresponding to the verification operation identifier, the specific processing is as follows: Based on the verification attribute, the corresponding data attribute value is obtained from the first data entry; based on the verification operation identifier, the verification operation function corresponding to the verification operation identifier is called; the data attribute value and the verification attribute value are substituted into the verification operation function for verification operation. For example, when verifying node A-1, the verification attribute is customer location information, the verification operation identifier is "contain", and the verification attribute value is Beijing. The server 130 obtains the corresponding data attribute value "Beijing" from the first data entry based on the verification attribute, calls the "contain" verification function based on the identifier "contain", inputs the data attribute value "Beijing" and the verification attribute value "Beijing" into the "contain" verification function, and if the verification result is passed, the first data entry is input to the child node of node A-1.

[0058] In some embodiments of the present invention, the configuration terminal 110 sends a pre-configured packet sub-strategy tree setting request to the server terminal 130. In response to the pre-configured packet sub-strategy tree setting request, the server terminal 130 obtains the verification attributes, verification attribute values, and verification operation types of each intermediate node from the configuration terminal 110; stores the verification attributes, verification attribute values, and verification operation identifiers corresponding to the verification operation types in the intermediate nodes corresponding to the pre-configured packet sub-strategy tree; obtains the tagging attributes of the leaf nodes from the configuration terminal 110, stores the tagging attributes in the leaf nodes of the pre-configured packet sub-strategy tree, updates the pre-configured packet sub-strategy tree, and stores the updated pre-configured packet sub-strategy tree in the database 140.

[0059] In some embodiments of the present invention, the server 130 classifies the second data entries according to the tagging attributes in the second data entries and generates target sub-data packets. Specifically, the following processing is adopted: second data entries with the same tagging attributes are grouped into one category to generate target sub-data packets. For example, the initial data packet P is used to generate target sub-data packets P-1, P-2, P-3, etc.

[0060] In some embodiments of the present invention, the server 130 is developed using Java and deployed using microservices. Data is processed in packets through inter-microservice call strategies, and data is processed by scheduling task shards to improve data processing speed. Distributed locks are used as a flow control mechanism to ensure data consistency. Local caching is used to cache data, improving data throughput. The database 140 can be a MySQL database.

[0061] The sub-data packet generation system in this embodiment of the invention obtains an initial data packet and a pre-configured packet splitting strategy tree according to a data packet splitting request. It inputs each first data entry from the initial data packet into the root node of the packet splitting strategy tree, traverses each intermediate node of the strategy tree, and performs data verification on the first data entries based on the verification attributes, verification attribute values, and verification algorithm identifiers stored in the intermediate nodes. The verification results are output to sibling nodes or child nodes until the first data entries are output to leaf nodes. Based on the tagging attributes stored in the leaf nodes, the first data entries are tagged to generate second data entries. Finally, all first data entries in the initial data packet are tagged. The second data entries are then classified according to the tagging attributes to form a target sub-data packet. In this application, the corresponding function is retrieved from the function library based on the verification algorithm identifier, and the corresponding data attribute values ​​and verification attribute values ​​from the first data entries are input into the verification function for verification. Different packet segmentation strategy trees can be configured to achieve different data segmentation purposes for different data packet requirements (e.g., different verification attributes). The main process algorithm calls require minimal changes. When adding attributes to data entries, intermediate nodes can be added to the basic packet segmentation strategy tree for quick packet processing. This ensures that adding variables does not increase development workload; adding calculation methods requires little or no modification to the main process; and microservices decouple the system, freeing it from business constraints.

[0062] like Figure 3 As shown, this embodiment of the invention provides a sub-data packet generation method, including the following steps:

[0063] S110: In response to a data packet splitting request, obtain an initial data packet and a pre-configured packet splitting strategy tree corresponding to the initial data packet, wherein the data packet includes multiple first data entries, each first data entry has multiple data attributes, the leaf nodes in the pre-configured packet splitting strategy tree store tagging attributes, the intermediate nodes in the pre-configured packet splitting strategy tree store verification attributes, verification attribute values ​​and verification operation identifiers, and the root node in the pre-configured packet splitting strategy tree is a data entry input node;

[0064] In some embodiments of the present invention, the data packet splitting request includes an initial data packet name and a packet splitting strategy name, such as... Figure 4 As shown, the step of responding to a data packet splitting request and obtaining an initial data packet and a pre-configured packet splitting strategy tree corresponding to the initial data packet includes:

[0065] S111: Obtain the corresponding initial data packet based on the data packet name;

[0066] S112: Obtain the corresponding pre-configured sub-packet strategy tree based on the sub-packet strategy name.

[0067] For example, the initial data packet name is "Credit Customer Data Packet," and the packet sub-strategy name is "Regional Overdue Sub-strategy." Based on the name "Credit Customer Data Packet," the corresponding credit customer data packet is retrieved from the database. Based on the name "Regional Overdue Sub-strategy," the corresponding pre-configured regional overdue sub-strategy tree is retrieved from the database.

[0068] Strategy tree Figure 5 As shown, the child nodes of root node A include: node A-1, node A-2, and node A-3, which are sibling nodes. The stored verification attributes are all customer location information. Node A-1 stores the verification attribute value as Beijing, node A-2 stores the verification attribute value as Shanghai, and node A-3 stores the verification attribute value as Shenzhen. The verification operation identifier stored by nodes A-1, A-2, and A-3 is "eq" (equal), and the corresponding verification function is the equals function (used to verify whether characters are equal). Node A-1's child nodes include: Node A-1-1 and Node A-1-2. Node A-2's child nodes include: Node A-2-1 and Node A-2-2. Node A-3's child nodes include: Node A-3-1 and Node A-3-2. Taking Node A-1's child nodes as an example, Node A-1-1 and Node A-1-2 both store the overdue days attribute, with a value of 7 days. Node A-1-1 stores the verification operation identifier "gt" (greater than), and the corresponding verification operation function is greater than. The `than` function (used to check if something is greater than a check attribute value) is used. Node A-1-2 stores the check operation identifier "st&eq" (less than or equal to), and the corresponding check operation function is `smaller than&equal` (used to check if something is less than or equal to a check attribute value). Node A-1-1's child node is the leaf node A-1-1-L, storing the tag attribute: Beijing overdue customer. Node A-1-2's child node is the leaf node A-1-1-L, storing the tag attribute: Beijing non-overdue customer. Node A-2-1's child node is the leaf node A-2-1-L, storing the tag attribute: Shanghai overdue customer. Node A-2-2's child node is the leaf node A-2-1-L, storing the tag attribute: Shanghai non-overdue customer. Node A-3-1's child node is the leaf node A-3-1-L, storing the tag attribute: Shenzhen overdue customer. Node A-3-2's child node is the leaf node A-3-1-L, storing the tag attribute: Shenzhen non-overdue customer.

[0069] The format of the credit customer data package is shown in Table 1 below. It includes 5 first data entries, and the data attributes of each first data entry include: name, customer location information, and number of overdue days.

[0070] Table 1 Credit Customer Data Package

[0071]

[0072]

[0073] In some embodiments of the present invention, obtaining the corresponding pre-configured packet splitting strategy tree based on the packet splitting strategy name includes:

[0074] If the initial data packet type is obtained, and the applicable data packet type of the pre-configured packet splitting policy tree corresponding to the packet splitting policy name matches the initial data packet type, then the corresponding pre-configured packet splitting policy tree is obtained according to the packet splitting policy name. This avoids using a mismatched packet splitting policy tree, which could lead to packet splitting errors.

[0075] For example, if the initial data packet is a credit customer data packet, and the packet splitting strategy name indicates that packet splitting is performed using a first pre-configured packet splitting strategy tree, and the data packet type of the credit customer data packet is customer type, and the subdivisible data types corresponding to the first pre-configured packet splitting strategy tree include customer type, matching the data packet type of the credit customer data packet, then the corresponding first pre-configured packet splitting strategy tree is obtained based on the packet splitting strategy name. As another example, if the initial data packet is a credit customer data packet, and the packet splitting strategy name indicates that packet splitting is performed using a second pre-configured packet splitting strategy tree, and the data packet type of the credit customer data packet is customer type, and the subdivisible data types corresponding to the second pre-configured packet splitting strategy tree include behavior type but not customer type, then there is a mismatch, and an alarm message is generated.

[0076] In some embodiments of the present invention, the verification attributes stored in the intermediate nodes that are siblings in the pre-configured packet subdivision strategy tree are consistent. This ensures that the dimensions are the same in each subdivision of packets, thus guaranteeing the orderliness of packet subdivision.

[0077] For example, such as Figure 5 As shown, the child nodes of node A are: node A-1, node A-2, and node A-3. They are sibling nodes and store the customer's region information as the verification attribute. The verification attribute value stored by node A-1 is Beijing, the verification attribute value stored by node A-2 is Shanghai, and the verification attribute value stored by node A-3 is Shenzhen.

[0078] S120: Input the first data entry in the initial data packet into the root node of the pre-configured packet splitting strategy tree, and traverse the pre-configured packet splitting strategy tree; when the current node is determined to be the root node, output the first data entry input to the current node to the child node of the current node; when the current node is determined to be an intermediate node, obtain the verification attribute, verification attribute value and verification operation identifier stored in the current node, and use the verification attribute, verification attribute value and verification operation function corresponding to the verification operation identifier to perform verification operation on the first data entry input to the current node. If the verification passes, input the first data entry into the child node of the current node; if the verification fails, input the first data entry into the remaining sibling nodes of the current node until the current node is determined to be a leaf node. Use the tagging attribute stored in the leaf node to tag the first data entry input to the current node to generate a second data entry; traverse and input the first data entry into the pre-configured packet splitting strategy tree, and finally output it to the corresponding leaf node for tagging.

[0079] Taking the first data entry in the credit customer data package in Table 1 as an example, for instance, inputting the first data entry with sequence number 1 into... Figure 5 In the pre-configured allocation strategy tree shown, the data is first input to the root node A. If A is identified as the root node, the first data entry with sequence number 1 is input to its child node A-1. The verification attribute of node A-1 is obtained as customer location information, with a verification attribute value of Beijing and a verification operation identifier of "eq". The corresponding equal verification function is called. The data attribute (customer location information): Beijing, and the verification attribute value: Beijing, corresponding to the first data entry with sequence number 1, are input into the equal verification function. If the verification passes, the first data entry with sequence number 1 is input to the child node A-1-1 of node A-1. Using a similar approach, if the verification of overdue days greater than 7 days fails, the first data entry with sequence number 1 is input to its sibling node A-1-2. If the verification of overdue days less than or equal to 7 days passes, the first data entry with sequence number 1 is input to the child node A-1-2, which is identified as a leaf node. It is then tagged with the attribute: Beijing non-overdue customer. The tagged first data entry becomes the second data entry. Using a similar traversal and judgment method, the first data entries with serial numbers 1 to 4 in Table 1 are all generated into second data entries, as shown in Table 2.

[0080] Table 2 Credit Customer Data Packages After Tagging

[0081]

[0082] In some embodiments of the present invention, such as Figure 6 As shown, the process of traversing the pre-configured packet splitting strategy tree also includes:

[0083] S120-1: Determine that the current node and its sibling nodes are intermediate nodes, and use the verification attributes, verification attribute values, and verification operation functions corresponding to the stored verification operation identifiers stored in the current node and its sibling nodes to perform verification operations on the first data entry input to the current node and its sibling nodes. If all verifications fail, output an alarm message.

[0084] For example, in the first data entry with serial number 5 in Table 1, the verification operation corresponding to nodes A-1, A-2, and A-3 fails because the data attribute (customer region information) "Hangzhou" is not equal to the verification attribute value "Beijing", "Shanghai", or "Shenzhen". Therefore, an alarm message is output.

[0085] In some embodiments of the present invention, such as Figure 7 As shown, the step of performing a verification operation on the first data entry input to the current node using the verification attribute, the verification attribute value, and the verification operation function corresponding to the verification operation identifier includes:

[0086] S121: Obtain the corresponding data attribute value from the first data entry according to the verification attribute;

[0087] S122: Invoke the verification operation function corresponding to the verification operation identifier according to the verification operation identifier;

[0088] S123: Substitute the data attribute value and the verification attribute value into the verification operation function to perform the verification operation.

[0089] For example, input the first data entry with serial number 1 into node A-1, obtain the validation attribute of node A-1 as customer region information, the validation attribute value as "Beijing", and the validation operation identifier as "eq". Based on the validation attribute as customer region information, obtain the corresponding data attribute (customer region information) as "Beijing" from the first data entry with serial number 1. Based on the validation operation identifier "eq", call the equal validation function, input the data attribute (customer region information) corresponding to the first data entry with serial number 1 as "Beijing" and the validation attribute value as "Beijing" into the equal validation function, and obtain the result that the validation passed.

[0090] S130: Based on the tagging attributes in the second data entry, classify the second data entry and generate the target sub-data packet.

[0091] In some embodiments of the present invention, the step of classifying the second data entry according to the tagging attributes in the second data entry and generating a target sub-data packet includes:

[0092] Group second data entries with the same tagging attributes into one category to generate target sub-data packets.

[0093] For example, the second data entries with serial numbers 1 and 4 in Table 2 are grouped together to generate target sub-data packets.

[0094] In some embodiments of the present invention, such as Figure 8 As shown, the response prior to the data packet splitting request includes:

[0095] S101: In response to the pre-configured sub-packet strategy tree setting request, obtain the verification attributes, verification attribute values ​​and verification operation types of each intermediate node;

[0096] S102: Store the verification attribute, the verification attribute value, and the verification operation identifier corresponding to the verification operation type into the intermediate node corresponding to the pre-configured sub-packet strategy tree;

[0097] S103: Obtain the tagging attributes of the leaf nodes and store the tagging attributes in the leaf nodes of the pre-configured packet splitting strategy tree.

[0098] by Figure 5 Taking the pre-configured allocation strategy tree as an example, the configuration personnel sequentially input the verification attributes, verification attribute values, and verification operation types of nodes A-1, A-2, and A-3. After clicking "OK," the verification attributes, verification attribute values, and verification operation identifiers corresponding to the verification operation types are stored in the intermediate nodes A-1, A-2, and A-3 of the pre-configured sub-packet strategy tree. Then, the configuration personnel input the verification attributes, verification attribute values, and verification operation types of nodes A-1-1, A-1-2, A-2-1, A-2-2, A-3-1, and A-3-2. After clicking "OK," the verification attributes, verification attribute values, and verification operation identifiers corresponding to the verification operation types are stored in the intermediate nodes A-1-1, A-1-2, A-2-1, A-2-2, A-3-1, and A-3-2 of the pre-configured sub-packet strategy tree. The configuration personnel input the tagging attributes of the leaf nodes A-1-1-L, A-1-2-L, A-2-1-L, A-2-2-L, A-3-1-L, and A-3-2-L, and store the tagging attributes into the leaf nodes A-1-1-L, A-1-2-L, A-2-1-L, A-2-2-L, A-3-1-L, and A-3-2-L of the pre-configured packet splitting strategy tree.

[0099] The sub-data packet generation method in this embodiment of the invention obtains an initial data packet and a pre-configured packet splitting strategy tree according to a data packet splitting request. The first data entries in the initial data packet are input one by one into the root node of the packet splitting strategy tree. Each intermediate node of the strategy tree is traversed, and the first data entries are validated according to the verification attributes, verification attribute values, and verification algorithm identifiers stored in the intermediate nodes. The validation results are output to sibling nodes or child nodes until the first data entries are output to leaf nodes. The first data entries are tagged according to the tagging attributes stored in the leaf nodes to generate second data entries. Finally, all first data entries in the initial data packet are tagged. The second data entries are classified according to the tagging attributes to form a target sub-data packet. In this application, the corresponding function is retrieved from the function library according to the verification algorithm identifier, and the corresponding data attribute values ​​and verification attribute values ​​in the first data entries are input into the verification function for validation. Different packet splitting strategies can be configured to achieve different data packet splitting purposes for different data packet requirements (e.g., different verification attributes). The main process algorithm calls are changed less. When adding attributes to data entries, intermediate nodes can be added to the basic packet splitting strategy tree to quickly perform packet splitting.

[0100] The initial data packet in this embodiment of the invention includes financial customer attribute data packets, financial customer behavior data packets, financial customer credit data packets, etc., which are classified according to their data attributes to form multiple target sub-data packets.

[0101] In a specific application embodiment of the present invention, the sub-data packet generation method of the present invention can be used as the underlying technical support for data operations of various businesses. For example, it can be used for intelligent customer service projects such as "intelligent post-loan management" and "intelligent decision-making." Specifically, batch processing can be performed on the case data of the two projects, "intelligent post-loan management" and "intelligent decision-making," that is, the existing data can be periodically processed in sub-packages.

[0102] More specifically, an exemplary implementation of intelligent customer service can be as follows:

[0103] A) Configure a packet splitting strategy tree with JSON as the data structure. This strategy tree determines whether to make a call, which template to use, and whether the data is closed based on the data attributes in the data entry. It splits the data into packets based on the data attributes: operator, number of calls, number of connections, and outbound call interval, and then determines whether to make a call. Theoretically, all data attributes in the data entry can be configured in the strategy tree, and the strategy tree can be configured based on the data attributes.

[0104] B) For cases where the strategy is to be executed, perform data concatenation and combine different data attributes under the same data entry.

[0105] C) The method in this embodiment of the invention is called to perform calculations. If the current node is hit, the calculation is performed on the next node (the child node of the current node). If the current node is not hit, the calculation is performed on the sibling node until the leaf node is reached.

[0106] The method described in this invention has the following advantages: it reduces the workload of developers, thus reducing costs and increasing efficiency, as it requires no modification to the core code, thereby reducing the accident rate; it enhances system stability, robustness, and scalability; and it has a high degree of automation. Through strategy copying and downloading, it can be reused among multiple customers; it is suitable for diverse data types; and it supports diverse configurations.

[0107] In practical applications of this invention, it can provide underlying technical support for data processing in analytical decision-making projects. Specifically, it uses a JSON-formatted strategy tree configuration. Data is packetized based on the carrier, number of calls, number of connections, and outbound call interval. Then, it determines whether to make a call, setting the carrier, number of calls, number of connections, and outbound call interval onto the verification attributes of intermediate nodes. The method in this invention is then called; if the current node is hit, the next node is processed until a leaf node is reached, where it is tagged.

[0108] In this embodiment of the invention, based on the above-described sub-data packet generation method, a method for generating intelligent customer service tasks is also provided, including:

[0109] Obtain the customer data packet, use the customer data packet as the initial data packet, and generate the target sub-data packet using the method described above;

[0110] Based on the tagging attributes of the target sub-data packet, generate an intelligent customer service task corresponding to the tagging attributes.

[0111] For example, the data attributes of data entries in a customer data packet include: operator, number of calls, number of connected calls, and outbound call interval. Tagging attributes include: whether a call was made, which template was used for the call, and whether the data case is closed. Based on the data attributes, data attribute values, and verification operation identifiers, each node in the strategy tree is set. Then, the strategy tree is used to segment the data, generating target sub-data packets with tagging attributes. The tagging attributes are used to determine whether a call was made and which template was used for the call, thereby generating the corresponding intelligent customer service task. Embodiments of this invention can be applied to call center systems, automatically generating intelligent customer service tasks based on customer data, saving manpower in debt collection and notification scenarios.

[0112] In embodiments of the present invention, such as Figure 9 As shown, a sub-data packet generation device 300 includes: an acquisition device 310, a marking device 320, and a classification device 330, wherein...

[0113] The acquisition device 310 is configured to acquire an initial data packet and a pre-configured packet splitting strategy tree corresponding to the initial data packet in response to a data packet splitting request. The data packet includes multiple first data entries, each first data entry has multiple data attributes, the leaf nodes of the pre-configured packet splitting strategy tree store tagging attributes, the intermediate nodes of the pre-configured packet splitting strategy tree store verification attributes, verification attribute values ​​and verification operation identifiers, and the root node of the pre-configured packet splitting strategy tree is a data entry input node.

[0114] The tagging device 320 is configured to input the first data entry in the initial data packet into the root node of the pre-configured packet splitting strategy tree, traverse the pre-configured packet splitting strategy tree, and when the current node is determined to be the root node, output the first data entry input to the current node to the child node of the current node; when the current node is determined to be an intermediate node, obtain the verification attribute, verification attribute value and verification operation identifier stored in the current node, and perform verification operation on the first data entry input to the current node using the verification attribute, verification attribute value and verification operation function corresponding to the verification operation identifier; if the verification passes, input the first data entry to the child node of the current node; if the verification fails, input the first data entry to the remaining sibling nodes of the current node, until the current node is determined to be a leaf node, and use the tagging attribute stored in the leaf node to tag the first data entry input to the current node to generate a second data entry;

[0115] The classification device 330 is configured to classify the second data entry according to the tagging attributes in the second data entry and generate target sub-data packets.

[0116] In some embodiments of the present invention, the acquisition device 310 is specifically configured as follows:

[0117] Based on the data packet name, obtain the corresponding initial data packet;

[0118] Based on the packet sub-strategy name, obtain the corresponding pre-configured packet sub-strategy tree.

[0119] In some embodiments of the present invention, the acquisition device 310 is further configured as follows:

[0120] If the initial data packet type is obtained, and the applicable data packet type of the pre-configured packet strategy tree corresponding to the packet strategy name matches the initial data packet type, the corresponding pre-configured packet strategy tree is obtained according to the packet strategy name.

[0121] In some embodiments of the present invention, the verification attributes stored in the intermediate nodes that are siblings in the pre-configured packet sub-strategy tree are consistent.

[0122] In some embodiments of the present invention, the marking device 320 is further configured to: during the traversal of the pre-configured sub-packet strategy tree, further comprising: determining that the current node and its sibling nodes are intermediate nodes, and using the verification attributes, verification attribute values, and verification operation functions corresponding to the stored verification operation identifiers stored in the current node and its sibling nodes to perform verification operations on the first data entries input to the current node and its sibling nodes; if all verifications fail, outputting an alarm message.

[0123] In some embodiments of the present invention, the marking device 320 is further configured to:

[0124] Based on the verification attribute, obtain the corresponding data attribute value from the first data entry;

[0125] Based on the verification operation identifier, call the verification operation function corresponding to the verification operation identifier;

[0126] The data attribute value and the verification attribute value are substituted into the verification operation function to perform the verification operation.

[0127] In some embodiments of the present invention, a strategy tree setting module 301 is further included, the strategy tree setting module 301 being configured to:

[0128] Before responding to the data packet splitting request, and in response to the pre-configured packet splitting strategy tree setting request, obtain the verification attributes, verification attribute values, and verification operation types of each intermediate node;

[0129] The verification attribute, the verification attribute value, and the verification operation identifier corresponding to the verification operation type are stored in the intermediate node corresponding to the pre-configured sub-packet strategy tree;

[0130] Obtain the tagging attributes of the leaf nodes and store the tagging attributes in the leaf nodes of the pre-configured packet splitting strategy tree.

[0131] In some embodiments of the present invention, the classification device 330 is further configured to: group second data entries with the same tagging attributes into one category to generate target sub-data packets.

[0132] In some embodiments, the sub-data packet generation apparatus may combine features of any of the sub-data packet generation methods and systems of any embodiment, and vice versa, which will not be elaborated here.

[0133] In an embodiment of the present invention, an electronic device is provided, comprising: a processor and a memory storing a computer program, wherein the processor is configured to execute a sub-data packet generation method of any embodiment of the present invention when running the computer program.

[0134] Figure 10The diagram illustrates a method for implementing embodiments of the present invention or an electronic device 1000 for implementing embodiments of the present invention. In some embodiments, more or fewer electronic devices may be included than illustrated. In some embodiments, implementation may be carried out using a single or multiple electronic devices. In some embodiments, implementation may be carried out using cloud-based or distributed electronic devices.

[0135] like Figure 10 As shown, the electronic device 1000 includes a central processing unit (CPU) 1001, which can perform various appropriate operations and processes based on programs and / or data stored in read-only memory (ROM) 1002 or programs and / or data loaded from storage portion 1008 into random access memory (RAM) 1003. The CPU 1001 can be a multi-core processor or may contain multiple processors. In some embodiments, the CPU 1001 may include a general-purpose main processor and one or more special coprocessors, such as a graphics processing unit (GPU), a neural network processor (NPU), a digital signal processor (DSP), etc. Various programs and data required for the operation of the electronic device 1000 are also stored in RAM 1003. The CPU 1001, ROM 1002, and RAM 1003 are interconnected via bus 1004. An input / output (I / O) interface 1005 is also connected to bus 1004.

[0136] The processor and memory described above are used together to execute the program stored in the memory. When the program is executed by a computer, it can implement the steps or functions of the sub-data packet generation method described in the above embodiments.

[0137] The following components are connected to I / O interface 1005: an input section 1006 including a keyboard, mouse, touchscreen, etc.; an output section 1007 including a cathode ray tube (CRT), liquid crystal display (LCD), etc., and speakers, etc.; a storage section 1008 including a hard disk, etc.; and a communication section 1009 including a network interface card such as a LAN card, modem, etc. The communication section 1009 performs communication processing via a network such as the Internet. A drive 1010 is also connected to I / O interface 1005 as needed. A removable medium 1011, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., is installed on drive 1010 as needed so that computer programs read from it can be installed into storage section 1008 as needed. Figure 10 The diagram only shows a portion of the components and does not imply that the computer system 1000 only includes... Figure 10 The components shown.

[0138] In some embodiments, the electronic device 1000 refers to a mobile terminal, including mobile phones, vehicle terminals, smart TVs, etc. Taking a mobile phone as an example, the electronic device 1000 also includes a touch screen, external speaker, gyroscope, camera, 4G / 5G antenna, and other device modules.

[0139] The systems, devices, modules, or units described in the above embodiments can be implemented by a computer or its associated components. The computer may be, for example, a mobile terminal, smartphone, personal computer, laptop computer, in-vehicle human-machine interface device, personal digital assistant, media player, navigation device, game console, tablet computer, wearable device, smart TV, Internet of Things system, smart home, industrial computer, server, or a combination thereof.

[0140] Although not shown, in embodiments of the invention, a storage medium is provided storing a computer program configured to be executed, when run, to perform the task scheduling and monitoring method of any embodiment of the invention.

[0141] Storage media in embodiments of the present invention include articles that are permanent and non-permanent, removable and non-removable, capable of storing information by any method or technology. Examples of storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.

[0142] The methods, programs, systems, apparatuses, etc., in embodiments of the present invention can be executed or implemented in one or more networked computers, or practiced in a distributed computing environment. In the embodiments of this specification, in these distributed computing environments, tasks can be performed by remote processing devices connected via a communication network.

[0143] Those skilled in the art will understand that the embodiments described in this specification can be provided as methods, systems, or computer program products. Therefore, those skilled in the art will realize that the functional modules / units or controllers and related method steps described in the above embodiments can be implemented in software, hardware, or a combination of both.

[0144] Unless explicitly stated otherwise, the actions or steps of the methods and procedures described in the embodiments of the present invention do not necessarily have to be performed in a specific order and can still achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0145] This document describes several embodiments of the present invention; however, for the sake of brevity, the descriptions of the embodiments are not exhaustive, and identical or similar features or parts between the embodiments may be omitted. In this document, "one embodiment," "some embodiments," "example," "specific example," or "some examples" refers to embodiments applicable to at least one, but not all, of the present invention. The above terms do not necessarily refer to the same embodiments or examples. Without contradiction, those skilled in the art can combine and integrate the different embodiments or examples described herein, as well as the features of the different embodiments or examples.

[0146] The exemplary systems and methods of the present invention have been specifically shown and described with reference to the above embodiments, which are merely examples of the best mode for implementing the systems and methods. Those skilled in the art will understand that various changes can be made to the embodiments of the systems and methods described herein without departing from the spirit and scope of the invention as defined in the appended claims when implementing the systems and / or methods.

Claims

1. A method for generating sub-data packets, characterized in that, include: In response to a data packet splitting request, an initial data packet and a pre-configured packet splitting strategy tree corresponding to the initial data packet are obtained. The data packet includes multiple first data entries, each first data entry has multiple data attributes, the leaf nodes of the pre-configured packet splitting strategy tree store tagging attributes, the intermediate nodes of the pre-configured packet splitting strategy tree store verification attributes, verification attribute values ​​and verification operation identifiers, and the root node of the pre-configured packet splitting strategy tree is a data entry input node. The first data entry in the initial data packet is input into the root node of the pre-configured packet splitting strategy tree. The pre-configured packet splitting strategy tree is traversed. When the current node is determined to be the root node, the first data entry input into the current node is output to the child node of the current node. When the current node is determined to be an intermediate node, the verification attribute, verification attribute value and verification operation identifier stored in the current node are obtained. The verification attribute, verification attribute value and verification operation function corresponding to the verification operation identifier are used to perform verification operation on the first data entry input into the current node. If the verification passes, the first data entry is input into the child node of the current node. If the verification fails, the first data entry is input into the remaining sibling nodes of the current node. When the current node is determined to be a leaf node, the first data entry input into the current node is tagged using the tagging attribute stored in the leaf node to generate the second data entry. Based on the tagging attributes in the second data entry, the second data entry is classified, and target sub-data packets are generated.

2. The method according to claim 1, characterized in that, The data packet splitting request includes an initial data packet name and a packet splitting strategy name. The step of responding to the data packet splitting request by obtaining the initial data packet and the pre-configured packet splitting strategy tree corresponding to the initial data packet includes: Based on the data packet name, obtain the corresponding initial data packet; Based on the packet sub-strategy name, obtain the corresponding pre-configured packet sub-strategy tree.

3. The method according to claim 2, characterized in that, The step of obtaining the corresponding pre-configured packet splitting strategy tree based on the packet splitting strategy name includes: If the initial data packet type is obtained, and the applicable data packet type of the pre-configured packet strategy tree corresponding to the packet strategy name matches the initial data packet type, the corresponding pre-configured packet strategy tree is obtained according to the packet strategy name.

4. The method according to claim 1, characterized in that, In the pre-configured packet splitting strategy tree, the verification attributes stored in the intermediate nodes that are siblings are consistent.

5. The method according to claim 1, characterized in that, During the traversal of the pre-configured packet sub-strategy tree, the process also includes determining that the current node and its sibling nodes are intermediate nodes, and using the verification attributes, verification attribute values, and verification operation functions corresponding to the stored verification operation identifiers stored in the current node and its sibling nodes to perform verification operations on the first data entries input to the current node and its sibling nodes. If all verifications fail, an alarm message is output.

6. The method according to claim 1, characterized in that, The step of performing a verification operation on the first data entry input to the current node using the verification attribute, the verification attribute value, and the verification operation function corresponding to the verification operation identifier includes: Based on the verification attribute, obtain the corresponding data attribute value from the first data entry; Based on the verification operation identifier, call the verification operation function corresponding to the verification operation identifier; The data attribute value and the verification attribute value are substituted into the verification operation function to perform the verification operation.

7. The method according to claim 1, characterized in that, The response prior to the data packet splitting request includes: In response to the pre-configured sub-packet strategy tree setting request, obtain the verification attributes, verification attribute values, and verification operation types of each intermediate node; The verification attribute, the verification attribute value, and the verification operation identifier corresponding to the verification operation type are stored in the intermediate node corresponding to the pre-configured sub-packet strategy tree; Obtain the tagging attributes of the leaf nodes and store the tagging attributes in the leaf nodes of the pre-configured packet splitting strategy tree.

8. The method according to claim 1, characterized in that, The step of classifying the second data entry based on the tagging attributes in the second data entry and generating target sub-data packets includes: Group second data entries with the same tagging attributes into one category to generate target sub-data packets.

9. A method for generating intelligent customer service tasks, characterized in that, include: Acquire a customer data packet, use the customer data packet as the initial data packet, and generate a target sub-data packet using the method of any one of claims 1 to 8; Based on the tagging attributes of the target sub-data packet, generate an intelligent customer service task corresponding to the tagging attributes.

10. A sub-data packet generation apparatus, characterized in that, include: Acquisition device, marking device, and sorting device, among which, The acquisition device is configured to acquire an initial data packet and a pre-configured packet splitting strategy tree corresponding to the initial data packet in response to a data packet splitting request. The data packet includes multiple first data entries, each first data entry has multiple data attributes, the leaf nodes of the pre-configured packet splitting strategy tree store tagging attributes, the intermediate nodes of the pre-configured packet splitting strategy tree store verification attributes, verification attribute values ​​and verification operation identifiers, and the root node of the pre-configured packet splitting strategy tree is a data entry input node. The tagging device is configured to input the first data entry in the initial data packet into the root node of a pre-configured packet splitting strategy tree, traverse the pre-configured packet splitting strategy tree, and when the current node is determined to be the root node, output the first data entry input to the current node to the child node of the current node. When the current node is determined to be an intermediate node, obtain the verification attribute, verification attribute value, and verification operation identifier stored in the current node, and perform a verification operation on the first data entry input to the current node using the verification attribute, verification attribute value, and verification operation function corresponding to the verification operation identifier. If the verification passes, the first data entry is input to the child node of the current node. If the verification fails, the first data entry is input to the remaining sibling nodes of the current node, until the current node is determined to be a leaf node. Then, the tagging attribute stored in the leaf node is used to tag the first data entry input to the current node to generate a second data entry. The classification device is configured to classify the second data entry according to the tagging attributes in the second data entry, and generate target sub-data packets.

11. A computer-readable storage medium having a computer program stored thereon, wherein, When the program is executed by the processor, it implements the method as described in any one of claims 1-9.

12. An electronic device, characterized in that, include: A processor and a memory storing a computer program, the processor being configured to perform the method of any one of claims 1-9 when running the computer program.

Images