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

1. 发明授权

US5701454A Simplification of SQL queries using generalized inference propagation and generalized transitive closure 失效
标题翻译：使用广义推理传播和广义传递闭包简化SQL查询
公开(公告)号：US5701454A
公开(公告)日：1997-12-23
申请号：US373562
申请日：1995-01-17
申请人： Gautam Bhargava , Piyush Goel , Balakrishna Ragmavendra Iyer
发明人： Gautam Bhargava , Piyush Goel , Balakrishna Ragmavendra Iyer
IPC分类号： G06F17/30
CPC分类号： G06F17/30454 , G06F17/30471 , Y10S707/99932
摘要： A method and apparatus for query simplification by applying generalization inference propagation and transitive closure in SQL queries having intersection operations combined with inner and outer join operations further combined with selection and/or projection operations. First a strong set of predicates is calculated, typically a selection or join predicate which is null-intolerant. Second the strong set of attributes is used to select and replace a full, left, or right outer join operation found as the operand of an intersection operation in the query. A less expensive outer or inner join replaces the selected join and the process is repeated until no further simplification if possible. Inferences are propagated from one operand to the other of an intersection operation. Selection operators are applied through transitive closure to reduce the size of intermediate results. The transformations are applied to the query to produces a set of operations that perform more efficiently than that of the original query while providing the same results.
摘要翻译：一种通过在具有与选择和/或投影操作相结合的内外连接操作相结合的交集操作的SQL查询中应用泛化推理传播和传递闭包来进行查询简化的方法和装置。首先计算一组强大的谓词，通常是不容忍的选择或连接谓词。第二，强大的属性集合用于选择和替换在查询中发现的交叉点操作的操作数的完整，左或右外连接操作。较便宜的外部或内部连接取代所选择的连接，并且重复该过程，直到不可能进一步简化为止。推论从一个操作数传播到另一个交集操作。选择算子通过传递闭包来应用，以减小中间结果的大小。转换应用于查询，以产生一组比原始查询执行效率更高的操作，同时提供相同的结果。

2. 发明授权

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运算符是补偿运算符。对于计划中每个子树的根，递归地执行运算符分配。然后选择一个列举的计划（通常是最优）。

3. 发明授权

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运算符是补偿运算符。对于计划中每个子树的根，递归地执行运算符分配。然后选择一个列举的计划（通常是最优）。

4. 发明授权

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运算符是补偿运算符。对于计划中每个子树的根，递归地执行运算符分配。然后选择一个列举的计划（通常是最优）。

5. 发明授权

US5855012A Simplification of SQL queries using generalized inference propagation and generalized transitive closure 失效
标题翻译：使用广义推理传播和广义传递闭包简化SQL查询
公开(公告)号：US5855012A
公开(公告)日：1998-12-29
申请号：US904414
申请日：1997-07-31
申请人： Gautam Bhargava , Piyush Goel , Balakrishna Ragmavendra Iyer
发明人： Gautam Bhargava , Piyush Goel , Balakrishna Ragmavendra Iyer
IPC分类号： G06F17/30
CPC分类号： G06F17/30454 , G06F17/30471 , Y10S707/99932
摘要： A method and apparatus for query simplification by applying generalized inference propagation and generalized transitive closure in SQL queries having selection, projection, join, outer join, and intersection operations.
摘要翻译：一种通过在具有选择，投影，连接，外连接和交叉操作的SQL查询中应用广义推理传播和广义传递闭包来进行查询简化的方法和装置。

6. 发明授权

US5701455A Method and apparatus for reordering complex SQL queries using a modified generalized outer join operator 失效
标题翻译：使用修改后的广义外连接运算符重新排序复杂SQL查询的方法和装置
公开(公告)号：US5701455A
公开(公告)日：1997-12-23
申请号：US464263
申请日：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运算符是补偿运算符。对于计划中每个子树的根，递归地执行运算符分配。然后选择一个列举的计划（通常是最优）。

7. 发明授权

US5687362A Enumerating projections in SQL queries containing outer and full outer joins in the presence of inner joins 失效
标题翻译：在存在内部连接的情况下，枚举包含外部和全部外部连接的SQL查询中的预测
公开(公告)号：US5687362A
公开(公告)日：1997-11-11
申请号：US379891
申请日：1995-01-30
申请人： Gautam Bhargava , Piyush Goel , Balakrishna Ragmavendra Iyer
发明人： Gautam Bhargava , Piyush Goel , Balakrishna Ragmavendra 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”操作）的方法和装置，而不会在性能上遇到任何回归。本发明通过将投影移动到查询的表达树表示的顶部来从给定用户查询中移除投影，其中使用代数身份而不是基于规则的变换来执行投影删除。本发明还公开了在给定用户查询中枚举用于投影操作和二进制操作的不同计划或计划的几种方法。本发明可以通过选择二进制操作和二进制操作之间的投影的最佳调度来显着地减少查询的执行时间。然而，本发明通过将查询的成本与枚举的计划或计划的成本进行比较来确保性能没有回归，从而确保优化或转换不引入性能惩罚。

8. 发明授权

US5680603A Method and apparatus for reordering complex SQL queries containing inner and outer join operations 失效
标题翻译：重新排序包含内部和外部连接操作的复杂SQL查询的方法和装置
公开(公告)号：US5680603A
公开(公告)日：1997-10-21
申请号：US326461
申请日：1994-10-20
申请人： 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运算符是补偿运算符。对于计划中每个子树的根，递归地执行运算符分配。然后选择一个列举的计划（通常是最优）。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式