专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US5832477A Method and apparatus for reordering complex SQL queries containing inner and outer join operations 失效
标题翻译：重新排序包含内部和外部连接操作的复杂SQL查询的方法和装置
公开(公告)号：US5832477A
公开(公告)日：1998-11-03
申请号：US856198
申请日：1997-05-14
申请人： Gautam Bhargava , Piyush Goel , Balakrishna Ragmavendra Iyer
发明人： Gautam Bhargava , Piyush Goel , Balakrishna Ragmavendra Iyer
IPC分类号： G06F17/30
CPC分类号： G06F17/30463 , G06F17/30466 , Y10S707/99932
摘要： A method and apparatus for reordering complex SQL queries containing joins, outer and full outer joins. The method and apparatus first translates the query into a hypergraph representation. Required sets, conflict sets and preserved sets are then generated for the query hypergraph. Using the required sets, a plurality of plans are enumerated, wherein the plans represent associative re-orderings of relations in the query. SQL operators are selectively assigned to each of the enumerated plans using the conflict sets and/or preserved sets, so that the results from the plans are identical to the original query. A novel Modified General Outer Join (MGOJ) operator may be assigned to the root of a sub-tree, wherein the MGOJ operator is a compensation operator. The operator assignment is performed recursively for the root of each sub-tree in the plan. One of the enumerated plans (generally the most optimal) is then selected for execution.
摘要翻译：一种重新排序复杂SQL查询的方法和装置，它包含连接，外部和外部连接。该方法和装置首先将查询翻译成超图表示。然后为查询超图生成所需的集合，冲突集和保留集。使用所需的集合，列举了多个计划，其中计划表示查询中的关系的关联重新排序。使用冲突集和/或保留集合将SQL运算符选择性地分配给每个枚举的计划，以便计划的结果与原始查询相同。可以将新颖的修改后的通用外部联接（MGOJ）运算符分配给子树的根，其中，MGOJ运算符是补偿运算符。对于计划中每个子树的根，递归地执行运算符分配。然后选择一个列举的计划（通常是最优）。

2. 发明授权

US5752017A Method and apparatus for executing complex SQL queries using projection operations 失效
标题翻译：使用投影操作执行复杂SQL查询的方法和装置
公开(公告)号：US5752017A
公开(公告)日：1998-05-12
申请号：US468647
申请日：1995-06-05
申请人： Gautam Bhargava , Piyush Goel , Balakrishna Ragmavendra Iyer
发明人： Gautam Bhargava , Piyush Goel , Balakrishna Ragmavendra Iyer
IPC分类号： G06F17/30
CPC分类号： G06F17/30463 , G06F17/30466 , Y10S707/99932
摘要： A method and apparatus for reordering complex SQL queries containing joins, outer and full outer joins. The method and apparatus first translates the query into a hypergraph representation. Required sets, conflict sets and preserved sets are then generated for the query hypergraph. Using the required sets, a plurality of plans are enumerated, wherein the plans represent associative reorderings of relations in the query. SQL operators are selectively assigned to each of the enumerated plans using the conflict sets and/or preserved sets, so that the results from the plans are identical to the original query. A novel Modified General Outer Join (MGOJ) operator may be assigned to the root of a sub-tree, wherein the MGOJ operator is a compensation operator. The operator assignment is performed recursively for the root of each sub-tree in the plan. One of the enumerated plans (generally the most optimal) is then selected for execution.
摘要翻译：一种重新排序复杂SQL查询的方法和装置，它包含连接，外部和外部连接。该方法和装置首先将查询翻译成超图表示。然后为查询超图生成所需的集合，冲突集和保留集。使用所需的集合，列举了多个计划，其中计划表示查询中关系的关联排序。使用冲突集和/或保留集合将SQL运算符选择性地分配给每个枚举的计划，以便计划的结果与原始查询相同。可以将新颖的修改后的通用外部联接（MGOJ）运算符分配给子树的根，其中，MGOJ运算符是补偿运算符。对于计划中每个子树的根，递归地执行运算符分配。然后选择一个列举的计划（通常是最优）。

3. 发明授权

US5724568A Reordering complex SQL queries containing inner and outer join operations using hypergraphs and required sets 失效
标题翻译：使用超图和所需的集合重新排序包含内部和外部连接操作的复杂SQL查询
公开(公告)号：US5724568A
公开(公告)日：1998-03-03
申请号：US464268
申请日：1995-06-05
申请人： Gautam Bhargava , Piyush Goel , Balakrishna Ragmavendra Iyer
发明人： Gautam Bhargava , Piyush Goel , Balakrishna Ragmavendra Iyer
IPC分类号： G06F17/30
CPC分类号： G06F17/30463 , G06F17/30466 , Y10S707/99932
摘要： A method and apparatus for reordering complex SQL queries containing joins, outer and full outer joins. The method and apparatus first translates the query into a hypergraph representation. Required sets, conflict sets and preserved sets are then generated for the query hypergraph. Using the required sets, a plurality of plans are enumerated, wherein the plans represent associative reorderings of relations in the query. SQL operators are selectively assigned to each of the enumerated plans using the conflict sets and/or preserved sets, so that the results from the plans are identical to the original query. A novel Modified General Outer Join (MGOJ) operator may be assigned to the root of a sub-tree, wherein the MGOJ operator is a compensation operator. The operator assignment is performed recursively for the root of each sub-tree in the plan. One of the enumerated plans (generally the most optimal) is then selected for execution.
摘要翻译：一种重新排序复杂SQL查询的方法和装置，它包含连接，外部和外部连接。该方法和装置首先将查询翻译成超图表示。然后为查询超图生成所需的集合，冲突集和保留集。使用所需的集合，列举了多个计划，其中计划表示查询中关系的关联排序。使用冲突集和/或保留集合将SQL运算符选择性地分配给每个枚举的计划，以便计划的结果与原始查询相同。可以将新颖的修改后的通用外部联接（MGOJ）运算符分配给子树的根，其中，MGOJ运算符是补偿运算符。对于计划中每个子树的根，递归地执行运算符分配。然后选择一个列举的计划（通常是最优）。

4. 发明授权

US5706495A Encoded-vector indices for decision support and warehousing 失效
标题翻译：用于决策支持和仓储的编码向量索引
公开(公告)号：US5706495A
公开(公告)日：1998-01-06
申请号：US643998
申请日：1996-05-07
申请人： Atul Chadha , Ashish Gupta , Piyush Goel , Venkatesh Harinarayan , Balakrishna Raghavendra Iyer
发明人： Atul Chadha , Ashish Gupta , Piyush Goel , Venkatesh Harinarayan , Balakrishna Raghavendra Iyer
IPC分类号： G06F17/30
CPC分类号： G06F17/30324 , Y10S707/99932 , Y10S707/99933
摘要： A method, apparatus, and article of manufacture for optimizing SQL queries in a relational database management system using a vectorized index. The vectorized index represents values in one or more of the columns of a particular table in the relational database. The vectorized index is comprised of a plurality of positions, wherein each of the positions comprises a linear array that represents a value for the specified columns in a corresponding row of the particular table in the relational database. To use the vectorized index, SQL operations are converted to a series of bit-vector operations on that index, where the result of the bit-vector operations is a list of row positions in the table.
摘要翻译：一种使用向量化索引在关系数据库管理系统中优化SQL查询的方法，设备和制品。向量化索引表示关系数据库中特定表的一个或多个列中的值。矢量化索引由多个位置组成，其中每个位置包括线性阵列，其表示关系数据库中特定表的对应行中的指定列的值。要使用向量化索引，SQL操作将转换为该索引上的一系列位向量操作，其中位向量操作的结果是表中的行位列表。

5. 发明申请

US20120226266A1 LAPAROSCOPIC APPARATUS 审中-公开
标题翻译： LAPAROSCOPIC设备
公开(公告)号：US20120226266A1
公开(公告)日：2012-09-06
申请号：US13408733
申请日：2012-02-29
申请人： Ashitava Ghosal , Piyush Goel , Harihar Suresh Kumbhare , Makam Ramesh
发明人： Ashitava Ghosal , Piyush Goel , Harihar Suresh Kumbhare , Makam Ramesh
IPC分类号： A61B17/00
CPC分类号： A61B17/29 , A61B34/71 , A61B2017/2902 , A61B2017/291 , A61B2017/292 , A61B2017/2927
摘要： The present invention provides a laparoscopic apparatus having an elongated barrel connected to a handle case with a fixed handle and a movable handle. A rotatable conduit is connected to a rotatable wheel with a movable rod disposed inside the elongated barrel, which is operable by the rotatable wheel. An end-effector with wrist-like movement is connected to an articulation assembly of the fixed handle in conjunction with a universal joint. The laparoscopic apparatus of the present invention with the end-effector assembly provides a wrist-like lateral movement. The laparoscopic surgical apparatus of the present invention has an improved articulation and an extra degree of freedom, while retaining its existing surgical functions.
摘要翻译：本发明提供了一种腹腔镜装置，其具有连接到具有固定手柄和可移动手柄的手柄壳体的细长筒体。可旋转管道连接到可旋转轮，其中可移动杆设置在细长筒体内部，该可动杆可由可旋转轮操作。具有腕状运动的末端执行器与万向节结合连接到固定手柄的关节运动组件。具有末端执行器组件的本发明的腹腔镜装置提供手腕状横向运动。本发明的腹腔镜手术装置具有改善的关节和额外的自由度，同时保留其现有的手术功能。

6. 发明授权

US6088691A Enumerating projection in SQL queries containing outer and full outer joins in the presence of inner joins 失效
标题翻译：在存在内部连接的情况下，枚举包含外部和全部外部连接的SQL查询中的预测
公开(公告)号：US6088691A
公开(公告)日：2000-07-11
申请号：US198643
申请日：1998-11-24
申请人： Gautam Bhargava , Piyush Goel , Balakrishna Raghavendra Iyer
发明人： Gautam Bhargava , Piyush Goel , Balakrishna Raghavendra Iyer
IPC分类号： G06F17/30
CPC分类号： G06F17/30463 , Y10S707/99932 , Y10S707/99939
摘要： The present invention discloses a method and apparatus for the enumeration of projections (i.e., "SELECT DISTINCT" operations) in SQL queries containing outer and full outer joins in the presence of inner joins without encountering any regression in performance. The present invention removes projections from a given user query by moving the projections to the top of an expression tree representation of the query, wherein the projection removal is performed using algebraic identities rather than rule-based transformations. The present invention also discloses several methods of enumerating different plans or schedules for projection operations and binary operations in the given user query. The present invention can significantly reduce the execution time of a query by selecting the optimal schedule for binary operations and projections between the binary operations. However, the present invention ensures that there is no regression in performance by comparing the cost of the query with the cost of enumerated plans or schedules, thereby ensuring that the optimizations or transformations do not introduce performance penalties.
摘要翻译：本发明公开了一种在存在内连接的情况下，在包含外连接和全外连接的SQL查询中枚举突出（即“SELECT DISTINCT”操作）的方法和装置，而不会在性能上遇到任何回归。本发明通过将投影移动到查询的表达树表示的顶部来从给定用户查询中移除投影，其中使用代数身份而不是基于规则的变换来执行投影删除。本发明还公开了在给定用户查询中枚举用于投影操作和二进制操作的不同计划或计划的几种方法。本发明可以通过选择二进制操作和二进制操作之间的投影的最佳调度来显着地减少查询的执行时间。然而，本发明通过将查询的成本与枚举的计划或计划的成本进行比较来确保性能没有回归，从而确保优化或转换不引入性能惩罚。

7. 发明授权

US5864847A Reordering of complex SQL queries involving groupbys, joins, outer joins and full outer joins 失效
公开(公告)号：US5864847A
公开(公告)日：1999-01-26
申请号：US902975
申请日：1997-07-30
申请人： Piyush Goel , Balakrishna Raghavendra Iyer
发明人： Piyush Goel , Balakrishna Raghavendra Iyer
IPC分类号： G06F17/30
CPC分类号： G06F17/30471 , G06F17/30454 , Y10S707/99932 , Y10S707/99934
摘要： A method, apparatus, and article of manufacture for query simplification by applying generalized inference propagation and generalized transitive closure in SQL queries having selection, projection, join, outer join, and intersection operations. The disclosed transformations and enumeration method unify and solve the problems of 1) unnesting join aggregate queries, and 2) complete enumeration of queries containing outer joins, when the outer join predicate references an aggregated value, or the predicate references more than two base relations in a query subtree. The system first eliminates redundant sub-expressions and modifies expensive binary operations to inexpensive binary operations, then converts complex predicates to simple predicates by application of a generalized selection (GS) operator.

8. 发明授权

US5758145A Method and apparatus for generating dynamic and hybrid sparse indices for workfiles used in SQL queries 失效
标题翻译：用于生成用于SQL查询的工作文件的动态和混合稀疏索引的方法和装置
公开(公告)号：US5758145A
公开(公告)日：1998-05-26
申请号：US393803
申请日：1995-02-24
申请人： Gautam Bhargava , Paramesh Sampatrai Desai , Piyush Goel , Peter Hoa , Fen-Ling Lin , Balakrishna Raghavendra Iyer , Jerry Mukai , William Samuel Perlman , Hong Sang Tie
发明人： Gautam Bhargava , Paramesh Sampatrai Desai , Piyush Goel , Peter Hoa , Fen-Ling Lin , Balakrishna Raghavendra Iyer , Jerry Mukai , William Samuel Perlman , Hong Sang Tie
IPC分类号： G06F17/30
CPC分类号： G06F17/30327 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99936 , Y10S707/99937
摘要： A method, apparatus and article for manufacture for generating static, dynamic and hybrid sparse indices for use with workfiles used by SQL queries in a relational database management system. A workfile and a sparse index structure are temporarily created in the computer during execution of the query by the computer. The workfile stores intermediate relations resulting from execution of a portion of the SQL query, wherein the intermediate relations comprise sorted rows for an inner table referenced in the SQL query. The sparse index structure contains one or more entries indicating at least an approximate location for at least some of the rows in the workfile. As one or more rows from an outer table referenced in the SQL query are retrieved, the entries of the sparse index structure are searched for a closest matching entry for each retrieved row. The sorted workfile is then scanned for a row matching each retrieved row using the closest matching entry from the sparse index structure as a starting position. The sparse index structure is then updated with an entry corresponding to the row from the sorted workfile matching the retrieved row from the outer table.
摘要翻译：一种用于生成静态，动态和混合稀疏索引的方法，装置和制品，用于在关系数据库管理系统中用于SQL查询的工作文件。在计算机执行查询期间，在计算机中临时创建工作文件和稀疏索引结构。工作文件存储由执行SQL查询的一部分而产生的中间关系，其中中间关系包括在SQL查询中引用的内部表的排序行。稀疏索引结构包含一个或多个条目，至少指示工作文件中至少一些行的近似位置。当从SQL查询中引用的外部表中的一行或多行被检索到时，搜索稀疏索引结构的条目以获取每个检索行的最接近的匹配条目。然后，使用距离稀疏索引结构最接近的匹配条目作为起始位置，扫描排序的工作文件，使其与每个检索到的行相匹配的行。然后使用与来自外部表的检索到的行匹配的排序工作文件中的行对应的条目来更新稀疏索引结构。

9. 发明授权

US5713015A Reordering of complex SQL queries involving GROUPBYs, joins, outer joins and full outer joins 失效
公开(公告)号：US5713015A
公开(公告)日：1998-01-27
申请号：US655300
申请日：1996-05-30
申请人： Piyush Goel , Balakrishna Raghavendra Iyer
发明人： Piyush Goel , Balakrishna Raghavendra Iyer
IPC分类号： G06F17/30
CPC分类号： G06F17/30471 , G06F17/30454 , Y10S707/99932 , Y10S707/99934
摘要： A method, apparatus, and article of manufacture for query simplification by applying generalized inference propagation and generalized transitive closure in SQL queries having selection, projection, join, outer join, and intersection operations. The disclosed transformations and enumeration method unify and solve the problems of 1) unnesting join aggregate queries, and 2) complete enumeration of queries containing outer joins, when the outer join predicate references an aggregated value, or the predicate references more than two base relations in a query subtree. The system first eliminates redundant sub-expressions and modifies expensive binary operations to inexpensive binary operations, then converts complex predicates to simple predicates by application of a generalized selection (GS) operator.

10. 发明授权

US5890148A System and method for generating uniqueness information for optimizing an SQL query 失效
标题翻译：用于识别用于优化SQL查询的关键信息的方法
公开(公告)号：US5890148A
公开(公告)日：1999-03-30
申请号：US986791
申请日：1997-12-08
申请人： Gautam Bhargava , Piyush Goel , Balakrishna R. Iyer
发明人： Gautam Bhargava , Piyush Goel , Balakrishna R. Iyer
IPC分类号： G06F17/30
CPC分类号： G06F17/30448 , G06F17/30454 , G06F17/30463 , Y10S707/99932
摘要： A system and method of determining uniqueness properties of an expression. A root of the expression is first determined, where the root is one of a base relation, a unary operation or a binary operation. Once the root is determined, a first procedure of an augmented unique process is called to determine uniqueness properties of a child of that root. The procedure called is chosen based on the determined root. Where the root is a base relation, a first procedure of a uniqueness process is applied to determine the uniqueness properties of the base relation. Where the root is a unary or binary operation, the called procedure is suspended, a second procedure of the augmented unique process is called to determine the uniqueness properties of the child of the operation, and this process is repeated until a base relation is reached. Once a base relation is reached, the first procedure of the uniqueness process is applied to determine the uniqueness properties of the reached base relation. A next procedure of a uniqueness process is applied to determine the uniqueness properties of a parent operator of the based relation. The procedure applied is chosen based on a type of operation represented by the parent. The process then unwinds to determine the uniqueness properties for each ancestor of the base relation(s).
摘要翻译：确定表达式的唯一性属性的系统和方法。首先确定表达式的根，其中根是基础关系之一，一元操作或二进制操作。一旦确定了根，则调用增强的唯一过程的第一过程来确定该根的子的唯一性属性。根据确定的根选择所谓的过程。在根是基础关系的情况下，应用唯一性过程的第一个过程来确定基础关系的唯一性。在根是一元或二进制操作的情况下，被调用的过程被暂停，调用增强的唯一过程的第二个过程来确定操作的子级的唯一性属性，并重复该过程，直到达到基础关系。一旦达到基本关系，则应用唯一性过程的第一个过程来确定达到的基础关系的唯一性。应用唯一性过程的下一个过程来确定基于关系的父操作者的唯一性。所应用的程序是基于由父代理的操作类型来选择的。该过程然后展开以确定基础关系的每个祖先的唯一性属性。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式