Abstract: A method of accessing objects with fine-grained access control (FGAC) in a relational database management system (RDBMS) storing a segmented column-major database. For each object with access restrictions, an artificial neural network (ANN), is trained by generating an equally distributed segment map of segmented data entries, so that the map reproduces the row disposition in the unsegmented object. When a user access request is received, these ANNs are referred to determine if any of the objects to be accessed are subject to access restrictions. If that is the case, then the ANN creates a pseudo-view construct of its associated object which is limited to data entries that the user has permission to access. The pseudo-views are then injected into the user access request to embed the fine-grained access controls for subsequent processing of the request, which can then proceed without further regard to user-specific access restrictions.

Abstract: A computer-implemented method, system and computer program product for optimally performing stress testing against big data management systems. A set of random test queries is generated and compiled to determine the data points of the features (e.g., table type being queried) of the set of random test queries. A distance (e.g., Mahalanobis distance) is then measured between the data points of the features and the mean of a distribution of data points corresponding to each same feature of an extracted feature set. Each random test query whose distance exceeds a threshold distance is then ranked. The ranked random test queries are then executed in order of rank. Those executed random test queries which resulted in an error (e.g., system failure) are added to a log, which is used to identify those queries to perform a stress test against the big data management system.

Abstract: Concepts for processing a SQL statement comprising a ROLAP sort operation are presented. One such concept comprises: determining whether a ROLAP partitioning column of the SQL statement does not refer to database columns from a sort operation of the SQL statement; and determining whether the ROLAP partitioning columns of the SQL statement are all referenced in the output of the SQL statement. Responsive to determining a ROLAP partitioning column of the SQL statement does not refer to database columns from a sort operation of the SQL statement, and to determining all of the ROLAP partitioning columns of the SQL statement are referenced in the output of the SQL statement, the SQL statement is modified by removing the ROLAP sort operation from the SQL statement.

Abstract: Embodiments of the present invention provide systems and methods for associating rule mining in data comprising first and second variables, by generating a first and second filtering bitmap. The first filtering bitmap represents a set of values for the second variable for each of a plurality of values of the first variable. The second filtering bitmap represents, associations between frequent values of the second variable, which enables the identification of frequent 2-pattern itemsets. Thus, by performing first logical operations on the frequent 2-pattern itemsets, frequent high order-pattern itemsets may be identified. A max pattern itemset may be identified among the frequent high order-pattern itemsets. As a result, embodiments may mitigate performance and stability problems associated with conventional association rule mining approaches.

Abstract: A computer-implemented method, system and computer program product for optimally performing stress testing against big data management systems. A set of random test queries is generated and compiled to determine the data points of the features (e.g., table type being queried) of the set of random test queries. A distance (e.g., Mahalanobis distance) is then measured between the data points of the features and the mean of a distribution of data points corresponding to each same feature of an extracted feature set. Each random test query whose distance exceeds a threshold distance is then ranked. The ranked random test queries are then executed in order of rank. Those executed random test queries which resulted in an error (e.g., system failure) are added to a log, which is used to identify those queries to perform a stress test against the big data management system.

Abstract: Embodiments of the present invention provide systems and methods for associating rule mining in data comprising first and second variables, by generating a first and second filtering bitmap. The first filtering bitmap represents a set of values for the second variable for each of a plurality of values of the first variable. The second filtering bitmap represents, associations between frequent values of the second variable, which enables the identification of frequent 2-pattern itemsets. Thus, by performing first logical operations on the frequent 2-pattern itemsets, frequent high order-pattern itemsets may be identified. A max pattern itemset may be identified among the frequent high order-pattern itemsets. As a result, embodiments may mitigate performance and stability problems associated with conventional association rule mining approaches.

Abstract: A computer-implemented method, system and computer program product for optimally performing stress testing against big data management systems. A set of random test queries is generated and compiled to determine the data points of the features (e.g., table type being queried) of the set of random test queries. A distance (e.g., Mahalanobis distance) is then measured between the data points of the features and the mean of a distribution of data points corresponding to each same feature of an extracted feature set. Each random test query whose distance exceeds a threshold distance is then ranked. The ranked random test queries are then executed in order of rank. Those executed random test queries which resulted in an error (e.g., system failure) are added to a log, which is used to identify those queries to perform a stress test against the big data management system.

Abstract: Embodiments of the present invention provide systems and methods for associating rule mining. By way of example, embodiments obviate or mitigate performance and stability problems associated with conventional association rule mining approaches, by proposing concepts implementing association rule mining using rolling filtering bitmaps over dynamic data.

Abstract: Embodiments of the present invention provide systems and methods for associating rule mining. By way of example, embodiments obviate or mitigate performance and stability problems associated with conventional association rule mining approaches, by proposing concepts implementing association rule mining using rolling filtering bitmaps over dynamic data.

Abstract: A method of accessing objects with fine-grained access control (FGAC) in a relational database management system (RDBMS) storing a segmented column-major database. For each object with access restrictions, an artificial neural network (ANN), is trained by generating an equally distributed segment map of segmented data entries, so that the map reproduces the row disposition in the unsegmented object. When a user access request is received, these ANNs are referred to determine if any of the objects to be accessed are subject to access restrictions. If that is the case, then the ANN creates a pseudo-view construct of its associated object which is limited to data entries that the user has permission to access. The pseudo-views are then injected into the user access request to embed the fine-grained access controls for subsequent processing of the request, which can then proceed without further regard to user-specific access restrictions.

Abstract: A database query can be performed on a database with data redundancy nullification. A probabilistic data structure filter, such as a Bloom filter, can be created from each query statement, where the filter specifies consultation to data in tables of the database at the row and column level. The filter can be applied to remove data from the tables that are redundant to the query statement, thereby generating a filtered subset of the table data.

Abstract: Concepts for processing a SQL statement comprising a ROLAP sort operation are presented. One such concept comprises: determining whether a ROLAP partitioning column of the SQL statement does not refer to database columns from a sort operation of the SQL statement; and determining whether the ROLAP partitioning columns of the SQL statement are all referenced in the output of the SQL statement. Responsive to determining a ROLAP partitioning column of the SQL statement does not refer to database columns from a sort operation of the SQL statement, and to determining all of the ROLAP partitioning columns of the SQL statement are referenced in the output of the SQL statement, the SQL statement is modified by removing the ROLAP sort operation from the SQL statement.