Advertisement aggregation method, device and computer equipment

Abstract

The present invention discloses an advertisement aggregation method, device and computer equipment. The method includes: after obtaining an advertisement position access request, advertisement aggregation configuration is performed, and the configuration method is to form a channel tree group with all channels to be requested to be filled, and the channel tree group includes more than two channel trees connected in series, and each channel tree includes a starting point and a plurality of channel nodes, and the channel nodes include: a channel node directly extending downward from the starting point, used as an upper channel node; and a lower channel node directly mounted downward from the upper channel node, and the upper channel node and the lower channel node constitute a parent-child channel node; according to the priority order of the channel tree series, each channel node in each channel tree is sequentially requested to be filled with advertisements. This channel organization method is relatively flexible, combines the intentions of the traditional serial mode and the parallel mode, and reasonably avoids the disadvantages of the serial mode and the parallel mode, and improves the advertisement realization efficiency of the aggregation configuration method.

Description

Technical Field

[0001] The present invention relates to the field of mobile Internet advertising, and in particular to an advertising aggregation method, device and computer equipment. Background Art

[0002] With the explosive growth of mobile business, more and more mobile Internet companies have launched their own commercial advertising monetization platforms. Advertisers choose one or more specific advertising platforms to place advertisements based on their business needs. The advertising platform opens advertising space for traffic parties (i.e. APP developers) to access, and distributes advertisements of different values ​​to different traffic based on some properties of traffic, such as volume, ad display rate, ad click rate, etc.

[0003] In order to obtain relatively higher profits, traffic providers often connect to multiple advertising platforms, evaluate the revenue data of each platform, and then adjust the distribution of traffic to achieve the purpose of improving disguised efficiency. The whole process involves the design of client advertising interaction interfaces, the configuration of distribution systems, and the research and development of data analysis systems. Not every traffic provider has the ability to build a complete system to serve to improve monetization efficiency. Moreover, even if a complete system is built, it is still necessary to explore from scratch the logical relationship between traffic and advertising revenue and how to allocate traffic to increase revenue.

[0004] In this context, the embryonic demand for an advertising aggregation platform has basically taken shape, that is, by abstracting new application interaction interfaces to uniformly encapsulate the relevant advertising behavior interactions of various advertising platforms, and then combining the configuration system to provide traffic parties with the ability to split traffic to different advertising platforms. Finally, through the data analysis system, the revenue and behavior-related data are displayed to the access party (i.e. APP developers), providing the access party with data reference for optimization.

[0005] The general implementation model of today's mainstream advertising channel aggregation solutions is: the access party defines the channel combination rules for specific advertising positions in advance, namely the aggregation configuration, which is implemented through the server of the aggregation platform; the client of the aggregation platform receives the configuration and combines channels according to the configured rules to provide advertising interaction services to the access party.

[0006] Currently, the aggregation configuration mainly manifests itself in the following three modes:

[0007] 1. Serial mode, that is, multiple advertising channels are configured on a single advertising position, and the combination mode is serial. By requesting filling from each channel of the advertising platform one by one and waiting for the return result, the accessor is provided with advertising services to ensure the advertising utilization rate. Figure 1 As shown, a certain ad slot is configured with several ad channels such as channel 1 and channel 2, and ad filling is requested one by one in serial mode.

[0008] Second, parallel mode, that is, all channels configured on the ad slot initiate fill requests at the same time to provide advertising services to the accessor, thereby ensuring the opportunity for ad display. Figure 2 As shown, the numbers in the figure still represent the configured advertising channels.

[0009] 3. Simple hybrid mode. Based on the above serial mode and parallel mode, some existing aggregation platforms have adopted a simple hybrid mode. Figure 3 As shown, the configured channels 1, 3, etc. are in the first serial mode, and channels 2, 4, etc. are in the second serial mode. The channels at the same level in the first serial mode and the second serial mode are in parallel mode. For example, in the serial mode, two advertising channels are requested to fill the same ad slot at the same time.

[0010] The definition of these models focuses on solving two problems of advertising aggregation:

[0011] 1. Advertising utilization rate:

[0012] Ad aggregation platforms should try to increase the utilization rate of each advertising channel: that is, the number of ad impressions / ad fills, to avoid excessive advertising waste; because too low ad utilization may be marked as low-quality traffic by the advertising platform that controls the channel, thereby affecting subsequent ad filling behavior, and further leading to reduced monetization efficiency.

[0013] The serial mode above is to ensure the rules defined under the advertising utilization rate, that is, to request filling one by one, and to request filling from the next channel when filling fails, so as to avoid advertising waste. However, it is precisely because of the one-by-one request that the entire advertising filling cycle on the ad slot is prolonged, so that the traffic party may miss the opportunity to display the ad due to time, resulting in lower monetization efficiency.

[0014] 2. Ad impressions:

[0015] In order to provide advertising materials to the traffic party as quickly as possible, the aggregation platform can also request multiple advertising channels to fill advertisements at the same time when receiving the ad space request from the access party, so as to achieve the purpose of satisfying the advertising display opportunities as much as possible.

[0016] The parallel mode is a configuration rule set to ensure the number of ads displayed on the ad slots. However, it is obvious that this mode will inevitably cause other channels that have received fill requests or even successfully filled to not get the opportunity to be displayed, resulting in too low ad utilization.

[0017] The hybrid model was defined based on the above background in an attempt to alleviate the extreme scenarios of the two models, but it is still unable to achieve higher monetization efficiency due to the limitations of the fixed structure. Summary of the invention

[0018] Based on this, it is necessary to provide an advertising aggregation method, device and computer equipment to address the above technical problems, so as to solve the problem of low advertising monetization efficiency of existing aggregation configuration methods.

[0019] A technical solution for an advertisement aggregation method, comprising:

[0020] S10: Obtaining an access request for an ad space. After obtaining the access request, performing ad aggregation configuration, the configuration method includes: forming a channel tree group with all channels to be requested for filling, wherein the channel tree group includes one channel tree, or two or more channel trees connected in series, wherein each channel tree includes a starting point and a plurality of channel nodes, wherein the channel nodes include: a channel node directly extending downward from the starting point, serving as an upper-level channel node; and a lower-level channel node directly mounted downward from the upper-level channel node, wherein the upper-level channel node and the lower-level channel node constitute a parent-child channel node;

[0021] S20: According to the configuration mode of the channel tree group and in accordance with the priority order of the channel trees in series, request advertisement filling for each channel node in each channel tree in turn.

[0022] Furthermore, in step S10, after determining a number of advertising channels belonging to a certain channel tree, the parent and child nodes in the channel tree are determined according to the fill cross rate between each channel; when the fill cross rate between two channels is greater than or equal to the set value, the two channels are used as parent and child nodes, among which the channel with relatively higher channel value is used as the upper channel node, and the channel with relatively lower channel value is used as the lower channel node.

[0023] Furthermore, in step S10, the step of determining the number of channel trees and channel nodes includes:

[0024] P101: Set the channel value range of the set level, and the ranges of the channel value ranges do not overlap;

[0025] P102: Get the N channels to be filled and the corresponding channel values, and determine the value interval level to which each channel value belongs;

[0026] P103: Channels belonging to the same channel value range are taken as channel nodes to form a channel tree; if two or more channel trees are formed, the channel trees are connected in series from high to low according to the channel value ranges corresponding to the channel trees.

[0027] Furthermore, in step S20, the request steps for advertisement filling are as follows:

[0028] S201: The channel nodes extending directly downward from the starting point execute the advertisement filling request of the channel in parallel mode;

[0029] S202: The upper-level channel node and the lower-level channel node directly mounted below the upper-level channel node execute the advertisement filling request of the channel in a serial mode.

[0030] Furthermore, the specific steps for requesting advertisement filling for any channel node in the channel tree include:

[0031] P201: Requesting the channel node to fill in advertisements and triggering a set timeout;

[0032] P202: Determine whether a filling callback is received before the timeout is triggered. If a filling callback is received, proceed to step P203. If no filling callback is received, proceed to step P204.

[0033] P203: Determine whether the advertising channel is successfully filled according to the received filling callback. If it is successfully filled, mark the channel node as successfully filled; if not, proceed to step P204;

[0034] P204: If no filling callback is received before the timeout is triggered, or if a filling callback is received but it is judged that the filling is not successful, the channel node is marked as filling failure and the channel node enters the terminal state;

[0035] P205: Determine whether the channel node entering the terminal state has a subordinate channel node. If not, the channel node maintains the terminal state; if so, an advertisement filling request and filling status mark of the subordinate channel node are made.

[0036] Furthermore, a first channel protection time is set for each channel tree. During the first channel protection time, if there is a channel node with the highest relative channel value and successful advertisement filling, the access party is notified that the advertisement filling is successful and enters a displayable state.

[0037] The beneficial effects of the above technical solution are:

[0038] The advertising aggregation method of the present invention utilizes the aggregation mode of the channel tree group to perform advertising aggregation configuration. This configuration mode is equivalent to providing two ways of organizing traditional serials: the series connection of parent and child nodes within the channel tree and the series connection between channel trees; and the channel nodes extending directly downward from the starting point are in parallel mode. This channel organization mode is more flexible, combining the intentions of the traditional serial mode and the parallel mode, and reasonably avoiding the drawbacks of the serial mode and the parallel mode, thereby improving the advertising realization efficiency of the aggregation configuration method.

[0039] A technical solution of an advertisement aggregation device, comprising:

[0040] The advertisement configuration module is used to obtain the access request of the advertisement position, and after obtaining the access request, the advertisement aggregation configuration is performed, and the configuration method includes: forming a channel tree group with all the channels to be requested to be filled, wherein the channel tree group includes a channel tree, or two or more channel trees connected in series, wherein each channel tree includes a starting point and a plurality of channel nodes, wherein the channel nodes include: a channel node directly extending downward from the starting point, used as an upper channel node; and a lower channel node directly mounted downward from the upper channel node, wherein the upper channel node and the lower channel node constitute a parent-child channel node;

[0041] The advertisement management module is used to request advertisement filling for each channel node in each channel tree in turn according to the configuration mode of the channel tree group and the priority order of the channel tree series.

[0042] Furthermore, the advertising configuration module is also used to: after determining several advertising channels belonging to a certain channel tree, determine the parent and child nodes in the channel tree according to the filling cross rate between each channel; when the filling cross rate between two channels is greater than or equal to the set value, the two channels are used as parent and child nodes, among which the channel with relatively higher channel value is used as the upper channel node, and the channel with relatively lower channel value is used as the lower channel node.

[0043] Furthermore, the advertising management module is also used to: execute channel advertising filling requests in parallel mode for channel nodes directly extending downward from the starting point; and execute channel advertising filling requests in serial mode for upper channel nodes and lower channel nodes directly mounted downward from the upper channel nodes.

[0044] The beneficial effects of the above technical solution are:

[0045] The advertising aggregation device of the present invention performs advertising aggregation configuration by using an advertising configuration module and an advertising management module, and utilizing an aggregation method of a channel tree group. This configuration method is equivalent to providing two ways of organizing traditional serial connections: the series connection of parent and child nodes within a channel tree and the series connection between channel trees; and the channel nodes extending directly downward from the starting point are in parallel mode. This channel organization method is relatively flexible, combining the intentions of the traditional serial mode and the parallel mode, and reasonably avoiding the drawbacks of the serial mode and the parallel mode, thereby improving the advertising realization efficiency of the aggregation configuration method.

[0046] A technical solution for a computer device includes a memory, a processor, and computer-readable instructions stored in the memory and executable on the processor, wherein the processor implements the above-mentioned advertisement aggregation method when executing the computer-readable instructions. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings required for use in the description of the embodiments of the present invention will be briefly introduced below. Obviously, the accompanying drawings in the following description are only some embodiments of the present invention. For ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without paying creative labor.

[0048] Figure 1 It is a schematic diagram of the aggregation configuration structure using a serial mode in the prior art of the present invention;

[0049] Figure 2 It is a schematic diagram of an aggregation configuration structure using a parallel mode in the prior art of the present invention;

[0050] Figure 3 It is a schematic diagram of the polymerization configuration structure using a simple mixing mode in the prior art of the present invention;

[0051] Figure 4 is a schematic diagram of an application environment of an advertisement aggregation method in an embodiment of the present invention;

[0052] Figure 5 is a flow chart of an advertisement aggregation method according to an embodiment of the present invention;

[0053] Figure 6 is a schematic diagram of a process for determining the number of channel trees and channel nodes in one embodiment of the present invention;

[0054] Figure 7 is a statistical graph of filling crossover rates between multiple channels in one embodiment of the present invention;

[0055] Figure 8 It is a schematic diagram of a request flow for filling advertisements in each channel node in one embodiment of the present invention;

[0056] Fig. 9 is a schematic diagram of the configuration structure of a channel tree group in one embodiment of the present invention;

[0057] Fig.10 It is a schematic diagram of an advertisement filling request process for any channel node in a channel tree in one embodiment of the present invention;

[0058] Figure 11-1 , Figure 11-2 , Figure 11-3 is a statistical graph of advertisement filling duration in one embodiment of the present invention;

[0059] Fig.12 A schematic diagram of the state flow of each channel tree in an embodiment of the present invention;

[0060] Fig.13 is a structural schematic diagram of an advertisement aggregation device in one embodiment of the present invention;

[0061] Fig.14 is a schematic diagram of a computer device in one embodiment of the present invention. DETAILED DESCRIPTION

[0062] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0063] The advertisement aggregation method provided in this embodiment can be applied to Figure 4 In an application environment, a client communicates with a server. The client includes but is not limited to various personal computers, laptops, smart phones, tablet computers, and portable wearable devices. The server can be implemented with an independent server or a server cluster consisting of multiple servers.

[0064] In one embodiment, if Figure 5 As shown, an advertisement aggregation method is provided, and the method is applied in Figure 4 The server in the example is used as an example to illustrate the following steps:

[0065] S10: Obtain access request for advertising space. After obtaining the access request, perform advertising aggregation configuration. The configuration method includes: forming all channels to be filled with requests into a channel tree group. The channel tree group includes one channel tree, or two or more channel trees connected in series, wherein each channel tree includes a starting point and a number of channel nodes. The channel nodes include: a channel node directly extending downward from the starting point, a subordinate channel node directly mounted downward from the superior channel node, and the superior channel node and the subordinate channel node constitute a parent-child channel node.

[0066] It can be understood that the number of channel trees and channel nodes in this step are determined according to the value range of the advertising channel. The number of channel trees and channel nodes are determined as follows: Figure 6 As shown, including:

[0067] P101: Set several levels of channel value ranges, for example, set three levels, namely, high-level channel value range, intermediate channel value range, and low-level channel value range, among which the value in the high-level channel value range is greater than the value in the intermediate channel value range, and the value in the intermediate channel value range is greater than the value in the low-level channel value range.

[0068] P102: Get N channels to be filled and the corresponding channel values, and determine the value interval level to which the channel value belongs, i.e., the high-level channel value interval, the intermediate channel value interval or the low-level channel value interval.

[0069] P103: Channels belonging to the same channel value range are taken as channel nodes to form a channel tree; if two or more channel trees are formed, the channel trees are connected in series from high to low according to the channel value ranges corresponding to the channel trees.

[0070] For example, if the values ​​of n1 channels among N channels belong to the advanced channel value range, the n1 advertising channels are combined into a first channel tree, which includes a first starting point and n1 channel nodes; if the values ​​of n2 channels among N channels belong to the intermediate channel value range, the n2 advertising channels are combined into a second channel tree, which includes a second starting point and n2 channel nodes; similarly, if the values ​​of n3 channels among N channels belong to the low channel value range, the n3 advertising channels are combined into a third channel tree, which includes a third starting point and n3 channel nodes.

[0071] It can be understood that the sum of n1 channels in the first channel tree, n2 channels in the second channel tree and n3 channels in the third channel tree is the total number of channels to be filled, that is, n1+n2+n3=N.

[0072] In this step, after the judgment of step P102, if the number of channels belonging to a certain channel value interval is zero, the channel tree cannot be constructed. For example, when n1=0, n2≠0, n3≠0, two channel trees are constructed; if n1=0, n2=0, n3≠0, only one channel tree is constructed. There are many situations and no examples are given one by one.

[0073] In another embodiment, the channel value intervals may be divided into three or more different levels, with the purpose of making a more detailed division of the N channels into more channel trees to improve the efficiency of traffic realization.

[0074] In another embodiment, the channel tree may be determined by classifying the N channels to be filled, rather than determining the channel tree according to the value interval of the advertising channel. The specific steps are:

[0075] Use clustering algorithms (such as K-Means algorithm, etc.) to classify the values ​​of N channels. The number of categories obtained is the number of channel trees. Each category of channels constitutes a channel tree. According to the channel value of the cluster center of each category, the priority level of each channel tree is determined, and the channel trees are connected in series.

[0076] Furthermore, after determining a number of advertising channels belonging to a channel tree, the parent and child nodes in the channel tree are determined according to the fill cross rate between each channel; when the fill cross rate between two channels is greater than or equal to a set value (such as 90%), the two channels are used as parent and child nodes, where the channel with a relatively higher channel value is used as the upper channel node, and the channel with a relatively lower channel value is used as the lower channel node directly mounted downward from the upper channel node.

[0077] Understandably, the fill crossover rate is used to indicate the probability of ads from two channels being filled at the same time on a certain ad slot; for example, the existing traditional parallel ad slot (all channel ads on this ad slot will always initiate fill requests at the same time as the ad slot is filled) is configured with the following channels A, B, C in order of value from high to low. On a certain day, this ad slot initiated 300 fill requests and 300 displays; channel A was filled 100 times, channel B was filled 200 times, and channel C was filled 240 times. Among them, channels A and B are high-value advertising channels because they have set an advertising floor price, so their fill rate is relatively low. Such channels need to maintain a relatively high advertising utilization rate, while channel C, as a guaranteed channel without a floor price, does not need to deliberately guarantee a high advertising utilization rate.

[0078] When the 300 impressions are composed of 100 A and 200 B, the value of the ad space is the highest. However, the actual impression distribution may be as follows: A: 80, B: 100, C: 120; at this time, the advertising utilization rate of each channel is A: 80 / 100 = 80%, B: 100 / 200 = 50%, C: 120 / 240 = 50%.

[0079] Among them, the number of B fills in the 100 data filled by A is 90, so the fill cross rate of B relative to A is 90%. Since the value of B is lower than that of A, it means that these 90 fills will definitely be wasted. Therefore, in parallel configuration, too high a fill cross rate directly leads to a reduction in advertising utilization. In the above example, consider organizing the B channel in a parent-child node manner after the A node, that is, channel A is the upper channel node, and channel B is the lower channel node. This ensures that when A fails to fill, a fill request is made to the B channel to avoid repeated filling of the A and B channels, thereby significantly improving the advertising utilization of the B channel. Similarly, if there are other channels that also maintain a high fill cross rate with the B channel, they can also form a parent-child node relationship with the B channel to provide corresponding advertising utilization.

[0080] In this step, after the channel nodes with parent-child relationship are determined, the upper-level channel nodes and the channel nodes without parent-child relationship are directly mounted under the starting point.

[0081] In this step, the starting point for using the fill cross rate to determine the parent-child nodes in the channel tree is:

[0082] Taking into account that when the channel nodes in the same channel tree are configured serially in a parent-child manner, in addition to expressing the serial filling behavior in the traditional sense, it also plays a role in improving the utilization rate of advertising; after observing and analyzing the advertising filling behavior data of a large number of traditional parallel advertising positions, another data indicator that is beneficial to neutralizing the shortcomings of the traditional parallel mode is customized, namely the filling cross rate.

[0083] Figure 7 Some legend data related to the fill cross rate are displayed: the horizontal axis is the channel list configured on the ad slot in descending order of channel value, and the vertical axis bar chart corresponding to the sixth channel from left to right represents the total amount of data successfully filled in the channel, while the orange bar charts corresponding to other channels represent the total amount of data successfully filled in other channels when the sixth channel is successfully filled; by observing the height difference between this bar chart and the narrow bar charts of other channels, the data on related fill cross coverage can be seen; for example, if the difference between the sixth channel and the eleventh channel is within 10%, it means that when these two channels request to fill in parallel, there is a high probability that advertising in one of the channels will be wasted.

[0084] In addition, the wide bar graph in the above figure represents the total number of impressions of these filler ads. Looking at channels 1 and 2, it is precisely because of the high filler crossover rate of channels 1 and 2 that nearly half of the ads in the second channel are wasted, and the waste becomes more serious as the channel progresses.

[0085] Therefore, in view of the above reasons, the present invention finds that in a channel tree, the serial relationship of channels can also be used to avoid advertising waste caused by excessive fill cross rate. The advertising serial configuration itself should not always be based on the sole criterion of advertising channel value. Therefore, the fill cross rate is used to determine the parent and child nodes in the channel tree to avoid advertising waste.

[0086] S20: According to the configuration mode of the channel tree group, and in accordance with the priority order of the channel trees in series, request advertisement filling for each channel node in each channel tree in turn. Figure 8 As shown, the request steps for ad filling are as follows:

[0087] S201: The channel nodes extending directly downward from the starting point execute the advertisement filling request of the channel in parallel mode;

[0088] S202: The upper-level channel node and the lower-level channel node directly mounted below the upper-level channel node execute the advertisement filling request of the channel in a serial mode.

[0089] It can be understood that a configuration structure of a channel tree group is as follows Fig. 9As shown, the configuration structure is organized in a top-down manner in a channel tree; each channel tree contains two types of nodes: starting point and channel, where the direct child nodes extending downward from each node (including starting point and channel nodes) will execute the channel's advertising filling request in a traditional parallel manner; such as the direct parent-child nodes of the first starting point of the first channel tree: channels 1, 2, and 3 will simultaneously initiate filling requests in a parallel manner.

[0090] Other channel nodes can still be mounted under each channel node as parent-child nodes. These subordinate nodes will initiate a new round of filling requests in parallel mode at the same time after the upper channel node enters the terminal state; for example, in the first channel tree, channel nodes 4 and 5 are mounted under channel node 2 as its parent-child nodes. After channel node 2 enters the terminal state, channel nodes 4 and 5 simultaneously initiate a new round of filling requests; in the first channel tree, there is no parent-child node under channel node 1, and a subordinate channel node 6 is mounted under channel node 3; in the second channel tree, the direct parent-child nodes of the second starting point are channel node 7 and channel node 8, and advertising filling requests are initiated to these two channel nodes at the same time in parallel; and, there is no parent-child node under channel node 7, and a subordinate channel node 9 is mounted under channel node 8.

[0091] In one embodiment, in order to ensure that the overall filling cycle of the ad space is not too long, it is necessary to set a timeout for the channel node to fill the ad. Within the timeout, the channel node that successfully fills the ad is marked as filling successful; if the timeout is triggered, the filling is marked as failed.

[0092] It is understandable that the specific steps for requesting advertisement filling for any channel node in the channel tree are as follows: Fig.10 As shown, including:

[0093] P201: Request the channel node (the meaning of the channel node is the advertising channel of a certain node in the channel tree) to fill the advertisement and trigger the set timeout;

[0094] P202: Determine whether a filling callback is received before the timeout is triggered. If a filling callback is received, proceed to step P203. If no filling callback is received, proceed to step P204.

[0095] P203: Determine whether the advertising channel is successfully filled according to the received filling callback. If it is successfully filled, mark the channel node as successfully filled; if not, proceed to step P204;

[0096] Understandably, the filling callback includes a reply message of successful ad filling or a reply message of failed filling. The filling timeout of an ordinary node is usually around 1~2s, that is, the timeout range set in step P201 is 1~2s, because through data observation, more than 80% of the data in most advertising channels can obtain a filling status callback within this time period, whether it is successful or failed; however, there are some special cases that cause the filling callback time of a specific channel to be too long. For example, if too many channel nodes are configured on an ad position, the filling callback time of the subsequent nodes is generally longer than that of the previous nodes, so the timeout of the upper channel node and the lower channel node needs to be adjusted as appropriate according to the actual situation.

[0097] P204: If no filling callback is received before the timeout is triggered, or if a filling callback is received but it is judged that the filling is not successful, the channel node is marked as filling failure and the channel node enters the terminal state.

[0098] It can be understood that the terminal state of a channel node is defined as follows: when the channel node itself fails to be filled or the filling time of the channel node exceeds a predefined timeout period (ie, timeout timing), the channel node is in the terminal state.

[0099] The significance of setting the terminal state of the channel node is that the biggest problem in the traditional serial mode is that under the premise of ensuring the utilization rate of advertisements, the entire filling cycle is prolonged, thereby reducing the amount of advertisements displayed and thus reducing the monetization efficiency. However, by observing some data on the filling time of advertisements, such as Figure 11-1 , Figure 11-2 , Figure 11-3 The ad filling callback (including filling success and filling failure) duration data distribution graph is shown, where the horizontal axis is the time from the filling request to the filling callback, in seconds; the vertical axis on the left is the number of statistical data entries, and the vertical axis on the right represents the proportion of the number of entries occurring within the corresponding time to the total data.

[0100] From the above three figures, we can see that for some channels, more than 80% or even 90% of the data can complete the filling request within 1 second, but there are also some channels where the filling time of 10% of the data is distributed between 3 and 4 seconds; therefore, from a macro perspective, the filling timeout time can be set for the channel node to ensure that a large number of users avoid too long filling time in serial requests, thereby affecting the advertising display volume.

[0101] Therefore, each channel node in the channel tree directly initiates the parallel filling behavior of the downstream parent-child nodes starting from the terminal state, which can neutralize the disadvantages of the serial mode under the premise of customizing the impact range.

[0102] P205: Determine whether the channel node entering the terminal state has a subordinate channel node (i.e., child node). If not, the channel node maintains the terminal state; if so, an advertisement filling request and filling status mark of the subordinate channel node are performed, i.e., steps P201-P205 are repeated.

[0103] In order to maximize the advertising revenue on a specific ad slot, one of the most important responsibilities of the ad mediation platform is to select the channel with the highest value for displaying the ad slot. However, in a channel tree configuration, due to the difference in the filling time cycle of each channel, the channel with low value may be filled in advance, thus grabbing the display opportunity.

[0104] In order to avoid such a phenomenon, in another embodiment, a first channel protection time is set for each channel tree. During the first channel protection time, before the channel node with the highest value enters the terminal state, the access party will not be notified that the advertisement filling enters the displayable state. The first channel protection time is usually determined by the maximum time allowed to wait for advertisement display on the corresponding advertisement position. The state flow of the channel tree is as follows: Fig.12 As shown, the following steps are included:

[0105] According to the structure of the current channel tree, the channel nodes in the channel tree are traversed, a request for advertisement filling is made, and the timeout of the first channel protection time is triggered.

[0106] During the first channel protection time, check whether there is a channel node that has successfully filled advertisements. If no channel node has successfully filled advertisements, that is, the first channel protection time has timed out, and determine whether there is a successfully filled channel node. If so, notify the access party that the advertisement has been successfully filled and enter the displayable state; if not, enter the channel tree terminal state; continue to determine whether the current channel tree has a downstream channel tree connected in series with it. If so, enter the downstream channel tree; if not, maintain the channel tree terminal state.

[0107] If a channel node is successfully filled with advertisements, determine whether the channel node is the set relative first channel. If it is the relative first channel, notify the access party that the advertisement is successfully filled and enter the displayable state; if it is not the relative first channel, determine whether all channel nodes have entered the terminal state. If not, wait for a new channel filling callback or the first channel protection time expires; if so, enter the channel terminal state; continue to determine whether the current channel tree has a downstream channel tree connected in series with it. If so, enter the downstream channel tree; if not, maintain the terminal state of the channel tree.

[0108] It is understandable that the relative first channel protected within the first channel protection time set in each channel tree does not specifically refer to a certain channel with the highest value (i.e., channel node), and the first channel protection time does not refer to protecting a specific channel. This is a relative concept, referring to the highest value channel among the remaining advertising channels that have not obtained the fill status callback.

[0109] For example, there are three channels A, B, and C with values ​​from high to low, and they are combined in parallel into a channel tree. The protection time of the first channel is set to 5s. When an ad filling request occurs, the three channels trigger the filling request in parallel. When channel C is successfully filled in 0.5s, since it is within 5s, the first channel, i.e. channel A, is detected to be filled. At this time, the utilization rate of channel A is protected. However, when channel A fails to be filled in 1.5s, since it is still within the protection time of 5s, channel B has not returned to the filling state (i.e. filling callback) at this time, and the value of channel B is higher than that of channel C, the utilization rate of channel B is protected at this time.

[0110] Understandably, the first channel protection time is usually a data customized for different ad positions that takes into account product experience and monetization efficiency. For example, in the splash screen position, the first channel protection time is usually set between 2 and 3 seconds. Although a time that is too long ensures maximum advertising monetization efficiency, it may cause users to blindly wait for too long on the splash screen page in terms of product experience. If the time is too short, there is a high probability that the bottom channel with low value and high fill rate will be hit, resulting in too low monetization efficiency. In the interstitial ad position that jumps within the app, the product can often request to fill the ad in advance by preloading. In this case, a larger first channel protection time, such as 5 seconds, is usually selected to prioritize advertising monetization efficiency.

[0111] It should be noted that the present invention connects the various channel trees in series and presents the configuration in the form of a channel tree group because:

[0112] The serial configuration in a single channel tree cannot strictly replace the intention of traditional serial configuration. The traditional serial configuration layering organizes the channels from top to bottom completely according to the channel value, that is, the filling request time of each layer in the time dimension is unified; however, in a single channel tree, the branches are gradually flourishing according to the channel nodes. From the perspective of time, channel nodes at the same depth do not necessarily initiate requests at the same time, and channel nodes at the same depth do not themselves represent the same value range, because the parent nodes of channel nodes at the same depth are different, which results in the situation that channels with different value ranges may initiate simultaneous requests for filling at the same time.

[0113] Therefore, in order to ensure the overall layered downward advancement of channel value, the channel trees are connected in series in the form of an array. Channel nodes with similar values ​​are configured in each channel tree, which are combined into a tree structure through the filling cross rate, and are requested to be filled in a structured parallel manner; when all channel nodes in the entire channel tree enter the terminal state or the tree has exceeded the first channel protection time, we call this tree entering the terminal state, and the entire pulling process enters the next channel tree, that is, enters the channel structure combination of the next value range.

[0114] In summary, the channel configuration structure defined in the present invention not only solves the drawbacks of traditional parallel series, but also provides an extremely flexible configuration method. It even innovatively defines a fill cross rate indicator based on data analysis to indicate how to further improve the advertising utilization rate while ensuring the display volume in the parallel structure. The introduction of the first channel protection time mechanism ensures that the access party can, based on its own needs, try to ensure the purpose of presenting the maximum value advertisements while balancing the advertising revenue and product experience. The hierarchical tree is used to isolate channels of different value ranges, further ensuring the maximum monetization efficiency while improving the utilization rate of high-value advertisements.

[0115] The advertisement aggregation method of the present invention has the following advantages:

[0116] First, use the aggregation method of channel tree groups to configure advertising aggregation. This configuration method is equivalent to providing two ways to organize traditional serial connections: the series connection of parent and child nodes within the channel tree and the series connection between channel trees. Either method can solve the problem of long filling cycles caused by using traditional serial mode configuration to the greatest extent through the timeout of the channel node or the first channel protection time.

[0117] Second, the present invention can organize the channel nodes in the channel tree into parent-child nodes according to the set fill cross rate indicator, and then combine the timeout attribute of the channel node to avoid the problem of too low advertising utilization rate.

[0118] Third, the first channel protection time of the channel tree is used to ensure the presentation of the most valuable channel advertisements on the ad space. The tree structure is combined with the characteristics of the serial and parallel structure to improve the indicators of the advertising aggregation platform to improve the advertising monetization efficiency, while trying to avoid the disadvantages of the corresponding extreme modes.

[0119] Fourth, unlike the traditional simple hybrid mode, the channel tree group no longer restricts the number of channels at the same level, and is not even restricted by the single parallel structure at the same level.

[0120] In summary, the present invention provides an extremely flexible channel organization method through the aggregation method of channel tree groups, which not only combines the intentions of traditional serial mode and parallel mode, but also reasonably avoids the disadvantages of serial mode and parallel mode, and improves the advertising monetization efficiency of the aggregation configuration method.

[0121] It should be understood that the order of execution of the steps in the above embodiment does not necessarily mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiment of the present invention.

[0122] In one embodiment, an advertisement aggregation device is provided, and the advertisement aggregation device corresponds one-to-one to the advertisement aggregation method in the above embodiment. Fig.13 As shown, the advertisement aggregation device includes an advertisement configuration module and an advertisement management module. The detailed description of each functional module is as follows:

[0123] The advertisement configuration module is used to obtain access requests for advertisement positions, and after obtaining the access requests, performs advertisement aggregation configuration. The configuration method includes: forming a channel tree group with all channels to be requested to be filled, wherein the channel tree group includes one channel tree, or two or more channel trees connected in series, wherein each channel tree includes a starting point and a number of channel nodes, wherein the channel nodes include: a channel node directly extending downward from the starting point, serving as an upper-level channel node; and a lower-level channel node directly mounted downward from the upper-level channel node, wherein the upper-level channel node and the lower-level channel node constitute a parent-child channel node.

[0124] The advertisement management module is used to request advertisement filling for each channel node in each channel tree in turn according to the configuration mode of the channel tree group and the priority order of the channel tree series.

[0125] For the specific definition of the advertising aggregation device, please refer to the definition of the advertising aggregation method above, which will not be repeated here. Each module in the above-mentioned advertising aggregation device can be implemented in whole or in part by software, hardware and a combination thereof. The above-mentioned modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.

[0126] In one embodiment, a computer device is provided. The computer device may be a terminal, and its internal structure diagram may be as follows: Fig.14As shown. The computer device includes a processor, a memory, a network interface, a display screen and an input device connected via a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes 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 operation of the operating system and computer-readable instructions in the readable storage medium. The network interface of the computer device is used to communicate with an external server via a network connection. When the computer-readable instructions are executed by the processor, an advertising aggregation method is implemented. The readable storage medium provided in this embodiment includes a non-volatile readable storage medium and a volatile readable storage medium.

[0127] Those of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be implemented by instructing related hardware through computer-readable instructions, and the computer-readable instructions can be stored in a non-volatile readable storage medium or a volatile readable storage medium. When the computer-readable instructions are executed, they may include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application may include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0128] Those skilled in the art can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example. In actual applications, the above-mentioned functions can be distributed and completed by different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above.

[0129] The embodiments described above are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention, and should all be included in the protection scope of the present invention.

Claims

1. An advertisement aggregation method, characterized in that: The following steps are involved: S10: Obtaining an access request for an ad space. After obtaining the access request, performing ad aggregation configuration, the configuration method includes: forming a channel tree group with all channels to be requested for filling, wherein the channel tree group includes one channel tree, or two or more channel trees connected in series, wherein each channel tree includes a starting point and a plurality of channel nodes, wherein the channel nodes include: a channel node directly extending downward from the starting point, serving as an upper-level channel node; and a lower-level channel node directly mounted downward from the upper-level channel node, wherein the upper-level channel node and the lower-level channel node constitute a parent-child channel node; S20: According to the configuration mode of the channel tree group, and in accordance with the priority order of the channel trees in series, requesting advertisement filling for each channel node in each channel tree in turn; In step S10, after determining a number of advertising channels belonging to a certain channel tree, the parent-child channel nodes in the channel tree are determined according to the fill cross rate between each channel to avoid advertising waste caused by an excessively large fill cross rate between channels; when the fill cross rate between two channels is greater than or equal to a set value, the two channels are used as parent-child channel nodes, wherein the channel with a relatively higher channel value is used as the upper channel node, and the channel with a relatively lower channel value is used as the lower channel node; the fill cross rate is used to indicate the probability of advertisements from two channels being filled at the same time in a certain advertising position.

2. The advertisement aggregation method according to claim 1, characterized in that: In step S10, the steps of determining the number of channel trees and channel nodes include: P101: Set the channel value range of the set level, and the ranges of the channel value ranges do not overlap; P102: Get the N channels to be filled and the corresponding channel values, and determine the value interval level to which each channel value belongs; P103: Channels belonging to the same channel value range are taken as channel nodes to form a channel tree; if two or more channel trees are formed, the channel trees are connected in series from high to low according to the channel value ranges corresponding to the channel trees.

3. The advertisement aggregation method according to claim 1, characterized in that: In step S20, the request steps for advertisement filling are as follows: S201: The channel nodes extending directly downward from the starting point execute the advertisement filling request of the channel in parallel mode; S202: The upper-level channel node and the lower-level channel node directly mounted below the upper-level channel node execute the advertisement filling request of the channel in a serial mode.

4. The advertisement aggregation method according to claim 3, characterized in that: The specific steps for requesting an advertisement to fill any channel node in the channel tree include: P201: Requesting the channel node to fill in advertisements and triggering a set timeout; P202: Determine whether a filling callback is received before the timeout is triggered, wherein the filling callback includes a reply message indicating a successful advertisement filling or a reply message indicating a failed filling; if a filling callback is received, proceed to step P203; if no filling callback is received, proceed to step P204; P203: Determine whether the advertising channel is successfully filled according to the received filling callback. If it is successfully filled, mark the channel node as successfully filled; if not, proceed to step P204; P204: If no filling callback is received before the timeout is triggered, or a filling callback is received but it is judged that the filling is not successful, the channel node is marked as filling failure, and the channel node enters the terminal state; the definition of the terminal state is: when the channel node itself fails to fill or the filling time of the channel node exceeds the predefined timeout time, the channel node is in the terminal state; P205: Determine whether the channel node entering the terminal state has a subordinate channel node. If not, the channel node maintains the terminal state; if so, an advertisement filling request and filling status mark of the subordinate channel node are made.

5. The advertisement aggregation method according to claim 3 or 4, characterized in that: A first channel protection time is set for each channel tree. During the first channel protection time, if there is a channel node with the highest relative channel value and successful ad filling, the access party is notified that the ad filling is successful and enters the displayable state.

6. An advertisement aggregation device, characterized in that: include: The advertisement configuration module is used to obtain the access request of the advertisement position, and after obtaining the access request, the advertisement aggregation configuration is performed, and the configuration method includes: forming a channel tree group with all the channels to be requested to be filled, wherein the channel tree group includes a channel tree, or two or more channel trees connected in series, wherein each channel tree includes a starting point and a plurality of channel nodes, wherein the channel nodes include: a channel node directly extending downward from the starting point, used as an upper channel node; and a lower channel node directly mounted downward from the upper channel node, wherein the upper channel node and the lower channel node constitute a parent-child channel node; An advertisement management module, configured to request advertisement filling for each channel node in each channel tree in turn according to the configuration mode of the channel tree group and the priority order of the channel tree series connection; The advertising configuration module is also used to: after determining several advertising channels belonging to a certain channel tree, determine the parent-child channel nodes in the channel tree according to the fill cross rate between each channel to avoid advertising waste caused by excessive fill cross rate between channels; when the fill cross rate between two channels is greater than or equal to the set value, the two channels are used as parent-child channel nodes, among which the channel with relatively higher channel value is used as the upper channel node, and the channel with relatively lower channel value is used as the lower channel node; the fill cross rate is used to indicate the probability of advertisements from two channels being filled at the same time in a certain advertising position.

7. The advertisement aggregation device according to claim 6, characterized in that: The advertising management module is also used to: execute channel advertising filling requests in parallel mode for channel nodes directly extending downward from the starting point; and execute channel advertising filling requests in serial mode for upper channel nodes and lower channel nodes directly mounted downward from the upper channel nodes.

8. A computer device comprising a memory, a processor, and computer-readable instructions stored in the memory and executable on the processor, characterized in that: When the processor executes the computer-readable instructions, the advertisement aggregation method according to any one of claims 1 to 5 is implemented.

Images