Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.

Abstract: A storage system graphical user interface (GUI) renders indication of a plurality of selected storage systems. Selection is received of selected storage systems from the rendered indication of selected storage systems and a determination is made of performance metrics common to the selected storage systems. A performance metric GUI enabling selection of the determined performance metrics common to the selected storage systems is generated. In response to user selection of at least one selected performance metric of the determined performance metrics in the performance metric GUI, determination is made of performance metric values for the at least one of the selected performance metrics for the selected storage systems. A computer renderable visualization providing a visual comparison for each of the at least one selected performance metric of the determined performance metric values is generated for the selected storage systems.

Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.

Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.

Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.

Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.

Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.

Abstract: A storage system graphical user interface (GUI) renders indication of a plurality of selected storage systems. Selection is received of selected storage systems from the rendered indication of selected storage systems and a determination is made of performance metrics common to the selected storage systems. A performance metric GUI enabling selection of the determined performance metrics common to the selected storage systems is generated. In response to user selection of at least one selected performance metric of the determined performance metrics in the performance metric GUI, determination is made of performance metric values for the at least one of the selected performance metrics for the selected storage systems. A computer renderable visualization providing a visual comparison for each of the at least one selected performance metric of the determined performance metric values is generated for the selected storage systems.

Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.

Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.

Abstract: The invention provides a method, system, and program product for dispatching an event to a rule. In one embodiment, the invention includes generating a table from a rule set, wherein the table includes an indication of whether each rule in the rule set corresponds to at least one event type; receiving an event; in the case that a plurality of rules in the rule set correspond to an event type of the event, dispatching the event to the plurality of rules; determining that the event should not be processed by at least one of the plurality of rules; and terminating the dispatching of the event.

Abstract: The invention provides a method, system, and program product for dispatching an event to a rule. In one embodiment, the invention includes generating a table from a rule set, wherein the table includes an indication of whether each rule in the rule set corresponds to at least one event type; receiving an event; in the case that a plurality of rules in the rule set correspond to an event type of the event, dispatching the event to the plurality of rules; determining that the event should not be processed by at least one of the plurality of rules; and terminating the dispatching of the event.