CN111163152B - Information pushing method and device - Google Patents
Information pushing method and device Download PDFInfo
- Publication number
- CN111163152B CN111163152B CN201911365816.3A CN201911365816A CN111163152B CN 111163152 B CN111163152 B CN 111163152B CN 201911365816 A CN201911365816 A CN 201911365816A CN 111163152 B CN111163152 B CN 111163152B
- Authority
- CN
- China
- Prior art keywords
- preset
- pushing
- message instructions
- information
- instructions
- 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
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/01—Protocols
- H04L67/02—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
- H04L67/025—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP] for remote control or remote monitoring of applications
-
- 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/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The embodiment of the application discloses an information pushing method and device, which are applied to a server, wherein the method comprises the following steps: and synchronously monitoring M interfaces in a preset time period, acquiring N message instructions corresponding to the triggering M interfaces, judging whether the N message instructions accord with preset rules, if P message instructions accord with the preset rules in the N message instructions, correspondingly storing P preset asynchronous message instructions to the P interfaces corresponding to the P message instructions, wherein each preset asynchronous message instruction can carry push information, and if Q preset asynchronous message instructions in the P preset asynchronous message instructions are triggered, pushing Q push information corresponding to the Q preset asynchronous message instructions to a front page, so that a plurality of interfaces can be adopted to asynchronously push a plurality of push information to the front page, thereby avoiding the occurrence of a clamping phenomenon of the front page and being beneficial to improving user experience.
Description
Technical Field
The present invention relates to the field of data processing, and in particular, to an information pushing method and device.
Background
With the development of computing technology, various websites, clients and other Internet products enrich the work and life of the masses and bring various convenience to people. For example, the advent of software APP (application program) such as panning, microblog, etc., allows users to obtain the most interesting content or focus on valuable microblog users with less time. When pushing information, a plurality of pushing information are synchronously pushed by adopting one interface, and often, due to overlarge pushed content or larger real-time dynamic data calculation amount, the front-end display page in the APP is blocked, so that the user experience is poor.
Disclosure of Invention
The embodiment of the application provides an information pushing method and device, which are used for avoiding the occurrence of the front-end page clamping phenomenon and are beneficial to improving user experience.
A first aspect of an embodiment of the present application provides an information pushing method, applied to a server, where the method includes:
synchronously monitoring M interfaces in a preset time period, and acquiring N message instructions corresponding to the M interfaces, wherein M is a positive integer, and N is a positive integer smaller than or equal to M;
judging whether the N message instructions accord with a preset rule or not;
if P message instructions in the N message instructions accord with a preset rule, correspondingly storing P preset asynchronous message instructions to P interfaces corresponding to the P message instructions, wherein each preset asynchronous message instruction can carry push information, and P is a positive integer less than or equal to N;
if Q preset asynchronous message instructions in the P preset asynchronous message instructions are triggered, pushing Q push information corresponding to the Q preset asynchronous message instructions to a front-end page, wherein Q is a positive integer smaller than or equal to P.
The second aspect of the embodiment of the application provides an information pushing device, which is applied to a server, and comprises a monitoring unit, a judging unit, a storage unit and a pushing unit, wherein:
The monitoring unit is used for synchronously monitoring M interfaces within a preset time period, and acquiring N message instructions corresponding to the M interfaces, wherein M is a positive integer, and N is a positive integer smaller than or equal to M;
the judging unit is used for judging whether the N message instructions accord with a preset rule or not;
the storage unit is configured to store P preset asynchronous message instructions corresponding to P interfaces corresponding to the P message instructions if P message instructions exist in the N message instructions and conform to a preset rule, where each preset asynchronous message instruction may carry a push message, and P is a positive integer less than or equal to N;
and the pushing unit is used for pushing Q pieces of pushing information corresponding to the Q pieces of preset asynchronous message instructions to a front-end page if Q pieces of preset asynchronous message instructions in the P pieces of preset asynchronous message instructions are triggered, wherein Q is a positive integer less than or equal to P.
A third aspect of the embodiments of the present application provides a server, the server including a processor, an input device, an output device, and a memory, the processor, the input device, the output device, and the memory being connected to each other, wherein the memory is configured to store a computer program, the computer program including program instructions, the processor being configured to invoke the program instructions to perform the method according to the first aspect of the embodiments of the present application.
A fourth aspect of the embodiments of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program for electronic data exchange, wherein the computer program causes a computer to perform part or all of the steps described in the first aspect of the embodiments of the present application.
A fifth aspect of the embodiments of the present application provides a computer program product, wherein the computer program product comprises a non-transitory computer readable storage medium storing a computer program operable to cause a computer to perform some or all of the steps described in the first aspect of the embodiments of the present application. The computer program product may be a software installation package.
The implementation of the embodiment of the application has at least the following beneficial effects:
according to the embodiment of the application, the method and the device are applied to a server, M interfaces can be monitored synchronously in a preset time period, N message instructions corresponding to the M interfaces are acquired, M is a positive integer, N is a positive integer smaller than or equal to M, whether the N message instructions accord with preset rules is judged, if P message instructions accord with the preset rules in the N message instructions, P preset asynchronous message instructions are stored corresponding to the P interfaces corresponding to the P message instructions, each preset asynchronous message instruction can carry push information, P is a positive integer smaller than or equal to N, Q push information corresponding to the Q preset asynchronous message instructions is pushed to a front page if Q preset asynchronous message instructions are triggered in the P preset asynchronous message instructions, Q is a positive integer smaller than or equal to P, and therefore, a plurality of interfaces can be adopted to asynchronously push a plurality of push information to the front page so as to avoid the occurrence of a blocking phenomenon of the front page, and the user experience is facilitated to be improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic flow chart of an information pushing method according to an embodiment of the present application;
fig. 2 is a schematic flow chart of an information pushing method according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a server according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of an information pushing device according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
The terms first, second and the like in the description and in the claims of the present application and in the above-described figures, are used for distinguishing between different objects and not for describing a particular sequential order. Furthermore, the terms "comprise" and "have," as well as any variations thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those listed steps or elements but may include other steps or elements not listed or inherent to such process, method, article, or apparatus.
Reference in the specification to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least one embodiment of the application. The appearances of such phrases in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those of skill in the art will explicitly and implicitly understand that the embodiments described herein may be combined with other embodiments.
In order to better understand the embodiments of the present application, a method for applying the embodiments of the present application will be described below.
The servers referred to in the embodiments of the present application may include, but are not limited to, a background server, a component server, a cloud server, an information push system server, an information push software server, and the like, which are merely examples, but are not exhaustive, including but not limited to the above devices.
Referring to fig. 1, fig. 1 is a flow chart of an information pushing method provided in an embodiment of the present application, applied to a server, where the method includes the following steps:
101. synchronously monitoring M interfaces in a preset time period, and acquiring N message instructions corresponding to the M interfaces, wherein M is a positive integer, and N is a positive integer smaller than or equal to M;
the preset time period may be set by a user or default by a system, the message instruction may be set by the user or default by the system, and the message instruction may include at least one of the following: login instructions, click event instructions, access instructions, attention instructions, etc., not limited herein; the interface may include at least one of: attention interface, login interface, click event interface, access interface, logout interface, etc., are not limited herein.
In addition, the interfaces with different functions can be the same or different interfaces, the interfaces can correspond to the front-end page, different operations performed by the user at the front end can trigger different or the same interfaces, the interfaces can feed back different push information, and when the user triggers the message instructions through the front end, the server can monitor the M interfaces in a synchronous mode to acquire M message instructions corresponding to the M interfaces.
102. Judging whether the N message instructions accord with a preset rule or not;
for example, if the N message instructions are advertisement pulling instructions, if the corresponding preset rule is that the user triggers the login operation corresponding to the front end once, the server pops up the advertisement information, which may cause the user to feel bad, so after the message instruction is triggered, whether the message instruction accords with the preset rule can be determined.
Optionally, the step 102 of determining whether the N message instructions meet a preset rule may include the following steps:
21. acquiring N operation levels corresponding to the N message instructions, wherein each message instruction corresponds to one operation level;
22. judging an operation level i corresponding to any message instruction i in the N message instructions according to the N operation levels;
23. if the operation level i is smaller than a preset operation level, determining that the message instruction i accords with the preset rule;
24. and if the operation level i is greater than or equal to the preset operation level, determining that the message instruction i does not accord with the preset rule.
The preset operation level may be set by the user or default by the system, and multiple operation levels may be preset in the server, where each operation level corresponds to at least one message instruction, and each message instruction corresponds to one operation level, that is, the multiple (N) message instructions may correspond to the same operation level or different operation levels.
Specifically, the operation level i corresponding to any message instruction i in the N operation levels is judged, if the operation level i is smaller than the preset operation level, it is determined that the operation level i accords with the preset rule, otherwise, if the operation level i does not accord with the preset rule, N instruction messages which accord with the preset rule can be obtained, the server can preset five operation levels, wherein the first-level operation level and the second-level operation level correspond to safety operations, more than three-level operations are illegal operations, for example, access operations can be preset to three-level operations, and if the instruction corresponding to the message instruction is the access instruction, the instruction does not accord with the preset rule.
103. If P message instructions in the N message instructions accord with a preset rule, correspondingly storing P preset asynchronous message instructions to P interfaces corresponding to the P message instructions, wherein each preset asynchronous message instruction can carry push information, and P is a positive integer less than or equal to N;
Wherein, since at least one message instruction may exist in the N message instructions to satisfy the preset rule, P message instructions satisfying the preset rule may be obtained, the push information may be set by the user or default by the system, the push information may be understood as a message to be pushed to the user, and the preset asynchronous message instruction may include at least one of the following: the preset asynchronous message instruction may be used to inform the user that the corresponding call interface reads the push information.
Specifically, the server may push the push information through different interfaces, each interface may push different push information, because the push time or push content of the push message corresponding to each interface is different, each message instruction does not need to be responded by the server (the push message corresponding to the preset asynchronous message instruction), so P is a positive integer less than or equal to N, the server may store Q preset asynchronous message instructions corresponding to the interfaces corresponding to the P message instructions, and may push Q push messages to the P interfaces through Q preset asynchronous message instructions; the preset asynchronous message instruction can be set by a user or default by the system, the push message can be pushed based on the long-connection message through the preset asynchronous message instruction, and at the moment, the corresponding interface is not required to be monitored synchronously, so that the response speed can be improved.
104. If Q preset asynchronous message instructions in the P preset asynchronous message instructions are triggered, pushing Q push information corresponding to the Q preset asynchronous message instructions to a front-end page, wherein Q is a positive integer smaller than or equal to P.
Wherein, because not every preset asynchronous message instruction is triggered in the preset time period, Q triggered preset asynchronous message instructions in P preset asynchronous message instructions can be selected, and then Q push messages can be pushed to the P interfaces through the Q preset asynchronous message instructions; the preset asynchronous message instruction can be set by a user or default by a system, and the push message can be pushed to the front page based on the long-connection message by the preset asynchronous message instruction, so that the push of the asynchronous message based on the front and back ends is completed.
In addition, the push information may be advertisement information, recommended shopping information, recommended user, etc., which is not limited herein; when pushing a plurality of push messages, if a plurality of push messages are extracted from a database, the whole pushing process is delayed, and the efficiency is low, so that if P message instructions exist in N message instructions and accord with a preset rule, the P push messages can be stored in P cache queues corresponding to the P interfaces in advance, and if the P interfaces are triggered, the P push messages can be directly obtained from the P cache queues and pushed to the front end.
Optionally, in step 104, pushing Q pieces of push information corresponding to the Q preset asynchronous message instructions to the front-end page may include the following steps:
411. acquiring Q configuration tools corresponding to Q preset H5 pages corresponding to the Q push messages;
412. pushing the Q preset H5 pages to the front-end pages corresponding to the Q pushing messages according to the Q configuration tools.
When the data amount corresponding to the push information to be pushed is relatively large, the preset asynchronous message instruction can carry limited data amount, so that H5 page pushing can be directly performed at the moment, and when H5 page pushing is adopted, compatibility of a back-end version is not needed to be considered, and because H5 is also a back-end generated version, H5 can be used for representing data of any style.
Specifically, the server may preset H5 pages, each H5 page may correspond to a configuration tool, and the configuration tool may be understood as a software development kit (Software Development Kit, SDK), where the SDK is generally a set of development tools when some software engineer specific software packages, software frameworks, hardware platforms, operating systems, and the like build application software, so that Q preset H5 pages may be directly pushed to the front end through Q SDKs, and need not be pushed by a preset message instruction, so as to prevent loss of information pushing or failure of pushing, so that response speed of the server may be improved, and front end pressure may be reduced.
Optionally, in step 104, if the Q pieces of push information correspond to Q front-end pages, pushing Q pieces of push information corresponding to the Q preset asynchronous message instructions to the Q front-end pages may further include the following steps:
421. determining page types of the Q push messages corresponding to the Q front-end pages to obtain Q page types corresponding to the Q front-end pages, wherein each front-end page corresponds to one page type;
422. selecting R target page types meeting a preset type from the Q page types, wherein R is a positive integer smaller than or equal to Q;
423. and pushing R pieces of pushing information corresponding to the R target page types according to the R target page types.
The page type or the preset type of the front-end page may refer to a scene type corresponding to the current front end of the user, and the preset type or the page type may include at least one of the following: game type, chat type, video type, voice type, etc., without limitation; because the requirements of users for pushing information are different in different scenes, different pushing information can be selected according to the scenes of different front-end webpages; for example, game related push information may be pushed for a front end page of a game type, and so on.
Optionally, in step 423, according to the R target page types, pushing R pieces of pushing information corresponding to the R target page types may include the following steps:
a1, R pushing times corresponding to the R target page types and R pushing information types corresponding to the R pushing information are obtained;
a2, R first weights corresponding to the R pushing times and R second weights corresponding to the R pushing information types are obtained;
a3, evaluating the R pushing information according to the R pushing times, the R pushing information types, the R first weights and the R second weights to obtain R evaluation values;
a4, determining R pushing sequences corresponding to the R pushing information according to the R evaluation values;
a5, pushing the R pushing information to the R front-end pages according to the R pushing sequences.
In the case of a game, if the user is playing a sound dribbling game, the user experience is not high if the user receives the push information, so that the weight can be preset for different push information according to the push time and the push type for more humanization, and the higher the weight is, the more urgent the push information is indicated.
Specifically, different push times may be set for different web page types, different first weights may be set for different push times, for example, for a game type, the push time may be set to be one game end, the first weight is 0.7, for a web page browsing type, the push time may be set to be the current time, the first weight corresponds to 0.3, in addition, for different preset second weights of a push information type, the higher the second weight is, the more urgent the push information is represented, for example, if the push information is user taking flight information, the second weight may be preset to be the highest, if the push information is weather information, the second weight corresponding to the push information may be set to be smaller than the second weight corresponding to the user taking flight information, so that R push times, R push information types, R first weights and R second weights may be weighted to obtain R evaluation values corresponding to R push information, and the more urgent the higher the evaluation values may be determined based on the R evaluation values, and the R push information may be determined to be the R push order according to the R push order.
Optionally, after step 423, after pushing R pieces of push information corresponding to the R target page types according to the R target page types, the method may further include the following steps:
b1, acquiring a preset pushing strategy corresponding to the preset type;
and B2, pushing the R pieces of push information to R front-end pages according to the preset push strategy.
Because the page types of different front-end pages are different, different preset pushing strategies can be set according to different preset types or page types, R pieces of pushing information can be pushed to interfaces meeting pushing rules, for example, pushing information can be sent in a suspending mode according to the page types corresponding to games or video scenes, and pushing of the pushing information is carried out when a user finishes the scenes.
Optionally, in the step B2, pushing the R pieces of push information to R front-end pages according to the preset push policy may include the following steps:
b21, acquiring trigger time of R corresponding to the R preset asynchronous message instructions;
b22, sequencing the R push information based on the R trigger times to generate a time sequence;
and B23, pushing the R pieces of push information to the R front-end pages according to the time sequence.
Because the time for the user to read the push information is different, the trigger time can be preset according to different preset asynchronous message instructions, when the trigger time is consumed, the push information can be sent to the corresponding front end, specifically, the R push information can be ordered based on the R trigger times, a time sequence is generated, and the R push information is pushed to the R front end pages through the R interfaces according to the sequence of the time sequence.
It can be seen that the information pushing method described in the embodiments of the present application is applied to a server, and the method includes: and synchronously monitoring M interfaces in a preset time period to acquire N message instructions corresponding to the triggering M interfaces, wherein M is a positive integer, N is a positive integer smaller than or equal to M, judging whether the N message instructions meet a preset rule, if P message instructions in the N message instructions meet the preset rule, correspondingly storing P preset asynchronous message instructions to P interfaces corresponding to the P message instructions, wherein each preset asynchronous message instruction can carry push information, P is a positive integer smaller than or equal to N, and if Q preset asynchronous message instructions in the P preset asynchronous message instructions are triggered, pushing Q push information corresponding to the Q preset asynchronous message instructions to a front page, wherein Q is a positive integer smaller than or equal to P, so that the P interfaces can be adopted to asynchronously push the plurality of push information to the front page, thereby avoiding the occurrence of a clamping phenomenon of the front page and being beneficial to improving user experience.
In accordance with the foregoing, referring to fig. 2, fig. 2 is a flowchart illustrating an information pushing method disclosed in an embodiment of the present application, applied to a server, the information pushing method may include the following steps:
201. and synchronously monitoring M interfaces in a preset time period, and acquiring N message instructions corresponding to the M interfaces, wherein M is a positive integer, and N is a positive integer smaller than or equal to M.
202. And judging whether the N message instructions accord with a preset rule or not.
203. If P message instructions in the N message instructions accord with a preset rule, P preset asynchronous message instructions are correspondingly stored to P interfaces corresponding to the P message instructions, wherein each preset asynchronous message instruction can carry push information, and P is a positive integer less than or equal to N.
204. If Q preset asynchronous message instructions in the P preset asynchronous message instructions are triggered and the Q push messages correspond to Q front-end pages, determining page types of the Q push messages corresponding to the Q front-end pages to obtain Q page types corresponding to the Q front-end pages, wherein each front-end page corresponds to one page type.
205. And selecting R target page types meeting a preset type from the Q page types, wherein R is a positive integer smaller than or equal to Q.
206. And pushing R pieces of pushing information corresponding to the R target page types according to the R target page types.
The specific description of the steps 201 to 206 may refer to the corresponding steps of the data processing method described in fig. 1, and will not be repeated herein.
It can be seen that, in the information pushing method described in the embodiment of the present application, M interfaces are monitored synchronously in a preset time period, N message instructions corresponding to the M interfaces are obtained, where M is a positive integer, N is a positive integer smaller than or equal to M, it is determined whether the N message instructions conform to a preset rule, if P message instructions conform to the preset rule, P preset asynchronous message instructions are stored corresponding to the P interfaces corresponding to the P message instructions, where each preset asynchronous message instruction may carry a piece of pushing information, P is a positive integer smaller than or equal to N, if Q preset asynchronous message instructions are triggered in the P preset asynchronous message instructions, and Q pieces of pushing information correspond to Q front-end pages, then Q pieces of page types corresponding to Q front-end pages are determined, Q pieces of page types corresponding to Q front-end pages are obtained, if P message instructions conform to the preset rule, then P pieces of target page types corresponding to the P pieces of message instructions are selected, P pieces of pushing information corresponding to Q pieces of target page types satisfying the preset types are stored, P is a positive integer smaller than or equal to, P pieces of target page types corresponding to Q pieces of target page types are provided, and when Q pieces of pushing information are required to be pushed to multiple pieces of target page types, and multiple pieces of target page types are required to be pushed, and when the user experience is improved.
In line with the foregoing, referring to fig. 3, fig. 3 is a schematic structural diagram of a server provided in an embodiment of the present application, as shown in fig. 3, including a processor, a communication interface, a memory, and one or more programs, where the processor, the communication interface, and the memory are connected to each other, and the memory is configured to store a computer program, the computer program includes program instructions, the processor is configured to call the program instructions, and the one or more program programs include instructions for performing the following steps:
synchronously monitoring M interfaces in a preset time period, and acquiring N message instructions corresponding to the M interfaces, wherein M is a positive integer, and N is a positive integer smaller than or equal to M;
judging whether the N message instructions accord with a preset rule or not;
if P message instructions in the N message instructions accord with a preset rule, correspondingly storing P preset asynchronous message instructions to P interfaces corresponding to the P message instructions, wherein each preset asynchronous message instruction can carry push information, and P is a positive integer less than or equal to N;
if Q preset asynchronous message instructions in the P preset asynchronous message instructions are triggered, pushing Q push information corresponding to the Q preset asynchronous message instructions to a front-end page, wherein Q is a positive integer smaller than or equal to P.
It can be seen that, in the server described in the embodiments of the present application, M interfaces may be monitored synchronously in a preset time period, N message instructions corresponding to the M interfaces are acquired, where M is a positive integer, N is a positive integer less than or equal to M, it is determined whether the N message instructions conform to a preset rule, if P message instructions conform to the preset rule in the N message instructions, P preset asynchronous message instructions are stored corresponding to P interfaces corresponding to the P message instructions, where each preset asynchronous message instruction may carry a push message, P is a positive integer less than or equal to N, if Q preset asynchronous message instructions in the P preset asynchronous message instructions are triggered, Q push messages corresponding to Q preset asynchronous message instructions are pushed to a front page, where Q is a positive integer less than or equal to P, so that multiple interfaces may be adopted to asynchronously push multiple push messages to the front page, so as to avoid the occurrence of a blocking phenomenon of the front page, and facilitate improving user experience.
In one possible example, in the determining whether the N message instructions meet a preset rule, the instructions in the program are specifically configured to:
Acquiring N operation levels corresponding to the N message instructions, wherein each message instruction corresponds to one operation level;
judging an operation level i corresponding to any message instruction i in the N message instructions according to the N operation levels;
if the operation level i is smaller than a preset operation level, determining that the message instruction i accords with the preset rule;
and if the operation level i is greater than or equal to the preset operation level, determining that the message instruction i does not accord with the preset rule.
In one possible example, in the aspect of pushing Q pieces of push information corresponding to the Q pieces of preset asynchronous message instructions to a front page, the instructions in the program are specifically configured to perform the following operations:
acquiring Q configuration tools corresponding to Q preset H5 pages corresponding to the Q push messages;
pushing the Q preset H5 pages to the front-end pages corresponding to the Q pushing messages according to the Q configuration tools.
In one possible example, if the Q pieces of push information correspond to Q front-end pages, in the aspect of pushing the Q pieces of push information corresponding to the Q pieces of preset asynchronous message instructions to the front-end pages, the instructions in the program are specifically configured to perform the following operations:
Determining page types of the Q push messages corresponding to the Q front-end pages to obtain Q page types corresponding to the Q front-end pages, wherein each front-end page corresponds to one page type;
selecting R target page types meeting a preset type from the Q page types, wherein R is a positive integer smaller than or equal to Q;
and pushing R pieces of pushing information corresponding to the R target page types according to the R target page types.
In one possible example, in terms of pushing R pieces of push information corresponding to the R target page types according to the R target page types, the instructions in the program are specifically configured to perform the following operations:
acquiring R pushing times corresponding to the R target page types and R pushing information types corresponding to the R pushing information;
acquiring R first weights corresponding to the R pushing times and R second weights corresponding to the R pushing information types;
evaluating the R push information according to the R push times, the R push information types, the R first weights and the R second weights to obtain R evaluation values;
according to the R evaluation values, R pushing sequences corresponding to the R pushing information are determined;
And pushing the R push information to the R front-end pages according to the R push sequences.
In one possible example, after the selecting R target page types satisfying a preset type from the Q page types, the instructions in the program are specifically configured to:
acquiring a preset pushing strategy corresponding to the preset type;
and pushing the R pieces of push information to R front-end pages according to the preset push strategy.
In one possible example, in the aspect of pushing the R pieces of push information to R front-end pages according to the preset pushing policy, the instructions in the program are specifically configured to perform the following operations:
acquiring R triggering times corresponding to the R preset asynchronous message instructions;
sequencing the R push information based on the R trigger times to generate a time sequence;
and pushing the R pieces of push information to the R front-end pages according to the time sequence.
The foregoing description of the embodiments of the present application has been presented primarily in terms of a method-side implementation. It will be appreciated that the server, in order to implement the above-described functions, includes corresponding hardware structures and/or software modules that perform the respective functions. Those of skill in the art will readily appreciate that the elements and algorithm steps described in connection with the embodiments disclosed herein may be embodied as hardware or a combination of hardware and computer software. Whether a function is implemented as hardware or computer software driven hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The embodiment of the application may divide the functional units of the server according to the above method example, for example, each functional unit may be divided corresponding to each function, or two or more functions may be integrated in one processing unit. The integrated units may be implemented in hardware or in software functional units. It should be noted that, in the embodiment of the present application, the division of the units is schematic, which is merely a logic function division, and other division manners may be implemented in actual practice.
In accordance with the foregoing, referring to fig. 4, fig. 4 is a schematic structural diagram of an information pushing device disclosed in an embodiment of the present application, applied to a server, where the device includes: a listening unit 401, a judging unit 402, a storing unit 403 and a pushing unit 404, wherein,
the monitoring unit 401 is configured to monitor M interfaces synchronously in a preset time period, and obtain N message instructions corresponding to the M interfaces, where M is a positive integer, and N is a positive integer less than or equal to M;
the judging unit 402 is configured to judge whether the N message instructions conform to a preset rule;
the storage unit 403 is configured to store P preset asynchronous message instructions corresponding to P interfaces corresponding to the P message instructions if P message instructions conform to a preset rule, where each preset asynchronous message instruction may carry a push message, and P is a positive integer less than or equal to N;
The pushing unit 404 is configured to, if Q preset asynchronous message instructions in the P preset asynchronous message instructions are triggered, push Q pushing information corresponding to the Q preset asynchronous message instructions to a front page, where Q is a positive integer less than or equal to P.
It can be seen that, the information pushing device described in the embodiments of the present application is applied to a server, and the device may monitor M interfaces in a preset time period synchronously, obtain N message instructions corresponding to the triggering M interfaces, where M is a positive integer, N is a positive integer less than or equal to M, determine whether the N message instructions conform to a preset rule, if P message instructions exist in the N message instructions, store P preset asynchronous message instructions corresponding to P interfaces corresponding to the P message instructions, where each preset asynchronous message instruction may carry one push message, P is a positive integer less than or equal to N, and if Q preset asynchronous message instructions in the P preset asynchronous message instructions are triggered, push Q push messages corresponding to Q preset asynchronous message instructions to a front page, where Q is a positive integer less than or equal to P, so that multiple interfaces may be used to asynchronously push multiple push messages to the front page, thereby avoiding the occurrence of a blocking phenomenon of the front page, and being beneficial to improving user experience.
In one possible example, in the aspect of determining whether the N message instructions meet a preset rule, the determining unit 402 is specifically configured to:
acquiring N operation levels corresponding to the N message instructions, wherein each message instruction corresponds to one operation level;
judging an operation level i corresponding to any message instruction i in the N message instructions according to the N operation levels;
if the operation level i is smaller than a preset operation level, determining that the message instruction i accords with the preset rule;
and if the operation level i is greater than or equal to the preset operation level, determining that the message instruction i does not accord with the preset rule.
In one possible example, in terms of pushing Q pieces of push information corresponding to the Q preset asynchronous message instructions to a front page, the pushing unit 404 is specifically configured to:
acquiring Q configuration tools corresponding to Q preset H5 pages corresponding to the Q push messages;
pushing the Q preset H5 pages to the front-end pages corresponding to the Q pushing messages according to the Q configuration tools.
In a possible example, if the Q pieces of push information correspond to Q front-end pages, in the aspect of pushing the Q pieces of push information corresponding to the Q preset asynchronous message instructions to the front-end pages, the pushing unit 404 is specifically configured to:
Determining page types of the Q push messages corresponding to the Q front-end pages to obtain Q page types corresponding to the Q front-end pages, wherein each front-end page corresponds to one page type;
selecting R target page types meeting a preset type from the Q page types, wherein R is a positive integer smaller than or equal to Q;
and pushing R pieces of pushing information corresponding to the R target page types according to the R target page types.
In one possible example, in pushing R pieces of push information corresponding to the R target page types according to the R target page types, the pushing unit 404 is specifically configured to:
acquiring R pushing times corresponding to the R target page types and R pushing information types corresponding to the R pushing information;
acquiring R first weights corresponding to the R pushing times and R second weights corresponding to the R pushing information types;
evaluating the R push information according to the R push times, the R push information types, the R first weights and the R second weights to obtain R evaluation values;
according to the R evaluation values, R pushing sequences corresponding to the R pushing information are determined;
And pushing the R push information to the R front-end pages according to the R push sequences.
The embodiment of the application also provides a computer readable storage medium, wherein the computer readable storage medium stores a computer program for electronic data exchange, and the computer program causes a computer to execute part or all of the steps of any one of the information pushing methods described in the embodiment of the method.
Embodiments of the present application also provide a computer program product comprising a non-transitory computer-readable storage medium storing a computer program operable to cause a computer to perform part or all of the steps of any one of the information pushing methods as described in the method embodiments above.
It should be noted that, for simplicity of description, the foregoing method embodiments are all expressed as a series of action combinations, but it should be understood by those skilled in the art that the present application is not limited by the order of actions described, as some steps may be performed in other order or simultaneously in accordance with the present application. Further, those skilled in the art will also appreciate that the embodiments described in the specification are all preferred embodiments, and that the acts and modules referred to are not necessarily required in the present application.
In the foregoing embodiments, the descriptions of the embodiments are emphasized, and for parts of one embodiment that are not described in detail, reference may be made to related descriptions of other embodiments.
In the several embodiments provided in this application, it should be understood that the disclosed apparatus may be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative, such as the division of the units, merely a logical function division, and there may be additional manners of dividing the actual implementation, such as multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, or may be in electrical or other forms.
The units described as separate units may or may not be physically separate, and units shown 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 may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units described above may be implemented either in hardware or in software program modules.
The integrated units, if implemented in the form of software program modules, may be stored in a computer-readable memory for sale or use as a stand-alone product. Based on such understanding, the technical solution of the present application may be embodied in essence or a part contributing to the prior art or all or part of the technical solution in the form of a software product stored in a memory, including several instructions for causing a computer device (which may be a personal computer, a server or a network device, etc.) to perform all or part of the steps of the method described in the embodiments of the present application. And the aforementioned memory includes: a U-disk, a read-only memory (ROM), a random access memory (random access memory, RAM), a removable hard disk, a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Those of ordinary skill in the art will appreciate that all or a portion of the steps in the various methods of the above embodiments may be implemented by a program that instructs associated hardware, and the program may be stored in a computer readable memory, which may include: flash disk, ROM, RAM, magnetic or optical disk, etc.
The foregoing has outlined rather broadly the more detailed description of embodiments of the present application, wherein specific examples are provided herein to illustrate the principles and embodiments of the present application, the above examples being provided solely to assist in the understanding of the methods of the present application and the core ideas thereof; meanwhile, as those skilled in the art will have modifications in the specific embodiments and application scope in accordance with the ideas of the present application, the present description should not be construed as limiting the present application in view of the above.
Claims (10)
1. An information pushing method, which is applied to a server, comprises the following steps:
synchronously monitoring M interfaces in a preset time period, and acquiring N message instructions corresponding to the M interfaces, wherein M is a positive integer, and N is a positive integer smaller than or equal to M;
judging whether the N message instructions accord with a preset rule or not;
if P message instructions in the N message instructions accord with a preset rule, correspondingly storing P preset asynchronous message instructions to P interfaces corresponding to the P message instructions, wherein each preset asynchronous message instruction can carry push information, and P is a positive integer less than or equal to N;
If Q preset asynchronous message instructions in the P preset asynchronous message instructions are triggered, pushing Q push information corresponding to the Q preset asynchronous message instructions to a front-end page, wherein Q is a positive integer smaller than or equal to P.
2. The method of claim 1, wherein determining whether the N message instructions meet a preset rule comprises:
acquiring N operation levels corresponding to the N message instructions, wherein each message instruction corresponds to one operation level;
judging an operation level i corresponding to any message instruction i in the N message instructions according to the N operation levels;
if the operation level i is smaller than a preset operation level, determining that the message instruction i accords with the preset rule;
and if the operation level i is greater than or equal to the preset operation level, determining that the message instruction i does not accord with the preset rule.
3. The method of claim 1, wherein pushing Q pieces of push information corresponding to the Q preset asynchronous message instructions to a front page includes:
acquiring Q configuration tools corresponding to Q preset H5 pages corresponding to the Q push information;
pushing the Q preset H5 pages to the front-end pages corresponding to the Q pushing information according to the Q configuration tools.
4. The method of claim 1, wherein if the Q pieces of push information correspond to Q front-end pages, the pushing Q pieces of push information corresponding to the Q preset asynchronous message instructions to the front-end pages, the method further comprises:
determining the page types of the Q front-end pages corresponding to the Q push information to obtain Q page types corresponding to the Q front-end pages, wherein each front-end page corresponds to one page type;
selecting R target page types meeting a preset type from the Q page types, wherein R is a positive integer smaller than or equal to Q;
and pushing R pieces of pushing information corresponding to the R target page types according to the R target page types.
5. The method of claim 4, wherein pushing R pieces of push information corresponding to the R target page types according to the R target page types includes:
acquiring R pushing times corresponding to the R target page types and R pushing information types corresponding to the R pushing information;
acquiring R first weights corresponding to the R pushing times and R second weights corresponding to the R pushing information types;
Evaluating the R push information according to the R push times, the R push information types, the R first weights and the R second weights to obtain R evaluation values;
according to the R evaluation values, R pushing sequences corresponding to the R pushing information are determined;
and pushing the R pushing information to R front-end pages according to the R pushing sequences.
6. The method of claim 4, wherein after said selecting R target page types from said Q page types that satisfy a preset type, the method further comprises:
acquiring a preset pushing strategy corresponding to the preset type;
and pushing the R pieces of push information to R front-end pages according to the preset push strategy.
7. The method of claim 6, wherein pushing the R pieces of push information to R front-end pages according to the preset push policy comprises:
acquiring R triggering times corresponding to the R preset asynchronous message instructions;
sequencing the R push information based on the R trigger times to generate a time sequence;
and pushing the R pieces of push information to the R front-end pages according to the time sequence.
8. An information pushing apparatus, applied to a server, comprising: the device comprises a monitoring unit, a judging unit, a storage unit and a pushing unit, wherein,
the monitoring unit is used for synchronously monitoring M interfaces within a preset time period, and acquiring N message instructions corresponding to the M interfaces, wherein M is a positive integer, and N is a positive integer smaller than or equal to M;
the judging unit is used for judging whether the N message instructions accord with a preset rule or not;
the storage unit is configured to store P preset asynchronous message instructions corresponding to P interfaces corresponding to the P message instructions if P message instructions exist in the N message instructions and conform to a preset rule, where each preset asynchronous message instruction may carry a push message, and P is a positive integer less than or equal to N;
and the pushing unit is used for pushing Q pieces of pushing information corresponding to the Q pieces of preset asynchronous message instructions to a front-end page if Q pieces of preset asynchronous message instructions in the P pieces of preset asynchronous message instructions are triggered, wherein Q is a positive integer less than or equal to P.
9. A server comprising a processor, an input device, an output device and a memory, the processor, the input device, the output device and the memory being interconnected, wherein the memory is adapted to store a computer program comprising program instructions, the processor being configured to invoke the program instructions to perform the method of any of claims 1-7.
10. A computer readable storage medium, characterized in that the computer readable storage medium stores a computer program comprising program instructions which, when executed by a processor, cause the processor to perform the method of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911365816.3A CN111163152B (en) | 2019-12-26 | 2019-12-26 | Information pushing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911365816.3A CN111163152B (en) | 2019-12-26 | 2019-12-26 | Information pushing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111163152A CN111163152A (en) | 2020-05-15 |
| CN111163152B true CN111163152B (en) | 2023-08-08 |
Family
ID=70558276
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911365816.3A Active CN111163152B (en) | 2019-12-26 | 2019-12-26 | Information pushing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111163152B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111984901A (en) * | 2020-08-31 | 2020-11-24 | 上海博泰悦臻电子设备制造有限公司 | Message pushing method and related product thereof |
| CN112491998B (en) * | 2020-11-18 | 2023-08-08 | 平安消费金融有限公司 | Message pushing method and related equipment |
| CN115277611A (en) * | 2022-07-27 | 2022-11-01 | 招商局金融科技有限公司 | Multi-channel message processing method and device, computer equipment and storage medium |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003077139A1 (en) * | 2001-09-29 | 2003-09-18 | Siebel Systems, Inc. | Asynchronous message push to web browser |
| CA2556862A1 (en) * | 2004-02-27 | 2005-09-09 | Research In Motion Limited | System and method for communicating asynchronously with web services using message set definitions |
| CA2543887A1 (en) * | 2005-04-18 | 2006-10-18 | Research In Motion Limited | System and method for exposing synchronous web services as notification style web services |
| CN101442550A (en) * | 2008-12-19 | 2009-05-27 | 成都市华为赛门铁克科技有限公司 | Method and apparatus for pushing network information |
| CN106161568A (en) * | 2015-04-24 | 2016-11-23 | 腾讯科技（北京）有限公司 | A kind of information processing method, client and server |
| WO2017054582A1 (en) * | 2015-09-30 | 2017-04-06 | 北京金山安全软件有限公司 | Information delivery method, device, and electronic apparatus |
| CN107835235A (en) * | 2017-10-27 | 2018-03-23 | 广东欧珀移动通信有限公司 | Information push method and device |
| WO2018130220A1 (en) * | 2017-01-16 | 2018-07-19 | 广州市动景计算机科技有限公司 | Message pushing method and device, and programmable device |
| WO2018188567A1 (en) * | 2017-04-13 | 2018-10-18 | 腾讯科技（深圳）有限公司 | Server information pushing method and device, terminal information sending method and device, information pushing system and storage medium |
| WO2019062390A1 (en) * | 2017-09-27 | 2019-04-04 | 上海掌门科技有限公司 | Information operating method and device, and medium |
| WO2019076017A1 (en) * | 2017-10-19 | 2019-04-25 | 平安科技（深圳）有限公司 | Feedback information processing method and apparatus, terminal device and medium |
| CN109936621A (en) * | 2019-01-28 | 2019-06-25 | 平安科技（深圳）有限公司 | Multi-page information push method, device, equipment and the storage medium of information security |
| CN110109882A (en) * | 2019-04-02 | 2019-08-09 | 北京大麦地信息技术有限公司 | A kind of method, apparatus, electronic equipment and the server of online collaborative process file |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060047665A1 (en) * | 2001-01-09 | 2006-03-02 | Tim Neil | System and method for simulating an application for subsequent deployment to a device in communication with a transaction server |
-
2019
- 2019-12-26 CN CN201911365816.3A patent/CN111163152B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003077139A1 (en) * | 2001-09-29 | 2003-09-18 | Siebel Systems, Inc. | Asynchronous message push to web browser |
| CA2556862A1 (en) * | 2004-02-27 | 2005-09-09 | Research In Motion Limited | System and method for communicating asynchronously with web services using message set definitions |
| CA2543887A1 (en) * | 2005-04-18 | 2006-10-18 | Research In Motion Limited | System and method for exposing synchronous web services as notification style web services |
| CN101442550A (en) * | 2008-12-19 | 2009-05-27 | 成都市华为赛门铁克科技有限公司 | Method and apparatus for pushing network information |
| CN106161568A (en) * | 2015-04-24 | 2016-11-23 | 腾讯科技（北京）有限公司 | A kind of information processing method, client and server |
| WO2017054582A1 (en) * | 2015-09-30 | 2017-04-06 | 北京金山安全软件有限公司 | Information delivery method, device, and electronic apparatus |
| WO2018130220A1 (en) * | 2017-01-16 | 2018-07-19 | 广州市动景计算机科技有限公司 | Message pushing method and device, and programmable device |
| WO2018188567A1 (en) * | 2017-04-13 | 2018-10-18 | 腾讯科技（深圳）有限公司 | Server information pushing method and device, terminal information sending method and device, information pushing system and storage medium |
| WO2019062390A1 (en) * | 2017-09-27 | 2019-04-04 | 上海掌门科技有限公司 | Information operating method and device, and medium |
| WO2019076017A1 (en) * | 2017-10-19 | 2019-04-25 | 平安科技（深圳）有限公司 | Feedback information processing method and apparatus, terminal device and medium |
| CN107835235A (en) * | 2017-10-27 | 2018-03-23 | 广东欧珀移动通信有限公司 | Information push method and device |
| CN109936621A (en) * | 2019-01-28 | 2019-06-25 | 平安科技（深圳）有限公司 | Multi-page information push method, device, equipment and the storage medium of information security |
| CN110109882A (en) * | 2019-04-02 | 2019-08-09 | 北京大麦地信息技术有限公司 | A kind of method, apparatus, electronic equipment and the server of online collaborative process file |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111163152A (en) | 2020-05-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111163152B (en) | Information pushing method and device | |
| WO2016127818A1 (en) | Information processing method, terminal, and server, and computer storage medium | |
| JP6289662B2 (en) | Information transmitting method and transmitting apparatus | |
| EP3193509A1 (en) | Video advertisement filtering method, device and equipment | |
| CN105025080B (en) | A kind of overload protection method and server of distributed system | |
| JP2011530126A5 (en) | ||
| CN107273182B (en) | Method and system for dynamically expanding virtual machine resources | |
| CN105487987B (en) | A kind of concurrent sequence of processing reads the method and device of IO | |
| CN109597800B (en) | Log distribution method and device | |
| CN110704283A (en) | Method, device and medium for uniformly generating alarm information | |
| CN110933136A (en) | Service node selection method, device, equipment and readable storage medium | |
| US9623331B2 (en) | Method for providing game replay, server for providing game replay, and recording medium storing the same | |
| CN105872608A (en) | Live broadcast page refreshing method and device | |
| CN110708369B (en) | File deployment method and device for equipment nodes, scheduling server and storage medium | |
| US20160080394A1 (en) | Method, apparatus and computer device for scanning information to be scanned | |
| CN111338628A (en) | Component rendering method and device | |
| CN106357557A (en) | Message processing method and device | |
| CN107239272B (en) | Video capture equipment redirection method and device | |
| CN114363704B (en) | Video playing method, device, equipment and storage medium | |
| WO2017028744A1 (en) | Method and device for determining to-be-deployed resources | |
| CN113672757B (en) | Audio playing method and device | |
| CN113742581B (en) | Method and device for generating list, electronic equipment and readable storage medium | |
| CN110221749B (en) | Display method, computing device and storage medium of e-book global player entrance | |
| CN109847341B (en) | Cloud game method and equipment | |
| CN110516043A (en) | Answer generation method and device for question answering 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |