Abstract: A computer-implemented method, system and computer program product for improving performance for retrieving and reporting information from a data warehouse. A query (e.g., SQL query) is received. If a materialized view is present, and if such a materialized view was generated within the designated time frame, then the query is translated to query a materialized view. The translated query is then sent to a first data storage database of the data warehouse storing materialized views to be processed to obtain the materialized object associated with the query. If, on the other hand, the materialized view is not present, or the materialized view is present but has not been generated within the designated time frame, then the query is sent to the second data storage database of the data warehouse storing the original data without any modification to retrieve and report the appropriate information from the second data storage database.

Abstract: A computer-implemented method, system and computer program product for improving performance for retrieving and reporting information from a data warehouse. A query (e.g., SQL query) is received. If a materialized view is present, and if such a materialized view was generated within the designated time frame, then the query is translated to query a materialized view. The translated query is then sent to a first data storage database of the data warehouse storing materialized views to be processed to obtain the materialized object associated with the query. If, on the other hand, the materialized view is not present, or the materialized view is present but has not been generated within the designated time frame, then the query is sent to the second data storage database of the data warehouse storing the original data without any modification to retrieve and report the appropriate information from the second data storage database.

Abstract: As disclosed herein a method, executed by a computer, for avoiding double counting in the presence of many-to-many relationships in database data includes receiving a report definition from a data management system, detecting a bridge table defining many-to-many relationships between at least two datasets, generating a query plan with layered sub-queries, and executing the query plan including the layered sub-queries to provide query results corresponding to the report definition. A query plan with layered sub-queries may include instructions to join, partition, normalize, group, and summarize tabular data. Additionally, a conditional selection operation may be used to detect and eliminate duplicated data from a field specified in the report definition. The resulting query plan may be executed as a single query language. A computer program product and an apparatus corresponding to the described method are also disclosed herein.

Abstract: As disclosed herein a method, executed by a computer, for avoiding double counting in the presence of many-to-many relationships in database data includes receiving a report definition from a data management system, detecting a bridge table defining many-to-many relationships between at least two datasets, generating a query plan with layered sub-queries, and executing the query plan including the layered sub-queries to provide query results corresponding to the report definition. A query plan with layered sub-queries may include instructions to join, partition, normalize, group, and summarize tabular data. Additionally, a conditional selection operation may be used to detect and eliminate duplicated data from a field specified in the report definition. The resulting query plan may be executed as a single query language. A computer program product and an apparatus corresponding to the described method are also disclosed herein.

Abstract: As disclosed herein a method, executed by a computer, for avoiding double counting in the presence of many-to-many relationships in database data includes receiving a report definition from a data management system, detecting a bridge table defining many-to-many relationships between at least two datasets, generating a query plan with layered sub-queries, and executing the query plan including the layered sub-queries to provide query results corresponding to the report definition. A query plan with layered sub-queries may include instructions to join, partition, normalize, group, and summarize tabular data. Additionally, a conditional selection operation may be used to detect and eliminate duplicated data from a field specified in the report definition. The resulting query plan may be executed as a single query language. A computer program product and an apparatus corresponding to the described method are also disclosed herein.

Abstract: As disclosed herein a method, executed by a computer, for avoiding double counting in the presence of many-to-many relationships in database data includes receiving a report definition from a data management system, detecting a bridge table defining many-to-many relationships between at least two datasets, generating a query plan with layered sub-queries, and executing the query plan including the layered sub-queries to provide query results corresponding to the report definition. A query plan with layered sub-queries may include instructions to join, partition, normalize, group, and summarize tabular data. Additionally, a conditional selection operation may be used to detect and eliminate duplicated data from a field specified in the report definition. The resulting query plan may be executed as a single query language. A computer program product and an apparatus corresponding to the described method are also disclosed herein.

Abstract: Provided are techniques for improving a test suite. A list of tests in a test suite is created, sorted in order of increasing run time, wherein multiple tests having a same run time are sorted in order of decreasing code block coverage. For each test on the list, it is determined whether the test covers one or more code blocks not already covered by at least one previously processed test. In response to determining that the test does cover one or more code blocks not already covered by the at least one previously processed test, the test is added to an optimized test suite. The optimized test suite is stored.

Abstract: A method, a system and a storage medium for preparing multilingual reports at client sites. The client sites are connected to a server and a data source. Each of the client sites may use a different locale. A product locale is selected at the client site for defining a user interface appearance. After a report specification is generated, a content locale is selected at the client site, which defines an appearance and a format of a report. A metadata model with run-time parameters is then constructed. The run-time parameters include mapping rules for the content locale. The run-time parameters are updated based on the content locale. A query is built using the report specification and the metadata model. Data appropriate to the individual content locale is then extracted from the same data source using the query.

Abstract: The invention provides an application programming mechanism and technique that makes referencing data look as if the data is dynamically allocated by the process. The invention also provides a mechanism whereby persisted data is shared across all processes on the same computer that access it. Small, process specific structures are created on demand as the program accesses the persisted data and makes use of the underlying memory mapping and linking technologies inherent in modern operation systems. The technique is especially useful in large data repositories where it simplifies the sharing of data between instances of an application, and also permits sharing of data between different applications. It allows for the data to be highly referenced internally while not requiring the extra memory used by pointer swizzling at runtime.

Abstract: The invention enhances business intelligence systems by allowing both report authors and consumers (users of reports) operating in their individual choice of interface language to have full access to content (data) in that language, or in any one of a number of languages. This functionality is provided by the inclusion of at least two locales. The invention provides for defining locale mappings, mapping a locale from an unsupported locale to supported locale, defaulting to a valid locale for users with incomplete or invalid locale specifications, and for specifying object names, descriptions, and tips in multiple languages.

Abstract: The invention provides a sophisticated application programming mechanism and technique that makes referencing data look as if the data is dynamically allocated by the process. The invention also provides a mechanism whereby all the persisted data is shared across all processes on the same computer that access it. In order to achieve these advantages, the invention creates small, process specific structures on demand as the program accesses the references from the persisted data and makes use of the underlying memory mapping and linking technologies inherent in modern Operation Systems. The technique is especially useful in large data warehouses, or planning data repositories, where it simplifies preparation for the sharing of non-volatile data between instances of an application, permitting sharing of data between different applications, and reducing the size of the data shared. It allows for the data to be highly referenced internally while not requiring the extra memory used by pointer swizzling at runtime.