Ad collision reduction

Patent metadata

Field	Value
Publication number	US-11798041-B2
Application number	US-202117556922-A
Country	US
Kind code	B2
Filing date	Dec 20, 2021
Priority date	Sep 23, 2016
Publication date	Oct 24, 2023
Grant date	Oct 24, 2023

Abstract

An ad collision machine can be configured to evaluate collision queries for possible ad collisions and is associated with an ad datacenter configured to evaluate and respond to bid requests on behalf of a plurality of advertisers. The ad collision machine can comprise a plurality of nodes and a data cache containing a plurality of user ID—campaign ID keys representing recently submitted bids in response to bid requests. Once a selected node receives a collision query, a user ID—campaign ID key is retrieved from the collision query. If the first key is not found in the data cache, it is written to the data cache by the node and the ad collision machine returns that user ID—campaign ID pair as available to be bid on.

First claim

The invention claimed is:

1. A method in a content display space collision machine comprising:
a plurality of machine nodes each machine node capable of evaluating a content display space collision query, a machine node assignment module, and a data cache for each of the machine nodes, each data cache containing a plurality of keys that are associated with a particular machine node;
the method comprising, at the content display space collision machine:
receiving a first query comprising a user ID and one or more content display strategy IDs;
identifying using the machine node assignment module and based on the user ID a selected one of the machine nodes;
assigning the received first query to the selected machine node for evaluation;
retrieving, at the selected machine node, a first key from the received first query, the first key comprising the user ID and a first one of the content display strategy IDs;
determining, at the selected machine node, the first key matches a key stored in the data cache of the selected machine node; and
returning an indication that the user ID and first content display strategy ID associated with the first query are unavailable.

2. The method of claim 1 , wherein receiving a first query comprising a user ID and one or more content display strategy IDs comprises receiving, at the content display space collision machine, a plurality of queries, the plurality of queries comprising the first query and a second query comprising a user ID and one or more content display strategy IDs and wherein the method of claim 1 further comprises:
identifying, based on the user ID of the second query, a selected one of the machine nodes;
assigning the received second query to the selected machine node for evaluation;
retrieving, at the selected machine node, a second key from the received second query, the second key comprising the user ID of the second query and a second one of the content display strategy IDs; and
determining, at the selected machine node, if the second key matches a key stored in the data cache of the selected machine node.

3. The method of claim 2 , further comprising:
retrieving, at the selected machine node, a third key from the received second query, the second key comprising the user ID of the second query and a third one of the content display strategy IDs; and
determining, at the selected machine node, if the third key matches a key stored in the data cache of the selected machine node.

4. The method of claim 2 , wherein the first query and second query are evaluated in sequence such that evaluation of the second query begins after the content display space collision machine returns a response to the first query.

5. The method of claim 1 , wherein returning the indication comprises:
transmitting the user ID and first content display strategy ID associated with the first key to a bidding machine configured to respond to a bid request associated with the user ID with a bid including an advertisement associated with the first content display strategy ID.

6. The method of claim 1 , further comprising:
flushing the data cache of at least one of the machine nodes to clear stored keys older than a threshold amount of time.

7. The method of claim 1 , further comprising:
flushing the data cache of at least one of the machine nodes to clear all stored keys after a period of time.

8. The method of claim 1 , wherein identifying, based on the user ID, a selected one of the machine nodes comprises:
identifying the selected machine node based on the user ID and a modulus of a total count of the machine nodes.

9. The method of claim 1 , wherein the first query further comprises a ranked list of the one or more content display strategy IDs.

10. A non-transitory computer readable storage medium comprising instructions which, when executed by a processor, cause the processor to perform operations comprising, at least:
receiving, at a content display space collision machine, a first query comprising a user ID and one or more content display strategy IDs, the content display space collision machine comprising a plurality of machine nodes, a machine node assignment module, and a data cache for each of the machine nodes, each data cache containing a plurality of keys that are associated with a particular machine node;
identifying, based on the user ID and using the machine node assignment module, a selected one of the machine nodes;
assigning the received first query to the selected machine node for evaluation;
retrieving, at the selected machine node, a first key from the received first query, the first key comprising the user ID and a first one of the content display strategy IDs,
determining, at the selected machine node, the first key matches a key stored in the data cache of the selected machine node; and
returning an indication that the user ID and first content display strategy ID associated with the first query are unavailable.

11. The non-transitory computer readable storage medium of claim 10 , wherein receiving a first query comprising a user ID and one or more content display strategy IDs comprises receiving, at the content display space collision machine, a plurality of queries, the plurality of queries comprising the first query and a second query comprising a user ID and one or more content display strategy IDs and wherein the non-transitory computer readable storage medium of claim 10 further comprises instructions which, when executed by the processor, cause the processor to perform further operations comprising, at least:
identifying, based on the user ID of the second query, a selected one of the machine nodes;
assigning the received second query to the selected machine node for evaluation;
retrieving, at the selected machine node, a second key from the received second query, the second key comprising the user ID of the second query and a second one of the campaign content display strategy IDs; and
determining, at the selected machine node, if the second key matches a key stored in the data cache of the selected machine node.

12. The non-transitory computer readable storage medium of claim 11 further comprising instructions which, when executed by the processor, cause the processor to perform further operations comprising, at least:
retrieving, at the selected machine node, a third key from the received second query, the second key comprising the user ID of the second query and a third one of the content display strategy IDs; and
determining, at the selected machine node, if the third key matches a key stored in the data cache of the selected machine node.

13. The non-transitory computer readable storage medium of claim 11 , wherein the first query and second query are evaluated in sequence such that evaluation of the second query begins after the content display space collision machine returns a response to the first query.

14. The non-transitory computer readable storage medium of claim 10 , wherein returning the indication comprises:
transmitting the user ID and first content display strategy ID associated with the first key to a bidding machine configured to respond to a bid request associated with the user ID with a bid including an advertisement associated with the first content display strategy ID.

15. The non-transitory computer readable storage medium of claim 10 further comprising instructions which, when executed by the processor, cause the processor to perform:
flushing the data cache of at least one of the machine nodes to clear stored keys older than a threshold amount of time.

16. The non-transitory

Assignees

• Zeta Global Corp

Inventors

• Zou Chendong
• Kumar Yogesh
• Han Guodong

Classifications

• G06Q30/0275 Primary

  Auctions · CPC title

• G06F7/02

  Comparing digital values (G06F7/06, {G06F7/22,} G06F7/38 take precedence) · CPC title