International Business Machines Corporation

Red Hat, Inc.

David Michael Eads

Benjamin Michael Parees

Jordan Thomas Liggitt

David Michael Enyeart

Gabriel Garcia Montero

Latha Sivakumar

Luis Eduardo Guillen-Sanchez

Dan McBryde Willey

Kevin Spencer Barker

Clayton Palmer Coleman

John William Alcorn

Joachim H Frank

Application permissions can be set in a cloud computing environment based on a user's authorization level in the cloud computing environment. For example, a system can determine that a user has a particular authorization level in a cloud computing environment. The system can determine that the user is to have particular permissions for a continuous integration tool by mapping the particular authorization level to the particular permissions. The system can then set a permission setting for the continuous integration tool to limit the user to the particular permissions.

Setting application permissions in a cloud computing environment

The present disclosure provides new methods and systems for managing access to service accounts by user accounts. For example, a user account and a service account may be created. The user account may be granted a first permission to access the service account. The first permission may provide a user with a capability to access the service account by at least one of accessing the service account through the user account and directly accessing the service account. A first credential may be issued to the service account. A user account status event regarding a change to the first permission may automatically be detected. It may be determined that the first permission provided access to the service account A second credential may be issued to the service account. The second credential may invalidate the first credential and may prevent the user from directly accessing the service account.

Management of service accounts

A method, system and computer program product for ensuring that archival data deleted in a source table is already stored in a target table. An external data source sets a flag in the first table to identify the row in the source table to be deleted. An application sets a flag in a second table for each row of the source table that is marked to be deleted according to the first table. The application performs uncommitted read operations on the source table for each row corresponding to the distinct primary key values stored in the first table. The application inserts the data read into the corresponding rows of the target table. The application deletes the rows in the source table indicated to be deleted by the second table. In this manner, the archival data deleted from the source table is ensured to already be stored in the target table.

Ensuring that the archival data deleted in relational source table is already stored in relational target table

A method, system and computer program product for performing synchronization between source and target tables. An external data source inserts a new row in a first table as it modifies or creates a row in the source table where each new row in the first table includes a primary key value associated with the modified/created row in the source table. An application copies the distinct values for the primary keys listed in the first table and inserts them in a second table. The application performs uncommitted read operations on the source table for each row corresponding to the primary key values stored in the second table. The application inserts the data read into the corresponding rows of the target table. In this manner, a platform agnostic application may be able to synchronize the relational source and target tables in an efficient manner while minimizing the contention at the source table.

Performing synchronization among relational database tables with minimal contention

A method, system and computer program product for achieving a balance between pre-filter efficiency and pre-filter throughput. Event subscriptions are obtained for a given event consumer. The event subscriptions define the events to be routed to this event consumer. Pre-filters of varying complexity and filtering power are constructed based on these event subscriptions. A balance between pre-filter efficiency and pre-filter throughput may be achieved by selecting the best pre-filter out of these constructed pre-filters to filter events to its associated event consumer. The best pre-filter is selected by comparing a complexity threshold (e.g., a limit for the number of atomic Boolean expressions in a pre-filter) with the actual complexity (e.g., the actual number of atomic Boolean expressions) for each constructed pre-filter and selecting the most complex pre-filter without exceeding the threshold.

Growing community of inventors

Raleigh, NC, United States of America

David Michael Eads