| Patent application number | Description | Published |
|---|
| 20080256037 | METHOD AND SYSTEM FOR GENERATING AN ORDERED LIST - A system for generating an ordered list. The system may include a query engine and an advertisement engine. The query engine receives a query from the user and determines parameters to match with the advertisement. The advertisement engine receives the parameters and generates a list of items based on the parameters. The system may function in a precompute mode to calculate intervals for each available item to minimize the variable processing costs for each item. Further, the number of intervals a crossed item may be selected in a manner to satisfy a given space constraint. By characterizing each item by a minimum price within each interval, the system can quickly query the interval matching the desired quantity for each item and determined if the minimum price for that interval is less than the top-k prices already included in the list. | 10-16-2008 |
| 20080288480 | EFFICIENT ONLINE COMPUTATION OF DIVERSE QUERY RESULTS - The system includes a query engine and an advertisement engine. The query engine is configured to receive a query from the user. The advertisement engine generates advertisement results corresponding to the query. The advertisement results are selected from entries in an advertisement database, where the entries include predicate values corresponding to a domain. The advertisement engine generates a diverse advertisement result that is a subset of the database entries that match the query. The diversity result varies at least one predicate by selecting entries for the list that include a proportional representation of each available predicate value in the database that matches the query. | 11-20-2008 |
| 20090112846 | SYSTEM AND/OR METHOD FOR PROCESSING EVENTS - The subject matter disclosed herein relates to processing information regarding events. In one particular example, a stabbing query may be formulated in response to an event. One or more sets are associated with and/or mapped to nodes of a tree. | 04-30-2009 |
| 20090132556 | OFFLINE OPERATIONS FOR ONLINE APPLICATIONS - Subject matter disclosed herein may relate to enabling offline operations for online applications. | 05-21-2009 |
| 20090132959 | METHOD AND/OR SYSTEM FOR SCHEMA AND VIEW GENERATION - The subject matter disclosed herein relates to a method and/or system for generating schema responsive to user navigation patterns. | 05-21-2009 |
| 20090204703 | AUTOMATED DOCUMENT CLASSIFIER TUNING - Subject matter disclosed herein relates to document classification and/or automated document classifier tuning. | 08-13-2009 |
| 20090319476 | ADAPTIVE MATERIALIZED VIEW SELECTION FOR DATABASES - Techniques described herein adaptively select materialized view fragments for persistent maintenance. During an interval of time, the selected fragments are persistently maintained in the database system, while the other non-selected fragments are not persistently maintained as materialized view fragments. Over time, the composition of the set of selected fragments may change. As queries are executed in the database system over an interval of time, statistics including the frequency of access of each currently selected fragment during that interval are generated. At the start of the next interval of time, based on these statistics, some currently selected fragments may be unselected. Some currently non-selected fragments of one or more candidate materialized views may be selected based on the statistics. For the next interval, the newly unselected fragments cease to be persistently maintained as materialized view fragments, while the newly selected fragments begin to be persistently maintained as materialized view fragments. | 12-24-2009 |
| 20100023564 | SYNCHRONOUS REPLICATION FOR FAULT TOLERANCE - Subject matter disclosed herein relates to data management of multiple applications, and in particular, to fault tolerance for such management. | 01-28-2010 |
| 20100036865 | Method For Generating Score-Optimal R-Trees - A method of constructing a score-optimal R-tree to support top-k stabbing queries over a set of scored intervals generates a constraint graph from the set, and determines over each node in the constraint graph that has no other nodes pointing to it the node with the smallest left endpoint; for each of these nodes, the associated interval is added to the tree and the node is removed from the constraint graph. | 02-11-2010 |
| 20100082393 | DISPLAY ADVERTISING CONTRACT PRICING - Example embodiments described herein may relate to pricing contracts for a display advertising system utilized, for example, in Web-based advertising. | 04-01-2010 |
| 20100082401 | FORECASTING FOR ADVERTISING INVENTORY ALLOCATION - Subject matter disclosed herein relates to a system for managing online advertising, and in particular, to pricing of advertising inventory and its allocation to advertising campaigns. | 04-01-2010 |
| 20100082404 | SYSTEM AND METHOD FOR UTILIZING DATE CONSTRAINTS IN AN ADVERTISEMENT SERVING SYSTEM - Generally, embodiments of the present invention provide for methods, systems and computer program products for utilizing date constraints in an advertisement serving system. The method according to one embodiment of the present invention comprises receiving a request for one or more advertisements that satisfy one or more constraints. A set of advertisement contracts is generated, wherein the set of advertisement contracts comprise one or more advertisement contracts that satisfy the one or more constraints. The contractual time period for a given advertisement contract in the set of advertisement contracts is then determined. A subset of advertisement contracts is then generated, wherein the subset of advertisement contracts comprises the advertisement contracts in the set of advertisement contracts that are active on a given date. The subset of advertisement contracts is then inputted into an optimization algorithm and one or more advertisement contracts are selected by the optimization algorithm. | 04-01-2010 |
| 20100082412 | SYSTEM AND METHOD FOR OPTIMIZING AN ADVERTISEMENT PLAN FOR ALLOCATING ADVERTISEMENTS TO A CONTRACT IN A NETWORK-BASED ENVIRONMENT - The present invention is directed to a system and method for optimizing an advertisement plan for allocating advertisements to a contract in a network-based environment. The system and method includes determining a shadow price for an advertisement placement where the advertisement placement is associated with a user having defined characteristics. The system and method includes determining a contract price for the advertisement placement relative to a plurality of advertisement contracts for the user having the defined characteristics. The system and method includes determining an advertisement plan for allocating an advertisement to a given contract on the basis of the shadow price and the contract price. The system and method includes presenting a given advertisement associated with the given contract according to the advertisement plan on network-based output. | 04-01-2010 |
| 20100082424 | OFFLINE OPTIMIZATION OF ONLINE PROCESSES - Subject matter disclosed herein relates to a system for managing online resources, and in particular, to a system using an offline process to optimize the management of such online resources. | 04-01-2010 |
| 20100082428 | DISPLAY ADVERTISING INVENTORY ESTIMATION - Example embodiments described herein may relate to estimating inventory for a display advertising system utilized, for example, in Web-based advertising. | 04-01-2010 |
| 20100094881 | SYSTEM AND METHOD FOR INDEXING SUB-SPACES - The present invention is directed to systems and methods for identifying compatible advertisement contracts to satisfy an advertisement opportunity. The systems and methods include receiving a number of attribute values associated with a user accessing a network-based location. The systems and methods include sorting an index of lists for a plurality of advertisement contracts on the basis of a number of contract term values. The systems and methods include traversing the index of lists to return a set advertisement contracts compatible with the number of attribute values associated with the user. The systems and methods include selecting a given advertisement contract from the set of advertisement contracts compatible with the number of attribute values associated with the user. The systems and methods include presenting an advertisement associated with the given advertisement contract on a display viewable by the user accessing the network-based location. | 04-15-2010 |
| 20100106604 | Multi-Stage Bidding System for Guaranteed Advertising Contracts in a Network of Networks - This patent discloses a system to host a multi-stage competition for an online advertisement opportunity in a network of networks. The online advertisement opportunity may be received in a second network from a first network as a result of a process where a first bid from a first software agent representing a guaranteed contract may be compared with a second bid from a second software agent representing one of a nonguaranteed contract and a guaranteed contract. A third bid for the online advertisement opportunity may be received in the second network from a third software agent representing a guaranteed contract. In addition, a fourth bid for that same online advertisement opportunity may be received in the second network from a fourth software agent representing one of a nonguaranteed contract and a guaranteed contract. | 04-29-2010 |
| 20100106613 | Bidding System for Guaranteed Advertising Contracts in an Online Spot Market - This patent discloses a system to host a competition for an online advertisement opportunity. Notice of the online advertisement opportunity may be sent to software agents, one of which may represent a guaranteed contract. On receipt of the notice, the software agents may prepare and submit bids. An ad server may receive bids, including a first bid from a first software agent representing a guaranteed contract and a second bid from a second software agent representing a nonguaranteed contract. The ad server may screen out bids and arbitrate the remaining bids to determine a highest bidder for the online advertisement opportunity. | 04-29-2010 |
| 20100114689 | SYSTEM FOR DISPLAY ADVERTISING OPTIMIZATION USING CLICK OR CONVERSION PERFORMANCE - An advertisement impression distribution system includes a data processing system operable to generate an allocation plan for serving advertisement impressions. The allocation plan allocates a first portion of advertisement impressions to satisfy guaranteed demand and a second portion of advertisement impressions to satisfy non-guaranteed demand. The data processing system includes an optimizer, the optimizer to establish a relationship between the first portion of advertisement impressions and the second portion of advertisement impressions. The relationship defines a range of possible proportions of allocation of the first portion of advertisement impressions and the second portion of advertisement impressions. The optimizer generates a solution in accordance with maximizing guaranteed demand fairness, non-guaranteed demand revenue and click or conversion value, where the solution identifies a determined proportion of the first portion of advertisement impressions to serve and a determined proportion of the second portion of advertisement impressions to serve. The data processing system outputs the allocation plan including the solution to control serving of the advertisement impressions in the determined proportions. | 05-06-2010 |
| 20100185485 | ALLOCATION OF INTERNET ADVERTISING INVENTORY - A method and system for allocating inventory in an Internet environment is provided. A method employed by the system may include generating samples of representatives that represent impression inventory, where each sample represents a number of users to which impressions are deliverable. An order may be received. The order may include a number of impressions to book and target audience information. A cushion of impressions needed to guarantee delivery of the number of impressions ordered may be determined. The number of impressions ordered plus the cushion may be allocated from the samples. A contract including the target audience information, the number of impressions, and the cushion may be stored to a database. | 07-22-2010 |
| 20100262607 | System and Method for Automatic Matching of Contracts to Impression Opportunities Using Complex Predicates and an Inverted Index - 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. The disclosure includes cases were the predicates are presented in conjoint forms and in disjoint forms, and techniques are provided to consider indexing and matching in cases of IN predicates and well as NOT-IN predicates. | 10-14-2010 |
| 20100318413 | ALLOCATION OF INTERNET ADVERTISING INVENTORY - 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. | 12-16-2010 |
| 20100318432 | ALLOCATION OF INTERNET ADVERTISING INVENTORY - 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. | 12-16-2010 |
| 20110015999 | SYSTEM AND METHOD FOR UTILIZING A LATTICE STORAGE STRUCTURE IN AN ADVERTISEMENT SERVING SYSTEM - 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. | 01-20-2011 |
