Abstract: Each of a plurality of Worker processes are allowed to perform any and all of the following tasks involving logged work items: (1) reading a subset of the work items from a log; (2) sequentially ordering work items for corresponding data objects; (3) applying a sequentially ordered set of work items to a corresponding data object; and (4) transmitting a subset of work items to a Worker process running on another database server in a cluster, if necessary. These tasks can be performed concurrently, at will, and as available, by the Worker processes. An improved checkpointing technique eliminates the need for the Worker processes to get to a synchronization point and stop. Instead, a Coordinator process examines the current state of progress of the Worker processes and computes a past point in the sequence of work items at which all work items before that point have been completely processed, and records this point as the checkpoint.

Abstract: Methods and systems are provided for providing recommendations to users of a computer-based network of items of potential interest to the users. Items and people of potential interest to users may be determined using obtained word-based social behavior information, semantically-sensitive vocabulary taxonomies, and determined implied topic-specific social networks. The user may be presented with a graphical user interface including the recommendation, an explanation of the rationale relating to the recommendation, and an opportunity for the user to provide feedback relating to the recommendation or the rationale. The feedback may be used to improve future recommendations.

Abstract: A method of processing a supply query is described. The method includes receiving a first supply query comprising a first set of attributes. A size of the first set of attributes is compared to a threshold value. A second supply query comprising a second set of attributes is generated when the comparison indicates that the size of the first set of attributes is greater than the threshold value.

Abstract: In a large-scale transaction such as the bulk loading of new records into an ordered, distributed database, a transaction limit such as an insert limit may be chosen, partitions on overfull storage servers may be designated to be moved to underfull storage servers, and the move assignments may be based, at least in part on the degree to which a storage server is underfull and the move and insertion costs of the partitions to be moved.

Abstract: Each of a plurality of Worker processes are allowed to perform any and all of the following tasks involving logged work items: (1) reading a subset of the work items from a log; (2) sequentially ordering work items for corresponding data objects; (3) applying a sequentially ordered set of work items to a corresponding data object; and (4) transmitting a subset of work items to a Worker process running on another database server in a cluster, if necessary. These tasks can be performed concurrently, at will, and as available, by the Worker processes. An improved checkpointing technique eliminates the need for the Worker processes to get to a synchronization point and stop. Instead, a Coordinator process examines the current state of progress of the Worker processes and computes a past point in the sequence of work items at which all work items before that point have been completely processed, and records this point as the checkpoint.

Abstract: Various embodiments pertain to techniques for forecasting and providing guaranteed delivery of ad impression opportunities using real-time bidded platform inventories. In various embodiments, bid landscape data, such as information regarding a number of impression requests by a particular supply unit, a time of the impression requests, and an amount of a winning bid for the impression requests, is recorded for use in forecasting an available impression volume as a function of cost. The forecasted available impression volume represents a number of ad impression requests likely to be obtained through real-time bidding channels. In various embodiments, an advertiser can place an order for a number of ad impressions at a particular price, and the ad impressions ordered can be specifically allocated for that advertiser. The number of ad impressions ordered by an advertiser that are guaranteed vary depending on the price and the available volume forecasted at that price.

Abstract: A method, system and computer readable medium to adjust impression supply sampling weights in a display advertising environment while providing high-performance supply forecasting using trends adjustments and override rules. A forecasting system initiates the method upon submitting a campaign query (with a campaign query predicate to be matched with impression supply predicates) and a campaign query time period (specifying time-wise aspects of an advertising campaign). Upon receiving initial campaign query results (e.g. impression supply datastructure with base weights), the method proceeds to identify applicable weight adjustment rules for applying to the impression supply node, then, after accounting for trends or other time-wise aspects of the weight adjustment rule, applying the adjustment rule to the impression supply base weight of an impression supply node, resulting in at least one adjusted trend weight.

Abstract: Systems and methods for automatically determining the availability of resources, such as Internet advertising opportunities, are described herein. The systems and methods efficiently process bulk queries that specify multiple target values for at least one attribute associated with the resources, such bulk queries being useful for determining the availability of a wide variety of different resource types.

Abstract: A method of processing a supply query is described. The method includes receiving a first supply query comprising a first set of attributes. A size of the first set of attributes is compared to a threshold value. A second supply query comprising a second set of attributes is generated when the comparison indicates that the size of the first set of attributes is greater than the threshold value.

Abstract: A system and method for adjusting demand parameters to produce an optimized allocation plan for delivering a plurality of impressions to a plurality of contracts for display advertising. The method commences upon receiving a first eligibility graph, the first eligibility graph comprising a plurality of impressions, a plurality of contracts and at least one first demand parameter. For reducing errors in sampling that affect the eligibility graph, demand parameters contained within the first eligibility graph are adjusted, resulting in an adjusted first eligibility graph. Once the adjusted first eligibility graph is available, a network solver is used for solving the adjusted first eligibility graph to produce an adjusted allocation plan, which adjusted allocation plan is used for displaying at least one of the plurality of impressions.

Abstract: A network based advertisement system includes a supply forecasting system configured to select, from a campaign log database, data that defines a plurality of contracts. Each contract specifies requirements that include contract target audience information and a number of impressions. For each contract, the supply forecasting system identifies one or more opportunity samples with characteristics that match contract target audience information of the contract. Each opportunity sample is associated with a weight that corresponds to a number of opportunities with similar characteristics. An optimizer associates the opportunity samples with the contract and then determines whether the opportunity samples are associated with other contracts. The optimizer then limits the number of opportunities associated with the samples that are allocatable to the contract based at least in part on a function of requirements of other contracts associated with the one or more samples.

Abstract: A network based advertisement system includes an advertisement admission system configured to receive target values that belong to different target categories and to generate a search query associated with the target values and target categories. The system includes a supply forecasting system configured to select sample opportunities that match the search query from a store of opportunities. The advertisement admission system then determines one or more target value combinations. Each target value combination includes at least one target value from each of the different target categories. Then, the advertisement admission system determines a number of available opportunities represented by the sample opportunities that match the one or more target value combinations.

Abstract: A method of forecasting a supply using data from a plurality of data servers is described. The method includes receiving a request for a supply forecast and sending a query for supply data to a plurality of data servers. The method also includes receiving the supply data from one or more of the plurality of data servers in response to the query. A response level is determined based on the received supply data, and is compared to a threshold level. The method also includes computing the supply forecast based on the received supply data when the response level equals or exceeds the threshold level.

Abstract: Embodiments of the present invention provide for methods, systems and computer program products for utilizing a lattice structure in an advertisement serving system. The method according to one embodiment of the present invention comprises storing one or more advertisement contracts in a lattice structure. A request for one or more advertisements that satisfy one or more constraints is then received and within the lattice structure, a lowest level of one or more pools of advertisement contracts satisfying the one ore more constraints is located. A set of advertisement contracts is generated, wherein the set of advertisement contracts comprise one or more advertisement contracts from lowest level of the lattice structure. The method further comprises adding to the set of advertisement contracts advertisement contracts from the pools of advertisement contracts that are parent to the pools of contracts in the lowest level of the lattice structure.

Abstract: A method for indexing advertising contracts for rapid retrieval and matching in order to match only the top N satisfying contracts to advertising slots. Descriptions of advertising contracts include logical predicates indicating weighted applicability to a particular demographic. Descriptions of advertising slots also contain logical predicates indicating weighted applicability to particular demographics, thus matches are performed on the basis of a weighed score of intersecting demographics. Disclosed are structure and techniques for receiving a set of contracts with weighted predicates, preparing a data structure index of the set of contracts, receiving an advertising slot with weighted predicates, and retrieving from the data structure only the top N weighted score contracts that satisfy a match to the advertising slot predicates.

Abstract: A method for determining a price of a contract for booking advertising space in a networked environment includes receiving, via a web server, a request to book a number of impressions from available impression inventory, where each impression corresponds to the delivery of an advertisement to a browser. The method also includes assembling user samples that represent a total amount of impression inventory, where each user sample represents a number of internet users, calculating a value associated with each piece of remaining impression inventory of the total impression inventory, and evaluating the value of all remaining impression inventory before and after allocation to a contract by maximizing and equation subject to a set of constraints. The base price for the contract corresponds to the difference between the value of the inventory before and after allocation.

Abstract: A method for allocating inventory in a networked environment includes receiving a request to purchase a number of display impressions, the request including targeting parameters and a frequency constraint corresponding to a maximum number of times the advertisement can be displayed to a user. The method also includes allocating the requested number of display impressions across a set of user samples, where the number of impressions allocated to any one user sample in the set of user samples is constrained by the frequency constraint. Allocation information that defines how the impressions are allocated among the user samples is stored to a user sample database.

Abstract: A method for indexing advertising contracts for rapid retrieval and matching in order to match satisfying contracts to advertising slots. The descriptions of the advertising contracts include logical predicates indicating applicability to a particular demographic. Also, the descriptions of advertising slots contain logical predicates indicating applicability to a particular demographic, thus matches can be performed using at least matches on the basis of intersecting demographics. The disclosure contains structure and techniques for receiving a set of contracts with predicates, preparing a data structure index of the set of contracts, receiving an advertising slot with predicates, and structure and techniques for retrieving from the data structure contracts that satisfy a match to the advertising slot predicates.

Abstract: A technique is described that reduces the complexity and resource consumption associated with performing record expiry in a distributed database system. In accordance with the technique, a record is checked to see if it has expired only when it has been accessed for a read or a write. If at the time of a read a record is determined to have expired, then it is not served. If at the time of a write a record is determined to have expired, then the write is treated as an insertion of a new record, and steps are taken to treat the insertion consistently with regard to the previous expired version. A background process is used to delete records that have not been written to or actively deleted by a client after expiration.

Abstract: Each of a plurality of Worker processes are allowed to perform any and all of the following tasks involving logged work items: (1) reading a subset of the work items from a log; (2) sequentially ordering work items for corresponding data objects; (3) applying a sequentially ordered set of work items to a corresponding data object; and (4) transmitting a subset of work items to a Worker process running on another database server in a cluster, if necessary. These tasks can be performed concurrently, at will, and as available, by the Worker processes. An improved checkpointing technique eliminates the need for the Worker processes to get to a synchronization point and stop. Instead, a Coordinator process examines the current state of progress of the Worker processes and computes a past point in the sequence of work items at which all work items before that point have been completely processed, and records this point as the checkpoint.