CN111163152A - Information pushing method and device - Google Patents

Information pushing method and device Download PDF

Info

Publication number
CN111163152A
CN111163152A CN201911365816.3A CN201911365816A CN111163152A CN 111163152 A CN111163152 A CN 111163152A CN 201911365816 A CN201911365816 A CN 201911365816A CN 111163152 A CN111163152 A CN 111163152A
Authority
CN
China
Prior art keywords
preset
pushing
pieces
message instructions
push
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.)
Granted
Application number
CN201911365816.3A
Other languages
Chinese (zh)
Other versions
CN111163152B (en
Inventor
文佳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ping An Life Insurance Company of China Ltd
Original Assignee
Ping An Life Insurance Company of China Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Ping An Life Insurance Company of China Ltd filed Critical Ping An Life Insurance Company of China Ltd
Priority to CN201911365816.3A priority Critical patent/CN111163152B/en
Publication of CN111163152A publication Critical patent/CN111163152A/en
Application granted granted Critical
Publication of CN111163152B publication Critical patent/CN111163152B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/02Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
    • H04L67/025Protocols based on web technology, e.g. hypertext transfer protocol [HTTP] for remote control or remote monitoring of applications
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1095Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/55Push-based network services
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Energy 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: the method comprises the steps of synchronously monitoring M interfaces in a preset time period, obtaining N message instructions corresponding to M triggered interfaces, judging whether the N message instructions accord with preset rules or not, if P message instructions in the N message instructions accord with the preset rules, 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 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.

Description

Information pushing method and device
Technical Field
The present application relates to the field of data processing, and in particular, to an information push method and apparatus.
Background
With the development of computing technology, internet products such as various websites and clients enrich the work and life of the public, and bring various conveniences to people. For example, the advent of software APPs (applications) such as panning and microblogging allows users to obtain the most interesting content or to focus on valuable microblog users in a relatively short time. When information is pushed, one interface is adopted to synchronously push a plurality of pieces of pushed information, and the pushed content is too large or the calculation amount of real-time dynamic data is larger, so that the jam of a front-end display page in the APP is caused, and the user experience is poor.
Disclosure of Invention
The embodiment of the application provides an information pushing method and device, so that the phenomenon of front-end page blocking is avoided, and the improvement of user experience is facilitated.
A first aspect of an embodiment of the present application provides an information pushing method, which is applied to a server, and the method includes:
synchronously monitoring M interfaces in a preset time period, and acquiring N message instructions for triggering the M interfaces, wherein M is a positive integer, and N is a positive integer less 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 meet a preset rule, storing P preset asynchronous message instructions to P interfaces corresponding to the P message instructions correspondingly, 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, Q pieces of push information corresponding to the Q preset asynchronous message instructions are pushed to a front-end page, wherein Q is a positive integer smaller than or equal to P.
A second aspect of the embodiments of the present application provides an information pushing apparatus, which is applied to a server, the apparatus includes a monitoring unit, a determining unit, a storage unit, and a pushing unit, wherein:
the monitoring unit is used for synchronously monitoring M interfaces in a preset time period and acquiring N message instructions for triggering 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, if there are P message instructions in the N message instructions that meet a preset rule, correspondingly store P preset asynchronous message instructions to P interfaces corresponding to the P message instructions, where each preset asynchronous message instruction may carry one piece of push information, and P is a positive integer less than or equal to N;
the push unit is configured to push Q pieces of push information corresponding to Q preset asynchronous message instructions to a front-end page if Q preset asynchronous message instructions are triggered in the P preset asynchronous message instructions, where Q is a positive integer less than or equal to P.
A third aspect of embodiments of the present application provides a server, where the server includes a processor, an input device, an output device, and a memory, where the processor, the input device, the output device, and the memory are connected to each other, where the memory is used to store a computer program, and the computer program includes program instructions, and the processor is configured to call the program instructions to execute the method according to the first aspect of embodiments of the present application.
A fourth aspect of embodiments of the present application provides a computer-readable storage medium, where the computer-readable storage medium stores a computer program for electronic data exchange, where the computer program makes a computer perform part or all of the steps as described in the first aspect of embodiments of the present application.
A fifth aspect of 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 as described in the first aspect of embodiments of the present application. The computer program product may be a software installation package.
The embodiment of the application has at least the following beneficial effects:
through the embodiment of the application, the application to a server can monitor M interfaces synchronously in a preset time period, acquire N message instructions for triggering the M interfaces, wherein M is a positive integer and N is a positive integer less than or equal to M, judge whether the N message instructions meet a preset rule, if P message instructions in the N message instructions meet the preset rule, store P preset asynchronous message instructions correspondingly to P interfaces corresponding to the P message instructions, wherein each preset asynchronous message instruction can carry push information, 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, push Q pieces of push information corresponding to the Q preset asynchronous message instructions to a front-end page, wherein Q is a positive integer less than or equal to P, and thus, a plurality of push information can be asynchronously pushed to the front-end page by adopting a plurality of interfaces, the phenomenon of blocking of the front-end page is avoided, and the user experience is improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic flowchart of an information pushing method according to an embodiment of the present application;
fig. 2 is a schematic flowchart 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 apparatus according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The terms "first," "second," and the like in the description and claims of the present application and in the above-described drawings are used for distinguishing between different objects and not for describing a particular order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively 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 can be included in at least one embodiment of the specification. The appearances of the phrase 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. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
In order to better understand the embodiments of the present application, methods of applying the embodiments of the present application will be described below.
The servers mentioned 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, or an information push software server, which are merely examples, and are not exhaustive and include, but are not limited to, the above devices.
Referring to fig. 1, fig. 1 is a schematic flow chart of an information pushing method provided in an embodiment of the present application, and the method is applied to a server, and includes the following steps:
101. synchronously monitoring M interfaces in a preset time period, and acquiring N message instructions for triggering the M interfaces, wherein M is a positive integer, and N is a positive integer less than or equal to M;
the preset time period may be set by a user or default to a system, the message instruction may be set by the user or default to the system, and the message instruction may include at least one of the following: a login instruction, a click event instruction, an access instruction, a focus instruction, etc., which are not limited herein; the interface may include at least one of: an attention interface, a login interface, a click event interface, an access interface, a logout interface, and the like, without limitation.
In addition, the interfaces with different functions may be the same or different interfaces, the interfaces may correspond to the front-end page, different operations performed by the user at the front end may trigger different or the same interfaces, the interfaces may feed back different push information, and after the user triggers the message instruction through the front end, the server may monitor the M interfaces in a synchronous manner to obtain M message instructions that trigger the M interfaces to correspond to each other.
102. Judging whether the N message instructions accord with a preset rule or not;
for example, if the N message instructions are advertisement pull instructions, and if the corresponding preset rule is that the user triggers a login operation corresponding to the front end once, the server pops up advertisement information, which may cause the user to generate a sense of incongruity and poor user experience.
Optionally, in the step 102, determining whether the N message instructions meet the 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. according to the N operation levels, judging an operation level i corresponding to any message instruction i in the N message instructions;
23. if the operation level i is smaller than a preset operation level, determining that the message instruction i conforms to 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 conform to the preset rule.
The preset operation level may be set by a user or default, a plurality of operation levels may be preset in the server, each operation level corresponds to at least one message instruction, and each message instruction corresponds to one operation level, that is, the plurality of (N) message instructions may correspond to the same operation level or different operation levels.
Specifically, an operation level i corresponding to any one message instruction i in the N operation levels is judged, if the operation level i is smaller than a preset operation level, it is determined that the operation level i meets a preset rule, otherwise, if the operation level i does not meet the preset operation level, N instruction messages meeting the preset rule can be obtained, and the server can preset five operation levels, wherein the first-level operation level and the second-level operation level correspond to safe operation, and all the above three-level operations are illegal operations, for example, the access operation can be preset to be three-level operation, and if the instruction corresponding to the message instruction is an access instruction, the instruction does not meet the preset rule.
103. If P message instructions in the N message instructions meet a preset rule, storing P preset asynchronous message instructions to P interfaces corresponding to the P message instructions correspondingly, wherein each preset asynchronous message instruction can carry push information, and P is a positive integer less than or equal to N;
the N message instructions may include at least one message instruction meeting a preset rule, so that P message instructions meeting the preset rule can be obtained, the push information can be set by a user or default, the push information can 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 notify a user of a corresponding call interface to read the push information.
Specifically, the server may push the push information through different interfaces, each interface may push different push information, and because the push time or push content of the push message corresponding to each interface is different and not every message instruction requires the server to give a response (push message corresponding to a preset asynchronous message instruction), P is a positive integer less than or equal to N, the server may store Q preset asynchronous message instructions for the interfaces corresponding to the P message instructions, and may push Q push messages to the P interfaces through the Q preset asynchronous message instructions; the preset asynchronous message instruction can be set by a user or defaulted by a system, the push message can be pushed based on the message of long connection through the preset asynchronous message instruction, at the moment, the corresponding interface does not need to be monitored synchronously, and the response speed can be improved.
104. If Q preset asynchronous message instructions in the P preset asynchronous message instructions are triggered, Q pieces of push information corresponding to the Q preset asynchronous message instructions are pushed to a front-end page, wherein Q is a positive integer smaller than or equal to P.
In a preset time period, not every preset asynchronous message instruction is triggered, so that Q triggered preset asynchronous message instructions in the 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 defaulted by a system, and the push message can be pushed to a front-end page based on the message of long connection through the preset asynchronous message instruction, so that the asynchronous message push based on the front end and the back end is completed.
In addition, the push information may be advertisement information, recommended shopping information, recommended users, or the like, and is not limited herein; when pushing multiple pieces of push information, if multiple pieces of push information are extracted from one database, the whole pushing process is delayed, and low efficiency is caused, so that if P message instructions exist in N message instructions and accord with preset rules, the P push information can be stored in P cache queues corresponding to the P interfaces in advance, and if the P interfaces are triggered, the P push information can be directly obtained from the P cache queues and pushed to the front end.
Optionally, in the step 104, the 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. obtaining Q configuration tools corresponding to Q preset H5 pages corresponding to the Q push messages;
412. and pushing the Q preset H5 pages to the front-end pages corresponding to the Q push messages according to the Q configuration tools.
When the data size corresponding to the push information to be pushed is large, the data size which can be carried by the preset asynchronous message instruction is limited, so that the push can be directly performed through an H5 page at the moment, the compatibility of a back-end version does not need to be considered when H5 page push is adopted, and H5 can be used for representing data of any style because H5 is also a back-end generation version.
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 (SDK), where the SDK is generally a set of Development tools used when some Software engineers specify a Software package, a Software framework, a hardware platform, an operating system, and the like to establish application Software, and therefore, the Q preset H5 pages may be directly pushed to the front end through the Q SDKs without being pushed by a preset message instruction, so as to prevent the lack of information volume pushing or failure in pushing, and thus, the response speed of the server may be increased, and the pressure at the front end may be reduced.
Optionally, in step 104, if the Q pieces of push information correspond to Q front-end pages, the step of 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 less 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 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 page type may include at least one of the following types: game types, chat types, video types, voice types, and the like, without limitation; because the requirements of the user for pushing information are different in different scenes, different pieces of pushing information can be selected according to different scenes of the front-end webpage; for example, game-related push information may be pushed for the front end page of the game type, and so on.
Optionally, in the step 423, pushing R pieces of pushing information corresponding to the R target page types according to the R target page types may include the following steps:
a1, acquiring R push times corresponding to the R target page types and R push information types corresponding to the R push information;
a2, acquiring R first weights corresponding to the R push times and R second weights corresponding to the R push information types;
a3, evaluating the R pieces of push information according to the R pieces of push time, the R pieces of push information types, the R pieces of first weight and the R pieces of second weight to obtain R pieces of evaluation values;
a4, determining R pushing orders corresponding to the R pieces of pushing information according to the R evaluation values;
and A5, pushing the R pieces of pushing information to the R front-end pages according to the R pieces of pushing sequences.
In the present invention, the weight of the pushed information is preset according to the pushing time and the pushing type for more humanization, and the higher the weight is, the more urgent the pushed information is represented.
Specifically, different pushing times can be set for different types of web pages, different first weights can be set for different pushing times, for example, the pushing time can be set as one game end for a game type, the first weight is 0.7, the pushing time can be set as the current time for a web page browsing type, the first weight corresponds to 0.3, in addition, different second weights can be preset for different types of pushing information, the higher the second weight is, the more urgent it is, for example, if the pushing information is flight information taken by a user, the second weight can be preset to be the highest, if the pushing information is weather information, the second weight corresponding to the pushing information can be set to be smaller than the second weight corresponding to the flight information taken by the user, so that R pushing times, R pushing information types, R first weights and R second weights can be weighted, r evaluation values corresponding to R pieces of push information are obtained, the higher the evaluation value is, the more urgent the evaluation value is, R push orders corresponding to R pieces of push information may be determined based on the magnitude order of the R evaluation values, and the R pieces of push information are pushed to the R front-end pages according to the R push orders, so that user experience may be improved.
Optionally, after the step 423 is performed, after R pieces of push information corresponding to the R target page types are pushed according to the R target page types, the method may further include the following step:
b1, acquiring a preset pushing strategy corresponding to the preset type;
and B2, pushing the R pieces of pushing information to R front-end pages according to the preset pushing strategy.
The different types of the front-end pages are different, so that different preset push strategies can be set for different preset types or page types, R pieces of push information can be pushed to the interfaces meeting the push rules, for example, the push information can be sent temporarily for the page type corresponding to a game or video scene, and when the user finishes the scene, the push information is pushed again.
Optionally, in the step B2, the 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 R trigger times corresponding to the R preset asynchronous message instructions;
b22, sorting the R pieces of push information based on the R pieces of trigger time to generate a time sequence;
and B23, pushing the R pieces of pushing information to the R front-end pages according to the time sequence.
The time for reading the push information by the user is different, so that the trigger time can be preset for different preset asynchronous message instructions, when the trigger time is consumed, the push information can be sent to the front end corresponding to the trigger time, specifically, R pieces of push information can be sorted based on the R pieces of trigger time to generate a time sequence, and the R pieces of push information are pushed to R front end pages through R pieces of interfaces according to the sequence of the time sequence.
It can be seen that, the information pushing method described in this embodiment of the present application is applied to a server, and the method includes: the method comprises the steps of synchronously monitoring M interfaces in a preset time period, obtaining N message instructions corresponding to 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, 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, and therefore, asynchronously pushing a plurality of push information to the front-end page by adopting a plurality of interfaces, the phenomenon of blocking of the front-end page is avoided, and the user experience is improved.
In accordance with the above, please refer to fig. 2, fig. 2 is a flowchart illustrating an information pushing method disclosed in an embodiment of the present application, and the information pushing method is applied to a server, and the information pushing method may include the following steps:
201. the method comprises the steps of synchronously monitoring M interfaces in a preset time period, and obtaining N message instructions for triggering 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 meet a preset rule, storing P preset asynchronous message instructions to P interfaces corresponding to the P message instructions correspondingly, wherein each preset asynchronous message instruction can carry push information, and P is a positive integer smaller 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 the page types of the Q push messages corresponding to the Q front-end pages to obtain the 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 less 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 corresponding steps of the data processing method described in fig. 1, and will not be described herein again.
It can be seen that, in the information push method described in this embodiment of the present application, M interfaces are synchronously monitored within a preset time period, N message instructions corresponding to the triggered M interfaces are obtained, where M is a positive integer and N is a positive integer smaller than or equal to M, it is determined whether the N message instructions meet a preset rule, if there are P message instructions in the N message instructions that meet the preset rule, P preset asynchronous message instructions are correspondingly stored in the P interfaces corresponding to the P message instructions, where each preset asynchronous message instruction can carry one push message and P is a positive integer smaller than or equal to N, if there are Q preset asynchronous message instructions in the P preset asynchronous message instructions are triggered and Q push messages correspond to Q front pages, the page types of the Q push messages corresponding to the Q front pages are determined, and Q page types corresponding to the Q front pages are obtained, the method comprises the steps that each front-end page corresponds to one page type, R target page types meeting preset types are selected from the Q page types, wherein R is a positive integer smaller than or equal to Q, and R pieces of push information corresponding to the R target page types are pushed according to the R target page types.
In accordance with the above, please refer to fig. 3, fig. 3 is a schematic structural diagram of a server according to an embodiment of the present application, and as shown in fig. 3, the server includes a processor, a communication interface, a memory and one or more programs, the processor, the communication interface and the memory are connected to each other, where the memory is used for storing 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 for triggering the M interfaces, wherein M is a positive integer, and N is a positive integer less 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 meet a preset rule, storing P preset asynchronous message instructions to P interfaces corresponding to the P message instructions correspondingly, 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, Q pieces of push information corresponding to the Q preset asynchronous message instructions are pushed to a front-end page, wherein Q is a positive integer smaller than or equal to P.
It can be seen that the server described in this embodiment of the present application may monitor M interfaces synchronously within a preset time period, obtain N message instructions corresponding to triggering the M interfaces, where M is a positive integer and N is a positive integer less than or equal to M, determine whether the N message instructions meet a preset rule, if there are P message instructions in the N message instructions that meet the preset rule, store P preset asynchronous message instructions correspondingly 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, if Q preset asynchronous message instructions in the P preset asynchronous message instructions are triggered, push Q push messages corresponding to the Q preset asynchronous message instructions to a front-end page, where Q is a positive integer less than or equal to P, and thus, a plurality of interfaces can be adopted to asynchronously push a plurality of pieces of push information to a front-end page, so that the phenomenon of blocking of the front-end page is avoided, and the improvement of user experience is facilitated.
In one possible example, in the aspect of determining whether the N message instructions meet the preset rule, the instructions in the program are specifically configured to perform the following operations:
acquiring N operation levels corresponding to the N message instructions, wherein each message instruction corresponds to one operation level;
according to the N operation levels, judging an operation level i corresponding to any message instruction i in the N message instructions;
if the operation level i is smaller than a preset operation level, determining that the message instruction i conforms to 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 conform to the preset rule.
In a possible example, in terms of the pushing of Q pieces of push information corresponding to the Q preset asynchronous message instructions to a front-end page, the instructions in the program are specifically configured to perform the following operations:
obtaining Q configuration tools corresponding to Q preset H5 pages corresponding to the Q push messages;
and pushing the Q preset H5 pages to the front-end pages corresponding to the Q push 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 terms of pushing the Q pieces of push information corresponding to the Q 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 less 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 a possible example, in terms of pushing, according to the R target page types, R pieces of push information corresponding to the R target page types, the instructions in the program are specifically configured to perform the following operations:
acquiring R push times corresponding to the R target page types and R push information types corresponding to the R push information;
acquiring R first weights corresponding to the R push times and R second weights corresponding to the R push information types;
evaluating the R pieces of push information according to the R pieces of push time, the R pieces of push information types, the R pieces of first weights and the R pieces of second weights to obtain R pieces of evaluation values;
determining R pushing sequences corresponding to the R pieces of pushing information according to the R evaluation values;
and pushing the R pieces of pushing information to the R front-end pages according to the R pieces of pushing sequences.
In one possible example, after the R target page types satisfying the preset type are selected from the Q page types, the instructions in the program are specifically configured to perform the following operations:
acquiring a preset pushing strategy corresponding to the preset type;
and pushing the R pieces of pushing information to R front-end pages according to the preset pushing strategy.
In a possible example, in the aspect of pushing the R pieces of push information to R front-end pages according to the preset push policy, the instructions in the program are specifically configured to perform the following operations:
acquiring R trigger times corresponding to the R preset asynchronous message instructions;
sequencing the R pieces of push information based on the R pieces of trigger time to generate a time sequence;
and pushing the R pieces of pushing information to the R front-end pages according to the time sequence.
The above description has introduced the solution of the embodiment of the present application mainly from the perspective of the method-side implementation process. It is understood that the server includes hardware structures and/or software modules for performing the respective functions in order to implement the above-described functions. Those of skill in the art will readily appreciate that the present application is capable of hardware or a combination of hardware and computer software implementing the various illustrative elements and algorithm steps described in connection with the embodiments provided herein. Whether a function is performed as hardware or computer software drives 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.
In the embodiment of the present application, the server may be divided into the functional units 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 into one processing 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. It should be noted that the division of the unit in the embodiment of the present application is schematic, and is only a logic function division, and there may be another division manner in actual implementation.
In accordance with the above, please refer to fig. 4, where fig. 4 is a schematic structural diagram of an information pushing apparatus disclosed in the embodiment of the present application, applied to a server, the apparatus 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 within a preset time period, and acquire N message instructions for triggering 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 meet a preset rule;
the storage unit 403 is configured to, if there are P message instructions in the N message instructions that meet a preset rule, correspondingly store P preset asynchronous message instructions to P interfaces corresponding to the P message instructions, where each preset asynchronous message instruction may carry one piece of push information, 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 are triggered in the P preset asynchronous message instructions, push Q pieces of push information corresponding to the Q preset asynchronous message instructions to a front-end page, where Q is a positive integer smaller than or equal to P.
It can be seen that the information pushing apparatus described in the embodiments of the present application, applied to a server, may monitor M interfaces synchronously within a preset time period, obtain N message instructions for triggering the M interfaces, where M is a positive integer and N is a positive integer smaller than or equal to M, determine whether the N message instructions meet a preset rule, if there are P message instructions in the N message instructions that meet the preset rule, store P preset asynchronous message instructions correspondingly to P interfaces corresponding to the P message instructions, where each preset asynchronous message instruction may carry one piece of pushing 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, push Q pieces of pushing information corresponding to the Q preset asynchronous message instructions to a front-end page, where Q is a positive integer smaller than or equal to P, therefore, a plurality of interfaces can be adopted to asynchronously push a plurality of pieces of push information to the front-end page, so that the phenomenon of blocking of the front-end page is avoided, and the improvement of user experience is facilitated.
In a possible example, in the aspect of determining whether the N message instructions conform to 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;
according to the N operation levels, judging an operation level i corresponding to any message instruction i in the N message instructions;
if the operation level i is smaller than a preset operation level, determining that the message instruction i conforms to 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 conform to the preset rule.
In a possible example, in terms of the pushing Q pieces of push information corresponding to the Q preset asynchronous message instructions to a front end page, the pushing unit 404 is specifically configured to:
obtaining Q configuration tools corresponding to Q preset H5 pages corresponding to the Q push messages;
and pushing the Q preset H5 pages to the front-end pages corresponding to the Q push 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 terms 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 less 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 a possible example, in terms of pushing, according to the R target page types, R pieces of pushing information corresponding to the R target page types, the pushing unit 404 is specifically configured to:
acquiring R push times corresponding to the R target page types and R push information types corresponding to the R push information;
acquiring R first weights corresponding to the R push times and R second weights corresponding to the R push information types;
evaluating the R pieces of push information according to the R pieces of push time, the R pieces of push information types, the R pieces of first weights and the R pieces of second weights to obtain R pieces of evaluation values;
determining R pushing sequences corresponding to the R pieces of pushing information according to the R evaluation values;
and pushing the R pieces of pushing information to the R front-end pages according to the R pieces of pushing sequences.
Embodiments of the present application also provide a computer-readable storage medium, where the computer storage medium stores a computer program for electronic data exchange, and the computer program enables a computer to execute part or all of the steps of any one of the information pushing methods described in the above method embodiments.
Embodiments of the present application also provide a computer program product, which includes a non-transitory computer-readable storage medium storing a computer program, and the computer program is operable to cause a computer to execute some or all of the steps of any one of the information push methods described in the above method embodiments.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.
In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one type of division of logical functions, and there may be other divisions when actually implementing, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of some interfaces, devices or units, and may be an electric 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 may be implemented in the form of hardware, or may be implemented in the form of a software program module.
The integrated units, if implemented in the form of software program modules and sold or used as stand-alone products, may be stored in a computer readable memory. Based on such understanding, the technical solution of the present application may be substantially implemented or a part of or all or part of the technical solution contributing to the prior art may be embodied in the form of a software product stored in a memory, and including several 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 described in the embodiments of the present application. And the aforementioned memory comprises: various media capable of storing program codes, such as a usb disk, a read-only memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and the like.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by associated hardware instructed by a program, which may be stored in a computer-readable memory, which may include: flash disk, ROM, RAM, magnetic or optical disk, and the like.
The foregoing detailed description of the embodiments of the present application has been presented to illustrate the principles and implementations of the present application, and the above description of the embodiments is only provided to help understand the method and the core concept of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.

Claims (10)

1. An information pushing method applied to a server, the method comprising:
synchronously monitoring M interfaces in a preset time period, and acquiring N message instructions for triggering the M interfaces, wherein M is a positive integer, and N is a positive integer less 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 meet a preset rule, storing P preset asynchronous message instructions to P interfaces corresponding to the P message instructions correspondingly, 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, Q pieces of push information corresponding to the Q preset asynchronous message instructions are pushed to a front-end page, wherein Q is a positive integer smaller than or equal to P.
2. The method of claim 1, wherein the determining whether the N message instructions meet a predetermined rule comprises:
acquiring N operation levels corresponding to the N message instructions, wherein each message instruction corresponds to one operation level;
according to the N operation levels, judging an operation level i corresponding to any message instruction i in the N message instructions;
if the operation level i is smaller than a preset operation level, determining that the message instruction i conforms to 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 conform to the preset rule.
3. The method according to claim 1, wherein the pushing Q pieces of push information corresponding to the Q preset asynchronous message instructions to a front-end page comprises:
obtaining Q configuration tools corresponding to Q preset H5 pages corresponding to the Q push messages;
and pushing the Q preset H5 pages to the front-end pages corresponding to the Q push messages 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 the Q pieces of push information corresponding to the Q preset asynchronous message instructions to the front-end pages further comprises:
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 less 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 according to claim 4, wherein said pushing R pieces of push information corresponding to the R target page types according to the R target page types includes:
acquiring R push times corresponding to the R target page types and R push information types corresponding to the R push information;
acquiring R first weights corresponding to the R push times and R second weights corresponding to the R push information types;
evaluating the R pieces of push information according to the R pieces of push time, the R pieces of push information types, the R pieces of first weights and the R pieces of second weights to obtain R pieces of evaluation values;
determining R pushing sequences corresponding to the R pieces of pushing information according to the R evaluation values;
and pushing the R pieces of pushing information to the R front-end pages according to the R pieces of pushing sequences.
6. The method according to claim 4, wherein after said selecting R target page types satisfying a preset type from the Q page types, the method further comprises:
acquiring a preset pushing strategy corresponding to the preset type;
and pushing the R pieces of pushing information to R front-end pages according to the preset pushing strategy.
7. The method according to claim 6, wherein the pushing the R pieces of push information to R front-end pages according to the preset push policy includes:
acquiring R trigger times corresponding to the R preset asynchronous message instructions;
sequencing the R pieces of push information based on the R pieces of trigger time to generate a time sequence;
and pushing the R pieces of pushing information to the R front-end pages according to the time sequence.
8. An information pushing apparatus applied to a server, the apparatus comprising: a monitoring unit, a judging unit, a storage unit and a pushing unit, wherein,
the monitoring unit is used for synchronously monitoring M interfaces in a preset time period and acquiring N message instructions for triggering 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, if there are P message instructions in the N message instructions that meet a preset rule, correspondingly store P preset asynchronous message instructions to P interfaces corresponding to the P message instructions, where each preset asynchronous message instruction may carry one piece of push information, and P is a positive integer less than or equal to N;
the push unit is configured to push Q pieces of push information corresponding to Q preset asynchronous message instructions to a front-end page if Q preset asynchronous message instructions are triggered in the P preset asynchronous message instructions, where 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 configured 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 that, when executed by a processor, cause the processor to carry out the method according to any one of claims 1-7.
CN201911365816.3A 2019-12-26 2019-12-26 Information pushing method and device Active CN111163152B (en)

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 true CN111163152A (en) 2020-05-15
CN111163152B 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)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111984901A (en) * 2020-08-31 2020-11-24 上海博泰悦臻电子设备制造有限公司 Message pushing method and related product thereof
CN112491998A (en) * 2020-11-18 2021-03-12 平安消费金融有限公司 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 (14)

* Cited by examiner, † Cited by third party
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
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
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

Patent Citations (14)

* Cited by examiner, † Cited by third party
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
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

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111984901A (en) * 2020-08-31 2020-11-24 上海博泰悦臻电子设备制造有限公司 Message pushing method and related product thereof
CN112491998A (en) * 2020-11-18 2021-03-12 平安消费金融有限公司 Message pushing method and related equipment
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

Also Published As

Publication number Publication date
CN111163152B (en) 2023-08-08

Similar Documents

Publication Publication Date Title
CN108108821B (en) Model training method and device
CN111163152A (en) Information pushing method and device
US20170324859A1 (en) Information processing method, terminal, and computer-readable storage medium
CN104615747B (en) Information processing method, client side and server
CN109218390B (en) User screening method and device
WO2017075017A1 (en) Automatic conversation creator for news
JP2019519019A (en) Method, apparatus and device for identifying text type
CN104038473A (en) Method of audio ad insertion, device, equipment and system
CN110708369B (en) File deployment method and device for equipment nodes, scheduling server and storage medium
CN111435369B (en) Music recommendation method, device, terminal and storage medium
CN113055751B (en) Data processing method, device, electronic equipment and storage medium
CN107978014B (en) Particle rendering method and device, electronic equipment and storage medium
CN111770352B (en) Security detection method and device, electronic equipment and storage medium
CN110995856B (en) Method, device and equipment for server expansion and storage medium
CN104866091A (en) Method and device for outputting audio-effect information in computer equipment
CN112218114B (en) Video cache control method, device and computer readable storage medium
CN104754010A (en) Information processing method and service platform
CN110932960A (en) Social software-based fraud prevention method, server and system
CN106844504B (en) A kind of method and apparatus for sending song and singly identifying
WO2017028744A1 (en) Method and device for determining to-be-deployed resources
CN106502496B (en) Window switching method and device
CN107908462B (en) Method for controlling application operation, mobile terminal equipment and related medium product
CN114143571B (en) User processing method, device, equipment and storage medium
CN114363664A (en) Method and device for generating video collection title
CN114450660A (en) Setting method and device of point reporting rate, equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant