CN114331548A - Message pushing method and device, server and computer storage medium - Google Patents
Message pushing method and device, server and computer storage medium Download PDFInfo
- Publication number
- CN114331548A CN114331548A CN202111661861.0A CN202111661861A CN114331548A CN 114331548 A CN114331548 A CN 114331548A CN 202111661861 A CN202111661861 A CN 202111661861A CN 114331548 A CN114331548 A CN 114331548A
- Authority
- CN
- China
- Prior art keywords
- push
- pushing
- time zone
- time
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000012545 processing Methods 0.000 claims description 5
- 230000002085 persistent effect Effects 0.000 claims description 3
- 230000001052 transient effect Effects 0.000 claims description 2
- 230000000694 effects Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000013486 operation strategy Methods 0.000 description 2
- 238000012216 screening Methods 0.000 description 2
- 230000001788 irregular Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
Images
Landscapes
- Information Transfer Between Computers (AREA)
Abstract
The embodiment of the application discloses a message pushing method and device, a server and a computer storage medium, which are used for pushing messages at a proper time to improve user experience. The method in the embodiment of the application comprises the following steps: receiving a message pushing task, wherein the message pushing task is used for indicating to push a target message to at least two first pushing time zones, and comprises the target message, a target pushing time and a reference time zone; generating a push subtask corresponding to each first push time zone, where the push subtask includes a first push time corresponding to each first push time zone, and the first push time is a push time for converting the target push time into a push time in the reference time zone according to the first push time zone and the reference time zone; and if the first pushing time corresponding to the target pushing time zone is reached, pushing the target message to the target pushing time zone, wherein the target pushing time zone is any one first pushing time zone.
Description
Technical Field
The embodiment of the application relates to the technical field of computers, in particular to a message pushing method, a message pushing device, a server and a computer storage medium.
Background
With the development of internet services, large companies maintain daily lives and pull new users through various operation strategies. The push message is a common marketing means, and notifies the user of the activity of the company in advance by a push mode.
Currently, generally, unified push is performed according to a push area set in a push task. For example, when the push task is to push the activity message to the global user at ten o 'clock of wednesday in beijing, the global user will receive the push of the activity message at ten o' clock of wednesday in beijing. But at time beijing, ten on wednesday, the uk is at three points on wednesday, early in the morning. Therefore, uk users may receive a push of the activity message three points in the morning on the local time wednesday, resulting in a poor user experience.
Disclosure of Invention
The embodiment of the application provides a message pushing method and device, a server and a computer storage medium, which are used for pushing messages at a proper time to improve user experience.
A first aspect of an embodiment of the present application provides a message pushing method, including:
receiving a message pushing task, wherein the message pushing task is used for indicating to push a target message to at least two first pushing time zones, the message pushing task comprises the target message, a target pushing time and a reference time zone, and the target pushing time is the pushing time in each first pushing time zone;
generating a push subtask corresponding to each first push time zone, where the push subtask includes a first push time corresponding to each first push time zone, and the first push time is a push time for converting the target push time into a push time in the reference time zone according to the first push time zone and the reference time zone;
and if the first pushing time corresponding to the target pushing time zone is reached, pushing the target message to the target pushing time zone, wherein the target pushing time zone is any one first pushing time zone.
In a specific implementation manner, the message pushing task includes the identifiers of the at least two first pushing time zones;
after the receiving a message push task, the method further comprises:
determining N first push objects currently located in each first push time zone according to the identifier of each first push time zone in the at least two first push time zones, wherein N is a positive integer;
the pushing the target message to the target push time zone includes:
and pushing the target message to the N first pushing objects.
In a specific implementation manner, the message pushing task includes identifiers of K pushing objects, where K is a positive integer;
after the receiving a message push task, the method further comprises:
determining at least two first push time zones to which the K push objects belong according to the identifiers of the K push objects, and determining J first push objects currently located in each first push time zone, wherein J is a positive integer;
the pushing the target message to the target push time zone includes:
and pushing the target message to the J first pushing objects.
In a specific implementation manner, after the determining N first push objects currently located in each first push time zone, the method further includes:
if a third push time zone with the total number N of the first push objects smaller than a preset threshold exists in the at least two first push time zones, combining the third push time zone and at least one adjacent push time zone into one time zone, and updating the at least two first push time zones into at least one first push time zone; the adjacent push time zone is a first push time zone of the at least two first push time zones that is adjacent to the third push time zone.
In a specific implementation manner, the first push time corresponding to the combined time zone is the first push time corresponding to the time zone containing the most push objects in the third push time zone and the at least one adjacent push time zone.
In a specific implementation, the method further includes:
acquiring M second push objects currently located in the target push time zone within a preset time period before a first push moment corresponding to the target push time zone, wherein M is a positive integer;
the pushing the target message to the target push time zone includes:
and pushing the target message to the M second pushing objects.
In a specific implementation manner, if a first push time corresponding to the target push time zone exceeds a current time of the target push time zone, deleting a push subtask corresponding to the target push time zone.
A second aspect of the embodiments of the present application provides a server, including:
a receiving unit, configured to receive a message pushing task, where the message pushing task is used to instruct to push a target message to at least two first pushing time zones, and the message pushing task includes the target message, a target pushing time and a reference time zone, where the target pushing time is a pushing time in each first pushing time zone;
a generating unit, configured to generate a push subtask corresponding to each first push time zone, where the push subtask includes a first push time corresponding to each first push time zone, and the first push time is a push time obtained by converting the target push time into a reference time zone according to the first push time zone and the reference time zone;
and the pushing unit is used for pushing the target message to the target pushing time zone if a first pushing moment corresponding to the target pushing time zone is reached, wherein the target pushing time zone is any one first pushing time zone.
In a specific implementation manner, the message pushing task includes the identifiers of the at least two first pushing time zones;
the server further comprises: a determining unit, configured to determine, according to an identifier of each of the at least two first push time zones, N first push objects currently located in each of the at least two first push time zones, where N is a positive integer;
the pushing unit is specifically configured to push the target message to the N first push objects.
In a specific implementation manner, the message pushing task includes identifiers of K pushing objects, where K is a positive integer;
the determining unit is further configured to determine, according to the identifiers of the K push objects, at least two first push time zones to which the K push objects belong, and determine J first push objects currently located in each of the first push time zones, where J is a positive integer;
the pushing unit is specifically configured to push the target message to the J first push objects.
In a specific implementation manner, the server further includes: a merging unit, configured to merge a third push time zone and at least one adjacent push time zone into one time zone if a third push time zone in which a total number N of first push objects is smaller than a preset threshold exists in the at least two first push time zones, and update the at least two first push time zones into at least one first push time zone; the adjacent push time zone is a first push time zone of the at least two first push time zones that is adjacent to the third push time zone.
In a specific implementation manner, the first push time corresponding to the combined time zone is the first push time corresponding to the time zone containing the most push objects in the third push time zone and the at least one adjacent push time zone.
In a specific implementation manner, the server further includes: an obtaining unit, configured to obtain M second push objects currently located in the target push time zone within a preset time period before a first push time corresponding to the target push time zone, where M is a positive integer;
the pushing unit is specifically configured to push the target message to the M second push objects.
In a specific implementation manner, the server further includes: and the deleting unit is used for deleting the pushing subtask corresponding to the target pushing time zone if the first pushing time corresponding to the target pushing time zone exceeds the current time of the target pushing time zone.
A third aspect of the embodiments of the present application provides a server, including:
the system comprises a central processing unit, a memory and an input/output interface;
the memory is a transient memory or a persistent memory;
the central processor is configured to communicate with the memory and execute the operations of the instructions in the memory to perform the method of the first aspect.
A fourth aspect of embodiments of the present application provides a computer storage medium having instructions stored therein, which when executed on a computer, cause the computer to perform the method according to the first aspect.
According to the technical scheme, the embodiment of the application has the following advantages: and generating a pushing subtask corresponding to each first pushing time zone according to the message pushing task, and converting the target pushing time into the pushing time in the reference time zone according to the first pushing time zone and the reference time zone. And only when the first pushing time corresponding to the target pushing time zone is reached, pushing the target message to the corresponding target pushing time zone. And the message is prevented from being pushed to the user at an improper time to a certain extent, so that the user experience is improved.
Drawings
Fig. 1 is a schematic flowchart of a message pushing method disclosed in an embodiment of the present application;
fig. 2 is a schematic time zone division diagram of a message pushing method disclosed in the embodiment of the present application;
FIG. 3 is a schematic structural diagram of a server according to an embodiment of the present disclosure;
fig. 4 is another schematic structural diagram of a server disclosed in the embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
With the development of internet services, large companies maintain daily lives or pull new through various operation strategies. Message pushing is a common marketing means. The message pushing refers to the active message pushing of an operator to the user mobile equipment through a product background or a third-party tool, and is a channel for a manufacturer to actively contact the user. Through message pushing, the target user can see the message notification in the mobile device notification and status bar, and the user is prompted to click the message to the corresponding application program page.
The push mode is now a single push according to the region (different country combinations). However, the same area (e.g. the U.S. area) may contain multiple time zones, and if the push is performed at a uniform time, users in some time zones may receive the push in the middle of the night, which results in poor user experience and even user complaints.
However, there is currently no method for pushing a message according to a user time zone for complicated timing. Therefore, it is important to develop a method for pushing time according to time zone.
The embodiment of the application provides a message pushing method and device, a server and a computer storage medium, which are used for pushing messages at a proper time to improve user experience.
Referring to fig. 1, an embodiment of the present application provides a message pushing method, including:
101. and receiving a message pushing task, wherein the message pushing task is used for indicating to push the target message to at least two first pushing time zones, the message pushing task comprises the target message, target pushing time and a reference time zone, and the target pushing time is the pushing time in each first pushing time zone.
When the operator wants to push the message to the user, a message pushing task is uploaded to the server, wherein the message pushing task is used for indicating that the target message is pushed to the at least two first pushing time zones. Specifically, the message pushing task comprises a target message, a target pushing time and a reference time zone. The target push time is a push time in each first push time zone, such as ten local times, and is not limited herein.
(1) In some possible embodiments, the message push task further comprises an identification of the aforementioned at least two first push time zones. Therefore, N first push objects currently located in each first push time zone may also be determined according to the identifier of each of the at least two first push time zones included in the received message push task, where N is a positive integer. Optionally, in step 103, when the first push time corresponding to the target push time zone is reached, the target message may be pushed to N first push objects corresponding to the target push time zone.
(2) In another possible embodiment, the message push task includes an identification of K push objects, where K is a positive integer. Therefore, at least two first push time zones to which the K push objects belong can be determined according to the identifiers of the K push objects included in the received message push task, and J first push objects currently located in each first push time zone are determined, where J is a positive integer.
Optionally, the push time zone in which the push object is currently located may be obtained by analyzing the internet protocol address of the push object.
Optionally, the total number of the global time zones may be set by an operator according to requirements, for example, the operator may divide the global into 30 time zones; or may be 24 standard time zones based on the world standard time, which is not limited in this application.
Optionally, in step 103, when the first push time corresponding to the target push time zone is reached, the target push message may be pushed to J first push objects corresponding to the target push time zone.
Optionally, the identifiers of the K push objects are used to determine at least two first push time zones, and the K push objects are partial push objects to be pushed, and are not all push objects to be pushed. Before step 103 is executed, N first push objects currently located in each of the at least two first push time zones may also be determined according to the identifier of each of the at least two first push time zones, and pushing the target message to the N first push objects is specifically executed when step 103 is executed.
(3) In another possible embodiment, the message push task may include a push zone. Therefore, the push object of each first push time zone can be confirmed according to the push region in the received message push task.
Specifically, each first push time zone indicated by the message push task can be determined according to the push area, and then the corresponding push object is obtained according to the time zone.
For example, taking 24 standard time zones as an example, if the push area is a chinese area, the chinese area includes five first push time zones, which are calculated according to an offset from the world standard time: and the pushing objects of the east five zone, the east six zone, the east seven zone, the east eight zone and the east nine zone can be obtained next.
For another example, taking 30 preset time zones as an example, if the push area is area a, determining at least one first push time zone corresponding to area a in the mapping relationship between the preset area identifier in the server and the push time zone; and further determining the push object in the first push time zone to complete subsequent pushing.
(4) In another possible embodiment, the message push task may include a push user type. Therefore, the push object of each first push time zone can be confirmed according to the push user type in the received message push task. Specifically, the push user type may be an android user or a user whose system version number is all versions, and the time zone in which push objects satisfying the push user type are distributed globally, that is, each first push time zone, is screened.
Further optionally, based on the identifiers of the at least two first push time zones determined in the above manners (1) to (4), the big data service may be configured to filter out the push objects in each first push time zone. Then, in step 103, when the first push time corresponding to the target push time zone is reached, the target push message may be pushed to the first push object screened out through the big data service corresponding to the target push time zone.
It is worth noting that in some embodiments partitioned into 24 standard time zones, the identification of the first pushed time zone of embodiments of the present application may be represented by an offset from the world standard time.
102. And generating a pushing subtask corresponding to each first pushing time zone, wherein the pushing subtask comprises a first pushing time corresponding to each first pushing time zone, and the first pushing time is the pushing time for converting the target pushing time into the reference time zone according to the first pushing time zone and the reference time zone.
According to the message pushing tasks received in step 101, generating pushing subtasks in one-to-one correspondence to the first pushing time zones indicated by each message pushing task, where the pushing subtasks include first pushing time corresponding to each first pushing time zone, and the first pushing time is determined according to the first pushing time zone, the reference time zone, and the target pushing time.
In one possible embodiment, each first push time zone is determined by step 101. Referring to fig. 2, it should be noted that if the determination is performed according to the identifier of the first push time zone in the message push task (i.e. the area shown by the closed graph surrounded by the irregular solid line 201 in the figure), the message push task is divided into four first push time zones 202 according to the preset time zone division rule (the division is shown by the dotted line in the figure). Then, a first push time is determined for each first push time zone 202 according to the time zone in which the first push time zone is located, the time zone in which the reference time zone is located, and the target push time in the message push task, where each first push time zone in the figure has a corresponding push object 203 (the number of push objects in the figure is merely an example). Here, for example, how to determine the first push time is performed is illustrated, if the first push time zone is an eighty-th zone, the reference time zone is an eighty-th zone, and the target push time is ten times a morning on wednesday, the converted first push time is eight times a wednesday in the eighty-th zone (i.e., the reference time zone). After the push time of each different first push time zone is converted into the time of the same time zone, the centralized management of the message push task is convenient to realize.
103. And if the first push time corresponding to the target push time zone is reached, pushing a target message to the target push time zone, wherein the target push time zone is any one first push time zone.
And judging according to the first pushing time determined when the pushing subtask corresponding to each first pushing time zone is generated in the step 102, and pushing the target message in the message pushing task to the target pushing time zone if the first pushing time corresponding to the target pushing time zone is reached. It is to be understood that, optionally, the target message may be sent to the device terminal of the push object corresponding to the target push time zone through a third-party service, which is not limited herein. The third-party service may be any third-party service providing a Server terminal agent, such as google third-party service FireBase or Parse Server, and is not limited herein.
In some specific implementation manners, the first push time corresponding to the target push time zone can be determined by the following manners:
(1) when the push subtasks are generated in step 102, a timer is set for each push subtask, the end time of the timer is five minutes before the corresponding first push time, a push object corresponding to the target push time zone is obtained when the timing is ended, and a target message is pushed to the push object corresponding to the target push time zone.
(2) According to a preset query period, querying whether the push subtasks generated in step 102 meet a preset cache condition, if any one of the push subtasks meets the preset cache condition, determining a push object corresponding to the push subtask meeting the preset cache condition and storing the push object in a cache, and then when a first push time corresponding to any one first push time zone (i.e. a target push time zone) is reached, acquiring the push object corresponding to the target push time zone from the cache, and pushing a target message to the push object corresponding to the target push time zone. The preset caching condition can be that a time interval between the current time and a first pushing time of any pushing subtask is not greater than a preset time interval, and the current time is earlier than the first pushing time; the preset time interval may be set according to a time for determining a time for pushing an object corresponding to a sub-task, which is not limited in the present application.
It can be understood that other implementation manners may exist besides the above two manners of determining the first push time corresponding to any one first push time zone (i.e. the target push time zone); meanwhile, the push object may be temporarily or previously confirmed, but the embodiment of the present application is not limited.
In the embodiment of the application, a push subtask corresponding to each first push time zone can be generated according to the message push task, and the target push time is converted into the push time in the reference time zone according to the first push time zone and the reference time zone. And only when the first pushing time corresponding to the target pushing time zone is reached, pushing the target message to the corresponding target pushing time zone. And the message is prevented from being pushed to the user at an improper time to a certain extent, so that the user experience is improved.
In a specific implementation manner, on the basis of the foregoing step 101 to step 103, in the message pushing method in this embodiment of the present application, after determining a plurality of first pushing objects corresponding to each first pushing time zone, it is determined whether a third pushing time zone exists in at least two first pushing time zones, where the third pushing time zone is a first pushing time zone in which the total number of the first pushing objects is smaller than a preset threshold; if not, go to step 103; and if so, combining the third push time zone with at least one adjacent push time zone, and updating at least two first push time zones indicated by the message push task to at least one first push time zone, namely combining a push object in the third push time zone with the adjacent push time zone. Wherein the adjacent push time zone is a first push time zone adjacent to the third push time zone in the plurality of first push time zones indicated in the message push task. Therefore, under the condition of meeting the requirements of most users, the number of subtasks required to be executed by one server can be reduced, and the occupancy rate of server resources is further reduced.
Optionally, if the total number of the first pushed objects corresponding to the time zone obtained after the merging is still smaller than the preset threshold, the time zone obtained after the merging and the adjacent pushed time zone are merged for the second time until the total number of the pushed objects in the time zone is smaller than the preset threshold.
Optionally, after the third pushed time zone is merged with at least one adjacent pushed time zone, the first pushed time of the merged time zone is determined. The first push time for the merged time zone may be: any first push time in the third push time zone and the at least one adjacent push time zone.
Optionally, the first pushing time corresponding to the time zone obtained after the merging is: the third push time zone and the first push time corresponding to the time zone with more push objects in the at least one adjacent push time zone.
In addition, optionally, if the first pushing time corresponding to the target pushing time zone in the step 103 exceeds the current time of the target pushing time zone, the target pushing subtask corresponding to the target pushing time zone may not be completed, so before the step 103, the target pushing subtask that cannot be completed may be processed in the following manners:
(1) deleting the target push subtask;
(2) sending a notice to an operator so that the operator modifies the target pushing time of the message pushing task corresponding to the target pushing subtask according to the notice;
(3) merging the target push time zone and one or more adjacent at least one first push time zone which is not overtime, wherein if the number of the first push time zones which are not overtime and participate in merging is 1, the first push time corresponding to the merged time zone is the first push time corresponding to the first push time zone which participates in merging and does not overtime; or if the number of the non-overtime first push time zones participating in the combination is multiple, the first push time corresponding to the combined time zone is the first push time corresponding to the first push time zone with the most push objects in the multiple non-overtime first push time zones participating in the combination.
The target push time zone may be any first push time zone indicated by the message push task. It is to be understood that other processing methods are available in other embodiments, but the examples of the present application are not limited thereto.
In this embodiment of the application, the third push time zone in which the number of the first push objects is less than the preset threshold may be merged into at least one adjacent push time zone. Meanwhile, the push subtasks with the first push time earlier than the current time of the first push time zone corresponding to the corresponding push subtasks can be processed to release server resources.
In the following, a specific implementation manner of the message pushing method according to the embodiment of the present application when an operator of the software a wants to push a message is described with reference to a specific scenario.
The operator of the software a submits a push application form, in which the push task (i.e., the message push task received in the foregoing step 101) is to push an active message (i.e., the foregoing target message) to a user in the U.S. region of the software a using the android system and having any version number at the time of 2021 year, 5 months and 13 am.
First, responding to a push task initiated by an operator, and checking the reasonability of relevant information of the push task by a server.
And when the rationality of the related information is successfully verified, screening a time zone in which a system of the user terminal equipment is an android system, the area where the user is located is a U.S. area, and the version number of the software A in the user terminal equipment is distributed by all users (namely the identifiers of the pushed objects) of any version through the big data service. Then, the pushing task is divided into pushing subtasks which are in one-to-one correspondence with a plurality of time zones distributed by the user. Then, the push subtasks with the number of users less than 20 (preset threshold) in the plurality of subtasks are merged into any one of the push subtasks in the adjacent time zone, and the push subtasks with the push time exceeding the current time of the time zone corresponding to the push subtask are deleted. And finally, storing the residual pushing subtasks after the merging and deleting processes into a database according to the sequence of the first pushing time.
And secondly, regularly scanning the push subtasks five minutes before the push time every five minutes, and determining the push subtasks as target push subtasks. Screening out all push accounts (namely the push objects) corresponding to the target push subtasks through a big data service and a user database, and storing all the push accounts in a redis cache of a specified path. When the pushing time of the target pushing subtask is reached, all pushing account numbers are obtained in the specified path, then all pushing account numbers of the target pushing subtask and activity messages in the pushing task are sent to Google third-party service FireBase, and the FireBase sends the activity messages to all pushing account numbers of the target subtask.
In practical applications, a core table may be defined to record relevant information of each push subtask. Specifically, the task table includes a unique subtask identifier of each push subtask; the task table further comprises a time zone field corresponding to each push subtask and a first push time of each push subtask.
Referring to fig. 3, an embodiment of the present application provides a server, including:
a receiving unit 301, configured to receive a message pushing task, where the message pushing task is used to instruct to push a target message to at least two first pushing time zones, and the message pushing task includes the target message, a target pushing time and a reference time zone, and the target pushing time is a pushing time in each first pushing time zone;
a generating unit 302, configured to generate a push subtask corresponding to each first push time zone, where the push subtask includes a first push time corresponding to each first push time zone, and the first push time is a push time for converting a target push time into a push time in a reference time zone according to the first push time zone and the reference time zone;
a pushing unit 303, configured to push a target message to a target push time zone if a first push time corresponding to the target push time zone is reached, where the target push time zone is any one first push time zone.
In a specific implementation manner, the message pushing task comprises at least two first pushing time zone identifications;
the server further comprises: a determining unit, configured to determine, according to an identifier of each of at least two first push time zones, N first push objects currently located in each of the first push time zones, where N is a positive integer;
the pushing unit 303 is specifically configured to push the target message to the N first push objects.
In a specific implementation manner, the message pushing task includes identifiers of K pushing objects, where K is a positive integer;
the determining unit is further configured to determine, according to the identifiers of the K push objects, at least two first push time zones to which the K push objects belong, and determine J first push objects currently located in each first push time zone, where J is a positive integer;
the pushing unit 303 is specifically configured to push the target message to J first push objects.
In a specific implementation, the server further includes: a merging unit, configured to merge a third push time zone and at least one adjacent push time zone into one time zone if a third push time zone exists in the at least two first push time zones, where a total number N of the first push objects is smaller than a preset threshold, and update the at least two first push time zones into at least one first push time zone; the adjacent push time zone is a first push time zone of the at least two first push time zones that is adjacent to the third push time zone.
In a specific implementation manner, the first push time corresponding to the combined time zone is the first push time corresponding to the time zone containing the most push objects in the third push time zone and the at least one adjacent push time zone.
In a specific implementation, the server further includes: the device comprises an acquisition unit, a display unit and a display unit, wherein the acquisition unit is used for acquiring M second push objects currently located in a target push time zone in a preset time period before a first push time corresponding to the target push time zone, and M is a positive integer;
the pushing unit 303 is specifically configured to push the target message to the M second push objects.
In a specific implementation, the server further includes: and the deleting unit is used for deleting the pushing subtask corresponding to the target pushing time zone if the first pushing time corresponding to the target pushing time zone exceeds the current time of the target pushing time zone.
In this embodiment of the application, the generating unit 302 may generate a push subtask corresponding to each first push time zone according to the message push task, and convert the target push time into a push time in the reference time zone according to the first push time zone and the reference time zone. Only when the first push time corresponding to the target push time zone is reached, the push unit 303 pushes the target message to the corresponding target push time zone. And the message is prevented from being pushed to the user at an improper time to a certain extent, so that the user experience is improved.
Fig. 4 is a schematic structural diagram of a server according to an embodiment of the present disclosure, where the server 400 may include one or more Central Processing Units (CPUs) 401 and a memory 405, and the memory 405 stores one or more application programs or data.
The server 400 may also include one or more power supplies 402, one or more wired or wireless network interfaces 403, one or more input-output interfaces 404, and/or one or more operating systems, such as Windows Server, Mac OS XTM, UnixTM, LinuxTM, FreeBSDTM, etc.
The central processing unit 401 may perform the operations performed by the server in the embodiments shown in fig. 1 to fig. 3, and details thereof are not repeated herein.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and the like.
Claims (10)
1. A message pushing method, comprising:
receiving a message pushing task, wherein the message pushing task is used for indicating to push a target message to at least two first pushing time zones, the message pushing task comprises the target message, a target pushing time and a reference time zone, and the target pushing time is the pushing time in each first pushing time zone;
generating a push subtask corresponding to each first push time zone, where the push subtask includes a first push time corresponding to each first push time zone, and the first push time is a push time for converting the target push time into a push time in the reference time zone according to the first push time zone and the reference time zone;
and if the first pushing time corresponding to the target pushing time zone is reached, pushing the target message to the target pushing time zone, wherein the target pushing time zone is any one first pushing time zone.
2. The method according to claim 1, wherein the message push task comprises an identification of the at least two first push time zones;
after the receiving a message push task, the method further comprises:
determining N first push objects currently located in each first push time zone according to the identifier of each first push time zone in the at least two first push time zones, wherein N is a positive integer;
the pushing the target message to the target push time zone includes:
and pushing the target message to the N first pushing objects.
3. The method of claim 1, wherein the message push task comprises identities of K push objects, wherein K is a positive integer;
after the receiving a message push task, the method further comprises:
determining at least two first push time zones to which the K push objects belong according to the identifiers of the K push objects, and determining J first push objects currently located in each first push time zone, wherein J is a positive integer;
the pushing the target message to the target push time zone includes:
and pushing the target message to the J first pushing objects.
4. The method of claim 2, wherein after the determining the N first push objects currently located in each of the first push time zones, the method further comprises:
if a third push time zone with the total number N of the first push objects smaller than a preset threshold exists in the at least two first push time zones, combining the third push time zone and at least one adjacent push time zone into one time zone, and updating the at least two first push time zones into at least one first push time zone; the adjacent push time zone is a first push time zone of the at least two first push time zones that is adjacent to the third push time zone.
5. The method according to claim 4, wherein the first push time corresponding to the merged time zone is the first push time corresponding to the third push time zone and the time zone containing the most push objects in the at least one adjacent push time zone.
6. The method according to any one of claims 1 to 5, further comprising:
acquiring M second push objects currently located in the target push time zone within a preset time period before a first push moment corresponding to the target push time zone, wherein M is a positive integer;
the pushing the target message to the target push time zone includes:
and pushing the target message to the M second pushing objects.
7. The method of claim 1, further comprising:
and if the first pushing time corresponding to the target pushing time zone exceeds the current time of the target pushing time zone, deleting the pushing subtask corresponding to the target pushing time zone.
8. A server, comprising:
a receiving unit, configured to receive a message pushing task, where the message pushing task is used to instruct to push a target message to at least two first pushing time zones, and the message pushing task includes the target message, a target pushing time and a reference time zone, where the target pushing time is a pushing time in each first pushing time zone;
a generating unit, configured to generate a push subtask corresponding to each first push time zone, where the push subtask includes a first push time corresponding to each first push time zone, and the first push time is a push time obtained by converting the target push time into a reference time zone according to the first push time zone and the reference time zone;
and the pushing unit is used for pushing the target message to the target pushing time zone if a first pushing moment corresponding to the target pushing time zone is reached, wherein the target pushing time zone is any one first pushing time zone.
9. A server, comprising:
the system comprises a central processing unit, a memory and an input/output interface;
the memory is a transient memory or a persistent memory;
the central processor is configured to communicate with the memory and execute the instructions in the memory to perform the method of any of claims 1-7.
10. A computer storage medium having stored therein instructions that, when executed on a computer, cause the computer to perform the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111661861.0A CN114331548A (en) | 2021-12-30 | 2021-12-30 | Message pushing method and device, server and computer storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111661861.0A CN114331548A (en) | 2021-12-30 | 2021-12-30 | Message pushing method and device, server and computer storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114331548A true CN114331548A (en) | 2022-04-12 |
Family
ID=81021092
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111661861.0A Pending CN114331548A (en) | 2021-12-30 | 2021-12-30 | Message pushing method and device, server and computer storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114331548A (en) |
Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101291293A (en) * | 2008-06-05 | 2008-10-22 | 华为技术有限公司 | Media resource adaptation method, media gateway controller and server |
| CN103249006A (en) * | 2013-04-28 | 2013-08-14 | 清华大学 | Multicast-based network data pre-pushing method |
| CN103888493A (en) * | 2012-12-20 | 2014-06-25 | 腾讯科技（深圳）有限公司 | Information push method and device |
| CN103902636A (en) * | 2012-12-30 | 2014-07-02 | 腾讯科技（深圳）有限公司 | Method and server for pushing information based on filtering and clustering method |
| CN108734559A (en) * | 2018-05-23 | 2018-11-02 | 北京京东金融科技控股有限公司 | A kind of order processing method and apparatus |
| CN109672608A (en) * | 2018-12-21 | 2019-04-23 | 腾讯音乐娱乐科技（深圳）有限公司 | The method for sending message according to the time |
| CN110019092A (en) * | 2017-12-27 | 2019-07-16 | 杭州华为数字技术有限公司 | Method, controller and the system of data storage |
| CN111666014A (en) * | 2020-07-06 | 2020-09-15 | 腾讯科技（深圳）有限公司 | Message pushing method, device, equipment and computer readable storage medium |
| CN111815011A (en) * | 2019-04-10 | 2020-10-23 | 财付通支付科技有限公司 | Message sending method and device, computer equipment and storage medium |
| CN112367246A (en) * | 2020-10-30 | 2021-02-12 | 深圳壹账通智能科技有限公司 | Message pushing method and device, electronic equipment and storage medium |
| CN113010781A (en) * | 2021-03-11 | 2021-06-22 | 北京达佳互联信息技术有限公司 | Push method, device, server and storage medium |
| CN113312563A (en) * | 2021-06-24 | 2021-08-27 | 北京三快在线科技有限公司 | Information recommendation method, device, equipment and storage medium |
| CN113382088A (en) * | 2021-07-27 | 2021-09-10 | 中国银行股份有限公司 | Mobile banking message pushing method and device |
| WO2021179265A1 (en) * | 2020-03-12 | 2021-09-16 | 深圳市欢太科技有限公司 | Information pushing method and apparatus, server, and storage medium |
| CN113763034A (en) * | 2021-08-06 | 2021-12-07 | 郑州阿帕斯数云信息科技有限公司 | Advertisement data processing method and device |
-
2021
- 2021-12-30 CN CN202111661861.0A patent/CN114331548A/en active Pending
Patent Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101291293A (en) * | 2008-06-05 | 2008-10-22 | 华为技术有限公司 | Media resource adaptation method, media gateway controller and server |
| CN103888493A (en) * | 2012-12-20 | 2014-06-25 | 腾讯科技（深圳）有限公司 | Information push method and device |
| CN103902636A (en) * | 2012-12-30 | 2014-07-02 | 腾讯科技（深圳）有限公司 | Method and server for pushing information based on filtering and clustering method |
| CN103249006A (en) * | 2013-04-28 | 2013-08-14 | 清华大学 | Multicast-based network data pre-pushing method |
| CN110019092A (en) * | 2017-12-27 | 2019-07-16 | 杭州华为数字技术有限公司 | Method, controller and the system of data storage |
| CN108734559A (en) * | 2018-05-23 | 2018-11-02 | 北京京东金融科技控股有限公司 | A kind of order processing method and apparatus |
| CN109672608A (en) * | 2018-12-21 | 2019-04-23 | 腾讯音乐娱乐科技（深圳）有限公司 | The method for sending message according to the time |
| CN111815011A (en) * | 2019-04-10 | 2020-10-23 | 财付通支付科技有限公司 | Message sending method and device, computer equipment and storage medium |
| WO2021179265A1 (en) * | 2020-03-12 | 2021-09-16 | 深圳市欢太科技有限公司 | Information pushing method and apparatus, server, and storage medium |
| CN111666014A (en) * | 2020-07-06 | 2020-09-15 | 腾讯科技（深圳）有限公司 | Message pushing method, device, equipment and computer readable storage medium |
| CN112367246A (en) * | 2020-10-30 | 2021-02-12 | 深圳壹账通智能科技有限公司 | Message pushing method and device, electronic equipment and storage medium |
| CN113010781A (en) * | 2021-03-11 | 2021-06-22 | 北京达佳互联信息技术有限公司 | Push method, device, server and storage medium |
| CN113312563A (en) * | 2021-06-24 | 2021-08-27 | 北京三快在线科技有限公司 | Information recommendation method, device, equipment and storage medium |
| CN113382088A (en) * | 2021-07-27 | 2021-09-10 | 中国银行股份有限公司 | Mobile banking message pushing method and device |
| CN113763034A (en) * | 2021-08-06 | 2021-12-07 | 郑州阿帕斯数云信息科技有限公司 | Advertisement data processing method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110659121B (en) | Task data acquisition method and device, task configuration method and device and server | |
| US11188443B2 (en) | Method, apparatus and system for processing log data | |
| CN111210340B (en) | Automatic task processing method, device, server and storage medium | |
| CN113468226B (en) | Service processing method and device, electronic equipment and storage medium | |
| CN112422684B (en) | Target message processing method and device, storage medium and electronic device | |
| CN112364267A (en) | Front-end data acquisition method and device | |
| CN114584829B (en) | Method and system for managing list active page | |
| CN110019131B (en) | Method and device for multi-disk service | |
| CN110188258B (en) | Method and device for acquiring external data by using crawler | |
| CN114331548A (en) | Message pushing method and device, server and computer storage medium | |
| CN110909072A (en) | Data table establishing method, device and equipment | |
| CN115422448A (en) | Message pushing method and device, electronic equipment and storage medium | |
| CN115017171A (en) | Data processing method and device in multi-time zone scene, electronic equipment and medium | |
| CN110134547B (en) | Middleware-based repeated data deleting method and related device | |
| CN111144091B (en) | Customer service member determination method and device and group member identification determination method | |
| CN113238919A (en) | Statistical method, device and system for user access number | |
| CN113407491A (en) | Data processing method and device | |
| CN113360558A (en) | Data processing method, data processing device, electronic device, and storage medium | |
| CN113114718A (en) | Data transmission method and system in Internet of things, and Internet of things equipment and terminal | |
| CN111861432A (en) | Virtual resource information updating method and device, server and storage medium | |
| CN112650815A (en) | Method and device for synchronizing environmental data, storage medium and electronic device | |
| CN112260965A (en) | Message processing method, device, equipment and storage medium | |
| CN113852919B (en) | Method and device for generating early warning message, storage medium and electronic device | |
| CN110113390A (en) | Network request processing method, device, computer equipment and storage medium | |
| CN115269161B (en) | Abnormal process reverse rollback method and system |
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 |