CN115633187B - Chat message processing method and device, computer equipment and storage medium - Google Patents

Chat message processing method and device, computer equipment and storage medium Download PDF

Info

Publication number
CN115633187B
CN115633187B CN202211652772.4A CN202211652772A CN115633187B CN 115633187 B CN115633187 B CN 115633187B CN 202211652772 A CN202211652772 A CN 202211652772A CN 115633187 B CN115633187 B CN 115633187B
Authority
CN
China
Prior art keywords
messages
sent
queue
chat
message
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
Application number
CN202211652772.4A
Other languages
Chinese (zh)
Other versions
CN115633187A (en
Inventor
谢韵佳
白剑
黄海亮
梁瑛玮
张海林
鲁和平
李长杰
陈焕然
李乐
王浩
洪行健
冷冬
丁一
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Yifang Information Technology Co ltd
Original Assignee
Yifang Information Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Yifang Information Technology Co ltd filed Critical Yifang Information Technology Co ltd
Priority to CN202211652772.4A priority Critical patent/CN115633187B/en
Publication of CN115633187A publication Critical patent/CN115633187A/en
Application granted granted Critical
Publication of CN115633187B publication Critical patent/CN115633187B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/21Server components or server architectures
    • H04N21/218Source of audio or video content, e.g. local disk arrays
    • H04N21/2187Live feed
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/5038Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/433Content storage operation, e.g. storage operation in response to a pause request, caching operations
    • H04N21/4331Caching operations, e.g. of an advertisement for later insertion during playback
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/435Processing of additional data, e.g. decrypting of additional data, reconstructing software from modules extracted from the transport stream
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/47End-user applications
    • H04N21/478Supplemental services, e.g. displaying phone caller identification, shopping application
    • H04N21/4788Supplemental services, e.g. displaying phone caller identification, shopping application communicating with other users, e.g. chatting

Abstract

The embodiment of the invention discloses a chat message processing method, a chat message processing device, computer equipment and a storage medium, wherein the method comprises the following steps: obtaining chat messages to be processed to obtain a message queue to be processed; grading the message queues to be processed according to timeliness of the chat messages to obtain at least 2 buffer queues with different priorities; obtaining chat messages of corresponding buffer queues based on different obtaining frequencies to obtain a first message queue to be sent, wherein the obtaining frequencies are determined according to the priority of the buffer queues; and merging the first message queue to be sent to obtain a second message queue to be sent. The invention obtains the chat messages based on the priority, processes the chat messages with high timeliness preferentially, and merges the obtained messages to be processed to obtain the messages to be sent, can be used for greatly relieving the pressure of memory overload when the chat messages are highly concurrent, and is convenient for users to obtain the chat messages with high priority and skip repeated chat messages.

Description

Chat message processing method and device, computer equipment and storage medium
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a chat message processing method and apparatus, a computer device, and a storage medium.
Background
In the network era, the live broadcast mainly refers to image-text live broadcast, such as live broadcast of sports events, news, classroom or e-commerce shopping. When watching the live broadcast, the user can issue chat messages to carry out synchronous communication, which is an important aspect of showing the social interaction of the live broadcast in the live broadcast, and especially in live communication scenes such as online classrooms or online shopping, the live broadcast user often responds to the chat messages sent by the user watching the live broadcast.
However, when the messages in the chat room are in a blowout situation in a short time, the excessive messages easily bring memory overload pressure to the server and the terminal equipment, and the users are not convenient to obtain the messages from the server and the terminal equipment, but the important messages are submerged in the sea of the messages. It is desirable to find a mechanism that can alleviate this problem from the source. For the problem caused by high concurrency of chat messages in the prior art, further research on chat message processing technology needs to be carried out.
Disclosure of Invention
The embodiment of the invention provides a chat message processing method, a chat message processing device, computer equipment and a storage medium, and aims to solve the problem caused by high concurrence of chat messages in the prior art.
In one aspect, the present invention provides a chat message processing method, including:
obtaining chat messages to be processed to obtain a message queue to be processed;
grading the message queues to be processed according to timeliness of the chat messages to obtain at least 2 buffer queues with different priorities;
obtaining chat messages of corresponding buffer queues based on different obtaining frequencies to obtain a first message queue to be sent, wherein the obtaining frequencies are determined according to the priority of the buffer queues;
and merging the first message queue to be sent to obtain a second message queue to be sent.
Further, the buffer queue includes a high priority queue and a low priority queue, the acquisition frequency of the high priority queue is real-time acquisition, and the acquisition frequency of the high priority queue is higher than that of the low priority queue.
Further, before the step of performing hierarchical processing on the queue of messages to be processed according to the timeliness of the chat messages, the method further comprises the following steps:
and obtaining the timeliness of the chat messages according to the types of the chat messages.
Further, the step of merging the first message queue to be sent to obtain a second message queue to be sent includes:
judging whether two or more than two mergeable messages exist in the first message queue to be sent, wherein the contents of the mergeable messages are the same;
if yes, judging whether the interval time of at least two adjacent mergeable messages is smaller than a first interval time threshold value;
and if so, merging all the mergeable messages within the second interval time threshold to obtain a second message queue to be sent.
Further, after the step of merging the first message queue to be sent to obtain the second message queue to be sent, the method further includes:
judging whether the number of the second message queues to be sent exceeds a number threshold value or not;
and if so, discarding the second message queue to be sent to obtain a third message queue to be sent.
Further, the step of discarding the second message queue to be sent to obtain a third message queue to be sent includes:
acquiring user information corresponding to the chat messages in the second message queue to be sent;
judging whether the corresponding chat message meets a discarding condition or not according to the user information;
and discarding the chat messages meeting the discarding condition based on the second message queue to be sent to obtain a third message queue to be sent.
Further, the user information includes at least one of user data perfection and user reputation, and the discarding condition includes that the user data perfection is lower than a perfection threshold or that the user reputation is lower than a reputation threshold.
In order to solve the problem caused by high concurrency of chat messages in the prior art, the invention aims to provide a chat message processing method, which comprises the following steps: obtaining chat messages to be processed to obtain a message queue to be processed; grading the message queues to be processed according to timeliness of the chat messages to obtain at least 2 buffer queues with different priorities; obtaining chat messages of corresponding buffer queues based on different obtaining frequencies to obtain a first message queue to be sent, wherein the obtaining frequencies are determined according to the priority of the buffer queues; and merging the first message queue to be sent to obtain a second message queue to be sent.
Compared with the prior art, the invention has the following advantages:
the chat messages are obtained based on the priority, the chat messages with high timeliness are processed preferentially, and the obtained messages to be processed are merged to obtain the final messages to be sent, so that the method can be used for greatly relieving the pressure of memory overload when the chat messages are highly concurrent, and is convenient for a user to obtain the chat messages with high priority and skip repeated chat messages.
In another aspect, the present invention provides a chat message processing apparatus, including:
the first acquisition module is used for acquiring the chat messages to be processed to obtain a message queue to be processed;
the grading module is used for grading the message queue to be processed according to the timeliness of the chat message to obtain at least 2 buffer queues with different priorities;
the second acquisition module is used for acquiring the chat messages of the corresponding buffer queue based on different acquisition frequencies to obtain a first message queue to be sent, and the acquisition frequencies are determined according to the priority of the buffer queue;
and the merging module is used for merging the first message queue to be sent to obtain a second message queue to be sent.
In yet another aspect, the present invention provides a computer device, which includes a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the method described above.
In a further aspect, the invention provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, is operable to perform a method as described above.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required to be used in the description of the embodiments of the present invention will be briefly introduced below, and it is obvious that the drawings in the description below are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive labor.
Fig. 1 is a flow chart of a chat message processing method according to an embodiment of the present invention.
Fig. 2 is a flow chart of a chat message processing method according to another embodiment of the present invention.
Fig. 3 is a schematic diagram of a chat message processing apparatus according to still another embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, a chat message processing method according to an embodiment of the present invention includes the following steps:
step 101, obtaining a chat message to be processed, and obtaining a message queue to be processed.
In the embodiment of the invention, the chat messages to be processed can be acquired at a preset time interval, the set of the chat messages is a queue of the chat messages to be processed, and under the condition of high concurrency of the chat messages, the queue of the chat messages to be processed can comprise a great number of chat messages.
And step 102, carrying out classification processing on the message queues to be processed according to the timeliness of the chat messages to obtain at least 2 buffer queues with different priorities.
In the embodiment of the invention, the message queues to be processed can be classified according to the timeliness of the chat messages to form 2 or more buffer queues, the buffer queues are endowed with different priorities, and the chat messages with high priorities can be preferentially processed according to the priority, so that the processing pressure of the device on the high concurrency of the chat messages is relieved. The timeliness of the chat message refers to the time interval and efficiency of receiving, processing and transmitting after the message is sent from the message source. The shorter the time interval is, the more timely the message is, and the stronger the timeliness is.
103, obtaining the chat messages of the corresponding buffer queue based on different obtaining frequencies to obtain a first message queue to be sent, wherein the obtaining frequencies are determined according to the priority of the buffer queue.
In the embodiment of the invention, the read acquisition frequency of different buffer queues can be given according to the priority levels of the buffer queues, so that on one hand, the reading priority order of the chat messages in different buffer queues is determined, the chat messages with high timeliness can be preferentially processed, the user experience is favorably improved, on the other hand, the corresponding acquisition frequency of different buffer queues can be adjusted according to the actual situation, and the processing pressure of the device is further relieved.
And 104, merging the first message queue to be sent to obtain a second message queue to be sent.
In the embodiment of the present invention, individual chat messages in the first message queue to be sent may be merged to obtain a smaller number of second message queues to be sent. If the number of the chat messages in the second message queue to be sent is still too large, the second message queue to be sent can be further processed, and if the number of the chat messages in the second message queue to be sent is in a reasonable range, the second message queue to be sent can be used for direct sending.
In order to solve the problem caused by high concurrency of chat messages in the prior art, the invention aims to provide a chat message processing method which can be used for greatly relieving the pressure of memory overload when the chat messages are highly concurrent, and is convenient for a user to obtain the chat messages with high priority and skip repeated chat messages.
Referring to fig. 2, a chat message processing method according to another embodiment of the present invention includes the following steps:
step 201, obtaining the chat message to be processed, and obtaining the message queue to be processed.
This step is the same as the corresponding step in the previous embodiment, and is not described again.
Step 202, the timeliness of the chat messages is obtained according to the types of the chat messages.
In this embodiment, the priority can be set according to the timeliness requirement of the chat message, and since different message types have different timeliness requirements, messages with high timeliness, such as notification messages enjoyed in a live broadcast room, interactive messages initiated by a main broadcast and audiences, and messages with low timeliness, such as conversation messages of ordinary users, can be set. The server divides the message types possibly appearing in the live broadcast room into high, medium and low priority levels according to respective timeliness requirements.
And 203, grading the message queues to be processed according to the timeliness of the chat messages to obtain at least 2 buffer queues with different priorities.
This step is the same as the corresponding step in the previous embodiment, and is not described again.
And 204, obtaining the chat messages of the corresponding buffer queues based on different obtaining frequencies to obtain a first message queue to be sent, wherein the obtaining frequencies are determined according to the priorities of the buffer queues.
In the embodiment of the present invention, the buffer queue may include a high priority queue and a low priority queue, where the obtaining frequency of the high priority queue is obtained in real time, and the obtaining frequency of the high priority queue is higher than that of the low priority queue. The specific number of the buffer queues and the respective corresponding acquisition frequencies are not limited, for example, the buffer queues may include a high-priority queue, a normal-priority queue, and a low-priority queue, the acquisition frequency of the high-priority queue is acquired every 0.1 second, that is, the high-priority queue is acquired in real time, so as to ensure the real-time performance of the chat messages in the high-priority queue, the acquisition frequency of the normal-priority queue may be set to be acquired every 0.3 second, and the acquisition frequency of the low-priority queue may be set to be acquired every 0.5 second. The number of buffer queues and their respective acquisition frequencies can be customized.
The frequency of acquisition may also be expressed in terms of number of reads per second, e.g., x reads per second for messages in a high priority queue, y reads per second for messages in a medium priority queue, and z reads per second for messages in a low priority queue, where x > y > z.
In this step, after the chat messages of the corresponding buffer queue are acquired based on different acquisition frequencies, the chat messages can be read at intervals of 0.1 second to form a first message queue to be sent, so as to ensure the real-time performance of the messages.
Step 205, determine whether there are two or more mergeable messages in the first to-be-sent message queue, and the contents of the mergeable messages are the same.
In the embodiment of the present invention, according to the service requirement, a character string, an emoticon ID, and the like that are desired to be merged, such as "+1", a favorite emoticon, a customized picture emoticon ID in the system, and the like, are set in the server, a maximum time interval allowed by two adjacent messages of the merged messages is set, a maximum time interval allowed by a first message and a last message of the merged messages is set, when more than one message belongs to the same content of the merged character string, the emoticon, the picture, and the like, and an interval time between two adjacent merged messages is small (smaller than a first interval time threshold), a merging operation is performed, and the merged messages with the same content in a second time threshold are merged, wherein the second time threshold is larger than the first time threshold, so that the processing time can be further saved.
Step 206, if yes, determine whether there are at least two adjacent mergeable messages whose interval time is less than the first interval time threshold.
In this step, when two or more than two mergeable messages exist in the first message queue to be sent, whether the interval time of the mergeable messages is shorter or not is further judged, and the mergeable messages with shorter interval time can be merged and sent, so that the processing pressure of the device can be relieved, and the communication between users cannot be influenced.
And step 207, if yes, merging all the mergeable messages within the second interval time threshold to obtain a second message queue to be sent.
In this step, all the mergeable messages with the same content read in a short time can be merged, and a second message queue to be sent with a smaller number of chat messages is obtained.
Step 208, determine whether the number of the second to-be-sent message queues exceeds a number threshold.
In the embodiment of the present invention, a threshold value of the number of messages to start "message discard" measures may be set in advance in the server, for example, messages exceed 500 messages per second, messages exceed 3000 messages in the last 10 seconds, and the like, before discard processing, it is determined whether the number of messages to be processed in each second (preset interval time) does not exceed the threshold value of 500 messages (or correspondingly, it is determined whether the number of messages to be processed in the first 10 seconds does not exceed 3000 messages if the preset interval time is 10 seconds), and if the number of messages to be processed exceeds the threshold value, discard processing is performed to relieve the performance pressure brought to the terminal device by high concurrent messages.
Step 209, if yes, discarding the second message queue to be sent to obtain a third message queue to be sent.
In the embodiment of the present invention, in the case of insufficient resources, the second to-be-sent message queue may be discarded to further reduce the processing pressure of the apparatus, and since the discarding of chat messages should not be easily used, the screening condition should be cautious, on one hand, the screening may be performed according to user information, and on the other hand, the screening may be performed according to other conditions, for example, whether the chat messages have a compliance problem, and the like, which is not limited herein, and may also be customized in actual operation.
As one embodiment, step 209 further includes:
acquiring user information corresponding to the chat messages in the second message queue to be sent; judging whether the corresponding chat message meets a discarding condition or not according to the user information; and discarding the chat messages meeting the discarding condition based on the second message queue to be sent to obtain a third message queue to be sent.
In an embodiment, whether the corresponding chat message meets a discarding condition may be determined according to the user information, specifically, the user information includes at least one of a user profile perfection and a user reputation, and the discarding condition includes that the user profile perfection is lower than a perfection threshold or the user reputation is lower than a reputation threshold. The conditions for discarding the messages can be set at the server according to the service requirements, for example, the messages with the user profile integrity lower than 50% can be set to meet the discarding conditions.
The embodiment of the invention combines a plurality of different measures (priority processing, merging processing and abandoning processing), the specific implementation condition of each measure also supports customization, the support to practical application is more flexible, the message volume received by a terminal user in unit time is reduced to the maximum extent, and the problems of equipment memory overload and user reading difficulty are avoided.
Referring to fig. 3, a chat message processing apparatus according to still another embodiment of the present invention can be used to implement corresponding steps of the foregoing method embodiment, including:
the first acquisition module is used for acquiring the chat messages to be processed to obtain a message queue to be processed;
the grading module is connected with the first acquisition module and is used for grading the message queues to be processed according to the timeliness of the chat messages to obtain at least 2 buffer queues with different priorities;
the second acquisition module is connected with the grading module and used for acquiring the chat messages of the corresponding buffer queue based on different acquisition frequencies to obtain a first message queue to be sent, and the acquisition frequency is determined according to the priority of the buffer queue;
and the merging module is connected with the second acquisition module and is used for merging the first message queue to be sent to obtain a second message queue to be sent.
In yet another aspect, the present invention provides a computer device, which includes a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the method described above.
In a further aspect, the invention provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, is operable to perform a method as described above.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (8)

1. A chat message processing method, comprising:
obtaining chat messages to be processed to obtain a message queue to be processed;
according to the timeliness of the chat message, the message queue to be processed is subjected to classification processing, and at least 2 buffer queues with different priorities are obtained;
obtaining the chat messages corresponding to the buffer queue based on different obtaining frequencies to obtain a first message queue to be sent, wherein the obtaining frequencies are determined according to the priority of the buffer queue;
merging the first message queue to be sent to obtain a second message queue to be sent;
before the step of performing hierarchical processing on the queue of messages to be processed according to the timeliness of the chat messages, the method further comprises the following steps of:
obtaining timeliness of the chat messages according to types of the chat messages, wherein the types of the chat messages comprise notification messages, interactive messages and conversation messages;
the step of merging the first message queue to be sent to obtain a second message queue to be sent includes:
judging whether two or more than two mergeable messages exist in the first message queue to be sent, wherein the contents of the mergeable messages are the same;
if yes, judging whether the interval time of at least two adjacent mergeable messages is smaller than a first interval time threshold value;
and if so, merging all the mergeable messages within a second interval time threshold to obtain the second message queue to be sent.
2. The method of claim 1, wherein the buffer queue comprises a high priority queue and a low priority queue, the frequency of acquiring the high priority queue is real-time acquisition, and the frequency of acquiring the high priority queue is higher than the frequency of acquiring the low priority queue.
3. The chat message processing method according to claim 1, further comprising, after the step of merging the first queue of messages to be sent to obtain a second queue of messages to be sent:
judging whether the number of the second message queues to be sent exceeds a number threshold value or not;
if so, discarding the second message queue to be sent to obtain a third message queue to be sent.
4. The chat message processing method according to claim 3, wherein the step of discarding the second queue of messages to be sent to obtain a third queue of messages to be sent comprises:
acquiring user information corresponding to the chat message in the second message queue to be sent;
judging whether the chat message meets a discarding condition or not according to the user information;
and discarding the chat messages meeting the discarding condition based on the second message queue to be sent to obtain a third message queue to be sent.
5. The chat message processing method of claim 4, wherein the user information includes at least one of a user profile completeness and a user reputation, and the discarding condition includes the user profile completeness being below a completeness threshold or the user reputation being below a reputation threshold.
6. A chat message processing apparatus, comprising:
the first acquisition module is used for acquiring the chat messages to be processed to obtain a message queue to be processed;
the grading module is used for grading the message queue to be processed according to the timeliness of the chat message to obtain at least 2 buffer queues with different priorities; the system is also used for obtaining the timeliness of the chat messages according to the types of the chat messages, wherein the types of the chat messages comprise notification messages, interactive messages and conversation messages;
the second obtaining module is used for obtaining the chat messages corresponding to the buffer queue based on different obtaining frequencies to obtain a first message queue to be sent, and the obtaining frequencies are determined according to the priority of the buffer queue;
the merging module is used for merging the first message queue to be sent to obtain a second message queue to be sent;
the merging module is further used for judging whether two or more than two mergeable messages exist in the first message queue to be sent, and the contents of the mergeable messages are the same; if yes, judging whether the interval time of at least two adjacent mergeable messages is smaller than a first interval time threshold value; and if so, merging all the mergeable messages within a second interval time threshold to obtain the second message queue to be sent.
7. A computer arrangement, characterized in that the computer arrangement comprises a memory having stored thereon a computer program and a processor implementing the method according to any of claims 1-5 when executing the computer program.
8. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program which, when executed by a processor, implements the method of any one of claims 1 to 5.
CN202211652772.4A 2022-12-22 2022-12-22 Chat message processing method and device, computer equipment and storage medium Active CN115633187B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211652772.4A CN115633187B (en) 2022-12-22 2022-12-22 Chat message processing method and device, computer equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211652772.4A CN115633187B (en) 2022-12-22 2022-12-22 Chat message processing method and device, computer equipment and storage medium

Publications (2)

Publication Number Publication Date
CN115633187A CN115633187A (en) 2023-01-20
CN115633187B true CN115633187B (en) 2023-04-07

Family

ID=84910576

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211652772.4A Active CN115633187B (en) 2022-12-22 2022-12-22 Chat message processing method and device, computer equipment and storage medium

Country Status (1)

Country Link
CN (1) CN115633187B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8244810B1 (en) * 2003-01-23 2012-08-14 Sprint Spectrum L.P. System and method for merging instant messages
WO2020006867A1 (en) * 2018-07-03 2020-01-09 平安科技(深圳)有限公司 Text message cache queue selection method and device, computer equipment and storage medium

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104468509A (en) * 2014-10-29 2015-03-25 北方工业大学 Method and system for transmitting mobile phone network game data and mobile phone user side
CN106302469A (en) * 2016-08-18 2017-01-04 北京奇虎科技有限公司 A kind of control the method and apparatus that information shows
CN106372204A (en) * 2016-08-31 2017-02-01 北京小米移动软件有限公司 Push message processing method and device
CN107147504A (en) * 2017-03-31 2017-09-08 北京奇艺世纪科技有限公司 A kind of information push method and device
CN110808950B (en) * 2019-09-25 2022-06-28 西安广和通无线软件有限公司 Message processing method, device, computer equipment and storage medium
CN112131346B (en) * 2020-09-25 2024-04-30 北京达佳互联信息技术有限公司 Comment aggregation method and device, storage medium and electronic equipment

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8244810B1 (en) * 2003-01-23 2012-08-14 Sprint Spectrum L.P. System and method for merging instant messages
WO2020006867A1 (en) * 2018-07-03 2020-01-09 平安科技(深圳)有限公司 Text message cache queue selection method and device, computer equipment and storage medium

Also Published As

Publication number Publication date
CN115633187A (en) 2023-01-20

Similar Documents

Publication Publication Date Title
CN111510395B (en) Service message reporting method, device, equipment and medium
CN108924662B (en) Continuous microphone interaction method, device, equipment and storage medium
CN108462896B (en) Live data stream processing method and device and electronic equipment
US11070495B2 (en) Systems and methods for a chatbot communication framework
US8713596B2 (en) Method and system for blocking hazardous information
KR102121035B1 (en) Information processing device, control method and program of information processing device
CN108418743B (en) Chat room message distribution method and device and electronic equipment
CN113891114B (en) Transcoding task scheduling method and device
CN113301342B (en) Video coding method, network live broadcasting method, device and terminal equipment
CN110234015A (en) Live-broadcast control method, device, storage medium, terminal
CN110022335B (en) Data packet transmitting method, device, server and computer readable storage medium
CN111541555A (en) Group chat optimization method and related product
CN110392098B (en) Self-adaptive virtual desktop transmission method and device
CN111526081B (en) Mail forwarding method, device, equipment and storage medium
CN115633187B (en) Chat message processing method and device, computer equipment and storage medium
US20060080704A1 (en) Method and system for transmitting a video message to television set
CN107124660B (en) Method and device for triggering broadcast information of live broadcast room
US8081960B2 (en) Device and method for processing data resource changing events in a mobile terminal
CN108989244B (en) Data processing method, data processing device, storage medium and electronic equipment
KR102462716B1 (en) Mobile communication message retransmission system using application programming interface and method thereof
CN113810629B (en) Video frame processing method and device for multimedia signal of fusion platform
CN106850980B (en) The method for cleaning and mobile terminal of Email attachment in a kind of mobile terminal
CN107239272B (en) Video capture equipment redirection method and device
CN112887294B (en) Multi-person voice chat system based on remote process call
CN112860431B (en) Connection method, system, equipment and storage medium of micro service node

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