CN114022190A

CN114022190A - Advertisement aggregation method and device and computer equipment

Info

Publication number: CN114022190A
Application number: CN202111216923.7A
Authority: CN
Inventors: 李倓; 马然
Original assignee: Beijing Xiaoxiong Bowang Technology Co ltd
Current assignee: Beijing Xiaoxiong Bowang Technology Co ltd
Priority date: 2021-10-19
Filing date: 2021-10-19
Publication date: 2022-02-08

Abstract

The invention discloses an advertisement aggregation method, an advertisement aggregation device and computer equipment, wherein the method comprises the following steps: and carrying out advertisement aggregation configuration after obtaining the advertisement space access request, wherein the configuration mode is that all channels to be requested to be filled form a channel tree group, the channel tree group comprises more than two channel trees which are connected in series, each channel tree comprises a starting point and a plurality of channel nodes, and the channel nodes comprise: a channel node directly extending downwards from the starting point and serving as a superior channel node; the upper channel node and the lower channel nodes form parent-child channel nodes; and sequentially requesting advertisement filling for each channel node in each channel tree according to the priority sequence of the channel tree series connection. The channel organization mode is flexible, the intentions of the traditional serial mode and the traditional parallel mode are combined, the defects of the serial mode and the parallel mode are reasonably avoided, and the advertisement showing efficiency of the aggregation configuration method is improved.

Description

Advertisement aggregation method and device and computer equipment

Technical Field

The invention relates to the field of mobile internet advertisements, in particular to an advertisement aggregation method, an advertisement aggregation device and computer equipment.

Background

With the explosive growth of mobile services, more and more mobile internet companies are launching their own commercial presentation platforms. And the advertiser selects one or more specific advertisement platforms to put the advertisements according to the business requirements. The advertisement platform opens an advertisement slot to enable a traffic party (i.e. an APP developer) to access the advertisement slot, and distributes advertisements with different values for different traffic according to some properties of the traffic, such as the volume, the advertisement display rate, the advertisement click rate and the like.

In order to obtain relatively higher income, a traffic party usually accesses a plurality of advertisement platforms, then evaluates income data of each advertisement platform by self, and achieves the purpose of improving the phase change efficiency by regulating and controlling the distribution of traffic; the whole process relates to the research and development of systems such as client advertisement interactive interface design, configuration distribution system, data analysis and the like, and not every traffic party can build the whole set of system to improve the performance efficiency; moreover, even if the whole set of system is built, the revenue is promoted by zero exploration of the logical relationship between the traffic and the advertising revenue and how the traffic is distributed.

Under the background, the prototype requirement of the advertisement aggregation platform is basically formed, namely, the related advertisement behavior interaction of each advertisement platform is uniformly packaged through abstracting a new application interaction interface, then, the capability of segmenting the traffic to different advertisement platforms is provided for the traffic party by combining a configuration system, finally, the income and behavior related data are displayed for the access party (namely, an APP developer) through a data analysis system, and the optimized data reference is provided for the access party.

The common implementation modes of the advertisement channel aggregation scheme which is mainstream today are: the access party defines the combination rule of the channel aiming at the specific advertisement position in advance, namely the aggregation configuration, and the configuration is realized by a server of an aggregation platform; and the client of the aggregation platform receives the configuration and combines channels according to the configured rules to provide advertisement interaction service for the access party.

The current aggregation configuration mainly represents the following three modes:

the serial mode is that a plurality of advertisement channels are configured on a single advertisement position, the combination mode is serial connection, and advertisement service is provided for an access person through a mode of requesting filling and waiting for a return result from each channel of an advertisement platform one by one, so that the advertisement utilization rate is guaranteed. As shown in fig. 1, a plurality of advertisement channels such as channel 1 and channel 2 are allocated on an advertisement slot, and advertisement filling is requested one by one in a serial mode.

And a parallel mode, that is, all channels configured on the advertisement space initiate a filling request at the same time to provide advertisement service for the access person, thereby guaranteeing advertisement display opportunities, wherein the parallel mode is as shown in fig. 2, and the numbers in the figure still represent the configured advertisement channels.

And thirdly, a simple mixed mode, based on the serial mode and the parallel mode, the existing individual aggregation platform adopts the simple mixed mode, as shown in fig. 3,

channels

1, 3 and the like are configured to be a first serial mode,

channels

2, 4 and the like are configured to be a second serial mode, and channels at the same level in the first serial mode and the second serial mode are configured to be the parallel mode, for example, in the serial mode, two advertisement channels are simultaneously requested to be filled at a time on the same advertisement space.

The definition of these patterns mainly addresses and solves two issues of ad aggregation:

firstly, advertisement utilization rate:

the advertisement aggregation platform needs to improve the utilization rate of each advertisement channel as much as possible: namely advertisement display number/advertisement filling number, so as to avoid the phenomenon of too serious advertisement waste; because too low advertisement utilization rate may be marked as low quality traffic by the advertising platform side of the channel, subsequent advertisement filling behavior is affected, and then the impression rate is reduced.

The above serial mode is to ensure the rule defined under the advertisement utilization rate, that is, request filling one by one, and perform the request filling action of the next channel under the condition of confirming the failure of filling, thereby avoiding the advertisement waste phenomenon. However, it is because of the request-by-request that the whole advertisement filling period on the advertisement position is lengthened, so that the traffic party is likely to miss the advertisement showing opportunity due to time, thereby resulting in lower showing efficiency.

Secondly, advertisement display amount:

in order to provide advertisement materials for traffic parties as soon as possible, the aggregation platform can also request a plurality of advertisement channels for advertisement filling when receiving an advertisement position request of an access party, so as to fulfill the aim of meeting the advertisement display opportunity as much as possible.

The parallel mode is a configuration rule set on the premise of ensuring the advertisement display amount on the advertisement space. However, it is obvious that this model will inevitably result in other channels where a filling request occurs and even a successful filling is done last, which results in too low advertisement utilization due to no showing opportunity.

The hybrid mode is defined based on the above background in an attempt to mitigate the extreme scenarios of both modes, but is limited to a fixed structure and still cannot achieve higher rendering efficiency.

Disclosure of Invention

Therefore, it is necessary to provide an advertisement aggregation method, an advertisement aggregation device, and a computer device to solve the problem of low advertisement presentation efficiency of the existing aggregation configuration method.

A technical scheme of an advertisement aggregation method comprises the following steps:

s10: obtaining an access request of an advertisement position, and performing advertisement aggregation configuration after obtaining the access request, wherein the configuration mode comprises the following steps: forming a channel tree group by all channels to be requested to be filled, wherein the channel tree group comprises one channel tree or more than two channel trees which are connected in series, each channel tree comprises a starting point and a plurality of channel nodes, and each channel node comprises: a channel node directly extending downwards from the starting point and serving as a superior channel node; the upper channel node and the lower channel nodes form parent-child channel nodes;

s20: and according to the configuration mode of the channel tree group, sequentially requesting advertisement filling for each channel node in each channel tree according to the priority sequence of the channel tree series connection.

Further, in step S10, after determining a plurality of advertisement channels belonging to a certain channel tree, determining parent-child nodes in the channel tree according to the filling intersection rate between the channels; and when the filling cross rate between the two channels is greater than or equal to a set value, taking the two channels as parent-child nodes, wherein the channel with relatively high channel value is taken as an upper-level channel node, and the channel with relatively low channel value is taken as a lower-level channel node.

Further, in step S10, the determining the number of channel trees and the channel nodes includes:

p101: setting channel value intervals with set levels, wherein the ranges of the channel value intervals are not overlapped with each other;

p102: acquiring N channels to be filled with requests and corresponding channel values, and judging the value interval level of each channel value;

p103: channels belonging to the same channel value interval are used as channel nodes to form a channel tree; if two or more channel trees are formed, the channel trees are connected in series according to the channel value interval corresponding to the channel trees from high to low.

Further, in step S20, the advertisement filling requesting step is as follows:

s201: executing an advertisement filling request of a channel by a channel node directly extending downwards from a starting point in a parallel mode;

s202: the superior channel node and the inferior channel node directly mounted downward from the superior channel node execute the advertisement filling request of the channel in a serial mode.

Further, the specific steps of the advertisement filling request for any channel node in the channel tree include:

p201: requesting to fill advertisements to the channel nodes and triggering set overtime timing;

p202: judging whether a filling callback is received or not before overtime triggering, if the filling callback is received, entering a step P203, and if the filling callback is not received, entering a step P204;

p203: judging whether the advertisement channel is successfully filled according to the received filling call-back, and if the advertisement channel is successfully filled, marking that the channel node is successfully filled; if the filling is not successful, entering step P204;

p204: if the filling callback is not received before overtime triggering, or the filling callback is received but the filling is judged to be not successful, marking that the channel node is failed to fill, and enabling the channel node to enter a final state;

p205: judging whether the channel node entering the terminal state has a subordinate channel node or not, if not, maintaining the terminal state by the channel node; and if so, carrying out advertisement filling request and filling state marking of the lower-level channel node.

Further, setting first channel protection time for each channel tree, and if channel nodes with the highest relative channel value and successful advertisement filling exist in the first channel protection time, informing an access party of successful advertisement filling and entering a displayable state.

The beneficial effects of the above technical scheme are:

the advertisement aggregation method of the invention utilizes the aggregation mode of the channel tree group to carry out advertisement aggregation configuration, and the configuration mode is equivalent to two modes of organizing the traditional series: the method comprises the steps of connecting parent nodes and child nodes in a channel tree in series and connecting channel trees in series; and the parallel mode is adopted among the channel nodes which directly extend downwards from the starting point, the channel organization mode is flexible, the intentions of the traditional serial mode and the traditional parallel mode are combined, the defects of the serial mode and the parallel mode are reasonably avoided, and the advertisement showing efficiency of the aggregation configuration method is improved.

A technical scheme of an advertisement aggregation device comprises the following steps:

the advertisement configuration module is used for acquiring an access request of an advertisement space and performing advertisement aggregation configuration after the access request is acquired, and the configuration mode comprises the following steps: forming a channel tree group by all channels to be requested to be filled, wherein the channel tree group comprises one channel tree or more than two channel trees which are connected in series, each channel tree comprises a starting point and a plurality of channel nodes, and each channel node comprises: a channel node directly extending downwards from the starting point and serving as a superior channel node; the upper channel node and the lower channel nodes form parent-child channel nodes;

and the advertisement management module is used for sequentially requesting advertisement filling for each channel node in each channel tree according to the configuration mode of the channel tree group and the serial priority order of the channel trees.

Further, the advertisement configuration module is further configured to: after a plurality of advertisement channels belonging to a certain channel tree are determined, determining parent-child nodes in the channel tree according to the filling intersection rate among the channels; and when the filling cross rate between the two channels is greater than or equal to a set value, taking the two channels as parent-child nodes, wherein the channel with relatively high channel value is taken as an upper-level channel node, and the channel with relatively low channel value is taken as a lower-level channel node.

Further, the advertisement management module is further configured to: executing an advertisement filling request of a channel in a parallel mode for channel nodes directly extending downwards from a starting point; and executing the advertisement filling request of the channel in a serial mode for the upper channel node and the lower channel node directly mounted downwards by the upper channel node.

The beneficial effects of the above technical scheme are:

the advertisement aggregation device of the invention carries out advertisement aggregation configuration by utilizing the aggregation mode of the channel tree group through the advertisement configuration module and the advertisement management module, and the configuration mode is equivalent to two modes of organizing the traditional serial: the method comprises the steps of connecting parent nodes and child nodes in a channel tree in series and connecting channel trees in series; and the parallel mode is adopted among the channel nodes which directly extend downwards from the starting point, the channel organization mode is flexible, the intentions of the traditional serial mode and the traditional parallel mode are combined, the defects of the serial mode and the parallel mode are reasonably avoided, and the advertisement showing efficiency of the aggregation configuration method is improved.

The technical scheme of the computer device comprises a memory, a processor and computer readable instructions which are stored in the memory and can run on the processor, wherein the processor executes the computer readable instructions to realize the advertisement aggregation method.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments of the present invention will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without inventive labor.

FIG. 1 is a schematic diagram of an aggregation configuration in a serial mode according to the prior art;

FIG. 2 is a schematic diagram of an aggregation configuration in a parallel mode according to the prior art;

FIG. 3 is a schematic diagram of a polymerization configuration using a simple mixing mode according to the prior art;

FIG. 4 is a diagram of an application environment of an advertisement aggregation method according to an embodiment of the present invention;

FIG. 5 is a flow chart illustrating an advertisement aggregation method according to an embodiment of the present invention;

FIG. 6 is a schematic diagram of the determination process of the number of channel trees and channel nodes according to an embodiment of the present invention;

FIG. 7 is a statistical graph of filling cross-over rates between channels in accordance with an embodiment of the present invention;

FIG. 8 is a schematic flow chart illustrating a request flow of advertisement filling for each channel node according to an embodiment of the present invention;

FIG. 9 is a diagram illustrating a configuration structure of a channel tree group according to an embodiment of the present invention;

FIG. 10 is a flow diagram illustrating an advertisement fill request for any channel node in a channel tree according to an embodiment of the present invention;

11-1, 11-2, 11-3 are data statistics of advertisement fill duration in one embodiment of the present invention;

FIG. 12 is a schematic diagram illustrating a state flow of each channel tree according to an embodiment of the present invention;

FIG. 13 is a schematic view of an embodiment of an advertisement aggregation device;

FIG. 14 is a schematic diagram of a computer device in an embodiment of the invention.

Detailed Description

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. 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 invention.

The advertisement aggregation method provided by this embodiment can be applied to the application environment as shown in fig. 4, in which a client communicates with a server. The client includes, but is not limited to, various personal computers, notebook computers, smart phones, tablet computers, and portable wearable devices. The server can be implemented by an independent server or a server cluster composed of a plurality of servers.

In an embodiment, as shown in fig. 5, an advertisement aggregation method is provided, which is described by taking the application of the method to the server side in fig. 4 as an example, and includes the following steps:

s10: obtaining an access request of an advertisement position, and performing advertisement aggregation configuration after obtaining the access request, wherein the configuration mode comprises the following steps: forming a channel tree group by all channels to be requested to be filled, wherein the channel tree group comprises one channel tree or more than two channel trees which are connected in series, each channel tree comprises a starting point and a plurality of channel nodes, and the channel nodes comprise: the channel node directly extending downwards from the starting point, the lower-level channel node directly mounted on the upper-level channel node downwards, and the upper-level channel node and the lower-level channel node form a parent-child channel node.

It can be understood that the number of channel trees and channel nodes in this step are determined according to the value interval of the advertisement channel, and the determining steps of the number of channel trees and channel nodes are shown in fig. 6 and include:

p101: setting a plurality of levels of channel value intervals, for example setting three levels of intervals, namely a high level channel value interval, a middle level channel value interval and a low level channel value interval, wherein the value in the high level channel value interval is greater than the value in the middle level channel value interval, and the value in the middle level channel value interval is greater than the value in the low level channel value interval.

P102: acquiring N channels to be filled with requests and corresponding channel values, and judging the value interval level of the channel values, namely a high-level channel value interval, a middle-level channel value interval or a low-level channel value interval.

For example, the value of N1 channels among the N channels belongs to a high-level channel value section, N1 advertisement channels are combined into a first channel tree, the first channel tree includes a first start point and N1 channel nodes; if the value of N2 channels in the N channels belongs to the intermediate channel value interval, combining N2 advertisement channels into a second channel tree, wherein the second channel tree comprises a second starting point and N2 channel nodes; similarly, the value of N3 channels of the N channels belongs to a low level channel value range, combining N3 advertisement channels into a third channel tree, the third channel tree including a third starting point and N3 channel nodes.

It will be appreciated that the sum of the N1 channels of the first channel tree, the N2 channels in the second channel tree and the N3 channels in the third channel tree is the total number of channels to fill the request, i.e., N1+ N2+ N3 ═ N.

In this step, after the judgment in step P102, if a channel belonging to a certain channel value section is zero, a channel tree cannot be constructed, for example, when n1 ═ 0, n2 ≠ 0, and n3 ≠ 0, two channel trees are constructed; if n1 is 0, n2 is 0, and n3 is not equal to 0, only one channel tree is constructed, which is not an example.

In another embodiment, the channel value intervals can be further divided into more than three channel value intervals with different levels, so that the N channels can be more finely divided into more channel trees, and the traffic change efficiency is improved.

In another embodiment, the channel tree may be determined by classifying the N channels of the request to be populated, instead of determining the channel tree according to the value interval of the advertisement channel, the specific steps are as follows:

the values of N channels are classified by using a clustering algorithm (such as a K-Means algorithm and the like), the number of the classified categories is the number of channel trees, each category of channel forms a channel tree, the priority level of each channel tree is determined according to the channel value of the clustering center of each category, and the channel trees are connected in series.

Further, after a plurality of advertisement channels belonging to a certain channel tree are determined, determining parent-child nodes in the channel tree according to the filling intersection rate among the channels; and when the filling cross rate between the two channels is greater than or equal to a set value (such as 90%), taking the two channels as parent-child nodes, wherein the channel with relatively high channel value is taken as an upper channel node, and the channel with relatively low channel value is taken as a lower channel node directly mounted downwards by the upper channel node.

Understandably, the fill crossing rate is used to indicate the probability of the ads of two channels being filled at a particular ad slot at the same time; for example, the existing traditional parallel ad slot (all channel ads on the ad slot always initiate request filling simultaneously with the request for filling the ad slot) is configured with the following channels a, B, C from high to low by value, and the ad slot initiates 300 filling requests and 300 shows on a certain day; the channel A is filled for 100 times, the channel B is filled for 200 times and the channel C is filled for 240 times on the same day, wherein the channel A and the channel B are low in filling rate due to the fact that the channel A and the channel B are provided with advertisement base prices and belong to high-value advertisement channels, relatively high advertisement utilization rate needs to be kept for the channels, and the channel C is used as a base-guaranteeing channel without base prices, so that high advertisement utilization rate does not need to be guaranteed deliberately.

The value of the ad slot is greatest when the 300 impressions consist of 100 impressions A and 200 impressions B. However, in practice the presentation distribution may be such that: 80 parts of A, 100 parts of B and 120 parts of C; at this time, the advertisement utilization rate of each channel is A: 80/100-80%, B: 100/200-50% and C: 120/240-50%.

If the filling quantity of B is 90 observed in 100 times of data of a filling, the filling intersection rate of B relative to a is 90%, and since B has a lower value than a, the 90 times of filling is definitely wasted. Thus, in a parallel configuration, too high a fill-crossing rate directly results in reduced advertisement utilization. In the above example, it is considered that the channel B is organized behind the node a in a parent-child node manner, that is, the channel a is an upper-level channel node, and the channel B is a lower-level channel node, so that it is ensured that the filling request of the channel B is performed on the premise that the filling of the channel a fails, and repeated filling of the channel A, B is avoided, so that the advertisement utilization rate of the channel B is significantly improved.

In the step, after the channel nodes with the parent-child relationship are determined, the superior channel nodes and the channel nodes without the parent-child relationship are directly mounted below the starting point.

In this step, the starting point for determining the parent-child node in the channel tree by adopting the filling cross rate is as follows:

considering that when channel nodes in the same channel tree are serially configured in a parent-child mode, the method not only expresses the serial filling behavior in the traditional sense, but also plays a role in promoting the utilization rate of advertisements; after observing and analyzing a large amount of advertisement filling behavior data of the traditional parallel advertisement positions, setting another data index, namely the filling cross rate, which is favorable for neutralizing the defects of the traditional parallel mode in a self-defined way.

FIG. 7 shows some legend data relating to fill cross-rates: the abscissa is a channel list which is configured on the advertisement space and is from high to low according to channel value, wherein the histogram of the 6 th channel from left to right, which corresponds to the ordinate, represents the total amount of data successfully filled in the channel, and the histograms of the other channels represent the total amount of data successfully filled in the other channels when the 6 th channel is successfully filled; thus, by observing the height difference between the histogram and narrow histograms of other channels, the data in the aspect of relevant filling cross coverage can be seen; for example, if the difference between the 6 th channel and the 11 th channel is within 10%, it represents that there is a high probability that the advertisements of one of the channels will be wasted when the two channels request filling in parallel.

In addition, the wide bar graph part in the upper graph represents the total number of the displays corresponding to the filled advertisements, and 1 and 2 channels are observed, and because the filling cross rate of the 1 and 2 channels is high, the 2 nd channel has approximately half of the advertisement waste, and the waste phenomenon is more serious in the later channels.

Therefore, for the above reasons, the present invention finds that in a channel tree, the serial relationship of channels can also be used to avoid the advertisement waste phenomenon caused by an excessive filling intersection rate, and the advertisement serial configuration itself should not always be based on the unique criterion of advertisement channel value, so that the filling intersection rate is used to determine the parent-child nodes in the channel tree to avoid advertisement waste.

S20: and according to the configuration mode of the channel tree group, sequentially requesting advertisement filling for each channel node in each channel tree according to the priority sequence of the channel tree series connection. As shown in fig. 8, the advertisement filling request steps are as follows:

It can be appreciated that one channel tree set configuration is shown in FIG. 9, which is organized in a channel tree top-down manner; each channel tree comprises two node types of a starting point and a channel, wherein the direct child nodes extending downwards from each node (including the starting point and the channel node) execute the advertisement filling request of the channel in a traditional parallel mode; as the direct parent-child node of the first starting point of the first channel tree:

channels

1,2,3 will simultaneously initiate fill requests in a parallel fashion.

Other channel nodes can still be mounted under each channel node to serve as parent-child nodes, and after the superior channel nodes enter the terminal state, the subordinate nodes still simultaneously initiate a new round of filling requests in a parallel mode; for example, in the first channel tree, the

channel nodes

4 and 5 are mounted under the channel node 2 as parent and child nodes thereof, and after the channel node 2 enters the terminal state, the

channel nodes

4 and 5 simultaneously initiate a new round of filling requests; in the first channel tree, a parent-child node does not exist under a channel node 1, and a lower-level channel node 6 is mounted under a channel node 3; in the second channel tree, the direct parent-child nodes of the second starting point are a channel node 7 and a channel node 8, and an advertisement filling request is simultaneously sent to the two channel nodes in a parallel mode; further, the channel node 7 has no parent-child node, and the channel node 8 has one lower-level channel node 9 mounted thereon.

In one embodiment, in order to ensure that the overall filling period on the advertisement space is not too long, the overtime timing of advertisement filling of the channel nodes needs to be set, and the channel nodes which are successfully filled with the advertisements are marked to be successfully filled within the overtime timing; if the overtime is triggered, the filling is marked to fail.

It can be understood that the specific steps for an advertisement fill request to any channel node in a channel tree are shown in fig. 10, and include:

p201: requesting to fill advertisements to the channel node (meaning the advertisement channel of a certain node in the channel tree), and triggering the set overtime timing;

understandably, the fill callbacks include reply messages that an ad was successfully filled or reply messages that a fill failed. The filling timeout time of the common node is usually about 1-2 s, that is, the timeout time is set in the step P201 to be 1-2 s, because more than 80% of data in most advertisement channels can be obtained to obtain the filling state callback in the time period through data observation, no matter success or failure; however, there are some special cases that the filling-back time of a specific channel is too long, for example, too many channel nodes are configured on an advertisement slot, and the filling-back time of the following nodes is generally longer than that of the preceding nodes, so that the timeout of the superior channel node and the inferior channel node needs to be adjusted according to the actual situation.

P204: and if the filling call-back is not received before overtime triggering, or the filling call-back is received but the filling is judged to be not successful, marking that the channel node is failed to fill, and enabling the channel node to enter a final state.

Understandably, the final state definition of a channel node is: the channel node is at this point in time in a terminated state when the channel node itself fails to fill or the filling time of the channel node exceeds a predefined timeout time (i.e., timeout).

The final state meaning of the channel node setting is as follows: the biggest problem under the traditional serial mode is that on the premise of ensuring the advertisement utilization rate, the whole filling period is prolonged, so that the advertisement display amount is reduced, and the showing efficiency is reduced. However, by observing some data of advertisement filling duration, such as the advertisement filling callback (including filling success and filling failure) duration data distribution diagrams shown in fig. 11-1, 11-2, and 11-3, wherein the abscissa is the time elapsed in seconds from the filling request to the filling callback; the left ordinate is the number of statistical data entries, and the right ordinate represents the proportion of the number of entries occurring within the corresponding time to the total data.

As can be seen from the above three figures, over 80% and even 90% of data of some channels can complete the filling request within 1s, but there are some channels with 10% of data with the filling time distributed between 3-4 s; therefore, macroscopically, the filling overtime can be set for the channel node to ensure that a majority of users avoid overlong filling time in the serial request to influence the advertisement display amount.

Therefore, each channel node in the channel tree directly initiates the parallel filling behavior of the downstream parent-child nodes by taking the terminal state as the starting point, and the defects of the serial mode can be neutralized on the premise of self-defining influence amplitude.

P205: judging whether the channel node entering the terminal state has a subordinate channel node (namely a child node), if not, the channel node maintains the terminal state; if yes, making the advertisement filling request and the filling state mark of the lower channel node, namely repeating the steps P201-P205.

To maximize advertising revenue at a particular ad slot, one of the most important responsibilities of the ad syndication platform is to always select the most valuable channel for the ad slot to be exposed. But in a channel tree configuration, channels that may be of low value fill ahead of time preempting the show opportunity due to the difference in fill time periods for each channel.

In order to avoid such a phenomenon, in another embodiment, an initial channel protection time is further set for each channel tree, and before the channel node with the relatively highest value enters the final state, the access party is not notified that the advertisement filling enters the demotable state, the initial channel protection time is generally determined by the maximum time allowed to wait for advertisement showing on the corresponding advertisement slot, and the state flow of the channel tree is as shown in fig. 12 below, and includes the following steps:

traversing channel nodes in the channel tree according to the structure of the current channel tree, carrying out an advertisement filling request, and triggering overtime timing of the first channel protection time.

Detecting whether channel nodes are successfully filled with advertisements or not within the first channel protection time, if no channel nodes are successfully filled with advertisements, namely the first channel protection time is overtime, judging whether channel nodes which are successfully filled exist or not, if yes, informing an access party that the advertisements are successfully filled, and entering a displayable state; if not, entering a channel tree terminal state; continuously judging whether the current channel tree has a downstream channel tree connected with the current channel tree in series, if so, entering the downstream channel tree; if not, the terminal state of the channel tree is maintained.

If the channel node is successfully filled with the advertisement, judging whether the channel node is a set relative first channel, if so, informing an access party that the advertisement is successfully filled, and entering a displayable state; if not, judging whether all channel nodes enter a final state, if not, waiting for a new channel filling callback or overtime of the first channel protection time; if yes, entering a channel ending state; continuously judging whether the current channel tree has a downstream channel tree connected with the current channel tree in series, if so, entering the downstream channel tree; if not, the terminal state of the channel tree is maintained.

It is understood that the relative head channel protected in the head channel protection time set in each channel tree is not specific to a certain highest-value channel (i.e. channel node), and the head channel protection time is not specific to protecting a specific channel, and is a relative concept referring to the highest-value channel in the rest advertisement channels without obtaining the filling state callback.

For example, three channels, such as channels a, B, and C, have values from high to low, and are combined in parallel into a channel tree, the first channel protection time is set to 5s, when an advertisement filling request occurs, the three channels trigger a filling request in parallel, when the channel C is successfully filled in 0.5s, because within 5s, it is detected whether the first channel, i.e., channel a, is filled, what is protected at this time is the utilization rate of channel a, whereas when the channel a fails to be filled in 1.5s, because it is still within 5s of the protection time, but the channel B has not returned a filling state (i.e., filling callback), and the value of channel B is higher than that of channel C, what is protected at this time is the utilization rate of channel B.

Understandably, first channel guard time is generally data that needs to be customized for different ad slots comprehensively considering product experience and impression rate; for example, in the screen-opening position, the first channel protection time range is usually set to be 2-3 s, and due to the excessive time, although the maximum advertisement showing efficiency is guaranteed, the user may blindly wait for too long time on the screen-opening page in the product experience; if the time is too short, the hit value is low in a high probability, and a high-fidelity channel is filled, so that the occurrence efficiency is too low; on the screen-inserted advertisement position jumped in the application, the product can often request to fill advertisements in advance through a preloading mode, and in the condition, a larger first channel protection time such as 5s is usually selected to preferentially ensure the advertisement showing efficiency.

It should be noted that the reason why the configuration is presented in the form of channel tree group by re-connecting the channel trees is as follows:

the serial configuration in a single channel tree cannot strictly replace the traditional serial intention, and the traditional serial configuration hierarchy organizes channels from top to bottom completely according to channel values, namely the filling request time of each layer in the time dimension is uniform; however, in a single channel tree, branches are gradually flourishing according to channel nodes, from the perspective of time, channel nodes at the same depth do not necessarily initiate requests simultaneously, and channel nodes at the same depth do not represent the same value range, because parent nodes of channel nodes at the same depth are different, the situation that channels at different value intervals may initiate requests for filling simultaneously at the same time is caused.

Therefore, in order to ensure a mode that the channel value is integrally layered and pushed downwards, the channel trees are connected in series in an array form, channel nodes with similar values are configured in each channel tree, the channel nodes are combined into a tree structure through filling cross rate, and filling is requested in a structured parallel mode; when all channel nodes in the whole channel tree enter a terminal state or the channel node exceeds the first channel protection time, the whole pulling process enters the next channel tree after the channel node enters the terminal state, namely the channel structure combination of the next value interval.

In conclusion, the channel configuration structure defined by the invention not only solves the defects of the traditional parallel-serial structure, but also provides a very flexible configuration mode, and even innovatively defines a filling cross rate index to indicate how to further improve the advertisement utilization rate on the premise of ensuring the display amount in the parallel structure based on data analysis; the introduction of a first channel protection time mechanism ensures that an access party can ensure the aim of presenting the maximum value advertisement as much as possible on the premise of balancing advertisement income and product experience according to self requirements; channels with different value intervals are isolated through the hierarchical tree, the utilization rate of the high-value advertisement is improved on the premise of further ensuring the maximum achievement efficiency.

The advertisement polymerization method of the invention has the following advantages:

the method for advertisement aggregation configuration by using the aggregation mode of the channel tree group is equivalent to two modes for organizing the traditional serial: the method comprises the steps of connecting parent nodes and child nodes in a channel tree in series and connecting channel trees in series; in any case, the problem of overlong filling period caused by configuration in a traditional serial mode can be solved to the greatest extent through the overtime time of the channel node or the first channel protection time.

Secondly, the channel nodes in the channel tree can be organized into parent-child nodes according to the set filling cross rate index, and the problem of low advertisement utilization rate is avoided by combining the overtime attribute of the channel nodes.

And thirdly, the presentation of the advertisement of the channel with the maximum value on the advertisement position is ensured through the first channel protection time of the channel tree, the index of the advertisement aggregation platform for improving the advertisement showing efficiency is improved by combining the characteristics of a serial-parallel structure through a tree structure, and the defect of a corresponding extreme mode is avoided as much as possible.

And fourthly, different from the traditional simple mixed mode, the channel tree group is not limited to the number of channels in the same layer, even to the single parallel structure in the same layer.

In conclusion, the invention provides a very flexible channel organization mode through the aggregation mode of the channel tree group, not only combines the intentions of the traditional serial mode and the traditional parallel mode, but also reasonably avoids the defects of the serial mode and the parallel mode, and improves the advertisement showing efficiency of the aggregation configuration method.

It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.

In an embodiment, an advertisement aggregation device is provided, and the advertisement aggregation device corresponds to the advertisement aggregation method in the above embodiments one to one. As shown in fig. 13, the advertisement aggregation apparatus includes an advertisement configuration module and an advertisement management module. The functional modules are explained in detail as follows:

the advertisement configuration module is used for acquiring an access request of an advertisement space and performing advertisement aggregation configuration after the access request is acquired, and the configuration mode comprises the following steps: forming a channel tree group by all channels to be requested to be filled, wherein the channel tree group comprises one channel tree or more than two channel trees which are connected in series, each channel tree comprises a starting point and a plurality of channel nodes, and each channel node comprises: a channel node directly extending downwards from the starting point and serving as a superior channel node; and the superior channel nodes and the subordinate channel nodes form parent-child channel nodes.

For the specific definition of the advertisement aggregation device, reference may be made to the above definition of the advertisement aggregation method, which is not described herein again. The modules in the advertisement aggregating device may be implemented in whole or in part by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.

In one embodiment, a computer device is provided, which may be a terminal, and its internal structure diagram may be as shown in fig. 14. The computer device includes a processor, a memory, a network interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a readable storage medium and an internal memory. The non-volatile storage medium stores an operating system and computer readable instructions. The internal memory provides an environment for the operating system and execution of computer-readable instructions in the readable storage medium. The network interface of the computer device is used for communicating with an external server through a network connection. The computer readable instructions, when executed by a processor, implement a method of advertisement aggregation. The readable storage media provided by the present embodiment include nonvolatile readable storage media and volatile readable storage media.

It will be understood by those of ordinary skill in the art that all or part of the processes of the methods of the above embodiments may be implemented by hardware related to computer readable instructions, which may be stored in a non-volatile readable storage medium or a volatile readable storage medium, and when executed, the computer readable instructions may include processes of the above embodiments of the methods. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions.

The above-mentioned embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present invention, and are intended to be included within the scope of the present invention.

Claims

1. An advertisement aggregation method, comprising the steps of:

2. The advertisement aggregation method according to claim 1, wherein in step S10, after determining a plurality of advertisement channels belonging to a certain channel tree, determining parent-child nodes in the channel tree according to a filling intersection rate between the channels; and when the filling cross rate between the two channels is greater than or equal to a set value, taking the two channels as parent-child nodes, wherein the channel with relatively high channel value is taken as an upper-level channel node, and the channel with relatively low channel value is taken as a lower-level channel node.

3. The advertisement aggregation method of claim 1 or 2, wherein the determining of the number of channel trees and the channel nodes in step S10 comprises:

4. The advertisement aggregation method of claim 1, wherein in step S20, the advertisement filling requesting step is as follows:

5. The advertisement aggregation method of claim 4, wherein the specific step for an advertisement fill request to any one channel node in a channel tree comprises:

6. The advertisement aggregation method according to claim 4 or 5, wherein an initial channel protection time is set for each channel tree, and in the initial channel protection time, if there is a channel node having the highest relative channel value and an advertisement being successfully populated, the access party is notified that the advertisement being successfully populated enters a demotable state.

7. An advertisement aggregation device, comprising:

8. The advertisement aggregation apparatus of claim 7, wherein the advertisement configuration module is further configured to: after a plurality of advertisement channels belonging to a certain channel tree are determined, determining parent-child nodes in the channel tree according to the filling intersection rate among the channels; and when the filling cross rate between the two channels is greater than or equal to a set value, taking the two channels as parent-child nodes, wherein the channel with relatively high channel value is taken as an upper-level channel node, and the channel with relatively low channel value is taken as a lower-level channel node.

9. The advertisement aggregation apparatus of claim 7, wherein the advertisement management module is further configured to: executing an advertisement filling request of a channel in a parallel mode for channel nodes directly extending downwards from a starting point; and executing the advertisement filling request of the channel in a serial mode for the upper channel node and the lower channel node directly mounted downwards by the upper channel node.

10. A computer device comprising a memory, a processor, and computer readable instructions stored in the memory and executable on the processor, wherein the processor, when executing the computer readable instructions, implements the ad aggregation method of any of claims 1-6.