International Business Machines Corporation

Gerald George Kiernan

Michael James Carey

Rakesh Agrawal

Walid Rjaibi

Jayavel Shanmugasundaram

Srini Bhagavan

Curt Lee Cotner

Timothy Jon Vincent

Philip L Boyer

Ramakrishnan Srikant

Yao-Ching Stephen Chen

Yirong Xu

Irene C Liu

Eugene Jon Shekita

Thomas Abel Beavin

Paul Miller Bird

Roberto Javier Bayardo

Ralf Rantzau

Claire Willey McFeely

Tyrone W A Grandison

Christos Faloutsos

Regina J Liu

Irene Ching-Hua Liu

Dengfeng Gao

Evimaria Terzi

Stephen Yao Ching Chen

Gregory R Stager

David J Kuang

Liyan Zhou

Christopher M Johnson

Scott Ian Logan

Xun Li

Joyce A Taylor

Tryg A Ager

Eric L Alton

Harley W Boughton

Srikant Ramakrishnan

Yuping Ding

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.

Similarity and ranking of databases based on database metadata

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.

Effective method to compress tabular data export files for data movement

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. Sorted rows for each group are merged with rows in the uncompressed file.

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.

Masking sensitive data of table columns retrieved from a database

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.

Query transformation for masking data within database objects

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.

Managing materialized query tables (MQTS) over fine-grained access control (FGAC) protected tables

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.

Auditing of curation information

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.

Constructing a comprehensive summary of an event sequence

A system, method, computer program product, and data management service that allows any comparison operation to be applied on encrypted data, without first decrypting the operands. The encryption scheme of the invention allows equality and range queries as well as the aggregation operations of MAX, MIN, and COUNT. The GROUPBY and ORDERBY operations can also be directly applied. Query results produced using the invention are sound and complete, the invention is robust against cryptanalysis, and its security strictly relies on the choice of a private key. Order-preserving encryption allows standard database indexes to be built over encrypted tables. The invention can easily be integrated with existing systems.

System and method for fast querying of encrypted databases

A system, method, and computer program product to automatically eliminate the distribution information available for reconstruction from a disguised dataset. The invention flattens input numerical values into a substantially uniformly distributed dataset, then maps the uniformly distributed dataset into equivalent data in a target distribution. The invention allows the incremental encryption of new values in an encrypted database while leaving existing encrypted values unchanged. The flattening comprises (1) partitioning, (2) mapping, and (3) saving auxiliary information about the data processing, which is encrypted and not updated. The partitioning is MDL based, and includes a growth phase for dividing a space into fine partitions and a prune phase for merging some partitions together.

System and method for order-preserving encryption for numeric data

An auditing framework for determining whether a database disclosure of information adhered to its data disclosure policies. Users formulate audit expressions to specify the (sensitive) data subject to disclosure review. An audit component accepts audit expressions and returns all queries (deemed 'suspicious') that accessed the specified data during their execution.

Auditing compliance with a hippocratic database

A method and system for enhancing security in a database by establishing a bit pattern using secret information, the pattern establishing a watermark that can be detected in a copy (authorized or not) of the database only by using the secret information.

System and method for digital watermarking of data repository

A query optimization technique that determines whether a query includes a self join that is transitively derived through table expressions having UNION operators. If so, the query is simplified to eliminate the table expressions and to reduce the query to an equivalent query over tables.

Growing community of inventors

San Jose, CA, United States of America

Gerald George Kiernan