Google Inc.

Julian Hyde

Jonathan Swenson

Colin Zima

Lloyd Tabb

Michael Toy

Jamie Davidson

Steven Talbot

Wil Gieseler

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

A method, system and computer program product for join graph generation based upon a log of previously executed database queries includes method for generating a join graph for relational database queries. The method includes loading into memory of a computer, a log of a set of database queries previously executed against data in a database and sequentially parsing each of the queries in the log to identify different semantically characterizable components of each of the queries. The method further includes generating a join graph for each of the queries from corresponding ones of the components. Finally, the method includes selectively adding each of the generated join graphs to a set of join graphs in a data model for the data in the database.

Retroreflective join graph generation for relational database queries

A method, system and computer program product for clustered join graph generation based upon a log of previously executed database queries includes loading into memory of a computer, a log of a set of database queries previously executed against data in a database of the database management system, sequentially parsing each of the queries in the log to identify different semantically characterizable components of each of the queries, generating a join graph for each of the queries from corresponding ones of the components, clustering different generated join graphs according to semantic commonalities so as to form different clusters of join graphs, each for a different semantic commonality, combining the generated join graphs for each cluster into a combined join graph for the corresponding cluster and adding each of the combined join graphs to a set of join graphs in a data model for the data in the database.

Retroreflective clustered join graph generation for relational database queries

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

Berkeley, CA, United States of America

Julian Hyde