Google Inc.

Microsoft Technology Licensing, LLC

Reuven Lax

Rajas Moonka

Poorva Arankalle

Manish P Gupta

Lin Liao

Jill A Huchital

Brienne M Finger

Craig D Chambers

Pavan Edara

Daniel Mills

Robert Bradshaw

Gurpreet Singh Nanda

Tyler Arthur Akidau

Frances J Perry

Yi Yang

Ben Chambers

Brian Thomas Berkowitz

Ran Kalach

Catharine Van Ingen

Paul Adrian Oltean

Chao Cai

Matthew Harold Austern

Manuel Alfred Fahndrich

Ji L Yang

Vyacheslav Alekseyevich Chernyak

Shamim Samadi

Mark Brian Shields

Samuel Green McVeety

Ahmet Altay

Rafael De Jesús Fernández Moctezuma

Andrei Maksimenka

Harris Samuel Nover

Mikhail Shmulyan

Samuel Carl Whittle

Cosmin Ionel Arad

Jeffrey Paul Gardner

A method for processing data exactly once using transactional stream writes includes receiving, from a client, a batch of data blocks for storage on memory hardware in communication with the data processing hardware. The batch of data blocks is associated with a corresponding sequence number and represents a number of rows of a table stored on the memory hardware. The method also includes partitioning the batch of data blocks into a plurality of sub-batches of data blocks. For each sub-batch of data blocks, the method further includes assigning the sub-batch of data blocks to a buffered stream; writing, using the assigned buffered stream, the sub-batch of data blocks to the memory hardware; updating a storage log with an intent to commit the sub-batch of data blocks using the assigned buffered stream; and committing the sub-batch of data blocks to the memory hardware.

Scalable exactly-once data processing using transactional streaming writes

Techniques for presenting a content item with a media item are described. The techniques include receiving user input indicating a placement preference for a content item to be presented with a media item. The placement preference indicates a presentation preference of the content item relative to presentation of the media item. The placement preference is used to influence selection of a media item with which the content item is to be presented.

Device functionality-based content selection

A method includes receiving data corresponding one of streaming data or batch data and a content of the received data for computation. The method also includes determining an event time of the data for slicing the data, determining a processing time to output results of the received data, and emitting at least a portion of the results of the received data based on the processing time and the event time.

Data flow windowing and triggering

A job that receives as input a data stream is executed. For the job, it is iteratively determined a backlog growth over a first period of time; a backlog volume; and whether to adjust a quantity of processing resources. For each iteration for which the quantity of processing resources allocated to the job are determined to be adjusted, adjusting the quantity of processing resources allocated to the job. For each iteration for which the quantity of processing resources allocated to the job are determined not to be adjusted, maintaining the quantity of processing resources allocated to the job.

Resource allocation for computer processing

Methods, systems, and apparatus are described for performing streaming graph computations in a distributed processing system. In one aspect, a method includes receiving, during a first superstep, streaming graph input that comprises continuous input of first graph updates for updating the state of an existing graph, the existing graph comprising a plurality of vertices and edges, and each first graph update specifying a vertex and a message; scheduling, during the first superstep, the first graph updates for processing during a second superstep; providing, during the first superstep, the first graph updates as input to a graph computation for the existing graph; determining that the graph computation has completed processing for the first superstep, and in response: initiating the second superstep; and processing, during the second superstep, each first graph update; and providing, during the second superstep, graph output based at least in part on the first graph updates.

Streaming graph computations in a distributed processing system

Targeting in-video advertising

A dynamic URLs construction system includes a publisher server and one content accessor server. The publisher server has a content URL access module, a content access module and a content database for storing media content and providing content URL accessing instructions and media content to a content accessor server. Media content provided by a publisher is accessed using dynamic URLs. A content accessor server includes at least one dynamic URL generation module and one content retrieval module. The content accessor server receives a content ID and a template URL containing instruction for constructing the corresponding dynamic URL from the publisher server. The dynamic URL generation module parses the template URL instructions, obtains an access key associated with the dynamic URL and constructs the dynamic URL using the access key and the content ID. The content retrieval module retrieves the content referenced by the dynamic URL.

Dynamic universal resource locator (URL) construction for accessing media content

Methods, systems, and apparatus, including computer program products, for selecting advertisements. A request for sponsored content for presentation with a content item in a document is received. One or more candidate sponsored content items are identified based on one or more criteria. The criteria includes information related to the content item independent of the document, and information related to the document. One or more of the candidate sponsored content items are selected. The selected sponsored content items are transmitted for presentation with the content item.

Selection of advertisements for placement with content

Growing community of inventors

Seattle, WA, United States of America

Reuven Lax