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 |
20090260016 | SYSTEM AND/OR METHOD FOR BULK LOADING OF RECORDS INTO AN ORDERED DISTRIBUTED DATABASE - 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. | 10-15-2009 |
Patent application number | Description | Published |
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 |
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 |
20100106556 | TIME-WEIGHTED AND SCALING OPTIMIZATION OF ALLOCATION OF ONLINE ADVERTISEMENT INVENTORY - A method for scaling advertisement inventory allocation includes constructing a flow network of nodes having impressions connected to contracts through corresponding arcs such as to satisfy demand requests of the contracts; (a) for each of the contracts: determining a probability distribution over the nodes eligible to supply forecasted impressions to the contract; drawing a plurality of sample nodes from the probability distribution to form a multiset, O, of nodes; (b) for each of the nodes within O: determining a subset of the contracts, H, that can be satisfied by receiving forecasted impressions from the node; weighting a number of forecasted impressions of the node, as a function of the subset of contracts in H, with the probability distribution of the node; and optimally allocating forecasted impressions from each multiset, O, of sample nodes to each corresponding contract during the time period by solving the flow network with a minimum-cost network flow algorithm. | 04-29-2010 |
20140188899 | Modifying Structured Search Queries on Online Social Networks - In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving a structured query that includes references to selected nodes and edges, and generating one or more query modification for the structured query, where each query modification includes references to modified nodes or modified edges from the plurality of nodes and edges. | 07-03-2014 |
20140188935 | Natural-Language Rendering of Structured Search Queries - In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving an unstructured text query, identifying nodes and edges that correspond to portions of the text query, accessing a context-free grammar model, identifying query tokens from the grammar model that correspond to the identified nodes and edges, selecting grammars having query tokens that corresponding to each of the identified nodes and edges, and generating structured queries based on the selected grammars, where the structure queries are based on strings generated by the grammars. | 07-03-2014 |