International Business Machines Corporation

James Willis Pickel

Curt Lee Cotner

Jeffrey William Josten

Margaret Ann Dong

Brian Keith Howell

Tammie Dang

Paul Miller Bird

Shivram Ganduri

Hugh J Smith

Pallavi Priyadarshini

Parameswara R Tatini

William Robert Bireley

Claire Willey McFeely

Georgia Carroll Fuller

Mamta Sharma

Gayathiri R Chandran

Donna N Dillenberger

Julie Ann Watts

Yao-Ching Stephen Chen

Walid Rjaibi

Jay A Yothers

Yao Ching Stephen Chen

Xiaohong Fu

Shengxi Suo

Margaret Ann Bernal

Yumi Kimura Tsuji

Michael C Cox

Adrian B Lobo

Michelle D Lam

Frankie K Sun

Hui-An Lee

Nina Bronnikova

Sarbinder S Kallar

Sameep Mehta

Hong Min

Fen-Ling Lin

Akshar Kaul

Manish Kesarwani

David Joseph Wisneski

Gagandeep Singh

Christopher John Crone

Johannes Schuetzner

Karelle Lynne Cornwell

Wolfgang Reichert

Richard A Crus

Margaret Zagelow

Charles H Lin

Chunfeng Pei

Fung Lee

Ding-Wei Chieh

Koichi Yamaguchi

Michael R Springgay

Baoqiu Cui

Joe Cheng-yu Huang

Liyan Zhou

Hsuiying Yen Cheng

Jennifer W Ou

Marion B Farber

A database-management system provides sargable evaluation for query predicates that compare an 'LHS' encrypted database-column operand to an 'RHS' expression operand. The system directly compares the two operands if all their attributes match. If the operands are encrypted string-type values differing only in length, the system truncates the RHS or pads it with encrypted blanks and, if a truncation loses meaningful data, evaluates the predicate as never satisfying an equality condition. In all other cases, if all attributes of a plaintext RHS don't match those of the plaintext data encoded into the LHS column, the system attempts to cast the RHS to match the plaintext LHS data. An error condition or data loss at this step allows the system to sargably evaluate the predicate without further analysis, but if the casting is successful and error-free, the system encrypts the resulting RHS and performs a sargable predicate evaluation.

Sargable evaluation of queries submitted to an encrypted database

One embodiment provides a method, including: receiving, from a user, a dataset for encryption before its storage at a data storage location, wherein the dataset comprises a plurality of portions; identifying (i) attributes of the dataset and (ii) dataset dependencies; generating a recommendation for an encryption scheme to be used for the dataset, wherein the generating comprises (i) generating, based upon the attributes and the dataset dependencies, a recommendation of an encryption scheme for each portion of the dataset and (ii) identifying, based upon the dataset dependencies, a key label for each portion of the dataset, wherein the key label identified for a portion of the dataset that is dependent on another portion of the dataset is the same as the key label identified for said another portion of the dataset; and providing, to the user, (i) the generated recommendation and (ii) a description identifying reasons for the generated recommendation.

Encryption scheme recommendation

Sargable query-predicate evaluation for encrypted databases

A business application may provide a secure ledger update while maintaining anonymity and security from unauthorized third parties. One example may include receiving a new entry transaction to save data in a database/ledger. The example may also include receiving a request to add a record stored in a database with a new entry, adding the record by inserting the new entry, and enabling the new entry to be unchangeable from subsequent modification attempts based on an immutable attribute.

Database management system shared ledger support

As disclosed herein a method, executed by a computer, for enabling multi-tiered software stack diagnostic collection includes initiating, on a first tier of a multi-tiered software stack, a targeted diagnostics collection corresponding to a symptom of a failure, determining a symptom to a reason code mapping corresponding to the symptom in a product of a subsequent tier, and issuing a command to the product of the subsequent tier to initiate targeted diagnostics collection corresponding to the reason code. Problems or failures in a multi-tiered software stack environment may require analyses of programs or products corresponding to each tier of a multi-tiered software stack. The method described herein enables simultaneous collection of diagnostics for programs or products corresponding to each tier of a multi-tiered software stack. A computer system, and a computer program product corresponding to the method are also disclosed herein.

Targeted multi-tiered software stack serviceability

Continuously blocking query result data for a remote query is provided. Included is: creating a first connection, using a communications network, between a database server and a client. At least one secondary connection is created, using the communications network, between the database server and the client, based on the database server supporting a continuous block fetch protocol. Using the at least one secondary connection, the database server receives at least one cursor-based fetch query. The database server generates continuous blocks of result data, based on the received at least one cursor-based fetch query and sends to the client, using the at least one secondary connection, the continuous blocks of result data.

Continuously blocking query result data for a remote query

Operating a parallel database server system, where the database server system comprises at least two database servers and one data source. A client identifier is received from a client requesting services from one of said database servers. Information associated with said client is retrieved. The client is allocated to one of said database servers based on the retrieved information.

Method and system for minimizing synchronization efforts of parallel database systems

Techniques are provided for processing data. Connections having different security properties are stored, wherein each of the connections allows applications at the client computer to access data sources at a server computer. A request is received from an application to access a data source, wherein the request has associated security properties. In response to the client computer requesting establishment of a connection on behalf of the application, it is determined whether there is a stored connection that used a same set of security properties as are associated with the request from the application and that connected to the data source that the application requests access to. In response to determining that there is a stored connection that used the same set of security properties and that connected to the data source, the connection and an associated client encryption seed, client encryption token, server encryption seed, and server encryption token are re-used. In response to determining that there is not a connection that used the same set of security properties and that connected to the data source, a new client connection key, client encryption seed, client encryption token, sever connection key, server encryption seed, and server encryption token are generated.

Encryption of security-sensitive data by re-using a connection

In a system for avoiding section collision for application server requests over a single database connection, the database server assigns query identifiers to each instance of the same cursor opened for the same processing level within an application, allowing multiple instances of the same cursor to be processed in parallel without section collision. The application server assigns a command source identifier to each statement sent over a single database connection to uniquely identify the application source of the statement. This applies for multiples of the same statement sent by different application sources within the same application, for a single statement containing multiple application sources, and for multiple statements from different applications multiplexed over a single database connection. These statements can be processed separately from and in parallel with the each other without section collision.

Computer-readable medium to multiplex multiple application server requests over a single database connection

A method and system for providing package resolution in a database system is disclosed. The method and system comprise providing a statement within a server which allows an application to identify a list of package collections. The method and system further includes executing the statement to obtain the appropriate package. A system and method in accordance with the present invention provides a new current package path value, which is set via a statement referred to as Set Current Package Path. The SET CURRENT PACKAGE PATH statement allows the application to supply a precedence list of qualified package collections during execution time, therefore the scheme for resolving packages can be changed at any point during execution. The SET CURRENT PACKAGE PATH statement improves application development by making the package resolution mechanism less error prone and less tedious for the application developer, while providing an optimal-performance solution in the client-server environment.

Package resolution mechanism for database systems

A shared memory device called the Coupling Facility (CF) is used to record the indoubt transaction entries for each member of the database cluster, avoiding the CPU cost and elapsed time impact of persisting this information to disk (either via a log write or a relational table I/O). The CF provides full read/write access and data coherency for concurrent access by all the members in the database cluster. At any given point in time, the CF will contain the full list of indoubt transactions for the entire database cluster. CF duplexing is used to guarantee the integrity of the CF structure used for the indoubt list. In the event of complete loss of both CF structures (which will not happen except in major disaster situations), data sharing group restart processing can reconstruct the CF structures from the individual member logs.

High performance support for XA protocols in a clustered shared database

Growing community of inventors

Gilroy, CA, United States of America

James Willis Pickel