Michael G Carey

US Patent:

6421658, Jul 16, 2002

Filed:

Jul 30, 1999

Appl. No.:

09/365590

Inventors:

Michael J. Carey - San Jose CA
George Lapis - San Jose CA
Mir Hamid Pirahesh - San Jose CA
Serge P. Rielau - Ajax, CA
Bennet Vance - San Jose CA

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1730

US Classification:

707 2, 707 1, 707 5, 707 3, 707 10, 707104

Abstract:

A method for typed view hierarchies for an object-relational database management (OPDBMS). The views in the hierarchy are merged into a unified hierarchy view through case expressions for mapping and wrapping of overloaded columns. During the merge, the underlying logical tables are eliminated which results in a simplified query graph. The transformation is a non-loss operation which condenses the type information within the case expressions. This allows update, delete and insert operations to be resolved on the query graph on a local level. Using query rewrite rules, the case expressions may be simplified further.

US Patent:

6457020, Sep 24, 2002

Filed:

Mar 20, 2000

Appl. No.:

09/532179

Inventors:

Michael James Carey - San Jose CA
Gerald George Kiernan - San Jose CA

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1730

US Classification:

707103R, 707103 Y

Abstract:

A method, apparatus, and article of manufacture for a computer-implemented technique for query optimization using a multi-layered object cache. An object-oriented query is executed to retrieve data from a database. The database is stored on a data storage device connected to a computer and queries are run against lower cache layers which have better performance characteristics than the external or upper layers. The multi-layered cache has an application objects (AOs) cache and a data access objects (DAOs) cache, and the application objects include methods deriving data from DAOs. The method includes a step of rewriting the query into a query directed against the DAOs cache, applying a pushdown transformation algorithm to the rewritten query directed against the DAOs cache, and executing the transformed query against the DAOs cache. The method also allows optimizing queries with path expressions by transforming path expression into joins. Another performance optimization includes using a limited data set only including the inserted and updated data, which allows the method to evaluate queries against a subset of a collection of cached objects instead of an entire collection of cached objects.

US Patent:

6477527, Nov 5, 2002

Filed:

Mar 7, 2001

Appl. No.:

09/801988

Inventors:

Michael J. Carey - San Jose CA
Gerald G. Kiernan - San Jose CA

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1730

US Classification:

707 4

Abstract:

The system, method, and program of this invention enables an object language application to issue a query over a view and to receive back, as query results, handles to application type objects which can be further manipulated by the application. A view is defined herein as a collection of a view type, and a view type is defined as a class or type. Object language class definitions are created based upon the view type of the view referenced by the query. Upon receipt of the query referencing a view type, a query engine generates a query plan that builds mock application type objects in memory based upon the view types and having a form consistent with the class definition for a type of object returned as a result.

US Patent:

6574639, Jun 3, 2003

Filed:

Jun 27, 2001

Appl. No.:

09/891453

Inventors:

Michael James Carey - San Jose CA
Gerald George Kiernan - San Jose CA

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1730

US Classification:

7071041

Abstract:

A method, apparatus, and article of manufacture for a computer-implemented technique for query optimization with deferred updates and autonomous sources. An object-oriented query is executed to retrieve data from a database. The database is stored on a data storage device connected to a computer. The object-oriented query is transformed into subqueries, wherein at least one subquery is directed against a database, and wherein one subquery is directed against an object cache. Each subquery that is directed against a database is executed to retrieve data from the database into the object cache. The subquery that is directed against the object cache is executed to retrieve data for the query, wherein the data incorporates updates to the object cache and updates to the database.

US Patent:

6728952, Apr 27, 2004

Filed:

Sep 24, 1999

Appl. No.:

09/405884

Inventors:

Michael James Carey - San Jose CA
Serge Philippe Rielau - Ajax, CA
Bennet Vance - San Jose CA

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 945

US Classification:

717141, 717136, 717142, 717143, 717144, 717146

Abstract:

A computer system identifies a predicate in a computer language containing constant expressions as vacuous. The system identifies distinct variables contained in the predicate and represents the predicate by a set of bounding rectangles. The bounding rectangles are represented in a space having a number of dimensions equal to the number of variables. There are finite limits on dimensions of a bounding rectangle which represent the relationship between the variables in the predicate and the constant expressions in the predicate. The predicate is identified as vacuously FALSE where the set of bounding rectangles is empty.

US Patent:

6947945, Sep 20, 2005

Filed:

Mar 21, 2000

Appl. No.:

09/531802

Inventors:

Michael James Carey - San Jose CA, US
Jayavel Shanmugasundaram - San Jose CA, US
Eugene Jon Shekita - San Jose CA, US
Narayana Iyer - San Jose CA, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F017/30

US Classification:

707102, 715513

Abstract:

A method for publishing relational data as XML by translating XML queries into queries against an relational database. Conversion of the relational database into an XML database is not required. Each relational table is mapped to a virtual XML document, and XML queries are issued over these virtual documents. An XML query is parsed and transformed into a language-neutral intermediate representation, which is a sequence of operations describing how the output document is derived from the underlying relational tables. The intermediate representation is then translated into an SQL query over the underlying relational tables and into instructions for a tagger. The SQL query is executed, and the SQL query results are then fed into the tagger, which follows tagger instructions to generate the marked up output.

US Patent:

20040167915, Aug 26, 2004

Filed:

Feb 23, 2004

Appl. No.:

10/784376

Inventors:

Arvind Sundararajan - San Jose CA, US
Michael Carey - San Jose CA, US

Assignee:

BEA Systems, Inc. - San Jose CA

International Classification:

G06F007/00

US Classification:

707/100000

Abstract:

A default shape representation can be used to transform data between formats having different shapes. The default shape representation can be made using a language with which a user is already familiar, such as XML. For example, a user may have XML data that the user wishes to use with a set of Java classes having a different shape. A user can simply apply an XML query language, such as XQuery, to translate the XML shape into the corresponding XML shape representation, and a query engine can take care of transforming the data to Java. A runtime component can then generate a Java object having that second shape. This allows a user to have and utilize a Java data structure using an XML language. Once users learn how to write a data transformation using XQuery, that user can use XQuery to transform XML to any other format, including another XML format. This description is not intended to be a complete description of, or limit the scope of, the invention. Other features, aspects, and objects of the invention can be obtained from a review of the specification, the figures, and the claims.

US Patent:

59567066, Sep 21, 1999

Filed:

May 9, 1997

Appl. No.:

8/853685

Inventors:

Michael James Carey - San Jose CA
Donald Alan Kossmann - Passau, DE

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1730

US Classification:

707 2

Abstract:

A STOP AFTER clause for a relational database management system (RDBMS) structured query language (SQL) causes the RDBMS, in response to a query, to return a query result having at most a predetermined cardinality specified in the query. A query with a STOP AFTER clause is processed by the RDBMS by provision of one or more STOP operators that are inserted into a query execution plan generated by the RDBMS to execute the query. In a conservative policy, STOP operators are inserted in the query execution plan such that no tuples that might be required in the query result are discarded. In contrast, an aggressive policy inserts a STOP operator in the query execution plan wherever it is able to provide a beneficial cardinality reduction. A RESTART operator is inserted into aggressive policy query execution plans to ensure that at least the predetermined number of tuples are returned in the query result, and a final STOP operator is added at or near the root of the plan to ensure that at most the specified number of tuples are produced.