Blue Kai, Inc.

Yahoo! Inc.

Michael David Bigby

Lucian Vlad Lita

John Patrick Connelly

Utkarsh Srivastava

Brian Frank Cooper

Philip Lewis Bohannon

Daniel E Weaver

Ramana Yerneni

Charles Yang

Andrew Feng

Guohan Gao

Raghu Ramakrishnan

Bhavesh R Mehta

Bryan Call

Kurt Peterson

Andy Atherton

Harry Fung

David Lomax

Maojin Jiang

Todd Enerson

Britton Glasser

Adam Taisch

A system, method, apparatus, and processor readable non-transitive storage media are described for matching items in large datasets based on non-invasive fingerprints of users so that collected metric data for advertisements (media) and behavioral data may be reconciled and analyzed. Since user fingerprints may not generate a unique one to one correspondence or mapping under certain constraints, the various embodiments employ a sampling method that optimally matches the output of a random sampling of non-invasive fingerprints. The use of non-invasive fingerprints and specialized sampling enables the various embodiments to provide advanced analytics for advertising content and metric data in targeted behavior advertising campaigns. To compare impressions with user profile data, the various embodiments employ in part the time stamp dimension of user profiles to generate temporally unique persistent non-invasive fingerprints.

Non-invasive sampling and fingerprinting of online users and their behavior

A system, method, apparatus and processor readable media are described for real-time prediction of an advertising audience volume through analysis of historical audience data, and tuning of the predicted audience volume. Embodiments enable a user to specify a query for audience volume prediction. Such a query may be a Boolean combination of various audience categories. A time range may be determined that indicates the amount of historical data that is to be analyzed to make the audience volume prediction in real time. Employing the user-specified query, an audience volume prediction may be provided for a future time period, based on an analysis of retrieved historical audience data for the time range. Embodiments may also enable a user to tune the predicted audience volume through modification of the query through one or more iterations.

Real time audience forecasting

A system, method, apparatus, and processor readable storage media are described for real-time computation of statistics between audiences including, but not limited to, correlations, comparative metrics, and/or other statistical analysis for the audiences. Embodiments enable a user to specify a query that defines a specific audience for analysis in real-time. A past time period may be determined that indicates the amount of historical data that is to be analyzed to generate the statistical comparisons and/or correlations. Employing the user-specified query, statistical comparisons and/or correlation may be provided, based on an analysis of retrieved historical audience data for the time period. Embodiments may also enable a user to generate new statistics in real-time through modification of the audience in one or more iterations. Embodiments may also enable a user to filter, sort, and search through audiences by setting desired statistical boundaries for the resulting audience set.

Real time statistics extraction from arbitrary advertising audiences

A method, system, apparatus, and storage medium for determining that a client device is enabled for persistent identification, and that may operate as a filter for user information based on whether the client is enabled for persistent identification. A first communication is received regarding a request by the client for a web page. At least one application level data structure is then provided for storage by the client, that persistently identifies at least one characteristic of the client. A second communication is then received that includes a representation of the application level data structures provided, and a comparison is made between the data structures provided and the representation received to determine whether the client is enabled for persistent identification. If persistent identification is enabled, the client may then be provided with advertisements or other content related to the client interests or characteristics.

Filter for user information based on enablement of persistent identification

A method for scheduling advertising comprises the steps of: estimating a respective fraction of delivered advertisement impressions that result in a response from a user for each of a plurality of advertising contracts, estimating a value per impression for each of the advertising contracts, and scheduling an advertising line under the contract having the highest value per impression at a next available advertising window.

Method and system for scheduling electronic advertising

Techniques are provided for selecting among the advertisements that are competing for a slot based, at least in part, on an 'schedule sequence' that is established for the advertisements. The schedule sequence may, for example, reflect the relative times at which a content provider incurred the delivery obligations associated with the advertisements. For the purpose of establishing the sequence, the date on which an advertisement order is placed may be considered to be the date on which the corresponding delivery obligations are incurred. After the sequence has been established, the position of competing advertisements within the schedule sequence is used as one of the factors for determining which competing ad to place in a slot, where ads nearer the beginning of the sequence (ads with earlier-incurred delivery obligations) are favored over ads that are nearer the end of the sequence (ads with later-incurred delivery obligations).

Selecting among advertisements competing for a slot associated with electronic content delivered over a network

Methods and apparatuses are provided for dynamically reorganizing the data within a replicated database system. One method, for example, includes performing a split operation across a plurality of replicated databases with regard to an existing partition therein, wherein the existing partition comprises a plurality of data records and the two new partitions each include at least a portion of the plurality of data records, and allowing at least one type of access to the plurality of data records during the split operation.

Dynamic data reorganization to accommodate growth across replicated databases

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.

Decentralized record expiry

Growing community of inventors

Los Gatos, CA, United States of America

Michael David Bigby