Google Inc.

Colin Zima

Julian Hyde

Lloyd Tabb

Jamie Davidson

Steven Talbot

Jonathan Swenson

Michael Toy

Wil Gieseler

Conrad Slimmer

Ben Porterfield

Implementations of the disclosure provide for anticipatory pre-execution of queries. In an implementation of the disclosure, a method for anticipatory pre-execution of queries includes the computation of an execution cost of each of a multiplicity of different queries to a data source scheduled at a specified time on a specified date. The method also includes monitoring a querying processing schedule and detecting from the monitoring, unscheduled time on a particular date prior to the specified time on the specified date. Finally, the method includes responding to the detection by first selecting a most expensive one of the different queries in terms of execution cost, for instance an amount of computing resources consumed in executing a corresponding one of the different queries, and then executing the selected most expensive one of the different queries during the unscheduled time on the particular date prior to the specified time on the specified date.

Anticipatory pre-execution of data queries

Embodiments of the present disclosure provide a method, system and computer program product for single view presentation of multiple query. In an embodiment of the disclosure, a method for single view presentation of multiple query includes directing a query against a database along a selected dimension of multiple different elements. In response, a primary result set is received. The result set is then organized into a tabular view of cells according to the selected dimension and values for the selected dimension. Thereafter, a set of nested queries may be directed for each of the elements in the selected dimension against the result set utilizing a different dimension. In response to each directed set of nested queries, a corresponding result set is thus received. Finally, each corresponding result set is inserted into a cell associated with a common one of the elements.

Single view presentation of multiple queries in a data visualization application

A method for the automatic generation of a data model from an SQL statement includes receiving a single SQL statement in a user interface to a data analytics application, parsing the single SQL statement and extracting from the SQL statement different table references. The method also includes, for each one of the table references, directing a selection of all fields available in a corresponding table and storing the available fields in a collection of fields implicated by each table referenced by the table references. Finally, the method includes generating a data model with the fields in the collection of fields and displaying a view of the data model in a user interface of the data analytics application.

Automatic generation of a data model from a structured query language (SQL) statement

Data content governance for presentation layer synchronization for a version controlled underlying data model includes defining a data model for underlying data in a database, specifying a presentation layer for the defined data model and identifying selected elements of the data model necessary to meet data requirements of the specified presentation layer. Then, the identified selected elements of the data model are serialized and both the specified presentation layer and the serialized elements are versioned in respect to the specified presentation layer. Thereafter, when the data model becomes modified, the specified presentation layer is modified to accommodate the modified data model. In response to the modification, a different selection of elements of the data model necessary to meet data requirements of the modified presentation layer are re-identified and serialized, with the modified presentation layer and the serialized re-identified different selection of elements becoming re-versioned.

Data content governance for presentation layer synchronization for a version controlled underlying data model

Embodiments of the invention provide for anticipatory pre-execution of queries. In an embodiment of the invention, a method for anticipatory pre-execution of queries includes the computation of an execution cost of each of a multiplicity of different queries to a data source scheduled at a specified time on a specified date. The method also includes monitoring a querying processing schedule and detecting from the monitoring, unscheduled time on a particular date prior to the specified time on the specified date. Finally, the method includes responding to the detection by first selecting a most expensive one of the different queries in terms of execution cost, for instance an amount of computing resources consumed in executing a corresponding one of the different queries, and then executing the selected most expensive one of the different queries during the unscheduled time on the particular date prior to the specified time on the specified date.

Embodiments of the present invention provide a method, system and computer program product for single view presentation of multiple query. In an embodiment of the invention, a method for single view presentation of multiple query includes directing a query against a database along a selected dimension of multiple different elements. In response, a primary result set is received. The result set is then organized into a tabular view of cells according to the selected dimension and values for the selected dimension. Thereafter, a set of nested queries may be directed for each of the elements in the selected dimension against the result set utilizing a different dimension. In response to each directed set of nested queries, a corresponding result set is thus received. Finally, each corresponding result set is inserted into a cell associated with a common one of the elements.

Growing community of inventors

San Francisco, CA, United States of America

Colin Zima