CN112069438A - 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
- CN112069438A CN112069438A CN202010945528.1A CN202010945528A CN112069438A CN 112069438 A CN112069438 A CN 112069438A CN 202010945528 A CN202010945528 A CN 202010945528A CN 112069438 A CN112069438 A CN 112069438A
- Authority
- CN
- China
- Prior art keywords
- message
- value pair
- key
- queue
- processed
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 81
- 238000003672 processing method Methods 0.000 title claims abstract description 22
- 238000012545 processing Methods 0.000 claims abstract description 161
- 230000008859 change Effects 0.000 claims description 21
- 230000004044 response Effects 0.000 claims description 19
- 238000004590 computer program Methods 0.000 claims description 9
- 230000004075 alteration Effects 0.000 claims description 3
- 230000008569 process Effects 0.000 description 19
- 238000010586 diagram Methods 0.000 description 17
- 239000000284 extract Substances 0.000 description 8
- 230000006870 function Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 7
- 230000000295 complement effect Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000009825 accumulation Methods 0.000 description 3
- 230000003993 interaction Effects 0.000 description 3
- 238000012217 deletion Methods 0.000 description 2
- 230000037430 deletion Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000000605 extraction Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000012805 post-processing Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
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 method and device, equipment and a medium. One embodiment of the method comprises: receiving a message queue; respectively establishing key value pairs and an object queue according to each message identifier included by the message queue, wherein the number of the established key value pairs is equal to the number of the message identifiers included by the message queue, 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 by the messages to generate a processed key value pair and a processed object queue based on the key value pair and the object queue corresponding to each message in the message queue, so as to obtain a processed key value pair set and a processed object queue set. The embodiment can reduce the number of the message contents of the repeatedly processed message, and provides support for reducing the processing load of the related device when processing the message contents of the message.
Description
Technical Field
Embodiments of the present disclosure relate to the field of computer technologies, and in particular, to a message merging method, a message processing method and apparatus, a device, and a computer-readable medium.
Background
Currently, message processing devices typically need to process thousands of messages within a set time. However, there is often a peak in the reception of these messages, and the arrival of a large number of messages places a large processing load on the message processing apparatus. Therefore, how to reduce the processing load is a problem to be faced.
Disclosure of Invention
This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary 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 above background section.
In a first aspect, some embodiments of the present disclosure provide a message merging method for a message merging side, where the method includes: receiving a message queue, wherein the message comprises a message identifier and message content; respectively establishing key value pairs and an object queue according to each message identifier included by the message queue, wherein the number of the established key value pairs is equal to the number of the message identifiers included by the message queue, 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 by the messages to generate a processed key value pair and a processed object queue based on the key value pair and the object queue corresponding to each message in the message queue, so as to obtain 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 side, the apparatus including: a receiving unit configured to receive a message queue, wherein the message includes a message identifier and a message content; the system comprises an establishing unit, a storage unit and a processing unit, wherein the establishing unit is configured to respectively establish a key value pair and an object queue according to each message identifier included by the message queue, the number of the established key value pairs is equal to the number of the message identifiers included by the message queue, a key in the key value pair is used for storing the message identifier, and a value in the key value pair is used for storing the message content; and the processing unit is configured to perform merging processing on the message content included in the messages to generate a processed key value pair and a processed object queue based on the key value pair and the object queue corresponding to each message in the message queue, so as to 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, where the method includes: 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 at a message processing end, the apparatus including: the extraction unit is configured to extract a processed object from a processed object queue of a message merging end, wherein the processed object comprises a message identifier; a deleting unit configured to acquire a message content from a 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 the processing unit is 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; a storage device having one or more programs stored thereon which, when executed by one or more processors, cause the one or more processors to implement a method as in any one of the first and second aspects.
In a sixth aspect, some embodiments of the disclosure provide a computer readable medium having a computer program stored thereon, where 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 advantages: first, a message queue is received, wherein the message includes a message identifier and a message content. Then, according to each message mark included in the message queue, a key value pair and an object queue are respectively established. And establishing a plurality of key value pairs, wherein the number of the established key value pairs is equal to the number of the message identifications included by the message queue. The key in the key value pair is used for storing the message identification. The values in the key value pair are used for storing message contents. Therefore, the established key value pair and the object queue can be used as media to provide support for carrying out merging processing and message processing on the content of each message included in each message in the message queue. And finally, combining the message contents included by the messages to generate a processed key value pair and a processed object queue based on the key value pair and the object queue corresponding to each message in the message 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 queue can be merged, the message identifications and the message contents in the processed key value pairs in the obtained processed key value pair set are not repeated, and the processed objects in the processed object queues in the obtained processed object queue set are not repeated. The method and the device can reduce the number of the message contents of the messages which are processed repeatedly, and provide support for reducing the processing load of the relevant devices when the relevant devices process the message contents of the messages.
Drawings
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and features are not necessarily drawn to scale.
Fig. 1 is a schematic diagram of one application scenario of a message merge method for a message merge 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 merge device for a message merge side and a message processing device for a message processing side according to the present disclosure;
FIG. 4 is a flow diagram of some embodiments of a message merge method for a message merge side according to the present disclosure;
FIG. 5 is a flow diagram of further embodiments of a message merge method for a message merge terminal according to the present disclosure;
FIG. 6 is a flow diagram of some embodiments of a message processing method for a message processing side according to the present disclosure;
fig. 7 is a schematic block diagram of some embodiments of a message merge device for a message merge side according to the present disclosure;
FIG. 8 is a block diagram 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 is to be understood that the 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 for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the disclosure are for illustration purposes only and are not intended to limit the scope of the disclosure.
It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings. The embodiments and features of the embodiments in the present disclosure may be combined with each other without conflict.
It should be noted that the terms "first", "second", and the like in the present disclosure are only used for distinguishing different devices, modules or units, and are not used for limiting the order or interdependence relationship of the functions performed by the devices, modules or units.
It is noted that references to "a", "an", and "the" modifications in this disclosure are intended to be illustrative rather than limiting, and that those skilled in the art will recognize that "one or more" may be used unless the context clearly dictates otherwise.
The names of messages or information exchanged between devices in the embodiments of the present disclosure are for illustrative purposes only, and are not intended to limit the scope of the 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, where the message includes a message identifier and a message content. Then, the computing device 101 may respectively establish a key-value pair 103 and an object queue 104 according to each message identifier included in the message queue 102, where the number of the established key-value pairs is equal to the number of the message identifiers included in the message queue 102, a key in the key-value pair 103 is used for storing a message identifier, and a value in the key-value pair 103 is used for storing message content; finally, the computing device 101 may perform merging processing on the message content included in each 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, it may be implemented as a distributed cluster composed of multiple 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 enumerated above. It may be implemented, for example, as multiple pieces of software and software modules used to provide distributed services, or as a single piece of software or software module. And 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 implementation needs dictate.
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 a processed object queue 202 of a message merge side, where the processed object 204 includes a message identifier 205. Then, the computing device 201 may 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, the computing device 201 may perform message processing based on the message content 206 described above.
The computing device 201 may be hardware or software. When the computing device is hardware, it may be implemented as a distributed cluster composed of multiple 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 enumerated above. It may be implemented, for example, as multiple pieces of software and software modules used to provide distributed services, or as a single piece of software or software module. And 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 implementation needs dictate.
With continued reference to fig. 3, an illustration 300 of an interaction process between a message merge device for a message merge side and a message processing device for a message processing side is shown, in accordance with the present disclosure. The interaction process between the devices may include the steps of:
referring to fig. 3, the steps 301 and 303 are mainly used to describe the processing flow of the message merging end, which respectively correspond to the processing flow of the steps 401 and 403 in fig. 4. Step 304-308 is mainly used to describe the processing flow of the message processing end.
Step 301, the message merging end receives a message queue.
In some embodiments, the message merge side (e.g., the computing device 101 shown in fig. 1) may receive the message queue from the terminal through a wired connection or a wireless connection. Wherein, the message comprises a message identifier and a message content.
As an example, the above message queue may be [ [ message 001, [ modify post content to "two rooms one hall ] ] ], [ message 002, [ shelving post ] ], [ message 001, [ modify post content to" two rooms one hall 1500/month "] ], [ message 001, [ modify post content to" two rooms one hall 1500 yuan/month 62 flat ], [ message 002, [ shelving post ] ] ]. The above message may be [ message 001, [ modify post content to "two rooms one hall" ] ]. The above message identification may be [ message 001 ]. The above message content may be [ modify post content to "two rooms one living room" ].
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 of the message queue, the message merge terminal may first respond to determining that there is no key-value pair corresponding to the message identifier included in the message, and then establish an empty key-value pair and an empty object queue of the message identifier, respectively. And establishing a plurality of key value pairs, wherein the number of the established key value pairs is equal to the number of the message identifications included by the message queue. The key in the key value pair is used for storing the message identification. The values in the key value pair are used for storing message contents. Therefore, the established key value pair and the object queue can be used as media to provide support for carrying out merging processing and message processing on the content of each message included in each message in the message queue.
As an example, for the 1 st message [ message 001, [ modify post content to "two rooms one hall ] ] and the 2 nd message [ message 002, [ on shelf post ] ] in the message queue exemplified in step 301, the message merging end may first respond to determining that there is no key-value pair corresponding to the message identification [ message 001] included in the 1 st message, and then establish an empty key-value pair [, [ ]andan empty object queue [ ], respectively, according to the message identification [ message 001 ]. Then, the message merge terminal may respectively 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.
Step 303, the message merging end merges the message contents included in the messages 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 some embodiments, for each message in the message queue, the message merge side may first determine a key-value pair and an object queue corresponding to a message identifier included in the message. The message content comprised by the message may then be merged in response to determining that a predetermined condition is satisfied.
And in response to determining that the message content is merged, using the message identifier included in the message as a key, using 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.
And in response to determining that the message content is not merged, the key-value pair is an empty key-value pair, the message identifier included in the message is used as the key of the empty key-value pair, the message content included in the message is used as the value of the empty key-value pair to generate a processed key-value pair, and the message identifier included in the message is added to the object queue to generate a processed 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 retrieved by the message merging end. The predetermined condition may be "the presence of a message identifier included in the message in the key of the key-value pair". Therefore, the message contents included in the messages in the message queue can be merged, the message identifications and the message contents in the processed key value pairs in the obtained processed key value pair set are not repeated, and the processed objects in the processed object queues in the obtained processed object queue set are not repeated.
As an example, for the 4 th message [ message 001, [ modify post content to "1500 yuan/62 yue flat" ] ] in the message queue exemplified in step 301, the message merge side 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 rooms 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 content included in the 4 th message is merged. The message identification [ message 001] included in the 4 th message is used as a key, the message content [ post content is modified to "1500 yuan/month 62 flat" ] included in the 4 th message is used as a value to form a processed key value pair [ message 001, [ post content is modified to "1500 yuan/month 62 flat" ] ], and the determined key value pair [ message 001, [ post content is modified to "1500 yuan/month 62 flat" ] ] is deleted, and the object queue [ message 001] is determined as a processed object queue.
Step 304, the message processing end obtains the processed object queue from the message merging end.
In some embodiments, the message processing side may obtain the processed object queue from the message merging side.
As an example, the message handler may obtain the processed object queue [ message 001] from the message merge handler.
Step 305, the message processing end extracts the processed object from the processed object queue.
In some embodiments, the message processing side may extract a processed object from the processed object queue. The processed object may include a message identifier. The message merge side can implement the method in the embodiment corresponding to fig. 1.
As an example, the message processing side may extract a processed object "message 001" from the processed object queue [ message 001 ]. The above-mentioned processed object "message 001" may include a message identification [ message 001 ].
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, from the message merging end, the processed key-value pair corresponding to the message identifier. Therefore, the message processing terminal 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 handler may obtain, from the message merge side, the processed key-value pair corresponding to the message identifier [ message 001] in step 305. The processed key-value pair may be [ message 001, [ modify post content to "1500 yuan/62 yue flat in two rooms and one hall ] ] ].
And 307, the message processing terminal acquires 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 terminal 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 "1500 yuan/62 yuan flat" in two rooms and one hall ] from the processed key value pair [ message 001, [ modify the post content to "1500 yuan/62 yuan flat" in two rooms and one hall ] exemplified in step 306, and delete the message content [ modify the post content to "1500 yuan/62 yuan flat" in two rooms and one hall ] in the processed key value pair. The processed key-value pair after deletion of the message content is [ message 001, [ ] ].
And step 308, the message processing terminal processes the message based on the message content.
In some embodiments, the message processing terminal may perform message processing according to the message content. Thereby, the processing load of the related device when processing the message content of the message can be reduced.
As an example, the above message content may be [ modify post content to "two rooms 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 1500 yuan/62 yuan/level in the two rooms and one hall according to the message content (the post content is modified into 1500 yuan/62 yuan/level in the two rooms and one hall). I.e. the message content corresponding to message 001 is message processed.
The above embodiments of the present disclosure have the following advantages: firstly, a message merging end receives a message queue, wherein the message comprises a message identifier and message content. Then, the message merging end establishes a key value pair and an object queue respectively according to each message identifier included in the message queue. Therefore, the established key value pair and the object queue can be used as media to provide support for carrying out merging processing and message processing on the content of each message included in each message in the message queue. Then, the message merging end merges the message contents included in the messages based on the key value pairs and the object queues corresponding to the messages in the message queues to generate processed key value pairs and processed object queues, 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 queue can be merged, the message identifications and the message contents in the processed key value pairs in the obtained processed key value pair set are not repeated, and the processed objects in the processed object queues in the obtained processed object queue set are not repeated. Secondly, the message processing terminal obtains the processed object queue from the message merging terminal. Then, the message processing end extracts the processed object from the processed object queue. Then, the message processing end obtains the processed key value pair corresponding to the message identifier from the message merging end. Therefore, the message processing terminal 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 terminal 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 terminal processes the message based on the message content. Thereby, the processing load of the related device when processing the message content of the message can be reduced. The method and the device can reduce the number of the message contents of the repeatedly processed message and reduce the processing load of the related device when the related device processes the message contents of the message.
With continued reference to fig. 5, a flow 500 of further embodiments of a message merge method for a message merge peer according to the present disclosure is shown. The message merging method for the message merging end comprises the following steps:
In some embodiments, the specific implementation of step 501 and the technical effect brought by the implementation may refer to step 301 in those embodiments corresponding to fig. 3, which are not described herein again.
In some embodiments, for each message of the message queue, an executing body (e.g., the computing device 101 shown in fig. 1) of the message merging method for the message merging side may establish an empty key-value pair and an empty object queue according to the message identifier, respectively, in response to determining that there is no key-value pair corresponding to the message identifier included in the message. And establishing a plurality of key value pairs, wherein the number of the established key value pairs is equal to the number of the message identifications included by the message queue. And the key in the key value pair is used for storing the message identifier, and the value in the key value pair is used for storing the message content. The message content included in the message includes information change content, a message reception time point, and a message processing waiting time period. The information change content is a content after the information change. The message receiving time point refers to a time point when the execution main body of the message merging method for the message merging side receives a message. The message processing waiting time period refers to a time period for waiting for messages to be combined. Therefore, the established key value pairs and the object queue can be used as media to provide support for merging processing of each message content included in each message in the message queue, and provide support for an execution main body of the message processing method used for the message processing end to perform message processing on each message content included in each message in the message queue.
As an example, the message queue may be [ [ message 001, [ modify post content to "two rooms one hall", 2020/1/19:00, 3s ], [ message 002, [ shelving post, 2020/1/19:00, 3s ], [ message 001, [ modify post content to "two rooms one hall 1500/month", 2020/1/19:00, 3s ], [ message 001, [ modify post content to "two rooms one hall 1500 yuan/month 62 flat", 2020/1/19:00, 3s ], [ message 002, [ posting on shelf, 2020/1/19:00, 3s ] ] ]. For the 1 st message in the message queue [ message 001, [ modify post content to "two rooms one hall", 2020/1/19:00, 3s ] and 3 rd message [ message 001, [ modify post content to "two rooms one hall 1500/month", 2020/1/19:00, 3s ], the executing body of the message merging method for the message merging side first determines that there is no key-value pair corresponding to the message identifier [ message 001] included in the 1 st message, and establishes an empty key-value pair [, [ ] ] and an empty object queue [ ] according to the message identifier [ message 001], respectively. Then, the key-value pair and the object queue may not be established in response to determining that there is a key-value pair corresponding to the message identification [ message 001] included in the above-described 3 rd message.
In some embodiments, in response to that the message identifier of the message does not exist in the key of the key-value pair, the executing body of the message merging method for the message merging side may perform the following processing:
firstly, 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 message content included in the message to generate a processed key value pair. Wherein the processed key-value pair may be retrieved as a key-value pair by the execution entity.
As an example, the above-mentioned key-value pair may be [, [ ] ]. The message may include a message identification of [ message 001 ]. The message may include message content such as [ modify post content to "two rooms one hall", 2020/1/19:00, 3s ]. The execution body may determine that the message identification [ message 001] does not exist in the key-value pair, modify the key of the key-value pair [, [ ] ] to the message identification [ message 001], modify the value of the key-value pair [, [ ] ] to the message content [ modify post content to "two rooms one hall", 2020/1/19:00, 3s ]. The generated processed key-value pair is [ message 001, [ modify post content to "two rooms one hall", 2020/1/19:00, 3s ] ].
And a second step of determining a sum of a message reception time included in the message and a message processing waiting time period included in the message as an expiration time of the message.
As an example, the message may include a message reception time point of [ 2020/1/19:00: 00]. The message may include a message processing waiting period of [3s ]. The above message reception time point [ 2020/1/19:00:00 ] and the sum of the above message processing waiting period [3s ] is [ 2020/1/19:00: 03]. The execution body of the above message merge method for the message merge side may be a body that divides the message merge side into [ 2020/1/19:00: 03] is determined as the expiration time of the above 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 the message identifier of the message, a message receiving time point, a message processing waiting time period and an expiration time. Wherein the processed object queue may be retrieved by the execution main body as an object queue.
As an example, the object queue may be [ ]. The above message identification may be [ message 001 ]. The message reception time point may be [ 2020/1/19:00: 00]. The above message processing waiting period may be [3s ]. The expiration time may be [ 2020/1/19:00: 03]. The execution body of the above message merging method for the message merging side may generate an object "message 001, 2020/1/19:00:00, 3s, 2020/1/19: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/19:00:00, 3s, 2020/1/19:00: 03].
Through step 503, a non-empty processed key-value pair and a processed object queue may be generated according to the message identifier. And providing a comparison basis for the merging processing of the message contents of the messages. And providing a condition basis for the execution main body of the message processing method for the message processing end to perform message processing on the message content of the message.
In some embodiments, the executing entity of the message merging method for the message merging side may modify the value of the key-value pair into the message content included in the message in response to the presence of the message identifier of the message in the key of the key-value pair, so as to generate the processed key-value pair. Thereby, the merging processing of the message contents included in the messages is realized.
As an example, the above key-value pair may be [ message 001, [ modify post content to "two rooms one hall", 2020/1/19:00, 3s ] ]. For the 3 rd message [ message 001, [ modify post content to "two rooms one hall 1500/month" as exemplified by step 502, 2020/1/19:00, 3s ], the execution body of the message merging method for the message merging side may determine that a message id [ message 001] exists in the key value pair. The value of the above key-value pair [ modify post content to "two rooms one hall", 2020/1/19:00, 3s ] to the message content [ modify post content to "two rooms one hall 1500/month ], included in the above-mentioned 3 rd message [ 2020/1/19:00, 3s ]. The generated processed key-value pair is [ message 001, [ modify post content to "two rooms one hall 1500/month", 2020/1/19:00, 3s ] ].
The above embodiments of the present disclosure have the following advantages: first, a message queue is received, wherein the message includes a message identifier and a message content. And then, respectively establishing key value pairs and an object queue according to each message identifier included in the message queue, wherein the number of the established key value pairs is equal to the number of the message identifiers included in the message queue. And the key in the key value pair is used for storing the message identifier, and the value in the key value pair is used for storing the message content. Therefore, the established key value pairs and the object queue can be used as media to provide support for merging processing of each message content included in each message in the message queue, and provide support for an execution main body of the message processing method used for the message processing end to perform message processing on each message content included in each message in the message queue. Then, in response to that the message identifier of the message does not exist in the key of the key-value pair, executing 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 message content included in the message to generate a processed key-value pair; determining a sum of a message reception 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 into the object queue to generate a processed object queue, wherein the processed object comprises a message identifier of the message, a message receiving time point, a message processing waiting time period and an expiration time. Then, in response to the message identifier of the message existing in the key of the key-value pair, the value of the key-value pair may be modified to the message content included in the message to generate a processed key-value pair. Therefore, the non-empty processed key value pairs and the processed object queues can be generated according to the message identifiers, a comparison basis is provided for the merging processing of the message contents of the messages, and a condition basis is provided for the execution main body of the message processing method for the message processing end to perform the message processing on the message contents of the messages. And finally, in response to the message identifier of the message existing in the key of the key-value pair, modifying the value of the key-value pair into the message content included in the message to generate a processed key-value pair. Thereby, the merging processing of the message contents included in the messages is realized. The method and the device can reduce the number of the message contents of the messages which are processed repeatedly, and provide support for reducing the processing load of the relevant devices when the relevant devices process the message contents of the messages.
With continuing reference to fig. 6, a flow 600 of some embodiments of a message processing method for a message processing peer in accordance with the present disclosure is shown. The message processing method for the message processing terminal comprises the following steps:
In some embodiments, the processed objects in the processed object queue may be composed of a message identifier, a message reception time point, a message processing waiting 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. After the processed object is extracted, the processed object queue of the message merging end is empty. The message merge 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, the message content corresponding to the processed object can be processed, and the accumulation amount of the messages can be further reduced.
As an example, the above processed object queue may be [ message 001, 2020/1/19:00:00, 3s, 2020/1/19:00: 03 ]. The processed object may be "message 001, 2020/1/19:00:00, 3s, 2020/1/19:00: 03". The expiration time of the above processed object is "2020/1/19: 00: 03". The current time may be "2020/1/19: 00: 03". The execution body of the message processing method for the message processing side may determine that the expiration time is the current time, and extract a processed object 'message 001, 2020/1/19:00:00, 3s, 2020/1/19:00: 03' from the processed object queue. After the processed object is extracted, the processed object queue of the message merging end is [ ].
In some embodiments, the specific implementation of step 602 and the technical effect brought by the implementation may refer to step 307 in those embodiments corresponding to fig. 3, which are not described herein again.
In some embodiments, the execution main 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 submission result indicating that the processing is successful or failed.
As an example, the above message content may be [ modify post content to "two rooms one hall 1500 meta/month 62 flat", 2020/1/19:00, 3s ]. The message content may correspond to a message identification [ message 001 ]. The message content includes information change content [ the post content is modified to "1500 yuan/62 yue in two rooms and one hall" ]. The execution body of the message processing method for the message processing side may process the information change content [ modify the post content to "1500 yuan/month 62 flat" ] and modify the post content corresponding to [ message 001] to "1500 yuan/month 62 flat" in two rooms and one hall ". The generated commit result is "process success".
And step 604, sending the submission result to the message merging end.
In some embodiments, the execution main body of the message processing method for the message processing side may send the submission result to the execution main body of the message merging method for the message merging side. The execution main body of the message merging method for the message merging end may reissue the message corresponding to the information change content in response to receiving a submission result indicating that the processing fails and determining that the processing failure number of the information change content is less than or equal to a predetermined number of times. Therefore, the execution main body of the message merging method for the message merging end can perform complementary sending on the message with failed processing according to the submission result, and further perform message merging on the complementary message.
As an example, the message identifies [ message 001] corresponding message content [ modify post content to "two rooms one hall 1500 meta/month 62 flat" ], 2020/1/19:00, 3s ] the submission result corresponding to the information change content [ modify the post content to "1500 yuan/62 flat at two rooms and one hall" ] included may be "processing failure". The execution main body of the message processing method for the message processing side may send the submission result "processing failure" to the execution main body of the message merging method for the message merging side. The number of times of failure of the process of changing the content of the information may be 2. The predetermined number of times may be 5. When the execution main body of the message merging method for the message merging side receives the submission result representing the processing failure and determines that the processing failure frequency 2 of the information change content is less than the preset frequency 5, the execution main body of the message merging method for the message merging side reissues the message corresponding to the information change content [ the post content is modified to be '1500 yuan/62 yuan' ].
The above embodiments of the present disclosure have the following advantages: first, a processed object whose expiration time is the current time may be extracted from a processed object queue of the message merge side. The processed object in the processed object queue may be composed of a message identifier, a message reception 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 perform message processing on the message content corresponding to the processed object, and further the accumulation amount of the message can be reduced. And then, 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. Therefore, the memory space occupied by the message content in the execution main body of the message merging method for the message merging end can be reduced. Secondly, the information change content included in the message content can be processed to generate a submission result representing the success or failure of the processing. The message content may include information alteration content. Finally, the submission result may be sent to the execution body of the message merging method for the message merging side. The execution main body of the message merging method for the message merging end may reissue the message corresponding to the information change content in response to receiving a submission result indicating that the processing fails and determining that the processing failure number of the information change content is less than or equal to a predetermined number of times. Therefore, the execution main body of the message merging method for the message merging end can perform complementary sending on the message with failed processing according to the submission result, and further perform message merging on the complementary message. The method and the device can reduce the accumulation amount of the messages and reduce the processing load of the related equipment when the related equipment processes the message content of the messages.
With further reference to fig. 7, as an implementation of the methods shown in the above-mentioned figures, the present disclosure provides some embodiments of a message merging apparatus for a message merging side, where the apparatus embodiments correspond to those of the method embodiments of step 301 and step 303 shown in fig. 3, and the apparatus may be applied to various electronic devices.
As shown in fig. 7, the message merge device 700 for the message merge side of some embodiments includes: a receiving unit 701, a establishing unit 702 and a processing unit 703. The receiving unit 701 is configured to receive a message queue, where the message includes a message identifier and a message content; the establishing unit 702 is configured to respectively establish a key value pair and an object queue according to each message identifier included in the message queue, where the number of the established key value pairs is equal to the number of the message identifiers included in the message queue, a key in the key value pair is used for storing a message identifier, and a value in the key value pair is used for storing a message content; the processing unit 703 is configured to perform merging processing on the message content 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 waiting time period.
In an optional implementation manner of some embodiments, the processing unit 703 of the message merging apparatus 700 for the message merging end may first perform, in response to that the message identifier of the message does not exist 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 message content included in the message to generate a processed key-value pair; determining a sum of a message reception 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 into the object queue to generate a processed object queue, wherein the processed object comprises a message identifier of the message, a message receiving time point, a message processing waiting time period and an expiration time. The value of the key-value pair may then be modified to the message content included in the message in response to the presence of the message identification of the message 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 alteration content.
It is understood that the units described in the apparatus 700 correspond to the respective steps in the method described with reference to steps 301-303 of fig. 3. Thus, the operations, features and resulting advantages described above with respect to the method are also applicable to the apparatus 700 and the units included therein, and will not be described herein again.
With further reference to fig. 8, as an implementation of the methods shown in the above-mentioned figures, the present disclosure provides some embodiments of a message processing apparatus for a message processing end, which correspond to those of steps 305, 307 and 308 shown in fig. 3, and which can be applied in various electronic devices.
As shown in fig. 8, a message processing apparatus 800 for a message processing side of some embodiments includes: an extraction unit 801, a deletion unit 802, and a processing unit 803. The extracting unit 801 is configured to extract a processed object from a processed object queue of a message merging end, where the processed object includes a message identifier; the deleting unit 802 is configured to obtain a 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; the processing unit 803 is configured to perform message processing based on the message content described above.
In an optional implementation manner of some embodiments, the extracting unit 801 of the message processing apparatus 800 for a message processing side may extract, from the processed object queue, a processed object whose expiration time is the current time.
In an optional implementation manner of some embodiments, the processing unit 803 of the message processing apparatus 800 for a message processing end may first process information change content included in the message content to generate a submission result representing success or failure of processing; and then sending the submission result to the message merging end, wherein the message merging end responds to the submission result representing the processing failure and determines that the processing failure times of the information change content are less than or equal to the preset times, and reissues the message corresponding to the information change content.
It will be appreciated that the units described in the apparatus 800 correspond to the various steps in the method described with reference to steps 305, 307-308 of figure 3. Thus, the operations, features and resulting advantages described above with respect to the method are also applicable to the apparatus 800 and the units included therein, and are not described herein again.
Referring now to FIG. 9, shown is a schematic block diagram 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 present disclosure. The electronic device shown in fig. 9 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 9, the electronic device 900 may include a processing means (e.g., a central processing unit, a graphics processor, etc.) 901 that may perform various appropriate actions and processes in accordance with 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 apparatus 900 are also stored. The processing apparatus 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 bus 904.
Generally, the following devices may be connected to the I/O interface 905: input devices 906 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; 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 device 909 may allow the electronic apparatus 900 to perform wireless or wired communication with other apparatuses to exchange data. While fig. 9 illustrates 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 alternatively be implemented or provided. Each block shown in fig. 9 may represent one device or may represent multiple devices as desired.
In particular, according to some embodiments of the present disclosure, the processes described above with reference to the flow diagrams 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 illustrated in the flow chart. In some such embodiments, the computer program may be downloaded and installed from a network through the communication device 909, or installed from the storage device 908, or installed from the ROM 902. The computer program, when executed by the processing apparatus 901, performs the above-described functions defined in the methods of some embodiments of the present disclosure.
It should be noted that the computer readable medium described above in some embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination 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 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, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. 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, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
In some embodiments, the clients, servers may communicate using any currently known or future developed network Protocol, such as HTTP (HyperText Transfer Protocol), and may interconnect with any form or medium of digital data communication (e.g., a communications 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 network.
The computer readable medium may be embodied in the apparatus; or may exist separately without being assembled 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 message content; respectively establishing key value pairs and an object queue according to each message identifier included by the message queue, wherein the number of the established key value pairs is equal to the number of the message identifiers included by the message queue, 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 by the messages to generate a processed key value pair and a processed object queue based on the key value pair and the object queue corresponding to each message in the message queue, so as to obtain a processed key value pair set and a processed object queue set.
Computer program code for carrying out operations for embodiments of the present disclosure may be written in any combination of 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 type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart 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 software, and may also be implemented by hardware. The described units may also be provided in a processor, and may be described as: a processor includes a receiving unit, a establishing unit, and a processing unit. Where the names of these elements do not in some cases constitute a limitation on the elements themselves, for example, a receiving element may also be described as an "element of a received message queue".
The functions described herein above 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: field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), systems on a chip (SOCs), Complex Programmable Logic Devices (CPLDs), and the like.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology 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-mentioned features, but also encompasses other embodiments in which any combination of the above-mentioned features or their equivalents is made without departing from the inventive concept as defined above. For example, the above features and (but not limited to) technical features with similar functions disclosed in the embodiments of the present disclosure are mutually replaced to form the technical solution.
Claims (12)
1. A message merging method for a message merging side comprises the following steps:
receiving a message queue, wherein the message comprises a message identifier and message content;
respectively establishing key value pairs and an object queue according to each message identifier included by the message queue, wherein the number of the established key value pairs is equal to the number of the message identifiers included by the message queue, 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 merging the message contents included by the messages to generate a processed key value pair and a processed object queue based on the key value pair and the object queue corresponding to each message in the message queue to obtain a processed key value pair set and a processed object queue set.
2. The method of claim 1, wherein the message content comprises a message reception time point and a message processing waiting period.
3. The method of claim 2, wherein the merging the message content included in each message in the message queue to generate a processed key-value pair and a processed object queue based on the key-value pair and the object queue corresponding to the message comprises:
in response to the absence of the message identification of the message in the key of the key-value pair, performing the following:
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 message content included in the message to generate a processed key-value pair;
determining a sum of a message reception 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 into the object queue to generate a processed object queue, wherein the processed object comprises a message identifier of the message, a message receiving time point, a message processing waiting time period and an expiration time.
4. The method of claim 3, wherein the merging the message content included in each message in the message queue to generate a processed key-value pair and a processed object queue based on the key-value pair and the object queue corresponding to the message comprises:
in response to the message identification of the message existing in the key of the key-value pair, modifying the value of the key-value pair to the message content included in the message to generate a processed key-value pair.
5. The method of claim 2, wherein the message content further comprises information alteration content.
6. A message processing method for a message processing terminal comprises the following steps:
extracting a processed object from a processed object queue of a message merging side, wherein the processed object comprises a message identifier, and the message merging side implements the method according to any one of claims 1 to 5;
acquiring message content from a 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.
7. The method of claim 6, wherein the extracting the processed object from the processed object queue of the message merge side comprises:
and extracting the processed object with the expiration time of the processed object as the current time from the processed object queue.
8. The method of claim 7, wherein the message processing based on the message content comprises:
processing the information change content included in the message content to generate a submission result representing the success or failure of the processing;
and sending the submission result to the message merging end, wherein the message merging end responds to the submission result representing the processing failure and determines that the processing failure times of the information change content are less than or equal to the preset times, and reissues the message corresponding to the information change content.
9. A message merge device for a message merge side, comprising:
a receiving unit configured to receive a message queue, wherein the message comprises a message identifier and a message content;
the device comprises an establishing unit, a storage unit and a processing unit, wherein the establishing unit is configured to respectively establish a key value pair and an object queue according to each message identifier included by the message queue, the number of the established key value pairs is equal to the number of the message identifiers included by the message queue, keys in the key value pair are used for storing the message identifiers, and the values in the key value pair are used for storing message contents;
and the processing unit is configured to perform merging processing on the message content included in the message to generate a processed key value pair and a processed object queue based on the key value pair and the object queue corresponding to each message in the message queue, so as to obtain a processed key value pair set and a processed object queue set.
10. A message processing apparatus for a message processing side, comprising:
an extracting unit configured to extract a processed object from a processed object queue of a message merging side, wherein the processed object includes a message identifier, and the message merging side implements the method according to any one of claims 1 to 5;
a deleting unit configured to acquire a message content from a 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;
a processing unit configured to perform message processing based on the message content.
11. 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, cause the one or more processors to implement the method of any one of claims 1-8.
12. A computer-readable medium, on which a computer program is stored, wherein the program, when executed by a processor, implements the method of any one of claims 1-8.
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 true CN112069438A (en) | 2020-12-11 |
| CN112069438B 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 (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060056433A1 (en) * | 2004-09-13 | 2006-03-16 | Christian Herrmann | Message processing and content based searching for message locations in an asynchronous network |
| CN103209153A (en) * | 2012-01-16 | 2013-07-17 | 阿里巴巴集团控股有限公司 | Method, device and system for processing messages |
| US20140280522A1 (en) * | 2011-02-02 | 2014-09-18 | Imvu Inc. | System and method for providing an actively invalidated client-side network resource cache |
| CN107302489A (en) * | 2017-06-02 | 2017-10-27 | 北京潘达互娱科技有限公司 | Message display method and device |
| CN107451263A (en) * | 2017-07-31 | 2017-12-08 | 武汉斗鱼网络科技有限公司 | A kind of method, storage medium, equipment and system for caching present panel message |
| CN107479829A (en) * | 2017-08-03 | 2017-12-15 | 杭州铭师堂教育科技发展有限公司 | A kind of Redis cluster mass datas based on message queue quickly clear up system and method |
| US20180212857A1 (en) * | 2017-01-26 | 2018-07-26 | International Business Machines Corporation | Proactive channel agent |
| US20180248820A1 (en) * | 2017-02-24 | 2018-08-30 | Machine Zone, Inc. | Data storage systems and methods using a real-time messaging system |
| US20180248825A1 (en) * | 2017-02-24 | 2018-08-30 | Machine Zone, Inc. | Selective distribution of messages in a scalable, real-time messaging system |
| US20190080107A1 (en) * | 2017-09-13 | 2019-03-14 | Vmware, Inc. | Merge updates for key value stores |
| 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 |
| US10579449B1 (en) * | 2018-11-02 | 2020-03-03 | Dell Products, L.P. | Message queue architectures framework converter |
| 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 |
-
2020
- 2020-09-10 CN CN202010945528.1A patent/CN112069438B/en active Active
Patent Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060056433A1 (en) * | 2004-09-13 | 2006-03-16 | Christian Herrmann | Message processing and content based searching for message locations in an asynchronous network |
| US20140280522A1 (en) * | 2011-02-02 | 2014-09-18 | Imvu Inc. | System and method for providing an actively invalidated client-side network resource cache |
| CN103209153A (en) * | 2012-01-16 | 2013-07-17 | 阿里巴巴集团控股有限公司 | Method, device and system for processing messages |
| US20180212857A1 (en) * | 2017-01-26 | 2018-07-26 | International Business Machines Corporation | Proactive channel agent |
| US20180248825A1 (en) * | 2017-02-24 | 2018-08-30 | Machine Zone, Inc. | Selective distribution of messages in a scalable, real-time messaging system |
| US20180248820A1 (en) * | 2017-02-24 | 2018-08-30 | Machine Zone, Inc. | Data storage systems and methods using a real-time messaging system |
| CN107302489A (en) * | 2017-06-02 | 2017-10-27 | 北京潘达互娱科技有限公司 | Message display method and device |
| CN107451263A (en) * | 2017-07-31 | 2017-12-08 | 武汉斗鱼网络科技有限公司 | A kind of method, storage medium, equipment and system for caching present panel message |
| CN107479829A (en) * | 2017-08-03 | 2017-12-15 | 杭州铭师堂教育科技发展有限公司 | A kind of Redis cluster mass datas based on message queue quickly clear up system and method |
| US20190080107A1 (en) * | 2017-09-13 | 2019-03-14 | Vmware, Inc. | Merge updates for key value stores |
| CN110968431A (en) * | 2018-09-28 | 2020-04-07 | 阿里巴巴集团控股有限公司 | Message processing method, device and equipment |
| US10579449B1 (en) * | 2018-11-02 | 2020-03-03 | Dell Products, L.P. | Message queue architectures framework converter |
| 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 |
|---|
| 陆平;钱煜明;朱科支;: "一种分布式复杂消息处理引擎的设计与实现", 中兴通讯技术, vol. 19, no. 04, pages 58 - 62 * |
| 马越等: "WebSphere MQ在零售业系统数据传输中的应用", 上海师范大学学报(自然科学版), vol. 46, no. 1, pages 7 - 15 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112069438B (en) | 2023-12-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112311656B (en) | Message aggregation and display method and device, electronic equipment and computer readable medium | |
| CN111800513B (en) | Method and device for pushing information and computer readable medium of electronic equipment | |
| CN112416632B (en) | Event communication method and device, electronic equipment and computer readable medium | |
| CN113722055A (en) | Data processing method and device, electronic equipment and computer readable medium | |
| CN111857720A (en) | Method and device for generating user interface state information, electronic equipment and medium | |
| CN108764866B (en) | Method and equipment for allocating resources and drawing resources | |
| CN111756953A (en) | Video processing method, device, equipment and computer readable medium | |
| CN113553206B (en) | Data event execution method and device, electronic equipment and computer readable medium | |
| CN114490718A (en) | Data output method, data output device, electronic equipment and computer readable medium | |
| CN112069438A (en) | Message merging method, message processing method and device, equipment and medium | |
| CN114785770A (en) | Mirror layer file sending method and device, electronic equipment and computer readable medium | |
| CN113760927A (en) | Data processing method and device, electronic equipment and computer readable medium | |
| CN113760487A (en) | Service processing method and device | |
| CN113472565B (en) | Method, apparatus, device and computer readable medium for expanding server function | |
| CN113766437B (en) | Short message sending method and device | |
| CN114398437A (en) | User information processing method and device, electronic equipment and computer readable medium | |
| CN111314457B (en) | Method and device for setting virtual private cloud | |
| CN110633324B (en) | Method, apparatus, electronic device and computer readable medium for synchronizing data | |
| CN114444064A (en) | Account processing method and device, electronic equipment and computer readable medium | |
| CN114430364A (en) | Information display method and device, electronic equipment and computer readable medium | |
| CN113157276A (en) | Layout file conversion method, device, electronic equipment and computer readable medium | |
| CN113535428A (en) | Method, device, equipment and medium for processing request message and response message | |
| CN113962782A (en) | Order information processing method and device, electronic equipment and computer readable medium | |
| CN114116859A (en) | Number source information sending method and device, electronic equipment and computer readable medium | |
| CN115269645A (en) | Information query 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 |