International Business Machines Corporation

Xiaohong Fu

Yao-Ching Stephen Chen

Maryela Evelin Weihrauch

James Willis Pickel

Jeffrey William Josten

Claire Willey McFeely

Yao Ching Stephen Chen

Shengxi Suo

Fung Lee

Nina Bronnikova

Sarbinder S Kallar

Knut Stolze

Ruiping Li

Tammie Dang

Bjoern Broll

Frank Chan

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

Sargable query-predicate evaluation for encrypted databases

In supporting temporal logical transactions, a database management system (DBMS) determines that a temporal logical transaction time (T) is set for a temporal logical transaction. The DBMS receives a change request for a current row in a current table. A history row for a history table corresponding to the current table is created. The values in the history row are set to the values in the current row, where a begin time in the history row has same value as a begin time in the current row, and an end time in the history row is set to T. When the begin time equals the end time in the history row, the DBMS does not store the history row in the history table. The values in the current row are changed according to the change request, and the begin time in the current row is set to T.

Temporal logical transactions

In an enforcement of temporal referential integrity in a database system, the database system receives a change request for one or more rows in a target table in the database system. The system determines that the target table has temporal referential constraints with a second table. The system compares a non-period child key value in child table row(s) with a non-period parent key value in parent table row(s) and compares a child business time period key value in the child table row(s) with a parent business time period key value in the parent table row(s). When the non-period child key value matches the non-period parent key value and when the child business time period key value is within the parent business time period key value, the system determines that the change request satisfies the temporal referential constraints. Otherwise, the system determines that the change request violates the temporal referential constraints.

Enforcing temporal referential integrity

An indication of data of a first table in a first database is received. The data includes one or more rows of data. The indicated data is transferred from the first table in the first database component to a backup table in the same database component. The data is transferred from the backup table to a second table in a second database component.

Row-based archiving in database accelerators

An approach for using multiple plans in a database management system to access current data and history data is provided. The approach provides a first access plan for a query, stores the first plan as a first section in an application package. The first access plan is capable of accessing the current data. The approach determines whether a bind option for the query is detected. In response to determining that the bind option is detected, the approach provides a second access plan for the query and stores the second access plan as a second section in the application package. The second access plan is capable of accessing the current data and the history data.

Method for using multiple plans to achieve temporal and archive transparency performance

Growing community of inventors

Milpitas, CA, United States of America

Xiaohong Fu