Advertisement filling method, device and storage medium

Abstract

The present invention discloses an advertisement filling method, device and storage medium, wherein the method part comprises: sending advertisement requests to advertisers in multiple priority request queues simultaneously in an asynchronous request manner, receiving advertiser return information of each priority request queue, determining one by one whether there is valid advertisement filling information in the advertiser return information in each priority request queue according to the priority sorting of the priority request queues, and when there is valid advertisement filling information in the advertiser return information in a priority request queue, receiving the remaining other priority advertiser return information before the deadline, conducting advertisement bidding for the advertiser return information of each priority request queue before the deadline, and sending the advertisement filling information that meets the bidding conditions to the user end for advertisement filling; in the present invention, under the premise of ensuring advertisement revenue, the processing time required for advertisement requests is reduced as much as possible, the system load is reduced, and the system throughput is improved.

Description

Technical Field

[0001] The present invention relates to the technical field of Internet advertising, and in particular to an advertisement filling method, device, and storage medium. Background Art

[0002] With the rapid development of the Internet, advertising has become one of the important sources of income for Internet companies. In the advertising trading platform ADX, when the downstream traffic end (user end) is idle, ADX will send advertising requests to multiple upstream advertisers, obtain the advertising return results of multiple advertisers, and conduct real-time bidding (RTB), and finally decide the best advertisement to be delivered to the downstream traffic end.

[0003] Among them, ADX sends advertising requests to upstream advertisers, which can usually be divided into two modes: serial and parallel. In serial requests, ADX sends advertising requests to each upstream advertiser in order of priority. If the first-level upstream advertiser has an advertisement returned, it will be returned to the downstream traffic end after internal bidding. If no advertisement is returned, an advertising request will be initiated to the upstream advertiser of the next priority, and so on until there is an advertisement filled. In parallel requests, ADX initiates advertising requests to all upstream advertisers at the same time. If there is an advertisement returned, it will be returned to the downstream traffic end after internal bidding, otherwise it is considered that there is no advertisement filled.

[0004] However, in serial requests, if there are more priorities, the processing time of the ad request will be longer, which will cause the total bidding process to be too long; in parallel requests, if some upstream advertisers take a long time to respond, the total bidding process will be too long. The long bidding process will affect the throughput level of the entire system. Summary of the invention

[0005] The present invention provides an advertisement filling method, device and storage medium to solve the problem that in the existing advertisement transaction process, the bidding process takes too long and affects the throughput level of the entire system.

[0006] An advertisement filling method, comprising:

[0007] Sending advertising requests to advertisers in multiple priority request queues simultaneously in an asynchronous request manner to receive information returned by advertisers in each priority request queue. Advertisers of different priorities are classified according to advertising revenue and response time.

[0008] According to the priority sorting of the priority request queues, determine one by one whether the advertiser return information in each priority request queue contains valid advertisement filling information, and when the advertiser return information in a priority request queue contains valid advertisement filling information, stop receiving the remaining advertiser return information of other priorities;

[0009] Advertisement bidding is performed on the advertiser return information of each priority request queue before the deadline, and the advertisement filling information that meets the bidding conditions is sent to the user end for advertisement filling.

[0010] Further, after determining whether the advertiser return information in each priority request queue contains valid advertisement filling information, the method further includes:

[0011] When it is determined that the advertiser return information in all priority request queues does not contain valid advertisement filling information, a prompt message indicating that there is no advertisement filling is sent to the user terminal.

[0012] Further, the plurality of priority request queues include a first priority request queue, a second priority request queue, and a third priority request queue in descending order. According to the priority order of the priority request queues, it is determined one by one whether there is valid advertisement filling information in the advertiser return information in each priority request queue, and when there is valid advertisement filling information in the advertiser return information in a priority request queue, the remaining other priority advertiser return information is stopped from being received, including:

[0013] After receiving all advertiser return information in the first priority request queue, determining whether there is valid advertisement filling information in the advertiser return information of the first priority request queue;

[0014] If the advertiser return information of the first priority request queue contains valid advertisement filling information, then the advertiser return information of the third priority request queue and the second priority request queue is received and the deadline is determined;

[0015] If the advertiser return information of the first priority request queue does not contain valid advertisement filling information, then after receiving all the advertiser return information in the second priority request queue, determine whether the advertiser return information of the second priority request queue contains valid advertisement filling information;

[0016] If the advertiser return information of the second priority request queue contains valid advertisement filling information, the advertiser return information of the third priority request queue is received before a deadline is determined.

[0017] Further, after determining whether the advertiser return information of the second priority request queue contains valid advertisement filling information, the method further includes:

[0018] If the advertiser return information of the second priority request queue does not contain valid advertisement filling information, then after receiving all the advertiser return information in the third priority request queue, determine whether the advertiser return information of the third priority request queue contains valid advertisement filling information;

[0019] If the advertiser return information of the third priority request queue contains valid advertisement filling information, the reception time of the last advertiser return information in the third priority request queue is used as the deadline.

[0020] Further, after determining whether the advertiser return information of the third priority request queue contains valid advertisement filling information, the method further includes:

[0021] If the advertiser return information of the third priority request queue does not contain valid advertisement filling information, it is determined that the advertiser return information in each priority request queue does not contain valid advertisement filling information.

[0022] Further, all advertisers form an advertiser set, and advertisers in the first priority request queue form a first subset of the advertiser set, and the advertisers in the first subset are advertisers whose advertising revenue is greater than a first preset revenue and whose response time is less than the first preset time;

[0023] The advertisers in the third priority request queue form a second subset of the advertiser set, and the advertisers in the second subset are advertisers whose response time is longer than a second preset time.

[0024] The advertisers in the second priority request queue form a third subset of the advertiser set. The advertisers in the third subset are the advertisers in the advertiser set except for the first subset and the second subset.

[0025] Furthermore, before conducting an advertisement bidding for the advertiser return information of each priority request queue before the deadline, the method further includes:

[0026] The advertiser return information of each priority request queue before the deadline is merged and summarized, and saved as the advertisement return result of the advertisement request.

[0027] An advertisement filling device, comprising:

[0028] A sending module is used to send advertising requests to advertisers in multiple priority request queues simultaneously in an asynchronous request manner, so as to receive return information from advertisers in each priority request queue. Advertisers of different priorities are classified according to advertising revenue and response time.

[0029] A determination module, for determining whether there is valid advertisement filling information in the advertiser return information in each priority request queue according to the priority sorting of the priority request queues, and when there is valid advertisement filling information in the advertiser return information in a priority request queue, stopping receiving the remaining other priority advertiser return information;

[0030] The bidding module is used to bid on advertisements returned by advertisers in each priority request queue before the deadline, and send advertisement filling information that meets the bidding conditions to the user end for advertisement filling.

[0031] An advertisement filling device comprises a memory, a processor and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the steps of the advertisement filling method are implemented.

[0032] A computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the above-mentioned advertisement filling device method are implemented.

[0033] In a scheme provided by the above-mentioned advertisement filling method, device and storage medium, advertisement requests are sent to advertisers in multiple priority request queues at the same time in an asynchronous request manner to receive the return information of advertisers in each priority request queue. Advertisers of different priorities are advertisers divided according to advertisement revenue and response time. Then, according to the priority sorting of the priority request queues, it is determined one by one whether there is valid advertisement filling information in the return information of advertisers in each priority request queue. When there is valid advertisement filling information in the return information of advertisers in a priority request queue, the return information of remaining advertisers of other priorities is stopped from being received. Finally, advertisement bidding is performed on the return information of advertisers in each priority request queue before the deadline, and the advertisement filling information that meets the bidding conditions is sent to the user end for advertisement filling. In the present invention, advertisement requests are sent to different priority request queues in an asynchronous request manner, and when the return information of high-priority advertisers is valid advertisement filling information, the return information of low-priority advertisers is stopped from being received. Under the premise of ensuring advertisement revenue, the processing time required for advertisement requests is reduced as much as possible, the load of the system is reduced, and the system throughput is improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] 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.

[0035] Figure 1 is a schematic diagram of an application environment of an advertisement filling method in an embodiment of the present invention;

[0036] Figure 2 is a flow chart of an advertisement filling method according to an embodiment of the present invention;

[0037] Figure 3 yes Figure 2 A schematic diagram of an implementation process of step S20;

[0038] Figure 4 is a structural schematic diagram of an advertisement filling device in one embodiment of the present invention;

[0039] Figure 5 It is another structural schematic diagram of the advertisement filling device in one embodiment of the present invention. DETAILED DESCRIPTION

[0040] 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.

[0041] The advertisement filling method provided by the embodiment of the present invention can be applied in Figure 1 In the application environment shown, the user end (downstream) and the advertising trading system communicate through the network, and the advertising trading system and the advertiser (upstream) communicate through the network. Among them, the advertising trading system receives the advertising request sent by the user end, and the advertising trading system sends the advertising request to the advertisers in multiple priority request queues at the same time in an asynchronous request manner, so as to receive the return information of the advertisers in each priority request queue. The advertisers of different priorities are advertisers divided according to the advertising revenue and the response time. Then, according to the priority sorting of the priority request queues, it is determined one by one whether the return information of the advertisers in each priority request queue has valid advertising filling information, and when the return information of the advertisers in a priority request queue has valid advertising filling information, the return information of the remaining other priority advertisers is received. Finally, the return information of the advertisers in each priority request queue before the deadline is auctioned, and the advertising filling information that meets the auction conditions is sent to the user end for advertising filling. In the present invention, the advertising request is sent to the different priority request queues in an asynchronous request manner, and when the return information of the high-priority advertiser is valid advertising filling information, the return information of the low-priority advertiser is received. Under the premise of ensuring the advertising revenue, the processing time required for the advertising request is reduced as much as possible, the load of the system is reduced, and the system throughput is improved.

[0042] The user end may be, but is not limited to, various personal computers, laptops, smart phones, tablet computers, and portable wearable devices. The advertising trading system may be implemented using an independent server or a server cluster consisting of multiple servers.

[0043] In one embodiment, if Figure 2 As shown, an advertisement filling method is provided, and the method is applied in Figure 1 The advertising trading system in is used as an example to illustrate the following steps:

[0044] S10: sending advertisement requests to advertisers in multiple priority request queues simultaneously in an asynchronous request manner, so as to receive return information from advertisers in each priority request queue.

[0045] After receiving the ad request sent by the user, the ad trading system sends ad requests to advertisers in multiple priority request queues in an asynchronous manner to receive the return information of advertisers in each priority request queue. Among them, advertisers of different priorities are divided according to ad revenue and response time. The shorter the response time and the higher the ad revenue, the higher the priority of the advertiser.

[0046] Among them, each advertising request is an asynchronous request. Since advertisers of different priorities have different response times to advertising requests, after sending advertising requests at the same time in the form of asynchronous requests, advertisers of different priorities have different feedback times, that is, the time to receive the return information from the advertiser is different. The higher the priority request queue, the shorter the time it takes to feedback the return information from the advertiser.

[0047] S20: According to the priority sorting of the priority request queues, determine one by one whether there is valid advertisement filling information in the advertiser return information in each priority request queue, and when there is valid advertisement filling information in the advertiser return information in a priority request queue, stop receiving the remaining return information from other priority advertisers.

[0048] After receiving the advertiser return information, determine whether there is valid advertisement filling information in the advertiser return information in each priority request queue one by one according to the priority sorting of the priority request queues, and when there is valid advertisement filling information in the advertiser return information in a priority request queue, stop receiving the remaining advertiser return information of other priorities.

[0049] That is, after receiving the return information from the advertiser, first determine whether there is valid advertisement filling information in the return information from the advertiser in the high-priority request queue. If there is valid advertisement filling information in the return information from the advertiser in the high-priority request queue, it means that an advertiser with higher benefits and shorter response time has fed back advertisement filling information that meets the requirements. The valid advertisement filling information can be sent to the user end for advertisement filling. Therefore, after determining that there is valid advertisement filling information in the high-priority request queue, there is no need to receive the return information from the advertisers in other low-priority request queues. Since each advertisement request is an asynchronous request, the return information from the remaining advertisers of other priorities can be stopped from being received. Only the return information from the advertisers in the request queues of each priority before the deadline can be used for advertisement bidding. Under the premise of ensuring revenue, the processing time required for advertisement requests is reduced as much as possible, avoiding the occurrence of downstream request waiting timeouts, effectively increasing the revenue of the advertisement trading system and reducing the load of the advertisement trading system, and improving the throughput of the advertisement trading system.

[0050] For example, multiple priority request queues are N priority request queues, which are sorted in descending order according to priority: the first priority request queue, the second priority request queue...the Nth priority request queue, which sends advertising requests to advertisers in the N priority request queues at the same time in an asynchronous request manner. When the advertiser return information of the first priority request queue is received, the advertiser return information fed back by some advertisers in other priority request queues is received; at this time, it is necessary to first determine whether there is valid advertising filling information in the advertiser return information in the first priority request queue. If so, stop receiving the advertiser return information from the second priority request queue to the Nth priority request queue to reduce the load on the advertising transaction system; if the first If the advertiser return information in the priority request queue does not contain valid advertisement filling information, then determine whether the advertiser return information in the second priority request queue contains valid advertisement filling information. If the advertiser return information in the second priority request queue contains valid advertisement filling information, then stop receiving the advertiser return information in the third priority request queue to the Nth priority request queue to reduce the load of the advertising trading system. If the advertiser return information in the second priority request queue does not contain valid advertisement filling information, then determine whether the advertiser return information in the next priority request queue contains valid advertisement filling information, and so on, until it is determined that the advertiser return information in a certain priority request queue contains valid advertisement filling information.

[0051] S30: Conduct advertisement bidding on the information returned by advertisers in each priority request queue before the deadline, and send advertisement filling information that meets the bidding conditions to the user end for advertisement filling.

[0052] When it is determined that there is valid ad filling information in the advertiser return information in a priority request queue, and after receiving the remaining other priority advertiser return information, the advertiser return information of each priority request queue before the deadline is summarized as bidding ad information, and then all valid ad filling information in the bidding ad information is internally auctioned, and finally the ad filling information that meets the auction conditions is sent to the user end for ad filling. In this embodiment, the advertiser return information of each priority request queue is used as bidding ad information for ad bidding, which can improve the diversity of bidding ad information, reduce the possibility of reduced revenue caused by selecting only the return information of high-priority advertisers as ad filling information, increase the traffic of low-priority advertisers, and thus improve the system usage experience.

[0053] In this embodiment, advertisement requests are sent to advertisers in multiple priority request queues at the same time in an asynchronous request manner to receive advertiser return information from each priority request queue. Advertisers of different priorities are classified according to advertisement revenue and response time. Then, according to the priority sorting of the priority request queues, it is determined one by one whether there is valid advertisement filling information in the advertiser return information in each priority request queue. When there is valid advertisement filling information in the advertiser return information in a priority request queue, the remaining return information from other priority advertisers is stopped from being received. Finally, advertisement bidding is performed on the advertiser return information in each priority request queue before the deadline, and the advertisement filling information that meets the bidding conditions is sent to the user end for advertisement filling. In the present invention, advertisement requests are sent to different priority request queues in an asynchronous request manner, and when the return information from the high-priority advertiser is valid advertisement filling information, the return information from the low-priority advertiser is stopped from being received. Under the premise of ensuring advertisement revenue, the processing time required for advertisement requests is reduced as much as possible, the system load is reduced, and the system throughput is improved.

[0054] In one embodiment, after step S20, that is, after determining whether there is valid advertisement filling information in the advertiser return information in each priority request queue, the method further specifically includes the following steps:

[0055] S40: When it is determined that the advertiser return information in all priority request queues does not contain valid advertisement filling information, a prompt message indicating that there is no advertisement filling is sent to the user terminal.

[0056] After determining whether there is valid ad filling information in the advertiser return information in each priority request queue, if it is determined that there is no valid ad filling information in the advertiser return information in all priority request queues, indicating that all advertisers have no suitable ad information to fill, a prompt message of no ad filling is sent to the user terminal, so that the user terminal can promptly obtain feedback of no ad information filling, thereby reducing the client waiting time and increasing the user experience and user stickiness of the advertising trading system.

[0057] For example, multiple priority request queues are N priority request queues, which are sorted in descending order according to priority: the first priority request queue, the second priority request queue...the Nth priority request queue, and send advertising requests to advertisers in the N priority request queues at the same time in an asynchronous request manner. When the advertiser return information of the first priority request queue is received, the advertiser return information fed back by some advertisers in other priority request queues is received; at this time, it is necessary to first determine whether there is valid advertising filling information in the advertiser return information in the first priority request queue. If there is valid advertising filling information, then stop receiving the advertiser return information from the second priority request queue to the Nth priority request queue; if there is no valid advertising filling information, then determine the Whether there is valid ad filling information in the advertiser return information in the second priority request queue, if there is valid ad filling information in the advertiser return information in the second priority request queue, then stop receiving the advertiser return information in the third priority request queue to the Nth priority request queue; if there is no valid ad filling information in the advertiser return information in the second priority request queue, then determine whether there is valid ad filling information in the advertiser return information in the next priority request queue, and so on, until it is determined that there is valid ad filling information in the advertiser return information in a certain priority request queue; if it is finally determined that there is no valid ad filling information in the advertiser return information in the Nth priority request queue, then a prompt message of no ad filling will be fed back to the user end.

[0058] In this embodiment, after determining whether the advertiser return information in each priority request queue contains valid advertisement filling information, when it is determined that the advertiser return information in all priority request queues does not contain valid advertisement filling information, a prompt message indicating that there is no advertisement filling is sent to the user terminal to reduce the client waiting time and increase the user experience of the advertising trading system.

[0059] In one embodiment, the advertiser return information includes the minimum price, identification, category, size, quality and specific content of the advertising material. In step S20, it is determined whether the advertiser return information in each priority request queue contains valid advertising filling information, including: determining whether the advertiser return information in a priority request queue is valid advertising filling information. If any advertiser return information in the priority request queue is valid advertising filling information, then it is determined that the advertiser return information in the priority request queue contains valid advertising filling information.

[0060] Among them, it is possible to determine whether the information returned by the advertiser is valid advertisement filling information based on the base price, logo, category, size, quality and specific content of the advertisement material in the information returned by the advertiser. If the base price, category, size, quality and specific content of the advertisement material meet the filling requirements of the user end, it means that the information returned by the advertiser is valid advertisement filling information.

[0061] In one embodiment, if Figure 3 As shown, the multiple priority request queues include a first priority request queue, a second priority request queue, and a third priority request queue in descending order. In step S20, that is, according to the priority order of the priority request queues, it is determined one by one whether the advertiser return information in each priority request queue has valid advertisement filling information, and when the advertiser return information in a priority request queue has valid advertisement filling information, the remaining other priority advertiser return information is stopped from being received, including:

[0062] S21: After receiving all advertiser return information in the first priority request queue, determine whether the advertiser return information in the first priority request queue contains valid advertisement filling information.

[0063] The first priority request queue has the highest priority, which means that the advertisers in the first priority request queue have the shortest response time and the highest revenue. Therefore, the advertiser return information in the first priority request queue is received first. After all the advertisers in the first priority request queue return information, it is first determined whether there is valid advertising filling information in the advertiser return information of the first priority request queue.

[0064] S22: If the advertiser return information of the first priority request queue contains valid advertisement filling information, then stop receiving the advertiser return information of the third priority request queue and the second priority request queue, and determine the cut-off time.

[0065] After determining whether there is valid ad filling information in the advertiser return information of the first priority request queue, if there is valid ad filling information in the advertiser return information of the first priority request queue, it means that the optimal ad filling information already exists, and there is no need to receive other low-priority advertiser return information at this time, then the advertiser return information of the third priority request queue and the second priority request queue is stopped from being received, and the deadline is determined to use the advertiser return information of each priority request queue received before the deadline as the bidding ad information. The valid ad filling information at this time is the ad filling information with the highest revenue and the shortest response time, which can maximize the revenue of the advertising transaction system. At the same time, stopping receiving the advertiser return information of the third priority request queue and the second priority request queue can reduce the processing time of the ad request and improve the system throughput.

[0066] S23: If the advertiser return information of the first priority request queue does not contain valid advertisement filling information, then after receiving all advertiser return information in the second priority request queue, determine whether the advertiser return information of the second priority request queue contains valid advertisement filling information.

[0067] After determining whether there is valid advertisement filling information in the advertiser return information of the first priority request queue, if there is no valid advertisement filling information in the advertiser return information of the first priority request queue, it means that there is no optimal advertisement filling information, and it is necessary to determine whether there is valid advertisement filling information in the advertiser return information of the second priority request queue after receiving all the advertiser return information in the second priority request queue, so as to select the next level of advertisement filling information as much as possible.

[0068] S24: If the advertiser return information of the second priority request queue contains valid advertisement filling information, stop receiving the advertiser return information of the third priority request queue and determine a cutoff time.

[0069] After determining whether there is valid advertisement filling information in the advertiser return information of the second priority request queue, if there is valid advertisement filling information in the advertiser return information of the second priority request queue, indicating that there is the next-level advertisement filling information, the advertiser return information of the third priority request queue is received and the cut-off time is determined. The valid advertisement filling information at this time is the advertisement filling information with higher revenue and / or shorter response time, which can ensure the revenue of the advertising transaction system.

[0070] S25: If the advertiser return information of the second priority request queue does not contain valid advertisement filling information, then after receiving all advertiser return information in the third priority request queue, determine whether the advertiser return information of the third priority request queue contains valid advertisement filling information.

[0071] After determining whether the advertiser return information of the second priority request queue contains valid ad filling information, if the advertiser return information of the second priority request queue does not contain valid ad filling information, indicating that there is no better ad filling option, it is necessary to determine whether the advertiser return information of the third priority request queue contains valid ad filling information after receiving all advertiser return information in the third priority request queue, that is, to determine whether ad filling can be performed.

[0072] S26: If the advertiser return information of the third priority request queue contains valid advertisement filling information, the reception time of the last advertiser return information in the third priority request queue is used as the deadline.

[0073] After determining whether there is valid advertisement filling information in the advertiser return information of the third priority request queue, if there is valid advertisement filling information in the advertiser return information of the third priority request queue, indicating that advertisement filling information that can be filled on the user side has been obtained, the reception time of the last advertiser return information in the third priority request queue is used as the deadline, that is, all advertiser return information in the first priority request queue, the second priority request queue and the third priority request queue are used as bidding advertisement information for internal advertisement bidding, so as to maximize the diversity of advertisement filling information and thereby ensure the advertising revenue of the system.

[0074] In this embodiment, after receiving all the advertiser return information in the first priority request queue, it is determined whether there is valid advertisement filling information in the advertiser return information of the first priority request queue; if there is valid advertisement filling information in the advertiser return information of the first priority request queue, then the reception of advertiser return information of the third priority request queue and the second priority request queue is stopped, and a cut-off time is determined; if there is no valid advertisement filling information in the advertiser return information of the first priority request queue, then after receiving all the advertiser return information in the second priority request queue, it is determined whether there is valid advertisement filling information in the advertiser return information of the second priority request queue; if there is valid advertisement filling information in the advertiser return information of the second priority request queue, then the reception of advertiser return information of the third priority request queue is stopped, and a cut-off time is determined; if the advertiser return information of the second priority request queue If there is no valid ad filling information in the return information of the advertisers in the third priority request queue, then after receiving the return information of all advertisers in the third priority request queue, it is determined whether there is valid ad filling information in the return information of the advertisers in the third priority request queue; if there is valid ad filling information in the return information of the advertisers in the third priority request queue, then the reception time of the last advertiser return information in the third priority request queue is used as the deadline. This clarifies the specific steps of determining whether there is valid ad filling information in the return information of the advertisers in each priority request queue according to the priority sorting of the priority request queues, and when there is valid ad filling information in the return information of the advertisers in a priority request queue, the reception of the return information of the remaining advertisers in other priorities is stopped. This provides a basis for subsequent advertising bidding, divides all advertisers into three priorities, and reduces the time the advertising trading system waits for feedback information from each priority request queue.

[0075] In one embodiment, after step S25, that is, after determining whether the advertiser return information of the third priority request queue has valid advertisement filling information, the method further specifically includes:

[0076] S37: If the advertiser return information of the third priority request queue does not contain valid advertisement filling information, it is determined that the advertiser return information in each priority request queue does not contain valid advertisement filling information.

[0077] After determining whether the advertiser return information of the third priority request queue contains valid ad filling information, if the advertiser return information of the third priority request queue does not contain valid ad filling information, then it is determined that the advertiser return information in each priority request queue does not contain valid ad filling information, and a prompt of valid ad filling information can be sent to the user terminal to enable the user terminal to be informed in time to reduce waiting time.

[0078] In one embodiment, all advertisers form an advertiser set, and the advertisers in the first priority request queue form a first subset of the advertiser set. The advertisers in the first subset are advertisers whose advertising revenue is greater than a first preset revenue and whose response time is less than the first preset time; the advertisers in the third priority request queue form a second subset of the advertiser set. The advertisers in the second subset are advertisers whose response time is greater than the second preset time; the advertisers in the second priority request queue form a third subset of the advertiser set. The advertisers in the third subset are advertisers in the advertiser set except for the first subset and the second subset. By dividing all advertisers into three priorities in the above manner, both advertising revenue and response time can be taken into account. While ensuring advertising revenue, the debt of the advertising transaction system is reduced, and the system throughput is improved.

[0079] The response time may be an average response time in a recent period of time, and the advertisement revenue may be an average advertisement revenue for the advertiser in a recent period of time.

[0080] For example, the first preset duration is 100 milliseconds, and the second preset duration is 200 milliseconds. All upstream advertisers are divided into three priority levels: first priority, second priority, and third priority. The subsets of advertisers of each priority level are P1, P3, and P2. Among them, P1 is a collection of advertisers whose advertising revenue is greater than the first preset revenue and whose response time is less than 100 milliseconds, P2 is a collection of advertisers whose response time is greater than 200 milliseconds, and P3 is a collection of remaining advertisers except P1 and P2. That is, the priority standard of P1 is high advertising revenue and short duration, the priority standard of P2 is long duration, and the rest are P3, and the default is also P3. After receiving the request from the user, asynchronous requests are initiated to the advertisers of P1, P3 and P2 at the same time, starting from the information returned by the advertiser of P1. When the information returned by the advertiser of P1 contains valid ad filling information, the information returned by the advertisers of P2 and P3 is received, the unreturned requests are discarded, and the information returned by the advertisers of P1, P3 and P2 are merged as bidding ad information. Otherwise, the process is recursive in sequence until valid ad filling information is found, or it is determined that there is no valid ad filling information.

[0081] In this embodiment, all advertisers are divided into three priority levels for exemplary purposes only, and the division of the first priority request queue, the second priority request queue, and the third priority request queue is for exemplary purposes only. In other embodiments, all advertisers can be divided into other numbers of priorities according to different division methods, which will not be repeated here.

[0082] In this embodiment, placing advertisers with long response times into P2 will not affect the monetization level of the advertising transaction system due to advertisers in P3, and can also collect as much advertising filling information as possible from advertisers in P2. Under the premise of ensuring advertising revenue, advertising filling information from more advertisements can be collected as much as possible, which will correspondingly increase the advertising revenue level. At the same time, grading advertisers based on advertising revenue and response time can reduce the response time of advertising requests as much as possible, thereby improving the throughput of the advertising transaction system and reducing costs.

[0083] In one embodiment, before step S30, that is, before conducting advertising bidding on the advertiser return information of each priority request queue before the deadline, the method further specifically includes: merging and aggregating the advertiser return information of each priority request queue before the deadline and saving it as the advertisement return result of the advertisement request.

[0084] Before bidding on advertisements based on the advertiser return information of each priority request queue before the deadline, the advertiser return information of each priority request queue before the deadline is merged and summarized and saved as the advertisement return result of the advertisement request, providing a data basis for subsequent evaluation of each advertiser.

[0085] 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.

[0086] In one embodiment, an advertisement filling device is provided, and the advertisement filling device corresponds to the advertisement filling method in the above embodiment. Figure 4 As shown, the advertisement filling device includes a sending module 401, a determining module 402 and a bidding module 403. The functional modules are described in detail as follows:

[0087] The sending module 401 is used to send advertisement requests to advertisers in multiple priority request queues simultaneously in an asynchronous request manner, so as to receive information returned by advertisers in each priority request queue. Advertisers of different priorities are advertisers classified according to advertisement revenue and response time.

[0088] The determination module 402 is used to determine whether the advertiser return information in each priority request queue has valid advertisement filling information according to the priority sorting of the priority request queues, and when the advertiser return information in a priority request queue has valid advertisement filling information, stop receiving the remaining advertiser return information of other priorities;

[0089] The bidding module 403 is used to bid for advertisements returned by advertisers in each priority request queue before the deadline, and send advertisement filling information that meets the bidding conditions to the user end for advertisement filling.

[0090] Further, after determining whether the advertiser return information in each priority request queue contains valid advertisement filling information, the sending module 401 is further used to:

[0091] When it is determined that the advertiser return information in all priority request queues does not contain valid advertisement filling information, a prompt message indicating that there is no advertisement filling is sent to the user terminal.

[0092] Further, the plurality of priority request queues include a first priority request queue, a second priority request queue, and a third priority request queue in descending order, and the determination module 402 is specifically used to:

[0093] After receiving all advertiser return information in the first priority request queue, determining whether there is valid advertisement filling information in the advertiser return information of the first priority request queue;

[0094] If the advertiser return information of the first priority request queue contains valid advertisement filling information, then the advertiser return information of the third priority request queue and the second priority request queue is received and the deadline is determined;

[0095] If the advertiser return information of the first priority request queue does not contain valid advertisement filling information, then after receiving all the advertiser return information in the second priority request queue, determine whether the advertiser return information of the second priority request queue contains valid advertisement filling information;

[0096] If the advertiser return information of the second priority request queue contains valid advertisement filling information, the advertiser return information of the third priority request queue is received before a deadline is determined.

[0097] Further, after determining whether the advertiser return information of the second priority request queue contains valid advertisement filling information, the determination module 402 is further specifically used to:

[0098] If the advertiser return information of the second priority request queue does not contain valid advertisement filling information, then after receiving all the advertiser return information in the third priority request queue, determine whether the advertiser return information of the third priority request queue contains valid advertisement filling information;

[0099] If the advertiser return information of the third priority request queue contains valid advertisement filling information, the reception time of the last advertiser return information in the third priority request queue is used as the deadline.

[0100] Further, after determining whether the advertiser return information of the third priority request queue contains valid advertisement filling information, the determination module 402 is further specifically used to:

[0101] If the advertiser return information of the third priority request queue does not contain valid advertisement filling information, it is determined that the advertiser return information in each priority request queue does not contain valid advertisement filling information.

[0102] Furthermore, the advertisement filling device further includes a storage module 404. Before the advertisement bidding is performed on the advertiser return information of each priority request queue before the deadline, the storage module 404 is specifically used to:

[0103] The advertiser return information of each priority request queue before the deadline is merged and summarized, and saved as the advertisement return result of the advertisement request.

[0104] For the specific definition of the advertisement filling device, please refer to the definition of the advertisement filling method above, which will not be repeated here. Each module in the above-mentioned advertisement filling device can be implemented in whole or in part by software, hardware and a combination thereof. Each of 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 each of the above modules.

[0105] In one embodiment, an advertisement filling device is provided. The advertisement filling device may be a server, and its internal structure diagram may be as follows: Figure 5 As shown. The advertisement filling device includes a processor, a memory, a network interface and a database connected through a system bus. Among them, the processor of the advertisement filling device is used to provide computing and control capabilities. The memory of the advertisement filling device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store advertiser return information. The network interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, an advertisement filling method is implemented.

[0106] In one embodiment, an advertisement filling device is provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the following steps are implemented:

[0107] Sending advertising requests to advertisers in multiple priority request queues simultaneously in an asynchronous request manner to receive information returned by advertisers in each priority request queue. Advertisers of different priorities are classified according to advertising revenue and response time.

[0108] According to the priority sorting of the priority request queues, determine one by one whether the advertiser return information in each priority request queue contains valid advertisement filling information, and when the advertiser return information in a priority request queue contains valid advertisement filling information, stop receiving the remaining advertiser return information of other priorities;

[0109] Advertisement bidding is performed on the advertiser return information of each priority request queue before the deadline, and the advertisement filling information that meets the bidding conditions is sent to the user end for advertisement filling.

[0110] In one embodiment, a computer readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:

[0111] Sending advertising requests to advertisers in multiple priority request queues simultaneously in an asynchronous request manner to receive information returned by advertisers in each priority request queue. Advertisers of different priorities are classified according to advertising revenue and response time.

[0112] According to the priority sorting of the priority request queues, determine one by one whether the advertiser return information in each priority request queue contains valid advertisement filling information, and when the advertiser return information in a priority request queue contains valid advertisement filling information, stop receiving the remaining advertiser return information of other priorities;

[0113] Advertisement bidding is performed on the advertiser return information of each priority request queue before the deadline, and the advertisement filling information that meets the bidding conditions is sent to the user end for advertisement filling.

[0114] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can 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 can include non-volatile and / or volatile memory. 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. As an 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).

[0115] 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.

[0116] 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 filling method, characterized in that: include: Sending advertisement requests to advertisers in multiple priority request queues simultaneously in an asynchronous request manner, so as to receive information returned by the advertisers in each priority request queue, wherein the advertisers of different priorities are advertisers classified according to advertisement revenue and response time, and the multiple priority request queues include a first priority request queue, a second priority request queue, and a third priority request queue in descending order; According to the priority sorting of the priority request queues, determine one by one whether there is valid advertisement filling information in the advertiser return information in each priority request queue, and when there is valid advertisement filling information in the advertiser return information in one priority request queue, stop receiving the remaining other priority advertiser return information, wherein the valid advertisement filling information is determined based on the bottom price, identification, category, size, quality and specific content of the advertisement material in the advertiser return information to determine whether the advertiser return information is valid advertisement filling information. The valid advertisement filling information is determined based on the bottom price, identification, category, size, quality and specific content of the advertisement material in the advertiser return information to determine whether the advertiser return information is valid advertisement filling information; Conducting advertisement bidding on the information returned by advertisers in each priority request queue before the deadline, and sending advertisement filling information that meets the bidding conditions to the user end for advertisement filling; The method of determining whether the advertiser return information in each priority request queue has valid advertisement filling information according to the priority sorting of the priority request queues, and stopping receiving the remaining information returned by other priority advertisers when the advertiser return information in one priority request queue has valid advertisement filling information, includes: After receiving all advertiser return information in the first priority request queue, determining whether there is valid advertisement filling information in the advertiser return information of the first priority request queue; If the advertiser return information of the first priority request queue contains valid advertisement filling information, then stop receiving the advertiser return information of the third priority request queue and the second priority request queue, and determine the cut-off time; If the advertiser return information of the first priority request queue does not contain valid advertisement filling information, then after receiving all the advertiser return information in the second priority request queue, determine whether the advertiser return information of the second priority request queue contains valid advertisement filling information; If the advertiser return information of the second priority request queue contains valid advertisement filling information, then stop receiving the advertiser return information of the third priority request queue and determine the cut-off time; All the advertisers form an advertiser set, the advertisers in the first priority request queue form a first subset of the advertiser set, and the advertisers in the first subset are advertisers whose advertising revenue is greater than a first preset revenue and whose response time is less than a first preset time; The advertisers in the third priority request queue form a second subset of the advertiser set, and the advertisers in the second subset are advertisers whose response time is longer than a second preset time. The advertisers in the second priority request queue form a third subset of the advertiser set, and the advertisers in the third subset are the advertisers in the advertiser set except the first subset and the second subset; Wherein, after determining whether the advertiser return information in each priority request queue contains valid advertisement filling information, the method further includes: When it is determined that all advertiser return information in the priority request queue does not contain valid advertisement filling information, a prompt message indicating that there is no advertisement filling is sent to the user terminal.

2. The advertisement filling method according to claim 1, characterized in that: After determining whether the advertiser return information of the second priority request queue contains valid advertisement filling information, the method further includes: If the advertiser return information of the second priority request queue does not contain valid advertisement filling information, then after receiving all the advertiser return information in the third priority request queue, determine whether the advertiser return information of the third priority request queue contains valid advertisement filling information; If the advertiser return information in the third priority request queue contains valid advertisement filling information, the time of receiving the last advertiser return information in the third priority request queue is used as the deadline.

3. The advertisement filling method according to claim 2, characterized in that: After determining whether the advertiser return information of the third priority request queue has valid advertisement filling information, the method further includes: If the advertiser return information of the third priority request queue does not contain valid advertisement filling information, it is determined that the advertiser return information in each priority request queue does not contain valid advertisement filling information.

4. The advertisement filling method according to any one of claims 1 to 3, characterized in that: Before bidding for advertisements on the advertiser return information of each priority request queue before the deadline, the method further includes: The advertiser return information of each priority request queue before the deadline is merged and summarized, and saved as the advertisement return result of the advertisement request.

5. An advertisement filling device, characterized in that: include: A sending module, used to send advertisement requests to advertisers in multiple priority request queues simultaneously in an asynchronous request manner, so as to receive return information from advertisers in each priority request queue, wherein advertisers of different priorities are advertisers classified according to advertisement revenue and response time, and the multiple priority request queues include a first priority request queue, a second priority request queue, and a third priority request queue in descending order; A determination module is used to determine whether there is valid advertisement filling information in the advertiser return information in each priority request queue according to the priority sorting of the priority request queues, and when there is valid advertisement filling information in the advertiser return information in one of the priority request queues, stop receiving the remaining other priority advertiser return information, wherein the valid advertisement filling information is determined based on the bottom price, identification, category, size, quality and specific content of the advertisement material in the advertiser return information to determine whether the advertiser return information is valid advertisement filling information; A bidding module, used to bid for advertisements returned by advertisers in each priority request queue before the deadline, and send advertisement filling information that meets the bidding conditions to the user end for advertisement filling; The determination module is specifically used for: After receiving all advertiser return information in the first priority request queue, determining whether there is valid advertisement filling information in the advertiser return information of the first priority request queue; If the advertiser return information of the first priority request queue contains valid advertisement filling information, then stop receiving the advertiser return information of the third priority request queue and the second priority request queue, and determine the cut-off time; If the advertiser return information of the first priority request queue does not contain valid advertisement filling information, then after receiving all the advertiser return information in the second priority request queue, determine whether the advertiser return information of the second priority request queue contains valid advertisement filling information; If the advertiser return information of the second priority request queue contains valid advertisement filling information, then stop receiving the advertiser return information of the third priority request queue and determine the cut-off time; All the advertisers form an advertiser set, the advertisers in the first priority request queue form a first subset of the advertiser set, and the advertisers in the first subset are advertisers whose advertising revenue is greater than a first preset revenue and whose response time is less than a first preset time; The advertisers in the third priority request queue form a second subset of the advertiser set, and the advertisers in the second subset are advertisers whose response time is longer than a second preset time. The advertisers in the second priority request queue form a third subset of the advertiser set, and the advertisers in the third subset are the advertisers in the advertiser set except the first subset and the second subset; After determining whether the advertiser return information in each priority request queue contains valid advertisement filling information, the method further includes: When it is determined that all advertiser return information in the priority request queue does not contain valid advertisement filling information, a prompt message indicating that there is no advertisement filling is sent to the user terminal.

6. An advertisement filling device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the steps of the advertisement filling method according to any one of claims 1 to 4 are implemented.

7. A readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the steps of the advertisement filling method according to any one of claims 1 to 4 are implemented.

Images