Patents by Inventor Mir H. Pirahesh
Mir H. 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: 10642741Abstract: A computer-implemented method according to one embodiment includes receiving a request for data, locating the data at one or more partitions of a heterogeneously partitioned table, determining an access method associated with each of the one or more partitions, and requesting the data from the one or more partitions, utilizing the access method associated with each of the one or more partitions.Type: GrantFiled: February 6, 2017Date of Patent: May 5, 2020Assignee: International Business Machines CorporationInventors: Avrilia Floratou, Fatma Ozcan, Mir H. Pirahesh, Navneet S. Potti
-
Patent number: 10503731Abstract: Embodiments relate to aggregation operations. More specifically, embodiments relate to translating a query involving a distinct aggregate(s) into a query that does not involve a distinct aggregate. The translation involves a transformation effectively rewriting the original query containing the distinct aggregate including removal of the distinct aggregate from the query. The translated query enables the query to perform a non-distinct aggregation that effectively provides the results of the removed distinct aggregate(s).Type: GrantFiled: October 11, 2016Date of Patent: December 10, 2019Assignee: International Business Machines CorporationInventors: Ronald J. Barber, Ioana M. Delaney, Mir H. Pirahesh, Vijayshankar Raman
-
Publication number: 20180225215Abstract: A computer-implemented method according to one embodiment includes receiving a request for data, locating the data at one or more partitions of a heterogeneously partitioned table, determining an access method associated with each of the one or more partitions, and requesting the data from the one or more partitions, utilizing the access method associated with each of the one or more partitions.Type: ApplicationFiled: February 6, 2017Publication date: August 9, 2018Inventors: Avrilia Floratou, Fatma Ozcan, Mir H. Pirahesh, Navneet S. Potti
-
Publication number: 20180101569Abstract: Embodiments relate to aggregation operations. More specifically, embodiments relate to translating a query involving a distinct aggregate(s) into a query that does not involve a distinct aggregate. The translation involves a transformation effectively rewriting the original query containing the distinct aggregate including removal of the distinct aggregate from the query. The translated query enables the query to perform a non-distinct aggregation that effectively provides the results of the removed distinct aggregate(s).Type: ApplicationFiled: October 11, 2016Publication date: April 12, 2018Applicant: International Business Machines CorporationInventors: Ronald J. Barber, Ioana M. Delaney, Mir H. Pirahesh, Vijayshankar Raman
-
Patent number: 9774682Abstract: Embodiments relate to parallel data streaming between a first computer system and a second computer system. Aspects include transmitting a request to establish an authenticated connection between a processing job on the first computer system and a process on the second computer system and transmitting a query to the process on the second computer system over the authenticated connection. Aspects further include creating one or more tasks on the first computer system configured to receive data from the second computer system in parallel and reading data received by the one or more tasks by the processing job on the first computer system.Type: GrantFiled: January 8, 2015Date of Patent: September 26, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Sangeeta T. Doraiswamy, Marc Hörsken, Fatma Ozcan, Mir H. Pirahesh
-
Publication number: 20160205188Abstract: Embodiments relate to parallel data streaming between a first computer system and a second computer system. Aspects include transmitting a request to establish an authenticated connection between a processing job on the first computer system and a process on the second computer system and transmitting a query to the process on the second computer system over the authenticated connection. Aspects further include creating one or more tasks on the first computer system configured to receive data from the second computer system in parallel and reading data received by the one or more tasks by the processing job on the first computer system.Type: ApplicationFiled: January 8, 2015Publication date: July 14, 2016Inventors: Sangeeta T. Doraiswamy, Marc Hörsken, Fatma Ozcan, Mir H. Pirahesh
-
Patent number: 7505957Abstract: Disclosed is a method and system for incrementally maintaining algebraic functions in automatic summary tables (ASTs) of at least one relational database. The method associates a work area with each algebraic function in each AST. Each work area is comprised of one or more variables. The method populates the variables within each work area for each algebraic function when each AST is created and when each AST is updated. The method maintains each work area by adding and subtracting to and from its associated variables when the associated data changes in the relational database. The functions that compute the variables of the work areas are distributive and thus incrementally maintainable. The method computes and recomputes the algebraic function within an AST after the updates have changed one or more of the variables of its work area.Type: GrantFiled: August 19, 2003Date of Patent: March 17, 2009Assignee: International Business Machines CorporationInventors: Roberta J. Cochrane, Mir H. Pirahesh, Richard S. Sidle
-
Patent number: 5615361Abstract: The present invention optimizes SQL queries by exploiting uniqueness properties. In identifying whether the generalized 1-tuple condition exists, the query is first analyzed to determine whether any columns referenced in a predicate of the query are bound. According to the present invention, columns may be bound to constant values or correlated columns or columns that are already bound. The bound columns, if any, are then analyzed to determine whether any of the bound columns comprise a key for its associated table. If these conditions exist, then the query satisfies the 1-tuple condition, in that it returns at most one tuple. Once the generalized 1-tuple condition has been identified to exist for the query, important query transformations can be performed for optimization purposes. These query transformations comprise the transformation of scalar subqueries into joins, or the elimination of distinctiveness requirements (i.e., DISTINCT keywords) from SELECT clauses.Type: GrantFiled: February 7, 1995Date of Patent: March 25, 1997Assignee: International Business Machines CorporationInventors: Ting Y. Leung, Mir H. Pirahesh, David E. Simmen, Lori G. Strain, Sanjai Tiwari
-
Patent number: 5590324Abstract: A method and apparatus for optimizing SQL queries by propagating and exploiting column nullability. Column nullability is identified and propagated using a three-valued logic, wherein a column of a table can be identified nullability information is exploited to optimize query operations through transformations. In one aspect of the present invention, quantified predicates (such as ">ALL") are transformed into simple predicates involving singleton subqueries so that indexing can be exploited. In another aspect of the present invention, "is not null" predicates are generated and pushed for certain aggregate queries. In still another aspect of the present invention, intersect operations are transformed into joins. The end result is that the present invention can significantly enhance the performance of the queries.Type: GrantFiled: February 7, 1995Date of Patent: December 31, 1996Assignee: International Business Machines CorporationInventors: Ting Y. Leung, Mir H. Pirahesh, Michelle M. Jou, David E. Simmen
-
Outer join operations using responsibility regions assigned to inner tables in a relational database
Patent number: 5557791Abstract: A computer database system utilizes a method for performing a right outer join of database tables without sorting the inner table (T.sub.2). The processing of each tuple in the outer table (T.sub.1) includes the preservation in the joint output of all tuples in T.sub.2 which are in its responsibility region. The initialization step of the process preserves in the join output all of the tuples in T.sub.2 which have column set values less than the lowest column set value in T.sub.1, i.e. the first tuple in T.sub.1, since T.sub.1 is sorted or accessed using a sorted index. The responsibility region for tuples in T.sub.1, other than the last tuple, is defined as those tuples which have column set values less than the column set value for the next tuple in T.sub.1 and greater than or equal to the column set value for the current T.sub.1 tuple. The last tuple in T.sub.1 must preserve all of the tuples in T.sub.2 which have not already been preserved in T.sub.2, i.e.Type: GrantFiled: October 19, 1994Date of Patent: September 17, 1996Assignee: International Business Machines CorporationInventors: Josephine M. Cheng, Chandrasekaran Mohan, Mir H. Pirahesh -
Patent number: 5551031Abstract: A computer database system utilizes a method for performing a right outer join of database tables without sorting the inner table (T.sub.2). The processing of each tuple in the outer table (T.sub.1) includes the preservation in the joint output of all tuples in T.sub.2 which are in its responsibility region. The initialization step of the process preserves in the join output all of the tuples in T.sub.2 which have column set values less than the lowest column set value in T.sub.1, i.e. the first tuple in T.sub.1, since T.sub.1 is sorted or accessed using a sorted index. The responsibility region for tuples in T.sub.1, other than the last tuple, is defined as those tuples which have column set values less than the column set value for the next tuple in T.sub.1 and greater than or equal to the column set value for the current T.sub.1 tuple. The last tuple in T.sub.1 must preserve all of the tuples in T.sub.2 which have not already been preserved in T.sub.2, i.e.Type: GrantFiled: June 7, 1995Date of Patent: August 27, 1996Assignee: International Business Machines CorporationInventors: Josephine M. Cheng, Chandrasekaran Mohan, Mir H. Pirahesh
-
Patent number: 5548755Abstract: A system for optimizing SQL queries in a relational database management system using magic decorrelation. After representing an assembly of multiple SQL queries in computer memory using data structures configured in the query box representation ("QBR") format, queries amenable to decorrelation are identified, and FEED and ABSORB stages are applied to rewrite the QBR in decorrelated form. The FEED stage generates a set of correlation values that the subquery can use to decorrelate. The ABSORB stage decorrelates the subquery using the correlation values prepared by the FEED stage, resulting in the correlation bindings being absorbed into the subquery. The invention thereby takes full advantage of set-at-a-time, rather than tuple-at-a-time, processing.Type: GrantFiled: February 17, 1995Date of Patent: August 20, 1996Assignee: International Business Machines CorporationInventors: Ting Y. Leung, Mir H. Pirahesh, Praveen Seshadri
-
Patent number: 5548754Abstract: A method and apparatus for optimizing SQL queries in a relational database management system uses early-out join transformations. An early-out join comprises a many-to-one existential join, wherein the join scans an inner table for a match for each row of the outer table and terminates the scan for each row of the outer table when a single match is found in the inner table. To transform a many-to-many join to an early-out join, the query must include a requirement for distinctiveness, either explicitly or implicitly, in one or more result columns for the join operation. Distinctiveness can be specified using the DISTINCT keyword in the SELECT clause or can be implied from the predicates present in the query. The early-out join transformation also requires that no columns of the inner table be referenced after the join, or if an inner table column is referenced after the join, that each referenced column be "bound".Type: GrantFiled: February 7, 1995Date of Patent: August 20, 1996Assignee: International Business Machines CorporationInventors: Mir H. Pirahesh, Ting Y. Leung, Guy M. Lohman, Eugene J. Shekita, David E. Simmen
-
Patent number: 5548758Abstract: A method and apparatus for optimizing SQL queries in a relational database management system uses early-out join transformations. An early-out join comprises a many-to-one existential join, wherein the join scans an inner table for a match for each row of the outer table and terminates the scan for each row of the outer table when a single match is found in the inner table. To transform a many-to-many join to an early-out join, the query must include a requirement for distinctiveness, either explicitly or implicitly, in one or more result columns for the join operation. Distinctiveness can be specified using the DISTINCT keyword in the SELECT clause or can be implied from the predicates present in the query. The early-out join transformation also requires that no columns of the inner table be referenced after the join, or if an inner table column is referenced after the join, that each referenced column be "bound".Type: GrantFiled: June 5, 1995Date of Patent: August 20, 1996Assignee: International Business Machines CorporationInventors: Mir H. Pirahesh, Ting Y. Leung, Guy M. Lohman, Eugene J. Shekita, David E. Simmen
-
Patent number: 5546576Abstract: 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 to force the completion of the execution of one node before initiating execution of the other common-referencing node.Type: GrantFiled: February 17, 1995Date of Patent: August 13, 1996Assignee: International Business Machines CorporationInventors: Roberta J. Cochrane, Mir H. Pirahesh, Richard S. Sidle
-
Patent number: 5546570Abstract: The present invention provides an evaluation strategy for the execution of SQL queries involving recursion and table queues in a relational database management system. The table queue is established for the query in the memory of the computer, and tuples are generated by tuple-producing operators in the query for storage into the table queue. As operators of the query read the stored tuples from the table queue, a first end-of-file condition, termed a Temporary End-Of-File, occurs when all of the tuples currently stored in the table queue have been retrieved and control is returned to the operator reading from the table queue. A retry request for additional tuples is generated by the operator through the table queue to the tuple-producing operators. If the tuple-producing operators can generate additional tuples, then these additional tuples are stored into the table queue and control is returned to the operator reading from the table queue in response to the retry request.Type: GrantFiled: February 17, 1995Date of Patent: August 13, 1996Assignee: International Business Machines CorporationInventors: John A. McPherson, Jr., Mir H. Pirahesh, Tuong C. Truong, Daniel J. Coyle, Jr.
-
Patent number: 5367675Abstract: An automated method is provided for optimizing a query for retrieving data from a relational database in a computer relational database management system. The method uses rules for identifying queries for which duplicates are a factor in retrieving the proper data from the database. The method then merges queries with table expressions, views and subqueries when possible without causing duplicates to be unnecessarily retrieved.Type: GrantFiled: December 13, 1991Date of Patent: November 22, 1994Assignee: International Business Machines CorporationInventors: Josephine M.-K. Cheng, Sheldon J. Finkelstein, Donald J. Haderle, Mir H. Pirahesh, Yun Wang
-
Patent number: 5280612Abstract: An improved concurrency control system for application to a distributed concurrent transaction and query processing system using multi-version database records to overcome delays arising from lock conflicts. Read-only queries are afforded a consistent "stable state" of the database during the life of the query. Updating transactions requiring locks can proceed without waiting for the termination of long queries. At least two database versions are necessary, although availability of more versions permits long read-only queries to phase-out over time without forcing new queries to use aged "stable-state" data and without roll-back. Read-only queries can be terminated and converted to locking transactions to permit an update of the "stable state" database version before the queries would normally terminate. A novel record key structure having a plurality of substructures corresponding to the several database versions is used to access database records.Type: GrantFiled: November 26, 1991Date of Patent: January 18, 1994Assignee: International Business Machines CorporationInventors: Raymond A. Lorie, Chandrasekaran Mohan, Mir H. Pirahesh