CN117978859A

CN117978859A - Information pushing method and related equipment

Info

Publication number: CN117978859A
Application number: CN202311765724.0A
Authority: CN
Inventors: 杨宗霖; 赫建营
Original assignee: Mashang Consumer Finance Co Ltd
Current assignee: Mashang Consumer Finance Co Ltd
Priority date: 2023-12-20
Filing date: 2023-12-20
Publication date: 2024-05-03

Abstract

The application relates to an information pushing method and related equipment. The method comprises the following steps: acquiring an information pushing task, and determining a template identification and an attribute label of the information pushing task; determining a task template corresponding to the template identifier, and determining N candidate lists matched with the task template from M basic lists, wherein N is a positive integer less than or equal to M; based on the attribute information of the N candidate lists, screening P lists to be pushed, wherein the attribute information of the P lists to be pushed is matched with the attribute labels, and P is a positive integer less than or equal to N; determining a pushed list, removing the repeated lists of the P lists to be pushed and the pushed list to obtain a target list, and pushing the attribute information of the target list and the target list to an initiator of the information pushing task. By adopting the method, the information pushing efficiency can be improved.

Description

Information pushing method and related equipment

Technical Field

The present application relates to the field of data pushing technologies, and in particular, to an information pushing method and related devices.

Background

In the application scene of the marketing service, the efficiency of information push has important significance to the marketing service. In the conventional information pushing method, an ES search engine (elastic search engine) is often used for information pushing. The ES search engine dumps the information in full quantity every day, adopts the complex condition based on the database to carry out real-time circle selection on the information required, and pushes the information selected by circle.

Disclosure of Invention

In view of the foregoing, it is desirable to provide an information pushing method and related apparatus that can improve information pushing efficiency.

In a first aspect, the present application provides an information pushing method, including:

Acquiring an information pushing task, and determining a template identification and an attribute label of the information pushing task;

determining a task template corresponding to the template identifier, and determining N candidate lists matched with the task template from M basic lists, wherein N is a positive integer less than or equal to M;

based on the attribute information of the N candidate lists, screening P lists to be pushed, wherein the attribute information of the P lists to be pushed is matched with the attribute labels, and P is a positive integer less than or equal to N;

determining a pushed list, removing the repeated lists of the P lists to be pushed and the pushed list to obtain a target list, and pushing the attribute information of the target list and the target list to an initiator of the information pushing task.

In a second aspect, the present application further provides an information pushing apparatus, including:

The acquisition module is used for acquiring the information pushing task and determining a template identifier and an attribute tag of the information pushing task;

The determining module is used for determining a task template corresponding to the template identifier, determining N candidate lists matched with the task template from M basic lists, wherein N is a positive integer less than or equal to M;

the screening module is used for screening P lists to be pushed, of which the attribute information is matched with the attribute labels, from the N candidate lists based on the attribute information of the N candidate lists, wherein P is a positive integer less than or equal to N;

The pushing module is used for determining the pushed list, removing the list which is in the P lists to be pushed and is repeated by the pushed list, obtaining the target list, and pushing the attribute information of the target list and the target list to the initiator of the information pushing task.

In a third aspect, the present application also provides a computer device comprising a memory and a processor, the memory storing a computer program, the processor implementing the following steps when executing the computer program:

In a fourth aspect, the present application also provides a computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of:

In a fifth aspect, the application also provides a computer program product comprising a computer program which, when executed by a processor, performs the steps of:

In the embodiment of the application, the task template corresponding to the template identification of the information pushing task is determined by acquiring the information pushing task, the candidate list is matched through the task template, the candidate list can be ensured to meet the requirement of the task template corresponding to the information pushing task, the list to be pushed is screened out of the candidate list through the attribute label, the list to be pushed can be ensured to meet the requirement of the attribute label of the information pushing task, meanwhile, the candidate list is screened out based on the task template, and the candidate list is further screened, so that the quantity in the screening process is reduced, and the information pushing efficiency is improved. Then, determining a pushed list, removing a list to be pushed and a list with repeated pushed lists to obtain a target list, and pushing attribute information of the target list and the target list to an initiator of an information pushing task, so that repeated pushing of the list is avoided.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the related art, the drawings that are required to be used in the embodiments or the related technical descriptions will be briefly described, and it is apparent that the drawings in the following description are only some embodiments of the present application, and other drawings may be obtained according to the drawings without inventive effort for those skilled in the art.

FIG. 1 is an application environment diagram of an information push method in one embodiment;

FIG. 2 is a flow chart of a method for pushing information in one embodiment;

FIG. 3 is a flowchart of an information pushing method in another embodiment;

FIG. 4 is a flow diagram of a process for overflow lists in one embodiment;

FIG. 5 is a block diagram of an information pushing device according to one embodiment;

fig. 6 is an internal structural diagram of a computer device in one embodiment.

Detailed Description

For ease of understanding, the following terms will now be explained and will not be described in detail.

StarRocks: the database is analyzed in large-scale parallel in the full-scene of the open source. By adopting the elastic MPP architecture and the comprehensive vectorization technology, various data analysis scenes such as multidimensional analysis, real-time analysis, high concurrency analysis and the like of large data magnitude can be efficiently supported.

Route load: a routine import mode based on MySql (a relational database) protocol supports users to submit resident import tasks.

Broker Load: an asynchronous importing mode based on MySql protocol needs to deploy different processes for different data sources.

In order to better understand the information pushing method, device, computer equipment, storage medium and computer program product provided by the embodiments of the present application, an application environment suitable for the embodiments of the present application is described below.

The traditional information pushing method adopts ES to dump data in a daily total amount, which takes a long time and highly depends on an upstream system. Once an abnormal condition occurs in the data warehouse or the data mart, the information dump is affected, and the information dump abnormality further affects the information push in the case of delayed dump or full dump. Meanwhile, when the ES performs a reading operation on a large amount of information, due to insufficient updating operation performance of the ES, real-time information and off-line information in the ES are respectively stored in two ES indexes, and mixed screening of the real-time information and the off-line information cannot be well supported. In addition, the implementation difficulty of the information pushing based on the ES is high, the information pushing needs to be selected in real time based on complex conditions of a database, and the problem of low information pushing efficiency exists.

In view of this, in order to improve information pushing efficiency, an embodiment of the present application provides an information pushing method, by acquiring an information pushing task, determining a task template corresponding to a template identifier of the information pushing task, matching a candidate list with the task template, so as to ensure that the candidate list meets the requirement of the task template corresponding to the information pushing task, and screening a list to be pushed from the candidate list by an attribute tag, so as to ensure that the list to be pushed meets the requirement of the attribute tag of the information pushing task. Then, determining a pushed list, removing a list to be pushed and a list with repeated pushed lists to obtain a target list, and pushing attribute information of the target list and the target list to an initiator of an information pushing task, so that repeated pushing of the list is avoided, the template identification and the attribute label based on the information pushing task are used for screening the basic list for multiple times, and information pushing is carried out based on screened information after repeated passing, so that the requirement of the information pushing task is met, and meanwhile, the information pushing efficiency is improved.

Referring to fig. 1, fig. 1 is a schematic diagram illustrating an application environment of an information pushing method according to an embodiment of the application. As an implementation manner, the information pushing method provided by the embodiment of the present application may be disassembled into an acquisition process, a determination process and a pushing process. The acquiring process refers to acquiring an information pushing task and determining a template identifier and an attribute tag of the information pushing task. The determining process refers to determining a task template corresponding to the template identifier, and determining N candidate lists matched with the task template from M basic lists, wherein N is a positive integer less than or equal to M; based on the attribute information of the N candidate lists, screening P lists to be pushed, wherein the attribute information of the P lists to be pushed is matched with the attribute labels, and P is a positive integer less than or equal to N; and determining the pushed list, and removing the list which is in the P lists to be pushed and is repeated with the pushed list to obtain a target list. The pushing process refers to pushing the attribute information of the target list and the target list to the initiator of the information pushing task. The acquisition process, the determination process and the pushing process may be applied in the same computer device. The computer device may be a server 110 as shown in fig. 1, and the server 110 may be connected to the terminal device 120 through a network. Wherein the network is used as a medium to provide a communication link between the server 110 and the terminal device 120. The network may include various connection types, such as wired communication links, wireless communication links, and the like, as embodiments of the application are not limited in this regard. Alternatively, in other embodiments, the computer device may be a smart phone, a notebook, or the like.

It should be understood that the server 110, network, and terminal device 120 in fig. 1 are merely illustrative. There may be any number of servers, networks, and terminal devices, as desired for implementation. The server 110 may be a physical server, a server cluster formed by a plurality of servers, and the terminal device 120 may be a mobile phone, a tablet, a desktop computer, a notebook computer, or the like. It will be appreciated that embodiments of the present application may also allow multiple terminal devices 120 to access the server 110 simultaneously.

In some embodiments, the terminal device 120 may obtain the information push task and determine a template identification and an attribute tag of the information push task. Further, the terminal device 120 sends the template identifier and the attribute tag of the information push task to the server 110 through the network, and after the server 110 receives the template identifier and the attribute tag of the information push task, the determining method according to the embodiment of the present application can process the template identifier and the attribute tag.

As another implementation manner, the acquiring process, the determining process and the pushing process provided by the embodiment of the present application may be applied to different computer devices. For example, the acquisition procedure is applied to computer device a, the determination procedure method is applied to computer device B, the push procedure is applied to computer device C, etc. In addition, any two methods of the acquisition process, the determination process and the pushing process provided by the embodiment of the application can be applied to the same computer equipment. For example, the acquisition procedure, the determination procedure method is applied to the computer device a and the push procedure is applied to the computer device B, or the acquisition procedure, the push procedure is applied to the computer device a and the determination procedure is applied to the computer device B, or the determination procedure, the push procedure is applied to the computer device a and the acquisition procedure is applied to the computer device B, etc. The embodiment of the application does not limit the computer equipment to which the three methods are applied.

In an exemplary embodiment, as shown in fig. 2, an information pushing method is provided, where this embodiment is applied to the terminal device 120 for illustration, it is understood that the method may also be applied to a server, and may also be applied to a system including a terminal and a server, and implemented through interaction between the terminal and the server. Including the following steps 202 through 208. Wherein:

step 202, acquiring an information pushing task, and determining a template identifier and an attribute tag of the information pushing task.

The information pushing task is a task initiated by the initiator and received by the terminal equipment and is used for pushing information to the initiator by the terminal equipment. The initiator can be a downstream system of the terminal equipment, and the types of the initiator are different according to different application scenes of the information pushing method. For example, the application scenario may be a precision marketing scenario, and the initiator is a precision marketing system. For example, in a precision marketing scenario, the information pushing task may be pushing a list of users for marketing product A. The accurate marketing system is applied to business scenes of stock user marketing, covers different nodes of the full life cycle of registered users, supports accurate crowd subdivision of user labels and user behavior events, supports various forms of shunt tests and multidimensional touch means, and achieves user differential marketing, so that users are guided to translate and migrate to high-frequency use, and efficient increase of stock user operation is achieved. For another example, the application scene is a phone agent scene, and the initiator is an agent system.

In some embodiments, the initiator subscribes to information in the terminal device, the subscription information is recorded in the database, and the terminal device generates an information push task according to the subscription information.

When an initiator initiates an information pushing task, a task template can be newly built in a man-machine interaction interface of the terminal equipment, and information such as a required list type is selected from the newly built task template. In some embodiments, the initiator may also select an established completed task template in the human-machine interaction interface. Each task template has a respective corresponding template identification.

Each list corresponds to different attribute information, and the attribute label is a label formed by an attribute range of at least one attribute. When an initiator initiates an information push task, a value range can be set for at least one kind of attribute information of the requirement respectively, and an attribute tag is added for the value range of the at least one kind of attribute information. For example, the initiator selects the "on job status" as "on job" in the human-computer interaction interface, and the "age" satisfies the condition of "between 25 and 30 years old", and adds the condition to the attribute tag of the "potential user". The terminal equipment analyzes the information pushing task to obtain a template identifier and an attribute tag of the information pushing task.

Step 204, determining a task template corresponding to the template identification, and determining N candidate lists matched with the task template from M basic lists, wherein N is a positive integer less than or equal to M.

The task templates are in one-to-one correspondence with the template identifiers, and the terminal equipment determines the task templates corresponding to the template identifiers.

The basic list is stored in a basic information table, which may be StarRocks data tables. The terminal equipment reads the basic information list to obtain M basic lists, screens out proper lists from the M basic lists according to the information pushing task, and pushes the lists to an initiator of the information pushing task.

The basic information table includes attribute information of the list in addition to the list. The list is identification information of the user, and comprises a user identification, wherein the user identification can be a character or a user name. The attribute information is feature information of the user, and the attribute information includes an attribute value of at least one attribute of the user. For example, user a in the list, the attribute information includes age, 25 years.

Because the task template comprises the attributes required by the information pushing task, the terminal equipment analyzes the task template to obtain the attributes in the task template. When an initiator newly builds a task template, the attribute to be selected often comes from attribute information of a basic list, and the initiator selects a required attribute from the attributes to be selected.

N candidate lists matched with the task template are determined from the M basic lists, and a list consistent with the required attribute can be screened from the M basic lists to be used as the candidate list for determining the required attribute in the task template.

Step 206, based on the attribute information of the N candidate lists, P lists to be pushed, whose attribute information matches with the attribute tag, are selected from the N candidate lists, where P is a positive integer less than or equal to N.

The terminal device may write the candidate list into a candidate list table, where the candidate list table may be StarRocks data tables. And the terminal equipment reads N candidate lists in the candidate list and searches attribute information corresponding to each of the N candidate lists in the database.

Because the attribute tag includes the attribute range of at least one attribute, the terminal device can screen a list of which the attribute information satisfies the attribute range of at least one attribute from the N candidate lists and serve as a list to be pushed.

In some embodiments, the number of the attribute tags is multiple, for each attribute tag, the terminal device screens out multiple to-be-pushed lists with attribute information matched with the attribute tag from the N candidate lists, and the multiple to-be-pushed lists corresponding to the attribute tags are taken as P to-be-pushed lists together.

Step 208, determining a pushed list, removing the list pushed list in the P lists to be pushed and the list repeated by the pushed list to obtain a target list, and pushing the attribute information of the target list and the target list to the initiator of the information pushing task.

Wherein the pushed list is a list that has been pushed to the downstream system. The pushed list is stored in a pushed list, which may be StarRocks data sheets. And the terminal equipment reads the pushed list to obtain the pushed list.

And removing the repeated list in the list to be pushed under the condition that the list which is the same as the pushed list exists in the list to be pushed, wherein the target list is the list subjected to the duplication removal treatment.

In some embodiments, in the case that the list identical to the pushed list does not exist in the list to be pushed, the P lists to be pushed are all taken as the target lists.

In some embodiments, the terminal device writes the target list to a target list table, which may be StarRocks data tables. The terminal equipment queries the basic information table to obtain attribute information corresponding to the target list, and the target list is the list subjected to the duplication removal processing, so that the attribute information of the target list and the target list is pushed to the sender, and repeated pushing of the list can be avoided.

In some embodiments, the terminal device may add the attribute information of the target list and the target list to the task template, obtain an assembled task template, and push the assembled task template to the sender.

In the information pushing method, the information pushing task is acquired, the task template corresponding to the template identification of the information pushing task is determined, the candidate list is matched through the task template, the candidate list can be ensured to meet the requirement of the task template corresponding to the information pushing task, the list to be pushed is screened out of the candidate list through the attribute label, the list to be pushed can be ensured to meet the requirement of the attribute label of the information pushing task, meanwhile, the candidate list is screened out based on the task template, and the candidate list is further screened, so that the number in the screening process is reduced, and the information pushing efficiency is improved. Then, determining a pushed list, removing a list to be pushed and a list with repeated pushed lists to obtain a target list, and pushing attribute information of the target list and the target list to an initiator of an information pushing task, so that repeated pushing of the list is avoided.

In one exemplary embodiment, the task template includes at least one target attribute, and determining N candidate lists matching the task template from the M basic lists includes: acquiring a basic information table, wherein the basic information table comprises M basic lists and attribute information of each basic list, and the attribute information of the basic list comprises at least one attribute and attribute values corresponding to the at least one attribute; and determining the list with the attribute information including the target attribute in the M basic lists as a candidate list to obtain N candidate lists.

The terminal equipment reads the basic information table to obtain M basic lists and attribute information of each basic list.

The target attribute is an attribute set in the task template. For example, gender and age are set in the task template. Then a list with gender information and age information needs to be screened when screening through the task template.

And the terminal equipment screens out a list with the attribute information including the target attribute from the M basic lists and takes the list as a candidate list.

In this embodiment, by reading the basic list in the basic information table and the attribute information of the basic list, and using the list including the target attribute in the basic list as the candidate list, the list meeting the requirement of the task template can be screened out, which is beneficial to improving the information pushing efficiency.

In one exemplary embodiment, obtaining the base information table includes: reading off-line information in an off-line information table, wherein the off-line information comprises R lists and attribute information of the R lists, and asynchronously importing the off-line information into a basic information table; reading real-time information in a message queue, wherein the real-time information comprises T lists and attribute information of the T lists, and routinely importing the real-time information into a basic information table; and obtaining M basic lists and attribute information of the M basic lists according to the R lists, the attribute information of the R lists, the T lists and the attribute information of the T lists, wherein a basic information table comprises the M basic lists and the attribute information of the M basic lists, and R, T is a positive integer.

The off-line information table is an information table in the terminal equipment, and a large amount of off-line information is stored in the off-line information table. The offline information is information obtained at the historical moment. The type of the offline information table can be a file type or a database table type, and a corresponding reading method is adopted according to the type of the offline information table, so that the offline information is read. For example, the offline information table may be stored in a distributed file system (HDFS, hadoop Distributed FILE SYSTEM). The HDFS is adopted to store a large amount of offline information, so that the data volume of the information to be pushed is increased. The real-time information is information acquired at the current moment, and can be stored in a message queue, and the terminal equipment reads the real-time information in the message queue according to the first-in first-out sequence. For example, it may be stored in a Kafka (a distributed message queue) message queue. And the message queue is used for storing the real-time information, so that the real-time property of the information to be pushed is improved.

The basic information table is an information table storing basic lists and attribute information of the basic lists. May be a database table type, or a file type. The M basic lists comprise R lists in offline information and T lists in real-time information. The attribute information of the M basic lists comprises attribute information of R lists in the offline information and attribute information of T lists in the real-time information.

Asynchronous import refers to an operation in which data import operations are handled in a separate thread or process. Because the offline information is larger, the offline information can be imported into the basic information table by adopting an asynchronous importing method. For example, the offline information table may be of the HDFS type, and the offline information table is read by using a Broker Load provided by StarRocks, and the read offline information is written into the basic information table. The method of reading and asynchronously importing the Broker Load can rapidly finish the dump of offline information, and simultaneously supports the dump at any time, thereby reducing the strong dependency degree of upstream and downstream.

Routine importation refers to a method by which data is continually imported from a specified data source. For real-time information, the route load provided by StarRocks may be used to read the real-time information in the message queue and write the real-time information into the basic information table. By adopting the method of route load reading and Routine importing, the real-time dump of the real-time information is realized, the writing speed is high, the performance is high, and the information pushing efficiency is improved.

The basic information table obtained through asynchronous import and routine import comprises offline information and real-time information.

In this embodiment, the offline information in the offline information table is asynchronously imported, so that the real-time information in the message queue is routinely imported, which is beneficial to improving the data size of the basic information table and improving the real-time performance of the information.

In one embodiment, based on attribute information of the N candidate lists, screening P lists to be pushed whose attribute information matches with an attribute tag from the N candidate lists includes: determining the value range of the target attribute according to the attribute label; and determining a list with the attribute value of the target attribute in a value range from the N candidate lists as a list to be pushed, and obtaining P lists to be pushed.

The attribute tag is formed by an attribute range of at least one attribute, so that the terminal equipment can determine the value range of the target attribute according to the attribute tag. The list to be pushed is a list of which the attribute value of the target attribute is in the value range. For example, the target attributes include gender and age, the gender has an attribute range of female and the age has an attribute range of 30-40 years.

In this embodiment, the list to be pushed is screened from the candidate list by determining the value range of the target attribute corresponding to the attribute tag, so that the list to be pushed can be ensured to simultaneously meet the template requirement and the attribute range requirement of the information pushing task, and the information pushing is performed after multiple screening, so that the information pushing efficiency is improved.

In one embodiment, removing the list pushed list of the P lists to be pushed and the list pushed list repeated to obtain the target list includes: determining a list within a preset deduplication effective period from the pushed list as a target pushed list; and deleting the list which is repeated with the target pushed list in the P pieces of information to be pushed to obtain the target list.

And the target pushed list in the preset de-duplication effective period in the pushed list is a recently pushed list. The preset deduplication valid period may be within 3 days from the current time onward, or any other time period.

The terminal equipment traverses the P lists to be pushed, deletes the list which is repeated with the target pushed list in the P lists to be pushed, and takes the obtained result as the target list.

In addition, for the list exceeding the preset de-duplication validity period in the pushed list, the repeated list does not need to be deleted when the repeated list exists in the list to be pushed.

In this embodiment, by deleting the list in the preset de-duplication validity period from the list to be pushed, repeated pushing of the list that has been pushed recently is avoided.

In one embodiment, removing the pushed list of the list repeated by the pushed list in the P lists to be pushed to obtain the target information includes: acquiring the required quantity corresponding to the information pushing task; and removing the list pushed list which is in the P lists to be pushed and is repeated with the pushed list under the condition that the required number is less than P, and obtaining a target list.

The demand quantity is the planned demand quantity of a required list appointed in the information push task. The number of requirements may be compared with the number of lists to be pushed before the de-duplication process is performed on the lists to be pushed.

And under the condition that the number of requirements is smaller than P, the list to be pushed exceeds the planned number of requirements, the data volume of the list to be pushed is sufficient, and the list to be pushed can be de-duplicated according to the pushed list to obtain a target list.

Under the condition that the required number is greater than or equal to P, the data volume of the list to be pushed is insufficient, the list to be pushed does not need to be subjected to duplicate removal processing, and the P lists to be pushed can be directly used as target lists for information pushing.

In this embodiment, by acquiring the planned required number of the required lists specified by the information pushing task, in the case that the number of the lists to be pushed is insufficient, the duplicate removal processing is not required, which is avoided under the condition that the data amount of the lists to be pushed is insufficient, and in the case that the data amount of the lists to be pushed is sufficient, the duplicate removal processing is performed, which is advantageous for improving the information pushing efficiency, so that repeated pushing of information is avoided.

In one embodiment, pushing the attribute information of the target list and the target list to the initiator of the information pushing task includes: reading an overflow list table to obtain an overflow list, wherein the overflow list is a list which is not consumed by an initiator of an information push task in a list which is pushed to the initiator of the information push task last time; and pushing the target list, attribute information corresponding to the target list, the overflow list and attribute information corresponding to the overflow list to an initiator of the information pushing task, and clearing the overflow list after pushing.

Before the secondary information is pushed, the initiator consumes the information after receiving the pushed information, and there may be a case that the initiator does not consume the received pushed information, and the overflow list is a list which is not consumed in the list pushed to the initiator of the information push task last time. The overflow list is used for storing an overflow list, which may be StarRocks data tables.

When the secondary information is pushed, the overflow list which is output to the overflow list last time can be read, and the target list, the overflow list, the attribute information corresponding to the target list and the attribute information corresponding to the overflow list are pushed to the initiator together.

After pushing, the terminal equipment clears the overflow list, and the cleared overflow list can be used for storing the overflow list generated at the current time.

In this embodiment, by reading the overflow list table, the overflow list in the overflow list table, the target list and the attribute information corresponding to each list are pushed to the initiator together, and the overflow list is pushed to the initiator again because the overflow list is not consumed by the initiator, so that list waste is avoided, and information utilization rate is improved.

In one embodiment, after the overflow list is emptied after pushing, the method further comprises: acquiring a first number of lists consumed by an initiator of an information push task, a second number of target lists and a third number of overflow lists; updating the pushed list according to the target list and the overflow list under the condition that the sum of the second number and the third number is equal to the first number; and deleting the lists which are repeated with the consumed lists in the target list and the overflow list under the condition that the sum of the second number and the third number exceeds the first number, and writing the list which is remained after the deletion into the overflow list.

After the information is pushed and the overflow list is emptied, if the overflow list is newly generated, the newly generated overflow list is written into the overflow list, so that the list is prevented from being discarded.

The initiator consumes the information after receiving the pushed message.

The first number is the number of lists consumed by the initiator. The second number is the number of the target list. The third number is the number of overflow lists.

Since the target list and the overflow list are pushed to the initiator together, the number of lists actually received by the initiator is the sum of the number of the second number and the third number.

The terminal equipment compares the number of the lists actually received by the initiator with the number of the lists actually consumed, and the terminal equipment takes the target list and the overflow list as pushed lists when the sum of the second number and the third number is equal to the first number, which indicates that the initiator consumes the received lists completely.

And under the condition that the sum of the second quantity and the third quantity exceeds the first quantity, indicating that the initiator does not consume the received list, deleting the list which is repeated with the actually consumed list in the target list and the overflow list by the terminal equipment, and writing the list which is remained after deleting into the overflow list table as a newly generated overflow list. In addition, the list actually consumed is also used as a pushed list.

In this embodiment, after information is pushed and the overflow list is emptied, the initiator consumes the received pushed list, and determines whether the list is completely consumed by comparing the number of the lists actually consumed with the number of the lists actually received, and the consumed list is recorded as a pushed list and used for carrying out list duplication removal in next list pushing, and the unconsumed list is recorded as an overflow list in the overflow list for next circulation pushing, so that list waste is avoided, and list and information utilization rate are improved.

In one embodiment, acquiring an information push task includes: acquiring subscription tasks in a task table, and determining push identification of each subscription task; determining a subscription task which is not pushed in the task table according to the pushing identification; determining the task state of the non-pushed subscription task, and removing the subscription task with the task state of a pause state and a cancel state from the non-pushed subscription task to obtain the information push task.

The initiator can initiate subscription tasks for a plurality of times, and the generated subscription tasks are written into the task table. And the terminal equipment identifies at least one subscription task in the task list and determines the subscription task which is not pushed. Each subscription task has a corresponding push identifier, and the push identifier is used for representing that the subscription task is pushed or not pushed. The terminal device may determine the subscription task that is not pushed from the task table.

And after locking and slicing the non-pushed subscription tasks, sequencing according to the priority, and obtaining the sequenced non-pushed tasks. The task states include a suspended state, a cancel state, and a normal state.

And removing tasks with the task states of pause state and cancel state from the ordered non-pushed tasks, and taking the tasks in the normal state as information push tasks.

In this embodiment, subscription tasks that are not pushed and are in a normal state are screened out from the task table, so that subscription tasks that are pushed, in a pause state and in a cancel state are eliminated, which is beneficial to improving information pushing efficiency. The information pushing tasks are ordered according to the priority order, the information pushing tasks can be executed according to the priority order, the subscription tasks with high priority are guaranteed to be executed earlier, and the information pushing efficiency is improved.

In order to describe the information pushing method and effect in this embodiment in detail, the following description will use a most detailed embodiment:

The information pushing method in the embodiment of the application can be applied to any scene needing information pushing, such as an accurate marketing scene, a telephone seat scene, a public information notification scene and the like. The push object targeted by the information push method can be specified according to the service requirement, and the embodiment of the application is not limited to this. The following describes an information push method in a precise marketing scene:

Fig. 3 is a schematic flow chart of an information pushing method in another embodiment. The initiator of the information push task is an accurate marketing system, initiates information subscription, generates a subscription task and writes the subscription task into a task table. In some embodiments, the information type subscribed to by the precision marketing system may be a list type, with the task list stored in the MySql database.

The terminal equipment screens information pushing tasks from the task list, specifically, at least one subscription task in the task list can be identified, the non-pushed subscription task is determined, after locking and slicing are carried out on the non-pushed subscription task, the non-pushed tasks after sorting are obtained according to priority, a pause state task, a cancel state task and a normal state task are identified in the non-pushed tasks after sorting, the normal state task is used as the information pushing task, and a template identifier and an attribute tag of the information pushing task are obtained.

The terminal equipment reads the offline information in the offline information table, wherein the offline information comprises R lists and attribute information of the R lists, and asynchronously imports the offline information into the basic information table.

And obtaining M basic lists and attribute information of the M basic lists according to the R lists, the attribute information of the R lists, the T lists and the attribute information of the T lists, wherein a basic information table comprises the M basic lists and the attribute information of the M basic lists, and R, T is a positive integer. The offline information table may be of an HDFS type, and the offline information table is read by using a Broker Load provided by StarRocks and written into the basic information table. The method of reading and asynchronously importing the Broker Load can rapidly finish the dump of offline information, and simultaneously supports the dump at any time, thereby reducing the strong dependency degree of upstream and downstream.

And reading real-time information through the Kafka message queue, wherein the real-time information comprises T lists and attribute information of the T lists, and the real-time information is routinely imported into the basic information table. And reading real-time information in the Kafka message queue by adopting the route load provided by StarRocks, and writing the real-time information into a basic information table. By adopting the method of route load reading and Routine importing, the real-time dump of the real-time information is realized, the writing speed is high, the performance is high, and the information pushing efficiency is improved.

A task template corresponding to the template identification is determined, the task template including at least one target attribute. Determining a task template corresponding to the template identifier, and acquiring a basic information table, wherein the basic information table comprises M basic lists and attribute information of each basic list, and the attribute information of the basic list comprises at least one attribute and attribute values corresponding to the at least one attribute; and determining a list with the attribute information including the target attribute in the M basic lists as a candidate list to obtain N candidate lists, wherein N is a positive integer less than or equal to M. In some embodiments, if there is no list whose attribute information includes the target attribute in the M basic lists, the information push task is ended.

And determining a list with the attribute value of the target attribute in the value range in the N candidate lists as a list to be pushed based on the attribute information of the N candidate lists, and obtaining P lists to be pushed, wherein P is a positive integer less than or equal to N. In some embodiments, if there is no list with the attribute value of the target attribute within the value range in the N candidate lists, the information pushing task is ended.

And acquiring the required quantity corresponding to the information pushing task, wherein the required quantity is the planned required quantity of the required list appointed in the information pushing task. Under the condition that the required number is greater than or equal to P, the data volume of the list to be pushed is insufficient, the list to be pushed does not need to be subjected to duplicate removal processing, and the P lists to be pushed can be directly used as target lists for information pushing. And under the condition that the required number is less than P, determining a pushed list, determining a list within a preset deduplication effective period from the pushed list as a target pushed list, and deleting a list which is repeated with the target pushed list in the P lists to be pushed to obtain the target list.

And reading the overflow list to obtain an overflow list, wherein the overflow list is a list which is not consumed by the accurate marketing system in the list pushed to the accurate marketing system last time. Pushing the target list, attribute information corresponding to the target list, the overflow list and attribute information corresponding to the overflow list to the accurate marketing system, and clearing the overflow list after pushing.

After the information is pushed to the accurate marketing system and the overflow list is emptied, whether the overflow list exists or not is determined according to the consumption condition of the accurate marketing system on the list and the information. FIG. 4 is a flow diagram illustrating the processing of the overflow list in one embodiment.

The terminal equipment pushes information to the accurate marketing system through the Kafka message queue, after the accurate marketing system receives the information, the information is consumed, the first number of lists consumed by the accurate marketing system, the second number of target lists and the third number of overflow lists are obtained, and the pushed lists are updated according to the target lists and the overflow lists under the condition that the sum of the second number and the third number is equal to the first number. And deleting the lists which are repeated with the consumed lists in the target list and the overflow list under the condition that the sum of the second number and the third number is larger than the first number, and writing the list which is remained after the deletion into the overflow list. And the overflow list in the overflow list table is continuously pushed to the sender when the next information is pushed, so that the information is prevented from being discarded. In some embodiments, the overflow list is written into the MySql overflow list, the overflow list in the MySql overflow list is dumped through the Kafka message queue, and the overflow list is imported into the StarRocks overflow list in the database by using route load, and the target list, the overflow list, the attribute information of the target list and the attribute information of the overflow list in the StarRocks database can be pushed to the accurate marketing system together in the next information push task.

According to the information pushing method, the information pushing task is acquired, the task template corresponding to the template identification of the information pushing task is determined, the candidate list is matched through the task template, the candidate list can be guaranteed to meet the requirement of the task template corresponding to the information pushing task, the list to be pushed is screened out of the candidate list through the attribute label, the list to be pushed can be guaranteed to meet the requirement of the attribute label of the information pushing task, meanwhile, the candidate list is screened out based on the task template, the candidate list is screened out further, the number in the screening process is reduced, and the information pushing efficiency is improved. Then, determining a pushed list, removing a list to be pushed and a list with repeated pushed lists to obtain a target list, and pushing attribute information of the target list and the target list to an initiator of an information pushing task, so that repeated pushing of the list is avoided. Meanwhile, the terminal equipment relies on StarRocks to dump the information, so that the speed is high, the dump at any time can be supported, and the upstream dependency degree is reduced. The information circle selection and pushing speed is high, whether multi-table association or single-table screening is performed, the guest group screening speed is high, high-frequency information pushing can be supported, and the instantaneity of information pushing is improved. The information overflow is supported, the information exceeding the downstream actual consumption can be returned to the StarRocks database, and the information is pushed again according to the actual condition when the next information pushing is supported, so that the information utilization rate is improved.

It should be understood that, although the steps in the flowcharts related to the embodiments described above are sequentially shown as indicated by arrows, these steps are not necessarily sequentially performed in the order indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in the flowcharts described in the above embodiments may include a plurality of steps or a plurality of stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of the steps or stages is not necessarily performed sequentially, but may be performed alternately or alternately with at least some of the other steps or stages.

Based on the same inventive concept, the embodiment of the application also provides an information pushing device for realizing the above related information pushing method. The implementation of the solution provided by the device is similar to the implementation described in the above method, so the specific limitation in one or more embodiments of the information pushing device provided below may refer to the limitation of the information pushing method hereinabove, and will not be repeated herein.

In one exemplary embodiment, as shown in fig. 5, there is provided an information push apparatus 100, including: the acquisition module 120, the determination module 140, the screening module 160, and the pushing module 180, wherein:

the acquiring module 120 is configured to acquire an information push task, and determine a template identifier and an attribute tag of the information push task;

The determining module 140 is configured to determine a task template corresponding to the template identifier, determine N candidate lists matched with the task template from M basic lists, where N is a positive integer less than or equal to M;

The screening module 160 is configured to screen P lists to be pushed, where P is a positive integer less than or equal to N, from the N candidate lists based on attribute information of the N candidate lists;

The pushing module 180 is configured to determine a pushed list, remove the lists in the P lists to be pushed and the list repeated by the pushed list, obtain a target list, and push attribute information of the target list and the target list to an initiator of the information pushing task.

According to the information pushing device, the information pushing task is acquired, the task template corresponding to the template identification of the information pushing task is determined, the candidate list is matched through the task template, the candidate list can be guaranteed to meet the requirement of the task template corresponding to the information pushing task, the list to be pushed is screened out of the candidate list through the attribute label, the list to be pushed can be guaranteed to meet the requirement of the attribute label of the information pushing task, meanwhile, the candidate list is screened out based on the task template, the candidate list is screened out further, the number in the screening process is reduced, and the information pushing efficiency is improved. Then, determining a pushed list, removing a list to be pushed and a list with repeated pushed lists to obtain a target list, and pushing attribute information of the target list and the target list to an initiator of an information pushing task, so that repeated pushing of the list is avoided.

In one embodiment, the task template includes at least one target attribute, N candidate lists matching the task template are determined from the M basic lists, and the determining module 140 is further configured to: acquiring a basic information table, wherein the basic information table comprises M basic lists and attribute information of each basic list, and the attribute information of the basic list comprises at least one attribute and attribute values corresponding to the at least one attribute; and determining the list with the attribute information including the target attribute in the M basic lists as a candidate list to obtain N candidate lists.

In one embodiment, the base information table is obtained, and the determining module 140 is further configured to: reading off-line information in an off-line information table, wherein the off-line information comprises R lists and attribute information of the R lists, and asynchronously importing the off-line information into a basic information table; reading real-time information in a message queue, wherein the real-time information comprises T lists and attribute information of the T lists, and routinely importing the real-time information into a basic information table; and obtaining M basic lists and attribute information of the M basic lists according to the R lists, the attribute information of the R lists, the T lists and the attribute information of the T lists, wherein a basic information table comprises the M basic lists and the attribute information of the M basic lists, and R, T is a positive integer.

In one embodiment, based on the attribute information of the N candidate lists, P lists to be pushed whose attribute information matches with the attribute tag are screened from the N candidate lists, and the screening module 160 is further configured to: determining the value range of the target attribute according to the attribute label; and determining a list with the attribute value of the target attribute in a value range from the N candidate lists as a list to be pushed, and obtaining P lists to be pushed.

In one embodiment, removing the list of the P lists to be pushed and the list that has been pushed and repeated to obtain the target list, the pushing module 180 is further configured to: determining a list within a preset deduplication effective period from the pushed list as a target pushed list; deleting the list which is repeated with the target pushed list in the P lists to be pushed to obtain the target list.

In one embodiment, the pushing module 180 is further configured to push the target list and attribute information of the target list to an initiator of the information push task: reading an overflow list table to obtain an overflow list, wherein the overflow list is a list which is not consumed by an initiator of an information push task in a list which is pushed to the initiator of the information push task last time; and pushing the target list, attribute information corresponding to the target list, the overflow list and attribute information corresponding to the overflow list to an initiator of the information pushing task, and clearing the overflow list after pushing.

In one embodiment, after the overflow list is emptied after pushing, the information pushing apparatus 100 further includes an overflow module for: acquiring a first number of lists consumed by an initiator of an information push task, a second number of target lists and a third number of overflow lists; updating the pushed list according to the target list and the overflow list under the condition that the sum of the second number and the third number is equal to the first number; and deleting the lists which are repeated with the consumed lists in the target list and the overflow list under the condition that the sum of the second number and the third number is larger than the first number, and writing the list which is remained after the deletion into the overflow list.

In one embodiment, the acquiring module 120 is further configured to: acquiring subscription tasks in a task table, and determining push identification of each subscription task; determining a subscription task which is not pushed in the task table according to the pushing identification; determining the task state of the non-pushed subscription task, and removing the subscription task with the task state of a pause state and a cancel state from the non-pushed subscription task to obtain the information push task.

The modules in the information pushing device may be implemented in whole or in part by software, hardware, or a combination thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.

In an exemplary embodiment, a computer device, which may be a terminal, is provided, and an internal structure diagram thereof may be as shown in fig. 6. The computer device includes a processor, a memory, an input/output interface, a communication interface, a display unit, and an input means. The processor, the memory and the input/output interface are connected through a system bus, and the communication interface, the display unit and the input device are connected to the system bus through the input/output interface. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The input/output interface of the computer device is used to exchange information between the processor and the external device. The communication interface of the computer device is used for carrying out wired or wireless communication with an external terminal, and the wireless mode can be realized through WIFI, a mobile cellular network, NFC (near field communication) or other technologies. The computer program is executed by a processor to implement an information push method. The display unit of the computer device is used for forming a visual picture, and can be a display screen, a projection device or a virtual reality imaging device. The display screen can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, can also be a key, a track ball or a touch pad arranged on the shell of the computer equipment, and can also be an external keyboard, a touch pad or a mouse and the like.

It will be appreciated by those skilled in the art that the structure shown in FIG. 6 is merely a block diagram of some of the structures associated with the present inventive arrangements and is not limiting of the computer device to which the present inventive arrangements may be applied, and that a particular computer device may include more or fewer components than shown, or may combine some of the components, or have a different arrangement of components.

In an exemplary embodiment, a computer device is provided, comprising a memory and a processor, the memory having stored therein a computer program, the processor performing the steps of the method embodiments described above when the computer program is executed.

In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored which, when executed by a processor, carries out the steps of the method embodiments described above.

In an embodiment, a computer program product is provided, comprising a computer program which, when executed by a processor, implements the steps of the method embodiments described above.

It should be noted that, the user information (including but not limited to user equipment information, user personal information, etc.) and the data (including but not limited to data for analysis, stored data, presented data, etc.) related to the present application are both information and data authorized by the user or sufficiently authorized by each party, and the collection, use and processing of the related data are required to meet the related regulations.

Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, database, or other medium used in embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, high density embedded nonvolatile Memory, resistive random access Memory (ReRAM), magneto-resistive random access Memory (Magnetoresistive Random Access Memory, MRAM), ferroelectric Memory (Ferroelectric Random Access Memory, FRAM), phase change Memory (PHASE CHANGE Memory, PCM), graphene Memory, and the like. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory, and the like. By way of illustration, and not limitation, RAM can be in various forms such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), etc. The databases referred to in the embodiments provided herein may include at least one of a relational database and a non-relational database. The non-relational database may include, but is not limited to, a blockchain-based distributed database, and the like. The processor referred to in the embodiments provided in the present application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic unit, a data processing logic unit based on quantum computing, or the like, but is not limited thereto.

The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.

The foregoing examples illustrate only a few embodiments of the application and are described in detail herein without thereby limiting the scope of the application. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the application, which are all within the scope of the application. Accordingly, the scope of the application should be assessed as that of the appended claims.

Claims

1. An information pushing method, characterized in that the method comprises:

Acquiring an information pushing task, and determining a template identifier and an attribute tag of the information pushing task;

Determining a pushed list, removing repeated lists in the P lists to be pushed and the pushed list to obtain a target list, and pushing the attribute information of the target list and the target list to an initiator of the information pushing task.

2. The method of claim 1, wherein the task template includes at least one target attribute, wherein the determining N candidate lists from the M base lists that match the task template includes:

Acquiring a basic information table, wherein the basic information table comprises M basic lists and attribute information of each basic list, and the attribute information of the basic list comprises at least one attribute and attribute values corresponding to the at least one attribute;

And determining a list with the attribute information including the target attribute in the M basic lists as a candidate list to obtain N candidate lists.

3. The method of claim 2, wherein the obtaining the base information table comprises:

reading off-line information in an off-line information table, wherein the off-line information comprises R lists and attribute information of the R lists, and asynchronously importing the off-line information into a basic information table;

reading real-time information in a message queue, wherein the real-time information comprises T lists and attribute information of the T lists, and routinely importing the real-time information into the basic information table;

Obtaining M basic lists according to the R lists, the attribute information of the R lists, the T lists and the attribute information of the T lists, and the attribute information of the M basic lists, wherein the basic information list comprises the M basic lists and the attribute information of the M basic lists, and R, T is a positive integer.

4. The method according to claim 2, wherein the screening the P lists to be pushed whose attribute information matches the attribute tag from the N candidate lists based on the attribute information of the N candidate lists includes:

determining the value range of the target attribute according to the attribute tag;

and determining a list with the attribute value of the target attribute in the value range from the N candidate lists as a list to be pushed, and obtaining the P lists to be pushed.

5. The method of claim 1, wherein the removing the repeated list of the P lists to be pushed and the pushed list to obtain the target list comprises:

determining a list within a preset deduplication validity period from the pushed list as a target pushed list;

and deleting the list which is repeated with the target pushed list in the P lists to be pushed to obtain a target list.

6. The method according to claim 1, wherein pushing the target list and the attribute information of the target list to the initiator of the information pushing task comprises:

reading an overflow list to obtain an overflow list, wherein the overflow list is a list which is not consumed by the initiator of the information push task in the list pushed to the initiator of the information push task last time;

And pushing the target list, the attribute information corresponding to the target list, the overflow list and the attribute information corresponding to the overflow list to an initiator of the information pushing task, and clearing the overflow list after pushing.

7. The method of claim 6, wherein after the clearing of the overflow list after pushing, further comprising:

acquiring a first number of lists consumed by an initiator of the information pushing task, a second number of the target lists and a third number of the overflow lists;

Updating the pushed list according to the target list and the overflow list in the case that the sum of the number of the second number and the third number is equal to the first number;

And deleting the lists which are repeated with the consumed lists in the target lists and the overflow lists under the condition that the sum of the second number and the third number is larger than the first number, and writing the lists which are remained after the deletion into an overflow list.

8. The method of claim 1, wherein the acquiring information push task comprises:

acquiring subscription tasks in a task table, and determining push identification of each subscription task;

determining the subscription tasks which are not pushed in the task list according to the pushing identification;

determining the task state of the non-pushed subscription task, and removing the subscription task with the task state of a pause state and a cancel state from the non-pushed subscription task to obtain an information push task.

9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the information pushing method of any of claims 1 to 8 when the computer program is executed.

10. A computer readable storage medium having stored thereon a computer program, characterized in that the computer program when executed by a processor realizes the steps of the information pushing method of any of claims 1 to 8.