Bingjie Miao

7343366, Mar 11, 2008

Mar 30, 2004

10/811988

Bingjie Miao - Tigard OR, US
Srinivasan R. Mottupalli - Beaverton OR, US

International Business Machines Corporation - Armonk NY

G06F 7/00

707 2, 707 3, 707 10

A method and system for accurately estimating a result size of a Group-By operation in a relational database. The estimate utilizes the probability of union of the columns involved in the operation, as well as the relative cardinality of each column with respect to the other columns in the operation. In addition, the estimate incorporates the use of table filters when indicated such that table filters are applied prior to determining the size of the tables in the operation, as well as including equivalent columns into the list of columns that are a part of the Group-By operation. Accordingly, the estimate of the result size of the operation includes influencing factors that provide an accurate estimation of system memory requirements.

7461050, Dec 2, 2008

Mar 30, 2006

11/278088

Vincent Corvinelli - Mississauga, CA
John Frederick Hornibrook - Markham, CA
Bingjie Miao - Tigard OR, US

International Business Machines Corporation - Armonk NY

G06F 17/30

707 2, 707 3

In accordance with aspects of the present invention, provided are methods for incrementally estimating the cardinality of a derived relation including statistically correlated partially applicable predicates for a range-partitioned table. During the generation of a QEP a cardinality estimate is calculated in which one or more partially applicable predicates is correlated to another partially applicable predicate and/or to one or more fully applicable predicates. The cardinality includes a number of rows expected to be returned by the QEP and is computed in an incremental fashion for each operator of the QEP.

7552137, Jun 23, 2009

Dec 22, 2004

11/020538

Kevin L. Beck - Portland OR, US
Paul M. Brett - Portland OR, US
Keith G. Billings - Portland OR, US
Bingjie Miao - Tigard OR, US

International Business Machines Corporation - Armonk NY

G06F 7/00
G06F 17/00

707102, 707 4

A choose tree is generated at compile time to facilitate a determination if any partition of a range partitioned database table includes a particular key at runtime. To generate the choose tree at compile time, a query compiler receives a source code indicative of each partition of the range partitioned database table, and generates the choose tree from the source code at compile time where the choose tree is representative of a pre-computed binary search of the range partitioned database table. Thereafter, the choose tree can be interpreted/executed at runtime to facilitate a traversal of the choose tree for determining if any partition of the range partitioned database table includes the particular key.

7917526, Mar 29, 2011

Dec 14, 2007

11/956855

Bingjie Miao - Tigard OR, US
Srinivasan R. Mottupalli - Beaverton OR, US

International Business Machines Corporation - Armonk NY

G06F 7/00
G06F 17/30

707765, 707802

A method and system for accurately estimating a result size of a Group-By operation in a relational database. The estimate utilizes the probability of union of the columns involved in the operation, as well as the relative cardinality of each column with respect to the other columns in the operation. In addition, the estimate incorporates the use of table filters when indicated such that table filters are applied prior to determining the size of the tables in the operation, as well as including equivalent columns into the list of columns that are a part of the Group-By operation. Accordingly, the estimate of the result size of the operation includes influencing factors that provide an accurate estimation of system memory requirements.

8126872, Feb 28, 2012

Oct 30, 2008

12/261075

Vincent Corvinelli - Mississauga, CA
John Frederick Hornibrook - Markham, CA
Bingjie Miao - Tigard OR, US

International Business Machines Corporation - Armonk NY

G06F 7/00

707718, 707705

In accordance with aspects of the present invention, provided are methods for incrementally estimating the cardinality of a derived relation including statistically correlated partially applicable predicates for a range-partitioned table. During the generation of a QEP a cardinality estimate is calculated in which one or more partially applicable predicates is correlated to another partially applicable predicate and/or to one or more fully applicable predicates. The cardinality includes a number of rows expected to be returned by the QEP and is computed in an incremental fashion for each operator of the QEP.

8290933, Oct 16, 2012

Sep 26, 2007

11/862058

Bingjie Miao - Tigard OR, US
Srinivasan R. Mottupalli - Beaverton OR, US

SAP AG - Walldorf

G06F 7/06
G06F 17/30

707714, 707715, 707718, 707802, 707765

A method and system for accurately estimating a result size of a Group-By operation in a relational database. The estimate utilizes the probability of union of the columns involved in the operation, as well as the relative cardinality of each column with respect to the other columns in the operation. In addition, the estimate incorporates the use of table filters when indicated such that table filters are applied prior to determining the size of the tables in the operation, as well as including equivalent columns into the list of columns that are a part of the Group-By operation. Accordingly, the estimate of the result size of the operation includes influencing factors that provide an accurate estimation of system memory requirements.

8630999, Jan 14, 2014

Jan 30, 2012

13/361455

Vincent Corvinelli - Mississauga, CA
John Frederick Hornibrook - Markham, CA
Bingjie Miao - Tigard OR, US

International Business Machines Corporation - Armonk NY

G06F 7/00

707718, 707705

In accordance with aspects of the present invention, provided are systems and computer program products for incrementally estimating the cardinality of a derived relation including statistically correlated partially applicable predicates for a range-partitioned table. During the generation of a QEP a cardinality estimate is calculated in which one or more partially applicable predicates is correlated to another partially applicable predicate and/or to one or more fully applicable predicates. The cardinality includes a number of rows expected to be returned by the QEP and is computed in an incremental fashion for each operator of the QEP.

20050065939, Mar 24, 2005

Sep 23, 2003

10/668441

Bingjie Miao - Tigard OR, US

International Business Machines Corporation - Armonk NY

G06F017/00

707100000

A method and system for optimizing a query in a snow flake schema () within a relational database. The schema () includes a fact table () and multiple dimension tables and a plurality of dimension levels, with at least one dimension table at each level. A logical node () comprised of a level one child dimension table () and all dimension tables () rooted at this level one child dimension table is created based upon the cumulative selectivity calculation for all of the dimension tables at each level of the database (). Creation of the logical node reduces a snow flake schema to a star schema, thereby mitigating search space traversal.