Abstract: A method is disclosed. The method includes a relationship server receiving a discovery service request from a client computer, the relationship server comparing metadata provided in the discovery service request against a database and a crawler retrieving updated metadata from a commerce server for if the metadata provided in the discovery service request does not match the metadata stored in the database column.

Abstract: According to examples, a system for rate-based load balancing may include a processor and a memory storing instructions. The processor may, through execution of the instructions, cause the system to receive a request for processing. The system may further identify a target server to transmit the request using a rate-based load balancing technique. In some examples, the rate-based load balancing technique may include: selecting a server, from a plurality of servers, as a potential target; receiving a readiness indicator for the selected server; and designating the selected server as the target server based on the readiness indicator. The system may transmit the request to the target server for processing.

Abstract: A method is disclosed. The method includes a relationship server receiving a discovery service request from a client computer, the relationship server comparing metadata provided in the discovery service request against a database and a crawler retrieving updated metadata from a commerce server for if the metadata provided in the discovery service request does not match the metadata stored in the database column.

Abstract: A method is disclosed. The method includes a relationship server receiving a discovery service request from a client computer, the relationship server comparing metadata provided in the discovery service request against a database and a crawler retrieving updated metadata from a commerce server for if the metadata provided in the discovery service request does not match the metadata stored in the database column.

Abstract: Whether video advertisements are being delivered to a human user or a machine is determined passively, i.e., without having the user to perform any explicit actions. Based on the time and frequency of ad requests generated from a user device, a daily schedule is estimated for the user. The estimated daily schedule is compared with a daily schedule pattern to determine whether the user is a human user or not.

Abstract: Access requests to a database are monitored for average time taken to fulfill the requests and whether a queue of unfulfilled requests is building up beyond an acceptable threshold. When the queue has built up beyond the acceptable threshold and/or when the average time taken to fulfill the requests has exceeded a delay threshold value, database access requests may be rejected. In one advantageous aspect, a graceful degradation in performance may be achieved by selectively rejecting access requests of a lower priority and favoring access requests of a higher priority for execution.

Abstract: Methods and systems for fixed delay storage operations such as lookup and insertion and their applications to advertisement exchange systems are disclosed. In one aspect, a method is provided for inserting a key into a corresponding location in a storage within a fixed delay. The method may determine the corresponding location for inserting the key by a first hashing function and a second hashing function. The method may also utilize an eviction criterion for evicting collided hashed values of the key to ensure the insertion time for operations related to inserting the key to be bounded by a fixed delay, which may be within a fixed time interval, or within a fixed number of steps.

Abstract: A method is disclosed. The method includes a relationship server receiving a discovery service request from a client computer, the relationship server comparing metadata provided in the discovery service request against a database and a crawler retrieving updated metadata from a commerce server for if the metadata provided in the discovery service request does not match the metadata stored in the database column.

Abstract: Access requests to a database are monitored for average time taken to fulfill the requests and whether a queue of unfulfilled requests is building up beyond an acceptable threshold. When the queue has built up beyond the acceptable threshold and/or when the average time taken to fulfill the requests has exceeded a delay threshold value, database access requests may be rejected. In one advantageous aspect, a graceful degradation in performance may be achieved by selectively rejecting access requests of a lower priority and favoring access requests of a higher priority for execution.

Abstract: Access requests to a database are monitored for average time taken to fulfill the requests and whether a queue of unfulfilled requests is building up beyond an acceptable threshold. When the queue has built up beyond the acceptable threshold and/or when the average time taken to fulfill the requests has exceeded a delay threshold value, database access requests may be rejected. In one advantageous aspect, a graceful degradation in performance may be achieved by selectively rejecting access requests of a lower priority and favoring access requests of a higher priority for execution.

Abstract: A method is disclosed including a client accessing a cache for a value of an object based on an object identification (ID), initiating a request to a cache loader if the cache does not include a value for the object, the cache loader performing a lookup in an object table for the object ID corresponding to the object, the cache loader retrieving a vector of execution context IDs, from an execution context table that correspond to the object IDs looked up in the object table and the cache loader performing an execution context lookup in an execution context table for every retrieved execution context ID in the vector to retrieve object IDs from an object vector.

Abstract: Access requests to a database are monitored for average time taken to fulfill the requests and whether a queue of unfulfilled requests is building up beyond an acceptable threshold. When the queue has built up beyond the acceptable threshold and/or when the average time taken to fulfill the requests has exceeded a delay threshold value, database access requests may be rejected. In one advantageous aspect, a graceful degradation in performance may be achieved by selectively rejecting access requests of a lower priority and favoring access requests of a higher priority for execution.

Abstract: Methods and systems for fixed delay storage operations such as lookup and insertion and their applications to advertisement exchange systems are disclosed. In one aspect, a method is provided for inserting a key into a corresponding location in a storage within a fixed delay. The method may determine the corresponding location for inserting the key by a first hashing function and a second hashing function. The method may also utilize an eviction criterion for evicting collided hashed values of the key to ensure the insertion time for operations related to inserting the key to be bounded by a fixed delay, which may be within a fixed time interval, or within a fixed number of steps.

Abstract: A method is disclosed including a client accessing a cache for a value of an object based on an object identification (ID), initiating a request to a cache loader if the cache does not include a value for the object, the cache loader performing a lookup in an object table for the object ID corresponding to the object, the cache loader retrieving a vector of execution context IDs, from an execution context table that correspond to the object IDs looked up in the object table and the cache loader performing an execution context lookup in an execution context table for every retrieved execution context ID in the vector to retrieve object IDs from an object vector.

Abstract: Techniques and systems are provided for fulfilling an advertisement campaign where online advertisements are paced by controlling, in real time, how many advertisements are served to users in a given time interval. Audit information gathered from a viewer's device may also be used to provide input to the real time pacing of advertisements.

Abstract: Whether video advertisements are being delivered to a human user or a machine is determined passively, i.e., without having the user to perform any explicit actions. Based on the time and frequency of ad requests generated from a user device, a daily schedule is estimated for the user. The estimated daily schedule is compared with a daily schedule pattern to determine whether the user is a human user or not.

Abstract: A method is disclosed including a client accessing a cache for a value of an object based on an object identification (ID), initiating a request to a cache loader if the cache does not include a value for the object, the cache loader performing a lookup in an object table for the object ID corresponding to the object, the cache loader retrieving a vector of execution context IDs, from an execution context table that correspond to the object IDs looked up in the object table and the cache loader performing an execution context lookup in an execution context table for every retrieved execution context ID in the vector to retrieve object IDs from an object vector.

Abstract: A method is disclosed including a client accessing a cache for a value of an object based on an object identification (ID), initiating a request to a cache loader if the cache does not include a value for the object, the cache loader performing a lookup in an object table for the object ID corresponding to the object, the cache loader retrieving a vector of execution context IDs, from an execution context table that correspond to the object IDs looked up in the object table and the cache loader performing an execution context lookup in an execution context table for every retrieved execution context ID in the vector to retrieve object IDs from an object vector.

Abstract: A method is disclosed including a client accessing a cache for a value of an object based on an object identification (ID), initiating a request to a cache loader if the cache does not include a value for the object, the cache loader performing a lookup in an object table for the object ID corresponding to the object, the cache loader retrieving a vector of execution context IDs, from an execution context table that correspond to the object IDs looked up in the object table and the cache loader performing an execution context lookup in an execution context table for every retrieved execution context ID in the vector to retrieve object IDs from an object vector.

Abstract: Systems and methods are described for performing the dynamic generation of correlation scores between arbitrary objects. When a behavioral event is recorded, that is to say when an end user interacts with multiple objects, relationships between objects are created. These relationships are maintained as a list. When a request for correlated items is requested based upon a seed object, a list of correlated items is dynamically created through the generation of a pivot set and a scoring algorithm to compute the list of correlated items.