Google Inc.

Srdjan Petrovic

Gautham K Thambidorai

Sanjay Ghemawat

Advay Mengle

Shreyas Doshi

Ivan Posva

Matthew Rosencrantz

Tarun Kumar Jain

Shivakumar Venkataraman

David Lloyd Jones

William Sands Robinson

Arnar Mar Hrafnkelsson

Alan Wayne Blount

Asim Shankar

Priyendra Deshwal

Gautham Thambidorai

A system for providing advertisements with search results in response to a search query comprises a front end and an advertisement server. The front end is configured: to receive a search query; to send a first search request to a search server and sending a first advertisement request to an advertisement server, wherein the first search request includes the search query or information based on the search query, and wherein the first advertisement request includes the search query or information based on the search query and an indication that an advertisement response is not to be provided; to receive search results from the search server; and to send at least some of the search results to the advertisement server in a second advertisement request, wherein the second advertisement request includes an indication that an advertisement response is to be provided. The advertisement server is configured: in response to receiving the first advertisement request, to search for advertisements related to the search query to produce plural advertisement results each with an associated score; in response to receiving the second advertisement request, to modify the score of at least one of the plural advertisement results; to rank the plural advertisement results according to their scores; to select one or more of the highest ranked plural advertisement results; and to send an advertisement response to the front end, the advertisement response including the selected one or more highest ranked plural advertisement results. The front end is configured to provide the search results with the selected one or more highest ranked plural advertisement results.

Handling search queries

A programming model provides a method for type inference in programming operations. Information defining one or more attributes of an operation is received, the information specifying a field including a field name and a field type identifier for each of the attributes. Constraints for the operation are determined at least based on the attributes, wherein the constraints restrict at least one of a type of input for the operation or a type of output for the operation. Information defining an input for the operation is received, and it is determined, based on the constraints and the received information defining the input, the type of output for the operation. The type of output is associated with an output for the operation.

System of type inference for tuple graph programs

Methods, systems, and apparatus include computer programs encoded on a computer-readable storage medium, including a method for providing content. A query is received. Search results are identified that are responsive to the query. A content item is identified for presentation along with the search results. It is determined, based on one or more criteria, when the content item is to be augmented. When it is determined that the content item is to be augmented and after identifying the search results, the content item is augmented based at least in part on an entry in the search result. An augmented content item is created. The augmented content item is provided.

Augmenting a content item using search results content

A programming model provides a method for executing a program in a distributed architecture. One or more first shards of the distributed architecture execute one or more operations, and sending tuples to at least one second shard, the tuples being part of a stream and being based on the one or more operations. The one or more first shards send a token value to the at least one second shard when the sending of the tuples in the stream is complete. The at least one second shard determines whether a total of the token values matches a number of the one or more first shards, and takes a first action in response to determining that the total of the token values matches the number of the one or more first shards. The first action may include marking the stream as being complete and/or generating a message indicating that the stream is complete.

Method of executing a tuple graph program across a network

System of type inference for tuple graph programs method of executing a tuple graph program across a network

A programming model generates a graph for a program, the graph including a plurality of nodes and edges, wherein each node of the graph represents an operation and edges between the nodes represent streams of data input to and output from the operations represented by the nodes. The model determines where in a distributed architecture to execute the operations represented by the nodes. Such determining may include determining which nodes have location restrictions, assigning locations to each node having a location restriction based on the restriction, and partitioning the graph into a plurality of subgraphs, the partitioning including assigning locations to nodes without location restrictions in accordance with a first set of constraints, wherein each node within a particular subgraph is assigned to the same location. Each of the subgraphs is executed at its assigned location in a respective single thread.

Method for intra-subgraph optimization in tuple graph programs

Methods, systems, and apparatus include computer programs encoded on a computer-readable storage medium for selecting content. A method includes: receiving an initial request for content that is to be presented along with search results responsive to a search request; identifying one or more eligible content items from the candidate content items that satisfy the initial request; receiving information describing the search results; re-processing the initial request using the information including one or more of adding other eligible content items, removing one or more previously eligible content items, adjusting a quality score or a bid associated with one or more eligible content items, or re-ranking the eligible content items; conducting an auction based on ranked eligible content items; and selecting one or more content items from among the eligible content items based on the results of the auction and transmitting the selected one or more content items.

Adjusting content selection based on search results

This specification describes technologies relating to fixed width encoding/decoding of document posting lists. In general, one aspect of the subject matter described in this specification can be embodied in apparatuses that include a server obtaining a list of one or more of document identification numbers, each of the document identification numbers uniquely identifying a document; an encoding device operatively connected to the server, the encoding device generating a sequence of deltas from the sequential list of one or more of the document identification numbers, and encoding each delta in the sequence of deltas using a fixed-width encoding scheme.

Growing community of inventors

Palo Alto, CA, United States of America

Srdjan Petrovic