International Business Machines Corporation

Andrzej W Laskawiec

Marcin Luczynski

Michal Bodziony

Marcin Filip

Tomasz Zatorski

Monika Piatek

Lukasz Stanislaw Studzienny

Tomasz P Kania

Jaroslaw Jurowicz

Ewa Kilar

Jacek Dolega

Krzysztof Porowski

Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: running an application on one or more computing node, the application providing user access to a database; receiving by the application registration data from a user for registering the user into a service; in response to the receiving the registration data from the user, generating a user schema that defines access rights of the user to the database, wherein the generated user schema includes a set of shared data structure objects instantiated in a storage system associated to the application, and a set of private data structure objects.

Dynamic schema based multitenancy

A computer-implemented method for unambiguously identifying entities in a database system may be provided. The method comprises storing data items as records with different attributes in a table of a database, storing naming rules for selected combinations of the attributes of the data items, and prioritizing the naming rules. The method also comprises determining a hash value for each of the selected combinations of the attributes of the data items, and identifying duplicate data items using the determined hash values and the prioritized naming rules.

Multi-value primary keys for plurality of unique identifiers of entities

A method, computer system, and a computer program product for ensuring integrity of records in a NoSQL database including a first table and a second table is provided. The present invention may include the first table having first records representing respective first entities and the second table having second records representing respective second entities. The present invention may include using a hash table associating each second entity of the second table with the respective hash or summary hash values of first records for reading the second records of the second table.

Ensuring integrity of records in a not only structured query language database

Managing ETL (extract-transform-load) operation execution by receiving an updated ETL (extract-transform-load) job flow, determining affected stages of a current ETL job flow, sending a message to stop data flow for all stages of the current ETL job flow, sending a switch message along the current ETL job flow through the affected stages, receiving notice of receipt of the switch message downstream from the affected stages of the current ETL job flow, moving an affected stage of the current ETL job flow from a first ETL section to a second ETL section; and resuming data flow according to the updated ETL job flow.

Managing extract-transform-load operations

Aspects of the present invention disclose a method for ordering rows of a table based on access statistics. The method includes one or more processors adding a respective tracking mechanism to the attribute of each respective instance of the set of rows of the table of the database. The method further includes adding a tracking mechanism to the respective instances of the set of rows. The method further includes gathering access data of the respective tracking mechanism of the attribute of each respective instance of the set of rows. The method further includes determining each respective instance of an attribute value that corresponds to the access data of the respective tracking mechanism of each respective instance of the set of rows. The method further includes ordering each respective instance of the set of rows of the table based at least in part on the respective instances of the attribute values.

Indexing data in a table based on data usage statistics

A method of masking data includes disabling, by one or more processors of a computer system, operation of a data structure that includes at least one data index. The method includes masking, by the one or more processors of the computer system, the data structure in a table with an isomorphic function, and enabling, by the one or more processors of the computer system, operation of the data structure.

Data masking with isomorphic functions

A method, computer program product, and a system where a processor(s) intercepts a query from a client targeting a database. The processor(s) analyzes the query to determine contextual data relevant to the query and determines, based on a data masking policy, if a portion of results responsive to the intercepted query should be provided to the client as masked data. When the processor(s) determines that the portion of the results should be provided to the client as masked data, the processor(s) determines computing resources managing data comprising the results responsive to the intercepted query. The processor(s) executes the query on the computing resources by obtaining the masked data via coprocessors deployed on the computing resources, where the coprocessors mask the portion of the results. The processor(s) returns query results comprising the portion of the results masked by the coprocessors, to the client.

Push down policy enforcement

An approach is provided for encrypting data. Using an encryption function, values of keys in a first database table are encrypted. The encryption function is determined to be homomorphic to sorting operators. A decryption function that decrypts the encrypted keys is determined to be homomorphic to sorting operators. Responsive to the encryption and decryption functions being determined to be homomorphic, a merge join operation is selected. The merge join operation operates on the first database table and a second database table and includes the decryption function in a joining condition. Using the merge join operation, an execution of a query is optimized. The query accesses one or more data items in the first or second database table.

Enable merge join on encrypted data

Embodiments of the present invention provide automated systems and methods for selectively finding and deleting dormant data (out of data, inactive data) in a configuration management database (CMDB), or in a database which has similar characteristics. The method includes using a directed graph where each node of the directed graph represents a configuration item, and traversing the directed graph in order to determine inactive or dormant data, and all of the objects which depend on that data. Configuration items are deleted only when all of the other configuration items from which it depends contain dormant data.

Deleting configuration items in a configuration management database

Methods and systems for moving a dataset from a relational database to a non-relational database are disclosed. A method includes: copying, by a computing device, source datafiles from a relational database to each of a plurality of region servers associated with a non-relational database; generating, by the computing device, at least one table in the non-relational database from the copied source datafiles; and accessing, by the computing device, the at least one table in the non-relational database by reading raw data stored in a relational database format from the copied source datafiles on one of the plurality of region servers associated with the non-relational database.

Non-relational database coprocessor for reading raw data files copied from relational databases

A computer-implemented method includes: receiving, by a computer device, a database query of a database from a database client; determining, by the computer device and based on the database query, a to-be-masked portion of data; sending, by the computer device, the database query to a federated database system for the to-be-masked portion of the data; receiving, by the computer device and in response to the sending, masked resultant data from the federated database system; and forwarding, by the computer device, the masked resultant data to the database client. The to-be-masked portion of the data is masked in at least one view of the database residing on the federated database system.

Redirecting query to view masked data via federation table

Optimization of job execution includes generating a hash tree for an initial dataset, executing a data processing job against the initial dataset, the job including a set of calculations against data of the records of the initial dataset, generating, based on a modification to the initial dataset to produce a modified dataset, a hash tree for the modified dataset, comparing the hash tree for the initial dataset to the hash tree for the modified dataset, and identifying one or more blocks of the modified dataset that are updated compared to the initial dataset, and re-executing the job against the modified dataset. The re-executing performs only those calculations that use data of the records of the one or more blocks that are updated compared to the initial dataset, and does not perform other calculations that do not use data of the records of the one or more blocks.

Optimization of data processing job execution using hash trees

Discovering and identifying resource dependencies. Resources are discovered and managed as configuration items, wherein selected configuration items are each assigned a Uniform Resource Identifier (URI) object. The assigned URI-objects are included in configuration data structures. The configuration data structures are stored in a configuration management system. A resource accessor address and an access point address are assigned. Further, an access resolve entry object is provided that provides a function for address translations, wherein the access resolve entry object includes at least a part of the resource accessor address and at least a part of the access point address, each of them in the URI-object form.

Discovering and identifying resource dependencies

Creating for a resource a representation including properties of the resource. Determining and analyzing defined naming rules for a configuration database, each naming rule including a naming rule identification, a priority and at least one attribute having an attribute name. For each naming rule applicable to the resource, extracting at least one attribute value for each attribute name from the resource representation. For each naming rule applicable to the resource, creating a complex identity object containing a naming rule identification and a list of attribute names and attribute values. For each created complex identity object, set an authority flag if a given provider is able to obtain a complete set of values for the attributes. Processing through each complex identity object according to priority of the corresponding naming rule. Generating an alias for each result of a Cartesian product of each attribute value of the list of attribute names.

Growing community of inventors

Kraków, Poland

Andrzej W Laskawiec