International Business Machines Corporation

Hangzhou Zhongee Bio-sci & Tech. Co., Ltd.

Hangzhou Zhongce Bio-sci&tech. Co., Ltd.

Qi Cheng

Calisto Paul Zuzarte

John Frederick Hornibrook

Mir Hamid Pirahesh

Wenbin Ma

Yan Zhao

Lei Sun

Ting Yu Leung

Yang Sun

Xin Wu

Jing Sun

Xianzhen Li

Daniel Costante Zilio

Tianyi Wang

Chuan Jie Zheng

Qining Li

Bing Zhai

Joseph Chow

Guoxian Liu

David C Sharpe

Ivan Popivanov

Michael Joshua Snowbell

Linqi Liu

Xiaoyan Qian

Haider Abbas Rizvi

Wing Yan Lau

Jose A Saborit

Michael Arthur Franciscus Stuy

A DNA polymerase, having an amino acid sequence represented by SEQ ID NO:2, or a derivative of the amino acid sequence by substitution, deletion, or addition of at least one amino acid residue. The DNA polymerase is a hybrid DNA polymerase prepared by inserting a thioredoxin binding domain (TBD) of bacteriophage T7 DNA polymerase into a DNA polymerase I (Sau) of. A method for preparing the DNA polymerase includes: 1) determining a corresponding position and a target substitution sequence in Sau protein for the TBD of the bacteriophage T7 DNA polymerase; 2) devising and synthesizing a primer according to a gene sequence of Sau and a sequence TBD published by GenBank; 3) cloning the Sau-TBD segment acquired in (2) to an expression vector pTrc99A to construct a recombinant vector pTrc99A-Sau-TBD; and 4) transformingby the recombinant vector pTrc99A-Sau-TBD and inducing protein expression.

DNA polymerase possessing continuous catalytic capacity and salt tolerance

Techniques are disclosed for generating statistical views in a database system. In one embodiment, a request is received to execute a database workload. One or more constraints pertaining to executing the database workload is retrieved. The database workload is evaluated to generate multiple statistical view candidates. The statistical view candidates are refined based on the one or more constraints. One or more statistical views are then generated based on the refined statistical view candidates.

Generating statistical views in a database system

A method, computer program product and computer system is provided. A processor receives a read request for a data entry from a client device, where the read request includes a first identifier. A processor retrieves a second identifier from a first storage device, where the second identifier is associated with the data entry as stored in the first storage device. Responsive to the first identifier and the second identifier not matching, a processor updates the data entry of the first storage device with a corresponding data entry from a second storage device.

Data consistency maintenance for sequential requests

A DNA polymerase, having an amino acid sequence represented by SEQ ID No. 2, or a derivative of the amino acid sequence by substitution, deletion, or addition of at least one amino acid residue. The DNA polymerase is a hybrid DNA polymerase prepared by inserting a thioredoxin binding domain (TBD) of bacteriophage T7 DNA polymerase into a DNA polymerase I (Sau) of. A method for preparing the DNA polymerase includes: 1) determining a corresponding position and a target substitution sequence in Sau protein for the TBD of the bacteriophage T7 DNA polymerase; 2) devising and synthesizing a primer according to a gene sequence of Sau and a sequence TBD published by GenBank; 3) cloning the Sau-TBD segment acquired in (2) to an expression vector pTrc99A to construct a recombinant vector pTrc99A-Sau-TBD; and 4) transformingby the recombinant vector pTrc99A-Sau-TBD and inducing protein expression.

Methods and apparatus, including computer program products, implementing and using techniques for executing a query in a computer to retrieve data from a relational database stored on a data storage device. A query is received that contains a CASE expression having one or more subqueries. A query execution plan is generated. The query execution plan uses a parameterized union all operator to keep the semantics of the CASE expression, and a nested loop join operator to drive data across the section of the query execution plan that executes the CASE expression without performing any join operations. The generated query execution plan is executed in the computer to retrieve data from the relational database.

Executing CASE expressions containing subqueries

A system for use with an information retrieval system, in which system is used for transforming a database statement containing a first subquery and a second subquery joined together, the first subquery including a group by operation over a child subquery, the information retrieval system comprising means for removing the first subquery from the database statement thereby eliminating the join between the first subquery and the second subquery.

System for aggregation subquery join elimination

A set of algebraic rules applicable to a query are identified, wherein each of the algebraic rules represents a relationship between two columns in a relational database table. A source column is identified by searching the query for a source predicate, wherein the source predicate is a range predicate. One or more candidate target columns are identified by searching the set of algebraic rules, wherein each of the candidate target columns occurs on one side of a binding expression and the source column occurs on the other side of the binding expression. For each of the one or more candidate target columns, a bounds subquery that provides a lower bound and an upper bound for a new range predicate is derived and he new range predicate is introduced into the query, wherein the query is executed to retrieve data from one or more data stores.

Method, system, and program for query optimization with algebraic rules

A system and method are provided for updating database statistics for use in generating query execution plans. A first query for a database is received, for example by a compiler, and the compiler accesses statistics associated with the first query for optimizing a query execution plan for the first query. The statistics may be accessed from a first cache. If the statistics retrieved from the first cache are determined to be stale, the system obtains updated statistics and may store them in a temporary cache. The stale statistics in the first cache are marked as invalid. Existing queries using the first cache may continue to use the first cache, while new queries may be provided with updated statistics.

Optimized collection of just-in-time statistics for database query optimization

Methods for reducing the overhead of validating constraints in a database are provided. The method includes providing a target table, and providing a source table. The source table includes data to be loaded into the target table. The method further includes loading data into the target table from the source table including eliminating any logic to validate a constraint defined on the target table based on one or more pre-determined conditions.

Method for reducing overhead of validating constraints in a database

A method for use with an information retrieval system, in which the method is used for transforming a database statement containing a first subquery and a second subquery joined together, the first subquery including a group by operation over a child subquery, the method comprising removing the first subquery from the database statement thereby removing the join between the first subquery and the second subquery.

Method for aggregation subquery join elimination

A system and method transform queries with subqueries, using window aggregation. An optimizer in a relational database management system transforms queries to optimize their efficiency and speed. The method transforms queries that have a subquery, replacing the subquery with a window aggregation function. In the case of a correlated subquery, the window aggregation function is partitioned by a correlated column of a correlated table. All data in the main select clause, or outer block, of the query that was obtained through references to the correlated table is instead obtained through the new window aggregation subquery. By using window aggregation, the aggregation is performed at the same time as the selection of relevant data from the correlated table, thereby compiling all needed data in a single pass through the table or view. Reducing the number of times that tables or views are accessed reduces the computational demands of a query.

System and method for transforming queries using window aggregation

A query is matched to an outlier materialized query table that stores exception data. The query is searched for a source predicate. An outlier predicate in the outlier materialized query table that corresponds to the source predicate is searched for a target column that corresponds to a source column in the source predicate. A new range predicate is derived based on the target column and introduced into the query, wherein the query is executed to retrieve data from one or more data stores.

The present invention is directed to a method and system for deleting data in a database The method and system is configurable, extensible and adaptable to the changing structure of a database to provide a desired deletion. The method and system includes storing at least one criteria for specifying data to be deleted, accessing the at least one criteria, and identifying tables in a family of tables referencing data associated with the one criteria, wherein each table is associated with at least one delete rule. The method and system further includes performing a delete function on the data associated with the one criteria in the tables according to the at least one delete rule associated with each table.

Growing community of inventors

North York, Canada

Qi Cheng