CN112069438B - Message merging method, message processing method and device, equipment and medium - Google Patents
Message merging method, message processing method and device, equipment and medium Download PDFInfo
- Publication number
- CN112069438B CN112069438B CN202010945528.1A CN202010945528A CN112069438B CN 112069438 B CN112069438 B CN 112069438B CN 202010945528 A CN202010945528 A CN 202010945528A CN 112069438 B CN112069438 B CN 112069438B
- Authority
- CN
- China
- Prior art keywords
- message
- key value
- processed
- processing
- value pair
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 77
- 238000003672 processing method Methods 0.000 title claims description 21
- 238000012545 processing Methods 0.000 claims abstract description 165
- 230000004044 response Effects 0.000 claims description 22
- 230000008859 change Effects 0.000 claims description 21
- 238000004590 computer program Methods 0.000 claims description 9
- 230000004048 modification Effects 0.000 claims description 4
- 238000012986 modification Methods 0.000 claims description 4
- 238000000605 extraction Methods 0.000 claims description 3
- 238000012805 post-processing Methods 0.000 description 14
- 238000010586 diagram Methods 0.000 description 13
- 230000008569 process Effects 0.000 description 13
- 239000000284 extract Substances 0.000 description 8
- 230000006870 function Effects 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 230000000694 effects Effects 0.000 description 6
- 238000009825 accumulation Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 3
- 230000003993 interaction Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 239000000047 product Substances 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000013589 supplement Substances 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/958—Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
Abstract
The embodiment of the disclosure discloses a message merging method, a message processing device, equipment and a medium. One embodiment of the method comprises the following steps: receiving a message queue; respectively establishing key value pairs and object queues according to each message identifier included in the message queues, wherein the number of the established key value pairs is equal to the number of the message identifiers included in the message queues, keys in the key value pairs are used for storing the message identifiers, and values in the key value pairs are used for storing message contents; and combining the message contents included in the message based on the key value pair and the object queue corresponding to each message in the message queue to generate a processed key value pair and a processed object queue, and obtaining a processed key value pair set and a processed object queue set. The embodiment can reduce the number of message contents of the repeatedly processed messages and provide support for reducing the processing load of the related equipment when processing the message contents of the messages.
Description
Technical Field
Embodiments of the present disclosure relate to the field of computer technology, and in particular, to a message merging method, a message processing method, a device, and a computer readable medium.
Background
Currently, message processing devices are typically required to process thousands of messages within a set time. However, the receipt of these messages tends to be peaked, and the arrival of a large number of messages places a significant processing load on the message processing device. Therefore, how to reduce the processing load is a problem to be faced.
Disclosure of Invention
The disclosure is in part intended to introduce concepts in a simplified form that are further described below in the detailed description. The disclosure is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
Some embodiments of the present disclosure propose a message merging method, a message processing method and apparatus, a device and a computer readable medium to solve the technical problems mentioned in the background section above.
In a first aspect, some embodiments of the present disclosure provide a message merging method for a message merging terminal, the method including: receiving a message queue, wherein the message comprises a message identifier and a message content; respectively establishing key value pairs and object queues according to each message identifier included in the message queues, wherein the number of the established key value pairs is equal to the number of the message identifiers included in the message queues, keys in the key value pairs are used for storing the message identifiers, and values in the key value pairs are used for storing message contents; and combining the message contents included in the message based on the key value pair and the object queue corresponding to each message in the message queue to generate a processed key value pair and a processed object queue, and obtaining a processed key value pair set and a processed object queue set.
In a second aspect, some embodiments of the present disclosure provide a message merging apparatus for a message merging terminal, the apparatus including: a receiving unit configured to receive a message queue, wherein the message includes a message identifier and a message content; a setting unit configured to set up key value pairs and object queues according to the message identifications included in the message queues, respectively, where the number of key value pairs set up is equal to the number of message identifications included in the message queues, keys in the key value pairs are used to store the message identifications, and values in the key value pairs are used to store message contents; and the processing unit is configured to combine the message contents included in the message based on the key value pair and the object queue corresponding to each message in the message queue to generate a processed key value pair and a processed object queue, and obtain a processed key value pair set and a processed object queue set.
In a third aspect, some embodiments of the present disclosure provide a message processing method for a message processing end, the method including: extracting a processed object from a processed object queue of a message merging end, wherein the processed object comprises a message identifier; acquiring message content from the processed key value pair corresponding to the message identifier in the message merging end and deleting the message content in the processed key value pair; and processing the message based on the message content.
In a fourth aspect, some embodiments of the present disclosure provide a message processing apparatus of a message processing end, the apparatus including: an extraction unit configured to extract a processed object from a processed object queue of a message merging end, wherein the processed object includes a message identifier; a deleting unit configured to acquire message contents from the processed key value pair corresponding to the message identifier in the message merging terminal and delete the message contents in the processed key value pair; and a processing unit configured to perform message processing based on the message content.
In a fifth aspect, some embodiments of the present disclosure provide an electronic device comprising: one or more processors; and a storage device having one or more programs stored thereon, which when executed by the one or more processors, cause the one or more processors to implement the method as in any of the first and second aspects.
In a sixth aspect, some embodiments of the present disclosure provide a computer readable medium having a computer program stored thereon, wherein the program when executed by a processor implements a method as in any of the first and second aspects.
The above embodiments of the present disclosure have the following advantageous effects: first, a message queue is received, wherein the message includes a message identification and a message content. And then, respectively establishing a key value pair and an object queue according to each message identifier included in the message queue. Wherein the number of key-value pairs established is equal to the number of message identifications comprised by the message queue. The keys in the key value pair are used to store message identifications. The values in the key value pair are used to store the message content. Therefore, the established key value pair and the object queue are used as media, and support is provided for combining processing and message processing of each message content included in each message in the message queue. And finally, based on the key value pair and the object queue corresponding to each message in the message queue, combining the message content included in the message to generate a processed key value pair and a processed object queue, and obtaining a processed key value pair set and a processed object queue set. Therefore, the message contents included in the messages in the message queues can be combined, the obtained message identifications and the message contents in the processed key value pairs in the processed key value pair set are not repeated, and the obtained processed objects in the processed object queues in the processed object queue set are not repeated. The method and the device can reduce the number of message contents of the repeatedly processed messages and provide support for reducing the processing load of related devices when processing the message contents of the messages.
Drawings
The above and other features, advantages, and aspects of embodiments of the present disclosure will become more apparent by reference to the following detailed description when taken in conjunction with the accompanying drawings. The same or similar reference numbers will be used throughout the drawings to refer to the same or like elements. It should be understood that the figures are schematic and that elements and components are not necessarily drawn to scale.
Fig. 1 is a schematic diagram of one application scenario of a message merging method for a message merging side according to some embodiments of the present disclosure;
FIG. 2 is a schematic diagram of one application scenario of a message processing method for a message processing side according to some embodiments of the present disclosure;
FIG. 3 is a schematic diagram of an interaction process between a message merging device for a message merging side and a message processing device for a message processing side according to the present disclosure;
FIG. 4 is a flow chart of some embodiments of a message merging method for a message merging side according to the present disclosure;
FIG. 5 is a flow chart of further embodiments of a message merging method for a message merging side according to the present disclosure;
FIG. 6 is a flow chart of some embodiments of a message processing method for a message processing side according to the present disclosure;
fig. 7 is a schematic diagram of the structure of some embodiments of a message merging apparatus for a message merging side according to the present disclosure;
FIG. 8 is a schematic diagram of the architecture of some embodiments of a message processing apparatus for a message processing side according to the present disclosure;
fig. 9 is a schematic structural diagram of an electronic device suitable for use in implementing some embodiments of the present disclosure.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete. It should be understood that the drawings and embodiments of the present disclosure are for illustration purposes only and are not intended to limit the scope of the present disclosure.
It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings. Embodiments of the present disclosure and features of embodiments may be combined with each other without conflict.
It should be noted that the terms "first," "second," and the like in this disclosure are merely used to distinguish between different devices, modules, or units and are not used to define an order or interdependence of functions performed by the devices, modules, or units.
It should be noted that references to "one", "a plurality" and "a plurality" in this disclosure are intended to be illustrative rather than limiting, and those of ordinary skill in the art will appreciate that "one or more" is intended to be understood as "one or more" unless the context clearly indicates otherwise.
The names of messages or information interacted between the various devices in the embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.
The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 is a schematic diagram of an application scenario of a message merging method for a message merging side according to some embodiments of the present disclosure.
In the application scenario of fig. 1, first, the computing device 101 receives a message queue 102, wherein the message includes a message identification and a message content. Then, the computing device 101 may respectively establish key value pairs 103 and object queues 104 according to the respective message identifications included in the message queue 102, where the number of established key value pairs is equal to the number of message identifications included in the message queue 102, the keys in the key value pairs 103 are used for storing message identifications, and the values in the key value pairs 103 are used for storing message contents; finally, the computing device 101 may combine the message contents included in the message based on the key value pair and the object queue corresponding to each message in the message queue 102 to generate a processed key value pair 105 and a processed object queue 106, so as to obtain a processed key value pair set and a processed object queue set.
The computing device 101 may be hardware or software. When the computing device is hardware, the computing device may be implemented as a distributed cluster formed by a plurality of servers or terminal devices, or may be implemented as a single server or a single terminal device. When the computing device is embodied as software, it may be installed in the hardware devices listed above. It may be implemented as a plurality of software and software modules, for example, to provide distributed services, or as a single software or software module. The present invention is not particularly limited herein.
It should be understood that the number of computing devices in fig. 1 is merely illustrative. There may be any number of computing devices, as desired for an implementation.
Fig. 2 is a schematic diagram of an application scenario of a message processing method for a message processing side according to some embodiments of the present disclosure.
In the application scenario of fig. 2, first, the computing device 201 may extract a processed object 204 from the processed object queue 202 at the message merge end, where the processed object 204 includes a message identification 205. The computing device 201 may then obtain the message content 206 from the processed key-value pair 203 corresponding to the message identifier 205 in the message merge side and delete the message content 206 in the processed key-value pair 203; finally, computing device 201 may perform message processing based on message content 206 described above.
The computing device 201 may be hardware or software. When the computing device is hardware, the computing device may be implemented as a distributed cluster formed by a plurality of servers or terminal devices, or may be implemented as a single server or a single terminal device. When the computing device is embodied as software, it may be installed in the hardware devices listed above. It may be implemented as a plurality of software and software modules, for example, to provide distributed services, or as a single software or software module. The present invention is not particularly limited herein.
It should be understood that the number of computing devices in fig. 2 is merely illustrative. There may be any number of computing devices, as desired for an implementation.
With continued reference to fig. 3, there is shown an illustration 300 of an interaction procedure between a message merging means for a message merging side and a message processing means for a message processing side according to the present disclosure. The interaction process between the devices may include the steps of:
referring to fig. 3, steps 301 to 303 are mainly used to describe the processing flow of the message merging side, and correspond to the processing flows of steps 401 to 403 in fig. 4, respectively. Steps 304-308 are mainly used to describe the processing flow of the message processing end.
In step 301, a message merging end receives a message queue.
In some embodiments, the message merge peer (e.g., computing device 101 shown in fig. 1) may receive a message queue from a terminal via a wired connection or a wireless connection. Wherein the message includes a message identification and a message content.
As an example, the above-described message queue may be [ [ message 001, [ modify posts content to "two-room one-hall" ] ], [ message 002, [ upper-frame posts ] ], [ message 001, [ modify posts content to "two-room one-hall 1500/month" ] ], [ message 001, [ modify posts content to "two-room one-hall 1500 yuan/month 62 flat ] ], [ message 002, [ lower-frame posts ] ]. The message may be [ message 001, [ modify post content to "two-room one hall" ] ]. The message identification may be message 001. The message content may be [ modify post content to "two-room one-hall" ].
In step 302, the message merging end establishes a key value pair and an object queue respectively according to each message identifier included in the message queue.
In some embodiments, for each message in the message queue, the message merging end may first respond to determining that there is no key value pair corresponding to a message identifier included in the message, and then respectively establish an empty key value pair and an empty object queue of the message identifier. Wherein the number of key-value pairs established is equal to the number of message identifications comprised by the message queue. The keys in the key value pair are used to store message identifications. The values in the key value pair are used to store the message content. Therefore, the established key value pair and the object queue are used as media, and support is provided for combining processing and message processing of each message content included in each message in the message queue.
As an example, for the 1 st message [ message 001, [ modifying the post content to "two-room one-hall" ] ] and the 2 nd message [ message 002, [ overhead post ] ] in the message queue illustrated in step 301, the message merging terminal may first respond to determining that there is no key value pair corresponding to the message identifier [ message 001] included in the 1 st message, and then establish an empty key value pair [, [ ] ] and an empty object queue [ ], respectively, according to the message identifier [ message 001 ]. Then, the message merging end may establish an empty key value pair [, [ ] ] and an empty object queue [ ] according to the message identifier [ message 002] in response to determining that there is no key value pair corresponding to the message identifier [ message 002] included in the 2 nd message.
And 303, the message merging end merges the message contents included in the message based on the key value pair and the object queue corresponding to each message in the message queue to generate a processed key value pair and a processed object queue, and a processed key value pair set and a processed object queue set are obtained.
In some embodiments, for each message in the message queue, the message merging end may first determine a key value pair and an object queue corresponding to a message identifier included in the message. The message content included in the message may then be consolidated in response to determining that the predetermined condition is satisfied.
In response to determining that the message content is consolidated, identifying a message included in the message as a key, identifying the message content included in the message as a value to form a processed key-value pair, deleting the key-value pair, and determining the object queue as a processed object queue.
In response to determining that the message content is not merged, the key-value pair is an empty key-value pair, identifying a message included in the message as a key of the empty key-value pair, identifying the message content included in the message as a value of the empty key-value pair to generate a post-processing key-value pair, and adding the message identification included in the message to the object queue to generate a post-processing object queue.
The processed key value pair and the processed object queue can be respectively used as a key value pair and an object queue to be searched by the message merging end. The predetermined condition may be "there is a message identification included in the message in the key of the key-value pair". Therefore, the message contents included in the messages in the message queues can be combined, the obtained message identifications and the message contents in the processed key value pairs in the processed key value pair set are not repeated, and the obtained processed objects in the processed object queues in the processed object queue set are not repeated.
As an example, for the 4 th message [ message 001, [ modify post content to "two-room one-hall 1500 yuan/month 62 flat" ] ] ] in the message queue illustrated in step 301, the above-described message merge end may first determine the key value pair and object queue corresponding to [ message 001]. The determined key-value pair may be [ message 001, [ modify post content to "two-room one-hall 1500 yuan/month ] ]. The determined object queue may be message 001. Then, it may be determined that the message identifier [ message 001] included in the 4 th message exists in the key of the determined key value pair, and the message contents included in the 4 th message are combined. The message identification [ message 001] included in the 4 th message is used as a key, the message content [ modifying the post content to "two-room one-hall 1500 yuan/month 62 flat" ] is used as a value to compose a post-processing key value pair [ message 001, [ modifying the post content to "two-room one-hall 1500 yuan/month 62 flat" ] ] ], and the determined key value pair [ message 001, [ modifying the post content to "two-room one-hall 1500 yuan/month" ] ] ] ] is deleted, and the object queue [ message 001] is determined as a post-processing object queue.
Step 304, the message processing end obtains the processed object queue from the message merging end.
In some embodiments, the message processing end may obtain the processed object queue from the message merging end.
As an example, the message processing side may obtain the post-processing object queue [ message 001] from the message merging side.
In step 305, the message processing end extracts the processed object from the processed object queue.
In some embodiments, the message processing end may extract the processed object from the processed object queue. Wherein, the processed object can include a message identifier. The message merging terminal can implement the method in the embodiment corresponding to fig. 1.
As an example, the message processing side may extract the processed object "message 001" from the processed object queue [ message 001]. The post-processing object "message 001" described above may include a message identification message 001.
In step 306, the message processing end obtains the processed key value pair corresponding to the message identifier from the message merging end.
In some embodiments, the message processing end may obtain the processed key value pair corresponding to the message identifier from the message merging end. Thus, the message processing end can process the message content of the processed key value pair corresponding to the message identifier included in the obtained processed object queue.
As an example, the message processing end may obtain, from the message merging end, a processed key value pair corresponding to the message identifier [ message 001] illustrated in step 305. The post-processing key value pair described above may be [ message 001, [ modify post content to "two-room one-hall 1500 yuan/month 62 flat ] ].
In step 307, the message processing end obtains the message content from the processed key value pair and deletes the message content in the processed key value pair.
In some embodiments, the message processing end may obtain the message content from the obtained processed key value pair, and delete the message content in the processed key value pair. Therefore, the memory space occupied by the message content at the message merging end can be reduced.
As an example, the message processing side may obtain the message content [ modify the post content to "two-room one-hall 1500 yuan/month 62 flat" ] ] from the post-processing key value pair [ message 001, [ modify the post content to "two-room one-hall 1500 yuan/month 62 flat" ] ], and delete the message content in the post-processing key value pair [ modify the post content to "two-room one-hall 1500 yuan/month 62 flat" ]. The post-processing key value pair after deleting the message content is [ message 001, [ ]).
In step 308, the message processing end performs message processing based on the message content.
In some embodiments, the message processing end may perform message processing according to the message content. Thereby, the processing load of the relevant device in processing the message content of the message can be reduced.
As an example, the message content described above may be [ modify post content to "two-room one-hall 1500 yuan/month 62 flat" ]. The message identifier corresponding to the message content may be [ message 001]. The message processing end can modify the content of the post corresponding to the message 001 into the two-room one-hall 1500 yuan/month 62 flat according to the message content [ modify the post content into the two-room one-hall 1500 yuan/month 62 flat ]. I.e. the message content corresponding to message 001 is message processed.
The above embodiments of the present disclosure have the following advantageous effects: first, the message merging end receives a message queue, wherein the message comprises a message identifier and a message content. And then, the message merging end respectively establishes a key value pair and an object queue according to each message identifier included in the message queue. Therefore, the established key value pair and the object queue are used as media, and support is provided for combining processing and message processing of each message content included in each message in the message queue. And then, the message merging end merges the message contents included in the message based on the key value pair and the object queue corresponding to each message in the message queue to generate a processed key value pair and a processed object queue, and a processed key value pair set and a processed object queue set are obtained. Therefore, the message contents included in the messages in the message queues can be combined, the obtained message identifications and the message contents in the processed key value pairs in the processed key value pair set are not repeated, and the obtained processed objects in the processed object queues in the processed object queue set are not repeated. And secondly, the message processing end acquires a processed object queue from the message merging end. Then, the message processing end extracts the processed object from the processed object queue. And then, the message processing end acquires the processed key value pair corresponding to the message identifier from the message merging end. Thus, the message processing end can process the message content of the processed key value pair corresponding to the message identifier included in the obtained processed object queue. And secondly, the message processing end acquires the message content from the processed key value pair and deletes the message content in the processed key value pair. Therefore, the memory space occupied by the message content at the message merging end can be reduced. And finally, the message processing end performs message processing based on the message content. Thereby, the processing load of the relevant device in processing the message content of the message can be reduced. The method and the device can reduce the number of message contents of the repeatedly processed messages and reduce the processing load of related equipment when processing the message contents of the messages.
With continued reference to fig. 5, a flow 500 of further embodiments of a message merging method for a message merging side according to the present disclosure is shown. The message merging method for the message merging terminal comprises the following steps:
step 501, a message queue is received.
In some embodiments, the specific implementation of step 501 and the technical effects thereof may refer to step 301 in those embodiments corresponding to fig. 3, which are not described herein.
Step 502, respectively establishing a key value pair and an object queue according to each message identifier included in the message queue.
In some embodiments, for each message of the message queue, an execution body of a message merging method for a message merging side (e.g., the computing device 101 shown in fig. 1) may, in response to determining that there is no key value pair corresponding to a message identifier included in the message, respectively establish an empty key value pair and an empty object queue according to the message identifier. Wherein the number of key-value pairs established is equal to the number of message identifications comprised by the message queue. The keys in the key-value pair are used for storing message identifications, and the values in the key-value pair are used for storing message contents. The message content included in the message includes information change content, a message receiving time point and a message processing waiting time period. The information change content refers to the content after the information change. The message receiving time point refers to a time point when the message is received by the execution body of the message merging method for the message merging side. The message processing waiting period refers to a period for waiting for the message to be combined. Therefore, the established key value pair and the object queue are used as media to provide support for combining the message contents included in each message in the message queue, and provide support for message processing on the message contents included in each message in the message queue for an execution body of a message processing method for a message processing end.
As an example, the message queue may be [ [ message 001, [ modify post content to "two-room one hall", 2020/1/1 9:00,3s ] ], message 002, [ shelving post 2020/1/1 9:00,3s ] ], [ message 001, [ modify post content to "two-room one-hall 1500/month", 2020/1/1 9:00,3s ] ], [ message 001, [ modify post content to "two-room one-hall 1500 yuan/month 62 flat", 2020/1/1 9:00,3s ] ], [ message 002, [ posting on shelf, 2020/1/1 9:00,3s ]. For the 1 st message in the message queue [ message 001, [ modify post content to "two-room one hall", 2020/1/1 9:00,3 s) and message 3 [ message 001, [ modify post content to "two-room one-hall 1500/month", 2020/1/1 9:00,3s ], the execution body of the message merging method for the message merging end is used for firstly determining that no key value pair corresponding to a message identifier [ message 001] included in the 1 st message exists, and respectively establishing an empty key value pair [, [ ] ] and an empty object queue [ ] according to the message identifier [ message 001 ]. Then, in response to determining that there is a key value pair corresponding to the message identification [ message 001] included in the 3 rd message, the key value pair and the object queue may not be established.
In step 503, processing is performed in response to the message identification of the message not being present in the keys of the key-value pair.
In some embodiments, in response to the absence of the message identifier of the message in the key of the key-value pair, the execution body of the message merging method for the message merging side may perform the following process:
the first step is to modify the key of the key value pair into the message identifier included in the message, and modify the value of the key value pair into the message content included in the message, so as to generate the processed key value pair. Wherein the processed key value pair may be searched by the execution subject as a key value pair.
By way of example, the above key-value pairs may be [, [ ] ]. The message may include a message identification of message 001. The message content included in the message may be [ modify post content to "two-room one hall", 2020/1/1 9:00,3s ]. The execution body may determine that a message identifier [ message 001] does not exist in the key value pair, modify the key of the key value pair [, [ ] ] to the message identifier [ message 001], modify the value of the key value pair [, [ ] ] to the message content [ modify post content to "two-room one-hall", 2020/1/1 9:00,3s ]. The generated post-processing key value pair is [ message 001, [ modify post content to "two-room one hall", 2020/1/1 9:00,3s ].
And a second step of determining the sum of the message receiving time point included in the message and the message processing waiting time period included in the message as the expiration time of the message.
As an example, the message may include a message reception time point of [2020/1/1 9:00:00]. The message processing wait period included in the above message may be [3s ]. The above message reception time point [2020/1/1 9:00: the sum of 00 and the message processing waiting period [3s ] is [2020/1/1 9 ]: 00:03]. The execution body of the message merging method for the message merging end can be as follows: 00:03] is determined as the expiration time of the message.
And thirdly, generating an object and adding the object into the object queue to generate a processed object queue, wherein the processed object comprises a message identifier, a message receiving time point, a message processing waiting time period and an expiration time of the message. The processed object queue may be searched as an object queue by the execution body.
As an example, the object queue may be [ ]. The message identification may be message 001. The message receiving time point may be [2020/1/1 9:00:00]. The message processing waiting period may be [3s ]. The expiration time may be [2020/1/1 9:00:03]. The execution body of the message merging method for the message merging side described above may generate the object "message 001, 2020/1/1 9:00:00,3s,2020/1/1 9:00:03". The object may be added to the object queue [ ] to generate a processed object queue. The generated post-processing object queue is [ message 001, 2020/1/1 9:00:00,3s,2020/1/1 9:00:03].
A processed key value pair and a processed object queue that are not empty may be generated from the message identification described above, via step 503. Providing a comparison basis for the combination processing of the message contents of the messages. Providing a condition basis for the message processing of the message content of the message for an execution body of a message processing method used for a message processing end.
In step 504, in response to the message identification of the message existing in the keys of the key-value pair, the value of the key-value pair is modified to the message content included in the message to generate a processed key-value pair.
In some embodiments, the execution body of the message merging method for a message merging terminal may modify a value of the key value pair into a message content included in the message in response to a message identifier of the message existing in a key of the key value pair, so as to generate a processed key value pair. Thus, the combination processing of the message contents included in the message is realized.
As an example, the key-value pair may be [ message 001, [ modify post content to "two-room one-hall", 2020/1/1 9:00,3s ]. For message 3 [ message 001, [ modify post content to "two-room one-hall 1500/month," 2020/1/1 9:00,3s ], the execution body of the message merging method for the message merging side may determine that the message identifier [ message 001] exists in the key pair. Modifying the value of the key value pair [ modify post content to "two-room one-hall", 2020/1/1 9:00,3s ] to the message content included in the 3 rd message [ modify post content to "two-room one-hall 1500/month", 2020/1/1 9:00,3s ]. The generated post-processing key value pair is [ message 001, [ modify post content to "two-room one-hall 1500/month", 2020/1/1 9:00,3s ].
The above embodiments of the present disclosure have the following advantageous effects: first, a message queue is received, wherein the message includes a message identification and a message content. And then, respectively establishing key value pairs and object queues according to the message identifications included in the message queues, wherein the number of the established key value pairs is equal to the number of the message identifications included in the message queues. The keys in the key-value pair are used for storing message identifications, and the values in the key-value pair are used for storing message contents. Therefore, the established key value pair and the object queue are used as media to provide support for combining the message contents included in each message in the message queue, and provide support for message processing on the message contents included in each message in the message queue for an execution body of a message processing method for a message processing end. Then, in response to the absence of the message identifier of the message in the key of the key-value pair, the following processing is performed: modifying the key of the key value pair into a message identifier included in the message, and modifying the value of the key value pair into the message content included in the message to generate a processed key value pair; determining the sum of a message receiving time point included in the message and a message processing waiting time period included in the message as an expiration time of the message; generating an object and adding the object to the object queue to generate a processed object queue, wherein the processed object comprises a message identifier, a message receiving time point, a message processing waiting time period and an expiration time of the message. The value of the key-value pair may then be modified to the message content included in the message in response to the message identification of the message being present in the key of the key-value pair to generate a processed key-value pair. Therefore, a non-empty key value pair after processing and a processed object queue can be generated according to the message identification, a comparison basis is provided for the combination processing of the message content of the message, and a condition basis is provided for the message processing of the message content of the message by an execution main body of a message processing method for a message processing end. And finally, in response to the existence of the message identifier of the message in the key of the key value pair, modifying the value of the key value pair into the message content included in the message so as to generate the processed key value pair. Thus, the combination processing of the message contents included in the message is realized. The method and the device can reduce the number of message contents of the repeatedly processed messages and provide support for reducing the processing load of related devices when processing the message contents of the messages.
With continued reference to fig. 6, a flow 600 of some embodiments of a message processing method for a message processing side according to the present disclosure is shown. The message processing method for the message processing end comprises the following steps:
step 601, extracting a processed object whose expiration time is the current time from a processed object queue of the message merging end.
In some embodiments, the processed object in the processed object queue may be composed of a message identification, a message reception time point, a message processing wait period, and an expiration time. The execution body of the message processing method for the message processing end may extract the processed object whose expiration time is the current time from the processed object queue of the message merging end. And after the processed object is extracted, the processed object queue of the message merging end is empty. The message merging end may implement the method in the embodiment corresponding to fig. 5. Therefore, the processed object can be automatically extracted from the processed object queue to process the message content corresponding to the processed object, and the accumulation amount of the message can be reduced.
As an example, the post-processing object queue may be [ message 001, 2020/1/19:00:00,3s, 2020/1/9:00:03 ]. The processed object may be "message 001, 2020/1/19:00:00,3s,2020/1/1:9:00:03". The expiration time of the processed object is 2020/1/1:9:00:03. The current time may be "2020/1/1:9:00:03". The execution body of the message processing method for the message processing end may determine the expiration time as the current time, and extract a processed object "message 001, 2020/1/19:00:00,3s,2020/1/1:9:00:03" from the processed object queue. And extracting the processed object, wherein the processed object queue of the message merging end is [ ].
Step 602, obtaining the message content from the processed key value pair corresponding to the message identifier in the message merging terminal and deleting the message content in the processed key value pair.
In some embodiments, the specific implementation of step 602 and the technical effects thereof may refer to step 307 in those embodiments corresponding to fig. 3, which are not described herein.
Step 603, processing the information change content included in the message content to generate a submission result representing success or failure of the processing.
In some embodiments, the execution body of the message processing method for the message processing end may process the information change content included in the message content to generate a commit result indicating that the processing is successful or failed.
As an example, the message content may be [ modify post content to "two-room one-hall 1500 yuan/month 62 flat", 2020/1/1 9:00,3s ]. The message content may correspond to a message identification message 001. The information change content included in the message content is [ modify post content to "two-room one-hall 1500 yuan/month 62 flat" ]. The execution body of the message processing method for the message processing terminal can process the information change content [ modify the post content into 'two-room one-hall 1500 yuan/month 62 flat' ], and modify the content of the post corresponding to the message 001 into 'two-room one-hall 1500 yuan/month 62 flat'. The generated commit result is "processing success".
Step 604, the submitted result is sent to the message merging end.
In some embodiments, the execution body of the message processing method for the message processing end may send the submission result to the execution body of the message merging method for the message merging end. The execution body of the message merging method for the message merging end may reissue, by the execution body of the message merging method for the message merging end, a message corresponding to the information change content in response to receiving a submission result indicating that the processing fails and determining that the number of processing failures of the information change content is less than or equal to a predetermined number. Therefore, the execution main body of the message merging method for the message merging end can reissue the message with failed processing according to the submitting result, and further can perform message merging on the reissued message.
As an example, the message identity [ message 001] corresponds to message content [ modify post content to "two-room one-hall 1500 yuan/month 62 flat", 2020/1/1 9: the submitted result corresponding to the information change content [ modifying the post content to "two-room one-hall 1500 yuan/month 62 flat" ] included in 00,3s ] may be "processing failure". The execution body of the message processing method for the message processing end may send the commit result "processing failure" to the execution body of the message merging method for the message merging end. The number of processing failures of the information change content may be 2. The predetermined number of times may be 5. And if the execution main body of the message merging method for the message merging end receives the submitting result representing the processing failure and determines that the processing failure times 2 of the information change content are less than the preset times 5, the execution main body of the message merging method for the message merging end supplements the information change content [ modifying the post content into a message corresponding to 'two-room one-hall 1500 yuan/month 62 flat' ].
The above embodiments of the present disclosure have the following advantageous effects: first, a processed object whose expiration time is the current time may be extracted from a processed object queue at the message merging end. The processed object in the processed object queue may be composed of a message identifier, a message receiving time point, a message processing waiting time period and an expiration time. Therefore, the processed object can be automatically taken out from the processed object queue of the message merging end to process the message corresponding to the processed object, and the accumulation amount of the message can be reduced. And then, acquiring the message content from the processed key value pair corresponding to the message identifier in the message merging end and deleting the message content in the processed key value pair. Thus, the memory space occupied by the message content in the execution body of the message merging method for the message merging end can be reduced. And secondly, the information change content included in the message content can be processed to generate a submitting result which represents the success or failure of the processing. The message content may include information modification content. Finally, the submitting result may be sent to the execution body of the message merging method for the message merging end. The execution body of the message merging method for the message merging end may reissue, by the execution body of the message merging method for the message merging end, a message corresponding to the information change content in response to receiving a submission result indicating that the processing fails and determining that the number of processing failures of the information change content is less than or equal to a predetermined number. Therefore, the execution main body of the message merging method for the message merging end can reissue the message with failed processing according to the submitting result, and further can perform message merging on the reissued message. The method and the device can reduce the accumulation amount of the messages and reduce the processing load of related equipment when processing the message content of the messages.
With further reference to fig. 7, as an implementation of the method shown in the above figures, the present disclosure provides some embodiments of a message merging apparatus for a message merging terminal, which apparatus embodiments correspond to those method embodiments of steps 301-303 shown in fig. 3, and the apparatus is particularly applicable in various electronic devices.
As shown in fig. 7, a message merging apparatus 700 for a message merging terminal of some embodiments includes: a receiving unit 701, a setting-up unit 702, and a processing unit 703. Wherein the receiving unit 701 is configured to receive a message queue, wherein the message includes a message identifier and a message content; the establishing unit 702 is configured to establish key value pairs and object queues according to the message identifications included in the message queues, where the number of the established key value pairs is equal to the number of the message identifications included in the message queues, the keys in the key value pairs are used for storing the message identifications, and the values in the key value pairs are used for storing the message content; the processing unit 703 is configured to combine the message contents included in the message based on the key value pair and the object queue corresponding to each message in the message queue to generate a processed key value pair and a processed object queue, so as to obtain a processed key value pair set and a processed object queue set.
In an alternative implementation of some embodiments, the message content includes a message reception time point and a message processing wait period.
In an alternative implementation of some embodiments, the processing unit 703 of the message merging device 700 for the message merging side may first perform, in response to the absence of the message identifier of the message in the key of the key-value pair, the following processing: modifying the key of the key value pair into a message identifier included in the message, and modifying the value of the key value pair into the message content included in the message to generate a processed key value pair; determining the sum of a message receiving time point included in the message and a message processing waiting time period included in the message as an expiration time of the message; generating an object and adding the object to the object queue to generate a processed object queue, wherein the processed object comprises a message identifier, a message receiving time point, a message processing waiting time period and an expiration time of the message. The value of the key-value pair may then be modified to the message content included in the message in response to the message identification of the message being present in the key of the key-value pair to generate a processed key-value pair.
In an alternative implementation of some embodiments, the message content further includes modification content.
It will be appreciated that the elements recited in the apparatus 700 correspond to the various steps of the method described with reference to steps 301-303 of fig. 3. Thus, the operations, features and resulting benefits described above for the method are equally applicable to the apparatus 700 and the units contained therein, and are not described in detail herein.
With further reference to fig. 8, as an implementation of the method shown in the above figures, the present disclosure provides some embodiments of a message processing apparatus for a message processing end, which apparatus embodiments correspond to those method embodiments of steps 305, 307-308 shown in fig. 3, and the apparatus is particularly applicable in various electronic devices.
As shown in fig. 8, a message processing apparatus 800 for a message processing terminal of some embodiments includes: an extraction unit 801, a deletion unit 802, and a processing unit 803. Wherein the extracting unit 801 is configured to extract a processed object from a processed object queue of the message merging end, where the processed object includes a message identifier; the deleting unit 802 is configured to acquire the message content from the processed key value pair corresponding to the message identifier in the message merging terminal and delete the message content in the processed key value pair; the processing unit 803 is configured to perform message processing based on the above-described message content.
In an alternative implementation manner of some embodiments, the extracting unit 801 of the message processing apparatus 800 for a message processing end may extract a processed object whose expiration time is the current time from the above-mentioned processed object queue.
In an alternative implementation manner of some embodiments, the processing unit 803 of the message processing apparatus 800 used for the message processing end may first process the information modification content included in the message content to generate a submission result indicating that the processing is successful or failed; and then the submitting result is sent to the message merging end, wherein the message merging end responds to the receiving of the submitting result representing the processing failure and the determining that the processing failure times of the information change content are less than or equal to the preset times, and the message corresponding to the information change content is reissued.
It will be appreciated that the elements described in the apparatus 800 correspond to the various steps in the method described with reference to steps 305, 307-308 of fig. 3. Thus, the operations, features and resulting benefits described above with respect to the method are equally applicable to the apparatus 800 and the units contained therein, and are not described in detail herein.
Referring now to FIG. 9, a schematic diagram of an architecture of an electronic device (e.g., computing device 101 of FIG. 1 or computing device 201 of FIG. 2) 900 suitable for use in implementing some embodiments of the disclosure is shown. The electronic device shown in fig. 9 is merely an example, and should not impose any limitation on the functionality and scope of use of embodiments of the present disclosure.
As shown in fig. 9, the electronic device 900 may include a processing means (e.g., a central processor, a graphics processor, etc.) 901, which may 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 means 908 into a Random Access Memory (RAM) 903. In the RAM903, various programs and data necessary for the operation of the electronic device 900 are also stored. The processing device 901, the ROM 902, and the RAM903 are connected to each other through a bus 904. An input/output (I/O) interface 905 is also connected to the bus 904.
In general, the following devices may be connected to the I/O interface 905: input devices 906 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, and the like; an output device 907 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 908 including, for example, magnetic tape, hard disk, etc.; and a communication device 909. The communication means 909 may allow the electronic device 900 to communicate wirelessly or by wire with other devices to exchange data. While fig. 9 shows an electronic device 900 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead. Each block shown in fig. 9 may represent one device or a plurality of devices as needed.
In particular, according to some embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, some embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such embodiments, the computer program may be downloaded and installed from a network via communication device 909, or installed from storage device 908, or installed from ROM 902. The above-described functions defined in the methods of some embodiments of the present disclosure are performed when the computer program is executed by the processing device 901.
It should be noted that, in some embodiments of the present disclosure, the computer readable medium may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In some embodiments of the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In some embodiments of the present disclosure, however, the computer-readable signal medium may comprise a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.
In some implementations, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (HyperText Transfer Protocol ), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.
The computer readable medium may be embodied in the apparatus; or may exist alone without being incorporated into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: receiving a message queue, wherein the message comprises a message identifier and a message content; respectively establishing key value pairs and object queues according to each message identifier included in the message queues, wherein the number of the established key value pairs is equal to the number of the message identifiers included in the message queues, keys in the key value pairs are used for storing the message identifiers, and values in the key value pairs are used for storing message contents; and combining the message contents included in the message based on the key value pair and the object queue corresponding to each message in the message queue to generate a processed key value pair and a processed object queue, and obtaining a processed key value pair set and a processed object queue set.
Computer program code for carrying out operations for some embodiments of the present disclosure may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in some embodiments of the present disclosure may be implemented by means of software, or may be implemented by means of hardware. The described units may also be provided in a processor, for example, described as: a processor includes a receiving unit, a setup unit, and a processing unit. Where the names of the units do not constitute a limitation on the unit itself in some cases, for example, a receiving unit may also be described as a "unit receiving a message queue".
The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.
The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments of the present disclosure is not limited to the specific combination of the above technical features, but encompasses other technical features formed by any combination of the above technical features or their equivalents without departing from the spirit of the invention. Such as the above-described features, are mutually substituted with (but not limited to) the features having similar functions disclosed in the embodiments of the present disclosure.
Claims (10)
1. A message merging method for a message merging terminal, comprising:
receiving a message queue, wherein the message comprises a message identifier and a message content;
respectively establishing key value pairs and object queues according to each message identifier included in the message queues, wherein the number of the established key value pairs is equal to the number of the message identifiers included in the message queues, keys in the key value pairs are used for storing the message identifiers, and values in the key value pairs are used for storing message contents;
based on the key value pair and the object queue corresponding to each message in the message queue, combining the message content included in the message to generate a processed key value pair and a processed object queue, and obtaining a processed key value pair set and a processed object queue set, including:
in response to the message identification of the message not being present in the keys of the key-value pair, performing the following: modifying the keys of the key value pairs into message identifications included in the messages, and modifying the values of the key value pairs into message contents included in the messages so as to generate processed key value pairs; determining the sum of a message receiving time point included in the message and a message processing waiting time period included in the message as an expiration time of the message; generating an object and adding the object to the object queue to generate a processed object queue, wherein the processed object comprises a message identifier, a message receiving time point, a message processing waiting time period and an expiration time of the message;
In response to a message identification of the message being present in a key of the key-value pair, modifying a value of the key-value pair to a message content included in the message to generate a processed key-value pair.
2. The method of claim 1, wherein the message content includes a message reception time point and a message processing wait period.
3. The method of claim 2, wherein the message content further comprises information modification content.
4. A message processing method for a message processing terminal, comprising:
extracting a processed object from a processed object queue of a message merging end, wherein the processed object comprises a message identifier, and the message merging end implements the method according to any one of claims 1-3;
acquiring message content from the processed key value pair corresponding to the message identifier in the message merging terminal and deleting the message content in the processed key value pair;
and processing the message based on the message content.
5. The method of claim 4, wherein the extracting the processed object from the processed object queue at the message merge end comprises:
and extracting the processed object with the expiration time of the processed object as the current time from the processed object queue.
6. The method of claim 5, wherein the message processing based on the message content comprises:
processing the information change content included in the message content to generate a submitting result representing success or failure of processing;
and sending the submitting result to the message merging end, wherein the message merging end replying the message corresponding to the information change content in response to receiving the submitting result representing the processing failure and determining that the processing failure times of the information change content are less than or equal to the preset times.
7. A message merging apparatus for a message merging terminal, comprising:
a receiving unit configured to receive a message queue, wherein the message comprises a message identification and a message content;
the establishing unit is configured to respectively establish key value pairs and object queues according to the message identifications included in the message queues, wherein the number of the established key value pairs is equal to the number of the message identifications included in the message queues, keys in the key value pairs are used for storing the message identifications, and values in the key value pairs are used for storing message contents;
the processing unit is configured to combine the message contents included in the message based on the key value pair and the object queue corresponding to each message in the message queue to generate a processed key value pair and a processed object queue, and obtain a processed key value pair set and a processed object queue set, and the processing unit comprises: in response to the message identification of the message not being present in the keys of the key-value pair, performing the following: modifying the keys of the key value pairs into message identifications included in the messages, and modifying the values of the key value pairs into message contents included in the messages so as to generate processed key value pairs; determining the sum of a message receiving time point included in the message and a message processing waiting time period included in the message as an expiration time of the message; generating an object and adding the object to the object queue to generate a processed object queue, wherein the processed object comprises a message identifier, a message receiving time point, a message processing waiting time period and an expiration time of the message; in response to a message identification of the message being present in a key of the key-value pair, modifying a value of the key-value pair to a message content included in the message to generate a processed key-value pair.
8. A message processing apparatus for a message processing terminal, comprising:
an extraction unit configured to extract a processed object from a processed object queue of a message merging side, wherein the processed object comprises a message identification, the message merging side implementing the method according to any one of claims 1-3;
a deleting unit configured to acquire message content from the processed key value pair corresponding to the message identifier in the message merging end and delete the message content in the processed key value pair;
and a processing unit configured to perform message processing based on the message content.
9. An electronic device, comprising:
one or more processors;
a storage device having one or more programs stored thereon;
when executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-6.
10. A computer readable medium having stored thereon a computer program, wherein the program when executed by a processor implements the method of any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010945528.1A CN112069438B (en) | 2020-09-10 | 2020-09-10 | Message merging method, message processing method and device, equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010945528.1A CN112069438B (en) | 2020-09-10 | 2020-09-10 | Message merging method, message processing method and device, equipment and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112069438A CN112069438A (en) | 2020-12-11 |
| CN112069438B true CN112069438B (en) | 2023-12-22 |
Family
ID=73663377
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010945528.1A Active CN112069438B (en) | 2020-09-10 | 2020-09-10 | Message merging method, message processing method and device, equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112069438B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103209153A (en) * | 2012-01-16 | 2013-07-17 | 阿里巴巴集团控股有限公司 | Method, device and system for processing messages |
| CN107302489A (en) * | 2017-06-02 | 2017-10-27 | 北京潘达互娱科技有限公司 | Message display method and device |
| CN109617789A (en) * | 2018-12-29 | 2019-04-12 | 江苏满运软件科技有限公司 | Processing method, system, electronic equipment and the storage medium of conversation message |
| CN109873863A (en) * | 2019-01-18 | 2019-06-11 | 北京百度网讯科技有限公司 | The asynchronous invoking method and device of service |
| CN110968431A (en) * | 2018-09-28 | 2020-04-07 | 阿里巴巴集团控股有限公司 | Message processing method, device and equipment |
| CN111078422A (en) * | 2019-11-19 | 2020-04-28 | 泰康保险集团股份有限公司 | Message processing method, message processing device, readable storage medium and electronic equipment |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8223785B2 (en) * | 2004-09-13 | 2012-07-17 | International Business Machines Corporation | Message processing and content based searching for message locations in an asynchronous network |
| US9578081B2 (en) * | 2011-02-02 | 2017-02-21 | Imvu, Inc. | System and method for providing an actively invalidated client-side network resource cache |
| US10462067B2 (en) * | 2017-01-26 | 2019-10-29 | International Business Machines Corporation | Proactive channel agent |
| US10270726B2 (en) * | 2017-02-24 | 2019-04-23 | Satori Worldwide, Llc | Selective distribution of messages in a scalable, real-time messaging system |
| US10447623B2 (en) * | 2017-02-24 | 2019-10-15 | Satori Worldwide, Llc | Data storage systems and methods using a real-time messaging system |
| CN107451263B (en) * | 2017-07-31 | 2020-10-16 | 武汉斗鱼网络科技有限公司 | Method, storage medium, device and system for caching gift panel message |
| CN107479829B (en) * | 2017-08-03 | 2020-04-17 | 杭州铭师堂教育科技发展有限公司 | Redis cluster mass data rapid cleaning system and method based on message queue |
| US11436353B2 (en) * | 2017-09-13 | 2022-09-06 | Vmware, Inc. | Merge updates for key value stores |
| US10579449B1 (en) * | 2018-11-02 | 2020-03-03 | Dell Products, L.P. | Message queue architectures framework converter |
-
2020
- 2020-09-10 CN CN202010945528.1A patent/CN112069438B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103209153A (en) * | 2012-01-16 | 2013-07-17 | 阿里巴巴集团控股有限公司 | Method, device and system for processing messages |
| CN107302489A (en) * | 2017-06-02 | 2017-10-27 | 北京潘达互娱科技有限公司 | Message display method and device |
| CN110968431A (en) * | 2018-09-28 | 2020-04-07 | 阿里巴巴集团控股有限公司 | Message processing method, device and equipment |
| CN109617789A (en) * | 2018-12-29 | 2019-04-12 | 江苏满运软件科技有限公司 | Processing method, system, electronic equipment and the storage medium of conversation message |
| CN109873863A (en) * | 2019-01-18 | 2019-06-11 | 北京百度网讯科技有限公司 | The asynchronous invoking method and device of service |
| CN111078422A (en) * | 2019-11-19 | 2020-04-28 | 泰康保险集团股份有限公司 | Message processing method, message processing device, readable storage medium and electronic equipment |
Non-Patent Citations (2)
| Title |
|---|
| WebSphere MQ在零售业系统数据传输中的应用;马越等;上海师范大学学报(自然科学版);第46卷(第1期);第7-15页 * |
| 一种分布式复杂消息处理引擎的设计与实现;陆平等;中兴通讯技术;第19卷(第04期);第58-62页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112069438A (en) | 2020-12-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110781373B (en) | List updating method and device, readable medium and electronic equipment | |
| CN111338797A (en) | Task processing method and device, electronic equipment and computer readable storage medium | |
| CN112311656B (en) | Message aggregation and display method and device, electronic equipment and computer readable medium | |
| CN112445868A (en) | Service message processing method and device | |
| CN113722055A (en) | Data processing method and device, electronic equipment and computer readable medium | |
| CN111478781A (en) | Message broadcasting method and device | |
| CN111857720A (en) | Method and device for generating user interface state information, electronic equipment and medium | |
| CN111262778B (en) | Invitation link information processing method and device, electronic equipment and readable medium | |
| CN111756953A (en) | Video processing method, device, equipment and computer readable medium | |
| CN112069438B (en) | Message merging method, message processing method and device, equipment and medium | |
| CN107342981B (en) | Sensor data transmission method and device and virtual reality head-mounted equipment | |
| CN113553206B (en) | Data event execution method and device, electronic equipment and computer readable medium | |
| CN115766648A (en) | Method, device, electronic equipment and medium for sending group chat messages of cross-mail system | |
| CN112346661B (en) | Data processing method and device and electronic equipment | |
| CN112257039B (en) | Identity attribute adding method and device and electronic equipment | |
| CN112099841A (en) | Method and system for generating configuration file | |
| CN112311840A (en) | Multi-terminal data synchronization method, device, equipment and medium | |
| CN113766437B (en) | Short message sending method and device | |
| CN113472565B (en) | Method, apparatus, device and computer readable medium for expanding server function | |
| CN111314457B (en) | Method and device for setting virtual private cloud | |
| CN113535428B (en) | Method, device, equipment and medium for processing request message and response message | |
| CN112311833B (en) | Data updating method and device | |
| CN114398437A (en) | User information processing method and device, electronic equipment and computer readable medium | |
| CN113962782A (en) | Order information processing method and device, electronic equipment and computer readable medium | |
| CN114444064A (en) | Account processing method and device, electronic equipment and computer readable medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |