Patents by Inventor Monica Sachiye Urata
Monica Sachiye Urata has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 6847962Abstract: A method, apparatus, and article of manufacture for optimizing database queries using a derived summary table, wherein a definition of the summary table is based on a full select statement, including, but not limited to, a derived table involving nested GROUP BY operations and complex HAVING clauses with subqueries or joins, that is materialized in the table and describes how the summary table was derived. A query is analyzed using matching/compensation tests between the query and the definition of the summary table (that is, a query by itself) to determine whether expressions occurring anywhere in the query, but not in the summary table, can be derived using either the content in the summary table alone, or after combining (through some relational operator) the content of the summary table with other base tables, and hence the query is subsumed by or overlaps with the summary table definition.Type: GrantFiled: February 11, 2000Date of Patent: January 25, 2005Assignee: International Business Machines CorporationInventors: Roberta Jo Cochrane, George Lapis, Ting Yu Leung, Mark A. Paskin, Mir Hamid Pirahesh, Yang Sun, Monica Sachiye Urata, Markos Zaharioudakis
-
Patent number: 6826562Abstract: An optimization technique for SQL queries, a program storage device storing the optimization program, and an apparatus for optimizing a query is provided. A query is analyzed to determine whether it includes subselect expressions that return exactly or at most one tuple. If so, the quantifier merger or elimination is performed, if possible, to allow query to perform more efficiently than that of the original query while providing same results. The query is then executed in the computer to efficiently retrieve data from the database.Type: GrantFiled: November 29, 1999Date of Patent: November 30, 2004Assignee: International Business Machines CorporationInventors: Ting Yu Leung, Monica Sachiye Urata, Swati Vora
-
Patent number: 6529896Abstract: An optimization technique for SQL queries, a program storage device storing the optimization program, and an apparatus for optimizing a query is provided. A query is analyzed to determine whether it includes the WHERE clause which contains an “EXISTS” subquery and a “NOT EXISTS” subquery, or EXISTS-equivalent subqueries, in Boolean factor. If so, the subsumption test is performed on two subqueries. Then, the compensation predicate is applied to one of them, to perform the QGM transformation of the query. One subquery block is stacked on top of the other subquery block, in order to eliminate one subquery. This procedure allows the transformed query to perform more efficiently than the original query while providing same results. The query is then executed in the computer to efficiently retrieve data from the relational database.Type: GrantFiled: February 17, 2000Date of Patent: March 4, 2003Assignee: International Business Machines CorporationInventors: Ting Yu Leung, Tuong Chanh Truong, Monica Sachiye Urata
-
Patent number: 6460027Abstract: A method, apparatus, and article of manufacture for optimizing database queries uses a derived summary table, wherein a definition of the summary table is based on a full select statement that is materialized in the table and describes how the summary table was derived. The summary table definition can be a complex query involving nested GROUP BY operations as well as complex HAVING clauses with subqueries or join operations. A query is analyzed using subsumption tests between the query and the definition of the summary table to determine whether expressions occurring anywhere in the query, but not in the summary table, can be subsumed in the summary table. In performing the query, an expression in the query is subsumed in the summary table when the expression can be re-derived from one or more of the columns of the summary table.Type: GrantFiled: September 14, 1998Date of Patent: October 1, 2002Assignee: International Business Machines CorporationInventors: Roberta Jo Cochrane, George Lapis, Ting Yu Leung, Mir Hamid Pirahesh, Monica Sachiye Urata
-
Method and system for look ahead query evaluation planning based on interesting partition properties
Patent number: 6345267Abstract: A relational data base management system includes a query processor that uses a query operator partition property to perform QEP pruning and to ensure that data input to a query operator is partitioned appropriately for the operation. The partition property indicates the group of network nodes across which a table is distributed. The query processor also makes use of partition classes that are designated “interesting classes” to perform preoptimization planning and query pruning, and to perform look-ahead partitioning based on partition classes that are identified as being of interest to future operations, thereby more efficiently evaluating complex query statements in an MPP, shared-nothing environment.Type: GrantFiled: March 2, 2000Date of Patent: February 5, 2002Assignee: International Business Machines CorporationInventors: Guy Maring Lohman, Eugene Jon Shekita, David E. Simmen, Monica Sachiye Urata -
Patent number: 6339769Abstract: A method, apparatus, and article of manufacture for optimizing database queries using a materialized view for a table referenced in the query, wherein the materialized view has different properties than the referenced table. The materialized view may be replicated across multiple processors of the computer system, so that some or all of the query can be executed in a local fashion wherein there is no data movement required to perform the operations. The materialized view also may be partitioned across multiple processors of the computer system using a different partitioning key than the referenced table. The materialized view may be a vertical and/or horizontal subset of the table, so that only selected columns and/or tuples from the table are present therein. Columns may be added to the materialized view to contain pre-computed results of complex expressions, and indices may be created on the columns of the materialized view.Type: GrantFiled: September 14, 1998Date of Patent: January 15, 2002Assignee: International Business Machines CorporationInventors: Roberta Jo Cochrane, George Lapis, Ting Yu Leung, Mir Hamid Pirahesh, Monica Sachiye Urata, Richard Sefton Sidle, David E. Simmen, Calisto Paul Zuzarte
-
Patent number: 6112198Abstract: Query evaluation is optimized using parallel optimization techniques to make repartitioning more efficient. Efficiency is improved by recognizing the possible partitioning requirements for achieving parallelism for a query operation, and by recognizing when the partitioning property of data satisfies the partitioning requirements of a query operation. A data base management system in accordance with the invention uses parallel query processing techniques to optimize data repartitioning, or to avoid it altogether.Type: GrantFiled: June 29, 1998Date of Patent: August 29, 2000Assignee: International Business Machines CorporationInventors: Guy Maring Lohman, Mir Hamid Pirahesh, Eugene Jon Shekita, David E. Simmen, Monica Sachiye Urata
-
Patent number: 6092062Abstract: A relational data base management system includes a query processor that uses a query operator partition property to perform QEP pruning and to ensure that data input to a query operator is partitioned appropriately for the operation. The partition property indicates the group of network nodes across which a table is distributed. The query processor also makes use of partition classes that are designated "interesting classes" to perform preoptimization planning and query pruning, and to perform look-ahead partitioning based on partition classes that are identified as being of interest to future operations, thereby more efficiently evaluating complex query statements in an MPP, shared-nothing environment.Type: GrantFiled: June 30, 1997Date of Patent: July 18, 2000Assignee: International Business Machines CorporationInventors: Guy Maring Lohman, Eugene Jon Shekita, David E. Simmen, Monica Sachiye Urata
-
Patent number: 6081801Abstract: An automated methodology, and an apparatus for practicing the methodology, which enables the power and flexibility inherent in shared nothing parallel database systems (MPP) to be utilized on complex queries which have, heretofore, contained query elements requiring local computation or local coordination of data computation performed across the nodes of the distributed system. The present invention provides these features and advantages by identifying and marking the subgraphs containing these types of query elements as "no TQ zones" in the preparation phase prior to optimization. When the optimizer sees the markings, it builds a plan that will force the computation of the marked subgraphs to be in the same section. This preparation phase also provides the partitioning information for all inputs to the "no TQ zones". This allows the bottom-up optimizer to correctly plan the partitioning for the "no TQ zones".Type: GrantFiled: June 30, 1997Date of Patent: June 27, 2000Assignee: International Business Machines CorporationInventors: Roberta Jo Cochrane, George Lapis, Mir Hamid Pirahesh, Richard Sefton Sidle, David Everett Simmen, Tuong Chanh Truong, Monica Sachiye Urata
-
Patent number: 5960428Abstract: Unwieldy star/join queries are performed more efficiently using a filtered fact table. Suitable queries include star/join queries with a large fact table joined with multiple subsidiary dimension tables, where indices exist over fact table join columns. The query is analyzed to prepare a query plan for the dimension table accesses. This plan is supplemented by adding nested loop join operations, where the inner table is a dimension table plan and the outer table is an index scan performed over a fact table index of the join column with the dimension table. The plan is also supplemented by filtering records resulting from the nested loop joins using a sequence of dynamic bit vectors, ultimately yielding a list of probable fact table records. The plan is further supplemented by fetching these records to construct a distilled fact which is used, instead of the large original table, to execute the query in considerably less time.Type: GrantFiled: August 28, 1997Date of Patent: September 28, 1999Assignee: International Business Machines CorporationInventors: Bruce Gilbert Lindsay, Guy Maring Lohman, Mir Hamid Pirahesh, Eugene Jon Shekita, David Everett Simmen, Monica Sachiye Urata
-
Patent number: 5873075Abstract: An automated system for detecting and preventing mutating table violations of database integrity in a SQL query before generation and selection of an optimal query execution plan (QEP). This system modifies the query graph model (QGM) to restrict the choice of execution plans to those that avoid mutating table integrity (MTI) violations, thereby forcing database integrity during table mutation when executing the optimal QEP. Mutating table integrity violations are detected by evaluating the position in the QGM of each write-node referencing a particular base table with respect to each of the positions of all other read- and write-nodes referencing of the same base table. Every common-referencing node pair is tested for sequencing conflicts and a data-flow dam is inserted in the QGM where necessary or a poke query is inserted between the nodes to force the completion of the execution of one node before initiating execution of the other common-referencing node.Type: GrantFiled: June 30, 1997Date of Patent: February 16, 1999Assignee: International Business Machines CorporationInventors: Roberta Jo Cochrane, George Lapis, Mir Hamid Pirahesh, Richard Sefton Sidle, David Everett Simmen, Tuong Chanh Truong, Monica Sachiye Urata