Message verification method, device, processor and electronic device

Abstract

The present application discloses a message verification method, device, processor and electronic device. It relates to the field of financial technology. The method comprises: obtaining a message to be verified; parsing the message to be verified to obtain a field value to be verified; verifying the field value to be verified according to a preset verification table to obtain a verification result, wherein the preset verification table includes at least a plurality of field values ​​of local business data. Through the present application, the problem of poor message verification efficiency in the related art is solved.

Description

Technical Field

[0001] The present application relates to the field of financial technology, and specifically, to a message verification method, device, processor and electronic device. Background Art

[0002] Currently, there are more and more systems that interact with third-party systems through messages (such as interactions with the People's Bank of China system). If there are problems with the field content in the messages that interact with each other, such as the amount being increased by 100 times or field cross-assignment errors, the third-party system may directly reject the transaction at the least, or it may affect the customer's accounts and cause financial losses at the worst. Therefore, it is particularly important to ensure that the content of the message sent by the internal R&D system is consistent with the system business fields.

[0003] When checking whether the message content is consistent with the system business fields, the message is intercepted and parsed through XML, JSON or fixed-length parsers, and the message fields are stored in the Oracle database. Then the information in the product information table is obtained and stored, and then checked one by one through SQL keyword queries.

[0004] However, comparing and checking each field one by one according to the field checking rules is time-consuming and inefficient.

[0005] With regard to the problem of poor message checking efficiency in related technologies, no effective solution has been proposed yet. Summary of the invention

[0006] The main purpose of the present application is to provide a message checking method, device, processor and electronic device to solve the problem of poor message checking efficiency in related technologies.

[0007] In order to achieve the above-mentioned purpose, according to one aspect of the present application, a message verification method is provided. The method comprises: obtaining a message to be verified; parsing the message to be verified to obtain a field value to be verified; and verifying the field value to be verified according to a preset verification table to obtain a verification result, wherein the preset verification table includes at least a plurality of field values ​​of local business data.

[0008] Optionally, obtaining the message to be checked includes: obtaining configuration information of a message server, wherein the message server is used to transmit the message to be checked, and the configuration information includes at least: a message address of the message server, and a server type of the message server; obtaining the message to be checked according to the server type of the message server and the message address.

[0009] Optionally, parsing the message to be checked to obtain the field value to be checked includes: acquiring the message parsing rules of the message to be checked; parsing the message to be checked based on the message parsing rules to obtain the key-value pairs to be checked of the message to be checked, wherein the key-value pairs to be checked include: the field name to be checked of the message to be checked and the field value to be checked of the message to be checked.

[0010] Optionally, before obtaining the message parsing rules of the message to be checked, the method also includes: obtaining a sample message, wherein the sample message includes multiple message nodes; traversing multiple message nodes in the sample message to determine a node path; based on the node path, determining the message parsing rules, wherein the message parsing rules include at least one rule object for describing node attributes, and the rule object includes at least: the field name of the message node.

[0011] Optionally, the rule object also includes a field path determined based on the node path. After determining the message parsing rule based on the node path, the method also includes: obtaining a rule update message, wherein the rule update message is used to update the message parsing rule, and the rule update message includes multiple message nodes; querying a first parsing rule of the rule update message, wherein the first parsing rule is a determined message parsing rule; traversing multiple message nodes in the rule update message to determine a second parsing rule, wherein the second parsing rule is a message parsing rule determined according to the rule update message; comparing the number of rule objects in the first parsing rule and the second parsing rule; when the number of rule objects is the same, determining that the first parsing rule is an updated message parsing rule; when the number of rule objects is different, determining a difference rule object that exists in the second parsing rule and does not exist in the first parsing rule according to the field path, and writing the difference rule object into the first parsing rule.

[0012] Optionally, the field value to be checked is checked according to a preset check list, and the check result obtained includes: identifying whether the field to be checked exists in the preset check list, wherein the preset check list records multiple field values ​​of the local business data; if the field value to be checked exists in the preset check list, determining that the message to be checked has passed the check; if the field value to be checked does not exist in the preset check list, determining that the message to be checked has not passed the check.

[0013] Optionally, the field value to be checked is checked according to a preset check list, and the check result obtained includes: calculating the hash value to be checked of the field value to be checked; identifying whether the hash value to be checked exists in the preset check list, wherein the preset check list records a plurality of local hash values ​​of the local business data, and the local hash value is determined according to the field value of the local business data; if the hash value to be checked exists in the preset check list, determining that the message to be checked has passed the check; if the hash value to be checked does not exist in the preset check list, determining that the message to be checked has not passed the check.

[0014] In order to achieve the above-mentioned purpose, according to another aspect of the present application, a message checking device is provided. The device comprises: a first acquisition unit, used to acquire a message to be checked; a parsing unit, used to parse the message to be checked to obtain a field value to be checked; a checking unit, used to check the field value to be checked according to a preset check list to obtain a check result, wherein the preset check list includes at least a plurality of field values ​​of local business data.

[0015] In order to achieve the above-mentioned purpose, according to another aspect of the present application, a processor is provided, and the processor is used to run a program, wherein the above-mentioned message checking method is executed when the program is running.

[0016] In order to achieve the above-mentioned purpose, according to another aspect of the present application, an electronic device is provided, comprising one or more processors and a memory, wherein the memory is used to store one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the message verification method described above.

[0017] Through this application, the following steps are adopted: obtaining a message to be checked; parsing the message to be checked to obtain the field value to be checked; checking the field value to be checked according to a preset check table to obtain a check result, wherein the preset check table includes at least a plurality of field values ​​of local business data, thereby solving the problem of poor message checking efficiency in the related art. Thus, the effect of improving the message checking efficiency is achieved. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] The drawings constituting a part of the present application are used to provide a further understanding of the present application. The illustrative embodiments and descriptions of the present application are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0019] Figure 1 It is a flow chart of a message checking method provided according to an embodiment of the present application;

[0020] Figure 2It is a schematic diagram of a message acquisition device graph structure provided by the present invention;

[0021] Figure 3 It is a schematic diagram of a message parser structure provided by the present invention;

[0022] Figure 4 This is a schematic diagram of a self-learning of message parsing rules provided by the present invention Figure 1 ;

[0023] Figure 5 This is a schematic diagram of a self-learning of message parsing rules provided by the present invention Figure 2 ;

[0024] Figure 6 It is a schematic diagram of a data library structure provided by the present invention;

[0025] Figure 7 It is a schematic diagram of a data checker structure provided by the present invention;

[0026] Figure 8 is a schematic diagram of a message checking device according to an embodiment of the present application;

[0027] Fig. 9 It is a schematic diagram of an electronic device provided according to an embodiment of the present application. DETAILED DESCRIPTION

[0028] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0029] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present application.

[0030] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequential order. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present application described here. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0031] The present invention is described below in conjunction with preferred implementation steps. Figure 1 is a flow chart of a message checking method provided in accordance with an embodiment of the present application, such as Figure 1 As shown, the method comprises the following steps:

[0032] Step S102, obtaining the message to be checked;

[0033] Step S104, parsing the message to be checked to obtain the value of the field to be checked;

[0034] Step S106, checking the field values ​​to be checked according to a preset check list to obtain a check result, wherein the preset check list at least includes field values ​​of multiple local business data.

[0035] The above embodiment of the present invention adopts the following steps: obtaining a message to be checked; parsing the message to be checked to obtain a field value to be checked; checking the field value to be checked according to a preset check table to obtain a check result, wherein the preset check table includes at least a plurality of field values ​​of local business data, thereby solving the problem of poor message checking efficiency in the related art. Thus, the effect of improving the message checking efficiency is achieved.

[0036] In the above step S102, the message to be checked may be a message interacting with a third-party system.

[0037] Optionally, in the message verification method provided in the embodiment of the present application, obtaining the message to be verified includes: obtaining configuration information of a message server, wherein the message server is used to transmit the message to be verified, and the configuration information includes at least: the message address of the message server, and the server type of the message server; obtaining the message to be verified according to the server type and message address of the message server.

[0038] In the above embodiment of the present invention, the configuration information can be pre-configured by the user, and the message to be checked can be obtained from the corresponding message server according to the message address and the server type of the message server configured in the configuration information, thereby realizing the acquisition of the message to be checked.

[0039] Optionally, it is obtained from a corresponding message server through a message acquirer.

[0040] Figure 2 is a schematic diagram of a message acquisition device graph structure provided by the present invention, such as Figure 2 As shown, the message acquirer includes: message address configuration P21 and message acquisition P22.

[0041] Optionally, the message address is configured P21, and the user configures the address information of the corresponding message server in the configuration file, wherein the message acquirer supports acquisition by a message queue MQ server and a file transfer protocol FTP server.

[0042] Optionally, the message queue MQ server type needs to configure the queue manager name, channel name, receiving address, IP address, port number, character set and resolution control fields.

[0043] Optionally, the file transfer protocol FTP server needs to be configured with an IP address, user name, password, and resolution control fields.

[0044] As an optional example, the message queue MQ server needs to be configured with the following information:

[0045] "#queue manager name

[0046] QM=QMUMBFEA

[0047] #Server connection channel name

[0048] CHANNEL=SVRCONN

[0049] #Receiving address

[0050] SENDQUEN=MSGTOMBA_1

[0051] #IP address

[0052] IP = 83.41.2.200

[0053] #Port number

[0054] PORT=1428

[0055] #Character Set

[0056] CCSID=819

[0057] #Analysis overall control

[0058] Pyson=1".

[0059] As another optional example, the FTP server needs to be configured with the following information:

[0060] “#IP address

[0061] IP = 122.13.14.12

[0062] #username

[0063] USERNAME=ftpusername

[0064] #password

[0065] PASSWORD=ftppassword

[0066] #Remote Directory

[0067] PATH = / approot1 / bin / ftp /

[0068] #Analysis overall control

[0069] Pyson=2".

[0070] Optionally, the message acquisition P22 calls the message acquisition method of the message queue MQ and the file acquisition method of the file transfer protocol FTP respectively according to the server type configured by the user.

[0071] In the above step S104, the message to be checked may be parsed by using the pre-configured message parsing rules to obtain the name of the field to be checked and the value of the field to be checked of the message to be checked.

[0072] Optionally, in the message verification method provided in the embodiment of the present application, parsing the message to be verified to obtain the field value to be verified includes: obtaining the message parsing rules of the message to be verified; parsing the message to be verified based on the message parsing rules to obtain the key-value pairs to be verified of the message to be verified, wherein the key-value pairs to be verified include: the field name to be verified of the message to be verified and the field value to be verified of the message to be verified.

[0073] Optionally, the name of the field to be checked of the message to be checked is the key of the key-value pair to be checked, and the value of the field to be checked of the message to be checked is the value of the key-value pair to be checked.

[0074] The above-mentioned embodiment of the present invention can obtain the message parsing rules of the message to be checked, parse the message to be checked according to the message parsing rules, and obtain the key-value pair to be checked consisting of the field name to be checked and the field value to be checked of the message to be checked. Then, when it is necessary to check the message to be checked, it can be compared based on the field value to be checked in the message to be checked, without using the field name of the message to be checked to check word by word. In addition, compared with checking based on field name, checking based on field value is simpler and has higher checking efficiency.

[0075] Optionally, the message to be checked may be parsed by a message parser.

[0076] Figure 3 is a schematic diagram of a message parser structure provided by the present invention, such as Figure 3 As shown, the message parser includes: message parsing configuration P31, message parsing P32, message storage P33 and rule self-learning P34.

[0077] Optionally, the message parsing configuration P31 can be configured by the user for the message parsing rules of each message, or it can be automatically configured through the self-learning method provided by the rule self-learning P34, supporting fixed length, xml, and json, and storing the message parsing rules through the ini file and storing them in the parsing system.

[0078] Optionally, the message parsing rules include: field name, field Chinese description, and field path.

[0079] Optionally, the message parsing rules can be stored in a message rule file, where the message rule file is named message name.ini. The following example:

[0080] "#Field name#Field Chinese description#Field path

[0081] Testtype test type / docutment / com / sete / ddds / ttype".

[0082] Optionally, in the message checking method provided in the embodiment of the present application, obtaining the message parsing rules of the message to be checked includes: identifying the message type of the message to be checked, wherein the message type is pre-configured with a corresponding message parsing rule; and obtaining the message parsing rules corresponding to the message type.

[0083] In the above-mentioned embodiment of the present invention, in the process of selecting message parsing rules, corresponding message parsing rules can be selected according to the message type of the message to be checked for parsing, thereby realizing the selection of message parsing rules, and performing message parsing rules corresponding to different message types, so as to realize parsing of messages to be checked of various message types, thereby ensuring that the messages to be checked can be effectively parsed.

[0084] Optionally, in message parsing P32, according to the parsing master control configured in the message acquirer, for example, the inter-bank second-generation message parsing master control class, the system automatically instantiates the corresponding master control class through reflection technology, and the master control class obtains the corresponding message type according to the message header rule (master control rule configuration), queries the corresponding parsing ini file (that is, the message rule file that stores the message parsing rules) according to the message type, and parses the message to be checked through the configured message parsing rules to parse out each field.

[0085] Optionally, the message storage P33 converts the fields parsed from the message to be checked into a KV key-value pair format of {field name: field value}, with the field name as the KEY value and the field value as the VALUE value, and saves it in the mapping mapper collection.

[0086] Optionally, in the message verification method provided in the embodiment of the present application, before obtaining the message parsing rules of the message to be verified, the method also includes: obtaining a sample message, wherein the sample message includes multiple message nodes; traversing multiple message nodes in the sample message to determine the node path; based on the node path, determining the message parsing rules, wherein the message parsing rules include at least one rule object for describing node attributes, and the rule object includes at least: the field name of the message node.

[0087] The above-mentioned embodiment of the present invention can automatically identify multiple message nodes of the example message according to the pre-configured example message, determine the message parsing rule, and realize the automatic identification of the message parsing rule.

[0088] It should be noted that a message may include multiple nodes, and the multiple nodes form a tree structure. By traversing the multiple nodes in the message, the node path can be determined based on the node tree structure, and the rule object used to describe the attributes of each node can be determined based on the node path, such as determining the file name of the message node.

[0089] Optionally, one or more message nodes may have the same file name.

[0090] Optionally, the file name of the message node may be the field name of the message to be checked, such as the name of the field to be checked of the message to be checked, and then the value of the field to be checked may be determined based on the name of the field to be checked.

[0091] Optionally, rule self-learning P34, ordinary systems generally use the user to configure parsing rules for parsing. This method has the disadvantages of a large amount of manual configuration by users, and users need to be familiar with the message rules. Once the field name has spelling errors such as uppercase and lowercase, the entire message parsing will fail.

[0092] Figure 4 This is a schematic diagram of a self-learning of message parsing rules provided by the present invention Figure 1 ,like Figure 4As shown, there are corresponding example messages in general specification descriptions. Through this specification feature of the present invention, users can obtain the example messages in the message specifications, put them in the system specified directory, and run the self-learning rule function of the tool. The system will automatically traverse all child nodes in the example message, and assemble the entire node path by combining the parent nodes to form the rule details of the node path, field name, and whether there are attribute nodes. The parsed rule details are automatically stored in the rule file, and the message name is used as the rule file name. According to the parsing system filled in by the user, it is automatically placed in the corresponding system folder for subsequent parsing of the message.

[0093] Optionally, in the message verification method provided in the embodiment of the present application, the rule object also includes a field path determined based on the node path. After determining the message parsing rule based on the node path, the method also includes: obtaining a rule update message, wherein the rule update message is used to update the message parsing rule, and the rule update message includes multiple message nodes; querying the first parsing rule of the rule update message, wherein the first parsing rule is a determined message parsing rule; traversing multiple message nodes in the rule update message to determine the second parsing rule, which is a message parsing rule determined according to the rule update message; comparing the number of rule objects in the first parsing rule and the second parsing rule; when the number of rule objects is the same, determining that the first parsing rule is the updated message parsing rule; when the number of rule objects is different, determining the difference rule object that exists in the second parsing rule and does not exist in the first parsing rule according to the field path, and writing the difference rule object into the first parsing rule.

[0094] Optionally, in the process of generating message parsing rules, the message parsing rules can be updated according to the rule update message, a rule object can be added to the message parsing rule, the parsing content of the message parsing rule can be enriched, and the automatic generation of the message parsing rules can be achieved.

[0095] In the above-mentioned embodiment of the present invention, in the process of updating the message parsing rules, a new second parsing rule can be automatically generated according to the rule update message, and then the second parsing rule can be compared with the pre-generated first parsing rule to determine the number of rule objects in the first parsing rule and the second parsing rule. Furthermore, when the number of rule objects in the first parsing rule and the second parsing rule is the same, it is determined that the first parsing rule does not need to be updated; when the number of rule objects in the first parsing rule and the second parsing rule is the same, the difference rules of the rule objects in the first parsing rule and the second parsing rule are compared one by one, and the first parsing rule is updated according to the difference rules, thereby realizing the update of the first parsing rule.

[0096] Figure 5 This is a schematic diagram of a self-learning of message parsing rules provided by the present invention Figure 2 ,like Figure 5 As shown, in order to cope with the situation where message specifications are modified or the previous rules are imperfect, the system is also equipped with an automatic rule addition function. This function is mainly implemented when the entire system is running automatically. When the system obtains a new message (ie, an updated message), it enables an asynchronous thread, creates a self-learning rule object, and calls subsequent message self-learning methods.

[0097] Optionally, the self-learning method call starts by traversing the child nodes, generating a rule object according to the attribute information corresponding to each child node, including: node name, node path, and storing the rule object in array A, and the length of array A is saved as variable A'; reading the corresponding message rule file (i.e. obtaining the message parsing rule), calculating the number of file lines, and subtracting 1 to store it in variable B' as the number of existing rule objects; in the process of reading the message rule file, concatenating the node path field in the rule file through the middle symbol "|" to form the existing rule string oldRuleString; comparing A' and B', if there is any inconsistency in quantity, traversing all objects in array A, each object uses the string contains method to find the node path field of the corresponding rule object, and judging whether it exists, if it exists, skip and continue, if it does not exist, write the rule object into the rule file according to the requirements of the rule file; after the traversal is completed, save the rule file for subsequent parsing.

[0098] In the above step S106, the preset checklist is determined according to the local business data.

[0099] Optionally, when a large number of to-be-checked messages need to be checked, the multiple to-be-checked messages may be stored in a data table (such as an outbound data set) and then compared with a preset check table (ie, a local data set).

[0100] Figure 6 It is a schematic diagram of a data library structure provided by the present invention, such as Figure 6 As shown, the data library includes: data acquisition within the system P61, local data storage set P62, and external data storage set P63.

[0101] Optionally, data acquisition within the system P61: According to the acquisition script configured by the user, query the corresponding system database to obtain corresponding field information, generally obtaining local business data generated on the day.

[0102] Optionally, the local data storage set P62 obtains the local business data obtained from the system in the previous step, converts it into a KV key-value pair format, and forms a corresponding set (i.e., a preset checklist), and sets the index value {Message}:localSet (local data set) to store it in the redis set. The index value is used to mark the set as a local data set.

[0103] Optionally, the outbound data storage set P63, the message set obtained from the message parser (ie, for each message to be checked), is stored in the redis set with the index value set to {Message}:sendSet (outbound data set). The index value is used to mark the set as an outbound data set.

[0104] Optionally, in the message verification method provided in the embodiment of the present application, the field value to be checked is checked according to a preset verification table, and the verification result obtained includes: identifying whether there is a field to be checked in the preset verification table, wherein the preset verification table records the field values ​​of multiple local business data; if there is a field value to be checked in the preset verification table, determining that the message to be checked has passed the verification; if there is no field value to be checked in the preset verification table, determining that the message to be checked has not passed the verification.

[0105] In the above embodiment of the present invention, a preset check table records field values ​​of multiple local business data. By comparing whether there is a to-be-checked field value of the to-be-checked message in the preset check table, if the to-be-checked field value exists in the preset check table, it is determined that the to-be-checked message has passed the check; if the to-be-checked field value does not exist in the preset check table, it is determined that the to-be-checked message has not passed the check, thereby enabling the to-be-checked message to be checked to be checked based on the field value, thereby achieving rapid verification of the to-be-checked message.

[0106] Optionally, when the to-be-checked field value does not exist in the preset check table, the to-be-checked message is saved in a difference set (or difference table), and then the difference set (or difference table) is sent to the user.

[0107] Optionally, in the message verification method provided in the embodiment of the present application, the field value to be checked is checked according to a preset verification table, and the verification result obtained includes: calculating the hash value to be checked of the field value to be checked; identifying whether the hash value to be checked exists in the preset verification table, wherein the preset verification table records local hash values ​​of multiple local business data, and the local hash value is determined according to the field value of the local business data; if the hash value to be checked exists in the preset verification table, determining that the message to be checked has passed the verification; if the hash value to be checked does not exist in the preset verification table, determining that the message to be checked has not passed the verification.

[0108] In the above embodiment of the present invention, a preset check table records multiple hash values ​​determined according to field values ​​of local business data. By comparing whether there is a to-be-checked hash value determined according to the to-be-checked field value of the to-be-checked message in the preset check table, if the to-be-checked hash value exists in the preset check table, it is determined that the to-be-checked message has passed the check; if the to-be-checked hash value does not exist in the preset check table, it is determined that the to-be-checked message has not passed the check, thereby enabling the to-be-checked message to be checked to be checked based on the to-be-checked hash value, thereby realizing rapid verification of the to-be-checked message.

[0109] Optionally, when the hash value to be checked does not exist in the preset check table, the message to be checked is saved in a difference set (or difference table), and then the difference set (or difference table) is sent to the user.

[0110] It should be noted that ordinary data verification is basically achieved by comparing fields one by one, and if a large amount of data needs to be verified, the data is usually stored in two data tables, and the data in the two tables are compared one by one through SQL queries. Although this implementation method is simple, the resource loss caused by constantly accessing the database is also very large, and the time complexity of comparing fields one by one is high, which can easily cause the overall running time of the system to be slow.

[0111] Figure 7 Schematic diagram of a data checker structure provided by the present invention, such as Figure 7 As shown, the data verifier includes: obtaining intersection content P71, comparing error content P72, and saving error content P73.

[0112] Optionally, obtain the intersection content P71, obtain the local data set through the data library, hash each VALUE (i.e., the field value of the local business data), and store the hashed new value (i.e., the local hash value) in the hash table, traverse the hash value of the outward data set (i.e., the message to be checked) to see if it exists in the hash table. If so, put it in the collection.

[0113] Optionally, compare the error content P72, and according to the hash table in the previous step, traverse the hash value of the outgoing data set (message to be checked), compare it with the value in the hash table, and save it in the difference set if it does not exist.

[0114] Optionally, save the error content P73, save the difference set in Excel, and report the error to the user through the email sending function. The user can view the inconsistent data in the system by himself, which can be used as a basis for problem analysis to better discover defects in the system under test.

[0115] The present invention provides an automatic verification method and tool based on third-party message interaction and system product comparison, which mainly includes: a message acquirer, a message parser, a data accumulator, and a data verifier.

[0116] Optionally, the message acquirer can automatically acquire interactive messages with a third party (i.e., messages to be checked) according to a user-configured interactive message acquisition method, can support acquisition from a message queue MQ server and a file transfer protocol FTP server, and provide post-processing.

[0117] Optionally, the message parser parses the interactive message (i.e., the message to be checked) according to the message parsing rules configured by the user, and assigns the value to the mapper collection through the KV key-value pair (key:value). Users can configure different types of parsers such as fixed-length, json, xml, etc., and the system parses according to the user-configured rules. The tool is equipped with a rule automatic generation tool, which are two rule self-learning methods. Through the example message in the message specification, the system automatically traverses the nodes and generates a message rule file; after the message is obtained, it is parsed and all sub-nodes of the message are parsed. If the number of sub-nodes is inconsistent with the number of rule configurations, the message is traversed, the node rules are generated, and the rule file is supplemented.

[0118] Optionally, the data accumulator obtains product table information (i.e., local business data) according to the product table in the system configured by the user (such as a preset checklist), and stores it in a redis collection through a custom index value in the form of a KV key-value pair (key:value); the parsed mapper is converted into a KV key-value pair format collection in the configured order, and stored in a redis collection through a custom index value.

[0119] Optionally, the data verifier first obtains the intersection of two sets inside the system (i.e., the set of local business data) and outside the system (i.e., the set of messages to be verified) through the redis return intersection command, and then forms the intersection and difference sets through the hash table set comparison algorithm. If there is a difference set, an alarm is sent to the user through daily email for verification.

[0120] The technical solution provided by the present invention can intercept the actually sent message as the message to be checked, parse the message to be checked, and store the fields to be checked in the redis database by splicing through the configuration of the checking rules. Through the hash set comparison algorithm, the message sending business generated on the same day is automatically checked, which can cover the full amount of messages in the system, ensuring that the data generated by the automated script and the data generated by the manual test are checked accordingly, and the correctness of the interactive message is guaranteed. The hash set comparison algorithm can greatly improve the comparison efficiency, reduce the number of database accesses, reduce resource consumption, and more intuitively display the comparison results through the json format.

[0121] The technical solution provided by the present invention automatically generates parsing rules by means of self-learning rule generation, thereby reducing manual configuration, alleviating configuration work, and greatly improving tool use efficiency.

[0122] The message checking method provided in the embodiment of the present application adopts the following steps: obtaining the message to be checked; parsing the message to be checked to obtain the field value to be checked; checking the field value to be checked according to the preset check table to obtain the check result, wherein the preset check table at least includes the field values ​​of multiple local business data, thereby solving the problem of poor message checking efficiency in the related art. Thus, the effect of improving the message checking efficiency is achieved.

[0123] It should be noted that the steps shown in the flowcharts of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and that, although a logical order is shown in the flowcharts, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0124] The embodiment of the present application also provides a message checking device. It should be noted that the message checking device of the embodiment of the present application can be used to execute the message checking method provided in the embodiment of the present application. The message checking device provided in the embodiment of the present application is introduced below.

[0125] Figure 8 Schematic diagram of a message checking device according to an embodiment of the present application. Figure 8 As shown, the device includes: a first acquisition unit 82, used to acquire a message to be checked; a parsing unit 84, used to parse the message to be checked and obtain a field value to be checked; a checking unit 86, used to check the field value to be checked according to a preset check list to obtain a check result, wherein the preset check list includes at least multiple field values ​​of local business data.

[0126] It should be noted that the first acquisition unit 82 in this embodiment can be used to execute step S102 in the embodiment of the present application, the parsing unit 84 in this embodiment can be used to execute step S104 in the embodiment of the present application, and the checking unit 86 in this embodiment can be used to execute step S106 in the embodiment of the present application. The examples and application scenarios implemented by the above units and corresponding steps are the same, but are not limited to the contents disclosed in the above embodiments.

[0127] The above embodiment of the present invention solves the problem of poor message checking efficiency in the related art by acquiring the message to be checked; parsing the message to be checked to obtain the field value to be checked; checking the field value to be checked according to a preset check table to obtain a check result, wherein the preset check table includes at least a plurality of field values ​​of local business data, thereby achieving the effect of improving the message checking efficiency.

[0128] Optionally, in the message verification device provided in the embodiment of the present application, the acquisition unit includes: a first acquisition module, used to obtain configuration information of a message server, wherein the message server is used to transmit messages to be verified, and the configuration information includes at least: a message address of the message server, and a server type of the message server; a second acquisition module, used to obtain the message to be verified based on the server type and message address of the message server.

[0129] Optionally, in the message verification device provided in the embodiment of the present application, the parsing unit includes: a third acquisition module, used to obtain the message parsing rules of the message to be verified; a parsing module, used to parse the message to be verified based on the message parsing rules to obtain the key-value pairs to be verified of the message to be verified, wherein the key-value pairs to be verified include: the field name to be verified of the message to be verified and the field value to be verified of the message to be verified.

[0130] Optionally, in the message verification device provided in the embodiment of the present application, the third acquisition module includes: a first identification module, used to identify the message type of the message to be verified, wherein the message type is pre-configured with corresponding message parsing rules; a fourth acquisition module, used to obtain the message parsing rules corresponding to the message type.

[0131] Optionally, in the message verification device provided in the embodiment of the present application, the device also includes: a second acquisition unit, used to obtain a sample message before obtaining the message parsing rules of the message to be verified, wherein the sample message includes multiple message nodes; a traversal unit, used to traverse multiple message nodes in the sample message to determine the node path; a first determination unit, used to determine the message parsing rules based on the node path, wherein the message parsing rules include at least one rule object for describing node attributes, and the rule object includes at least: the field name of the message node.

[0132] Optionally, in the message checking device provided in the embodiment of the present application, the device also includes: a third acquisition unit, used to acquire a rule update message after determining the message parsing rule based on the node path, wherein the rule update message is used to update the message parsing rule, and the rule update message includes multiple message nodes; a query unit, used to query the first parsing rule of the rule update message, wherein the first parsing rule is a determined message parsing rule; a traversal unit, used to traverse multiple message nodes in the rule update message to determine the second parsing rule, and the second parsing rule is a message parsing rule determined according to the rule update message; a comparison unit, used to compare the number of rule objects in the first parsing rule and the second parsing rule; a second determination unit, used to determine that the first parsing rule is an updated message parsing rule when the number of rule objects is the same; an update unit, used to write the difference rule object into the first parsing rule when the number of rule objects is different and the difference rule object is determined according to the field path to exist in the second parsing rule and does not exist in the first parsing rule.

[0133] Optionally, in the message verification device provided in the embodiment of the present application, the verification unit includes: a second identification module, used to identify whether there is a field to be verified in a preset verification table, wherein the preset verification table records field values ​​of multiple local business data; a first determination module, used to determine that the message to be verified has passed the verification when there is a field value to be verified in the preset verification table; and a second determination module, used to determine that the message to be verified has not passed the verification when there is no field value to be verified in the preset verification table.

[0134] Optionally, in the message verification device provided in the embodiment of the present application, the verification unit includes: a calculation module, used to calculate the hash value to be verified of the field value to be verified; a third identification module, used to identify whether there is a hash value to be verified in a preset verification table, wherein the preset verification table records local hash values ​​of multiple local business data, and the local hash value is determined according to the field value of the local business data; a third determination module, used to determine that the message to be verified has passed the verification if the hash value to be verified exists in the preset verification table; and a fourth determination module, used to determine that the message to be verified has not passed the verification if the hash value to be verified does not exist in the preset verification table.

[0135] The message checking device provided in the embodiment of the present application obtains the message to be checked; parses the message to be checked to obtain the field value to be checked; checks the field value to be checked according to a preset check table to obtain a check result, wherein the preset check table includes at least a plurality of field values ​​of local business data, thereby solving the problem of poor message checking efficiency in the related art. Thus, the effect of improving the message checking efficiency is achieved.

[0136] The message checking device includes a processor and a memory. The above-mentioned units and modules are stored in the memory as program units, and the processor executes the above-mentioned program units stored in the memory to realize corresponding functions.

[0137] The processor includes a kernel, which retrieves the corresponding program unit from the memory. One or more kernels can be set, and the kernel parameters are adjusted to check according to the value of the field to be checked in the message, thereby achieving the purpose of improving the message checking efficiency.

[0138] The memory may include non-permanent memory in a computer-readable medium, random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM, and the memory includes at least one memory chip.

[0139] An embodiment of the present invention provides a computer-readable storage medium on which a program is stored. When the program is executed by a processor, the message checking method is implemented.

[0140] An embodiment of the present invention provides a processor, which is used to run a program, wherein the message checking method is executed when the program is running.

[0141] Fig. 9 is a schematic diagram of an electronic device provided according to an embodiment of the present application, such as Fig. 9 As shown, an embodiment of the present invention provides an electronic device 90, which includes a processor 92, a memory 94, and a program stored in the memory and executable on the processor. When the processor executes the program, the following steps are implemented: obtaining a message to be checked; parsing the message to be checked to obtain a field value to be checked; checking the field value to be checked according to a preset check list to obtain a check result, wherein the preset check list includes at least multiple field values ​​of local business data.

[0142] Optionally, the processor implements the following steps when executing the program: obtaining configuration information of a message server, wherein the message server is used to transmit messages to be verified, and the configuration information includes at least: a message address of the message server, and a server type of the message server; obtaining the message to be verified according to the server type and message address of the message server.

[0143] Optionally, when the processor executes the program, the following steps are implemented: obtaining the message parsing rules of the message to be checked; parsing the message to be checked based on the message parsing rules to obtain the key-value pairs to be checked of the message to be checked, wherein the key-value pairs to be checked include: the field name to be checked of the message to be checked and the field value to be checked of the message to be checked.

[0144] Optionally, when the processor executes the program, the following steps are implemented: identifying a message type of a message to be checked, wherein the message type is pre-configured with a corresponding message parsing rule; and obtaining a message parsing rule corresponding to the message type.

[0145] Optionally, the processor implements the following steps when executing the program: before obtaining the message parsing rules of the message to be checked, obtaining a sample message, wherein the sample message includes multiple message nodes; traversing the multiple message nodes in the sample message to determine the node path; based on the node path, determining the message parsing rules, wherein the message parsing rules include at least one rule object for describing node attributes, and the rule object includes at least: the field name of the message node.

[0146] Optionally, the rule object also includes a field path determined based on the node path, and the processor implements the following steps when executing the program: after determining the message parsing rule based on the node path, obtaining a rule update message, wherein the rule update message is used to update the message parsing rule, and the rule update message includes multiple message nodes; querying the first parsing rule of the rule update message, wherein the first parsing rule is a determined message parsing rule; traversing multiple message nodes in the rule update message to determine the second parsing rule, which is a message parsing rule determined according to the rule update message; comparing the number of rule objects in the first parsing rule and the second parsing rule; when the number of rule objects is the same, determining that the first parsing rule is the updated message parsing rule; when the number of rule objects is different, determining the difference rule object that exists in the second parsing rule and does not exist in the first parsing rule according to the field path, and writing the difference rule object into the first parsing rule.

[0147] Optionally, the processor implements the following steps when executing the program: identifying whether there is a field to be checked in a preset check list, wherein the preset check list records field values ​​of multiple local business data; if there is a field value to be checked in the preset check list, determining that the message to be checked has passed the check; if there is no field value to be checked in the preset check list, determining that the message to be checked has not passed the check.

[0148] Optionally, the processor implements the following steps when executing the program: calculating the hash value to be checked of the field value to be checked; identifying whether the hash value to be checked exists in a preset check table, wherein the preset check table records local hash values ​​of multiple local business data, and the local hash value is determined according to the field value of the local business data; if the hash value to be checked exists in the preset check table, determining that the message to be checked has passed the check; if the hash value to be checked does not exist in the preset check table, determining that the message to be checked has not passed the check.

[0149] The devices in this article can be servers, PCs, PADs, mobile phones, etc.

[0150] The present application also provides a computer program product, which, when executed on a data processing device, is suitable for executing an initialization program having the following method steps: obtaining a message to be checked; parsing the message to be checked to obtain a field value to be checked; checking the field value to be checked according to a preset check list to obtain a check result, wherein the preset check list includes at least multiple field values ​​of local business data.

[0151] Optionally, when executed on a data processing device, the program is suitable for executing initialization having the following method steps: obtaining configuration information of a message server, wherein the message server is used to transmit messages to be verified, and the configuration information includes at least: a message address of the message server, and a server type of the message server; obtaining the message to be verified according to the server type and message address of the message server.

[0152] Optionally, when executed on a data processing device, it is suitable for executing an initialization program having the following method steps: obtaining message parsing rules for the message to be checked; parsing the message to be checked based on the message parsing rules to obtain key-value pairs to be checked for the message to be checked, wherein the key-value pairs to be checked include: the name of the field to be checked for the message to be checked and the value of the field to be checked for the message to be checked.

[0153] Optionally, when executed on a data processing device, it is suitable for executing a program that is initialized with the following method steps: identifying a message type of a message to be checked, wherein the message type is pre-configured with a corresponding message parsing rule; and obtaining a message parsing rule corresponding to the message type.

[0154] Optionally, when executed on a data processing device, it is suitable for executing an initialization program having the following method steps: before obtaining the message parsing rules of the message to be checked, obtaining a sample message, wherein the sample message includes multiple message nodes; traversing the multiple message nodes in the sample message to determine the node path; based on the node path, determining the message parsing rules, wherein the message parsing rules include at least one rule object for describing node attributes, and the rule object includes at least: the field name of the message node.

[0155] Optionally, the rule object also includes a field path determined based on a node path. When executed on a data processing device, it is suitable for executing a program that is initialized with the following method steps: after determining the message parsing rule based on the node path, obtaining a rule update message, wherein the rule update message is used to update the message parsing rule, and the rule update message includes multiple message nodes; querying the first parsing rule of the rule update message, wherein the first parsing rule is a determined message parsing rule; traversing multiple message nodes in the rule update message to determine a second parsing rule, which is a message parsing rule determined according to the rule update message; comparing the number of rule objects in the first parsing rule and the second parsing rule; when the number of rule objects is the same, determining that the first parsing rule is the updated message parsing rule; when the number of rule objects is different, determining that the difference rule object exists in the second parsing rule and does not exist in the first parsing rule according to the field path, write the difference rule object into the first parsing rule.

[0156] Optionally, when executed on a data processing device, it is suitable for executing an initialization program having the following method steps: identifying whether there is a field to be checked in a preset check list, wherein the preset check list records field values ​​of multiple local business data; in case there is a field value to be checked in the preset check list, determining that the message to be checked has passed the check; in case there is no field value to be checked in the preset check list, determining that the message to be checked has not passed the check.

[0157] Optionally, when executed on a data processing device, it is suitable for executing an initialized program having the following method steps: calculating a hash value to be checked of a field value to be checked; identifying whether the hash value to be checked exists in a preset check table, wherein the preset check table records local hash values ​​of multiple local business data, and the local hash value is determined according to the field value of the local business data; if the hash value to be checked exists in the preset check table, determining that the message to be checked has passed the check; if the hash value to be checked does not exist in the preset check table, determining that the message to be checked has not passed the check.

[0158] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0159] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0160] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0161] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0162] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0163] The memory may include non-permanent memory in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.

[0164] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer 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 technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.

[0165] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.

[0166] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0167] The above are only embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included within the scope of the claims of the present application.

Claims

1. A message checking method, characterized in that: include: Obtain the message to be checked; Parsing the message to be checked to obtain the value of the field to be checked; Checking the to-be-checked field values ​​according to a preset checklist to obtain a check result, wherein the preset checklist includes at least field values ​​of a plurality of local business data; The message to be checked is parsed to obtain the field values ​​to be checked, including: Obtaining the message parsing rules for the message to be checked; Parsing the message to be checked based on the message parsing rule to obtain a key-value pair to be checked of the message to be checked, wherein the key-value pair to be checked includes: a field name to be checked of the message to be checked and a field value to be checked of the message to be checked; Before obtaining the message parsing rule of the message to be checked, the method further includes: Obtaining a sample message, wherein the sample message includes a plurality of message nodes; Traversing multiple message nodes in the example message to determine a node path; Based on the node path, determining the message parsing rule, wherein the message parsing rule includes at least one rule object for describing node attributes, and the rule object includes at least: a field name of the message node; The rule object further includes a field path determined based on the node path. After determining the message parsing rule based on the node path, the method further includes: Obtaining a rule update message, wherein the rule update message is used to update the message parsing rule, and the rule update message includes multiple message nodes; Querying a first parsing rule of the rule update message, wherein the first parsing rule is a determined message parsing rule; Traversing the plurality of message nodes in the rule update message to determine a second parsing rule, where the second parsing rule is a message parsing rule determined according to the rule update message; comparing the number of rule objects in the first parsing rule and the number of rule objects in the second parsing rule; When the number of the rule objects is the same, determining the first parsing rule as an updated message parsing rule; When the number of the rule objects is different, if a difference rule object that exists in the second parsing rule but does not exist in the first parsing rule is determined according to the field path, the difference rule object is written into the first parsing rule.

2. The method according to claim 1, characterized in that Obtaining the message to be checked includes: Acquire configuration information of a message server, wherein the message server is used to transmit the message to be checked, and the configuration information at least includes: a message address of the message server, and a server type of the message server; The message to be checked is obtained according to the server type of the message server and the message address.

3. The method according to claim 1, characterized in that: The field value to be checked is checked according to the preset checklist, and the check result includes: Identify whether the to-be-checked field exists in the preset check list, wherein the preset check list records a plurality of field values ​​of the local business data; If the to-be-checked field value exists in the preset check table, determining that the to-be-checked message passes the check; When the to-be-checked field value does not exist in the preset check table, it is determined that the to-be-checked message has failed the check.

4. The method according to claim 1, characterized in that: The field value to be checked is checked according to the preset checklist, and the check result includes: Calculate the hash value to be checked of the field value to be checked; Identify whether the to-be-checked hash value exists in the preset check list, wherein the preset check list records a plurality of local hash values ​​of the local business data, and the local hash value is determined according to a field value of the local business data; If the to-be-checked hash value exists in the preset check table, determining that the to-be-checked message passes the check; When the hash value to be checked does not exist in the preset check table, it is determined that the message to be checked has failed the check.

5. A message checking device, characterized in that: include: A first acquisition unit, used to acquire a message to be checked; A parsing unit, used for parsing the message to be checked to obtain a field value to be checked; A checking unit, used for checking the field value to be checked according to a preset checking table to obtain a checking result, wherein the preset checking table at least includes field values ​​of a plurality of local business data; Wherein, the parsing unit comprises: A third acquisition module is used to obtain the message parsing rules of the message to be checked; A parsing module, used for parsing the message to be checked based on the message parsing rule to obtain a key-value pair to be checked of the message to be checked, wherein the key-value pair to be checked includes: a field name to be checked of the message to be checked and a field value to be checked of the message to be checked; Wherein, the device further comprises: A second acquisition unit, configured to acquire a sample message before acquiring the message parsing rule of the message to be checked, wherein the sample message includes a plurality of message nodes; A traversal unit, used for traversing a plurality of message nodes in the example message to determine a node path; A determination unit, configured to determine the message parsing rule based on the node path, wherein the message parsing rule includes at least one rule object for describing node attributes, and the rule object includes at least: a field name of the message node; The rule object further includes a field path determined based on the node path, and the device further includes: a third acquisition unit, configured to acquire a rule update message after determining the message parsing rule based on the node path, wherein the rule update message is used to update the message parsing rule, and the rule update message includes a plurality of message nodes; A query unit, configured to query a first parsing rule of the rule update message, wherein the first parsing rule is a determined message parsing rule; A traversal unit, configured to traverse the plurality of message nodes in the rule update message to determine a second parsing rule, where the second parsing rule is a message parsing rule determined according to the rule update message; A comparing unit, used for comparing the number of the rule objects in the first parsing rule and the second parsing rule; A second determining unit, configured to determine, when the number of the rule objects is the same, that the first parsing rule is an updated message parsing rule; An updating unit is used for, when the number of the rule objects is different, determining according to the field path a difference rule object that exists in the second parsing rule and does not exist in the first parsing rule, and writing the difference rule object into the first parsing rule.

6. A processor, characterized in that: The processor is used to run a program, wherein the program executes the message checking method described in any one of claims 1 to 4 when running.

7. An electronic device, characterized in that: It includes one or more processors and a memory, wherein the memory is used to store one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the message verification method described in any one of claims 1 to 4.

Images