Abstract: A processor selects a first database and a second database from a plurality of databases. The processor determines one or more terms found in the first and second database, wherein each term of the one or more terms includes metadata of a database of the plurality of databases. The processor identifies one or more common terms between the first database and the second database and determines the one or more common terms found in each of a plurality of groups of databases of the plurality of databases, wherein each group of databases corresponds to a number of databases which constitute the group of databases. The processor determines a similarity score between the first database and the second database of the plurality of databases based on the one or more common terms found in each group of databases of the plurality of databases.

Abstract: Compression of data for database movement, includes: selecting a first group of categorical columns for compression; selecting a next group of categorical columns from remaining columns for compression; repeating the selecting of the next group until a predetermined compression threshold is met; creating first compression files comprising compressed representations of the columns in the first group; creating next compression files comprising compressed representations of the columns in each of the next groups; storing initial row sort order, group identity, and column positions corresponding to each of the next groups; and storing any columns not selected for compression in an uncompressed file in the original row sort order. Decompression of the data includes: rebuilding categorical columns in each group of compression files using group identity and column positions corresponding to the group; and sorting rows comprising the rebuilt categorical columns to the initial row sort order.

Abstract: A processor selects a first database and a second database from a plurality of databases. The processor determines one or more terms found in the first and second database, wherein each term of the one or more terms includes metadata of a database of the plurality of databases. The processor identifies one or more common terms between the first database and the second database and determines the one or more common terms found in each of a plurality of groups of databases of the plurality of databases, wherein each group of databases corresponds to a number of databases which constitute the group of databases. The processor determines a similarity score between the first database and the second database of the plurality of databases based on the one or more common terms found in each group of databases of the plurality of databases.

Abstract: Compression of data for database movement, includes: selecting a first group of categorical columns for compression; selecting a next group of categorical columns from remaining columns for compression; repeating the selecting of the next group until a predetermined compression threshold is met; creating first compression files comprising compressed representations of the columns in the first group; creating next compression files comprising compressed representations of the columns in each of the next groups; storing initial row sort order, group identity, and column positions corresponding to each of the next groups; and storing any columns not selected for compression in an uncompressed file in the original row sort order. Decompression of the data includes: rebuilding categorical columns in each group of compression files using group identity and column positions corresponding to the group; and sorting rows comprising the rebuilt categorical columns to the initial row sort order.

Abstract: Compression of data for database movement, includes: selecting a first group of categorical columns for compression; selecting a next group of categorical columns from remaining columns for compression; repeating the selecting of the next group until a predetermined compression threshold is met; creating first compression files comprising compressed representations of the columns in the first group; creating next compression files comprising compressed representations of the columns in each of the next groups; storing initial row sort order, group identity, and column positions corresponding to each of the next groups; and storing any columns not selected for compression in an uncompressed file in the original row sort order. Decompression of the data includes: rebuilding categorical columns in each group of compression files using group identity and column positions corresponding to the group; and sorting rows comprising the rebuilt categorical columns to the initial row sort order.

Abstract: A processor selects a first database and a second database from a plurality of databases. The processor determines one or more terms found in the first and second database, wherein each term of the one or more terms includes metadata of a database of the plurality of databases. The processor identifies one or more common terms between the first database and the second database and determines the one or more common terms found in each of a plurality of groups of databases of the plurality of databases, wherein each group of databases corresponds to a number of databases which constitute the group of databases. The processor determines a similarity score between the first database and the second database of the plurality of databases based on the one or more common terms found in each group of databases of the plurality of databases.

Abstract: A processor selects a first database and a second database from a plurality of databases. The processor determines one or more terms found in the first and second database, wherein each term of the one or more terms includes metadata of a database of the plurality of databases. The processor identifies one or more common terms between the first database and the second database and determines the one or more common terms found in each of a plurality of groups of databases of the plurality of databases, wherein each group of databases corresponds to a number of databases which constitute the group of databases. The processor determines a similarity score between the first database and the second database of the plurality of databases based on the one or more common terms found in each group of databases of the plurality of databases.

Abstract: Access to a data element stored within a database object is controlled. A request is received from a user to perform an operation in relation to the database object, the operation including retrieval of information from the data element of the database object. Prior to retrieving information from the data element, a determination is made whether at least a portion of the information from the data element is subject to masking in accordance with an access policy. In response to determining that information from the data element is subject to masking, the request is modified to require that information from the data element be retrieved in a masked condition.

Abstract: Compression of data for database movement, includes: selecting a first group of categorical columns for compression; selecting a next group of categorical columns from remaining columns for compression; repeating the selecting of the next group until a predetermined compression threshold is met; creating first compression files comprising compressed representations of the columns in the first group; creating next compression files comprising compressed representations of the columns in each of the next groups; storing initial row sort order, group identity, and column positions corresponding to each of the next groups; and storing any columns not selected for compression in an uncompressed file in the original row sort order. Decompression of the data includes: rebuilding categorical columns in each group of compression files using group identity and column positions corresponding to the group; and sorting rows comprising the rebuilt categorical columns to the initial row sort order.

Abstract: According to one embodiment of the present invention, a system processes a database query, and comprises a computer system including at least one processor. The system identifies one or more expressions within the database query utilizing a database object with value masking. Masking requirements are determined for each identified expression and the database object utilized by that identified expression is replicated to provide masked and actual versions of that database object in response to the masking requirements for that expression including masked values and actual values of that database object. The value masking of the database object is applied to the identified expressions within the database query based on the determined masking requirements to produce search results with masked values for the database query. Embodiments of the present invention further include a method and computer program product for processing a database query in substantially the same manner described above.

Abstract: Provided are techniques for creating one or more fine-grained access control rules that are associated with a base table. A materialized query table is created from the base table without applying the one or more fine-grained access control rules associated with the base table when obtaining data from the base table. A fine-grained access control protection indicator is turned on for the materialized query table. In response to receiving a direct access request to the materialized query table in a query referencing the materialized query table, access is provided to the data in the materialized query table by applying one or more fine-grained access control rules associated directly with the materialized query table to the data in the materialized query table before returning the data.

Abstract: According to one embodiment of the present invention, a system processes a database query, and comprises a computer system including at least one processor. The system identifies one or more expressions within the database query utilizing a database object with value masking. Masking requirements are determined for each identified expression and the database object utilized by that identified expression is replicated to provide masked and actual versions of that database object in response to the masking requirements for that expression including masked values and actual values of that database object. The value masking of the database object is applied to the identified expressions within the database query based on the determined masking requirements to produce search results with masked values for the database query. Embodiments of the present invention further include a method and computer program product for processing a database query in substantially the same manner described above.

Abstract: An approach that tracks curation history of sensitive information is described. In one embodiment, there is a database that contains a plurality of sensitive information. The database comprises a plurality of base tables and backlog tables for each of the base tables. A curation audit query generator is configured to receive a curation audit expression that specifies sensitive information to be audited and generates a curation audit query from the curation audit expression to run against the database. The curation audit expression contains syntax clauses that specify a time period for the audit, stipulate a specific base table in the database as source of the audit and examine whom is responsible for making changes to the specified sensitive information.

Abstract: Provided are techniques for creating one or more fine-grained access control rules that are associated with a base table. A materialized query table is created from the base table without applying the one or more fine-grained access control rules associated with the base table when obtaining data from the base table. A fine-grained access control protection indicator is turned on for the materialized query table. In response to receiving a direct access request to the materialized query table in a query referencing the materialized query table, access is provided to the data in the materialized query table by applying one or more fine-grained access control rules associated directly with the materialized query table to the data in the materialized query table before returning the data.

Abstract: Access to a data element stored within a database object is controlled. A request is received from a user to perform an operation in relation to the database object, the operation including retrieval of information from the data element of the database object. Prior to retrieving information from the data element, a determination is made whether at least a portion of the information from the data element is subject to masking in accordance with an access policy. In response to determining that information from the data element is subject to masking, the request is modified to require that information from the data element be retrieved in a masked condition.

Abstract: The present invention provides a method and system for constructing one or more a comprehensive summaries of event sequence(s). The present invention approaches the problem of finding the shortest yet most comprehensive summary of an event sequence by transforming this summarization problem into a concrete optimization problem and provides a computer-implementing technique for solving this optimization problem to construct and/or form the basis for constructing the summaries. The summaries describe an entire event sequence while at the same time reveal local associations between events of that sequence. In certain embodiments, the segmentation of the event sequence produced in accordance with the present invention is itself a summary of the event sequence. In other embodiments, the segmentation produced forms a basis for one or more summaries.

Abstract: The present invention provides a method and system for constructing one or more a comprehensive summaries of event sequence(s). The present invention approaches the problem of finding the shortest yet most comprehensive summary of an event sequence by transforming this summarization problem into a concrete optimization problem and provides a computer-implementing technique for solving this optimization problem to construct and/or form the basis for constructing the summaries. The summaries describe an entire event sequence while at the same time reveal local associations between events of that sequence. In certain embodiments, the segmentation of the event sequence produced in accordance with the present invention is itself a summary of the event sequence. In other embodiments, the segmentation produced forms a basis for one or more summaries.

Abstract: An approach that tracks curation history of sensitive information is described. In one embodiment, there is a database that contains a plurality of sensitive information. The database comprises a plurality of base tables and backlog tables for each of the base tables. A curation audit query generator is configured to receive a curation audit expression that specifies sensitive information to be audited and generates a curation audit query from the curation audit expression to run against the database. The curation audit expression contains syntax clauses that specify a time period for the audit, stipulate a specific base table in the database as source of the audit and examine whom is responsible for making changes to the specified sensitive information.

Abstract: The system, method, and program of this invention enables an object language application to issue a query over a view and to receive back, as query results, handles to application type objects which can be further manipulated by the application. A view is defined herein as a collection of a view type, and a view type is defined as a class or type. Object language class definitions are created based upon the view type of the view referenced by the query. Upon receipt of the query referencing a view type, a query engine generates a query plan that builds mock application type objects in memory based upon the view types and having a form consistent with the class definition for a type of object returned as a result.

Abstract: The system, method, and program of this invention enables an object language application to issue a query over a view and to receive back, as query results, handles to application type objects which can be further manipulated by the application. A view is defined herein as a collection of a view type, and a view type is defined as a class or type. Object language class definitions are created based upon the view type of the view referenced by the query. Upon receipt of the query referencing a view type, a query engine generates a query plan that builds mock application type objects in memory based upon the view types and having a form consistent with the class definition for a type of object returned as a result.