CN108833584B - Message pushing method, terminal, server and computer storage medium - Google Patents
Message pushing method, terminal, server and computer storage medium Download PDFInfo
- Publication number
- CN108833584B CN108833584B CN201810717194.5A CN201810717194A CN108833584B CN 108833584 B CN108833584 B CN 108833584B CN 201810717194 A CN201810717194 A CN 201810717194A CN 108833584 B CN108833584 B CN 108833584B
- Authority
- CN
- China
- Prior art keywords
- message
- pushed
- pushing
- terminal
- scheduling table
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/55—Push-based network services
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
- Computer And Data Communications (AREA)
- Telephonic Communication Services (AREA)
Abstract
The invention discloses a message pushing method, a terminal, a server and a computer storage medium, wherein the method comprises the following steps: acquiring a scheduling table of messages to be pushed, wherein at least one message to be pushed and the effective time of each message are specified in the scheduling table; determining at least one target message currently within the validity time from the schedule; pushing the at least one target message. Therefore, the scheme of the invention can lead the terminal to select the target push message within the validity period for pushing according to the content in the schedule, and the schedule is obtained in advance by the terminal and stored locally, so that the normal pushing can be carried out even if the network of the terminal fails, and the problem that the pushed message cannot be received and displayed because the related application program is not started is avoided, thereby improving the success rate and arrival rate of the push message.
Description
Technical Field
The invention relates to the technical field of internet, in particular to a message pushing method, a terminal, a server and a computer storage medium.
Background
With the development of internet technology, a message Push (Push) function is an important function of intelligent terminal devices such as mobile phones. The message is generally pushed to a specific application program (APP) on the terminal equipment through the server, so that the automatic information transmission is realized for the user, the user is helped to efficiently discover valuable information, and the user experience degree of the APP by the user is improved. In addition, message pushing is also an important product operation means for APP manufacturers.
However, in the prior art, message pushing depends on a message channel between a server and an APP client on a terminal device, and if a background process of the client is not started or run, the pushed message cannot be received and displayed through the message channel, so that the arrival rate of the pushed message is affected.
Disclosure of Invention
In view of the above, the present invention is proposed to provide a message pushing method, a terminal and a computer storage medium that overcome or at least partially solve the above problems. According to an aspect of the present invention, there is provided a message pushing method applied to a terminal, the method including: acquiring a scheduling table of messages to be pushed, wherein at least one message to be pushed and the effective time of each message are specified in the scheduling table; determining at least one target message currently within the validity time from the schedule; pushing the at least one target message.
According to an aspect of the present invention, there is provided a message pushing method applied to a server, the method including: receiving a scheduling table acquisition request of a terminal, wherein the scheduling table is used for recording at least one specified message to be pushed, and the scheduling table acquisition request carries message IDs of all messages in the scheduling table acquired last time by the terminal; determining whether the currently stored scheduling list is updated or not according to the message IDs of all the messages in the scheduling list acquired last time; and if the updating is determined to exist, the currently stored scheduling list is sent to the terminal.
According to another aspect of the present invention, there is provided a terminal including: the processor, the memory and the communication interface complete mutual communication through the communication bus; the memory is used for storing at least one executable instruction, and the executable instruction causes the processor to execute the following operations: acquiring a scheduling table of messages to be pushed, wherein at least one message to be pushed and the effective time of each message are specified in the scheduling table; determining at least one target message currently within the validity time from the schedule; pushing the at least one target message.
According to another aspect of the present invention, there is provided a server comprising: the processor, the memory and the communication interface complete mutual communication through the communication bus; the memory is used for storing at least one executable instruction, and the executable instruction causes the processor to execute the following operations: receiving a scheduling table acquisition request of a terminal, wherein the scheduling table is used for recording at least one specified message to be pushed, and the scheduling table acquisition request carries message IDs of all messages in the scheduling table acquired last time by the terminal; determining whether the currently stored scheduling list is updated or not according to the message IDs of all the messages in the scheduling list acquired last time; and if the updating is determined to exist, the currently stored scheduling list is sent to the terminal.
According to yet another aspect of the present invention, there is provided a computer storage medium having at least one executable instruction stored therein, the executable instruction causing a processor to: acquiring a scheduling table of messages to be pushed, wherein at least one message to be pushed and the effective time of each message are specified in the scheduling table; determining at least one target message currently within the validity time from the schedule; pushing the at least one target message. According to yet another aspect of the present invention, there is provided a computer storage medium having at least one executable instruction stored therein, the executable instruction causing a processor to: receiving a scheduling table acquisition request of a terminal, wherein the scheduling table is used for recording at least one specified message to be pushed, and the scheduling table acquisition request carries message IDs of all messages in the scheduling table acquired last time by the terminal; determining whether the currently stored scheduling list is updated or not according to the message IDs of all the messages in the scheduling list acquired last time; and if the updating is determined to exist, the currently stored scheduling list is sent to the terminal.
According to the message pushing method, the terminal, the server and the computer storage medium, the terminal can select the target pushing message within the validity period according to the content in the schedule table to push, the message can be pushed in time, the problem that the pushed message cannot be received and displayed due to the fact that a related application program is not started is solved, and therefore the success rate and the arrival rate of the pushed message are improved.
The foregoing description is only an overview of the technical solutions of the present invention, and the embodiments of the present invention are described below in order to make the technical means of the present invention more clearly understood and to make the above and other objects, features, and advantages of the present invention more clearly understandable.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
fig. 1 shows a flowchart of a message pushing method according to an embodiment of the present invention;
fig. 2 is a flowchart illustrating a message pushing method according to a second embodiment of the present invention;
fig. 3 shows a flowchart of a message pushing method according to a third embodiment of the present invention;
fig. 4 shows a flowchart of a message pushing method according to a fourth embodiment of the present invention;
fig. 5 shows a flowchart of a message pushing method according to a fifth embodiment of the present invention;
fig. 6 shows a schematic structural diagram of a terminal according to a sixth embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
Example one
Fig. 1 shows a flowchart of a message pushing method provided in an embodiment of the present invention, which is applied to a terminal for message pushing. As shown in fig. 1, the method comprises the steps of:
step S101, obtaining a scheduling list of messages to be pushed, wherein at least one message to be pushed and the effective time of each message are recorded in the scheduling list.
In this step, the message to be pushed is a message to be pushed, and may be a message that needs to be pushed in the next week or several weeks, for example. By pushing the message to the terminal for display, the time that the user uses for searching on the network is reduced. Generally, information can be searched and filtered according to the interests of the user, and specific messages meeting the requirements of the user are pushed to the user regularly or in time, so that the user is helped to efficiently explore valuable information.
The scheduling table may be used to count data of each message, including a message name, a message content, a push mode, and an effective time of the message. The terminal can acquire the schedule when the client is started or within a period of time after the client is started so as to acquire the message to be pushed in time.
Specifically, the messages may be arranged in a table according to a certain order to form a "schedule table," for example, the schedule table may be generated according to message names or valid time of the messages. The valid time of the message refers to the valid time during which the message can be pushed. For example, when the valid time of a certain message is X year X month X day X time-Y year Y month Y day Y, the message can be pushed only in this time period. For example, a certain reading activity message related to a holiday can be pushed during a certain holiday, but after the holiday, that is, after the valid time, the pushing is not performed.
Step S102, at least one target message currently in the valid time is determined from the schedule.
In this step, the terminal checks the effective time of each push message in the schedule according to the current date and time, determines whether the current date and time fall within the effective time of a certain push message or certain push messages, and if so, takes the push message or push messages as at least one determined target message. And the rest messages which are not in the valid time are not pushed.
Step S103, pushing the at least one target message.
After the target message is selected, the target message can be pushed according to information such as the message name, the message content, the pushing mode and the like of the target message, and the target message can be one or more target messages and is finally pushed to the terminal for the user to watch.
According to the message pushing method applied to the terminal provided by the embodiment, the method comprises the following steps: acquiring a scheduling table of messages to be pushed, wherein at least one message to be pushed and the effective time of each message are specified in the scheduling table; determining at least one target message currently within the validity time from the schedule; pushing the at least one target message. By using the message pushing method of the embodiment, the terminal can acquire the schedule after the client is started, and select the target pushing message within the effective time to be pushed according to the content in the schedule, and because the schedule is acquired in advance by the terminal and stored locally, the normal pushing can be performed even when the network of the terminal fails. Meanwhile, the problem that the pushed message cannot be received and displayed due to the fact that the client or the related application program is not started can be solved, and therefore the success rate and the arrival rate of the pushed message are improved.
Example two
Fig. 2 shows a flowchart of a message pushing method provided in the second embodiment of the present invention, and on the basis of the above embodiment, optionally, the scheduling table further records a message ID of each message.
Where the message ID may be used to distinguish between messages in the scheduling table, each message may have a unique message ID. The message ID may be a character string, the specific ID may be designed to correspond to various types of messages, and the character at each position of the message ID may represent a specific meaning. Illustratively, the first message ID is 123456G, and the second message ID is 123456C, where the last digit may represent the type of the message, such as G represents a literature-related message, C represents a sports-type message, etc., and even the digits of the IDs may represent different types of messages, i.e., different messages may be distinguished by using the message ID, i.e., different messages may be distinguished according to the difference of the message ID, and the message type or other more specific contents may be further confirmed.
The embodiment is applied to a terminal, as shown in fig. 2, and on this basis, the method includes:
step S201, sending a scheduling list acquisition request to a server, and acquiring a scheduling list of the current message to be pushed from the server according to the feedback message of the server.
The scheduling table obtaining request carries message IDs of all messages in the scheduling table obtained last time, and the feedback message is used for indicating that the updating of the scheduling table to be pushed currently is determined according to the message IDs of all the messages in the scheduling table obtained last time.
Specifically, the sending of the schedule acquisition request may be sent after the client on the terminal is started, or may be sent within a period of time after the start, or may be sent at regular intervals after the start. The feedback message may specifically be whether the generated scheduling list has an updated or different message by comparing a message in the scheduling list that has been acquired last time by the server with a message in the scheduling list of the current message to be pushed in the server. For example, the feedback message may be a schedule presence update or a schedule absence update, or may be a message that specifies which message IDs are newly added.
Specifically, the server may compare the message IDs in all messages in the schedule acquired by the terminal last time with the schedule to be currently pushed, and if a new message to be pushed appears, it indicates that the schedule to be currently pushed is updated. If the schedule of the current message to be pushed has an update (feedback message), the terminal may obtain the updated entire schedule from the server, or obtain the schedule formed by the updated part of the message. If the schedule of the current information to be pushed does not have update (feedback information), that is, the schedule acquired last time by the terminal is the latest schedule, the terminal does not need to acquire the schedule again.
Step S202, at least one target message currently in the valid time is determined from the schedule.
Step S203, pushing the at least one target message.
The implementation principle and the specific execution process of step S202 and step S203 may refer to the description of step S102 and step S103 in the embodiment corresponding to fig. 1, and are not described herein again.
In an optional manner, the method further comprises: and reporting the message ID of the pushed message to a server.
After the terminal reports the ID of the pushed message to the server, the server can count the ID so that the server can screen the pushed message according to the pushed message reported by the terminal when receiving the message to be pushed through other pushing channels, repeated pushing is avoided, and pushing efficiency of the message is improved.
According to the message pushing method applied to the terminal provided by the embodiment, a scheduling table acquisition request is sent to a server, and a scheduling table of a current message to be pushed is acquired from the server according to a feedback message of the server; determining at least one target message currently within the validity time from the schedule; pushing the at least one target message. By using the message pushing method of the embodiment, the scheduling list can be in the latest state, and the updated message can be pushed in time. In addition, because the schedule is obtained in advance by the terminal and stored locally, even if the network of the terminal fails, normal pushing can still be performed, and compared with a method in the prior art that normal pushing can be performed only by a network, the scheme of the embodiment can further ensure the timeliness of message pushing. Meanwhile, the repeated pushing of the server can be avoided by reporting the pushed message, so that the message pushing efficiency and the message pushing success rate are improved.
EXAMPLE III
Fig. 3 shows a flowchart of a message pushing method provided by a third embodiment of the present invention, based on the above embodiments, optionally, a message ID of a pushed message is recorded, where after the message ID of the pushed message is recorded, it can be quickly identified through the message ID which messages are already pushed and which messages are not pushed, so that the problem of repeatedly pushing or forgetting to push messages can be reduced, and the message pushing efficiency can be improved.
On the basis, as shown in fig. 3, the method comprises the following steps:
step 301, obtaining a scheduling table of messages to be pushed, where at least one message to be pushed and an effective time of each message are recorded in the scheduling table.
Step 302, determining at least one non-pushed message from the scheduling table according to the message ID of the pushed message.
Since the message ID of the pushed message is recorded and the pushed message does not need to be pushed repeatedly, it is possible to determine which messages are not pushed yet by comparing the message ID of the pushed message with the message ID in the schedule table. In particular, at least one non-pushed message may also be determined from the non-marked messages by marking already pushed messages in the scheduling table.
Step 303, determining at least one target message currently within the valid time from the at least one non-pushed message according to the valid time.
Further, by identifying the effective time of the at least one non-pushed message, at least one message is selected from the non-pushed messages within the effective time to be used as a target message for pushing.
Step 304, pushing the at least one target message.
The implementation principle and the specific execution process of step S301 and step S304 may refer to the description of step S101 and step S103 in the embodiment corresponding to fig. 1, and are not described herein again.
According to the message pushing method applied to the terminal provided by the embodiment, the message ID of the pushed message is recorded, and at least one non-pushed message is determined from the scheduling table according to the message ID of the pushed message, so as to perform pushing. Because the schedule is obtained in advance by the terminal and stored locally, even if the network of the terminal fails, normal pushing can still be performed, and compared with a method in the prior art that normal pushing can be performed only by a network, the scheme of the embodiment can further ensure the timeliness of message pushing. Meanwhile, through the comparison of the message IDs, the pushed message can be prevented from being pushed again, so that the problem that the message is repeatedly pushed or forgotten to be pushed can be avoided and reduced, the resource occupation of the terminal is reduced, and the message pushing efficiency is improved.
Example four
Fig. 4 shows a flowchart of a message pushing method provided by a fourth embodiment of the present invention, on the basis of the foregoing embodiment, optionally, a message ID of a pushed message is recorded, and on this basis, as shown in fig. 4, the method includes the following steps:
step 401, obtaining a scheduling table of messages to be pushed, where at least one message to be pushed and an effective time of each message are recorded in the scheduling table.
Step 402, determining at least one target message currently in the valid time from the schedule; pushing the at least one target message.
Step 403, if a push message from the accessed push channel is received, determining that a message which is not pushed yet is pushed from the push messages of the push channel according to the recorded message ID of the pushed message.
The accessed push channel comprises a push channel of an application manufacturer, at least one third-party message push channel and at least one terminal equipment manufacturer push channel.
Typically, push messages can reach the terminal through a push channel. Illustratively, the push channel includes: pushing channels of application manufacturers; a terminal equipment manufacturer push channel, for example, a system push channel of some mobile phone manufacturers, especially a mobile phone system with high coverage rate; the third-party message pushing channel can specially provide an application program of the mobile message pushing service. In addition, the third-party message pushing channel can also be accessed to other different application programs, so that the message pushing coverage rate can be further increased. The arrival rate of each message pushing channel is different, and the arrival rate of the pushed messages can be integrally improved by accessing more different message pushing channels, so that the pushing efficiency is improved.
Because the push messages received through different message channels may be repeated with the to-be-pushed messages in the scheduling table, in this embodiment, the push messages received through the message channels are compared with the recorded message IDs of the pushed messages, and if the messages that have been pushed in the scheduling table are received again through a certain message push channel, the terminal does not repeat pushing.
Therefore, the arrival rate of the push message is further improved on the whole through the access of the scheduling list and various other message push channels, and meanwhile, the repeated push can be avoided.
According to the message pushing method applied to the terminal provided by the embodiment, if a push message from an accessed push channel is received, it is determined from the push messages of the push channel that a message which is not yet pushed is pushed according to the recorded message ID of the pushed message. And comparing the message IDs of all messages in the scheduling list acquired last time by the terminal in the scheduling list acquisition request with the message IDs in the scheduling list to be pushed currently, determining the messages which are not pushed yet, and pushing. According to the scheme of the embodiment, the message which is not pushed in the schedule list can be selected to be pushed firstly, so that repeated pushing of the message is avoided, and the message pushing efficiency is further improved. Meanwhile, the scheduling list is obtained in advance by the terminal and stored locally, so that normal pushing can be performed even when the network of the terminal fails. In addition, the message is pushed through various pushing channels, and the coverage rate and the arrival rate of message pushing are improved.
EXAMPLE five
Fig. 5 shows a flowchart of a message pushing method provided by the fifth embodiment of the present invention, which is applied to a server for pushing a message to a terminal. As shown in fig. 5, the method comprises the steps of:
step S501, receiving a scheduling table acquisition request of a terminal, wherein the scheduling table is used for recording at least one specified message to be pushed, and the scheduling table acquisition request carries message IDs of all messages in the scheduling table acquired last time by the terminal.
Step S502, according to the message IDs of all the messages in the schedule table acquired last time, determining whether the schedule table stored currently is updated.
After receiving the scheduling table acquisition request, the server may compare the message IDs in all messages in the scheduling table acquired last time by the terminal with the scheduling table to be pushed currently, and further determine whether there is an update. If a new message to be pushed appears, it indicates that the current scheduling list to be pushed is updated, and if no new message to be pushed appears, it indicates that the current scheduling list to be pushed does not have updating, that is, the scheduling list acquired last time by the terminal is the latest.
Step S503, if the updating is determined to exist, the currently stored scheduling list is sent to the terminal.
If the schedule of the current message to be pushed is updated, the server can send the updated whole schedule to the terminal. Of course, the schedule table formed by the message of the update part may also be transmitted to the terminal. If the schedule of the current information to be pushed does not have updating, that is, the schedule acquired last time by the terminal is the latest schedule, the server does not need to resend the schedule.
In an optional manner, the method further comprises:
receiving a message ID of a pushed message sent by a terminal;
when pushing is carried out through an accessed pushing channel, determining that the message which is not pushed yet is pushed to the terminal from the pushing message of the pushing channel according to the message ID of the received pushed message; the accessed push channel comprises a push channel of an application manufacturer, at least one third-party message push channel and at least one terminal equipment manufacturer push channel.
According to the message pushing method applied to the server provided by the embodiment, the scheduling list acquisition request of the terminal is received, the message IDs of all messages in the scheduling list acquired last time by the terminal in the request are compared with the message IDs in the scheduling list to be pushed currently, and if the updating is determined, the currently stored scheduling list is sent to the terminal. The scheme of the embodiment can enable the server to efficiently send the scheduling list, avoid repeated sending, reduce resource occupation of the terminal and further improve the message pushing efficiency. Meanwhile, the scheduling list is obtained in advance by the terminal and stored locally, so that the terminal can still carry out normal pushing even when the network of the terminal fails. In addition, the message is pushed through various pushing channels, and the coverage rate and the arrival rate of message pushing are improved.
EXAMPLE six
Fig. 6 is a schematic structural diagram of a terminal according to a sixth embodiment of the present invention, where the specific embodiment of the present invention does not limit the specific implementation of the terminal.
As shown in fig. 6, the terminal may include: a processor (processor)602, a communication interface 604, a memory 606, and a communication bus 608.
Wherein:
the processor 602, communication interface 604, and memory 606 communicate with one another via a communication bus 608.
A communication interface 604 for communicating with network elements of other devices, such as clients or other servers.
The processor 602 is configured to execute the program 610, and may specifically perform relevant steps in the above-described electronic book recommendation method embodiment.
In particular, program 610 may include program code comprising computer operating instructions.
The processor 602 may be a central processing unit CPU or an application specific Integrated circuit asic or one or more Integrated circuits configured to implement embodiments of the present invention. The terminal comprises one or more processors, which can be the same type of processor, such as one or more CPUs; or may be different types of processors such as one or more CPUs and one or more ASICs.
And a memory 606 for storing a program 610. Memory 606 may comprise high-speed RAM memory, and may also include non-volatile memory (non-volatile memory), such as at least one disk memory.
The program 610 may specifically be configured to cause the processor 602 to perform the following operations:
acquiring a scheduling table of messages to be pushed, wherein at least one message to be pushed and the effective time of each message are specified in the scheduling table;
determining at least one target message currently within the validity time from the schedule;
pushing the at least one target message.
In an alternative mode, the scheduling table further records a message ID of each message.
In an optional manner, the program 610 may be specifically further configured to cause the processor 602 to perform the following operations:
sending a scheduling table acquisition request to a server, wherein the scheduling table acquisition request carries message IDs of all messages in a scheduling table acquired last time;
acquiring a scheduling list of the current messages to be pushed from the server according to the feedback messages of the server;
the feedback message is used for indicating that the current scheduling list to be pushed is updated according to the message IDs of all the messages in the last acquired scheduling list.
In an optional manner, the program 610 may be specifically further configured to cause the processor 602 to perform the following operations:
the message ID of the pushed message is recorded.
In an optional manner, the program 610 may be specifically further configured to cause the processor 602 to perform the following operations:
determining at least one non-pushed message from the scheduling table according to the message ID of the pushed message;
and determining at least one target message currently in the effective time from the at least one non-pushed message according to the effective time.
In an alternative manner, the program 610 may specifically be further configured to cause the processor 602 to perform the following operations:
if a push message from an accessed push channel is received, determining a message which is not pushed from the push messages of the push channel to be pushed according to the recorded message ID of the pushed message;
the accessed push channel comprises a push channel of an application manufacturer, at least one third-party message push channel and at least one terminal equipment manufacturer push channel.
In an optional manner, the program 610 may be specifically further configured to cause the processor 602 to perform the following operations:
and reporting the message ID of the pushed message to a server.
EXAMPLE seven
The seventh embodiment of the present invention further provides a server, a hardware structure of which can be shown in fig. 6, and the specific embodiment of the present invention does not limit the specific implementation of the server.
The server may include: a processor (processor), a communications interface (communications interface), a memory (memory), and a communications bus.
Wherein:
the processor, the communication interface, and the memory communicate with each other via a communication bus.
A communication interface for communicating with network elements of other devices, such as clients or other servers.
The processor is configured to execute the program, and may specifically execute the relevant steps in the above electronic book recommendation method embodiment.
In particular, the program may include program code comprising computer operating instructions.
The processor may be a central processing unit CPU or an application specific integrated circuit asic or one or more integrated circuits configured to implement embodiments of the present invention. The terminal comprises one or more processors, which can be the same type of processor, such as one or more CPUs; or may be different types of processors such as one or more CPUs and one or more ASICs.
And the memory is used for storing programs. The memory may comprise high-speed RAM memory, and may also include non-volatile memory (non-volatile memory), such as at least one disk memory.
The program may specifically be adapted to cause a processor to perform the following operations:
receiving a scheduling table acquisition request of a terminal, wherein the scheduling table is used for recording at least one specified message to be pushed, and the scheduling table acquisition request carries message IDs of all messages in the scheduling table acquired last time by the terminal;
determining whether the currently stored scheduling list is updated or not according to the message IDs of all the messages in the scheduling list acquired last time;
and if the updating is determined to exist, the currently stored scheduling list is sent to the terminal.
In an alternative manner, the program may be further specifically configured to cause the processor to perform the following operations:
receiving a message ID of a pushed message sent by a terminal;
when pushing is carried out through an accessed pushing channel, determining that the message which is not pushed yet is pushed to the terminal from the pushing message of the pushing channel according to the message ID of the received pushed message;
the accessed push channel comprises a push channel of an application manufacturer, at least one third-party message push channel and at least one terminal equipment manufacturer push channel.
The hardware structure and functions of the server can be explained with reference to the content of the sixth embodiment, and are not described herein again.
Example eight
An eighth embodiment of the present invention further provides a non-volatile computer storage medium, where the computer storage medium stores at least one executable instruction, and the computer executable instruction may execute the message pushing method applied to the terminal in any of the above method embodiments.
The executable instructions may be specifically configured to cause the processor to:
acquiring a scheduling table of messages to be pushed, wherein at least one message to be pushed and the effective time of each message are specified in the scheduling table;
determining at least one target message currently within the validity time from the schedule;
pushing the at least one target message.
In an alternative mode, the scheduling table further records a message ID of each message.
In an alternative, the executable instructions further cause the processor to:
sending a scheduling table acquisition request to a server, wherein the scheduling table acquisition request carries message IDs of all messages in a scheduling table acquired last time;
acquiring a scheduling list of the current messages to be pushed from the server according to the feedback messages of the server;
the feedback message is used for indicating that the current scheduling list to be pushed is updated according to the message IDs of all the messages in the last acquired scheduling list.
In an alternative, the executable instructions further cause the processor to:
the message ID of the pushed message is recorded.
In an alternative, the executable instructions further cause the processor to:
determining at least one non-pushed message from the scheduling table according to the message ID of the pushed message;
and determining at least one target message currently in the effective time from the at least one non-pushed message according to the effective time.
In an alternative, the executable instructions further cause the processor to:
if a push message from an accessed push channel is received, determining a message which is not pushed from the push messages of the push channel to be pushed according to the recorded message ID of the pushed message;
the accessed push channel comprises a push channel of an application manufacturer, at least one third-party message push channel and at least one terminal equipment manufacturer push channel.
In an alternative, the executable instructions further cause the processor to:
and reporting the message ID of the pushed message to a server.
Example nine
The ninth embodiment of the present invention further provides a non-volatile computer storage medium, where the computer storage medium stores at least one executable instruction, and the computer executable instruction may execute the message pushing method applied to the server in any method embodiment described above.
The executable instructions may be specifically configured to cause the processor to:
receiving a scheduling table acquisition request of a terminal, wherein the scheduling table is used for recording at least one specified message to be pushed, and the scheduling table acquisition request carries message IDs of all messages in the scheduling table acquired last time by the terminal;
determining whether the currently stored scheduling list is updated or not according to the message IDs of all the messages in the scheduling list acquired last time;
and if the updating is determined to exist, the currently stored scheduling list is sent to the terminal.
In an alternative, the executable instructions further cause the processor to:
receiving a message ID of a pushed message sent by a terminal;
when pushing is carried out through an accessed pushing channel, determining that the message which is not pushed yet is pushed to the terminal from the pushing message of the pushing channel according to the message ID of the received pushed message;
the accessed push channel comprises a push channel of an application manufacturer, at least one third-party message push channel and at least one terminal equipment manufacturer push channel.
The algorithms and displays presented herein are not inherently related to any particular computer, virtual machine, or other apparatus. Various general purpose systems may also be used with the teachings herein. The required structure for constructing such a system will be apparent from the description above. Moreover, the present invention is not directed to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any descriptions of specific languages are provided above to disclose the best mode of the invention. In the description provided herein, numerous specific details are set forth. It is understood, however, that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the invention, various features of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: that the invention as claimed requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.
Those skilled in the art will appreciate that the modules in the device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except combinations where at least some of such features and/or processes or elements are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Furthermore, those skilled in the art will appreciate that while some embodiments described herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the following claims, any of the claimed embodiments may be used in any combination.
It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. The usage of the words first, second and third, etcetera do not indicate any ordering. These words may be interpreted as names.
Claims (12)
1. A message pushing method is applied to a terminal, and comprises the following steps:
acquiring a scheduling table of messages to be pushed, wherein the scheduling table is recorded with a message name, a message content, a pushing mode and effective time of each message, wherein the message name, the message content and the pushing mode specify at least one message to be pushed;
determining at least one target message currently within the validity time from the schedule;
pushing the at least one target message;
recording the message ID of the pushed message;
if a push message from an accessed push channel is received, determining a message which is not pushed from the push messages of the push channel to be pushed according to the recorded message ID of the pushed message;
the accessed push channel comprises a push channel of an application manufacturer, at least one third-party message push channel and at least one terminal equipment manufacturer push channel;
wherein determining at least one target message currently within the validity time from the scheduling table comprises:
determining at least one non-pushed message from the scheduling table according to the message ID of the pushed message;
determining at least one target message currently within the effective time from the at least one non-pushed message according to the effective time;
wherein the method further comprises: and reporting the message ID of the pushed message to a server, so that the server performs screening according to the message ID of the pushed message reported by the terminal when receiving the message to be pushed through other pushing channels, thereby avoiding repeated pushing.
2. The method of claim 1, wherein the scheduling table further records a message ID of each message.
3. The method of claim 2, wherein obtaining a schedule of messages to be pushed comprises:
sending a scheduling table acquisition request to a server, wherein the scheduling table acquisition request carries message IDs of all messages in a scheduling table acquired last time;
acquiring a scheduling list of the current messages to be pushed from the server according to the feedback messages of the server;
the feedback message is used for indicating that the current scheduling list to be pushed is updated according to the message IDs of all the messages in the last acquired scheduling list.
4. A message pushing method is applied to a server and comprises the following steps:
receiving a scheduling table acquisition request of a terminal, wherein the scheduling table is used for recording the message name, the message content, the pushing mode of at least one appointed message to be pushed and the effective time of each message, and the scheduling table acquisition request carries the message ID of all the messages in the scheduling table acquired last time by the terminal;
determining whether the currently stored scheduling list is updated or not according to the message IDs of all the messages in the scheduling list acquired last time;
if the updating is determined to exist, the currently stored scheduling table is sent to the terminal, so that the terminal determines at least one non-pushed message from the scheduling table according to the message ID of the pushed message; determining at least one target message currently in the effective time from the at least one non-pushed message to push according to the effective time;
receiving a message ID of a pushed message sent by a terminal;
when pushing is carried out through an accessed pushing channel, determining that the message which is not pushed yet is pushed to the terminal from the pushing message of the pushing channel according to the message ID of the received pushed message;
the accessed push channel comprises a push channel of an application manufacturer, at least one third-party message push channel and at least one terminal equipment manufacturer push channel.
5. A terminal, comprising: the system comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus;
the memory is configured to store at least one executable instruction that causes the processor to: acquiring a scheduling table of messages to be pushed, wherein the scheduling table is recorded with a message name, a message content, a pushing mode and effective time of each message, wherein the message name, the message content and the pushing mode specify at least one message to be pushed;
determining at least one target message currently within the validity time from the schedule;
pushing the at least one target message;
recording the message ID of the pushed message;
if a push message from an accessed push channel is received, determining a message which is not pushed from the push messages of the push channel to be pushed according to the recorded message ID of the pushed message;
the accessed push channel comprises a push channel of an application manufacturer, at least one third-party message push channel and at least one terminal equipment manufacturer push channel;
wherein determining at least one target message currently within the validity time from the scheduling table comprises:
determining at least one non-pushed message from the scheduling table according to the message ID of the pushed message;
determining at least one target message currently within the effective time from the at least one non-pushed message according to the effective time;
wherein the processor is further configured to perform: and reporting the message ID of the pushed message to a server, so that the server performs screening according to the message ID of the pushed message reported by the terminal when receiving the message to be pushed through other pushing channels, thereby avoiding repeated pushing.
6. The terminal of claim 5, wherein the scheduling table further records a message ID of each message.
7. The terminal of claim 6, the executable instructions further causing the processor to:
sending a scheduling table acquisition request to a server, wherein the scheduling table acquisition request carries message IDs of all messages in a scheduling table acquired last time;
acquiring a scheduling list of the current messages to be pushed from the server according to the feedback messages of the server;
the feedback message is used for indicating that the current scheduling list to be pushed is updated according to the message IDs of all the messages in the last acquired scheduling list.
8. A server, comprising: the system comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus;
the memory is configured to store at least one executable instruction that causes the processor to:
receiving a scheduling table acquisition request of a terminal, wherein the scheduling table is used for recording the message name, the message content, the pushing mode of at least one appointed message to be pushed and the effective time of each message, and the scheduling table acquisition request carries the message ID of all the messages in the scheduling table acquired last time by the terminal;
determining whether the currently stored scheduling list is updated or not according to the message IDs of all the messages in the scheduling list acquired last time;
if the updating is determined to exist, the currently stored scheduling table is sent to the terminal, so that the terminal determines at least one non-pushed message from the scheduling table according to the message ID of the pushed message; determining at least one target message currently in the effective time from the at least one non-pushed message to push according to the effective time;
receiving a message ID of a pushed message sent by a terminal;
when pushing is carried out through an accessed pushing channel, determining that the message which is not pushed yet is pushed to the terminal from the pushing message of the pushing channel according to the message ID of the received pushed message;
the accessed push channel comprises a push channel of an application manufacturer, at least one third-party message push channel and at least one terminal equipment manufacturer push channel.
9. A computer storage medium having at least one executable instruction stored therein, the executable instruction causing a processor to:
acquiring a scheduling table of messages to be pushed, wherein the scheduling table is recorded with a message name, a message content, a pushing mode and effective time of each message, wherein the message name, the message content and the pushing mode specify at least one message to be pushed;
determining at least one target message currently within the validity time from the schedule;
pushing the at least one target message;
recording the message ID of the pushed message;
if a push message from an accessed push channel is received, determining a message which is not pushed from the push messages of the push channel to be pushed according to the recorded message ID of the pushed message;
the accessed push channel comprises a push channel of an application manufacturer, at least one third-party message push channel and at least one terminal equipment manufacturer push channel;
wherein determining at least one target message currently within the validity time from the scheduling table comprises:
determining at least one non-pushed message from the scheduling table according to the message ID of the pushed message;
determining at least one target message currently within the effective time from the at least one non-pushed message according to the effective time;
wherein the processor is further configured to perform: and reporting the message ID of the pushed message to a server, so that the server performs screening according to the message ID of the pushed message reported by the terminal when receiving the message to be pushed through other pushing channels, thereby avoiding repeated pushing.
10. The computer storage medium of claim 9, wherein the schedule table further records a message ID for each message.
11. The computer storage medium of claim 10, the executable instructions further causing the processor to:
sending a scheduling table acquisition request to a server, wherein the scheduling table acquisition request carries message IDs of all messages in a scheduling table acquired last time;
acquiring a scheduling list of the current messages to be pushed from the server according to the feedback messages of the server;
the feedback message is used for indicating that the current scheduling list to be pushed is updated according to the message IDs of all the messages in the last acquired scheduling list.
12. A computer storage medium having at least one executable instruction stored therein, the executable instruction causing a processor to:
receiving a scheduling table acquisition request of a terminal, wherein the scheduling table is used for recording the message name, the message content, the pushing mode of at least one appointed message to be pushed and the effective time of each message, and the scheduling table acquisition request carries the message ID of all the messages in the scheduling table acquired last time by the terminal;
determining whether the currently stored scheduling list is updated or not according to the message IDs of all the messages in the scheduling list acquired last time;
if the updating is determined to exist, the currently stored scheduling table is sent to the terminal, so that the terminal determines at least one non-pushed message from the scheduling table according to the message ID of the pushed message; determining at least one target message currently in the effective time from the at least one non-pushed message to push according to the effective time;
receiving a message ID of a pushed message sent by a terminal;
when pushing is carried out through an accessed pushing channel, determining that the message which is not pushed yet is pushed to the terminal from the pushing message of the pushing channel according to the message ID of the received pushed message;
the accessed push channel comprises a push channel of an application manufacturer, at least one third-party message push channel and at least one terminal equipment manufacturer push channel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810717194.5A CN108833584B (en) | 2018-06-29 | 2018-06-29 | Message pushing method, terminal, server and computer storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810717194.5A CN108833584B (en) | 2018-06-29 | 2018-06-29 | Message pushing method, terminal, server and computer storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108833584A CN108833584A (en) | 2018-11-16 |
| CN108833584B true CN108833584B (en) | 2020-07-24 |
Family
ID=64133765
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810717194.5A Active CN108833584B (en) | 2018-06-29 | 2018-06-29 | Message pushing method, terminal, server and computer storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108833584B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109525672A (en) * | 2018-11-27 | 2019-03-26 | 重庆长安汽车股份有限公司 | Vehicle-mounted content push system, method and computer readable storage medium |
| CN110008400A (en) * | 2019-02-14 | 2019-07-12 | 平安科技（深圳）有限公司 | Red-letter day notification method, system, device and storage medium based on calendar |
| CN110061902B (en) * | 2019-03-12 | 2022-07-15 | 平安科技（深圳）有限公司 | Method, device and storage medium for sending messages regularly |
| CN111049755B (en) * | 2019-12-23 | 2022-01-11 | 京东科技控股股份有限公司 | Data processing method and device, electronic equipment and computer readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101051912A (en) * | 2006-04-05 | 2007-10-10 | 迈世亚（北京）科技有限公司 | Data automatic updating method |
| CN102004997A (en) * | 2010-11-25 | 2011-04-06 | 深圳市同洲电子股份有限公司 | Advertisement broadcasting method and related system |
| CN105321063A (en) * | 2015-10-10 | 2016-02-10 | 北京齐尔布莱特科技有限公司 | Scheduling data generation method and client, and calculation device |
| CN107087030A (en) * | 2017-04-26 | 2017-08-22 | 深圳市茁壮网络股份有限公司 | Information interacting method and set top box, server |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104967683A (en) * | 2015-06-18 | 2015-10-07 | 广州华多网络科技有限公司 | Message pushing method, terminal and server |
| CN105915612A (en) * | 2016-04-19 | 2016-08-31 | 北京金山安全软件有限公司 | Push message acquisition method, message push method and device |
-
2018
- 2018-06-29 CN CN201810717194.5A patent/CN108833584B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101051912A (en) * | 2006-04-05 | 2007-10-10 | 迈世亚（北京）科技有限公司 | Data automatic updating method |
| CN102004997A (en) * | 2010-11-25 | 2011-04-06 | 深圳市同洲电子股份有限公司 | Advertisement broadcasting method and related system |
| CN105321063A (en) * | 2015-10-10 | 2016-02-10 | 北京齐尔布莱特科技有限公司 | Scheduling data generation method and client, and calculation device |
| CN107087030A (en) * | 2017-04-26 | 2017-08-22 | 深圳市茁壮网络股份有限公司 | Information interacting method and set top box, server |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108833584A (en) | 2018-11-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108833584B (en) | Message pushing method, terminal, server and computer storage medium | |
| CN108055343B (en) | Data synchronization method and device for computer room | |
| AU2014348821A1 (en) | Location-based software updates | |
| CN111143723A (en) | Page jump method and device, electronic equipment and storage medium | |
| US10242102B2 (en) | Network crawling prioritization | |
| CN108023905B (en) | Internet of things application system and method | |
| CN113778652A (en) | Task scheduling method and device, electronic equipment and storage medium | |
| CN109271778A (en) | Using installation source differentiating method, electronic equipment and computer storage medium | |
| CN111309693A (en) | Data synchronization method, device and system, electronic equipment and storage medium | |
| CN108733758B (en) | Hotel static data pushing method and device, electronic equipment and readable storage medium | |
| CN113468143A (en) | Data migration method, system, computing device and storage medium | |
| CN112217849B (en) | Task scheduling method, system and computer equipment in SD-WAN system | |
| CN110955460A (en) | Service process starting method and device, electronic equipment and storage medium | |
| CN113806383B (en) | Real-time schedule synchronization method and device | |
| CN113791984B (en) | Automatic interface testing method and device | |
| CN109656936A (en) | Method of data synchronization, device, computer equipment and storage medium | |
| CN114036132A (en) | Object information processing method and device, storage medium and electronic equipment | |
| CN111831394B (en) | Method and device for deploying stateful pod by kubernetes | |
| CN106776756A (en) | The method and apparatus of server end, client process weather resource data | |
| CN113485742A (en) | Host application version registration method and device | |
| CN109254855B (en) | Registration method and device of parameter transmission protocol and electronic equipment | |
| US8296055B2 (en) | Method and system for positional communication | |
| CN113779048A (en) | Data processing method and device | |
| CN106934555B (en) | Workflow organization method and device, computer equipment and storage medium | |
| CN117609257A (en) | Database data synchronous updating method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |