Message processing method, device, equipment, storage medium and program product

Abstract

The present disclosure provides a message processing method that can be applied to the financial field or other fields. The message processing method includes: obtaining a message to be processed; determining a first message set corresponding to the message to be processed from at least one first message set; judging whether the first message set includes other messages belonging to the same business action as the message to be processed, and if not, storing the message to be processed in the first message set; if so, forming a second message set by the message to be processed and the messages belonging to the same business action as the message to be processed; and allocating the second message set to be processed to the corresponding processing node for processing based on the number of processing nodes and the number of second message sets to be processed, wherein at least two second message sets to be processed are allocated to different processing nodes, and the processing nodes integrate the messages in the second message set. The present disclosure also provides a message processing device, equipment, storage medium, and program product.

Description

Technical Field

[0001] The present disclosure relates to the field of communication technology, and more specifically to a message processing method, apparatus, device, storage medium, and program product. Background Art

[0002] The banking and financial industry utilizes multiple business systems, each of which processes a large number of transactions constantly, such as credit card applications, transfers, and loans. Each transaction involves multiple business actions. For example, a credit card application involves application, approval, card production, issuance, and activation, and each action generates corresponding messages. When all business systems are aggregated, hundreds of thousands or even millions of transactions occur per second, and the volume of messages required to be processed per unit time can reach tens of billions.

[0003] When faced with this massive influx of messages, traditional processing solutions typically store daytime messages in a database and then utilize server resources to process them at night when business is less busy. However, this approach cannot guarantee the timeliness of the data, so how to more quickly process the massive influx of messages has become a pressing issue. Summary of the Invention

[0004] In view of the above problems, the present disclosure provides a message processing method, apparatus, device, storage medium and program product.

[0005] According to a first aspect of the present disclosure, a message processing method is provided, comprising:

[0006] Acquire a message to be processed, wherein each acquired message to be processed includes one of multiple messages generated according to a business action, and the multiple messages are respectively generated by different business systems;

[0007] When a message to be processed is obtained at least once, a first message set corresponding to the message to be processed is determined from at least one first message set, and whether the first message set includes other messages belonging to the same service action as the message to be processed is determined. If not, the message to be processed is stored in the first message set; if so, a second message set is formed by the message to be processed and the messages in the first message set that belong to the same service action as the message to be processed;

[0008] Allocating the second message sets to be processed to corresponding processing nodes according to the number of processing nodes and the number of the second message sets to be processed, and integrating the messages in the second message sets by the processing nodes;

[0009] At least two of the second message sets to be processed are allocated to different processing nodes.

[0010] According to an embodiment of the present disclosure, the step of obtaining a message to be processed includes:

[0011] Extracting the global tracking number, transaction code and first menu code from the message to be processed;

[0012] generating a first correlation code for the message to be processed according to the global tracking number, the transaction code, and the first menu code, wherein the first correlation code is the same for messages belonging to the same business action;

[0013] The step of determining whether the first message set includes other messages belonging to the same service action as the message to be processed includes:

[0014] When the first message set stores messages with the same first association code as the message to be processed, and the number of messages with the same first association code as the message to be processed stored in the first message set is equal to a preset number, it is determined that the first message set includes remaining messages that belong to the same business action as the message to be processed.

[0015] According to an embodiment of the present disclosure, there are multiple first message sets, and the multiple first message sets are respectively stored in multiple storage nodes, and at least two first message sets are stored in different storage nodes.

[0016] According to an embodiment of the present disclosure, the message processing method further includes:

[0017] Group the messages to be processed according to the business actions to which they belong;

[0018] Allocating the message to be processed to a corresponding processing node according to the group to which the message to be processed belongs, and having the processing node perform the steps of determining a first message set corresponding to the message to be processed from the at least one first message set, and determining whether the first message set includes other messages belonging to the same service action as the message to be processed;

[0019] At least two to-be-processed messages in different groups are allocated to different processing nodes.

[0020] According to an embodiment of the present disclosure, the messages in the first message set are stored in an embedded key-value database, and the first association code is stored in a parameter cache server.

[0021] According to an embodiment of the present disclosure, for any message in the first message set, when the storage time of the message reaches a preset duration and the first message set does not include other messages belonging to the same business action as the message, the message and the messages belonging to the same business action as the message are deleted.

[0022] According to an embodiment of the present disclosure, the step of integrating the messages in the second message set includes:

[0023] Merging the messages in the second message set to obtain a merged message;

[0024] Determine the business process to which the merged message belongs based on the preset configuration rules;

[0025] According to the identification information in the merged message and the business process to which the merged message belongs, the merged message is assigned a corresponding process identifier to obtain the target message.

[0026] According to an embodiment of the present disclosure, the configuration rule includes at least one site table, at least one process table, and at least one site-process relationship table; wherein the at least one site table includes at least one site information, the at least one process table includes at least one process information, and the site-process relationship table includes a correspondence between at least one site information and at least one process information;

[0027] The step of determining the business process to which the merged message belongs according to the preset configuration rule includes:

[0028] According to the merged message, determining the site information corresponding to the merged message from the at least one site information to obtain the target site information;

[0029] Determining process information corresponding to the target site information based on the target site information and the site process relationship table to obtain target process information;

[0030] The business process to which the merged message belongs is determined according to the target process information.

[0031] According to an embodiment of the present disclosure, when there are multiple target process information, the step of determining the business process to which the merged message belongs includes:

[0032] Copy the merged message into multiple copies;

[0033] Determine the business process to which each copied message belongs;

[0034] Among the multiple copied messages, different messages belong to different business processes.

[0035] According to an embodiment of the present disclosure, after obtaining the target message each time, the message processing method further includes: storing the target message to obtain a target message set;

[0036] The identification information includes identity information. In the target message set, the target messages having the same identity information and belonging to the same business process have the same process identifier.

[0037] According to an embodiment of the present disclosure, the messages in the second message set include request messages, response messages and embedded messages.

[0038] A second aspect of the present disclosure provides a message processing device, comprising:

[0039] An acquisition module, configured to acquire a message to be processed, wherein each acquired message to be processed includes one of multiple messages generated according to a business action, and the multiple messages are generated by different business systems respectively;

[0040] a first processing module configured to, upon acquiring a message to be processed at least once, determine a first message set corresponding to the message to be processed from at least one first message set, and determine whether the first message set includes other messages belonging to the same service action as the message to be processed; if not, store the message to be processed in the first message set; and if so, form a second message set consisting of the message to be processed and the messages in the first message set belonging to the same service action as the message to be processed;

[0041] a second processing module, configured to allocate the second message sets to be processed to corresponding processing nodes according to the number of processing nodes and the number of the second message sets to be processed, and have the processing nodes integrate the messages in the second message sets;

[0042] At least two of the second message sets to be processed are allocated to different processing nodes.

[0043] The third aspect of the present disclosure provides an electronic device, comprising: one or more processors; a memory for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors execute the above-mentioned message processing method.

[0044] A fourth aspect of the present disclosure further provides a computer-readable storage medium having executable instructions stored thereon, which, when executed by a processor, causes the processor to execute the above-mentioned message processing method.

[0045] A fifth aspect of the present disclosure further provides a computer program product, comprising a computer program, which implements the above-mentioned message processing method when executed by a processor.

[0046] One or more of the above embodiments have the following advantages or beneficial effects:

[0047] When faced with a huge amount of messages that need to be processed, the message processing method disclosed in the present invention can process the messages to be processed immediately, with a faster processing speed, and can even achieve a processing speed of seconds, thereby ensuring the timeliness of the message data. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] The above contents and other objects, features and advantages of the present disclosure will become more apparent through the following description of the embodiments of the present disclosure with reference to the accompanying drawings, in which:

[0049] Figure 1 Schematically illustrates an application scenario diagram of the message processing method, apparatus, device, storage medium, and program product according to an embodiment of the present disclosure;

[0050] Figure 2 Schematically shows one of the flow charts of the message processing method according to an embodiment of the present disclosure;

[0051] Figure 3 A flowchart for obtaining a message to be processed according to an embodiment of the present disclosure is schematically shown;

[0052] Figure 4 A flowchart for determining whether the first message set includes other messages belonging to the same service action as the message to be processed according to an embodiment of the present disclosure is schematically shown;

[0053] Figure 5 The second flowchart of the message processing method according to the embodiment of the present disclosure is schematically shown;

[0054] Figure 6a The flowchart of processing the second message set according to an embodiment of the present disclosure is schematically shown;

[0055] Figure 6b A flowchart schematically illustrates determining the service process to which the merged message belongs according to a preset configuration rule according to an embodiment of the present disclosure;

[0056] Figure 6c A flowchart schematically illustrates determining the business process to which the merged message belongs based on target process information according to an embodiment of the present disclosure;

[0057] Figure 7 The third flowchart of the message processing method according to the embodiment of the present disclosure is schematically shown;

[0058] Figure 8 The following schematically shows a structural block diagram of a message processing device according to an embodiment of the present disclosure;

[0059] Figure 9 A block diagram of an electronic device suitable for implementing the message processing method according to an embodiment of the present disclosure is schematically shown. DETAILED DESCRIPTION

[0060] Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. However, it should be understood that these descriptions are merely exemplary and are not intended to limit the scope of the present disclosure. In the detailed description below, for ease of explanation, many specific details are set forth to provide a comprehensive understanding of the embodiments of the present disclosure. However, it is apparent that one or more embodiments may also be implemented without these specific details. In addition, in the following description, descriptions of well-known structures and technologies are omitted to avoid unnecessary confusion of the concepts of the present disclosure.

[0061] The terms used herein are only for describing specific embodiments and are not intended to limit the present disclosure. The terms "comprise," "include," etc. used herein indicate the presence of the features, steps, operations, and / or components, but do not exclude the presence or addition of one or more other features, steps, operations, or components.

[0062] All terms used herein (including technical and scientific terms) have the meanings commonly understood by those skilled in the art unless otherwise defined. It should be noted that the terms used herein should be interpreted as having a meaning consistent with the context of this specification and should not be interpreted in an idealized or overly rigid manner.

[0063] When expressions such as "at least one of A, B and C, etc." are used, they should generally be interpreted in accordance with the meaning of the expression commonly understood by those skilled in the art (for example, "a system having at least one of A, B and C" should include but is not limited to a system having A alone, B alone, C alone, A and B, A and C, B and C, and / or A, B, C, etc.).

[0064] It should be noted that the message processing methods, apparatuses, devices, storage media, and program products provided in the embodiments of the present disclosure can be used for message processing-related services in the financial sector, as well as for any field other than the financial sector. The application fields of the message processing methods, apparatuses, devices, storage media, and program products provided in the embodiments of the present disclosure are not limited.

[0065] In the embodiments of the present disclosure, the acquisition, storage and application of user personal information involved comply with the provisions of relevant laws and regulations, take necessary confidentiality measures, and do not violate public order and good morals.

[0066] An embodiment of the present disclosure provides a message processing method, which includes: obtaining a message to be processed, wherein each message to be processed obtained includes one of multiple messages generated according to a business action, and the multiple messages are respectively generated by different business systems. When the message to be processed is obtained at least once, a first message set corresponding to the message to be processed is determined from at least one first message set, and it is judged whether the first message set includes the remaining messages belonging to the same business action as the message to be processed. If not, the message to be processed is stored in the first message set; if so, a second message set is formed by the message to be processed and the messages in the first message set that belong to the same business action as the message to be processed. When faced with a huge amount of messages that need to be processed, the messages to be processed can be filtered by the above method, thereby greatly reducing the number of messages that need to be processed per unit time. At the same time, in an embodiment of the present disclosure, the second message sets to be processed can also be assigned to corresponding processing nodes based on the number of processing nodes and the number of the second message sets to be processed, and the processing nodes can integrate the messages in the second message sets, wherein at least two second message sets to be processed are assigned to different processing nodes. In this way, multiple second message sets to be processed can be respectively assigned to multiple processing nodes for processing, thereby fully utilizing the computing resources of each processing node. More importantly, in this way, the embodiments of the present disclosure can increase processing nodes according to actual needs, thereby achieving an increase in processing speed. The solution is simple, easy to implement, and highly flexible.

[0067] In summary, when faced with a huge amount of messages that need to be processed, the message processing method provided by the embodiments of the present disclosure can process the messages to be processed immediately, with a faster processing speed, and can even achieve a processing speed of seconds, thereby ensuring the timeliness of the data.

[0068] Figure 1 The application scenario diagram of the message processing method, apparatus, device, storage medium and program product according to the embodiments of the present disclosure is schematically shown.

[0069] like Figure 1 As shown, the application scenario 100 according to this embodiment may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 is used as a medium for providing a communication link between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired or wireless communication links or optical fiber cables.

[0070] Users can use terminal devices 101, 102, and 103 to interact with server 105 via network 104 to receive or send messages, etc. Various communication client applications can be installed on terminal devices 101, 102, and 103, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only as examples).

[0071] The terminal devices 101 , 102 , and 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, and desktop computers.

[0072] The server 105 may be a server that provides various services, such as a background management server (for example only) that supports websites browsed by users using the terminal devices 101, 102, and 103. The background management server may analyze and process received data such as user requests, and feed back processing results (such as web pages, information, or data obtained or generated according to user requests) to the terminal device.

[0073] It should be noted that the message processing method provided in the embodiments of the present disclosure can generally be executed by the server 105. Accordingly, the message processing apparatus provided in the embodiments of the present disclosure can generally be disposed in the server 105. The message processing method provided in the embodiments of the present disclosure can also be executed by a server or server cluster that is different from the server 105 and that is capable of communicating with the terminal devices 101, 102, 103 and / or the server 105. Accordingly, the message processing apparatus provided in the embodiments of the present disclosure can also be disposed in a server or server cluster that is different from the server 105 and that is capable of communicating with the terminal devices 101, 102, 103 and / or the server 105.

[0074] It should be understood that Figure 1 The number of terminal devices, networks and servers in the embodiment is merely illustrative. Any number of terminal devices, networks and servers may be provided as required.

[0075] The following will be based on Figure 1 The scene described by Figures 2 to 7 The message processing method of the disclosed embodiment is described in detail.

[0076] Figure 2 One of the flow charts of the message processing method according to an embodiment of the present disclosure is schematically shown.

[0077] like Figure 2 As shown, the message processing method of this embodiment includes steps S210 to S230.

[0078] In step S210, a message to be processed is obtained, wherein each message to be processed obtained includes one of multiple messages generated according to a business action, and the multiple messages are generated by different business systems respectively.

[0079] In the embodiments of the present disclosure, a business action may refer to one of the steps of a certain business. For example, the business may be a business in the financial field or a business in other fields. When the business is a business in the financial field, the business may be a credit card application business, a loan business, and a repayment business, etc. Each business includes multiple business actions. Taking the credit card application business as an example, the multiple business actions of the business include application, approval, card making, card issuance and other business actions. For each business action, multiple business systems will generate multiple messages respectively, such as a request message sent by the user, a response message generated for the request message, and a buried message generated according to the user's specific operation.

[0080] In an embodiment of the present disclosure, a streaming data (e.g., Flink) processing method may be used to process messages. Streaming data refers to a data sequence that arrives continuously over time. That is, in an embodiment of the present disclosure, messages to be processed arrive continuously over time. Step S220 is executed when the message to be processed is obtained at least once.

[0081] In step S220, a first message set corresponding to the message to be processed is determined from at least one first message set, and a determination is made as to whether the first message set includes other messages belonging to the same service action as the message to be processed. If not, the message to be processed is stored in the first message set. If so, a second message set is formed consisting of the message to be processed and the messages in the first message set that belong to the same service action as the message to be processed.

[0082] In the embodiment of the present disclosure, the remaining messages may refer to: all messages that belong to the same business action as the message to be processed and are of a different type from the message to be processed. For example, as mentioned above, for each business action, multiple business systems can generate three types of messages respectively, that is, request messages, response messages, and buried point messages. If the message to be processed is a request message, then the remaining messages refer to response messages and buried point messages. If the message to be processed is a response message, then the remaining messages refer to request messages and buried point messages. In the embodiment of the present disclosure, the first message set corresponding to the message to be processed may refer to the first message set that stores messages belonging to the same business action as the message to be processed. If the message to be processed is a request message, then the first message set corresponding to the message to be processed is the first message set that stores response messages or buried point messages. Due to various factors such as network transmission speed and performance jitter, request messages, response messages and tracking messages often do not arrive at the same time. Therefore, in the embodiment of the present disclosure, the next step of processing will be carried out only when the request message, response message and tracking message all arrive, that is, step S230 is executed; otherwise, the message to be processed will be stored in the first message set until the remaining two messages arrive.

[0083] For example, for a certain business action A, multiple business systems generate request message a1, response message a2, and embedded message a3 respectively. When the request message a1 arrives first, there is no response message a2 and embedded message a3 in the multiple first message sets at this time. Therefore, the request message a1 is stored in one of the first message sets. When the response message a2 arrives second, the first message set storing the request message a1 is extracted from the multiple first message sets to obtain the first message set corresponding to the response message a2. Since the first message set stores the request message a1 but no embedded message a3, the response message a2 is also stored in the first message set. When the buried message a3 arrives, the first message set storing the request message a1 (or response message a2) is extracted from the multiple first message sets to obtain the first message set corresponding to the buried message a3. Since the request message a1 and the response message a2 are stored in the first message set, the second message set is composed of the request message a1, the response message a2 and the buried message a3. When faced with a huge amount of messages that need to be processed, the above method can be used to extract part of the huge amount of messages for the next step of processing, thereby achieving the effect of buffering and filtering. When faced with a data volume of tens of billions, the above method can reduce the data volume to one tenth, thereby greatly reducing the messages that need to be processed per unit time. At the same time, as long as the three messages belonging to the same business action arrive, the second message set can be composed of these three messages, thereby ensuring that the message will not be missed.

[0084] In an embodiment of the present disclosure, before step S220, the messages to be processed may be grouped, so that the messages to be processed of the same business action are assigned to the same processing node to execute step S220, thereby improving processing efficiency. This will be described in detail below and will not be repeated here.

[0085] In step S230, the second message sets to be processed are allocated to corresponding processing nodes according to the number of processing nodes and the number of the second message sets to be processed, and the processing nodes integrate the messages in the second message sets, wherein at least two second message sets to be processed are allocated to different processing nodes.

[0086] In an embodiment of the present disclosure, the second message sets to be processed can be grouped. For example, the second message sets can be grouped using a Keyby operator, and second message sets with the same first index can be divided into the same group. The first index can be determined based on actual needs and is not limited here. Subsequently, the second message sets in the same group are assigned to the same processing node, and the second message sets in different groups are assigned to different processing nodes.

[0087] In the embodiments of the present disclosure, the number of second message sets allocated to each processing node can be determined based on actual needs, without limitation. For example, a second message set can be allocated to each processing node based on the performance of the processing node. For example, a larger number of second message sets can be allocated to processing nodes with higher processing performance, while a smaller number of second message sets can be allocated to processing nodes with lower processing performance. For another example, the number of second message sets allocated to each processing node can be roughly the same, thereby maintaining a balanced load on multiple processing nodes.

[0088] In this way, multiple second message sets to be processed can be respectively assigned to multiple processing nodes for processing, thereby making full use of the computing resources of each processing node. More importantly, in this way, the embodiments of the present disclosure can increase processing nodes according to actual needs, thereby achieving an increase in processing speed, so that the processing speed does not depend on the performance of a single machine. The solution is simple and easy to implement, and has high flexibility, which is conducive to coping with the increasing amount of data in the future.

[0089] In summary, when faced with a huge amount of messages that need to be processed, the message processing method provided by the embodiments of the present disclosure can process the messages to be processed immediately, with a faster processing speed, and can even achieve a processing speed of seconds, thereby ensuring the timeliness of the data.

[0090] The following combination Figures 2 to 7 The message processing method provided in the embodiments of the present disclosure is further described.

[0091] As mentioned above, for each business action, multiple business systems can generate multiple messages respectively. Optionally, in an embodiment of the present disclosure, for each business action, multiple business systems generate three messages respectively, namely, a request message, a response message and a tracking message. In other words, in an embodiment of the present disclosure, there are also three types of messages in the second message set, namely, a request message, a response message and a tracking message.

[0092] Figure 3 A flowchart of obtaining a message to be processed according to an embodiment of the present disclosure is schematically shown. Figure 3 As shown, step S210 includes: step S211 to step S212.

[0093] In step S211, the global tracking number, transaction code and first menu code in the message to be processed are extracted.

[0094] In the embodiments of the present disclosure, the global tracking number refers to a unique mark of a business action in each system. The same global tracking number represents that a business action is completed. A business action has at least one transaction code. The transaction code refers to the code corresponding to the name of a specific business action. The first menu code refers to the unique mark of the menu to which the transaction code of the message belongs. Different menus have different first menu codes. That is, there can be a one-to-one correspondence between the first menu code and the menu.

[0095] Optionally, in an embodiment of the present disclosure, the message may be parsed into a POJO (Plain Ordinary Java Object) type, and then the global tracking number, the transaction code, and the first menu code may be extracted from the parsed message.

[0096] In step S212, a first correlation code of the message to be processed is generated according to the global tracking number, the transaction code and the first menu code, wherein the first correlation code of messages belonging to the same business action is the same.

[0097] In the embodiments of the present disclosure, the global tracking number, transaction code, and first menu code can be concatenated to obtain the first associated code for the message. It should be noted that the three messages belonging to the same service action (request message, response message, and tracking message) all have the same global tracking number (transaction code / first menu code). Therefore, for these three messages, the first associated code obtained by concatenating the global tracking number, transaction code, and first menu code is also the same.

[0098] In some specific embodiments, the messages in the first message set are stored in an embedded key-value database (eg, RocksDB), and the first association code is stored in a parameter cache server (eg, Redis).

[0099] In some specific embodiments, there are multiple first message sets, and the multiple first message sets are respectively stored in multiple storage nodes, and at least two first message sets are stored in different storage nodes.

[0100] In the embodiments of the present disclosure, messages belonging to the same business action are stored in the same first message set. Since multiple first message sets can be stored in multiple storage nodes in a dispersed manner, the storage capacity of the messages can be increased by increasing the number of storage nodes. Compared with storing the messages in a single node, both are for increasing the storage capacity. The difficulty of increasing the number of storage nodes is significantly lower than the difficulty of improving the storage performance of a single node, thereby greatly reducing the cost required to increase the storage capacity.

[0101] In some specific embodiments, the message processing method further includes step S241 and step S242.

[0102] In step S241, the messages to be processed are grouped according to the service actions to which the messages to be processed belong.

[0103] In step S242 , the message to be processed is allocated to a corresponding processing node according to the group to which the message to be processed belongs, and the processing node executes the above step S220 .

[0104] At least two to-be-processed messages in different groups are allocated to different processing nodes.

[0105] In the embodiment of the present disclosure, by grouping the messages to be processed, the messages belonging to the same business action can be assigned to the same processing node, thereby improving processing efficiency. For example, for the above-mentioned business action A, its request message a1, response message a2 and buried message a3 can be divided into group L1, and when the message to be processed belonging to group L1 (any one of the request message a1, response message a2 and buried message a3) arrives, it will be assigned to processing node X1, and the above-mentioned step S220 will be performed at processing node X1. For business action B, its request message b1, response message b2 and buried message b3 can be divided into group L2, and when the message to be processed belonging to group L2 (any one of the request message b1, response message b2 and buried message b3) arrives, it will be assigned to processing node X2, and the above-mentioned step S220 will be performed at processing node X2. In this way, by increasing the processing nodes, the number of messages to be processed that can be processed per unit time can be increased, thereby improving the processing speed.

[0106] In the disclosed embodiments, the method for grouping the messages to be processed can be selected based on actual needs. For example, the messages to be processed can be grouped using a keyby operator. In the disclosed embodiments, the keyby operator can be used to group messages to be processed that have the same second indicator into the same group, thereby grouping messages to be processed for the same business action into the same group. For example, the second indicator can include some or all of the global tracking number, transaction code, and first menu code described above, or the second indicator can also include the first association code described above.

[0107] Figure 4 A flowchart of determining whether the first message set includes other messages belonging to the same service action as the message to be processed according to an embodiment of the present disclosure is schematically shown. Figure 4 As shown, step S220 includes step S221.

[0108] In step S221, it is determined whether the first message set stores any message with the same first correlation code as the message to be processed, and the number of messages with the same first correlation code as the message to be processed stored in the first message set is equal to a preset number.

[0109] When the first message set stores a message having the same first association code as the message to be processed, and the number of messages having the same first association code as the message to be processed stored in the first message set is equal to a preset number, it is determined that the first message set includes remaining messages that belong to the same business action as the message to be processed.

[0110] In an embodiment of the present disclosure, the preset number can be determined based on the number of types of messages that can be generated by a business action. For example, when a business action can generate three types of messages, namely, a request message, a response message, and a tracking message, the preset number can be 2. That is, if the first association code of the message to be processed is A1, when two messages with the first association code A1 are stored in the first message set, it is determined that the first message set includes the remaining messages that belong to the same business action as the message to be processed.

[0111] Figure 5 The second flowchart of the message processing method according to the embodiment of the present disclosure is schematically shown. Figure 5 As shown, the message processing method further includes step S250.

[0112] In step S250, for at least one message in the first message set, when the storage time of the message reaches a preset time length and the first message set does not include other messages belonging to the same business action as the message, delete the message and the messages belonging to the same business action as the message.

[0113] In an embodiment of the present disclosure, the preset duration can be determined according to actual needs. For example, the preset duration can be set to 1 hour. For example, for business action B, multiple business systems generate request message b1, response message b2, and buried message b3 respectively. Due to problems such as transmission errors, the request message b1 and the response message b2 arrive but the buried message b3 does not arrive. At this time, the first message set stores the request message b1 and the response message b2. When the storage time of any one of the request message b1 and the response message b2 in the first message set reaches 1 hour, and the buried message b3 is still not stored in the first message set, the request message b1 and the response message b2 are deleted, thereby realizing the timed cleaning of the storage space.

[0114] Figure 6a The flowchart of processing a message according to an embodiment of the present disclosure is schematically shown. Figure 6a As shown, step S230 includes steps S231 to S233.

[0115] In step S231, the messages in the second message set are merged to obtain a merged message.

[0116] In step S232, the business process to which the merged message belongs is determined according to the preset configuration rule.

[0117] In the embodiments of the present disclosure, the business process can be a business process in the financial field such as a commercial bank, or a business process in other fields, and can be determined according to actual needs. The following uses the business process in a commercial bank as an example to illustrate the configuration rules of the embodiments of the present disclosure.

[0118] Commercial banking systems contain hundreds or even thousands of different services. Due to varying business scenarios, the same service's business processes vary across different commercial banks. For example, for the same service, the business process at Commercial Bank X includes Action A and Action B, while the process at Commercial Bank Y includes Actions A, B, and C. Therefore, after receiving a merged message, determining the business process to which the message belongs and assigning the message to that process is a complex problem.

[0119] In the embodiment of the present disclosure, the business process to which the message belongs can be determined according to the configuration rules, wherein the configuration rules can be configured according to the actual needs of each bank for the business process.

[0120] Specifically, in an embodiment of the present disclosure, the configuration rules include at least one site table, at least one process table, and at least one site-process relationship table. The at least one site table includes at least one site information, the at least one process table includes at least one process information, and the site-process relationship table includes the correspondence between at least one process information and at least one site information.

[0121] In the embodiments of the present disclosure, each business process may include multiple business actions. Each piece of site information corresponds to a business action, and different site information corresponds to different business actions. Each piece of process information corresponds to a business process, and different process information corresponds to different business processes. Taking a bank credit card application as an example, a credit card application generally goes through six business actions: application, approval, card production, issuance, activation, and use. Each piece of site information corresponds to one of these six business actions, and the process information corresponds to the credit card application business process.

[0122] Optionally, each business action may include at least one sub-action, and each business action's sub-action may include multiple sub-actions in parallel. For example, the business action "apply" may include sub-actions such as WeChat channel application and employee channel application, where employee channel application may be, for example, a counter application. For another example, the business action "activate" includes sub-actions such as telephone activation, branch activation, and mobile internet banking activation. In an embodiment of the present disclosure, the site information corresponding to the business action "apply" may be marked as the starting site to indicate that a process starts from this site.

[0123] Optionally, each business action can include at least one sub-action, and each step's sub-action can include multiple sub-actions executed sequentially. For example, the "Card Production" business action can include sub-actions such as Card Production Application, Card Production Approval, and Card Production Completion. When all three sub-actions are completed, the "Card Production" business action is complete.

[0124] Table 1 schematically shows a site information in the site table. As shown in Table 1, the site information may include: site ID, site name, starting site flag, source channel (for example, the application comes from the WeChat channel or the employee channel) and site concatenation data items, etc., wherein VARCHAR(*) represents the form of a string, and "*" represents the length of the string. The site concatenation data items will be introduced in detail below and will not be repeated here.

[0125] Table 1

[0126] Site ID VARCHAR(240) Site Name VARCHAR(240) Starting point sign VARCHAR(10) Source Channel VARCHAR(3000) Site connection data items VARCHAR(3000)

[0127] In the embodiment of the present disclosure, after the "activation" business action is completed, the "use" business action is entered. Optionally, the site information corresponding to the "use" business action can be marked as a termination site to indicate that a certain process ends at this site.

[0128] Table 2 schematically shows a process information in the process table. As shown in Table 2, the process information may include: process ID, process name. In the embodiment of the present disclosure, for the same business, the business processes of different institutions (i.e., different banks) are not exactly the same. For example, for some institutions, the business action of "making a card" includes the above-mentioned sub-actions such as card application, card approval, and card completion, while for some banks, the business action of "making a card" may not include the above-mentioned sub-actions. Therefore, the process information may also include information such as the institution ID, so that corresponding process information can be configured for each bank. Among them, VARCHAR2(*) represents the form of a string, and "*" represents the length of the string.

[0129] Table 2

[0130] Process ID VARCHAR2(64) Process Name VARCHAR2(200) Institution ID VARCHAR2(60)

[0131] As mentioned above, each site process relationship table includes at least one process information and a correspondence between at least one site information. For example, each site process relationship table includes at least one site process correspondence information. Table 3 schematically shows a site process relationship information in the site process relationship table. Each site process relationship information includes the site process relationship ID of the site process relationship, the process ID of the process information, and the site ID of the site information corresponding to the process information. In other words, each site process relationship information can represent the correspondence between a process information and a site information.

[0132] Table 3

[0133] RID Site process relationship ID VARCHAR2(64) FLWDEFID Process ID VARCHAR2(64) NODEID Site ID VARCHAR2(60)

[0134] Taking the bank credit card application business described above as an example, for Commercial Bank X, the business process for this business includes six business actions: application, approval, card production, card issuance, activation, and use. For Commercial Bank Y, the business process for this business includes six business actions: application, approval, card production application, card production approval, card production completion, card issuance, activation, and use. Therefore, for Commercial Bank X, six site information, one process information, and six site-process relationship information can be configured. The six site information corresponds to the six business actions of application, approval, card production, card issuance, activation, and use, respectively. The process information includes the institution ID (i.e., Commercial Bank X) and the process ID (i.e., the credit card application business process). Each of the six site-process relationship information is configured with a site ID (i.e., one of the six business actions: application, approval, card production, card issuance, activation, and use). The site IDs in the six site-process relationship information are different, and the process IDs of these six site-process relationship information are the same. For commercial bank Y, eight site information, one process information and eight site process relationship information can be configured. The eight site information correspond to the eight business actions of application, approval, card application, card approval, card completion, card issuance, activation and use. The process information includes the institution ID (that is, commercial bank Y) and the process ID (that is, the credit card application business process). In the eight site process relationship information, each site process relationship information is configured with a site ID (that is, one of the eight business actions of application, approval, card application, card approval, card completion, card issuance, activation and use). The site IDs in the eight site process relationship information are different, and the process IDs of these eight site process relationship information are the same.

[0135] Optionally, the site table, process table, and site-process relationship table can be configured through a page. For example, in an embodiment of the present disclosure, multiple site information can be configured individually or in batches in the site table through a page, process information can be configured individually or in batches in the process table through a page, and the correspondence between site information and process information can be configured in the site-process relationship table through a page. In an embodiment of the present disclosure, configuration rules that meet various business scenarios can be configured through the site table, process table, and site-process relationship table.

[0136] Optionally, in an embodiment of the present disclosure, a business process may be visualized. For example, all business actions in a business process may be displayed, as well as the specific business action to which the business process is currently progressing, thereby intuitively displaying the business process.

[0137] The configuration rules in the embodiments of the present disclosure can cope with changing business needs and have high flexibility.

[0138] Figure 6b A flowchart schematically shows the business process to which the merged message belongs according to an embodiment of the present disclosure, as shown in FIG. Figure 6b As shown, step S232 includes steps S2321 to S2323.

[0139] In step S2321, based on the merged message, site information corresponding to the merged message is determined from at least one site information to obtain target site information.

[0140] In an embodiment of the present disclosure, the message to be processed records the business action to which the message to be processed belongs. After the message to be processed is merged and other operations are performed, the merged message still records the business action to which the message belongs. Through the correspondence between the business action and the site information, the site information corresponding to the merged message can be determined from at least one site information.

[0141] In step S2322, process information corresponding to the target site information is determined based on the target site information and the site-process relationship table to obtain target process information.

[0142] In the embodiment of the present disclosure, as described above, the site process relationship table is configured with a correspondence between site information and process information. Once the site information is determined (that is, the target site information), the corresponding process information can be found through the correspondence configured in the site process relationship table.

[0143] In step S2323, the business process to which the merged message belongs is determined according to the target process information.

[0144] In the embodiment of the present disclosure, as described above, each process information corresponds to a business process. Once the process information is determined (ie, the target process information), the business process to which the merged message belongs can be determined.

[0145] Optionally, in embodiments of the present disclosure, one piece of process information may correspond to multiple pieces of site information, and vice versa. The specific number of pieces of site information may be determined based on actual needs. However, when configuring the site-process relationship table, each piece of site-process relationship information only includes one piece of process information and one piece of site information corresponding to the process information. For example, site-process relationship information D includes process information E and one piece of site information F corresponding to process information E. Furthermore, site information F may also correspond to process information G. Therefore, in site-process relationship information H, the corresponding relationship between process information G and site information F is configured.

[0146] In the embodiment of the present disclosure, since one site information may correspond to multiple process information, the target process information determined according to one target site information may be multiple. Figure 6c A flowchart of a business process described in a merged message is schematically shown according to an embodiment of the present disclosure, as shown in FIG. Figure 6c As shown, when the number of target process information is multiple, step S2323 includes steps S2323a to S2323b.

[0147] In step S2323a, the merged message is copied into multiple copies.

[0148] In step S2323b, the business process to which each copied message belongs is determined.

[0149] Among the multiple copied messages, different messages belong to different business processes.

[0150] For example, for the merged message I, the target site information of message I is site information F, and the two target process information determined based on site information F are process information G and process information E, respectively. In this case, in step S2324a, message I is copied into two, resulting in message I1 and message I2. Subsequently, in step S2324b, the business process to which message I1 belongs is determined based on process information G, and the business process to which message I2 belongs is determined based on process information E.

[0151] like Figure 6a As shown, after step S232, step S233 is executed.

[0152] In step S233, a corresponding process identifier is assigned to the merged message according to the identification information in the merged message and the business process to which the merged message belongs, so as to obtain a target message.

[0153] In an embodiment of the present disclosure, the site concatenation data item in the site table can be configured as the customer's identity information, etc. When determining the target site information of the merged message from the site table, the customer's identity information can be read from the merged message based on the site concatenation data item configured in the process table as the aforementioned identification information. For example, for customers J1 and J2, both customers J1 and J2 perform the "apply" action for a credit card. Through steps S210 to S232 above, two merged messages (hereinafter referred to as messages I3 and I4) can be obtained, and it can be determined that messages I3 and I4 both belong to the credit card application business process K. Through step S233, the identity information of the customer of message I3 (i.e., customer J1) and the identity information of the customer of message I4 (i.e., customer J2) can be determined. Furthermore, based on customer J1's identity information, a corresponding process identifier K1 can be assigned to message I3, and based on customer J2's identity information, a corresponding process identifier K2 can be assigned to message I4, thereby enabling the messages to be grouped for each customer.

[0154] Figure 7 The third flowchart of the message processing method according to the embodiment of the present disclosure is schematically shown. Figure 7 As shown, after obtaining the target message each time, the message processing method further includes step S260.

[0155] In step S260, the target message is stored to obtain a target message set.

[0156] The identification information includes identity information. In the target message set, target messages with the same identity information and belonging to the same business process have the same process identifier.

[0157] For example, for customer J1, the process identifiers of the target messages generated for the customer's application, approval, card production, issuance, activation and use business actions are all the same, so that all target messages corresponding to a customer can be concatenated into a unique process for the customer.

[0158] Based on the above message processing method, the present disclosure also provides a message processing device. Figure 8 The device is described in detail. Figure 8 The structural block diagram of the message processing device according to an embodiment of the present disclosure is schematically shown.

[0159] like Figure 8 As shown, the message processing device 800 of this embodiment includes an acquisition module 810 , a first processing module 820 and a second processing module 830 .

[0160] Acquisition module 810 is configured to acquire a message to be processed, wherein each acquired message to be processed includes one of multiple messages generated according to a business action, wherein the multiple messages are generated by different business systems. In one embodiment, acquisition module 810 can be configured to execute step S210 described above, which will not be further described here.

[0161] The first processing module 820 is configured to, upon acquiring a message to be processed at least once, determine a first message set corresponding to the message to be processed from at least one first message set, and determine whether the first message set includes other messages belonging to the same service action as the message to be processed. If not, store the message to be processed in the first message set. If so, a second message set is formed consisting of the message to be processed and the messages in the first message set belonging to the same service action as the message to be processed. In one embodiment, the first processing module 820 may be configured to execute step S220 described above, which will not be further described here.

[0162] The second processing module 830 is configured to allocate the second message sets to be processed to corresponding processing nodes based on the number of processing nodes and the number of second message sets to be processed, and to have the processing nodes integrate the messages in the second message sets. In one embodiment, the second processing module 830 can be configured to execute step S230 described above, which will not be described in detail here.

[0163] At least two second message sets to be processed are allocated to different processing nodes.

[0164] When faced with a huge amount of messages that need to be processed, the message processing device provided by the embodiment of the present disclosure can process the messages to be processed immediately, with a faster processing speed, and can even achieve a processing speed with a delay of seconds, thereby ensuring the timeliness of the message data.

[0165] According to an embodiment of the present disclosure, the message processing device 800 includes any multiple modules of the acquisition module 810, the first processing module 820, and the second processing module 830, which can be combined into a single module for implementation, or any one of the modules can be split into multiple modules. Alternatively, at least part of the functions of one or more of these modules can be combined with at least part of the functions of other modules and implemented in a single module. According to an embodiment of the present disclosure, the message processing device 800 includes at least one of the acquisition module 810, the first processing module 820, and the second processing module 830, which can be at least partially implemented as a hardware circuit, such as a field programmable gate array (FPGA), a programmable logic array (PLA), a system on a chip, a system on a substrate, a system on a package, an application-specific integrated circuit (ASIC), or can be implemented by hardware or firmware in any other reasonable manner of integrating or packaging the circuit, or can be implemented in any one of the three implementation methods of software, hardware, and firmware, or in an appropriate combination of any of them. Alternatively, the message processing device 800 includes at least one of the acquisition module 810, the first processing module 820 and the second processing module 830, which can be at least partially implemented as a computer program module, and when the computer program module is run, the corresponding function can be executed.

[0166] Figure 9 A block diagram of an electronic device suitable for implementing the message processing method according to an embodiment of the present disclosure is schematically shown.

[0167] like Figure 9As shown, the electronic device 900 according to an embodiment of the present disclosure includes a processor 901, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 902 or a program loaded from a storage part 908 into a random access memory (RAM) 903. The processor 901 may, for example, include a general-purpose microprocessor (such as a CPU), an instruction set processor and / or a related chipset and / or a special-purpose microprocessor (for example, an application-specific integrated circuit (ASIC)), etc. The processor 901 may also include an onboard memory for caching purposes. The processor 901 may include a single processing unit or multiple processing units for executing different actions of the message processing method flow according to an embodiment of the present disclosure.

[0168] Various programs and data required for the operation of the electronic device 900 are stored in the RAM 903. The processor 901, ROM 902, and RAM 903 are connected to each other via a bus 904. The processor 901 performs various operations of the method flow according to the embodiment of the present disclosure by executing the programs in the ROM 902 and / or RAM 903. It should be noted that the programs may also be stored in one or more memories other than the ROM 902 and RAM 903. The processor 901 may also perform various operations of the flow of the message processing method according to the embodiment of the present disclosure by executing the programs stored in the one or more memories.

[0169] According to an embodiment of the present disclosure, the electronic device 900 may further include an input / output (I / O) interface 905, which is also connected to the bus 904. The electronic device 900 may further include one or more of the following components connected to the I / O interface 905: an input portion 906 including a keyboard, a mouse, etc.; an output portion 907 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker; a storage portion 908 including a hard disk, etc.; and a communication portion 909 including a network interface card such as a LAN card or a modem. The communication portion 909 performs communication processing via a network such as the Internet. A drive 910 is also connected to the I / O interface 905 as needed. A removable medium 911, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed in the drive 910 as needed, so that a computer program read therefrom can be installed into the storage portion 908 as needed.

[0170] The present disclosure also provides a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiments, or may exist independently and not be incorporated into the device / apparatus / system. The computer-readable storage medium carries one or more programs, which, when executed, implement the message processing method according to the embodiments of the present disclosure.

[0171] According to an embodiment of the present disclosure, a computer-readable storage medium may be a non-volatile computer-readable storage medium, for example, it may include but is not limited to: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, apparatus, or device. For example, according to an embodiment of the present disclosure, a computer-readable storage medium may include the ROM 902 and / or RAM 903 described above and / or one or more memories other than ROM 902 and RAM 903.

[0172] The embodiments of the present disclosure also include a computer program product, which includes a computer program containing program code for executing the method shown in the flowchart. When the computer program product is executed in a computer system, the program code is used to enable the computer system to implement the message processing method provided by the embodiments of the present disclosure.

[0173] The computer program executes the above functions defined in the system / device of the embodiment of the present disclosure when the processor 901 executes the computer program. According to the embodiment of the present disclosure, the system, device, module, unit, etc. described above can be implemented by a computer program module.

[0174] In one embodiment, the computer program may be stored on a tangible storage medium such as an optical storage device or a magnetic storage device. In another embodiment, the computer program may be transmitted and distributed in the form of a signal on a network medium, downloaded and installed via the communication portion 909, and / or installed from a removable medium 911. The program code contained in the computer program may be transmitted using any appropriate network medium, including but not limited to wireless, wired, or any suitable combination thereof.

[0175] In such an embodiment, the computer program can be downloaded and installed from a network via the communication section 909, and / or installed from a removable medium 911. When the computer program is executed by the processor 901, the above-described functions defined in the system of the embodiment of the present disclosure are performed. According to the embodiment of the present disclosure, the systems, devices, means, modules, units, etc. described above can be implemented by computer program modules.

[0176] According to an embodiment of the present disclosure, the program code for executing the computer program provided by the embodiment of the present disclosure can be written in any combination of one or more programming languages. Specifically, these computer programs can be implemented using high-level procedural and / or object-oriented programming languages, and / or assembly / machine languages. Programming languages ​​include, but are not limited to, languages ​​such as Java, C++, python, "C" or similar programming languages. The program code can be executed entirely on the user computing device, partially on the user device, partially on a remote computing device, or entirely on a remote computing device or server. In cases involving a remote computing device, the remote computing device can be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computing device (for example, using an Internet service provider to connect via the Internet).

[0177] The flowcharts and block diagrams in the accompanying drawings illustrate the possible implementation architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each box in the flowchart or block diagram can represent a module, program segment, or a part of code, and the above-mentioned module, program segment, or a part of code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in an order different from that marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flowchart, and the combination of boxes in the block diagram or flowchart, can be implemented with a dedicated hardware-based system that performs the specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0178] Those skilled in the art will appreciate that the features described in the various embodiments and / or claims of this disclosure may be combined and / or coupled in various ways, even if such combinations and / or couplings are not explicitly described in this disclosure. In particular, the features described in the various embodiments and / or claims of this disclosure may be combined and / or coupled in various ways without departing from the spirit and teachings of this disclosure. All such combinations and / or couplings are intended to fall within the scope of this disclosure.

[0179] The embodiments of the present disclosure are described above. However, these embodiments are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although each embodiment has been described separately above, this does not mean that the measures in each embodiment cannot be used in combination to advantage. The scope of the present disclosure is defined by the appended claims and their equivalents. Without departing from the scope of the present disclosure, those skilled in the art may make various substitutions and modifications, which should all fall within the scope of the present disclosure.

Claims

1. A message processing method, characterized in that: include: Obtaining a message to be processed, wherein each acquired message to be processed includes one of multiple messages generated according to a business action, the multiple messages being generated by different business systems. The step of obtaining the message to be processed includes: extracting a global tracking number, a transaction code, and a first menu code from the message to be processed; generating a first association code for the message to be processed based on the global tracking number, the transaction code, and the first menu code, wherein the first association code is the same for messages belonging to the same business action; when the message to be processed is acquired at least once, determining a first message set corresponding to the message to be processed from at least one first message set, and determining whether the first message set includes other messages belonging to the same business action as the message to be processed. If not, storing the message to be processed in the first message set; and if so, forming a second message set consisting of the message to be processed and the messages in the first message set belonging to the same business action as the message to be processed; Allocating the second message sets to be processed to corresponding processing nodes based on the number of processing nodes and the number of the second message sets to be processed, and having the processing nodes integrate the messages in the second message sets; wherein allocating the second message sets to be processed to corresponding processing nodes based on the number of processing nodes and the number of the second message sets to be processed includes: allocating the processing nodes based on a positive correlation between the processing performance of the processing nodes and the number of the second message sets to be processed, or evenly allocating the processing nodes; At least two of the second message sets to be processed are allocated to different processing nodes.

2. The message processing method according to claim 1, characterized in that The step of determining whether the first message set includes other messages belonging to the same service action as the message to be processed includes: When the first message set stores messages with the same first association code as the message to be processed, and the number of messages with the same first association code as the message to be processed stored in the first message set is equal to a preset number, it is determined that the first message set includes remaining messages that belong to the same business action as the message to be processed.

3. The message processing method according to claim 2, characterized in that: There are multiple first message sets, and the multiple first message sets are stored in multiple storage nodes respectively, and at least two first message sets are stored in different storage nodes.

4. The message processing method according to claim 2, characterized in that: The messages in the first message set are stored in an embedded key-value database, and the first association code is stored in a parameter cache server.

5. The message processing method according to claim 1, characterized in that: The message processing method further includes: Group the messages to be processed according to the business actions to which they belong; Allocating the message to be processed to a corresponding processing node according to the group to which the message to be processed belongs, and having the processing node perform the steps of determining a first message set corresponding to the message to be processed from the at least one first message set, and determining whether the first message set includes other messages belonging to the same service action as the message to be processed; At least two to-be-processed messages in different groups are allocated to different processing nodes.

6. The message processing method according to claim 1, characterized in that: For any message in the first message set, when the storage time of the message reaches a preset time length and the first message set does not include other messages belonging to the same business action as the message, delete the message and the messages belonging to the same business action as the message.

7. The message processing method according to claim 1, characterized in that: The step of integrating the messages in the second message set includes: Merging the messages in the second message set to obtain a merged message; Determine the business process to which the merged message belongs based on the preset configuration rules; According to the identification information in the merged message and the business process to which the merged message belongs, the merged message is assigned a corresponding process identifier to obtain the target message.

8. The message processing method according to claim 7, characterized in that: The configuration rule includes at least one site table, at least one process table, and at least one site-process relationship table; wherein the at least one site table includes at least one site information, the at least one process table includes at least one process information, and the site-process relationship table includes a correspondence between at least one site information and at least one process information; The step of determining the business process to which the merged message belongs according to the preset configuration rule includes: According to the merged message, determining the site information corresponding to the merged message from the at least one site information to obtain the target site information; Determining process information corresponding to the target site information based on the target site information and the site process relationship table to obtain target process information; The business process to which the merged message belongs is determined according to the target process information.

9. The message processing method according to claim 8, characterized in that: When there are multiple target process information, the step of determining the business process to which the merged message belongs includes: Copy the merged message into multiple copies; Determine the business process to which each copied message belongs; Among the multiple copied messages, different messages belong to different business processes.

10. The message processing method according to claim 7, characterized in that: After obtaining the target message each time, the message processing method further includes: storing the target message to obtain a target message set; The identification information includes identity information. In the target message set, the target messages having the same identity information and belonging to the same business process have the same process identifier.

11. The message processing method according to claim 1, characterized in that: The messages in the second message set include request messages, response messages and embedded messages.

12. A message processing device, characterized in that: include: an acquisition module configured to acquire a message to be processed, wherein each acquired message to be processed comprises one of multiple messages generated according to a business action, wherein the multiple messages are respectively generated by different business systems; the step of acquiring the message to be processed comprises: extracting a global tracking number, a transaction code, and a first menu code from the message to be processed; and generating a first associated code for the message to be processed based on the global tracking number, the transaction code, and the first menu code, wherein the first associated code is the same for messages belonging to the same business action; a first processing module configured to, upon acquiring a message to be processed at least once, determine a first message set corresponding to the message to be processed from at least one first message set, and determine whether the first message set includes other messages belonging to the same service action as the message to be processed; if not, store the message to be processed in the first message set; and if so, form a second message set consisting of the message to be processed and the messages in the first message set belonging to the same service action as the message to be processed; a second processing module, configured to allocate the second message sets to be processed to corresponding processing nodes based on the number of processing nodes and the number of the second message sets to be processed, and have the processing nodes integrate messages in the second message sets; wherein allocating the second message sets to be processed to corresponding processing nodes based on the number of processing nodes and the number of the second message sets to be processed includes: allocating the processing nodes based on a positive correlation between the processing performance of the processing nodes and the number of the second message sets to be processed, or evenly allocating the processing nodes; At least two of the second message sets to be processed are allocated to different processing nodes.

13. An electronic device comprising: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors are enabled to execute the method according to any one of claims 1 to 11.

14. A computer-readable storage medium having executable instructions stored thereon, which, when executed by a processor, causes the processor to perform the method according to any one of claims 1 to 11.

15. A computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the method according to any one of claims 1 to 11 is implemented.

Images