CN112733010A - Message pushing method and device, electronic equipment and computer readable storage medium - Google Patents

Message pushing method and device, electronic equipment and computer readable storage medium Download PDF

Info

Publication number
CN112733010A
CN112733010A CN202011482684.5A CN202011482684A CN112733010A CN 112733010 A CN112733010 A CN 112733010A CN 202011482684 A CN202011482684 A CN 202011482684A CN 112733010 A CN112733010 A CN 112733010A
Authority
CN
China
Prior art keywords
message
aggregated
interactive
queue
messages
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.)
Pending
Application number
CN202011482684.5A
Other languages
Chinese (zh)
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.)
Guangdong Oppo Mobile Telecommunications Corp Ltd
Shenzhen Huantai Technology Co Ltd
Original Assignee
Guangdong Oppo Mobile Telecommunications Corp Ltd
Shenzhen Huantai 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 Guangdong Oppo Mobile Telecommunications Corp Ltd, Shenzhen Huantai Technology Co Ltd filed Critical Guangdong Oppo Mobile Telecommunications Corp Ltd
Priority to CN202011482684.5A priority Critical patent/CN112733010A/en
Publication of CN112733010A publication Critical patent/CN112733010A/en
Pending legal-status Critical Current

Links

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/953—Querying, e.g. by the use of web search engines
    • G06F16/9535—Search customisation based on user profiles and personalisation
    • 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/906—Clustering; Classification
    • 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/953—Querying, e.g. by the use of web search engines
    • G06F16/9538—Presentation of query results
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0241—Advertisements
    • G06Q30/0251—Targeted advertisements
    • G06Q30/0269—Targeted advertisements based on user profile or attribute
    • G06Q30/0271—Personalized advertisement
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0241—Advertisements
    • G06Q30/0277—Online advertisement

Abstract

The embodiment of the application relates to the technical field of data processing, and discloses a message pushing method and device, electronic equipment and a computer readable storage medium, wherein the method comprises the following steps: receiving an interactive message generated in a service scene; if the interactive message is a message which can not be aggregated, adding the interactive message to an aggregated queue, and if the interactive message is a polymerizable message, adding the interactive message to a queue to be aggregated; further, if the interactive messages in the queue to be aggregated meet the aggregation condition, aggregating the interactive messages in the queue to be aggregated into a first aggregated message and adding the first aggregated message to the aggregated queue; and when the reading operation aiming at the interactive message is detected, outputting the interactive message stored in the aggregated queue. By implementing the embodiment of the application, the efficiency of reading the interactive message by the user can be improved.

Description

Message pushing method and device, electronic equipment and computer readable storage medium
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a message pushing method and apparatus, an electronic device, and a computer-readable storage medium.
Background
In order to increase interactivity among users, social software such as short video software and chat software nowadays mostly designs interactive functions such as praise, comment and attention. And in order to enable the user to know the interactive message at the first time, the corresponding interactive message is pushed for the user when interactive behaviors such as approval, comment or attention are generated.
In practice, it is found that when too many interactive behaviors such as praise, comment or attention are generated, a user can be pushed a large amount of interactive messages, and the user cannot read the interactive messages conveniently.
Disclosure of Invention
The embodiment of the application discloses a message pushing method and device, electronic equipment and a computer readable storage medium, which can improve the efficiency of reading interactive messages by a user.
A first aspect of an embodiment of the present application discloses a method for pushing a message, where the method includes:
receiving a target interactive message generated in a service scene;
if the target interactive message is a message which can not be aggregated, adding the target interactive message to an aggregated queue, and if the target interactive message is a polymerizable message, adding the target interactive message to a queue to be aggregated;
if the interactive messages in the queue to be aggregated meet the aggregation condition, aggregating the interactive messages in the queue to be aggregated into a first aggregated message, and adding the first aggregated message to the aggregated queue;
and outputting the interactive messages stored in the aggregated queue.
A second aspect of the embodiments of the present application discloses a message pushing apparatus, including:
the receiving unit is used for receiving the target interactive message generated in the service scene;
an adding unit, configured to add the target interaction message to an aggregated queue when the target interaction message is a non-aggregatable message; when the target interactive message is a polymerizable message, adding the target interactive message to a queue to be polymerized;
the aggregation unit is used for aggregating the interactive messages in the queue to be aggregated into a first aggregated message when the interactive messages in the queue to be aggregated meet an aggregation condition, and adding the first aggregated message to the aggregated queue;
and the output unit is used for outputting the interactive messages stored in the aggregated queue.
A third aspect of the embodiments of the present application discloses an electronic device, including:
a memory storing executable program code;
a processor coupled with the memory;
the processor calls the executable program code stored in the memory to execute the message pushing method disclosed in the first aspect of the embodiment of the present application.
A fourth aspect of the embodiments of the present application discloses a computer-readable storage medium, which stores a computer program, where the computer program enables a computer to execute the message pushing method disclosed in the first aspect of the embodiments of the present application.
A fifth aspect of embodiments of the present application discloses a computer program product, which, when run on a computer, causes the computer to perform part or all of the steps of any one of the methods of the first aspect of embodiments of the present application.
A sixth aspect of the present embodiment discloses an application publishing platform, where the application publishing platform is configured to publish a computer program product, where the computer program product, when running on a computer, causes the computer to perform part or all of the steps of any one of the methods in the first aspect of the present embodiment.
Compared with the prior art, the embodiment of the application has the following beneficial effects:
the method and the device for processing the interactive messages can add the received interactive messages into different queues according to whether the received interactive messages are polymerizable messages or non-polymerizable messages, for example, the non-polymerizable messages are directly added into the polymerized queues because the non-polymerizable messages are required to be displayed independently and cannot be polymerized subsequently; and for the polymerizable message, because it is not known whether the subsequently received interactive message can be polymerized with the polymerizable message continuously, the polymerizable message is added into the queue to be polymerized first, and then when the polymerizable message meets the polymerization condition, the polymerization is carried out, and the polymerized message obtained by polymerization is added into the polymerized queue. Therefore, as the number of the messages stored in the aggregated queue is aggregated and compressed, when the reading operation for the interactive messages is detected, the client does not need to output all the interactive messages to the user one by one, but can output the messages stored in the aggregated queue to the user, so that the reading amount of the user is reduced, and the efficiency of reading the interactive messages by the user is improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.
Fig. 1 is a schematic diagram of an application scenario applicable to a message pushing method disclosed in an embodiment of the present application;
fig. 2 is a schematic flowchart of a message pushing method disclosed in an embodiment of the present application;
FIG. 3 is a schematic diagram of a queue to be aggregated and an aggregated queue disclosed in an embodiment of the present application;
fig. 4 is a schematic flowchart of another message pushing method disclosed in an embodiment of the present application;
fig. 5A is a schematic diagram for explaining how to determine that the interactive messages in the queue to be aggregated satisfy the aggregation condition according to the embodiment of the present application;
fig. 5B is another schematic diagram for explaining how to determine that the interactive messages in the queue to be aggregated satisfy the aggregation condition, disclosed in the embodiment of the present application;
fig. 5C is a schematic diagram for explaining how to determine that the interactive messages in the queue to be aggregated satisfy the aggregation condition according to the embodiment of the present application;
fig. 6 is a schematic flowchart of another message pushing method disclosed in an embodiment of the present application;
FIG. 7A is a diagram illustrating how an embodiment of the present application outputs an interactive message in an aggregated queue, according to an embodiment of the present application;
FIG. 7B is another schematic diagram for explaining how the embodiment of the present application outputs an interactive message in an aggregated queue, disclosed in the embodiment of the present application;
FIG. 7C is a diagram illustrating another example of how an interactive message in an aggregated queue is output according to an embodiment of the present application;
FIG. 7D is a diagram illustrating another example of how an interactive message in an aggregated queue is output according to an embodiment of the present application;
fig. 8 is a schematic structural diagram of a message pushing apparatus disclosed in an embodiment of the present application;
fig. 9 is a schematic structural diagram of another message pushing apparatus disclosed in an embodiment of the present application;
fig. 10 is a schematic structural diagram of an electronic device disclosed in an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. 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 application.
It should be noted that the terms "first", "second", "third" and "fourth", etc. in the description and claims of the present application are used for distinguishing different objects, and are not used for describing a specific order. The terms "comprises," "comprising," and "having," and any variations thereof, of the embodiments of the present application, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
The embodiment of the application discloses a message pushing method and device, electronic equipment and a computer readable storage medium, which can improve the efficiency of reading interactive messages by a user.
The technical solution of the present application will be described in detail with reference to specific examples.
To more clearly illustrate a message pushing method disclosed in the embodiments of the present application, an application scenario applicable to the message pushing method is first introduced. As shown in fig. 1, the message pushing method may be applied to a server 110, and the server 110 may receive an interactive message (e.g., praise, comment, etc.) generated by a client 120 (e.g., a mobile phone, a tablet computer, etc.) in a business scenario (e.g., a circle of friends in social software, or a comment function in short video playing software, etc.); the server may add the received interactive message to different queues according to whether the received interactive message is a polymerizable message (e.g., a message without specific content, such as a praise message, which is convenient for a user to read and can be aggregated) or a non-polymerizable message (e.g., a message with specific content, such as a comment message, which needs to be displayed separately for the user to see and cannot be aggregated); and the polymerizable message is added into the queue to be polymerized first because it is not known whether the subsequently received interactive message can be polymerized with the polymerizable message continuously, and then polymerization is executed and the polymerized message obtained by polymerization is added into the polymerized queue when the polymerizable message meets the polymerization condition. If the client 120 detects a read operation for the interactive message subsequently, the client 120 may send an interactive message obtaining request to the server 110, and the server 110 may output the interactive message in the aggregated queue for the client 120 to display.
In another embodiment, the message pushing method can also be directly applied to the client 120 (e.g., a mobile phone, a tablet computer, etc.). Similarly, the client 120 may classify the interactive messages generated in the service scenario into polymerizable messages and non-polymerizable messages, and directly add the non-polymerizable messages to the polymerized queue; and for the polymerizable message, because it is not known whether the subsequently received interactive message can be polymerized with the polymerizable message continuously, the polymerizable message is firstly added into the queue to be polymerized, and then when the polymerizable message meets the polymerization condition, the polymerization is executed, and the polymerized message obtained by polymerization is stored into the polymerized queue. Thereafter, when the client 120 detects a read operation for the interactive message (e.g., pull down the message list of the client 120, click a refresh button of the message list, etc., without limitation), the client 120 may directly output the interactive message in the aggregated queue.
In the embodiment of the present application, since the number of the aggregated messages in the aggregated queue is already aggregated and compressed, when a read operation for the push message is detected, the client does not need to output all the interactive messages to the user one by one, but can output the interactive messages stored in the aggregated queue to the user, thereby reducing the read amount of the user and improving the efficiency of the user in reading the push message.
Referring to fig. 2, fig. 2 is a schematic flow chart of a message pushing method disclosed in the embodiment of the present application, where the message pushing method may be applied to a server or a client such as a mobile phone or a tablet computer. The message pushing method can comprise the following steps:
202. and receiving the target interactive message generated in the service scene.
In the embodiment of the application, a client (for example, a mobile phone, a tablet computer, etc.) may be installed with a social application program such as a short video application program and a chat application program, and in order to improve interactivity of the social application program, the social application program is usually designed with interactive functions such as likes, comments, concerns, etc. And in order to enable the user to know the interactive message at the first time, the application program pushes the corresponding interactive message (for example, a praise message, a comment message, etc.) for the user when an interactive behavior such as a praise, a comment, or an attention occurs.
And in order to reduce the calculation amount of the client, the running speed of the client is improved. In an alternative embodiment, the client may report the interactive message generated by the application to a server (for example, a cloud server corresponding to the short video application, a server for processing the social message, and the like, which are not limited herein) for processing. So that the server can receive these interactive messages and perform subsequent processing. It is to be understood that the client may also process the interactive message generated in the service scenario by itself through a built-in processor, which is not limited herein.
204. And if the target interactive message is a message which can not be aggregated, adding the target interactive message to the aggregated queue, and if the target interactive message is a polymerizable message, adding the target interactive message to the queue to be aggregated.
In the embodiment of the present application, the interactive message generated in the service scenario may include a non-aggregatable message, an aggregatable message, and the like. For example, the interactive messages generated in the social comment area of the social application program may include comment messages, advertisement messages, praise messages, attention messages, visitor messages, and the like, where the comment messages, the advertisement messages, and the like, which carry more content and have small relevance between the messages, need to be displayed separately, and therefore cannot be aggregated, and the server may determine such messages as non-aggregatable messages; the contents carried by the praise message, the attention message, the visitor message and the like are less, and the messages have relevance, for example, two praise messages given by the same user are from the same user, and the two praise messages have stronger relevance, so that the two praise messages can be aggregated into an integrated aggregated message. The server may determine such messages as polymerizable messages; furthermore, viewed messages (e.g., viewed messages viewed by a user such as viewed comment messages, advertisement messages, or like favorable messages) are not required to be displayed separately because they have already been read by the user, and the server may also determine such non-aggregatable messages as being polymerizable messages that have already been viewed by the user or that have already been displayed by the client.
Optionally, the server may determine a message originating from the same user (or performer) as a polymerizable message, and correspondingly determine a message originating from a different user (or performer) as a non-polymerizable message, so as to ensure that aggregated messages output by subsequent servers are all originated from the same user or performer, which is convenient for viewing. In fact, in other alternative embodiments, the server may further define the non-aggregatable message and the aggregatable message in the interactive message according to other rules, which are not limited herein.
In this embodiment of the present application, the server may be at least provided with an aggregated queue and a queue to be aggregated, where the aggregated queue may be used to store non-aggregatable messages in the interactive messages and aggregated messages obtained after aggregation of the aggregated messages, and the queue to be aggregated may be used to temporarily store aggregated messages in the interactive messages, and the aggregated messages stored in the queue to be aggregated are only temporarily stored, and if the aggregated messages stored in the queue to be aggregated satisfy aggregation conditions, for example: and if the number of the polymerizable messages in the queue to be polymerized reaches the threshold value, the server can polymerize the polymerizable messages in the queue to be polymerized into one polymerized message and add the polymerized message to the polymerized queue. Optionally, in order to prevent the polymerizable message that has been polymerized into the polymerized message from continuing to be stored in the queue to be polymerized and affecting the polymerization of other polymerizable messages in the queue to be polymerized, the server may delete the polymerizable message that has been polymerized into the polymerized message from the queue to be polymerized.
It should be noted that the aggregated queue and the queue to be aggregated may be in the form of not only a queue, but also a storage form such as a stack and a list, and are not limited herein.
As shown in fig. 3, after the interactive messages received by the server, the aggregated interactive messages may be added to the queue to be aggregated, for example, if the message 8 and the message 9 are considered to be aggregated messages, the aggregated interactive messages may be temporarily stored in the queue to be aggregated, and the non-aggregated interactive messages may be directly added to the aggregated queue, for example, if the comment message 3, the comment message 6, and the comment message 7 are non-aggregated messages, the aggregated interactive messages may be directly added to the aggregated queue. And then when the subsequent server detects the reading operation aiming at the interactive message, the subsequent server can directly obtain the interactive message output from the aggregated queue.
206. And if the interactive messages in the queue to be aggregated meet the aggregation condition, aggregating the interactive messages in the queue to be aggregated into a first aggregated message, and adding the first aggregated message to the aggregated queue.
In the embodiment of the application, the server sets the queue to be aggregated, and temporarily stores the polymerizable interactive messages in the queue to be aggregated, and it is mainly unclear whether the subsequently received interactive messages can be aggregated with the currently received polymerizable interactive messages, so that the currently received polymerizable interactive messages are temporarily stored in the queue to be aggregated, and if the subsequently received interactive messages can be aggregated with the interactive messages temporarily stored in the queue to be aggregated, the subsequently received interactive messages can be added to the queue to be aggregated, so as to be aggregated with the interactive messages temporarily stored in the queue to be aggregated when the interactive messages in the queue to be aggregated meet the aggregation condition. For example, referring to fig. 3, the seen message 8 and the seen message 9 are currently received polymerizable messages, but since it is unclear whether the subsequently received interactive message 10 is the same or not, the seen message 8 and the seen message 9 may be temporarily stored in the queue to be polymerized, so that if the subsequently received interactive message 10 is the same as the seen message, the seen message 10 may be added to the queue to be polymerized to wait for being polymerized with other polymerizable interactive messages.
In the embodiment of the application, in order to avoid excessive polymerizable messages stored in the queue to be polymerized and increase the difficulty of polymerizing the subsequent server, the server may determine that the interactive messages in the queue to be polymerized satisfy the polymerization condition when the interactive messages in the queue to be polymerized reach a certain number. In another optional embodiment, in order to order the interactive messages in the aggregated queue in terms of time, if the interactive message currently received by the server is a non-aggregatable message, and if the interactive message is stored in the queue to be aggregated, the server may determine that the interactive message in the queue to be aggregated satisfies the aggregation condition. For example, referring to fig. 3 again, the like message 1 and the like message 2 are polymerizable messages, which are originally stored in the queue to be aggregated, and since the comment message 3, which is arranged after the like message 2 at the time of receiving, is a non-aggregatable message, in order to make the interaction messages in the aggregated queue ordered in time, the server does not aggregate the like message 4, which is arranged after the like message 3 at the time of receiving, with the like message 1 and the like message 2, but triggers the like message 1 and the like message 2 to aggregate upon receiving the comment message 3, so that the messages in the subsequent aggregated queue are ordered in time as shown in fig. 3 as the like messages 1 and 2, the comment message 3, and the like message 4.
It should be further noted that, after aggregating the interactive messages in the queue to be aggregated into the first aggregated message, in order to enable the user to roughly know details of the first aggregated message when reading the first aggregated message, optionally, the first aggregated message may include one or more of the number of the aggregated interactive messages, the type of the aggregated interactive messages, and a receiving time point of the aggregated interactive messages (optionally, when the receiving time points of the aggregated interactive messages are different, the server may select a receiving time point of one of the interactive messages (for example, the receiving time point is closest to or farthest from the current time point) as the receiving time point of the first aggregated message, which is not limited herein).
For example, assume that the first aggregated message is aggregated from 3 praise messages, and the receiving time point of the praise message whose receiving time point is closest to the current time point is 14: 16, the first aggregated message may be displayed as "compliment message (3 pieces, reception time: 14: 16)", which is not limited herein.
In addition, in practice, the messages displayed by the aggregated messages are only some abbreviated messages, and the user cannot see the messages actually carried by each aggregated interactive message (for example, the source of the interactive message, the described object, and the like), so optionally, the server may expand and output each interactive message aggregated by the first aggregated message for the user to read when the expansion operation for the first aggregated message is detected.
According to the method, the server can also expand and output each interactive message aggregated by the aggregated message for the user to read when the user has the detail for viewing each interactive message aggregated by the aggregated message, so that the use experience of the user is improved.
208. And outputting the interaction messages stored in the aggregated queue.
In the embodiment of the application, when the client has a requirement for displaying the interactive message, the client can send a reading request for the interactive message to the server, and then the server can output the interactive message stored in the aggregated queue to the client when detecting the reading request for the interactive message, so that the client can display the interactive message after receiving the interactive message sent by the server.
By implementing the method disclosed in each of the above embodiments, the received interactive message may be added to different queues according to whether the interactive message is a polymerizable message or a non-polymerizable message, for example, the non-polymerizable message is directly added to a polymerized queue because the non-polymerizable message cannot be polymerized because it needs to be displayed separately subsequently; and for the polymerizable message, because it is not known whether the subsequently received interactive message can be polymerized with the polymerizable message continuously, the polymerizable message is added into the queue to be polymerized first, and then when the polymerizable message meets the polymerization condition, the polymerization is carried out, and the polymerized message obtained by polymerization is added into the polymerized queue. Therefore, as the number of the messages stored in the aggregated queue is aggregated and compressed, when the reading operation for the interactive messages is detected, the client does not need to output all the interactive messages to the user one by one, but can output the messages stored in the aggregated queue to the user, so that the reading amount of the user is reduced, and the efficiency of reading the interactive messages by the user is improved.
Referring to fig. 4, fig. 4 is a schematic flow chart of another message pushing method disclosed in the embodiment of the present application, where the message pushing method may be applied to a server or a client such as a mobile phone or a tablet computer, and the embodiment of the present application takes the server as an execution subject for illustration, which should not be construed as a limitation to the embodiment of the present application. The message pushing method can comprise the following steps:
402. and receiving the target interactive message generated in the service scene.
404. And if the target interactive message is a message which can not be aggregated, adding the target interactive message to the aggregated queue, and if the target interactive message is a polymerizable message, adding the target interactive message to the queue to be aggregated.
406. And if the number of the interactive messages in the queue to be aggregated is equal to the first number, determining that the interactive messages in the queue to be aggregated meet the aggregation condition.
In this embodiment of the present application, in order to avoid excessive polymerizable messages stored in the queue to be aggregated and increase difficulty of a subsequent server in aggregation, the server may determine that the interactive messages in the queue to be aggregated satisfy the aggregation condition when the number of the interactive messages in the queue to be aggregated is equal to a first number (the first number may be set by a developer according to a large amount of development experience, and optionally, the first number may be determined according to a calculation capability of the server, or may be determined according to a maximum number of the interactive messages stored in the queue to be aggregated, which is not limited herein).
As an optional implementation manner, if the first interactive message arranged after the target interactive message at the receiving time point is a non-aggregatable message, the server may also determine that the interactive messages in the queue to be aggregated satisfy the aggregation condition; and receiving the interactive message with the time point closest to the current time point in the interactive messages of the queue to be aggregated. That is, after receiving an interactive message as a polymerizable message and adding the polymerizable interactive message to the queue to be polymerized (at this time, the polymerizable interactive message is the target interactive message), if receiving a next interactive message as a non-polymerizable message, the server may also determine that the interactive message in the queue to be polymerized satisfies the polymerization condition.
This is because, in practice, it is found that if the server sets the aggregation condition corresponding to the interactive messages in the queue to be aggregated to the number of interactive messages in the queue to be aggregated equal to the first number, the order of arrangement of the interactive messages added to the aggregated queue can only be satisfied temporally ordered if the reception time points of the interactive messages in the queue to be aggregated are consecutive.
For example, in conjunction with fig. 5A, assuming that the number of interactive messages in the queue to be aggregated is equal to 3, and the server determines that the interactive messages in the queue to be aggregated satisfy the aggregation condition, the polymerizable messages like message 1 and like message 2 in fig. 5A trigger aggregation when like message 4 is added to the list to be aggregated, and since comment message 3 is interposed between like message 1, like message 2 and like message 4, and comment message 3 is an unaggregable message, comment message 3 is preferably added to the aggregated list, so that the interactive messages in the subsequent aggregated list are arranged as shown in fig. 5A, that is, comment message 3 is arranged before like message 1 and like message 2, obviously such arrangement order is not satisfied in order in time.
In contrast, with reference to fig. 5B, after receiving the comment message 3 and determining that the comment message 3 is a non-aggregatable message, the server may determine that the praise message 1 and the praise message 2 stored in the queue to be aggregated satisfy the aggregation condition, aggregate the praise message 1 and the praise message 2 into the praise messages 1 and 2 and add the praise message 1 and the praise message 2 to the aggregated queue, and then add the comment message 3 to the aggregated queue. Referring again to fig. 5B, assuming that the interactive message subsequently received by the praise message 4 is the comment message 5, the server may determine that the praise message 4 satisfies the aggregation condition, but since only one of the praise messages 4 cannot perform aggregation, the server may directly add the praise message 4 to the aggregated list. And since comment message 5 is a non-aggregatable message, it can be added directly to the aggregated list. Therefore, the method can ensure that the arrangement sequence of the interactive messages in the aggregated queue is ordered in time, thereby facilitating the reading of users.
In an embodiment, if the first interactive message after the target interactive message is received at the time point is a non-aggregatable message, after the server determines that the interactive messages in the queue to be aggregated satisfy the aggregation condition, if there are multiple interactive messages in the list to be aggregated, the server may aggregate the multiple interactive messages (for example, the praise message 1 and the praise message 2 in fig. 5B are aggregated into the praise messages 1 and 2), and then add the aggregated message to the aggregated list. In another embodiment, if there is only one interactive message in the list to be aggregated (e.g., like message 4 in fig. 5B), the server may directly add the interactive message to the aggregated queue, thereby ensuring that the order of the interactive messages in the aggregated queue is ordered in time.
As another optional implementation manner, if a first interactive message whose time point is arranged after the target interactive message is received is different from a message type of the target interactive message (taking a comment function in the social application as an example, the message type may include, but is not limited to, like, comment, attention, and the like, and is not limited herein), the server may determine that the interactive messages in the queue to be aggregated satisfy the aggregation condition; and receiving the interactive message with the time point closest to the current time point in the interactive messages of the queue to be aggregated. That is, after receiving an interactive message as a polymerizable message and adding the polymerizable interactive message to the queue to be polymerized (at this time, the polymerizable interactive message is the target interactive message), if the message type of the received next interactive message is different from that of the interactive message stored in the queue to be polymerized, the server may also determine that the interactive message in the queue to be polymerized satisfies the polymerization condition.
For example, referring to fig. 5C, the viewed message 3 arranged after the message 2 is complied with at the time of receiving, because it is different from the message type of the message 2, if the two messages are aggregated, the aggregated message is aggregated by interactive messages of a plurality of different message types, so that the aggregated message is messy and inconvenient for the user to read and view. For this, the server can determine that the praise message 1 and the praise message 2 satisfy the aggregation condition when receiving the seen message 3, and aggregate the praise messages 1 and 2 to be added to the aggregated queue, and then the subsequent seen message 3 and the seen message 4 are the same in message type, and the next interactive message of the seen message 4 is the non-aggregated comment message 5, so the server can also aggregate the seen message 3 and the seen message 4 to be added to the aggregated queue, and the comment message 5 can be directly added to the aggregated queue because of being a non-aggregated message.
By implementing the method, the interactive messages aggregated by the aggregated messages stored in the subsequent aggregated list are ensured to be of the same message type, for example, the praise message is aggregated with the praise message, and the viewed message is aggregated with the viewed message, so that the condition that one aggregated message is aggregated by the interactive messages of various different message types can be avoided, the aggregated message is more neat and ordered, and the aggregated message is convenient for a user to read and view.
Optionally, if the first interactive message arranged after the target interactive message at the receiving time point is different from the message type of the target interactive message, after the server determines that the interactive messages in the queue to be aggregated satisfy the aggregation condition, if there are multiple interactive messages in the queue to be aggregated, the server may aggregate the multiple interactive messages, and then add the aggregated message to the aggregated queue. In another embodiment, if there is only one interactive message in the queue to be aggregated, the server may directly add the interactive message to the aggregated queue, thereby ensuring that the ordering order of the interactive messages in the aggregated queue is ordered in time.
408. And if the interactive messages in the queue to be aggregated meet the aggregation condition, aggregating the interactive messages in the queue to be aggregated into a first aggregated message, and adding the first aggregated message to the aggregated queue.
In this embodiment of the present application, the interactive messages in the aggregated queue may be sequentially sorted according to the adding time points of the interactive messages added to the aggregated queue. That is to say, the interactive messages in the aggregated queue are sorted according to the adding time points of the interactive messages added to the aggregated queue, so that when the server acquires the interactive messages from the aggregated queue, the interactive messages can be acquired according to the sorting sequence of the interactive messages in the aggregated queue, thereby ensuring that the acquired interactive messages are also time-ordered; and the interactive messages can be directly displayed when the client receives the interactive messages, so that the sequencing operation of the server or the client on the interactive messages is reduced on the premise of ensuring the interactive messages displayed by the client to be ordered in time, and the display efficiency of the interactive messages is improved.
410. And outputting the interaction messages stored in the aggregated queue.
In the embodiment of the application, when the server detects a reading operation for the interactive messages (for example, a message list of the client is pulled down, a refresh button of the message list is clicked, and the like, which is not limited herein), the interactive messages stored in the aggregated queue may be output to the client for display according to a defined arrangement order.
The defined arrangement order may be set by a developer according to a large amount of development experience, may be set by a client user according to the preference of the client user, or may be set by a server according to the historical reading habit of the user, which is not limited herein.
Optionally, the defined sequence may include a sequence from far to near of the receiving time point, a sequence from near to far of the receiving time point, or a sequence from high to low of the importance degree of the message, and the like, which is not limited herein. Optionally, the importance of the message may be determined according to the priority of the source user of the interactive message (the priority may be set by the client user for other users, wherein the higher the priority, the higher the importance of the interactive message sent by the user, and vice versa).
By implementing the method, the server can arrange the interactive messages according to the importance degree and then output the interactive messages to the client for display, so that the client user can preferentially see the interactive messages sent by the concerned user, and the reading experience of the client user is improved.
As an optional implementation manner, when the server detects a read operation for an interactive message, the server may classify the interactive messages in the aggregated queue according to users corresponding to the interactive messages, so as to obtain a plurality of message sets, where each message set corresponds to one user. And the server can output the plurality of message sets to the client for display, so that the messages of the same user can be displayed in the same set, and the user of the client can conveniently check the messages.
For example, if the interactive message 1 and the interactive message 2 are sent by zhangsan and the interactive message 3 and the interactive message 4 are sent by lie IV, the server may classify the interactive message 1 and the interactive message 2 into a message set corresponding to zhangsan and classify the interactive message 3 and the interactive message 4 into a message set corresponding to lie IV; the subsequent server can output the message set corresponding to Zhang III and the message set corresponding to Li IV to the client for display, so that the client user can clearly distinguish the interactive messages from Zhang III and Li IV, and the efficiency of reading the interactive messages by the user is improved.
By implementing the method disclosed by each embodiment, since the number of the messages stored in the aggregated queue is aggregated and compressed, when the reading operation for the interactive messages is detected, the client does not need to output all the interactive messages to the user one by one, but can output the messages stored in the aggregated queue to the user, so that the reading amount of the user is reduced, and the efficiency of the user in reading the interactive messages is improved; and realizing that the arrangement sequence of the interactive messages in the aggregated queue is ordered in time; the interactive messages aggregated by the aggregated messages stored in the subsequent aggregated list are ensured to be of the same message type, for example, the praise message is aggregated with the praise message, and the viewed message is aggregated with the viewed message, so that the condition that one aggregated message is aggregated by the interactive messages of various different message types can be avoided, the aggregated message is more neat and ordered, and the user can conveniently read and view the aggregated message; on the premise of ensuring that the interactive messages displayed by the client are ordered in time, the sequencing operation of the server or the client on the interactive messages is reduced, so that the display efficiency of the interactive messages is improved; and the messages in the aggregated queue can be output according to the defined arrangement sequence, so that the reading experience of the interactive messages of the user is improved.
Referring to fig. 6, fig. 6 is a schematic flowchart of another message pushing method disclosed in the embodiment of the present application, where the message pushing method may be applied to a server or a client such as a mobile phone or a tablet computer. The message pushing method can comprise the following steps:
602. and receiving the target interactive message generated in the service scene.
604. And if the target interactive message is a message which can not be aggregated, adding the target interactive message to the aggregated queue, and if the target interactive message is a polymerizable message, adding the target interactive message to the queue to be aggregated.
606. And if the interactive messages in the queue to be aggregated meet the aggregation condition, aggregating the interactive messages in the queue to be aggregated into a first aggregated message, and adding the first aggregated message to the aggregated queue.
As described above, in the embodiment of the present application, the first aggregated message may include detailed information such as the number of the aggregated interactive messages, the types of the aggregated interactive messages, and the receiving time points of the aggregated interactive messages. Optionally, the server may generate detailed information of the first aggregated message when aggregating the interactive messages in the queue to be aggregated into the first aggregated message.
In practice, it is found that when the aggregated interactive messages are greater than the number threshold (e.g., 100 pieces, 200 pieces, etc., without limitation), the server is prone to errors and is computationally intensive in collating a large amount of detail information because of the large amount of detail information. The server can perform detail calculation by adding one polymerizable interactive information in the queue to be polymerized each time through a real-time calculation frame (such as a flink, a forest, a real-time data analysis frame), so that the condition that the server calculates the detail information of a plurality of polymerizable interactive information at the same time can be avoided, and the calculation efficiency of the server on the detail information is improved.
608. And when the reading request aiming at the interactive message is detected, acquiring a second number of interactive messages in the aggregated queue and outputting the interactive messages.
In the related art, when a server receives a read request for an interactive message reported by a client, N (N is a positive integer, e.g., 20 or 30) interactive messages are usually selected from the received interactive messages, and aggregated messages among the N interactive messages are aggregated, and the aggregated interactive messages are fed back to the client for display. However, in practice, it is found that since the N messages may all be polymerizable messages, may all be non-polymerizable messages, and may also include both polymerizable messages and non-polymerizable messages, the number of interactive messages after the server performs the polymerization process may be equal to N, or may be less than N, and the total number of the interactive messages after the polymerization is uncertain.
For example: assuming that all received N interactive messages are non-aggregatable messages, the interactive messages output after the aggregation processing of the server are N; if the received N messages are all polymerizable messages, the number of the interactive messages output after the server performs polymerization processing is 1, and only one interactive message is displayed at the subsequent client, so that the client cannot display a certain number of interactive messages each time when the interactive messages are required to be displayed, and the efficiency of displaying the interactive messages at the client is not improved.
In contrast, by implementing the above-mentioned steps 602 to 608, the server may directly add the unaggregable message in the interactive message to the aggregated queue, and aggregate the polymerizable message in the interactive message into the aggregated message and add the aggregated message to the aggregated queue, so that the interactive messages stored in the aggregated queue do not need to be aggregated, and therefore the server may obtain a fixed number of interactive messages. For this, optionally, the server may obtain a second number (for example, 20, 30, and the like, where the specific number is determined according to the number specified by the interactive message reading operation reported by the client, and is not limited herein) of interactive messages in the aggregated queue when detecting the read request for the interactive message, and output the interactive messages to the client for display.
By implementing the method, because the interactive messages stored in the aggregated queue do not need to be aggregated, the server can obtain a fixed number of interactive messages from the aggregated queue to output the interactive messages, for example, if the server wants to output 20 interactive messages, the server can directly obtain 20 interactive messages which do not need to be aggregated from the aggregated list, thereby avoiding the situation that the server only outputs one interactive message when the client has a requirement for displaying the interactive messages, and improving the efficiency of displaying the interactive messages by the client.
In practice, it is found that when a read operation for the interaction information is detected, the server usually outputs the interaction information stored in the aggregated queue, but ignores the interaction information received by the server and stored in the queue to be aggregated, and actually the interaction information should also be output to the client for the user to read. Optionally, when the server detects a reading operation for the interactive information, if a plurality of pieces of interactive information are stored in the queue to be aggregated, the server may aggregate the plurality of pieces of interactive information into second aggregated information, add the second aggregated information to the aggregated queue, and output the interactive information stored in the aggregated queue, so that the client user can read the interactive information received by the server at the current time point every time of inputting the reading operation for the interactive information, thereby avoiding some interactive information from being missed in the queue to be aggregated.
In another optional embodiment, when the server detects a read operation for the interaction information, if the number of the interaction information in the queue to be aggregated is one, the server may directly add the interaction information to the aggregated queue, and then output the interaction information stored in the aggregated queue.
The method disclosed by each embodiment enables a client user to read the interactive information received by the server at the current time point every time the client user inputs the reading operation of the interactive information, and avoids some interactive information from being missed in the queue to be aggregated.
As described above, in the related art, each time a server receives a reading operation for an interactive message reported by a client, the server selects N (N is a positive integer, for example, 20 or 30) interactive messages from the received interactive messages, aggregates the messages that can be aggregated from the N interactive messages, and feeds back the obtained interactive messages after aggregation to the client for display. For example, referring to fig. 7A, assuming that when the client reports the reading operation for the interactive message for the first time, the interactive message received by the server is "comment message 1, praise message 2, and praise message 3", the server outputs "comment message 1, praise message 2, and praise message 3" to the client for display. Assuming that when the client reports the reading operation for the interactive message for the second time, the interactive message received by the server becomes "comment message 1, comment message 2, comment message 3, comment message 4, comment message 5" (as shown in fig. 7B), the server outputs "comment message 1, comment messages 2, 3, 4, and 5" to the client for display. It can be seen that the interactive message displayed by the client for the first time is changed when the interactive message is displayed for the second time (i.e. the messages 2 and 3 are changed into the messages 2, 3, 4 and 5, which are praised), so that it is difficult for the user to distinguish which messages are newly added when the client displays for the second time, which is not beneficial to improving the efficiency of the user in reading the interactive message.
In contrast, when the method is implemented, the server may directly add non-aggregatable messages in the interactive messages to the aggregated queue, aggregate the aggregatable messages in the interactive messages into aggregated messages, add the aggregated messages to the aggregated queue, process the interactive messages in the queue to be aggregated and add the processed interactive messages to the aggregated list each time the client reports the interactive messages, and acquire the interactive messages from the aggregated list and output the interactive messages to the client for display. Therefore, the interactive messages displayed by the client at the last time can be ensured not to be changed, the user can clearly distinguish which messages are newly added when the client displays at this time, and the efficiency of reading the interactive messages by the user is further improved.
For example, referring to fig. 7C, assuming that when the client reports a read operation for an interactive message for the first time, the interactive message received by the server is "comment message 1, like message 2, like message 3", the server may directly add the non-aggregated comment message 1 to the aggregated queue, add the aggregated like message 2 and like message 3 to the queue to be aggregated, and aggregate the like message 2 and like message 3 into like messages 2 and 3 to the aggregated queue when the client reports a read operation for the interactive message, so that the server may output the interactive message "comment message 1, like message 2, and like message 3" in the aggregated queue. Referring further to fig. 7D, it is assumed that when the client reports a read operation for an interactive message for the second time, the interactive message received by the server becomes "comment message 1, agree message 2, agree message 3, agree message 4, agree message 5", since the server in this embodiment of the present application sets the aggregated list and the to-be-aggregated list, and "comment message 1, agree message 2, agree message 3" is added to the aggregated queue after having been processed when the read request was received for the last time, the server can add the newly added "agree message 4 and agree message 5" to the to-be-aggregated queue, and when the read operation is received, the "agree message 4 and agree message 5" in the to-be-aggregated queue are aggregated and added to the aggregated queue, and then the interactive message stored by the aggregated queue output by the server for the second time is "comment message 1, the messages 2 and 3 are complied with, and the messages 4 and 5 are complied with, so that the client can quickly determine that the messages 4 and 5 are newly added when the messages are displayed for the second time, and the efficiency of reading interactive messages by a user is improved.
In another optional embodiment, when the number of the interactive messages in the aggregated queue is greater than the second number, the server may also output the interactive messages in the aggregated queue, so as to achieve the effect of emptying the aggregated queue, so as to make up the storage space of the aggregated queue.
By implementing the method disclosed by each embodiment, since the number of the messages stored in the aggregated queue is aggregated and compressed, when the reading operation for the interactive messages is detected, the client does not need to output all the interactive messages to the user one by one, but can output the messages stored in the aggregated queue to the user, so that the reading amount of the user is reduced, and the efficiency of the user in reading the interactive messages is improved; and the efficiency of the server for calculating the detailed information is improved, the interactive messages displayed by the client at the last time can be ensured not to be changed, the user can clearly distinguish which messages are newly added when the client displays at the time, and the efficiency of the user for reading the interactive messages is further improved.
Referring to fig. 8, fig. 8 is a schematic structural diagram of a message pushing apparatus disclosed in the embodiment of the present application, where the message pushing apparatus can be applied to the server or the client, and is not limited herein. The message pushing device may include: a receiving unit 801, an adding unit 802, an aggregating unit 803, and an outputting unit 804, wherein:
a receiving unit 801, configured to receive a target interaction message generated in a service scenario;
an adding unit 802, configured to add the target interactive message to the aggregated queue when the target interactive message is a non-aggregatable message; when the target interactive message is a polymerizable message, adding the target interactive message to a queue to be polymerized;
an aggregating unit 803, configured to aggregate, when the interactive messages in the queue to be aggregated satisfy an aggregation condition, the interactive messages in the queue to be aggregated into a first aggregated message, and add the first aggregated message to the aggregated queue;
an output unit 804, configured to output the interaction message stored in the aggregated queue.
By implementing the message pushing device, the received interactive message can be added to different queues according to whether the interactive message is a polymerizable message or a non-polymerizable message, for example, the non-polymerizable message cannot be polymerized because the non-polymerizable message needs to be displayed separately, so that the non-polymerizable message is directly added to a polymerized queue; and for the polymerizable message, because it is not known whether the subsequently received interactive message can be polymerized with the polymerizable message continuously, the polymerizable message is added into the queue to be polymerized first, and then when the polymerizable message meets the polymerization condition, the polymerization is carried out, and the polymerized message obtained by polymerization is added into the polymerized queue. Therefore, as the number of the messages stored in the aggregated queue is aggregated and compressed, when the reading operation for the interactive messages is detected, the client does not need to output all the interactive messages to the user one by one, but can output the messages stored in the aggregated queue to the user, so that the reading amount of the user is reduced, and the efficiency of reading the interactive messages by the user is improved.
Referring to fig. 9, fig. 9 is a schematic structural diagram of another message pushing apparatus disclosed in the embodiment of the present application, and the message pushing apparatus may also be applied to the above-mentioned server or the client, which is not limited herein. And the message pushing apparatus shown in fig. 9 may be optimized by the message pushing apparatus shown in fig. 8, and compared with the message pushing apparatus shown in fig. 8, the message pushing apparatus shown in fig. 9 may further include: a first determination unit 805, wherein:
a first determining unit 805, configured to determine that the interactive messages in the queue to be aggregated satisfy the aggregation condition if the number of the interactive messages in the queue to be aggregated is equal to the first number.
By implementing the message pushing device, the excessive polymerizable messages stored in the queue to be polymerized can be avoided, and the difficulty of subsequent servers in polymerization is reduced.
As an optional implementation manner, the message pushing apparatus shown in fig. 9 may further include: a second determining unit 806, wherein:
a second determining unit 806, configured to aggregate, when the aggregation unit 803 meets an aggregation condition for the interactive messages in the queue to be aggregated, the interactive messages in the queue to be aggregated into a first aggregated message, and before adding the first aggregated message to the aggregated queue, determine that the interactive messages in the queue to be aggregated meet the aggregation condition if it is determined that the target interactive message is a non-aggregatable message.
By implementing the message pushing device, the arrangement sequence of the interactive messages in the aggregated queue can be ensured to be ordered in time, so that the user can read the interactive messages conveniently.
As an optional implementation manner, the message pushing apparatus shown in fig. 9 may further include: a third determination unit 807 in which:
a third determining unit 807, configured to aggregate, when the aggregation unit 803 satisfies the aggregation condition for the interactive messages in the queue to be aggregated, the interactive messages in the queue to be aggregated into a first aggregated message, and before adding the first aggregated message to the aggregated queue, determine that the interactive messages in the queue to be aggregated satisfy the aggregation condition if it is determined that the target interactive message is an aggregated message and the message type of the target interactive message is different from the message type of the interactive message existing in the queue to be aggregated.
By implementing the message pushing device, the condition that one aggregated message is aggregated due to the interactive messages of various different message types can be avoided, so that the aggregated message is tidier and more ordered, and is convenient for a user to read and view.
As an optional implementation manner, the manner that the output unit 804 is configured to output the interaction messages stored in the aggregated queue may specifically be:
an output unit 804, configured to aggregate, when a read request for an interactive message is detected, multiple interactive messages into a second aggregated message if there are multiple interactive messages in a queue to be aggregated, and store the second aggregated message to the aggregated queue; and outputting the interactive messages stored in the aggregated queue.
By implementing the message pushing device, the client user can read the interactive information received by the server at the current time point when inputting the reading operation of the interactive information each time, and certain interactive information is prevented from being missed in the queue to be aggregated.
As an optional implementation manner, the manner that the output unit 804 is configured to output the interaction messages stored in the aggregated queue may specifically be:
an output unit 804, configured to, when a read request for an interactive message is detected, add the interactive message in the queue to be aggregated to the aggregated queue if the number of the interactive message in the queue to be aggregated is one; and outputting the interactive messages stored in the aggregated queue.
By implementing the message pushing device, the client user can read the interactive information received by the server at the current time point when inputting the reading operation of the interactive information each time, and certain interactive information is prevented from being missed in the queue to be aggregated.
As an optional implementation manner, the manner that the output unit 804 is configured to output the interaction messages stored in the aggregated queue may specifically be:
an output unit 804, configured to, when a read request for an interactive message is detected, classify the interactive messages in the aggregated queue according to users corresponding to the interactive messages to obtain a plurality of message sets, where each message set corresponds to one user; and outputting the plurality of message sets.
Implementing the message push device as described above,
as an optional implementation manner, the manner that the output unit 804 is configured to output the interaction messages stored in the aggregated queue may specifically be:
an output unit 804, configured to output the interactive messages in the aggregated queue when the interactive messages in the aggregated queue are greater than the second number.
By implementing the message pushing device, because the aggregation operation is not needed for all the interactive messages stored in the aggregated queue, the server can acquire a fixed number of interactive messages from the aggregated queue to output the interactive messages, for example, if the server wants to output 20 interactive messages, the server can directly acquire 20 interactive messages which do not need to be aggregated from the aggregated list, so that the situation that the server only outputs one interactive message when the client has a requirement for displaying the interactive messages is avoided, and the efficiency of displaying the interactive messages by the client is improved.
As an optional implementation manner, the interactive messages in the aggregated queue are sequentially arranged according to the adding time points of the interactive messages added to the aggregated queue.
By implementing the message pushing device, the sequencing operation of the server or the client on the interactive messages can be reduced on the premise of ensuring that the interactive messages displayed by the client are ordered in time, so that the display efficiency of the interactive messages is improved.
As an optional implementation, the first aggregated message includes one or more of the number of aggregated interactive messages, the type of aggregated interactive messages, and a reception time point of the aggregated interactive messages.
By implementing the message pushing device, the user can roughly know the detailed condition of the first aggregated message when reading the first aggregated message, and the reading efficiency of the user is improved.
Referring to fig. 10, fig. 10 is a schematic structural diagram of an electronic device disclosed in the embodiment of the present application. As shown in fig. 10, the electronic device may include:
a memory 1001 in which executable program code is stored;
a processor 1002 coupled to a memory 1001;
the processor 1002 calls the executable program code stored in the memory 1001 to execute the message pushing method disclosed in each of the above embodiments.
The embodiment of the application discloses a computer-readable storage medium, which stores a computer program, wherein the computer program enables a computer to execute the message pushing method disclosed by each embodiment.
The embodiment of the present application also discloses an application publishing platform, wherein the application publishing platform is used for publishing a computer program product, and when the computer program product runs on a computer, the computer is caused to execute part or all of the steps of the method in the above method embodiments.
It should be appreciated that reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present application. Thus, the appearances of the phrases "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. Those skilled in the art should also appreciate that the embodiments described in this specification are all alternative embodiments and that the acts and modules involved are not necessarily required for this application.
In various embodiments of the present application, it should be understood that the size of the serial number of each process described above does not mean that the execution sequence is necessarily sequential, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated units, if implemented as software functional units and sold or used as a stand-alone product, may be stored in a computer accessible memory. Based on such understanding, the technical solution of the present application, which is a part of or contributes to the prior art in essence, or all or part of the technical solution, may be embodied in the form of a software product, stored in a memory, including several requests for causing a computer device (which may be a personal computer, a server, a network device, or the like, and may specifically be a processor in the computer device) to execute part or all of the steps of the above-described method of the embodiments of the present application.
It will be understood by those skilled in the art that all or part of the steps in the methods of the embodiments described above may be implemented by hardware instructions of a program, and the program may be stored in a computer-readable storage medium, where the storage medium includes Read-Only Memory (ROM), Random Access Memory (RAM), Programmable Read-Only Memory (PROM), Erasable Programmable Read-Only Memory (EPROM), One-time Programmable Read-Only Memory (OTPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Compact Disc Read-Only Memory (CD-ROM), or other Memory, such as a magnetic disk, or a combination thereof, A tape memory, or any other medium readable by a computer that can be used to carry or store data.
The above detailed description is given to a message pushing method and apparatus, an electronic device, and a computer-readable storage medium disclosed in the embodiments of the present application, and a specific example is applied in the present application to explain the principles and embodiments of the present application, and the description of the above embodiments is only used to help understand the method and the core idea of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.

Claims (10)

1. A message pushing method, the method comprising:
receiving a target interactive message generated in a service scene;
if the target interactive message is a message which can not be aggregated, adding the target interactive message to an aggregated queue, and if the target interactive message is a polymerizable message, adding the target interactive message to a queue to be aggregated;
if the interactive messages in the queue to be aggregated meet the aggregation condition, aggregating the interactive messages in the queue to be aggregated into a first aggregated message, and adding the first aggregated message to the aggregated queue;
and outputting the interactive messages stored in the aggregated queue.
2. The method of claim 1, wherein after the adding the target interactive message to a queue to be aggregated if the target interactive message is an aggregated message, the method further comprises:
and if the number of the interactive messages in the queue to be aggregated is equal to the first number, determining that the interactive messages in the queue to be aggregated meet an aggregation condition.
3. The method according to claim 1, wherein before the aggregating the interactive messages in the queue to be aggregated into the first aggregated message if the interactive messages in the queue to be aggregated satisfy the aggregation condition, the method further comprises:
and if the target interactive message is a message which can not be aggregated, determining that the interactive message in the queue to be aggregated meets an aggregation condition.
4. The method according to claim 1, wherein before the aggregating the interactive messages in the queue to be aggregated into the first aggregated message if the interactive messages in the queue to be aggregated satisfy the aggregation condition, the method further comprises:
and if the target interactive message is a polymerizable message and the message type of the target interactive message is different from the message type of the interactive message existing in the queue to be aggregated, determining that the interactive message in the queue to be aggregated meets the aggregation condition.
5. The method according to any one of claims 1 to 4, wherein the outputting the interaction message stored in the aggregated queue comprises:
when a reading request aiming at the interactive messages is detected, if a plurality of interactive messages are stored in the queue to be aggregated, aggregating the interactive messages into a second aggregated message, and adding the second aggregated message to the aggregated queue;
and outputting the interactive messages stored in the aggregated queue.
6. The method according to any one of claims 1 to 4, wherein the outputting the interactive messages in the aggregated queue comprises:
when a reading request aiming at the interactive messages is detected, if the number of the interactive messages in the queue to be aggregated is one, adding the interactive messages in the queue to be aggregated to the aggregated queue;
and outputting the interactive messages stored in the aggregated queue.
7. The method according to any one of claims 1 to 4, wherein the outputting the interactive messages in the aggregated queue comprises:
when a reading request aiming at interactive messages is detected, classifying the interactive messages in the aggregated queue according to users corresponding to the interactive messages to obtain a plurality of message sets, wherein each message set corresponds to one user;
outputting the plurality of sets of messages.
8. A message push apparatus, comprising:
the receiving unit is used for receiving the target interactive message generated in the service scene;
an adding unit, configured to add the target interaction message to an aggregated queue when the target interaction message is a non-aggregatable message; when the target interactive message is a polymerizable message, adding the target interactive message to a queue to be polymerized;
the aggregation unit is used for aggregating the interactive messages in the queue to be aggregated into a first aggregated message when the interactive messages in the queue to be aggregated meet an aggregation condition, and adding the first aggregated message to the aggregated queue;
and the output unit is used for outputting the interactive messages stored in the aggregated queue.
9. An electronic device comprising a memory storing executable program code, and a processor coupled with the memory; wherein the processor calls the executable program code stored in the memory to execute the message pushing method of any one of claims 1 to 7.
10. A computer-readable storage medium storing a computer program, wherein the computer program causes a computer to execute the message pushing method according to any one of claims 1 to 7.
CN202011482684.5A 2020-12-16 2020-12-16 Message pushing method and device, electronic equipment and computer readable storage medium Pending CN112733010A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011482684.5A CN112733010A (en) 2020-12-16 2020-12-16 Message pushing method and device, electronic equipment and computer readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011482684.5A CN112733010A (en) 2020-12-16 2020-12-16 Message pushing method and device, electronic equipment and computer readable storage medium

Publications (1)

Publication Number Publication Date
CN112733010A true CN112733010A (en) 2021-04-30

Family

ID=75602777

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011482684.5A Pending CN112733010A (en) 2020-12-16 2020-12-16 Message pushing method and device, electronic equipment and computer readable storage medium

Country Status (1)

Country Link
CN (1) CN112733010A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113626504A (en) * 2021-07-30 2021-11-09 北京达佳互联信息技术有限公司 Message aggregation method and device
CN114979982A (en) * 2022-04-13 2022-08-30 中移互联网有限公司 Message issuing method and device, electronic equipment and storage medium

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102087615A (en) * 2009-12-03 2011-06-08 国际商业机器公司 Automated merger of logically associated messages in a message queue
CN107231294A (en) * 2017-05-24 2017-10-03 北京潘达互娱科技有限公司 Message treatment method and device
CN107528766A (en) * 2016-07-14 2017-12-29 腾讯科技（深圳）有限公司 Information-pushing method, apparatus and system
US20180013846A1 (en) * 2015-09-29 2018-01-11 Tencent Technology (Shenzhen) Company Limited Event information push method, event information push apparatus, and storage medium
CN110300032A (en) * 2019-07-31 2019-10-01 凌云天博光电科技股份有限公司 Message pushes storm suppressing method
CN111259246A (en) * 2020-01-17 2020-06-09 北京达佳互联信息技术有限公司 Information pushing method and device, electronic equipment and storage medium
CN111371672A (en) * 2020-02-14 2020-07-03 贝壳技术有限公司 Message pushing method and device

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102087615A (en) * 2009-12-03 2011-06-08 国际商业机器公司 Automated merger of logically associated messages in a message queue
US20180013846A1 (en) * 2015-09-29 2018-01-11 Tencent Technology (Shenzhen) Company Limited Event information push method, event information push apparatus, and storage medium
CN107528766A (en) * 2016-07-14 2017-12-29 腾讯科技（深圳）有限公司 Information-pushing method, apparatus and system
CN107231294A (en) * 2017-05-24 2017-10-03 北京潘达互娱科技有限公司 Message treatment method and device
CN110300032A (en) * 2019-07-31 2019-10-01 凌云天博光电科技股份有限公司 Message pushes storm suppressing method
CN111259246A (en) * 2020-01-17 2020-06-09 北京达佳互联信息技术有限公司 Information pushing method and device, electronic equipment and storage medium
CN111371672A (en) * 2020-02-14 2020-07-03 贝壳技术有限公司 Message pushing method and device

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113626504A (en) * 2021-07-30 2021-11-09 北京达佳互联信息技术有限公司 Message aggregation method and device
CN113626504B (en) * 2021-07-30 2024-02-09 北京达佳互联信息技术有限公司 Message aggregation method and device
CN114979982A (en) * 2022-04-13 2022-08-30 中移互联网有限公司 Message issuing method and device, electronic equipment and storage medium
CN114979982B (en) * 2022-04-13 2023-08-15 中移互联网有限公司 Message issuing method and device, electronic equipment and storage medium

Similar Documents

Publication Publication Date Title
US11727048B2 (en) Methods, systems, and media for presenting recommended content based on social cues
CN109241425B (en) Resource recommendation method, device, equipment and storage medium
US8601378B2 (en) Customized presentations associated with a social media application based on relationships
CN106708817B (en) Information searching method and device
US9092731B1 (en) Determining content item expansion prediction accuracy
CN111432226B (en) Live broadcast recommendation method and device, server, terminal and storage medium
CN112733010A (en) Message pushing method and device, electronic equipment and computer readable storage medium
US20220224983A1 (en) Video message generation method and apparatus, electronic device, and storage medium
CN109377401B (en) Data processing method, device, system, server and storage medium
CN107509119B (en) Monitoring alarm method and device
CN106294719B (en) Information display method and device
CN110704677B (en) Program recommendation method and device, readable storage medium and terminal equipment
CN112165390B (en) Information processing method and device, electronic equipment and computer readable storage medium
WO2023116219A1 (en) Cdn node distribution method and apparatus, electronic device, medium and program product
CN112269917A (en) Media resource display method, device, equipment, system and storage medium
CN108401005B (en) Expression recommendation method and device
RU2678088C1 (en) Programming of notifications based on following user activity
CN106487653B (en) Message processing method and server
US10049110B2 (en) Content ranking based on person-to-person sharing
CN108966034B (en) Virtual article display method, device and storage medium
US20130318074A1 (en) Method, system, client and server for acquiring and pushing content in internet community
CN113342626B (en) Content processing method, content processing device, electronic equipment and storage medium
US9159081B2 (en) Content item type determination and selection
CN111130983B (en) Method and equipment for sending information and generating result information
CN107832859B (en) Game reservation list generation method and device and server

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