CN110971643B - Message pushing method and device, storage medium and processor - Google Patents
Message pushing method and device, storage medium and processorDownload PDFInfo
- Publication number
- CN110971643B CN110971643BCN201811163372.0ACN201811163372ACN110971643BCN 110971643 BCN110971643 BCN 110971643BCN 201811163372 ACN201811163372 ACN 201811163372ACN 110971643 BCN110971643 BCN 110971643B
- Authority
- CN
- China
- Prior art keywords
- message
- target
- time
- polling
- instance
- 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
- 238000000034methodMethods0.000titleclaimsabstractdescription63
- 238000004590computer programMethods0.000description10
- 238000010586diagramMethods0.000description10
- 230000008569processEffects0.000description6
- 230000006870functionEffects0.000description5
- 238000005516engineering processMethods0.000description4
- 230000000694effectsEffects0.000description3
- 230000003287optical effectEffects0.000description3
- 230000004048modificationEffects0.000description2
- 238000012986modificationMethods0.000description2
- 230000006399behaviorEffects0.000description1
- 230000005540biological transmissionEffects0.000description1
- 230000008859changeEffects0.000description1
- 230000006872improvementEffects0.000description1
- 238000004519manufacturing processMethods0.000description1
- 230000003068static effectEffects0.000description1
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
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
- H04L51/21—Monitoring or handling of messages
- H04L51/214—Monitoring or handling of messages using selective forwarding
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
Abstract
Description
Technical Field
The present application relates to the field of message pushing technologies, and in particular, to a message pushing method and apparatus, a storage medium, and a processor.
Background
In the related art, a message pushing server queries a message database in a polling manner, where a message in the database has an identification field to mark whether the message has been pushed by the server, that is, whether a user has seen the message. The identification field is marked as false when the message needs to be pushed and as true when the message has been pushed. However, when the message push server deploys multiple instances, a problem of missing push of messages easily occurs.
For example, a message push server deploys three instances a, B, and C, each instance has multiple user accesses, when the times for querying the messages stored in the database by the three instances a, B, and C are inconsistent, it may happen that the instance a queries the message to be pushed and pushes the message to be pushed to the user connected to the instance a, and changes the identification field of the message to be pushed to True, when the instance B and the instance C query the message in the database, the message that has been pushed by the instance a and whose identification field is changed to True is not queried, the instance B and the instance C may miss the message that has been pushed by the instance a, thereby causing the situation that the messages seen by the users connected to the three instances a, B, and C are inconsistent, and some users cannot receive the message that should be received.
Aiming at the problem that in the related art, the message is pushed by a server instance, namely the field of the message is modified, and whether the message is pushed or not is identified by the field of the message, and for a server deployed by multiple instances, message pushing omission easily occurs, an effective solution is not provided at present.
Disclosure of Invention
The main purpose of the present application is to provide a message pushing method and apparatus, a storage medium, and a processor, so as to solve the problem in the related art that a server instance pushes a message, i.e., modifies a field of the message, and by identifying whether the message is pushed or not by the field of the message, for a server deployed in multiple instances, a message pushing omission easily occurs.
In order to achieve the above object, according to an aspect of the present application, a message push method is provided. The method comprises the following steps: polling messages in a message library respectively by adopting a plurality of instances deployed by a server to acquire message start time of a target message and message end time of the target message; when the current polling time of the target instance is in a closed interval formed by the message starting time of the target message and the message ending time of the target message, judging whether the target message is polled by the target instance; and under the condition that the target message is not polled by the target instance, determining that the target message is a message to be pushed of the target instance.
Further, determining whether the target message was polled by the target instance comprises: judging whether the starting time of the target message is later than the last polling ending time of the target instance or not; and in the case that the starting time of the target message is later than the last polling ending time of the target instance, determining that the target message is not polled by the target instance.
Further, before the plurality of instances of the server deployment individually poll the messages within the message library, the method further comprises: setting a message start time and a message end time for a plurality of messages; and storing the message with the message starting time and the message ending time into a message library.
Further, before the plurality of instances of the server deployment individually poll the messages within the message library, the method further comprises: and respectively setting a polling interval time for a plurality of instances, wherein the polling interval time is an interval time between the end time of one polling and the start time of the next polling, the maximum value of the polling intervals of the plurality of instances is less than the minimum value of the duration of the messages in the message library, and the duration of the messages is the difference between the end time of the messages and the start time of the messages.
Further, after determining that the target message is a message to be pushed of the target instance, the method further includes: and the target instance pushes the message to be pushed to the user.
In order to achieve the above object, according to another aspect of the present application, a message push apparatus is provided. The device comprises: the acquisition unit is used for respectively polling the messages in the message library by adopting a plurality of instances deployed by the server and acquiring the message start time of the target message and the message end time of the target message; the judging unit is used for judging whether the target message is polled by the target instance when the current polling time of the target instance is within a closed interval formed by the message starting time of the target message and the message ending time of the target message; and the determining unit is used for determining the target message as the message to be pushed of the target instance under the condition that the target message is not polled by the target instance.
Further, the judging unit includes: the judging module is used for judging whether the starting time of the target message is later than the last polling ending time of the target instance; and the determining module is used for determining that the target message is not polled by the target instance under the condition that the starting time of the target message is later than the last polling ending time of the target instance.
Further, the apparatus further comprises: a first setting unit, configured to set a message start time and a message end time for a plurality of messages before the plurality of instances deployed by the server poll messages in the message library, respectively; and the storage unit is used for storing the message with the set message starting time and the set message ending time into the message library.
In order to achieve the above object, according to another aspect of the present application, there is provided a storage medium including a stored program, wherein the program executes any one of the above message push methods.
In order to achieve the above object, according to another aspect of the present application, there is provided a processor configured to execute a program, where the program executes any one of the above message pushing methods.
Through the application, the following steps are adopted: polling messages in a message library respectively by adopting a plurality of instances deployed by a server to acquire message start time of a target message and message end time of the target message; when the current polling time of the target instance is in a closed interval formed by the message starting time of the target message and the message ending time of the target message, judging whether the target message is polled by the target instance; the method and the device for the server instance to push the message solve the problem that in the prior art, the server instance pushes the message, namely modifies the field of the message, and identify whether the message is pushed or not by the field of the message, so that message pushing omission easily occurs for a server deployed by multiple instances. Whether each message is pushed is respectively judged by judging the relation among the polling time of each instance, the message starting time of the message and the message ending time of the message, so that the effects of multi-instance polling deployed by a server and pushing the message in a message library can be achieved without pushing omission.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, illustrate embodiments of the application and, together with the description, serve to explain the application and are not intended to limit the application. In the drawings:
fig. 1 is a flowchart of a message pushing method provided according to an embodiment of the present application; and
fig. 2 is a schematic diagram of a message pushing apparatus provided according to an embodiment of the present application.
Detailed Description
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
In order to make the technical solutions better understood by those skilled in the art, 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 partial embodiments of the present application, but not all 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," and the like in the description and claims of this application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It should be understood that the data so used may be interchanged under appropriate circumstances in order to facilitate the description of the embodiments of the application herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, 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.
According to an embodiment of the application, a message pushing method is provided.
Fig. 1 is a flowchart of a message pushing method according to an embodiment of the present application. As shown in fig. 1, the method comprises the steps of:
step S101, a plurality of instances deployed by a server are adopted to poll messages in a message library respectively, and the message start time of the target message and the message end time of the target message are obtained.
It should be noted that polling refers to that an instance of a server periodically queries a target object according to a time period. The server is a message push server deployed with multiple instances, each of which can push messages in a message library for users accessing the instance. The polling behaviors of the instances are independent, and the instances periodically query the messages in the message library according to the polling time periods of the instances.
For example, after an instance in the message server pushes the announcement, the announcement is broadcasted within the start and stop time period of the announcement, and the user can view the announcement content within the start and stop time period of the announcement.
Step S102, when the current polling time of the target instance is in a closed interval formed by the message start time of the target message and the message end time of the target message, judging whether the target message is polled by the target instance.
It should be noted that, when the current query time of the target instance is later than the end time of the target message, the message is indicated as a history message and does not need to be pushed again; when the current query time of the target instance is earlier than the end time of the target message, the message is a message to be pushed in the future and does not need to be pushed currently; when the current query time of the target instance falls between the message start time and the message end time of the target message, it is indicated that the message may be a message to be currently pushed, if the current query time of the target instance is the same as the message start time, a user can view the content broadcasted by the message within the duration of the message after pushing, and if the current query time of the target instance is close to the message end time, the user can view the message content within a short time after pushing.
In addition, when the polling time interval of the target instance is shorter than the length of the closed interval formed by the message start time and the message end time, for example, the polling interval is 10 minutes, the message start time is 10:30, the message end time is 11:00, the current polling time is 10:45, and the last polling time is 10:35, there is a case that the message queried by the target instance has already been pushed by the instance, and therefore, whether the target instance pushes the message needs to determine whether the message has already been queried by the target instance and pushed.
In order to prevent the target server from repeatedly pushing the same message, optionally, in the message pushing method provided in the embodiment of the present application, the determining whether the target message is polled by the target instance includes: judging whether the starting time of the target message is later than the last polling ending time of the target instance or not; and in the case that the starting time of the target message is later than the last polling ending time of the target instance, determining that the target message is not polled by the target instance.
For example, when the target instance queries the message in the message library each time, the last query time is recorded, and if the message start time of the target message is earlier than the last polling end time of the target instance, it indicates that the duration of the message is longer, and the message is queried and pushed by the target instance and does not need to be pushed again; if the message start time of the target message is later than the last polling end time of the target instance, the message is a message to be pushed in the future for the last polling, and the message is not pushed.
Step S103, under the condition that the target message is not polled by the target instance, determining that the target message is a message to be pushed of the target instance.
It should be noted that, in the case that the target message is not polled by the target instance, the target message is not pushed by the target instance, and the target message is determined to be the current message to be pushed of the target instance.
By the embodiment, whether one message is the message to be pushed of the target instance is marked by the polling time of the target instance, the message start time of the target message and the message end time, so that repeated pushing of the same instance cannot be caused.
Optionally, in the message pushing method provided in the embodiment of the present application, after determining that the target message is a to-be-pushed message of the target instance, the method further includes: and the target instance pushes the message to be pushed to the user.
Specifically, the target instance pushes a marked message to be pushed, and a user accessing the target instance will view the message during the existence period of the message to acquire the content of the message.
According to the message pushing method provided by the embodiment of the application, the messages in the message library are respectively polled by adopting a plurality of instances deployed by the server, and the message starting time of the target message and the message ending time of the target message are obtained; when the current polling time of the target instance is in a closed interval formed by the message starting time of the target message and the message ending time of the target message, judging whether the target message is polled by the target instance; the method and the device for the server instance to push the message solve the problem that in the prior art, the server instance pushes the message, namely modifies the field of the message, and identify whether the message is pushed or not by the field of the message, so that message pushing omission easily occurs for a server deployed by multiple instances. Whether each message is pushed is respectively judged by judging the relation among the polling time of each instance, the message starting time of the message and the message ending time of the message, so that the effects of multi-instance polling deployed by a server and pushing the message in a message library can be achieved without pushing omission.
Optionally, in the message pushing method provided in this embodiment of the present application, before the multiple instances deployed by the server respectively poll the messages in the message library, the method further includes: setting a message start time and a message end time for a plurality of messages; and storing the message with the message starting time and the message ending time into a message library.
It should be noted that the message start time and the message end time of each message may be preset, and different messages have different contents, different importance, different timeliness, different audience groups, and different message start time and message end time settings.
For example, for a planned message, the message content is stable, and a longer duration time can be set, for a monthly plan, the message start time can be set to the beginning of the month, and the message end time can be set to the end of the month; for messages with stronger timeliness, the duration is shorter, for example, the weather forecast of the day, and the ending time of the message is the end of the day.
And storing the message with the message starting time and the message ending time into a message library, and pushing the message when the server polls.
In order to prevent missing a message to be pushed when a server instance pushes a message, optionally, in the message pushing method provided in the embodiment of the present application, before a plurality of instances deployed by the server respectively poll messages in a message library, the method further includes: and respectively setting a polling interval time for a plurality of instances, wherein the polling interval time is an interval time between the end time of one polling and the start time of the next polling, the maximum value of the polling intervals of the plurality of instances is less than the minimum value of the duration of the messages in the message library, and the duration of the messages is the difference between the end time of the messages and the start time of the messages.
It should be noted that, if the duration of the message is short and the polling time interval is long, and there is a situation that the message start time and the message end time of the message are located in the same polling interval, it is easy to cause missing of the example to query the message, and thus missing of pushing the message, so after the message with the set message start time and message end time is stored in the message library, the polling interval of each example is set according to the duration of the message in the message library, the polling interval is set to be at least shorter than the minimum of the duration of the message, for the timely pushing of the message, the polling time can be set to be as short as possible, and at the same time, resources occupied by polling are considered, and a proper polling time is set.
For example, the minimum value of the duration of the message is 5 minutes, for the example with large user access, the polling interval may be set to be every minute, the example queries the message in the message library every minute, and for the example with small user access, the polling interval may be set to be two minutes for reasonable configuration of resources.
It should be noted that the steps illustrated in the flowcharts of the figures may be performed in a computer system such as a set of computer-executable instructions and that, although a logical order is illustrated in the flowcharts, in some cases, the steps illustrated or described may be performed in an order different than here.
The embodiment of the present application further provides a message pushing apparatus, and it should be noted that the message pushing apparatus in the embodiment of the present application may be used to execute the method for pushing a message provided in the embodiment of the present application. The following describes a message pushing apparatus according to an embodiment of the present application.
Fig. 2 is a schematic diagram of a message pushing apparatus according to an embodiment of the present application. As shown in fig. 2, the apparatus includes: an acquisition unit 10, a judgment unit 20 and a determination unit 30.
Specifically, the obtaining unit 10 is configured to separately poll messages in a message library by using multiple instances deployed by a server, and obtain a message start time of a target message and a message end time of the target message;
a judging unit 20, configured to judge whether the target message has been polled by the target instance when the current polling time of the target instance falls within a closed interval formed by the message start time of the target message and the message end time of the target message;
the determining unit 30 is configured to determine that the target message is a to-be-pushed message of the target instance when the target message is not polled by the target instance.
Optionally, in the message pushing apparatus provided in the embodiment of the present application, the determining unit 20 includes: the judging module is used for judging whether the starting time of the target message is later than the last polling ending time of the target instance; and the determining module is used for determining that the target message is not polled by the target instance under the condition that the starting time of the target message is later than the last polling ending time of the target instance.
Optionally, in the message pushing apparatus provided in the embodiment of the present application, the apparatus further includes: a first setting unit, configured to set a message start time and a message end time for a plurality of messages before the plurality of instances deployed by the server poll messages in the message library, respectively; and the storage unit is used for storing the message with the set message starting time and the set message ending time into the message library.
Optionally, in the message pushing apparatus provided in the embodiment of the present application, the apparatus further includes: the first setting unit is used for respectively setting polling interval time for a plurality of instances before the plurality of instances deployed by the server respectively poll the messages in the message base, wherein the polling interval time is the interval time between the end time of one polling and the start time of the next polling, the maximum value of the polling intervals of the plurality of instances is smaller than the minimum value of the duration of the messages in the message base, and the duration of the messages is the difference value between the end time of the messages and the start time of the messages.
Optionally, in the message pushing apparatus provided in the embodiment of the present application, the apparatus further includes: and the pushing unit is used for pushing the message to be pushed to the user by the target instance after the target message is determined to be the message to be pushed of the target instance.
In the message pushing apparatus provided in the embodiment of the present application, the obtaining unit 10 uses multiple instances deployed by a server to respectively poll messages in a message library, and obtains a message start time of a target message and a message end time of the target message; when the current polling time of the target instance falls within a closed interval formed by the message start time of the target message and the message end time of the target message, the judging unit 20 judges whether the target message is polled by the target instance; the determining unit 30 determines that the target message is a to-be-pushed message of the target instance when the target message is not polled by the target instance, so that a problem that a server instance in the related art pushes the message, that is, modifies a field of the message, and determines whether the message is pushed or not by using the field of the message, for a server deployed in multiple instances, message pushing omission easily occurs, and determines whether each message is pushed or not by determining relationships among polling time of each instance, message start time of the message, and message end time of the message, so that an effect that the pushing omission is not generated when the server deployed polls the multiple instances and pushes the message in the message library is achieved.
The message pushing device comprises a processor and a memory, wherein the acquiring unit 10, the judging unit 20, the determining unit 30 and the like are stored in the memory as program units, and the processor executes the program units stored in the memory to realize corresponding functions.
The processor comprises a kernel, and the kernel calls the corresponding program unit from the memory. The kernel can set one or more than one, the problem that in the related technology, the server instance pushes the message, namely, the field of the message is modified, is solved by adjusting the kernel parameters, and the problem that the message pushing omission easily occurs for the server deployed by multiple instances is solved by identifying whether the message is pushed or not by the field of the message.
The memory may include volatile memory in a computer readable medium, Random Access Memory (RAM) and/or nonvolatile memory such as Read Only Memory (ROM) or flash memory (flash RAM), and the memory includes at least one memory chip.
An embodiment of the present invention provides a storage medium on which a program is stored, and the program implements the message push method when executed by a processor.
The embodiment of the invention provides a processor, which is used for running a program, wherein the message pushing method is executed when the program runs.
The embodiment of the invention provides equipment, which comprises a processor, a memory and a program which is stored on the memory and can run on the processor, wherein the processor executes the program and realizes the following steps: polling messages in a message library respectively by adopting a plurality of instances deployed by a server to acquire message start time of a target message and message end time of the target message; when the current polling time of the target instance is in a closed interval formed by the message starting time of the target message and the message ending time of the target message, judging whether the target message is polled by the target instance; and under the condition that the target message is not polled by the target instance, determining that the target message is a message to be pushed of the target instance.
Determining whether the target message was polled by the target instance comprises: judging whether the starting time of the target message is later than the last polling ending time of the target instance or not; and in the case that the starting time of the target message is later than the last polling ending time of the target instance, determining that the target message is not polled by the target instance.
Before the plurality of instances of the server deployment individually poll the messages within the message library, the method further comprises: setting a message start time and a message end time for a plurality of messages; and storing the message with the message starting time and the message ending time into a message library.
Before the plurality of instances of the server deployment individually poll the messages within the message library, the method further comprises: and respectively setting a polling interval time for a plurality of instances, wherein the polling interval time is an interval time between the end time of one polling and the start time of the next polling, the maximum value of the polling intervals of the plurality of instances is less than the minimum value of the duration of the messages in the message library, and the duration of the messages is the difference between the end time of the messages and the start time of the messages.
After determining that the target message is a message to be pushed of the target instance, the method further includes: and the target instance pushes the message to be pushed to the user. The device herein may be a server, a PC, a PAD, a mobile phone, etc.
The present application further provides a computer program product adapted to perform a program for initializing the following method steps when executed on a data processing device: polling messages in a message library respectively by adopting a plurality of instances deployed by a server to acquire message start time of a target message and message end time of the target message; when the current polling time of the target instance is in a closed interval formed by the message starting time of the target message and the message ending time of the target message, judging whether the target message is polled by the target instance; and under the condition that the target message is not polled by the target instance, determining that the target message is a message to be pushed of the target instance.
Determining whether the target message was polled by the target instance comprises: judging whether the starting time of the target message is later than the last polling ending time of the target instance or not; and in the case that the starting time of the target message is later than the last polling ending time of the target instance, determining that the target message is not polled by the target instance.
Before the plurality of instances of the server deployment individually poll the messages within the message library, the method further comprises: setting a message start time and a message end time for a plurality of messages; and storing the message with the message starting time and the message ending time into a message library.
Before the plurality of instances of the server deployment individually poll the messages within the message library, the method further comprises: and respectively setting a polling interval time for a plurality of instances, wherein the polling interval time is an interval time between the end time of one polling and the start time of the next polling, the maximum value of the polling intervals of the plurality of instances is less than the minimum value of the duration of the messages in the message library, and the duration of the messages is the difference between the end time of the messages and the start time of the messages.
After determining that the target message is a message to be pushed of the target instance, the method further includes: and the target instance pushes the message to be pushed to the user.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). The memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The above are merely examples of the present application and are not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (8)
1. A message pushing method, comprising:
polling messages in a message library respectively by adopting a plurality of instances deployed by a server to acquire message start time of a target message and message end time of the target message;
when the current polling time of the target instance is within a closed interval formed by the message start time of the target message and the message end time of the target message, judging whether the target message is polled by the target instance, wherein the method comprises the following steps: judging whether the starting time of the target message is later than the last polling ending time of the target instance; determining that the target message has not been polled by the target instance if the start time of the target message is later than the last polling end time of the target instance;
And determining that the target message is a message to be pushed of the target instance under the condition that the target message is not polled by the target instance.
2. The method of claim 1, wherein prior to the plurality of instances of the server deployment individually polling the messages within the message library, the method further comprises:
setting a message start time and a message end time for a plurality of messages;
and storing the message with the message starting time and the message ending time into a message library.
3. The method of claim 2, wherein prior to the plurality of instances of the server deployment individually polling the messages within the message library, the method further comprises:
and respectively setting polling interval time for the plurality of instances, wherein the polling interval time is the interval time between the end time of one polling and the start time of the next polling, the maximum value of the polling intervals of the plurality of instances is less than the minimum value of the duration of the messages in the message library, and the duration of the messages is the difference between the end time of the messages and the start time of the messages.
4. The method of claim 1, wherein after determining that the target message is a to-be-pushed message for the target instance, the method further comprises:
And the target instance pushes the message to be pushed to the user.
5. A message push apparatus, comprising:
the device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for respectively polling messages in a message library by adopting a plurality of instances deployed by a server and acquiring the message start time of a target message and the message end time of the target message;
the determining unit, configured to determine whether the target message has been polled by the target instance when a current polling time of the target instance falls within a closed interval formed by a message start time of the target message and a message end time of the target message, includes: the judging module is used for judging whether the starting time of the target message is later than the last polling ending time of the target instance; a determining module, configured to determine that the target message has not been polled by the target instance when a start time of the target message is later than an end time of a last polling of the target instance;
a determining unit, configured to determine that the target message is a to-be-pushed message of the target instance when the target message is not polled by the target instance.
6. The apparatus of claim 5, further comprising:
A first setting unit, configured to set a message start time and a message end time for a plurality of messages before the plurality of instances deployed by the server poll messages in the message library, respectively;
and the storage unit is used for storing the message with the message starting time and the message ending time into a message library.
7. A storage medium characterized by comprising a stored program, wherein the program executes the message push method according to any one of claims 1 to 4.
8. A processor, configured to execute a program, wherein the program executes to perform the message pushing method according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811163372.0ACN110971643B (en) | 2018-09-30 | 2018-09-30 | Message pushing method and device, storage medium and processor |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811163372.0ACN110971643B (en) | 2018-09-30 | 2018-09-30 | Message pushing method and device, storage medium and processor |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110971643A CN110971643A (en) | 2020-04-07 |
| CN110971643Btrue CN110971643B (en) | 2022-07-29 |
Family
ID=70029479
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811163372.0AActiveCN110971643B (en) | 2018-09-30 | 2018-09-30 | Message pushing method and device, storage medium and processor |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110971643B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103051667A (en)* | 2011-09-12 | 2013-04-17 | 微软公司 | Distributing multi-source push notifications to multiple targets |
| CN105188037A (en)* | 2015-10-16 | 2015-12-23 | 珠海格力电器股份有限公司 | Message pushing method, mobile terminal and message pushing server |
| CN105930249A (en)* | 2016-04-20 | 2016-09-07 | 百度在线网络技术（北京）有限公司 | Application monitoring method and apparatus |
| CN105989065A (en)* | 2015-02-09 | 2016-10-05 | 苏宁云商集团股份有限公司 | Flash shot data processing method and system |
| CN106878824A (en)* | 2017-02-16 | 2017-06-20 | 北京金山安全软件有限公司 | Information pushing method and device and server |
| CN107147724A (en)* | 2017-05-23 | 2017-09-08 | 深圳市金立通信设备有限公司 | A kind of information push method, server and computer-readable recording medium |
| CN107277181A (en)* | 2017-08-14 | 2017-10-20 | 深圳市金立通信设备有限公司 | A kind of information push method, server and message push system |
| CN107332757A (en)* | 2017-06-21 | 2017-11-07 | 广东欧珀移动通信有限公司 | Method for deleting push messages and related products |
| CN108011937A (en)* | 2017-11-29 | 2018-05-08 | 努比亚技术有限公司 | Information push method, server, intelligent terminal and computer-readable recording medium |
| CN108111574A (en)* | 2017-11-29 | 2018-06-01 | 链家网（北京）科技有限公司 | A kind of information push method and system |
| CN108415835A (en)* | 2018-02-22 | 2018-08-17 | 北京百度网讯科技有限公司 | Distributed data library test method, device, equipment and computer-readable medium |
| CN108460115A (en)* | 2018-02-10 | 2018-08-28 | 深圳壹账通智能科技有限公司 | Information push method, device, computer equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8724612B2 (en)* | 2011-01-04 | 2014-05-13 | Apple Inc. | Adaptive timers for polling in a mobile wireless device |
- 2018
- 2018-09-30CNCN201811163372.0Apatent/CN110971643B/enactiveActive
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103051667A (en)* | 2011-09-12 | 2013-04-17 | 微软公司 | Distributing multi-source push notifications to multiple targets |
| CN105989065A (en)* | 2015-02-09 | 2016-10-05 | 苏宁云商集团股份有限公司 | Flash shot data processing method and system |
| CN105188037A (en)* | 2015-10-16 | 2015-12-23 | 珠海格力电器股份有限公司 | Message pushing method, mobile terminal and message pushing server |
| CN105930249A (en)* | 2016-04-20 | 2016-09-07 | 百度在线网络技术（北京）有限公司 | Application monitoring method and apparatus |
| CN106878824A (en)* | 2017-02-16 | 2017-06-20 | 北京金山安全软件有限公司 | Information pushing method and device and server |
| CN107147724A (en)* | 2017-05-23 | 2017-09-08 | 深圳市金立通信设备有限公司 | A kind of information push method, server and computer-readable recording medium |
| CN107332757A (en)* | 2017-06-21 | 2017-11-07 | 广东欧珀移动通信有限公司 | Method for deleting push messages and related products |
| CN107277181A (en)* | 2017-08-14 | 2017-10-20 | 深圳市金立通信设备有限公司 | A kind of information push method, server and message push system |
| CN108011937A (en)* | 2017-11-29 | 2018-05-08 | 努比亚技术有限公司 | Information push method, server, intelligent terminal and computer-readable recording medium |
| CN108111574A (en)* | 2017-11-29 | 2018-06-01 | 链家网（北京）科技有限公司 | A kind of information push method and system |
| CN108460115A (en)* | 2018-02-10 | 2018-08-28 | 深圳壹账通智能科技有限公司 | Information push method, device, computer equipment and storage medium |
| CN108415835A (en)* | 2018-02-22 | 2018-08-17 | 北京百度网讯科技有限公司 | Distributed data library test method, device, equipment and computer-readable medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110971643A (en) | 2020-04-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105488366B (en) | Data authority control method and system | |
| HK1224055A1 (en) | Method and device for classifying applications | |
| CN109561128B (en) | Data transmission method and device | |
| HK1201390A1 (en) | Method and device for updating client | |
| CN107959695B (en) | Data transmission method and device | |
| CN108243032B (en) | Method, device and equipment for acquiring service level information | |
| US20180103115A1 (en) | Information Pushing | |
| CN108134812B (en) | Data processing method and device | |
| CN110971571A (en) | Website domain name verification method and related device | |
| CN114138745A (en) | Data integration method, device, storage medium and processor | |
| CN109598526B (en) | Method and device for analyzing media contribution | |
| CN111222592B (en) | Method and device for acquiring two-dimensional code of equipment | |
| CN114882607A (en) | Automatic card punching method and device, processor and electronic equipment | |
| CN110971643B (en) | Message pushing method and device, storage medium and processor | |
| CN112583944A (en) | Processing method and device for updating domain name certificate | |
| CN110019508B (en) | Data synchronization method, device and system | |
| CN109558249B (en) | Control method and device for concurrent operation | |
| CN111177093A (en) | Method, device and medium for sharing scientific and technological resources | |
| CN108804403B (en) | Method and device for realizing service chart | |
| CN115757318A (en) | Log query method and device, storage medium and electronic equipment | |
| CN109867079B (en) | Control method and control device for three-dimensional library, storage medium and processor | |
| CN109299117B (en) | Data request processing method and device, storage medium and processor | |
| CN114330406A (en) | Two-dimensional code processing method, equipment and medium based on mobile terminal | |
| CN105447699B (en) | Data processing method and device | |
| CN112749149A (en) | Database switching method and device |
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 |