Patents by Inventor Mir Hamid Pirahesh
Mir Hamid Pirahesh 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: 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
-
Publication number: 20020138460Abstract: A method, apparatus, and article of manufacture for optimizing database queries using subsumption tests between the query and at least one summary table that comprises a cube index to determine whether an expression in the query can be subsumed in the summary table. The summary table stores at least one materialized view involving at least one GROUP BY operation the computes at least one of the following: (1) a cube, (2) a rollup, (3) a grouping set, and (4) a concatenation of cubes, rollups, grouping sets, and one or more grouping items. When the expression in the query can be subsumed in the summary table, the query is rewritten to use the summary table.Type: ApplicationFiled: September 22, 1999Publication date: September 26, 2002Inventors: ROBERTA JO COCHRANE, GEORGE LAPIS, TING YU LEUNG, MIR HAMID PIRAHESH, YANG SUN, MARKOS ZAHARIOUDAKIS
-
Patent number: 6453314Abstract: The invention provides method and apparatus for use in a database management system for managing a database containing data, where the database has storage for storing data in the database, and has an instruction processor for processing instructions for managing data stored in the database. The database has a constraint manager for managing constraints on said data stored in the database. The invention provides efficient method and means for deferred checking of data after bulk loading into said database for violation of constraints by determining an appropriate procedure for constraint checking by determining whether constraint checking is required; and if it is required, determining whether to implement full, or incremental checking for compliance with said constraints; and then checking the data in the database in accordance with the determined constraint checking procedure.Type: GrantFiled: July 30, 1999Date of Patent: September 17, 2002Assignee: International Business Machines CorporationInventors: Petrus Kai Chung Chan, Roberta Jo Cochrane, Sam Sampson Lightstone, Mir Hamid Pirahesh, Richard Sefton Sidle, Tuong Chanh Truong, Michael J. Winer, Calisto Paul Zuzarte
-
Patent number: 6421658Abstract: 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.Type: GrantFiled: July 30, 1999Date of Patent: July 16, 2002Assignee: International Business Machines CorporationInventors: Michael J. Carey, George Lapis, Mir Hamid Pirahesh, Serge P. Rielau, Bennet Vance
-
Patent number: 6339768Abstract: An optimization technique for SQL queries. A query is analyzed to determine whether it includes one or more scalar subqueries and one or more existential subqueries. The scalar subqueries and the existential subqueries are transformed into join operations using subsumption, and the join operations are merged into a single join query block. The join query block can then be executed in the computer to efficiently retrieve data from the relational database.Type: GrantFiled: August 13, 1998Date of Patent: January 15, 2002Assignee: International Business Machines CorporationInventors: Ting Yu Leung, Mir Hamid Pirahesh
-
Patent number: 6339770Abstract: A method, apparatus, and article of manufacture for simplifying and optimizing queries involving GROUP BY operations, when GROUP BY items involve constants and when there are “false” predicates in SELECT-HAVING clauses.Type: GrantFiled: August 12, 1999Date of Patent: January 15, 2002Assignee: International Business Machines CorporationInventors: Ting Yu Leung, Mir Hamid Pirahesh
-
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: 6085189Abstract: A database system and method provide support for a positioned data set modification operation on a collection of data sets involved in a data set query operation, in which the data set modification operation is based on the position of a query execution iterator. At query compile time, the database system generates an iterator position retrieval function and a data set modification function for each data set involved in the query operation. At query execution time, the database system invokes each of the iterator retrieval functions until the iterator position retrieval function for a current open data set returns the current the position of the query execution iterator on that data set. The database system then invokes each of the data set modification functions until the data set modification function for the current open data set performs a data set modification operation at the current position of the query execution iterator specified by the iterator position retrieval function.Type: GrantFiled: May 3, 1999Date of Patent: July 4, 2000Assignee: International Business Machines CorporationInventors: Mir Hamid Pirahesh, David E. Simmen, Tuong Chanh Truong
-
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: 6063133Abstract: A system and method for translating source code, comprising high level source code with embedded SQL statements, to p-code or machine-language instructions by a one-pass parsing mechanism. The one-pass parsing mechanism generates executable code without the need to generate an intermediate file. Additionally, the p-code or machine-language instructions are annotated with references to the line numbers of the corresponding source code, thereby allowing a source level debugger to debug the source code with embedded SQL statements.Type: GrantFiled: June 30, 1998Date of Patent: May 16, 2000Assignee: International Business Machines CorporationInventors: Chin Hsiang Li, I-Shin-Andy Wang, Wei Young, Shu Huar Joseph Yeh, John Shek-Luen Ng, Kuo-Wei Hwang, Mir Hamid Pirahesh, Tak-Ming Lo
-
Patent number: 6032143Abstract: A relational data base management system includes a query processor that permits consideration of alternative query plans by the query optimizer so one table can be sent to a selected network location for subquery evaluation in consideration of maximum processing efficiency. Subqueries are converted from "predicate push-down" form to scalar subqueries, enabling upper tables to be sent to nodes of lower tables and vice versa, thereby permitting selection of the node direction depending on the least cost alternative. The optimizer of the query processor is presented with rewritten query code that permits more than one alternative for sending tables for evaluation. The optimizer evaluates the alternatives permitted by the rewritten code, determines the optimal plan for each alternative, and selects the least-cost plan from among the plans evaluated.Type: GrantFiled: December 4, 1998Date of Patent: February 29, 2000Assignee: International Business Machines CorporationInventors: Ting Yu Leung, Alex Chak-tsang Lui, Mir Hamid Pirahesh, Tuong Chanh Truong
-
Patent number: 5987455Abstract: A method, apparatus, and article of manufacture for an intelligent compiler. A query is executed in a computer to retrieve data from a relational database stored on a data storage device. The query contains a procedural function. The query is compiled to generate an internal representation of the procedural function. Then, the execution of the procedural function is optimized using the generated internal representation.Type: GrantFiled: June 30, 1997Date of Patent: November 16, 1999Assignee: International Business Machines CorporationInventors: Roberta Jo Cochrane, Mir Hamid Pirahesh, Serge Philippe Rielau, Richard Sefton Sidle, Tolga Urhan
-
Patent number: 5963933Abstract: Method for specifying SQL "full outer joins" which enables the use of arbitrary join conditions in specifying the query. This is enabled by equating a full outer join with a left outer join unioned with a right outer join less the matched tuples from the right outer join. A number of embodiments further present improvements in execution speed. One such improvement utilizes as a second operand of the union query a novel operator, the "ANTI-JOIN". The anti-join is implemented as a right outer join coupled with an ISNULL predicate.Type: GrantFiled: June 25, 1997Date of Patent: October 5, 1999Assignee: International Business Machines CorporationInventors: Josephine M. Cheng, Ting Yu Leung, Mir Hamid Pirahesh
-
Patent number: 5963934Abstract: A method, apparatus, and article of manufacture for an intelligent compiler. A query is executed in a computer to retrieve data from a relational database stored on a data storage device. One or more scripting language statements are compiled to generate an internal representation. Then, the execution of the scripting language statements is optimized using the generated internal representation.Type: GrantFiled: June 30, 1997Date of Patent: October 5, 1999Assignee: International Business Machines CorporationInventors: Roberta Jo Cochrane, Mir Hamid Pirahesh, Serge Philippe Rielau, Richard Sefton Sidle
-
Patent number: 5963936Abstract: Method and apparatus for detecting and stacking grouping sets to support GROUP BY operations with GROUPING SETS, ROLLUP and CUBE extensions in relational database management systems, with greatly reduced numbers of grouping sets. A first GROUP BY (element-list1) is input to a second GROUP BY (element-list2), resulting in the GROUP BY of the intersection of the two lists. This intersection property is then useable to reduce the number of GROUP BYs required to implement the grouping by GROUPING SETS, ROLLUPs, and CUBEs required for the online analytical processing of data contained in the database.Type: GrantFiled: June 30, 1997Date of Patent: October 5, 1999Assignee: International Business Machines CorporationInventors: Roberta Jo Cochrane, Michelle Meichiou Jou, George Lapis, Mir Hamid Pirahesh
-
Patent number: 5960426Abstract: A database system and method provide support for a positioned data set modification operation on a collection of data sets involved in a data set query operation, in which the data set modification operation is based on the position of a query execution iterator. At query compile time, the database system generates an iterator position retrieval function and a data set modification function for each data set involved in the query operation. At query execution time, the database system invokes each of the iterator retrieval functions until the iterator position retrieval function for a current open data set returns the current the position of the query execution iterator on that data set. The database system then invokes each of the data set modification functions until the data set modification function for the current open data set performs a data set modification operation at the current position of the query execution iterator specified by the iterator position retrieval function.Type: GrantFiled: June 30, 1997Date of Patent: September 28, 1999Assignee: International Business Machines CorporationInventors: Mir Hamid Pirahesh, David E. Simmen, Tuong Chanh Truong
-
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: 5930795Abstract: A framework for a query compiler and run-time environment for resolving a table reference to a dynamic table that is first identified at run-time but is initially unknown at compile-time. A parser parses the table reference and creates a parsed representation for the table that identifies the type of dynamic table. A code generator creates executable plans containing run-time table object representations (TAOB), from the parsed representations, that contain the type of dynamic table. The TAOB is also extended to provide for parameters that are definable at run-time, including a table ID of the actual table entity being referenced. A routine is embedded in a run-time routine that checks the type of dynamic table in the TAOB and dispatches control to one of a plurality of corresponding routines, depending upon the type of dynamic table. The corresponding routines use the extended TAOB to dynamically link the table reference to the dynamic table, depending upon the type of dynamic table.Type: GrantFiled: January 21, 1997Date of Patent: July 27, 1999Assignee: International Business Machines CorporationInventors: Yao-Ching Stephen Chen, Jyh-Herng Chow, Roberta Jo Cochrane, Gene Y.C. Fuh, Nelson Mendonca Mattos, Mir Hamid Pirahesh, Jeffrey D. Richey, Brian Thinh-Vinh Tran, Tuong Chanh Truong
-
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