Message processing method, device, medium and computer program product
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- KE COM (BEIJING) TECHNOLOGY CO LTD
- Filing Date
- 2026-02-24
- Publication Date
- 2026-07-14
Smart Images
Figure CN122387702A_ABST
Abstract
Description
Technical Field
[0001] This disclosure relates to the field of data processing technology, and in particular to a message processing method, apparatus, medium, and computer program product. Background Technology
[0002] With the rise of online business, more and more business processes are being conducted online. Multiple business units performing the same task form a distributed message processing system. For example, in the home buying business, this might include an order processing unit, a payment unit, and so on. When multiple business units are processing tasks, messages are sent to the interacting business units, and the receiving business units process the received messages.
[0003] In related technologies, network latency or lag may cause some messages generated earlier to be received later. For example, an order creation completion message may be generated first, followed by a payment request message. However, due to network lag, the payment request message may be received first, resulting in out-of-order messages. Since the order creation completion message has not yet been received, it is impossible to determine how to process the payment request message. In this case, manual intervention is required to handle the out-of-order messages, leading to low message processing efficiency. Summary of the Invention
[0004] To solve the above-mentioned technical problems, or at least partially solve them, this disclosure provides a message processing method, apparatus, medium, and computer program product.
[0005] This disclosure provides a message processing method applied to any one of the business terminals in a message distributed processing system. The message distributed processing system includes multiple business terminals. The method includes: upon receiving multiple first messages sent by multiple business terminals, identifying whether each first message contains a dependent message identifier, wherein the message corresponding to the dependent message identifier has a direct dependency relationship with the first message, and the direct dependency relationship indicates that before processing the first message, it needs to be determined that the message corresponding to the dependent message identifier has been processed, and there are no other intermediate messages between the first message and the message corresponding to the dependent message identifier that need to be processed; if the dependent message identifier is included, using the message corresponding to the dependent message identifier as the second message; identifying whether the second message has been processed; and if the second message has been processed, processing the first message corresponding to the processed second message.
[0006] This disclosure also provides a message processing apparatus, which is applied to any one of the service terminals of a message distributed processing system. The message distributed processing system includes multiple service terminals. The apparatus includes: a first identification module, configured to identify whether each first message contains a dependent message identifier when multiple first messages sent by multiple service terminals are received, wherein the message corresponding to the dependent message identifier has a direct dependency relationship with the first message, and the direct dependency relationship is used to indicate that before processing the first message, it needs to be determined that the message corresponding to the dependent message identifier has been processed, and there are no other intermediate messages that need to be processed between the first message and the message corresponding to the dependent message identifier; a determination module, configured to determine the message corresponding to the dependent message identifier as a second message when the dependent message identifier is included; a second identification module, configured to identify whether the second message has been processed; and a processing module, configured to process the first message corresponding to the processed second message when the second message has been processed.
[0007] This disclosure also provides an electronic device, the electronic device comprising: a processor; a memory for storing executable instructions of the processor; the processor being configured to read the executable instructions from the memory and execute the instructions to implement the message processing method provided in this disclosure.
[0008] This disclosure also provides a computer-readable storage medium storing a computer program for performing the message processing method provided in this disclosure.
[0009] This disclosure also provides a computer program product, including a computer program that, when executed by a processor, implements the message processing method provided in this disclosure. The technical solution provided in this disclosure has the following advantages compared to the prior art: The message processing scheme provided in this disclosure, when receiving multiple first messages sent by multiple service terminals, identifies whether each first message contains a dependent message identifier. The message corresponding to the dependent message identifier has a direct dependency relationship with the first message. This direct dependency relationship indicates that before processing the first message, it is necessary to determine whether the message corresponding to the dependent message identifier has been processed, and that there are no other intermediate messages between the first message and the message corresponding to the dependent message identifier that need to be processed. If a dependent message identifier is included, the message corresponding to the dependent message identifier is identified as a second message. Then, it is determined whether the second message has been processed. If the second message has been processed, the first message corresponding to the processed second message is processed. Therefore, this technical solution realizes message processing according to business logic, improving message processing efficiency. Attached Figure Description
[0010] The above and other features, advantages, and aspects of the embodiments of this disclosure will become more apparent from the accompanying drawings and the following detailed description. Throughout the drawings, the same or similar reference numerals denote the same or similar elements. It should be understood that the drawings are schematic, and the originals and elements are not necessarily drawn to scale.
[0011] Figure 1 A flowchart illustrating a message processing method provided in an embodiment of this disclosure; Figure 2 This is a schematic diagram of the structure of a message processing device provided in an embodiment of the present disclosure; Figure 3 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present disclosure. Detailed Implementation
[0012] Embodiments of this disclosure will now be described in more detail with reference to the accompanying drawings. While some embodiments of this disclosure are shown in the drawings, it should be understood that this disclosure can be implemented in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided to provide a more thorough and complete understanding of this disclosure. It should be understood that the accompanying drawings and embodiments of this disclosure are for illustrative purposes only and are not intended to limit the scope of protection of this disclosure.
[0013] It should be understood that the steps described in the method embodiments of this disclosure may be performed in different orders and / or in parallel. Furthermore, the method embodiments may include additional steps and / or omit the steps shown. The scope of this disclosure is not limited in this respect.
[0014] The term "comprising" and its variations as used herein are open-ended inclusions, meaning "including but not limited to". The term "based on" means "at least partially based on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". Definitions of other terms will be given in the description below.
[0015] It should be noted that the concepts of "first" and "second" mentioned in this disclosure are used only to distinguish different devices, modules or units, and are not used to limit the order of functions performed by these devices, modules or units or their interdependencies.
[0016] It should be noted that the terms "a" and "a plurality of" used in this disclosure are illustrative rather than restrictive, and those skilled in the art should understand that, unless otherwise expressly indicated in the context, they should be understood as "one or more".
[0017] The names of messages or information exchanged between multiple devices in the embodiments of this disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.
[0018] To address the aforementioned problems, this disclosure provides a message processing method, which will be described below with reference to specific embodiments.
[0019] Figure 1 This is a flowchart illustrating a message processing method provided in an embodiment of the present disclosure. The method can be executed by a message processing device, which can be implemented using software and / or hardware, and is generally integrated into an electronic device, such as any service terminal or server capable of processing messages sent by multiple service terminals. The method of this embodiment is applied to any service terminal in a distributed message processing system, which includes multiple service terminals.
[0020] like Figure 1 As shown, the method includes: Step 101: When multiple first messages sent by multiple business terminals are obtained, identify whether each first message contains a dependent message identifier. The message corresponding to the dependent message identifier has a direct dependency relationship with the first message. The direct dependency relationship is used to indicate that before processing the first message, it is necessary to determine that the message corresponding to the dependent message identifier has been processed and that there are no other intermediate messages that need to be processed between the first message and the message corresponding to the dependent message identifier.
[0021] In the embodiments of this disclosure, when multiple first messages sent by multiple service terminals are obtained, it is identified whether each first message contains a dependent message identifier. The dependent message identifier is the message identifier of the second message that the first message depends on. The dependent message identifier is carried in the first message and sent. The message corresponding to the dependent message identifier has a direct dependency relationship with the first message. The direct dependency relationship is used to indicate that before the processing of the first message, it is necessary to determine that the message corresponding to the dependent message identifier has been processed. There are no other intermediate messages that need to be processed between the first message and the message corresponding to the dependent message identifier. The direct dependency relationship means that the processing of the first message is a prerequisite for the processing of the second message. After the processing of the second message is completed, the processing of the first message can be directly executed. There are no other intermediate messages or intermediate processing steps between the two.
[0022] For example, when the first message is a payment request message, it is necessary to know whether the order has been created. Therefore, it is necessary to know whether the order creation message (the second message) has been processed. Here, the order creation message and the payment request message have a direct dependency relationship.
[0023] In this embodiment, a business link can be constructed according to business logic. The business link contains multiple message nodes with connection relationships. Each message node contains a message identifier in its node attributes. Thus, in this embodiment, the business link is sent to each business end. Each business end determines whether the first message has a dependent second message based on the business link, and determines the dependent message identifier of the second message.
[0024] In one embodiment of this disclosure, a preset message table is also constructed. The preset message table contains the correspondence between the message identifiers and message processing statuses of all acquired messages. Therefore, after acquiring the first message, the message identifier of the first message can be stored in the preset message table, and the message processing status of the first message is assumed to be unprocessed.
[0025] It is easy to understand that after processing the first message, the message processing status of the first message is updated to the processed status in the preset message table.
[0026] Step 102: If the dependent message identifier is included, the message corresponding to the dependent message identifier is determined as the second message.
[0027] In the embodiments of this disclosure, when a dependent message identifier is included, the message corresponding to the dependent message identifier is determined as the second message. The dependent message identifier is the message identifier of the second message, and the dependent message identifier can be any one of the predefined message number, message code, etc. of the second message.
[0028] Step 103: Identify whether the second message has been processed.
[0029] In one embodiment of this disclosure, it is determined whether the second message has been processed. For example, a preset message table is queried to determine whether the second message has been processed. Alternatively, in some possible embodiments, if the second message has not arrived, it will not be found in the preset message table. If the second message cannot be found, it is also determined that the second message has not been processed.
[0030] Step 104: If the second message has been processed, process the first message corresponding to the processed second message.
[0031] In embodiments of this disclosure, the first message is processed directly after the second message has been processed.
[0032] In one embodiment of this disclosure, if the second message has not been processed, at least one third message that is dependent on the second message is recursively queried based on the second message. The consumption processing status of the third message is unprocessed. That is, in the embodiments of this disclosure, it is also considered whether the second message has a direct or indirect dependency on the third message. The indirect dependency is used to indicate that before the second message is processed, it needs to be determined that the corresponding third message has been processed, and there are other intermediate messages that need to be processed between the second message and the corresponding third message. The indirect dependency means that the second message and the third message form a chain dependency through at least one intermediate message or intermediate processing link. The processing of the second message directly depends on the processing completion of the intermediate message, and the processing of the intermediate message depends on the processing completion of the third message, so that the second message is indirectly dependent on the third message.
[0033] For example, if the second message is message B, message B directly depends on message C, and message C directly depends on message D, then when neither message C nor message D has been consumed, both message C and message D belong to the third message category. Among them, message C is the third message with a direct dependency relationship to message B, and message D is the third message with an indirect dependency relationship to message B. Message C is an intermediate message.
[0034] In this embodiment, message processing is performed on the second message and at least one third message according to their dependencies. In some possible embodiments, a message path containing at least one third message and the second message is constructed according to their dependencies. Adjacent messages in the message path have direct dependencies, while non-adjacent messages have indirect dependencies. For example, continuing with the above embodiment, the constructed message path is message D-message C-message B. Furthermore, starting from the first message in the message path, the corresponding messages are queued in a message queue list to await processing. The message queue list contains messages to be processed, and the messages in the queue list are processed according to their queuing order.
[0035] In this embodiment, after each message in the message path is processed, the next message in the message path is queued and placed in the message queue list to wait for processing. This process is repeated until the second message is processed, at which point the first message is queued and placed in the message queue list to wait for processing.
[0036] In one embodiment of this disclosure, in order to avoid message processing delays in the message queue, it is determined whether the processing time of the currently processed message exceeds a preset time threshold. If the processing time threshold is exceeded, the currently processed message is deleted from the message queue, wherein the message processing status of the deleted message is still "processed".
[0037] In one embodiment of this disclosure, to avoid message hang-ups, all unprocessed messages are periodically scanned according to a scanning cycle. After identifying unprocessed messages, it is determined whether other messages that have dependencies on the unprocessed messages have been processed. If they have been processed, the corresponding messages are sorted into a message queue for processing. The scanning cycle can be set according to the scenario, such as a scanning cycle of 5 minutes.
[0038] In summary, the message processing method of this disclosure, when receiving multiple first messages sent by multiple service terminals, identifies whether each first message contains a dependent message identifier. The message corresponding to the dependent message identifier has a direct dependency relationship with the first message. This direct dependency relationship indicates that before processing the first message, it is necessary to determine whether the message corresponding to the dependent message identifier has been processed, and that there are no other intermediate messages between the first message and the message corresponding to the dependent message identifier that need to be processed. If a dependent message identifier is included, the message corresponding to the dependent message identifier is identified as a second message. Then, it is identified whether the second message has been processed. If the second message has been processed, the first message corresponding to the processed second message is processed. Therefore, this technical solution achieves message processing according to business logic, improving message processing efficiency.
[0039] To implement the above embodiments, this disclosure also proposes a message processing apparatus. The message processing apparatus is applied to any one of the service terminals in a message distributed processing system, which includes multiple service terminals.
[0040] Figure 2 This is a schematic diagram of a message processing device provided in an embodiment of this disclosure. The device can be implemented by software and / or hardware, and is generally integrated into an electronic device, which can be the aforementioned service terminal. For example... Figure 2 As shown, the device includes: a first identification module 210, a determination module 220, a second identification module 230, and a processing module 240, wherein, The first identification module 210 is used to identify whether each first message contains a dependent message identifier when multiple first messages sent by multiple business terminals are obtained. The message corresponding to the dependent message identifier has a direct dependency relationship with the first message. The direct dependency relationship is used to indicate that before the first message is processed, it is necessary to determine that the message corresponding to the dependent message identifier has been processed and there are no other intermediate messages that need to be processed between the first message and the message corresponding to the dependent message identifier. The determination module 220 is used to determine the message corresponding to the dependency message identifier as the second message when the dependency message identifier is included; The second identification module 230 is used to identify whether the second message has been processed. The processing module 240 is configured to process the first message corresponding to the processed second message when the second message has been processed. In some embodiments, the processing module 240 is further configured to: If the first message does not contain a dependent message identifier, process the first message.
[0041] In some implementations, when multiple first messages sent by multiple service terminals are received, the system further includes: a message table setting module, used for: The message identifier of the first message is stored in a preset message table, and the message processing status of the first message is set to unprocessed. The preset message table contains the message identifier of the acquired message and the correspondence between the message processing status of the acquired message. After processing the first message corresponding to the second message that has been processed, update the message processing status of the first message to the processed status in the preset message table.
[0042] In some implementations, the second identification module 230 is used for: Query the preset message table to determine whether the second message has been processed.
[0043] In some embodiments, the processing module 240 is further configured to: If the second message has not been processed, at least one third message that is dependent on the second message is recursively queried based on the second message. The consumption processing status of the third message is unprocessed. The dependency includes direct dependency and indirect dependency. Indirect dependency is used to indicate that the corresponding third message has been processed before the second message is processed, and there are other intermediate messages that need to be processed between the second message and the corresponding third message. Message processing is performed on the second message and at least one third message according to their dependencies; The first message is processed after at least one third message and the second message have been processed.
[0044] In some embodiments, the processing module 240 is further configured to: Construct message paths containing at least one third message and a second message according to dependencies, wherein adjacent messages in the message path have direct dependencies and non-adjacent messages have indirect dependencies. Starting with the first message in the message path, the corresponding message is placed into a message queue to await processing. The message queue contains messages to be processed.
[0045] In some implementations, it also includes: a queue message management module, used for: Determine whether the processing time of the currently processed message exceeds a preset time threshold; If a preset time threshold is exceeded, the currently processed message will be deleted from the message queue.
[0046] The message processing apparatus provided in this disclosure can execute the message processing method provided in any embodiment of this disclosure, and has the corresponding functional modules and beneficial effects of executing the method.
[0047] To implement the above embodiments, this disclosure also proposes a computer program product, including a computer program / instructions, which, when executed by a processor, implements the message processing method described above.
[0048] Figure 3 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present disclosure.
[0049] The following is a detailed reference. Figure 3 The diagram illustrates a structural schematic suitable for implementing the electronic device 300 in the embodiments of this disclosure. The electronic device 300 in the embodiments of this disclosure may include, but is not limited to, mobile terminals such as mobile phones, laptops, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and fixed terminals such as digital TVs and desktop computers. Figure 3 The electronic device shown is merely an example and should not be construed as limiting the functionality and scope of the embodiments disclosed herein.
[0050] like Figure 3 As shown, the electronic device 300 may include a processor (e.g., a central processing unit, a graphics processing unit, etc.) 301, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 302 or a program loaded from a memory 308 into a random access memory (RAM) 303. The RAM 303 also stores various programs and data required for the operation of the electronic device 300. The processor 301, ROM 302, and RAM 303 are interconnected via a bus 304. An input / output (I / O) interface 305 is also connected to the bus 304.
[0051] Typically, the following devices can be connected to I / O interface 305: input devices 306 including, for example, touchscreens, touchpads, keyboards, mice, cameras, microphones, accelerometers, gyroscopes, etc.; output devices 307 including, for example, liquid crystal displays (LCDs), speakers, vibrators, etc.; memory devices 308 including, for example, magnetic tapes, hard disks, etc.; and communication devices 309. Communication device 309 allows electronic device 300 to communicate wirelessly or wiredly with other devices to exchange data. Although Figure 3An electronic device 300 with various devices is shown; however, it should be understood that it is not required to implement or possess all of the devices shown. More or fewer devices may be implemented or possessed alternatively.
[0052] 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 containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via communication device 309, or installed from memory 308, or installed from ROM 302. When the computer program is executed by processor 301, it performs the functions defined in the message processing method of embodiments of this disclosure.
[0053] It should be noted that the computer-readable medium described in this disclosure can be a computer-readable signal medium or a computer-readable storage medium, or any combination thereof. A computer-readable storage medium can 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 can 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 can include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium can be any computer-readable 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. The program code contained on the computer-readable medium can be transmitted using any suitable medium, including but not limited to: wires, optical fibers, RF (radio frequency), etc., or any suitable combination thereof.
[0054] In some implementations, clients and servers can communicate using any currently known or future-developed network protocol such as HTTP (Hypertext Transfer Protocol) and can interconnect with digital data communication (e.g., communication networks) of any form or medium. Examples of communication networks include local area networks (“LANs”), wide area networks (“WANs”), the Internet (e.g., the Internet of Things), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future-developed networks.
[0055] The aforementioned computer-readable medium may be included in the aforementioned electronic device; or it may exist independently and not assembled into the electronic device.
[0056] The aforementioned computer-readable medium carries one or more programs, which, when executed by the electronic device, cause the electronic device to perform the aforementioned message processing method.
[0057] Electronic devices can be programmed with computer program code in one or more programming languages or combinations thereof to perform the operations of this disclosure. These programming languages include, but are not limited to, object-oriented programming languages such as Java, Smalltalk, and C++, as well as conventional procedural programming languages such as "C" or similar languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a local area network (LAN) or a wide area network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).
[0058] 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 this disclosure. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code 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 the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.
[0059] The units described in the embodiments of this disclosure can be implemented in software or hardware. The names of the units are not, in some cases, intended to limit the specific unit.
[0060] The functions described above in this document can be performed at least in part by one or more hardware logic components. For example, exemplary types of hardware logic components that can be used, without limitation, include: field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), system-on-a-chip (SoCs), complex programmable logic devices (CPLDs), and so on.
[0061] In the context of this disclosure, a machine-readable medium can be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, apparatus, or device. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can be, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, 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 devices, magnetic storage devices, or any suitable combination of the foregoing.
[0062] The above description is merely a preferred embodiment of this disclosure and an explanation of the technical principles employed. Those skilled in the art should understand that the scope of this disclosure is not limited to technical solutions formed by specific combinations of the above-described technical features, but should also cover other technical solutions formed by arbitrary combinations of the above-described technical features or their equivalents without departing from the above-described concept. For example, technical solutions formed by substituting the above features with (but not limited to) technical features disclosed in this disclosure that have similar functions.
[0063] Furthermore, while the operations are described in a specific order, this should not be construed as requiring these operations to be performed in the specific order shown or in a sequential order. In certain environments, multitasking and parallel processing may be advantageous. Similarly, while several specific implementation details are included in the above discussion, these should not be construed as limiting the scope of this disclosure. Certain features described in the context of individual embodiments may also be implemented in combination in a single embodiment. Conversely, various features described in the context of a single embodiment may also be implemented individually or in any suitable sub-combination in multiple embodiments.
[0064] Although the subject matter has been described using language specific to structural features and / or methodological logic, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or actions described above. Rather, the specific features and actions described above are merely illustrative examples of implementing the claims.
Claims
1. A message processing method, characterized in that, The method is applied to any one of the business terminals in a message distributed processing system, wherein the message distributed processing system includes multiple such business terminals, and the method includes: When multiple first messages are received from multiple business terminals, it is identified whether each first message contains a dependent message identifier. The message corresponding to the dependent message identifier has a direct dependency relationship with the first message. The direct dependency relationship is used to indicate that before processing the first message, it is necessary to determine that the message corresponding to the dependent message identifier has been processed and there are no other intermediate messages that need to be processed between the first message and the message corresponding to the dependent message identifier. If the dependency message identifier is included, the message corresponding to the dependency message identifier is identified as the second message; Identify whether the second message has been processed. If the second message has been processed, process the first message corresponding to the processed second message.
2. The method as described in claim 1, characterized in that, Also includes: If the first message does not contain the dependent message identifier, process the first message.
3. The method as described in claim 1, characterized in that, In the case of obtaining multiple first messages sent by multiple service terminals, the method further includes: The message identifier of the first message is stored in a preset message table, and the message processing status of the first message is set to an unprocessed state. The preset message table contains the message identifier of the acquired message and the correspondence between the message processing status of the acquired message. After processing the first message corresponding to the second message that has been processed, the method further includes: The message processing status of the first message is updated to "processed" in the preset message table.
4. The method as described in claim 3, characterized in that, The step of identifying whether the second message has been processed includes: The preset message table is queried to determine whether the second message has been processed.
5. The method as described in claim 1 or 4, characterized in that, After identifying whether the second message has been processed, the method further includes: If the second message has not been processed, at least one third message that is dependent on the second message is recursively queried according to the second message. The consumption processing status of the third message is unprocessed. The dependency includes the direct dependency and the indirect dependency. The indirect dependency is used to indicate that the corresponding third message needs to be determined to have been processed before the second message is processed, and there are other intermediate messages that need to be processed between the second message and the corresponding third message. The second message and the at least one third message are processed according to their dependencies; After all the at least one third message and the second message have been processed, the first message is processed.
6. The method as described in claim 5, characterized in that, The message processing of the second message and the at least one third message according to the dependency relationship includes: A message path containing at least one third message and the second message is constructed according to the dependency relationship, wherein adjacent messages in the message path have the direct dependency relationship, and non-adjacent messages have the indirect dependency relationship; Starting with the first message in the message path, the corresponding messages are queued up for processing, wherein the message queue contains messages to be processed.
7. The method as described in claim 6, characterized in that, After placing the corresponding message into the message queue for processing, the process further includes: Determine whether the processing time of the currently processed message exceeds a preset time threshold; If the preset time threshold is exceeded, the currently processed message will be deleted from the message queue.
8. An electronic device, characterized in that, The electronic device includes: processor; Memory used to store the processor's executable instructions; The processor is configured to read the executable instructions from the memory and execute the executable instructions to implement the message processing method according to any one of claims 1-7.
9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program for performing the message processing method according to any one of claims 1-7.
10. A computer program product, characterized in that, It includes a computer program that, when executed by a processor, implements the message processing method according to any one of claims 1-7.