Abstract: 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.

Abstract: A method of computing a join pattern agnostic aggregate function includes loading source code and parsing the source code to identify different database query operations. In response to the identification of an aggregate function in one of the different database query operations in which records in multiple tables are joined together in a table join, a multiplicity of primary keys are retrieved, each corresponding to a different one of the multiple tables and also an object of one of the tables referenced by the identified aggregate function. An existence of a fan out condition associated with the table join is then computed. On condition that an existence of the fan out condition is not computed a non-fan out sensitive implementation of the aggregate function is invoked with respect to the object. But, otherwise, a different, fan-out sensitive implementation of the aggregate function is invoked with respect to the object.

Abstract: A method for pre-utilizing tables before refresh includes selecting a query for execution in a data analytics application and identifying a table specified by the query, for instance a materialized table. Another operation includes computing an encoding, such as a hash value, for at least one portion of the identified table. Another operation includes comparing the computed encoding to a pre-stored encoding for the at least one portion of the identified table. On the condition that the computed encoding is identical to the pre-stored encoding, the operations include utilizing the identified table in executing the query in lieu of re-materializing the identified table. Otherwise, on the condition that the computed encoding differs from the pre-stored encoding, the operations include re-materializing the identified table before returning the results of the query.

Abstract: 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.

Abstract: A method, system and computer program product for workflow style governance includes creating a document and specifying a document style of the document -- either a linear workflow style or a branched workflow style. Thereafter, in response to a subsequent request to load the document, the specified document style for the document may be retrieved and, on condition that the specified document style is a linear workflow style, a specified version of the document is retrieved into a document editor for editing as a new version of the document. But otherwise, on condition that the specified document style is a branched workflow style, different components of the document are retrieved as a composition of components, each of an independent version, and a selected one of the components of the composition of the components making up the document is then loaded into a component editor for editing as a new version.

Abstract: A method, system and computer program product for workflow style governance includes creating a document and specifying a document style of the document—either a linear workflow style or a branched workflow style. Thereafter, in response to a subsequent request to load the document, the specified document style for the document may be retrieved and, on condition that the specified document style is a linear workflow style, a specified version of the document is retrieved into a document editor for editing as a new version of the document. But otherwise, on condition that the specified document style is a branched workflow style, different components of the document are retrieved as a composition of components, each of an independent version, and a selected one of the components of the composition of the components making up the document is then loaded into a component editor for editing as a new version.

Abstract: A method for pre-utilizing tables before refresh includes selecting a query for execution in a data analytics application and identifying a table specified by the query, for instance a materialized table. Another operation includes computing an encoding, such as a hash value, for at least one portion of the identified table. Another operation includes comparing the computed encoding to a pre-stored encoding for the at least one portion of the identified table. On the condition that the computed encoding is identical to the pre-stored encoding, the operations include utilizing the identified table in executing the query in lieu of re-materializing the identified table. Otherwise, on the condition that the computed encoding differs from the pre-stored encoding, the operations include re-materializing the identified table before returning the results of the query.

Abstract: A method for pre-utilizing tables before refresh includes selecting a query for execution in a data analytics application and identifying a table specified by the query, for instance a materialized table. Another operation includes computing an encoding, such as a hash value, for at least one portion of the identified table. Another operation includes comparing the computed encoding to a pre-stored encoding for the at least one portion of the identified table. On the condition that the computed encoding is identical to the pre-stored encoding, the operations include utilizing the identified table in executing the query in lieu of re-materializing the identified table. Otherwise, on the condition that the computed encoding differs from the pre-stored encoding, the operations include re-materializing the identified table before returning the results of the query.

Abstract: A method for the lightweight extension of a data model includes first loading into memory, an extension document referencing a model document in a data analytics system. The model document defines a data model and the extension document extends the data model with at least one modification to the data model. The method then includes extracting from the extension document, the modification to the data model. Finally, the method includes creating in the memory the data model from the model document combined with the modification so as to produce an extension to the data model without processing a redeclaration of a view of the data model in the extension document.

Abstract: A method for pre-utilizing tables before refresh includes selecting a query for execution in a data analytics application and identifying a table specified by the query, for instance a materialized table. Another operation includes computing an encoding, such as a hash value, for at least one portion of the identified table. Another operation includes comparing the computed encoding to a pre-stored encoding for the at least one portion of the identified table. On the condition that the computed encoding is identical to the pre-stored encoding, the operations include utilizing the identified table in executing the query in lieu of re-materializing the identified table. Otherwise, on the condition that the computed encoding differs from the pre-stored encoding, the operations include re-materializing the identified table before returning the results of the query.

Abstract: A method for determining overlap between search terms in distinct elements in data collected from a number of sources. The method involves receiving a first search term, accessing a first hyperloglog sketch of the first search term and a second hyperloglog sketch of a second search term, and determining a degree of overlap between the first search term and the second search term based on the first hyperloglog sketch of the first search term and a second hyperloglog sketch of a second search term. Respective hyperloglog sketches of additional search terms can be accessed, and respective degrees of overlap between the first search term and the additional search terms can be determined. Respective correlation values can be assigned based on the respective degrees of overlap. Search results can be organized according to the respective correlation values in order to prioritize search terms having higher correlation values.

Abstract: A method for determining overlap between search terms in distinct elements in data collected from a number of sources. The method involves receiving a first search term, accessing a first hyperloglog sketch of the first search term and a second hyperloglog sketch of a second search term, and determining a degree of overlap between the first search term and the second search term based on the first hyperloglog sketch of the first search term and a second hyperloglog sketch of a second search term. Respective hyperloglog sketches of additional search terms can be accessed, and respective degrees of overlap between the first search term and the additional search terms can be determined. Respective correlation values can be assigned based on the respective degrees of overlap. Search results can be organized according to the respective correlation values in order to prioritize search terms having higher correlation values.

Abstract: 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.

Abstract: 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.

Abstract: A method of computing a join pattern agnostic aggregate function includes loading source code and parsing the source code to identify different database query operations. In response to the identification of an aggregate function in one of the different database query operations in which records in multiple tables are joined together in a table join, a multiplicity of primary keys are retrieved, each corresponding to a different one of the multiple tables and also an object of one of the tables referenced by the identified aggregate function. An existence of a fan out condition associated with the table join is then computed. On condition that an existence of the fan out condition is not computed a non-fan out sensitive implementation of the aggregate function is invoked with respect to the object. But, otherwise, a different, fan-out sensitive implementation of the aggregate function is invoked with respect to the object.

Abstract: A method, system and computer program product for workflow style governance includes creating a document and specifying a document style of the document—either a linear workflow style or a branched workflow style. Thereafter, in response to a subsequent request to load the document, the specified document style for the document may be retrieved and, on condition that the specified document style is a linear workflow style, a specified version of the document is retrieved into a document editor for editing as a new version of the document. But otherwise, on condition that the specified document style is a branched workflow style, different components of the document are retrieved as a composition of components, each of an independent version, and a selected one of the components of the composition of the components making up the document is then loaded into a component editor for editing as a new version.

Abstract: A method of computing a join pattern agnostic aggregate function includes loading source code and parsing the source code to identify different database query operations. In response to the identification of an aggregate function in one of the different database query operations in which records in multiple tables are joined together in a table join, a multiplicity of primary keys are retrieved, each corresponding to a different one of the multiple tables and also an object of one of the tables referenced by the identified aggregate function. An existence of a fan out condition associated with the table join is then computed. On condition that an existence of the fan out condition is not computed a non-fan out sensitive implementation of the aggregate function is invoked with respect to the object. But, otherwise, a different, fan-out sensitive implementation of the aggregate function is invoked with respect to the object.

Abstract: 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.

Abstract: 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.

Abstract: A method of computing a join pattern agnostic aggregate function includes loading source code and parsing the source code to identify different database query operations. In response to the identification of an aggregate function in one of the different database query operations in which records in multiple tables are joined together in a table join, a multiplicity of primary keys are retrieved, each corresponding to a different one of the multiple tables and also an object of one of the tables referenced by the identified aggregate function. An existence of a fan out condition associated with the table join is then computed. On condition that an existence of the fan out condition is not computed a non-fan out sensitive implementation of the aggregate function is invoked with respect to the object. But, otherwise, a different, fan-out sensitive implementation of the aggregate function is invoked with respect to the object.