Patent application number | Description | Published |
20090055365 | AUDITING OF CURATION INFORMATION - 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. | 02-26-2009 |
20100017359 | CONSTRUCTING A COMPREHENSIVE SUMMARY OF AN EVENT SEQUENCE - 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. | 01-21-2010 |
20120197919 | Masking Sensitive Data of Table Columns Retrieved From a Database - 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. | 08-02-2012 |
20120233148 | MANAGING MATERIALIZED QUERY TABLES (MQTS) OVER FINE-GRAINED ACCESS CONTROL (FGAC) PROTECTED TABLES - 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. | 09-13-2012 |
20130086088 | Query Transformation for Masking Data Within Database Objects - 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. | 04-04-2013 |
20150269154 | SIMILARITY AND RANKING OF DATABASES BASED ON DATABASE METADATA - 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. | 09-24-2015 |
20150269161 | SIMILARITY AND RANKING OF DATABASES BASED ON DATABASE METADATA - 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. | 09-24-2015 |
Patent application number | Description | Published |
20080243524 | System and Method for Automating Internal Controls - A computer-based system and method to enforce, monitor, and assess internal controls over financial reporting is provided. A bottom-up approach is used to model transaction-control workflows using logs of past transaction activity executions. Past workflows are reconstructed from these logs and reconstruction rules. The transaction-control workflows are compared with these reconstructed past workflows to determine whether transactions are compliant with the internal controls. | 10-02-2008 |
20080282096 | SYSTEM AND METHOD FOR ORDER-PRESERVING ENCRYPTION FOR NUMERIC DATA - 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. | 11-13-2008 |
20090327748 | SYSTEM AND METHOD FOR FAST QUERYING OF ENCRYPTED DATABASES - 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. | 12-31-2009 |