Microsoft Technology Licensing, LLC

Google Inc.

Dian Zhang

Omid Afnan

Pu Li

Yifung Lin

Zhaoji Chen

Kiat Chuan Tan

Na Gao

Benedict Junjie Liang

Ahmad Nizam Anuar

Sumeet Kale

Ching-Fei Yang

David Joseph Cummings

The present disclosure provides computer-implemented methods, systems, and devices for generating media content pages for live events at scale. A computing system accesses media data associated with a live event. The computing system customizes media data for one or more user groups. The computing system selects one or more page templates from a plurality of page templates based, at least in part on the customized media data. The computing system generates one or more content pages based on the customized media data and the one or more page templates. The computing system provides the one or more content pages to one or more user computing devices.

Systems and methods for generating stories for live events using a scalable pipeline

The visualization of progress of a distributed computational job at multiple points of execution. After a computational job is compiled into multiple vertices, and then those multiple vertices are scheduled on multiple processing nodes in a distributed environment, a processing gathering module gathers processing information regarding processing of multiple vertices of a computational job, and at multiple instances in time in the execution of the computational job. A user interface module graphically presents a representation of an execution structure representing multiple nodes of the computational job, and dependencies between the multiple nodes, where the nodes may be a single vertex or a group of vertices (such as a stage).

Progress visualization of computational job

A computerized mechanism to formulate a data flow representation from a syntax tree. The syntax tree may be, for instance, an abstract syntax tree (AST) that is formulated by compiling query script, such as big data query script. Each node in the syntax tree is composed of one or more tokens (script portions) that are taken from the query script, which relationships between the tokens being syntactically represented by links between those tokens. Accordingly, the data flow representation may also be a data flow representation of the original query script itself. In order to formulate the data flow representation from the syntax tree, the data types of the various inputs and outputs of the syntax tree nodes are identified and bound to a corresponding data flow. This may be performed whilst honoring dependencies between the nodes. The data flow may be visualized to an author or reviewer of the script.

Generation of data flow from syntax tree

The supporting of debugging of failed vertex code on a test machine. This debugging is made possible even though the vertex code failed while on a remote processing node, and is but one of multiple, and potentially innumerable vertices that run in a distributed environment. This represents a vast technical improvement over prior ad hoc methods for trying to debug a large distributed application, since time is not wasted on vertices that operated properly, but rather debugging is focused on the problem vertex. Even reproducing the failure is a huge technical step forward.

Debugging remote vertex code on test machine

Growing community of inventors

Beijing, China

Dian Zhang