Message conversion method and device, electronic equipment and computer readable storage medium

Abstract

The present disclosure provides a message conversion method and device, electronic equipment and computer readable storage medium, and relates to the technical field of computer and Internet, which comprises the following steps: receiving a first message conforming to a first message structure; obtaining a message analysis conversion rule corresponding to the first message structure and a plurality of message templates corresponding to a first device, wherein the message analysis conversion rule comprises at least one analysis rule condition; performing traversal processing on the first message, determining an analysis success condition in the at least one analysis rule condition that is satisfied by the first message; matching a first message template corresponding to the analysis success condition from the plurality of message templates corresponding to the first device, wherein the first message template comprises at least one first parameter, and the first message template conforms to a second message structure; extracting a parameter value corresponding to each first parameter from the first message; and filling the first message template according to the parameter value corresponding to the at least one first parameter to generate a second message conforming to the second message structure.

Description

Technical Field

[0001] This disclosure relates to the field of computer and Internet technology, and in particular to a message conversion method and apparatus, electronic equipment and computer-readable storage medium. Background Technology

[0002] This section is intended to provide background or context for the embodiments of this disclosure as set forth in the claims. The description herein is not intended to be a prior art simply because it is included in this section.

[0003] In related technologies, system interactions are increasingly characterized by structured messages, particularly those in JSON format. Standardized, object-oriented message parsing and conversion schemes have been developed for these structured messages. However, current parsing and conversion schemes lead to logical coupling between systems. When the content of messages in an upstream system changes, the downstream system must rely on the upstream system's development to perform corresponding system upgrades to complete the message parsing and conversion.

[0004] Therefore, the technical problem to be solved by this application is how to decouple the systems during message parsing and conversion. Summary of the Invention

[0005] The purpose of this disclosure is to provide a message conversion method, apparatus, electronic device, and computer-readable storage medium that can parse and convert a first message sent by an upstream device into a message that conforms to the message structure required by the first device.

[0006] Other features and advantages of this disclosure will become apparent from the following detailed description, or may be learned in part from practice of this disclosure.

[0007] This disclosure provides a message conversion method, comprising: receiving a first message conforming to a first message structure; obtaining message parsing and conversion rules corresponding to the first message structure and multiple message templates corresponding to the first device, wherein the message parsing and conversion rules include at least one parsing rule condition; traversing the first message and determining a parsing success condition satisfied by the first message among the at least one parsing rule condition; matching the first message template corresponding to the parsing success condition among the multiple message templates corresponding to the first device, wherein the first message template includes at least one first parameter, the first message template conforms to a second message structure, and the first message structure is different from the second message structure; extracting parameter values ​​corresponding to each first parameter from the first message; and filling the first message template according to the parameter values ​​corresponding to the at least one first parameter to generate a second message conforming to the second message structure.

[0008] In some embodiments, the method further includes: loading the first message to generate a message binary tree corresponding to the first message, the message binary tree including a first message node and a second message node; wherein, the message parsing and conversion rules include a service binary tree of the service corresponding to the first message; wherein obtaining the message parsing and conversion rules corresponding to the structure of the first message includes: obtaining the service binary tree corresponding to the first message, the service binary tree including a first service node and a second service node, wherein each service node includes at least one parsing rule condition, the first service node of the service binary tree corresponds to the first message node in the message binary tree, and the second service node of the service binary tree corresponds to the second message node in the message binary tree; wherein, the first message is traversed. The processing, which determines the parsing success condition satisfied by the first message among the at least one parsing rule conditions, includes: traversing the message data in the first message node through the parsing rule conditions in the first service node to determine the parsing rule conditions satisfied by the data in the first message node among at least one parsing rule conditions corresponding to the first message node, as a first parsing success condition; traversing the message data in the second message node through the parsing rule conditions in the second service node to determine the parsing rule conditions satisfied by the data in the second message node among at least two parsing rule conditions corresponding to the second message node, as a second parsing success condition; and using the first parsing success condition and the second parsing success condition as the parsing success condition satisfied by the first message.

[0009] In some embodiments, the plurality of message templates corresponding to the first device include a second message template, the second message template being mounted in the second service node, the second service node including at least one parsing rule condition, and the at least one parsing rule condition in the second service node including a first parsing rule condition; wherein, traversing the message data in the second message node through the parsing rule condition in the second service node to determine the parsing rule condition satisfied by the data in the second message node among at least two parsing rule conditions corresponding to the second message node as a second parsing success condition includes: traversing the message data in the second message node through the first parsing rule condition in the second service node; if the message data in the second message node satisfies the first parsing rule condition, then determining the first parsing rule condition as a parsing success condition corresponding to the second message node, wherein when it is determined that there is data in the second message node that matches the first parsing rule condition, the traversal of the data in the second message node is stopped; wherein, matching the first message template corresponding to the parsing success condition among the plurality of message templates corresponding to the first device includes: matching the first message template that matches the first parsing rule among the plurality of message templates corresponding to the first device.

[0010] In some embodiments, the first message sent by the second device is a message corresponding to a first service, the message binary tree further includes a third message node, and the multiple message templates corresponding to the first device further include a third message template; wherein, the method for obtaining the service binary tree corresponding to the first message further includes: generating a service binary tree template based on the structure and service content of the first message corresponding to the first service, the service binary tree template including a third service node, the third service node corresponding to the third message node, the third service node having the third message template mounted thereon; compiling at least one parsing rule condition corresponding to the third service node based on the third message template and the service content; generating a configuration file corresponding to the third service node based on the at least one parsing rule condition corresponding to the third service node; configuring the configuration file corresponding to the third service node in the first device, so as to parse and traverse the message data in the third message node corresponding to the first message through the configuration file in the first device.

[0011] In some embodiments, the parameter value corresponding to the first parameter is calculated from the first sub-parameter and the second sub-parameter; wherein, extracting the parameter value corresponding to each first parameter from the first message includes: extracting the parameter value corresponding to the first sub-parameter from the first message; extracting the parameter value corresponding to the second sub-parameter from the first message; and performing parameter calculation on the parameter value corresponding to the first sub-parameter and the parameter value corresponding to the second sub-parameter to obtain the parameter value corresponding to the first parameter.

[0012] In some embodiments, the parameter value corresponding to the first parameter is calculated from the third sub-parameter and the external parameter; wherein, extracting the parameter value corresponding to each first parameter from the first message includes: extracting the parameter value corresponding to the third sub-parameter from the first message; obtaining the parameter value corresponding to the external parameter from the external system of the first device; and performing parameter calculation on the parameter value corresponding to the third sub-parameter and the parameter value corresponding to the external parameter to obtain the parameter value corresponding to the first parameter.

[0013] In some embodiments, the first message template corresponds to a second service, and the second service is processed by a third device; wherein, the method further includes: determining the second service corresponding to the first message template; determining a third device for processing the second service; and sending the second message generated according to the first message template to the third device so that the third device can process the second message.

[0014] In some embodiments, the parsing success conditions satisfied by the first message include a first parsing success condition and a second parsing success condition, wherein the first parsing success condition is used to match the first message template, and the plurality of message templates corresponding to the first device further include a second message template, the second message template conforming to a third message structure, and the third message structure being different from the first message structure; wherein the method further includes: matching the second message template corresponding to the second parsing success condition among the plurality of message templates corresponding to the first device, wherein the second message template includes at least one second parameter; extracting parameter values ​​corresponding to each second parameter from the second message; and filling the second message template according to the parameter values ​​corresponding to the at least one second parameter to generate a third message conforming to the third message structure.

[0015] This disclosure provides a message conversion device, including: a first message receiving module, a parsing conversion rule acquisition module, a traversal module, a first message template matching module, a first parameter value extraction module, and a filling module.

[0016] The first message receiving module is used to receive a first message conforming to a first message structure; the parsing and conversion rule acquisition module can be used to acquire the message parsing and conversion rules corresponding to the first message structure and multiple message templates corresponding to the first device, wherein the message parsing and conversion rules include at least one parsing rule condition; the traversal module can be used to traverse the first message and determine the parsing success condition satisfied by the first message among the at least one parsing rule condition; the first message template matching module can be used to match the first message template corresponding to the parsing success condition among the multiple message templates corresponding to the first device, wherein the first message template includes at least one first parameter, the first message template conforms to a second message structure, and the first message structure is different from the second message structure; the first parameter value extraction module can be used to extract the parameter values ​​corresponding to each first parameter from the first message; the filling module can be used to fill the first message template according to the parameter values ​​corresponding to the at least one first parameter to generate a second message conforming to the second message structure.

[0017] This disclosure provides an electronic device comprising: a memory and a processor; the memory for storing computer program instructions; and the processor for calling the computer program instructions stored in the memory to implement the message conversion method described above.

[0018] This disclosure provides a computer-readable storage medium storing computer program instructions to implement the message conversion method as described in any of the preceding embodiments.

[0019] This disclosure provides a computer program product or computer program that includes computer program instructions stored in a computer-readable storage medium. The computer program instructions are read from the computer-readable storage medium, and the processor executes the computer program instructions to implement the aforementioned message conversion method.

[0020] The message conversion method, apparatus, electronic device, and computer-readable storage medium provided in this disclosure can determine a first message template matching the first message from multiple message templates corresponding to the first device through message parsing and conversion rules. Then, based on the message content in the first message and the first message template, a second message with a second message structure conforming to the requirements of the first device is generated. This method can directly generate a second message with a second message structure conforming to the requirements of the downstream device by parsing and converting the first message sent by the upstream device, even when the downstream device is decoupled from the upstream device.

[0021] It should be understood that the above general description and the following detailed description are merely exemplary and do not limit this disclosure. Attached Figure Description

[0022] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this disclosure and, together with the description, serve to explain the principles of this disclosure. It is obvious that the drawings described below are merely some embodiments of this disclosure, and those skilled in the art can obtain other drawings based on these drawings without any inventive effort.

[0023] Figure 1 A schematic diagram of a scenario that can be applied to the message conversion method or message conversion apparatus of the present disclosure embodiments is shown.

[0024] Figure 2 This is a flowchart illustrating a message conversion method according to an exemplary embodiment.

[0025] Figure 3 This is a flowchart illustrating a message parsing and conversion method according to an exemplary embodiment.

[0026] Figure 4 This is a flowchart illustrating a data traversal method according to an exemplary embodiment.

[0027] Figure 5 This is a flowchart illustrating a business binary tree generation method according to an exemplary embodiment.

[0028] Figure 6 This is a schematic diagram of a business binary tree according to an exemplary embodiment.

[0029] Figure 7 This is a flowchart illustrating a message parsing and conversion method according to an exemplary embodiment.

[0030] Figure 8 This is a flowchart illustrating a message parsing and conversion method according to an exemplary embodiment.

[0031] Figure 9 This is a schematic diagram illustrating the generation of a template instance according to an exemplary embodiment.

[0032] Figure 10 This is an application diagram illustrating a message parsing and conversion method according to an exemplary embodiment.

[0033] Figure 11 This is a timing diagram illustrating a message parsing and conversion method according to an exemplary embodiment.

[0034] Figure 12 This is a block diagram illustrating a message conversion apparatus according to an exemplary embodiment.

[0035] Figure 13A schematic diagram of the structure of an electronic device suitable for implementing embodiments of the present disclosure is shown. Detailed Implementation

[0036] Exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, these exemplary embodiments can be implemented in many forms and should not be construed as limited to the embodiments set forth herein; rather, they are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the exemplary embodiments to those skilled in the art. The same reference numerals in the drawings denote the same or similar parts, and therefore repeated descriptions of them will be omitted.

[0037] Those skilled in the art will recognize that embodiments of this disclosure can be a system, apparatus, device, method, or computer program product. Therefore, this disclosure can be implemented in the following forms: entirely hardware, entirely software (including firmware, resident software, microcode, etc.), or a combination of hardware and software.

[0038] The features, structures, or characteristics described in this disclosure can be combined in any suitable manner in one or more embodiments. Numerous specific details are provided in the following description to give a thorough understanding of embodiments of this disclosure. However, those skilled in the art will recognize that the technical solutions of this disclosure can be practiced with one or more specific details omitted, or other methods, components, apparatuses, steps, etc., can be employed. In other instances, well-known methods, apparatuses, implementations, or operations are not shown or described in detail to avoid obscuring various aspects of this disclosure.

[0039] The accompanying drawings are merely illustrative of this disclosure, and the same reference numerals in the drawings denote the same or similar parts, thus omitting repeated descriptions of them. Some block diagrams shown in the drawings do not necessarily correspond to physically or logically independent entities. These functional entities may be implemented in software, in one or more hardware modules or integrated circuits, or in different network and / or processor devices and / or microcontroller devices.

[0040] The flowchart shown in the accompanying drawings is merely illustrative and does not necessarily include all content and steps, nor does it require execution in the described order. For example, some steps may be broken down, while others may be combined or partially combined; therefore, the actual execution order may change depending on the specific circumstances.

[0041] In the description of this disclosure, unless otherwise stated, " / " means "or," for example, A / B can mean A or B. "And / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone. Furthermore, "at least one" means one or more, and "multiple" means two or more. The terms "first," "second," etc., do not limit the quantity or order of execution, and "first," "second," etc., do not necessarily imply differences; the terms "contains," "includes," and "has" are used to indicate an open-ended meaning of inclusion and refer to the existence of additional elements / components / etc. besides those listed.

[0042] To better understand the above-mentioned objectives, features and advantages of the present invention, the present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments. It should be noted that, unless otherwise specified, the embodiments and features in the embodiments of the present disclosure can be combined with each other.

[0043] It should be noted that the collection, gathering, updating, analysis, processing, use, transmission, and storage of user personal information involved in this disclosed technical solution all comply with relevant laws and regulations, are used for legitimate purposes, and do not violate public order and good morals. Necessary measures are taken to prevent unauthorized access to user personal information data and to safeguard user personal information security, network security, and national security.

[0044] The following section will first explain some of the terms used in the embodiments of this disclosure so that those skilled in the art can understand them.

[0045] A message is a protocol defined for file transfer. It can be a message in a format such as CSV, XML, or JSON, or it can be understood as data. Parsing a message means parsing message data with a specific format and content into the desired result for easy processing.

[0046] FreeMarker is a template engine: a general-purpose tool that uses templates and data to be modified to generate output text (HTML web pages, emails, configuration files, source code, etc.).

[0047] JSONPath is an information extraction library that is a tool for extracting specified information from JSON documents.

[0048] AviatorScript is a high-performance, lightweight scripting language that resides on the JVM (Java Virtual Machine).

[0049] MVEL: is a powerful expression language for Java applications.

[0050] Beetl is short for Bee Template Language. It's a next-generation template engine that's powerful, performs exceptionally well, and far surpasses current popular template engines. It's also easy to learn and use.

[0051] Thymeleaf is a modern server-side Java template engine suitable for web and standalone environments, capable of handling HTML, XML, JavaScript, CSS, and even plain text.

[0052] HTML: short for Hypertext Markup Language, is a markup language. It consists of a series of tags. These tags can unify the format of documents on the web, connecting scattered Internet resources into a logical whole.

[0053] XML: Extensible Markup Language, a subset of Standard Generalized Markup Language, is a markup language used to mark up electronic documents to give them structure.

[0054] JavaScript: Abbreviated as "JS", is a lightweight, interpreted or just-in-time (JIT) programming language with a function-first approach.

[0055] CSS: short for Cascading Style Sheets, is a computer language used to represent the style of HTML (an application of Standard Generalized Markup Language) or XML (a subset of Standard Generalized Markup Language). It is a programming language used to represent HTML styles and is a style language that allows for the separation of web pages and content.

[0056] JSON: Short for JavaScript Object Notation, is a lightweight data exchange format.

[0057] The preceding text introduced some terms and concepts involved in the embodiments of this disclosure. The following text introduces the technical features involved in the embodiments of this disclosure.

[0058] The exemplary embodiments of this disclosure will now be described in detail with reference to the accompanying drawings.

[0059] Figure 1 A schematic diagram of a scenario that can be applied to the message conversion method or message conversion apparatus of the present disclosure embodiments is shown.

[0060] Please refer to Figure 1The diagram illustrates an implementation environment provided by an exemplary embodiment of this disclosure.

[0061] like Figure 1 As shown, system architecture 100 may include terminal devices 101 and 102, network 104, and servers 103 and 105. Network 104 is used as a medium to provide communication links between terminal devices 101 and 102 and servers 103 and 105. Network 104 may include various connection types, such as wired or wireless communication links or fiber optic cables, etc.

[0062] Users can use terminal devices 101 and 102 to interact with servers 103 and 105 via network 104 to receive or send messages, etc. Terminal devices 101 and 102 can be various electronic devices with displays and web browsing capabilities, including but not limited to smartphones, tablets, laptops, desktop computers, wearable devices, virtual reality devices, smart home devices, etc.

[0063] Servers 103 and 105 can be servers providing various services, such as backend management servers supporting the devices operated by users using terminal devices 101 and 102, or servers providing operator services in an operator system, such as SMS service system servers, voice service system servers, or other system servers. This application does not impose any limitations on this. The backend management server can analyze and process received requests and other data, and feed back the processing results to the terminal devices.

[0064] A server can be a standalone physical server, a server cluster or a distributed system consisting of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN (Content Delivery Network), and big data and artificial intelligence platforms. This disclosure does not impose any restrictions on this.

[0065] Server 105 may, for example, receive a first message conforming to a first message structure from other devices (such as server 103 or terminal devices 101 or 102); server 105 may, for example, obtain message parsing and conversion rules corresponding to the first message structure and multiple message templates corresponding to the first device, wherein the message parsing and conversion rules include at least one parsing rule condition; server 105 may, for example, traverse the first message and determine the parsing success condition satisfied by the first message in at least one parsing rule condition; server 105 may, for example, match the first message template corresponding to the parsing success condition from the multiple message templates corresponding to the first device, wherein the first message template includes at least one first parameter, the first message template conforms to a second message structure, and the first message structure is different from the second message structure; server 105 may, for example, extract the parameter values ​​corresponding to each first parameter from the first message; server 105 may, for example, fill the first message template according to the parameter values ​​corresponding to at least one first parameter to generate a second message conforming to the second message structure.

[0066] It should be understood that Figure 1 The number of terminal devices, networks, and servers shown is merely illustrative. Server 105 can be a single physical server or a combination of multiple servers. Depending on actual needs, it can have any number of terminal devices, networks, and servers.

[0067] Figure 2 This is a flowchart illustrating a message conversion method according to an exemplary embodiment. The method provided in this disclosure can be executed by any electronic device with computing power; for example, the method can be implemented by the aforementioned... Figure 1 In the embodiments described below, the execution of the server is illustrated using a business system server (such as server 103 or 105) in the operator system as the execution subject (such as the first device). However, this disclosure is not limited to this. It is understood that the aforementioned business system server can be used to process certain specific services, and this application does not impose any restrictions on this.

[0068] Reference Figure 2 The message conversion method provided in this disclosure may include the following steps.

[0069] Step S202: Receive the first message that conforms to the first message structure.

[0070] In some embodiments, the first device may receive the first message from a second device (such as a system or device in an operator's system).

[0071] In some embodiments, the second device may send a first message with a first message structure according to its own needs or its own standards.

[0072] However, in practical applications, the structure of the first message corresponding to the first message sent by the second device may not meet the needs of the first device. Therefore, the first device needs to parse and convert the message to extract the necessary information and generate a second message that meets its requirements. The structure of the second message can then meet the needs of the first device or facilitate its information processing.

[0073] The differences in the aforementioned message structures (such as the first message structure or the second message structure) may include differences in the message writing language (such as XML, JSON, or CSV), message format (such as message layout), and message content. This application does not limit the specific differences in message structures. For example, if both the first and second messages include the keyword "name," but the keyword "name" is located in different positions in the first and second messages, then the first message structure corresponding to the first message can be considered different from the second message structure corresponding to the second message. Similarly, if the first message is written in JSON and the second message is written in XML, then the first message structure corresponding to the first message can also be considered different from the second message structure corresponding to the second message. Furthermore, if the first message includes the keyword "name," but the second message does not, then the first message structure corresponding to the first message can be considered different from the second message structure corresponding to the second message, and so on. This application does not impose any restrictions on these differences.

[0074] Step S204: Obtain the message parsing and conversion rules corresponding to the first message structure and multiple message templates corresponding to the first device. The message parsing and conversion rules include at least one parsing rule condition.

[0075] In some embodiments, the above-mentioned message parsing and conversion rules can be written in a configuration file using logical expressions, scripts, or SQL type expressions, and configured in the first device.

[0076] In some embodiments, the above message parsing and conversion rules can also be implemented by code, and this application does not impose any restrictions on this.

[0077] In some embodiments, the first message is message data corresponding to a first service in the first device.

[0078] In some embodiments, the first device may pre-store message parsing and conversion rules corresponding to the first message structure. These rules may be generated based on the corresponding first service in the second device and the first device's own requirements. For example, when the second device accesses the first device, the first device will pre-obtain the message structure of each service of the second device, and then generate message parsing and conversion rules corresponding to each message structure based on the message structure of each service. For instance, when the second device accesses the first device, the first device knows that the first message transmitted in the second device may include card activation time information. Since the first device needs to obtain the user's card activation time and generate an SMS message to notify the user based on the card activation time, the aforementioned message parsing and conversion rules may include a parsing rule condition to determine whether the first message contains card activation time. Those skilled in the art can design these message parsing and conversion rules based on the actual needs of the first device and the message structure sent by the second device; this application does not impose any limitations on this.

[0079] In some embodiments, the first device may pre-store general message parsing and conversion rules, which can be used to load, parse, and match various messages, etc. This application does not limit this.

[0080] Step S206: The first message is traversed and processed to determine the successful parsing condition that the first message meets in at least one parsing rule condition.

[0081] In some embodiments, the first message can be traversed through the above message parsing and conversion rules, and the parsing rule condition satisfied by the first message can be determined from at least one parsing rule condition of the message parsing rules as the parsing success condition.

[0082] For example, suppose the parsing and conversion rules include the following three parsing rule conditions: 1. The message contains ID card information; 2. The message contains monetary information; 3. The message contains activation time information. Then, when the first message contains ID card information and monetary information, it can be considered that the first message satisfies the first and second parsing rule conditions. Therefore, the first and second parsing rule conditions can be used as the above-mentioned conditions for successful parsing, and so on. This application does not impose any restrictions on this.

[0083] Step S208: Match the first message template corresponding to the successful parsing condition from among the multiple message templates corresponding to the first device. The first message template includes at least one first parameter, the first message template conforms to the second message structure, and the first message structure is different from the second message structure.

[0084] The above-mentioned successful parsing conditions can refer to the parsing rule conditions that the first message successfully satisfies. For example, in the above example, since the first message satisfies the first and second parsing rule conditions, the first and second parsing rule conditions can be considered as the successful parsing conditions corresponding to the first message.

[0085] In some embodiments, the above-mentioned parsing success conditions and message templates can have a one-to-one relationship (e.g., one parsing success condition can match one template), a one-to-many relationship (e.g., one parsing success condition can match multiple templates), or a many-to-one relationship (e.g., multiple parsing success conditions can match one template). This application does not impose any limitations on this. For example, when the first message meets parsing success condition 1, it may be able to match the first message template; as another example, when the first message meets both parsing success condition 1 and parsing success condition 2, it may be able to match the first message template; as yet another example, when the first message meets parsing success condition 1, it may be able to match both the first message template and the second message template simultaneously. Those skilled in the art can set the correspondence between the above-mentioned message modules and parsing success conditions according to actual needs, and this application does not impose any limitations on this.

[0086] Step S210: Extract the parameter values ​​corresponding to each first parameter from the first message.

[0087] In some embodiments, when the parsing success condition corresponding to the first message matches the first message template (which may be one or more) among the multiple message templates corresponding to the first device, the first parameter to be filled in the first message template (such as card name, card balance, card activation time, etc.) can be further determined. Based on this, the parameter values ​​corresponding to each first parameter can be extracted from the first message according to certain extraction rules.

[0088] In some embodiments, the parameter extraction rule corresponding to the first parameter can be implemented through expressions, scripts, etc. in a configuration file, or it can be implemented through code. This application does not impose any restrictions on this.

[0089] Step S212: Fill the first message template according to the parameter value corresponding to at least one first parameter to generate a second message that conforms to the second message structure.

[0090] In some embodiments, the parameter values ​​corresponding to at least one first parameter can be directly filled into the first message template to generate a second message that conforms to the second message structure.

[0091] In some embodiments, the parameter values ​​extracted from the first message may be an intermediate form of the parameters required in the first message template, and it may be necessary to calculate the parameter values ​​extracted from the first message to obtain the parameter values ​​required by the first message template.

[0092] For example, the date extracted from the first message might be in the format XXXX-XX-XX, but the date format required in the first message template is XXXX:XX:XX. In this case, the date extracted from the first message needs to be calculated and processed to generate the parameters required by the first message template. As another example, the first message might extract the account opening time and the time difference between the account opening time and the activation time, but the first message template needs to fill in the activation time. In this case, the activation time can be determined based on the account opening time extracted from the first message and the time difference between the account opening time and the activation time, and then the activation time can be filled into the first message template.

[0093] In some embodiments, the parameter value corresponding to the first parameter can be calculated from the first sub-parameter and the second sub-parameter. The parameter value required by the first message template can then be obtained as follows: extract the parameter value corresponding to the first sub-parameter from the first message; extract the parameter value corresponding to the second sub-parameter from the first message; perform parameter calculations (such as addition, subtraction, multiplication, division, square root, etc.) on the parameter values ​​corresponding to the first and second sub-parameters to obtain the parameter value corresponding to the first parameter. It is understood that those skilled in the art can set the calculation formula between the first and second sub-parameters according to actual business needs, and this application does not impose any restrictions on this.

[0094] In some embodiments, the parameter value corresponding to the first parameter can be calculated from the third sub-parameter and the external parameter. Therefore, the parameter value required for the first message template can be obtained as follows: extract the parameter value corresponding to the third sub-parameter from the first message; obtain the parameter value corresponding to the external parameter from the external system of the first device; perform parameter calculation on the parameter value corresponding to the third sub-parameter and the parameter value corresponding to the external parameter to obtain the parameter value corresponding to the first parameter. Here, the external parameter value can refer to a parameter obtained from a device other than the first device.

[0095] In some embodiments, after obtaining the parameter values ​​required for the first message, the parameter values ​​can be filled into the first message template to generate the second message.

[0096] The above embodiments provide a message parsing and conversion scheme. By flexibly configuring message parsing and conversion rules as needed, message processing between upstream and downstream systems (upstream system: second device, downstream system: first device) can be decoupled. Regardless of whether the input of the upstream system is adjusted, the output of the downstream system can be adjusted by managing and matching message parsing and conversion rules and templates. This enables the expected output of message results to be guaranteed without code adjustments.

[0097] The above embodiments can realize a unified and flexible processing mechanism for business messages after business order archiving, and provide general parsing capabilities for business information transmission.

[0098] In some embodiments, the first message template may correspond to a second service, which can be processed by a third device. Therefore, after generating the second message, the second service corresponding to the first message template can be determined; then, the third device for processing the second service can be determined; and finally, the second message generated based on the first message template can be sent to the third device for processing.

[0099] For example, the first device can be a server in the operator's network. After the first device processes the message sent by the second device into a second message, it can determine the second service (such as SMS notification service) corresponding to the second message and the service processing device (such as a third device, which can be, for example, an SMS gateway) corresponding to the second service. Then the first device will send the second message to the third device corresponding to the second service so that the third device can perform service processing on the second message.

[0100] In some embodiments, if the message structure required by the service corresponding to the third device is different from the message structure corresponding to the second message, the third device may also use the message parsing and conversion method proposed in this application to process the second message in order to generate a message that meets the requirements of the third device.

[0101] Figure 3 This is a flowchart illustrating a message parsing and conversion method according to an exemplary embodiment. (Reference) Figure 3 The above message parsing and conversion method may include the following steps.

[0102] Step S302: Receive a first message conforming to the first message structure from the second device.

[0103] Step S304: Load the first message to generate a message binary tree corresponding to the first message. The message binary tree includes the first message node and the second message node.

[0104] In some embodiments, the first device may know in advance the message structure of the first message sent by the second device, and then load the first message according to the known message structure to generate a message binary tree corresponding to the first message. It should be noted that the nodes in the message binary tree may or may not have logical relationships, and this application does not impose any restrictions on this.

[0105] Step S306: Obtain the service binary tree corresponding to the first message and multiple message templates corresponding to the first device. The service binary tree includes a first service node and a second service node. Each service node includes at least one parsing rule condition. The first service node of the service binary tree corresponds to the first message node in the message binary tree, and the second service node of the service binary tree corresponds to the second message node in the message binary tree.

[0106] In some embodiments, the first device may know in advance the first message structure of the first message sent by the second device, and then construct a service binary tree (e.g., based on the service corresponding to the first message structure) Figure 6 (As shown). It can be understood that the binary tree structures of the business binary tree and the message binary tree corresponding to the same business are the same. The difference is that the nodes in the business binary tree correspond to the parsing rule conditions, while the nodes in the message binary tree correspond to the business data. The parsing rule conditions in the business node can be used to traverse and process the business data in the message node corresponding to that business node to determine whether the data in the message node satisfies the parsing rule conditions.

[0107] Step S308: Traverse the message data in the first message node through the parsing rule conditions in the first service node, so as to determine the parsing rule conditions satisfied by the data in the first message node in at least one parsing rule condition corresponding to the first message node, and use it as the first parsing success condition.

[0108] In some embodiments, the message data in the first message node can be traversed through the parsing rule conditions in the first service node to determine the parsing rule conditions satisfied by the data in the first message node from the various parsing rule conditions in the first service node, so as to serve as the first parsing rule satisfied by the first message node.

[0109] Step S310: Traverse the message data in the second message node through the parsing rule conditions in the second service node, and determine the parsing rule conditions that the data in the second message node satisfies from at least two parsing rule conditions corresponding to the second message node, and use them as the second parsing success condition.

[0110] In some embodiments, the message data in the second message node can be traversed through the parsing rule conditions in the second service node to determine the parsing rule conditions satisfied by the data in the second message node from the various parsing rule conditions in the second service node, so as to serve as the second parsing rule satisfied by the second message node.

[0111] Step S312: The first parsing success condition and the second parsing success condition are used as the parsing success conditions that the first message satisfies.

[0112] In some embodiments, the first parsing success condition and the second parsing success condition can be used as the parsing success conditions satisfied by the first message.

[0113] Step S314: Match the first message template corresponding to the successful parsing condition from the multiple message templates corresponding to the first device. The first message template includes at least one first parameter, the first message template conforms to the second message structure, and the first message structure is different from the second message structure.

[0114] Step S316: Extract the parameter values ​​corresponding to each first parameter from the first message.

[0115] Step S318: Fill the first message template according to the parameter value corresponding to at least one first parameter to generate a second message that conforms to the second message structure.

[0116] The above embodiments can improve traversal efficiency and condition matching success rate by matching business nodes and message nodes one by one.

[0117] Figure 4 This is a flowchart illustrating a data traversal method according to an exemplary embodiment.

[0118] In some embodiments, the multiple message templates corresponding to the first device may include a second message template, which may be mounted in a second service node. The second service node may also include at least one parsing rule condition, which may include a first parsing rule condition.

[0119] So, for reference Figure 4 The above data traversal method may include the following steps.

[0120] Step S402: Traverse the message data in the second message node using the first parsing rule conditions in the second service node.

[0121] Step S404: If the message data in the second message node satisfies the first parsing rule condition, then the first parsing rule condition is determined to be the parsing success condition corresponding to the second message node. When it is determined that there is data in the second message node that matches the first parsing rule condition, the traversal of the data in the second message node is stopped.

[0122] In some embodiments, traversal blocking or traversal continuation conditions can be set. For example, if the packet data in the second packet node satisfies the first parsing rule condition, then the first parsing rule condition is determined to be the successful parsing condition for the second packet node. Specifically, once it is determined that there is data in the second packet node that matches the first parsing rule condition, the traversal of the data in the second packet node stops. This method can shorten the traversal time and improve traversal efficiency. Of course, once it is determined that there is data in the second packet node that matches the first parsing rule condition, the traversal of the data in the second packet node can continue; this application does not limit this.

[0123] In some embodiments, a first message template that matches the first parsing rule can also be matched from multiple message templates corresponding to the first device.

[0124] Figure 5 This is a flowchart illustrating a business binary tree generation method according to an exemplary embodiment.

[0125] In some embodiments, the first message sent by the second device may be a message corresponding to the first service, the message binary tree may also include a third message node, and the multiple message templates corresponding to the first device may also include a third message template.

[0126] So, for reference Figure 5 The above-mentioned business binary tree generation method may include the following steps.

[0127] Step S502: Generate a service binary tree template based on the first message structure and service content corresponding to the first service. The service binary tree template includes a third service node, which corresponds to the third message node and has the third message template mounted on it.

[0128] Below, this embodiment will explain the generation process of the business binary tree using the third business node as an example. This application embodiment can implement the construction of other nodes according to the description of this embodiment.

[0129] In some embodiments, those skilled in the art can generate a service binary tree template based on the first message structure and service content corresponding to the first service (the template of the service binary tree can be as follows). Figure 6 As shown). Figure 6 As shown, the business operations corresponding to each node in the above business binary tree template may or may not have a logical relationship, and may or may not have a sequential order. This application does not impose any restrictions on this.

[0130] Step S504: Compile at least one parsing rule condition corresponding to the third service node based on the third message template and service content.

[0131] In some embodiments, parsing and conversion rules corresponding to each node in the service binary tree can be compiled based on the service content corresponding to the second device and the service binary tree template. Specifically, at least one parsing rule condition corresponding to the third service node can be compiled based on the third message template and the service content corresponding to the second device.

[0132] It is understood that those skilled in the art can formulate parsing rules and conditions in each node of the business binary tree template based on the known message structure and content of the message corresponding to the second device, and this application does not impose any restrictions on this.

[0133] Step S506: Generate the configuration file corresponding to the third business node based on at least one parsing rule condition corresponding to the third business node.

[0134] In some embodiments, the above-mentioned business binary tree can be written in a configuration file using a programming language. This way, when changes are needed next time, only the configuration file needs to be modified, without the need for code development, which improves the efficiency and accuracy of modification.

[0135] Step S508: Configure the configuration file corresponding to the third service node in the first device so that the packet data in the third packet node corresponding to the first packet can be parsed and traversed through the configuration file in the first device.

[0136] It is understood that this embodiment only uses the third message node as an example to explain the generation and configuration process of parsing rule conditions in the third service node. Those skilled in the art can apply the above process to other nodes, and this application does not limit this.

[0137] It is understood that the message parsing and conversion method provided in this application can be connected to multiple business systems. For each system connected, the business binary tree modeling method provided in this embodiment can be used to analyze the corresponding business orders of that system to complete the modeling of the business binary tree, forming a business tree (e.g., Figure 6 (As shown) so that subsequent messages sent by the newly accessed system can be parsed and transformed based on this service binary tree. The hierarchy and branching complexity of the service binary tree are determined by the complexity of the service and can be dynamically shrunk or expanded during the operation period.

[0138] Figure 7 This is a flowchart illustrating a message parsing and conversion method according to an exemplary embodiment.

[0139] In some embodiments, the first device can parse and convert multiple messages (such as a second message, a third message, etc.) from the first message.

[0140] In some embodiments, the parsing success conditions satisfied by the first message may include a first parsing success condition and a second parsing success condition, wherein the first parsing success condition can be used to match the first message template (the specific process can be found in [reference]). Figure 2 The first device may also include a second message template, which conforms to a third message structure. The third message structure may be different from the first message structure (e.g., different writing languages, different writing formats, different content, etc.).

[0141] refer to Figure 7 The above message parsing and conversion method may include the following steps.

[0142] Step S702: Match the second message template corresponding to the second parsing success condition from the multiple message templates corresponding to the first device, wherein the second message template includes at least one second parameter.

[0143] Step S704: Extract the parameter values ​​corresponding to each second parameter from the second message.

[0144] Step S706: Fill the second message template according to the parameter value corresponding to at least one second parameter to generate a third message that conforms to the third message structure.

[0145] In some embodiments, the process of generating the third message can refer to the second message, which will not be repeated in this embodiment.

[0146] This embodiment provides a method for programmable message parsing, which can be applied to scenarios where one document message input is expected to produce one or more document message outputs.

[0147] Figure 8 This is a flowchart illustrating a message parsing and conversion method according to an exemplary embodiment.

[0148] The core technical step of the method provided in this embodiment is to pre-sort and compile the business rules of business orders (e.g., message data corresponding to business orders) into a database, forming a structured data tree (e.g., ... Figure 6 The business binary tree (as shown) is stored in the database. Then, the received messages are parsed into a message binary tree according to the tree structure of the business binary tree. Next, using the known level-order traversal logic of the business binary tree, starting from the root node, the entry point is found according to the configured parsing and transformation rules. Then, preset parsing rule conditions are executed on each message binary tree node to complete the parsing of the business logic of the message binary tree. Based on the parsing rule conditions generated during the parsing process of each tree node, the business content template is matched until the template required by the business order (one or more, or none) is identified. Then, the content template is filtered to obtain the content template and its required content parameters are extracted. Finally, the template engine completes the assembly of the output message content, forming an output message instance, and the resulting message is delivered to the downstream system. For details, please refer to [reference needed]. Figure 8 The illustrated embodiment.

[0149] refer to Figure 8 As shown in the embodiment, the above message parsing and conversion method may include the following steps.

[0150] 1. Message Reception and Verification

[0151] It is used to receive messages, perform the first step of filtering, pass the verified messages to the message loading module, and store the messages for easy message replay in specific scenarios.

[0152] 2. Message Loading

[0153] According to the pre-known message format, the message is loaded into the traversal tree module line by line and level by level (depending on the message format) to obtain the message binary tree structure data based on memory operations, and then passed into the rule parsing step.

[0154] 3. Rule Analysis

[0155] According to the established parsing and conversion rules, the message binary tree data is processed. It can be precisely located according to the rule conditions, or it can be fuzzy traversed to output the parsing success conditions.

[0156] 4. Template matching

[0157] Based on the successful parsing conditions in step 3, and combining the matching relationship between the template and the rule conditions, the corresponding message template is matched and output.

[0158] 5. Parameter Extraction

[0159] If the content template contains variable parameters, extract the variable parameters from the template and input the variable parameter list.

[0160] 6. Parameter Calculation

[0161] Based on the rules for extracting variable parameters, the values ​​of the variable parameters are parsed from the binary tree structure data.

[0162] 7. Generate template instance

[0163] By combining the results of parameter calculations and the message template, the final message instance is generated.

[0164] 8. Template message conversion

[0165] Convert message instances into the message format required by downstream devices.

[0166] 9. Message delivery

[0167] To more clearly illustrate the technical solutions in this method embodiment, the above method will be described in detail below with reference to specific embodiments.

[0168] In some embodiments, before executing the message parsing and conversion method, the parsing and conversion rules can be formulated based on the message format and content of the upstream system.

[0169] 1. Business Rule Creation: This is an output of business modeling. Business rule expressions are created at each node of the business tree. Depending on the business complexity, an engine can be specified or extended as needed. For example, it can be specified as: an expression engine (JsonPath, XPath, AviatorScript, MVEL, etc. The introduction of an expression engine helps us to complete the mutual conversion between rule-based expressions and Java objects. The expression engine should be able to handle the mapping relationship between expressions and objects, and this mapping relationship should be bidirectional), or a script engine (Beetl, Thymeleaf, FreeMarker, etc. A script engine is a computer programming language interpreter; its function is to interpret and execute the user's program text, translating it into machine code that the computer can execute), or specifying the expression as SQL type to execute database actions, or other scripts, such as Shell scripts, or extending with custom engine plugins to comprehensively support the creation of business rule expressions with different complexities, performance levels, and scenario requirements. Different types of script engines can execute different scripts.

[0170] For example, to simply obtain the product name of the purchased item in an order, a JsonPath expression can be used to directly express the expression. To calculate whether there is a specific logical relationship between multiple order items, a more complex engine such as FreeMarker can be used to write a logical calculation script. It is even possible to predefine the execution type of the expression for scenarios that obtain data from certain databases as SQL (a language developed for database operations), and send the SQL to the database for execution at runtime to meet the needs of the scenario. Or, when external system support is required, such as when SMS content needs to dynamically obtain the current account's outstanding balance information from the billing system, the rule expression can be compiled by configuring the execution of a remote interface.

[0171] The business rule expressions compiled above are all expressions that do not require compilation in the embodiments of this method. They are parsed and executed dynamically by the engine, or executed through the execution capabilities provided within the system of this method embodiment. There is no need to change or upgrade the system processes that have been published to the production line in this method embodiment. Unless it is to support more complex business and to extend the engine capabilities, the compiled business rule expressions are all regarded as data-type business assets in this method embodiment, rather than static code-type process assets.

[0172] In some embodiments, after the parsing and conversion rules are compiled, they can be executed. Figure 8 The process shown includes message reception and verification, message loading, etc.

[0173] After the message loading process is completed, the business rules can be executed.

[0174] 2. Execution of Business Rules: The overall execution process of business rules is carried out by traversing the business rule tree in a hierarchical order. When entering the same level traversal, the sibling nodes are pre-sorted to guide the execution order. After the previous node in the same level is established, the continues-breaks mode is intervened to decide whether to continue or block the execution of subsequent nodes, and mutual exclusion relationships are set to exclude mutually exclusive rule execution. When all normal type tree nodes in the same level are not established, this method designs and reserves one (or none) patchy type node in each level to undertake the final rule verification of this level.

[0175] Once the business rules are executed, the process of matching the business rules with the content template can be performed.

[0176] 3. Matching Business Rules and Content Templates: Each tree node in the business tree can be attached to one (or more) content templates. As long as the rule is true, it will guide the instantiation of the content module of the template attached to the rule, and identify the target system to which the business order is to be sent when matching this relationship.

[0177] 4. Template Parameter Extraction: During the initial content template compilation, the dynamic parameters that need to be filled in the content template are collected and compiled in a relational manner. At runtime, after the content template successfully matches the parsing conditions of the business rules, the template parameters in the successfully matched template can be extracted. The basic principle of extraction is pattern matching, which can be done in two ways: First, use specific placeholders to mark parameters in the content template, such as ${xxx}, and complete the identification and extraction through pattern + regular expression, where xxx is the parameter; Second, if the parameters are complex, names can be pre-defined and entered into the table model designed by this method for storage when compiling the content template, and then directly loaded from the database for use at runtime.

[0178] Among them, information collection and editing refers to the process of gathering and editing information.

[0179] 5. Template Parameter Calculation: After the template parameters are extracted, this method provides the ability to calculate the values ​​that the parameters should map to in the business order message. This calculation relies on the execution of a template engine, so the business order message needs to be decomposed into a context. The decomposition method is structured decomposition, and the loading mode is lazy-load mode. This minimizes memory consumption by adhering to the principle of minimum necessity. The creation of this context is also advanced to the beginning of the entire process, i.e., when task scheduling is ready to complete. This ensures that the entire message processing process is within the same effective context, and that both success and failure conditions during rule execution can serve as sources for parameter calculation, thereby reducing redundant calculations and improving the efficiency of parameter calculation. The result set of parameter calculation will also be used in the specific application mechanisms of the non-disruption mode and blacklists / whitelists when delivering to downstream systems.

[0180] Lazy loading is a strategy that identifies resources as non-blocking (non-critical) resources and loads them only when needed.

[0181] Among them, the principle of minimum necessity means that the response to processing personal information has a clear definition.

[0182] 6. Generate template instances (e.g.) Figure 9 As shown): Template instantiation introduces template engine support and supports the basic engine's plugin mechanism. This method pre-creates multiple sets of plugins, including plugins for obtaining system time, calculating date-month difference, reversing date format, translating month into English and Chinese, and automatically formatting currency amount (thousands separator). When instantiating a template, the template engine uses the template engine to populate the content template + template parameters + the calculated result of the template parameters, ultimately forming a template instance, which is the final result message instance, completing the preparation work for the delivery of the result message.

[0183] The purpose of templates is to solve the coupling between presentation and data. Simply put, a template is still a piece of text, but some of its segments are related to data. In actual development, the final HTML (or other types of segments) is dynamically generated based on the data model and the template. The template engine simplifies this splicing process by using some lifecycle and syntax or formatting tools to make the generation of the final HTML as simple and intuitive as possible.

[0184] In some embodiments, after generating a template instance, a message can be delivered to a specified downstream system.

[0185] The technical solutions provided in the above embodiments have the following beneficial effects:

[0186] 1. By implementing the above embodiments through configuration files, the coupling relationship between business systems can be decoupled;

[0187] 2. All systems can use this method to access message parsing and reception without developing business code; only the business rules need to be configured.

[0188] 3. The business rule configuration for message parsing takes effect in real time;

[0189] 4. Result message content is managed based on templates;

[0190] 5. Non-intrusive access to application systems;

[0191] 6. Compatible with various message formats, such as JSON, XML, HTML, CSS, etc.

[0192] The overall process of inter-system interaction for implementing this method (taking SMS service as an example) can be found by referring to... Figure 10 As shown.

[0193] like Figure 10 As shown, after an order is completed in the business system, the order message can be sent to the system where this method is located. After rule recognition and filtering, an SMS instance is output and delivered to the SMS gateway for sending.

[0194] The message parsing and conversion methods corresponding to the above SMS services can be as follows: Figure 11 As shown.

[0195] refer to Figure 11 The above message parsing and conversion method may include the following steps.

[0196] First, the BSTI interface (an interface) can respond to message data from various systems to perform message parsing and conversion tasks. For example, it can perform message parsing and conversion on message data sent in the following ways.

[0197] Method 1

[0198] 1.1 The databus system (a data change capture system) sends message data to the BSTI interface via the HTTP interface.

[0199] 1.2 The BSTI interface sends a message storage request to the storage system in order to send the aforementioned message data to the storage system for storage.

[0200] 1.3 The storage system sends a message storage response to the BSTI interface.

[0201] 1.4BSTI receives the above message storage response and puts the above message data into the message conversion task table for message parsing and conversion.

[0202] 1.5BSTI returns a message reception response to the databus.

[0203] Method 2

[0204] 1.1 The subsystem sends message data to the BSTI interface via the HTTP interface.

[0205] 1.2 The BSTI interface sends a message storage request to the storage system in order to send the aforementioned message data to the storage system for storage.

[0206] 1.3 The storage system sends a message storage response to the BSTI interface.

[0207] 1.4 BSTI receives the above message storage response and puts the above message data into the message conversion task table (such as the BST_BUSI_MSG table) for message parsing and conversion.

[0208] 1.5BSTI returns a message reception response to the distribution system.

[0209] Method 3

[0210] 1.1 The billing system sends message data to the BSTI interface via the HTTP interface.

[0211] 1.2 The BSTI interface sends a message storage request to the storage system in order to send the aforementioned message data to the storage system for storage.

[0212] 1.3 The storage system sends a message storage response to the BSTI interface.

[0213] 1.4BSTI receives the above message storage response and puts the above message data into the message conversion task table for message parsing and conversion.

[0214] 1.5BSTI returns a message reception response to the billing system.

[0215] After the message data is entered into the message conversion task table (such as the BST_BUSI_MSG table), the BSTU conversion interface will execute the following message parsing and conversion methods (refer to 2.1 to 2.9 in the asynchronous conversion task).

[0216] Method 4

[0217] 1.1 The service system sends message data to the BSTI interface via the HTTP interface.

[0218] 1.2 The BSTI interface sends a message storage request to the storage system in order to send the aforementioned message data to the storage system for storage.

[0219] 1.3 The storage system sends a message storage response to the BSTI interface.

[0220] 1.4BSTI receives the above message storage response and puts the above message data into the message conversion task table for message parsing and conversion.

[0221] 1.5BSTI returns a message reception response to the service system.

[0222] After the message data is entered into the message conversion task table (such as the BST_BUSI_MSG table), the BSTU conversion interface will execute the following message parsing and conversion methods (refer to 2.1 to 2.9 in the asynchronous conversion task).

[0223] 2.1 Task extraction.

[0224] 2.2 Send a message retrieval request to the storage system (i.e., retrieve the message to be converted and parsed from the storage system).

[0225] 2.3 Retrieve the response from the received message (this response includes the message to be parsed and converted).

[0226] 2.4 Rule filtering (i.e., iterating through the first message and determining the successful parsing condition that the first message meets in at least one parsing rule condition).

[0227] 2.5 Template Matching (Matching the first message template corresponding to the successful parsing condition from multiple message templates corresponding to the first device, wherein the first message template includes at least one first parameter, the first message template conforms to the second message structure, and the first message structure is different from the second message structure).

[0228] 2.6 Parameter extraction (extracting the parameter values ​​corresponding to each first parameter from the first message).

[0229] 2.7 Parameter Calculation.

[0230] 2.8 Generate template instances.

[0231] 2.9 Write the generated template instance into the real-time task table BST_SMS_INTF for subsequent real-time tasks.

[0232] In some embodiments, the purpose of the above template instance can be explained by taking a real-time SMS task as an example, specifically including the steps corresponding to 4.1 to 4.3 and 3.1 to 3.5.

[0233] Sections 4.1 to 4.5 correspond to the triggering of real-time tasks, which can include the following two methods.

[0234] Method 1

[0235] 4.1 The subsystem sends a real-time SMS request to the BSTI interface to request that the real-time SMS request be written to the table.

[0236] 4.2 The BSTI interface writes the real-time SMS task to the task table BST_SMS-INTF.

[0237] 4.3BSTI returns a response to the data processing system.

[0238] Method 2

[0239] 4.1 The billing system sends a real-time SMS request to the BSTI interface to request that the real-time SMS request be written to the table.

[0240] 4.2 The BSTI interface writes the real-time SMS task to the task table BST_SMS-INTF.

[0241] 4.3BSTI returns a response to the billing system.

[0242] Once the real-time SMS task is written to the task table BST_SMS-INTF, the BSTI conversion interface will respond to the request by performing an asynchronous real-time SMS task, which may include steps 3.1 to 3.5.

[0243] 3.1 Task Extraction.

[0244] 3.2 Rule-based filtering (based on blacklists, whitelists, employee IDs, etc.).

[0245] 3.3 Obtain the results of rule filtering.

[0246] 3.4 Instantiate SMS messages based on the converted messages.

[0247] 3.5 Send real-time SMS messages.

[0248] It should be particularly noted that the steps in each embodiment of the above message conversion method can be overlapped, substituted, added, or deleted. Therefore, these reasonable permutations and combinations of message conversion methods should also fall within the protection scope of this disclosure, and the protection scope of this disclosure should not be limited to the embodiments.

[0249] Based on the same inventive concept, this disclosure also provides a message conversion device, as shown in the following embodiments. Since the principle by which this device embodiment solves the problem is similar to that of the above-described method embodiment, the implementation of this device embodiment can refer to the implementation of the above-described method embodiment, and repeated details will not be elaborated further.

[0250] Figure 12 This is a block diagram illustrating a message conversion apparatus according to an exemplary embodiment. (Refer to...) Figure 12 The message conversion device 1200 provided in this embodiment may include: a first message receiving module 1201, a parsing conversion rule acquisition module 1202, a traversal module 1203, a first message template matching module 1204, a first parameter value extraction module 1205, and a filling module 1206.

[0251] The first message receiving module 1201 can be used to receive a first message conforming to the first message structure; the parsing and conversion rule acquisition module 1202 can be used to acquire the message parsing and conversion rules corresponding to the first message structure and multiple message templates corresponding to the first device, wherein the message parsing and conversion rules include at least one parsing rule condition; the traversal module 1203 can be used to traverse the first message and determine the parsing success condition satisfied by the first message in at least one parsing rule condition; the first message template matching module 1204 can be used to match the first message template corresponding to the parsing success condition from the multiple message templates corresponding to the first device, wherein the first message template includes at least one first parameter, the first message template conforms to the second message structure, and the first message structure is different from the second message structure; the first parameter value extraction module 1205 can be used to extract the parameter value corresponding to each first parameter from the first message; and the filling module 1206 can be used to fill the first message template according to the parameter value corresponding to at least one first parameter to generate a second message conforming to the second message structure.

[0252] It should be noted that the first message receiving module 1201, the parsing and conversion rule acquisition module 1202, the traversal module 1203, the first message template matching module 1204, the first parameter value extraction module 1205, and the filling module 1206 mentioned above correspond to S202 to S212 in the method embodiment. The examples and application scenarios implemented by the above modules and corresponding steps are the same, but are not limited to the content disclosed in the above method embodiment. It should be noted that the above modules, as part of the device, can be executed in a computer system such as a set of computer-executable instructions.

[0253] In some embodiments, the message conversion apparatus further includes: a message loading module; wherein the message loading module is used to load a first message to generate a message binary tree corresponding to the first message, the message binary tree including a first message node and a second message node; wherein the message parsing and conversion rules include a service binary tree corresponding to the first message; wherein the parsing and conversion rule acquisition module 1202 may include: a service binary tree acquisition submodule, used to acquire the service binary tree corresponding to the first message, the service binary tree including a first service node and a second service node, wherein each service node includes at least one parsing rule condition, the first service node of the service binary tree corresponds to the first message node in the message binary tree, and the second service node of the service binary tree corresponds to the second message node in the message binary tree; wherein the traversal module 1203 may include: a first traversal submodule, a second traversal submodule, and a parsing success condition determination submodule.

[0254] The first traversal submodule is used to traverse the message data in the first message node according to the parsing rule conditions in the first service node, so as to determine the parsing rule conditions satisfied by the data in the first message node from at least one parsing rule condition corresponding to the first message node, as the first parsing success condition; the second traversal submodule is used to traverse the message data in the second message node according to the parsing rule conditions in the second service node, so as to determine the parsing rule conditions satisfied by the data in the second message node from at least two parsing rule conditions corresponding to the second message node, as the second parsing success condition; the parsing success condition determination submodule can be used to use the first parsing success condition and the second parsing success condition as the parsing success condition satisfied by the first message.

[0255] In some embodiments, the multiple message templates corresponding to the first device include a second message template, the second message template is mounted in a second service node, the second service node includes at least one parsing rule condition, and the at least one parsing rule condition in the second service node includes a first parsing rule condition; wherein, the second traversal submodule may include: a traversal unit and a condition satisfaction unit.

[0256] The traversal unit can be used to traverse the message data in the second message node according to the first parsing rule condition in the second service node; the condition satisfaction unit can be used to determine that the first parsing rule condition is the parsing success condition corresponding to the second message node if the message data in the second message node satisfies the first parsing rule condition, wherein when it is determined that there is data in the second message node that matches the first parsing rule condition, the traversal of the data in the second message node is stopped.

[0257] The first message template matching module 1204 may include a first message matching submodule. The first message matching submodule can be used to match a first message template that matches the first parsing rule from among multiple message templates corresponding to the first device.

[0258] In some embodiments, the first message sent by the second device is a message corresponding to the first service, the message binary tree also includes a third message node, and the multiple message templates corresponding to the first device also include a third message template; wherein, the message conversion device for obtaining the service binary tree corresponding to the first message may further include: a service binary tree template generation module, a rule compilation module, a configuration file generation module, and a configuration module.

[0259] The service binary tree template generation module can be used to generate a service binary tree template based on the first message structure and service content corresponding to the first service. The service binary tree template includes a third service node, which corresponds to a third message node and has the third message template mounted on it. The rule compilation module can be used to compile at least one parsing rule condition corresponding to the third service node based on the third message template and service content. The configuration file generation module can be used to generate a configuration file corresponding to the third service node based on at least one parsing rule condition corresponding to the third service node. The configuration module can be used to configure the configuration file corresponding to the third service node in the first device so that the message data in the third message node corresponding to the first message can be parsed and traversed through the configuration file in the first device.

[0260] In some embodiments, the parameter value corresponding to the first parameter is calculated from the first sub-parameter and the second sub-parameter; wherein the first parameter value extraction module 1205 may include: a first sub-parameter value extraction sub-module, a second sub-parameter extraction sub-module, and a first calculation sub-module.

[0261] The first sub-parameter value extraction submodule can be used to extract the parameter value corresponding to the first sub-parameter from the first message; the second sub-parameter extraction submodule can be used to extract the parameter value corresponding to the second sub-parameter from the first message; and the first calculation submodule can be used to perform parameter calculation on the parameter value corresponding to the first sub-parameter and the parameter value corresponding to the second sub-parameter to obtain the parameter value corresponding to the first parameter.

[0262] In some embodiments, the parameter value corresponding to the first parameter is calculated from the third sub-parameter and the external parameter; wherein the first parameter value extraction module 1205 may include: a third sub-parameter extraction sub-module, an external parameter extraction sub-module, and a second calculation sub-module.

[0263] The third sub-parameter extraction submodule can be used to extract the parameter value corresponding to the third sub-parameter from the first message; the external parameter extraction submodule can be used to obtain the parameter value corresponding to the external parameter from the external system of the first device; and the second calculation submodule can be used to perform parameter calculation on the parameter value corresponding to the third sub-parameter and the parameter value corresponding to the external parameter to obtain the parameter value corresponding to the first parameter.

[0264] In some embodiments, the first message template corresponds to the second service, and the second service is processed by the third device; wherein, the message conversion device may further include: a second service determination module, a third device determination module, and a message sending module.

[0265] The second service determination module can be used to determine the second service corresponding to the first message template; the third device determination module can be used to determine the third device that processes the second service; and the message sending module can be used to send the second message generated according to the first message template to the third device so that the third device can process the second message.

[0266] In some embodiments, the parsing success conditions satisfied by the first message include a first parsing success condition and a second parsing success condition, wherein the first parsing success condition is used to match the first message template, and the multiple message templates corresponding to the first device also include a second message template, the second message template conforms to a third message structure, and the third message structure is different from the first message structure; wherein, the message conversion device may further include: a second message module matching module, a second parameter value extraction module, and a filling module.

[0267] The second message template matching module can be used to match the second message template corresponding to the second parsing success condition from multiple message templates corresponding to the first device, wherein the second message template includes at least one second parameter; the second parameter value extraction module can be used to extract the parameter value corresponding to each second parameter from the second message; and the filling module can be used to fill the second message template according to the parameter value corresponding to at least one second parameter to generate a third message that conforms to the third message structure.

[0268] Since the functions of the device 1200 have been described in detail in their respective method embodiments, they will not be repeated here.

[0269] The modules and / or sub-modules and / or units described in the embodiments of this disclosure can be implemented in software or hardware. The described modules and / or sub-modules and / or units can also be located in a processor. The names of these modules and / or sub-modules and / or units do not, in some cases, constitute a limitation on the module and / or sub-module and / or unit itself.

[0270] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in a flowchart or block diagram may represent a portion of a module or program segment containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in a block diagram or flowchart, and combinations of blocks in a block diagram or flowchart, may be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer program instructions.

[0271] Furthermore, the above figures are merely illustrative of the processes included in the method according to exemplary embodiments of this disclosure and are not intended to be limiting. It is readily understood that the processes shown in the above figures do not indicate or limit the temporal order of these processes. Additionally, it is readily understood that these processes may be executed synchronously or asynchronously, for example, in multiple modules.

[0272] Figure 13 A schematic diagram of the structure of an electronic device suitable for implementing embodiments of the present disclosure is shown. It should be noted that... Figure 13 The illustrated electronic device 1300 is merely an example and should not be construed as limiting the functionality and scope of use of the embodiments disclosed herein.

[0273] like Figure 13 As shown, the electronic device 1300 includes a central processing unit (CPU) 1301, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 1302 or a program loaded from a storage section 1308 into a random access memory (RAM) 1303. The RAM 1303 also stores various programs and data required for the operation of the electronic device 1300. The CPU 1301, ROM 1302, and RAM 1303 are interconnected via a bus 1304. An input / output (I / O) interface 1305 is also connected to the bus 1304.

[0274] The following components are connected to I / O interface 1305: an input section 1306 including a keyboard, mouse, etc.; an output section 1307 including a cathode ray tube (CRT), liquid crystal display (LCD), etc., and speakers, etc.; a storage section 1308 including a hard disk, etc.; and a communication section 1309 including a network interface card such as a LAN card, modem, etc. The communication section 1309 performs communication processing via a network such as the Internet. Drive 1310 is also connected to I / O interface 1305 as needed. Removable media 1311, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., are installed on drive 1310 as needed so that computer programs read from them can be installed into storage section 1308 as needed.

[0275] In particular, according to embodiments of this disclosure, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments of this disclosure include a computer program product comprising a computer program carried on a computer-readable storage medium, the computer program containing computer program instructions for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via communication section 1309, and / or installed from removable medium 1311. When the computer program is executed by central processing unit (CPU) 1301, it performs the functions defined above in the system of this disclosure.

[0276] It should be noted that the computer-readable storage medium disclosed herein may be a computer-readable signal medium or a computer-readable storage medium, or any combination thereof. A computer-readable storage medium may be, for example,—but not limited to—an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of a computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof. In this disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In this disclosure, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable computer program instructions. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. Computer-readable signal media can also be any computer-readable storage medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. Computer program instructions contained on a computer-readable storage medium can be transmitted using any suitable medium, including but not limited to: wireless, wire, optical fiber, RF, etc., or any suitable combination thereof.

[0277] In another aspect, this disclosure also provides a computer-readable storage medium, which may be included in the device described in the above embodiments; or it may exist independently and not assembled into the device. The computer-readable storage medium carries one or more programs, which, when executed by the device, enable the device to perform the following functions: receiving a first message conforming to a first message structure; obtaining message parsing and conversion rules corresponding to the first message structure and multiple message templates corresponding to the first device, wherein the message parsing and conversion rules include at least one parsing rule condition; traversing the first message to determine a successful parsing condition satisfied by the first message among the at least one parsing rule condition; matching the first message template corresponding to the successful parsing condition from the multiple message templates corresponding to the first device, wherein the first message template includes at least one first parameter, the first message template conforms to a second message structure, and the first message structure is different from the second message structure; extracting parameter values ​​corresponding to each first parameter from the first message; and filling the first message template according to the parameter values ​​corresponding to at least one first parameter to generate a second message conforming to the second message structure.

[0278] According to one aspect of this disclosure, a computer program product or computer program is provided, comprising computer program instructions stored in a computer-readable storage medium. The computer program instructions are read from the computer-readable storage medium, and a processor executes the computer program instructions to implement the methods provided in various optional implementations of the above embodiments.

[0279] From the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions of the embodiments of this disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, external hard drive, etc.) and includes several computer program instructions to cause an electronic device (such as a server or terminal device, etc.) to execute the method according to the embodiments of this disclosure.

[0280] Other embodiments of this disclosure will readily occur to those skilled in the art upon consideration of the specification and practice disclosed herein. This disclosure is intended to cover any variations, uses, or adaptations of this disclosure that follow the general principles of this disclosure and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the true scope and spirit of this disclosure are indicated by the claims.

[0281] It should be understood that this disclosure is not limited to the detailed structures, drawing arrangements or implementations shown herein; rather, this disclosure is intended to cover various modifications and equivalent arrangements contained within the spirit and scope of the appended claims.

Claims

1. A message conversion method, characterized in that, Applied to the first device, including: Receive the first message that conforms to the first message structure; Obtain the message parsing and conversion rules corresponding to the first message structure and multiple message templates corresponding to the first device, wherein the message parsing and conversion rules include at least one parsing rule condition; The first message is traversed and processed to determine the successful parsing condition satisfied by the first message in the at least one parsing rule condition; The first message template corresponding to the parsing success condition is matched among the multiple message templates corresponding to the first device. The first message template includes at least one first parameter, the first message template conforms to the second message structure, and the first message structure is different from the second message structure. Extract the parameter values ​​corresponding to each first parameter from the first message; The first message template is filled with the parameter value corresponding to the at least one first parameter to generate a second message that conforms to the second message structure; The first message is loaded to generate a message binary tree corresponding to the first message, the message binary tree including a first message node and a second message node; The message parsing and conversion rules include a service binary tree of the service corresponding to the first message; wherein, obtaining the message parsing and conversion rules corresponding to the structure of the first message includes: Obtain the service binary tree corresponding to the first message. The service binary tree includes a first service node and a second service node. Each service node includes at least one parsing rule condition. The first service node of the service binary tree corresponds to the first message node in the message binary tree. The second service node of the service binary tree corresponds to the second message node in the message binary tree. The process of traversing the first message and determining the successful parsing condition satisfied by the first message from the at least one parsing rule includes: The parsing rule conditions in the first service node are used to traverse the message data in the first message node, so as to determine the parsing rule conditions satisfied by the data in the first message node in at least one parsing rule condition corresponding to the first message node, and use it as the first parsing success condition. The message data in the second message node is traversed through the parsing rule conditions in the second service node to determine the parsing rule conditions satisfied by the data in the second message node from at least two parsing rule conditions corresponding to the second message node, which is used as the second parsing success condition; The first successful parsing condition and the second successful parsing condition are used as the successful parsing conditions that the first message satisfies.

2. The method according to claim 1, characterized in that, The first device corresponds to multiple message templates, including a second message template. The second message template is mounted in the second service node. The second service node includes at least one parsing rule condition, and the at least one parsing rule condition in the second service node includes a first parsing rule condition. Specifically, the message data in the second message node is traversed using the parsing rule conditions in the second service node to determine the parsing rule condition satisfied by the data in the second message node from at least two parsing rule conditions corresponding to the second message node, which serves as the second successful parsing condition. This includes: The message data in the second message node is traversed using the first parsing rule conditions in the second service node; If the message data in the second message node satisfies the first parsing rule condition, then the first parsing rule condition is determined to be the parsing success condition corresponding to the second message node. When it is determined that there is data in the second message node that matches the first parsing rule condition, the traversal of the data in the second message node is stopped. Among the multiple message templates corresponding to the first device, the first message template corresponding to the successful parsing condition is matched, including: The first message template that matches the first parsing rule is matched from among the multiple message templates corresponding to the first device.

3. The method according to claim 1, characterized in that, The first message sent by the second device is a message corresponding to the first service. The message binary tree also includes a third message node, and the multiple message templates corresponding to the first device also include a third message template. The method for obtaining the service binary tree corresponding to the first message further includes: A service binary tree template is generated based on the first message structure and service content corresponding to the first service. The service binary tree template includes a third service node, which corresponds to the third message node and is attached to the third message template. Based on the third message template and the business content, at least one parsing rule condition corresponding to the third business node is prepared; Generate the configuration file corresponding to the third business node based on at least one parsing rule condition corresponding to the third business node; The configuration file corresponding to the third service node is configured in the first device so that the packet data in the third packet node corresponding to the first packet can be parsed and traversed through the configuration file in the first device.

4. The method according to claim 1, characterized in that, The parameter value corresponding to the first parameter is calculated from the first sub-parameter and the second sub-parameter; wherein, extracting the parameter value corresponding to each first parameter from the first message includes: Extract the parameter value corresponding to the first sub-parameter from the first message; Extract the parameter value corresponding to the second sub-parameter from the first message; Parameter calculations are performed on the parameter values ​​corresponding to the first sub-parameter and the second sub-parameter to obtain the parameter value corresponding to the first parameter.

5. The method according to claim 1, characterized in that, The parameter value corresponding to the first parameter is calculated from the third sub-parameter and the external parameter; wherein, extracting the parameter value corresponding to each first parameter from the first message includes: Extract the parameter value corresponding to the third sub-parameter from the first message; Obtain the parameter values ​​corresponding to the external parameters from the external system of the first device; The parameter value corresponding to the third sub-parameter and the parameter value corresponding to the external parameter are calculated to obtain the parameter value corresponding to the first parameter.

6. The method according to claim 1, characterized in that, The first message template corresponds to the second service, which is processed by a third device; wherein, the method further includes: Determine the second service corresponding to the first message template; Determine the third device to process the second service; The second message generated according to the first message template is sent to the third device so that the third device can process the second message.

7. The method according to claim 1, characterized in that, The successful parsing conditions satisfied by the first message include a first successful parsing condition and a second successful parsing condition. The first successful parsing condition is used to match the first message template. The multiple message templates corresponding to the first device also include a second message template. The second message template conforms to a third message structure, which is different from the first message structure. The method further includes: The second message template corresponding to the second parsing success condition is matched among multiple message templates corresponding to the first device, wherein the second message template includes at least one second parameter; Extract the parameter values ​​corresponding to each second parameter from the second message; The second message template is filled with the parameter value corresponding to the at least one second parameter to generate a third message that conforms to the third message structure.

8. A message conversion device, characterized in that, Applied to the first device, including: The first message receiving module is used to receive a first message that conforms to the first message structure. The parsing and conversion rule acquisition module is used to acquire the packet parsing and conversion rules corresponding to the first packet structure and multiple packet templates corresponding to the first device. The packet parsing and conversion rules include at least one parsing rule condition. The traversal module is used to traverse the first message and determine the successful parsing condition satisfied by the first message in the at least one parsing rule condition. The first message template matching module is used to match the first message template corresponding to the parsing success condition from multiple message templates corresponding to the first device, wherein the first message template includes at least one first parameter, the first message template conforms to a second message structure, and the first message structure is different from the second message structure. The first parameter value extraction module is used to extract the parameter values ​​corresponding to each first parameter from the first message; A filling module is used to fill the first message template according to the parameter value corresponding to the at least one first parameter, so as to generate a second message that conforms to the second message structure; The message loading module is used to load the first message to generate a message binary tree corresponding to the first message, wherein the message binary tree includes a first message node and a second message node; The message parsing and conversion rules include a service binary tree of the service corresponding to the first message; wherein, obtaining the message parsing and conversion rules corresponding to the structure of the first message includes: Obtain the service binary tree corresponding to the first message. The service binary tree includes a first service node and a second service node. Each service node includes at least one parsing rule condition. The first service node of the service binary tree corresponds to the first message node in the message binary tree. The second service node of the service binary tree corresponds to the second message node in the message binary tree. The process of traversing the first message and determining the successful parsing condition satisfied by the first message from the at least one parsing rule includes: The parsing rule conditions in the first service node are used to traverse the message data in the first message node, so as to determine the parsing rule conditions satisfied by the data in the first message node in at least one parsing rule condition corresponding to the first message node, and use it as the first parsing success condition. The message data in the second message node is traversed through the parsing rule conditions in the second service node to determine the parsing rule conditions satisfied by the data in the second message node from at least two parsing rule conditions corresponding to the second message node, which is used as the second parsing success condition; The first successful parsing condition and the second successful parsing condition are used as the successful parsing conditions that the first message satisfies.

9. An electronic device, characterized in that, include: Memory; as well as A processor coupled to the memory, the processor being used to execute the message translation method as described in any one of claims 1-7 based on computer program instructions stored in the memory.

10. A computer-readable storage medium having stored thereon computer program instructions that, when executed by a processor, implement the message conversion method as described in any one of claims 1-7.

Images