International Business Machines Corporation

Tomasz Kazalski

Artur M Gruszecki

Konrad K Skibski

Lukasz Gaza

Tomasz Stradomski

Michal Bodziony

Tomasz Sekman

Grzegorz S Milka

Andrzej Jan Wrobel

Bartlomiej Tomasz Malecki

Andreas Brodt

Marek Grochowski

Rafal Korczyk

Natalya A Yanayt

Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: examining an invoked database query for execution on a database; scanning zone data from at least one data node of the database in dependence on the examining, the at least one data node of the database having a storage system and storing in the storage system table data of a table, wherein security tags are associated to respective rows of the table, and wherein the zone data specifies attributes of storage of the table within respective storage system extents of the storage system; identifying, using the zone data, at least one excludible extent of the storage system extents; and excluding the at least one excludible extent from an IO data access operation in processing of the invoked database query.

Database query processing

Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: identifying an invoked database query for execution on a database, the invoked database query being associated to a user; generating an execution plan for executing the database query on the database; wherein the generating the execution plan for execution of the database query on the database includes establishing an ordering of first and second tables, the ordering of the first and second tables being in dependence on an access privilege attribute of the user in respect to the first table; and executing the database query according to the execution plan.

Row secure table plan generation

The present disclosure relates to a method comprising incorporating a utilization level field for a set of materialized views of database system in a database catalog of the database system. A computer process may be generated to run during a defined time period on a spare host of the database system. The computer process is configured to monitor utilization of the set of materialized views and to collect data of utilized materialized views in a dedicated registry. A check if each materialized view of the set of materialized views is present in the registry may be periodically be performed. The utilization level of a materialized view may be adapted based on its collected data in the registry. A check in catalog utilization levels of the set of materialized views may periodically be performed and based on the utilization levels utilization of the set of materialized views may be adapted.

Materialized views assistant

The present disclosure relates to a method for extending kernel functionality of a kernel of a container-based virtualization system. The method comprises: providing in the container-based virtualization system a compiling container for compiling kernel modules against the kernel of the container-based virtualization system, and an application container for extending kernel functionality of the kernel using a kernel module. The application container may input the kernel module to the compiling container. The compiling container may compile the kernel module in the compiling container. The application container may receive from the compiling container the compiled kernel module. The application container may load the compiled kernel module to the kernel of the system for enabling the extension of the kernel functionality.

Container-based virtualization system extending kernel functionality using kernel modules compiled by a compiling container and loaded by an application container

In an approach for migrating database content with row-level security from a source database with row-level security to a target database without row-level security, a computer determines a type of the source database to be migrated, and upon determining that a source table of the source database is maintained using multi-level security attributes, creating a data structure for a source table of the source database for storing meta-data comprising the multi-level security attributes, determining all dimensions of the multi-level security attributes, adding columns to a target table of the target database relating to the source table, the added columns representing the multi-level security attributes of the source table.

Migrating a multi-level secured database

A method, system and computer program product for providing early diagnosis of hardware, software or configuration problems in a data warehouse system. A received query is parsed to determine the properties of the query. The query may then be joined to existing groups of queries if those groups have shared properties of the query. After executing the query according to an execution plan, results from the execution of the query is received, which may include problem(s) that occurred during execution of the query. For those problems that reach a pre-defined threshold of becoming a 'group problem' in those groups joined by the query, the problem is reported to the end user concerning those groups where the problem exceeds the pre-defined threshold. In this manner, an early diagnosis of the problems in the data warehouse system that can cause delay and failure of the processing of queries is able to occur.

Early diagnosis of hardware, software or configuration problems in data warehouse system utilizing grouping of queries based on query parameters

A computer-implemented method for joining two data tables on a join attribute, where the data tables have at least a first and a second attribute and the second attribute is the join attribute. The method provides a function for associating a computing node to a given record. The function may be used to determine the associated computing node. The records of the two data tables may be distributed to the respective determined computing nodes. The relationship between the values of the first and second attributes may be modelled using a predefined dataset. For each record of the two data tables the values of the first attribute may be re-determined using the corresponding values of the second attribute. The function may be used to re-determine the associated computing node.

Joining two data tables on a join attribute

The present disclosure relates to a method using a database engine for migrating data records from a source database to a target database, where said data records are arranged in a sorted source table of the source database in accordance with a clustered-base-table order following the Hilbert-Filling-Curve algorithm. The method comprises configuring the database engine for storing the CBT order of each data record of the source table in a reference table to said source table or a in a column of said source table. A reading step may be performed to read said data records from said source table, wherein in said reading step said stored CBT order is used. The read data and the stored CBT order may be transferred to the target database in accordance with the stored CBT order. The transferred data may be written at the target database in accordance with the CBT order.

Method for migrating data records from a source database to a target database

The present disclosure relates to a computer-implemented method, computer program product, and computer system, for optimization of query processing a set of data extents on which a table is stored. Attribute value information may be maintained for each data extent. The attribute value information indicate as ranges the minimum and maximum values of an attribute of the entries stored in the respective extent. A first metric of a first data extent of the set may determine splitting the first data extent into sub-extents increases query processing efficiency. A second metric of a second data extent and a third data extent may determine merging the second data extent and the third data extent increases query processing efficiency.

Efficient processing of data extents

The invention relates to a method, computer program product and computer system for providing attribute value information for a data extent having a set of data entries. The method includes: determining a reference string value of a data-extent-specific reference point based on symbol frequencies at each sequence position of attribute string values in a subset of the set of data entries; calculating a distance between each of the attribute string values in the subset and the reference string value of the data-extent-specific reference point resulting in a set of distances; determining for each of the attribute string values an attribute-string-value-specific minimum distance for any reference string value of the data-extent-specific reference point resulting in a set of attribute-string-value-specific minimum distances for the set of data entries; storing for the data extent the minimum distance and the maximum distance of the set of attribute-string-value-specific minimum distances as attribute value information.

Attribute value information for a data extent

The invention relates to a computer-implemented method for processing a query in a database, the query comprising a search value. The database comprises a plurality of datasets the datasets comprising entries, wherein distance statistics are assigned to the datasets. The distance statistics describe the minimum and maximum distance between the values of the entries of a dataset of the plurality of datasets and a reference value. The method comprises determining the distance between the search value and the reference value, said determination resulting in a search distance, determining a subset of datasets from the plurality of datasets for which the search distance is within the limits given by the minimum and maximum distances described by the respective distance statistics, and searching for the search value in the subset of datasets.

Method for processing a database query

The invention relates to a method, computer program product and computer system for providing attribute value information for a data extent comprising a set of data entries. For each multidimensional reference point of a set of one or more multidimensional reference points the method comprises: calculating for each multidimensional data entry a reference-point-specific distance between the respective multidimensional data entry and the multidimensional reference point resulting in a set of reference-point-specific distances for the data extent, the respective reference-point-specific distance being calculated using a combination of the attribute values of the multidimensional data entry and a combination of the reference attribute values of the respective multidimensional reference point; determining a minimum reference-point-specific distance and a maximum reference-point-specific distance of the set of reference-point-specific distances; storing for the data extent as attribute value information for further use with query processing the minimum reference-point-specific distance and maximum reference-point-specific distance.

Providing multidimensional attribute value information

The present disclosure relates to a method for recording user activity on a computer. The method includes creating a video file for a video sequence of a user interface of an application of the computer. Video frames may be recorded in the video file, wherein a video frame comprises data indicative of the visual representation of the user interface and corresponding timestamp, wherein the data of the video frame is parsable.

Recording user activity on a computer

The present disclosure relates to a computer-implemented method for joining two data tables on a join attribute. The data tables have at least a first and a second attribute. The second attribute is the join attribute. The method includes providing a function for associating a computing node to a given record. The function may be used to determine the associated computing node. The records of the two data tables may be distributed to the respective determined computing nodes. The relationship between the values of the first and second attributes may be modelled using a predefined dataset. For each record of the two data tables the values of the first attribute may be re-determined using the corresponding values of the second attribute. The function may be used to re-determine the associated computing node.

Growing community of inventors

Balice, Poland

Tomasz Kazalski