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

1. 发明授权

US08037059B2 Implementing aggregation combination using aggregate depth lists and cube aggregation conversion to rollup aggregation for optimizing query processing 失效
标题翻译：使用聚合深度列表和多维数据集聚合转换实现聚合组合以进行汇总聚合，以优化查询处理
公开(公告)号：US08037059B2
公开(公告)日：2011-10-11
申请号：US12113259
申请日：2008-05-01
申请人： Robert J. Bestgen , David G. Carlson , Robert V. Downer , Shantan Kethireddy
发明人： Robert J. Bestgen , David G. Carlson , Robert V. Downer , Shantan Kethireddy
IPC分类号： G06F17/30
CPC分类号： G06F17/30442 , Y10S707/99931 , Y10S707/99933 , Y10S707/99935
摘要： A process combines multiple grouping sets into single rollup sets with depth lists defining the levels of grouping that must be performed. Grouping sets are identified that are contained within other sets and combined into single rollups with depth lists. Cube aggregation conversion to rollup aggregation is provided for optimizing database query processing. Natural sets of rollup hierarchies within a cube are recognized and the cube is converted into those rollup hierarchies. Once converted, the rollup aggregation is performed to significantly reduce required processing.
摘要翻译：一个进程将多个分组集合组合成单个汇总集合，其深度列表定义必须执行的分组级别。识别分组集合，其包含在其他集合中，并且与深度列表组合成单个汇总。提供了多维数据集汇总转换为汇总汇总，用于优化数据库查询处理。多维数据集中的自然集合层次结构被识别，并将多维数据集转换为这些汇总层次结构。一旦转换，执行汇总汇总以显着减少所需的处理。

2. 发明申请

US20090276393A1 Implementing Aggregation Combination Using Aggregate Depth Lists and Cube Aggregation Conversion to Rollup Aggregation for Optimizing Query Processing 失效
标题翻译：使用聚合深度列表和立方体聚合转换到汇总聚合来优化查询处理来实现聚合组合
公开(公告)号：US20090276393A1
公开(公告)日：2009-11-05
申请号：US12113259
申请日：2008-05-01
申请人： Robert J. Bestgen , David G. Carlson , Robert V. Downer , Shantan Kethireddy
发明人： Robert J. Bestgen , David G. Carlson , Robert V. Downer , Shantan Kethireddy
IPC分类号： G06F7/06
CPC分类号： G06F17/30442 , Y10S707/99931 , Y10S707/99933 , Y10S707/99935
摘要： A process combines multiple grouping sets into single rollup sets with depth lists defining the levels of grouping that must be performed. Grouping sets are identified that are contained within other sets and combined into single rollups with depth lists. Cube aggregation conversion to rollup aggregation is provided for optimizing database query processing. Natural sets of rollup hierarchies within a cube are recognized and the cube is converted into those rollup hierarchies. Once converted, the rollup aggregation is performed to significantly reduce required processing.
摘要翻译：一个进程将多个分组集合组合成单个汇总集合，其深度列表定义必须执行的分组级别。识别分组集合，其包含在其他集合中，并且与深度列表组合成单个汇总。提供了多维数据集汇总转换为汇总汇总，用于优化数据库查询处理。多维数据集中的自然集合层次结构被识别，并将多维数据集转换为这些汇总层次结构。一旦转换，执行汇总汇总以显着减少所需的处理。

3. 发明申请

US20110137890A1 Join Order for a Database Query 失效
标题翻译：加入订单数据库查询
公开(公告)号：US20110137890A1
公开(公告)日：2011-06-09
申请号：US12630950
申请日：2009-12-04
申请人： Robert J. Bestgen , Robert V. Downer , Brian R. Muras
发明人： Robert J. Bestgen , Robert V. Downer , Brian R. Muras
IPC分类号： G06F17/30
CPC分类号： G06F17/30466
摘要： In an embodiment, a portion of the execution plan is executed to produce a portion of records in a partial result set. If a first join of a table is performed that eliminates more than a first threshold number of records from the partial result set, a determination is made whether an estimated cost of a forced primary join is less than an estimated cost of a star join. If the estimated cost of the forced primary join is less than the estimated cost of the star join, then the table is moved first in a join order in the execution plan, the portion of the records in the partial result set is discarded, and the execution is re-started with a different portion of the execution plan to produce a different portion of the records.
摘要翻译：在一个实施例中，执行执行计划的一部分以产生部分结果集中的一部分记录。如果执行表的第一次连接，其从部分结果集中消除超过第一阈值数量的记录，则确定强制主连接的估计成本是否小于星形联接的估计成本。如果强制主连接的估计成本小于星形连接的估计成本，则首先在执行计划中以连接顺序移动表，部分结果集中的部分记录将被丢弃，以执行计划的不同部分重新开始执行以产生记录的不同部分。

4. 发明申请

US20120158698A1 EXECUTION PLANS WITH DIFFERENT DRIVER SOURCES IN MULTIPLE THREADS 有权
标题翻译：在多个螺纹中执行不同驱动器源的程序
公开(公告)号：US20120158698A1
公开(公告)日：2012-06-21
申请号：US12974538
申请日：2010-12-21
申请人： Robert J. Bestgen , Robert V. Downer , Brian R. Muras
发明人： Robert J. Bestgen , Robert V. Downer , Brian R. Muras
IPC分类号： G06F17/30
CPC分类号： G06F17/30463
摘要： In an embodiment, a first driver source specified by a first execution plan that implements a query is designated, and a second driver source specified by a second execution plan that implements the query is designated. A portion of the first execution plan and a portion of the second execution plan are executed. If a unique identifier of a first row returned by the executing the portion of the first execution plan does not match all unique identifiers of all rows from the second driver source that were saved to a result set by the executing the portion of the second execution plan, then the first row returned by the executing the portion of the first execution plan is added to the result set and the unique identifier of the first row that was returned by the executing the portion of the first execution plan is added to a unique identifier log.
摘要翻译：在一个实施例中，指定由执行查询的第一执行计划指定的第一驱动器源，并且指定由实现查询的第二执行计划指定的第二驱动器源。执行第一执行计划的一部分和第二执行计划的一部分。如果执行第一执行计划的部分返回的第一行的唯一标识符与执行第二执行计划的部分而保存到结果集的第二驱动程序源的所有行的所有唯一标识符不匹配，则执行第一执行计划的部分返回的第一行被添加到结果集中，并且由执行第一执行计划的部分返回的第一行的唯一标识符被添加到唯一的标识符日志。

5. 发明授权

US08442971B2 Execution plans with different driver sources in multiple threads 有权
标题翻译：在多线程中执行计划与不同的驱动程序源
公开(公告)号：US08442971B2
公开(公告)日：2013-05-14
申请号：US12974538
申请日：2010-12-21
申请人： Robert J. Bestgen , Robert V. Downer , Brian R. Muras
发明人： Robert J. Bestgen , Robert V. Downer , Brian R. Muras
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30463
摘要： In an embodiment, a first driver source specified by a first execution plan that implements a query is designated, and a second driver source specified by a second execution plan that implements the query is designated. A portion of the first execution plan and a portion of the second execution plan are executed. If a unique identifier of a first row returned by the executing the portion of the first execution plan does not match all unique identifiers of all rows from the second driver source that were saved to a result set by the executing the portion of the second execution plan, then the first row returned by the executing the portion of the first execution plan is added to the result set and the unique identifier of the first row that was returned by the executing the portion of the first execution plan is added to a unique identifier log.
摘要翻译：在一个实施例中，指定由执行查询的第一执行计划指定的第一驱动器源，并且指定由实现查询的第二执行计划指定的第二驱动器源。执行第一执行计划的一部分和第二执行计划的一部分。如果执行第一执行计划的部分返回的第一行的唯一标识符与执行第二执行计划的部分而保存到结果集的第二驱动程序源的所有行的所有唯一标识符不匹配，则执行第一执行计划的部分返回的第一行被添加到结果集中，并且由执行第一执行计划的部分返回的第一行的唯一标识符被添加到唯一的标识符日志。

6. 发明授权

US08396852B2 Evaluating execution plan changes after a wakeup threshold time 失效
标题翻译：在唤醒阈值时间后评估执行计划更改
公开(公告)号：US08396852B2
公开(公告)日：2013-03-12
申请号：US12885847
申请日：2010-09-20
申请人： Robert J. Bestgen , Robert V. Downer , Brian R. Muras
发明人： Robert J. Bestgen , Robert V. Downer , Brian R. Muras
IPC分类号： G06F17/30
CPC分类号： G06F17/30474
摘要： In an embodiment an execution plan for a query is created. A wakeup threshold is set proportional to an amount of time taken by the creation of the execution plan. In various embodiments, the wakeup threshold is increased by a percentage equal to one minus a percentage of free resources at a computer system, is increased inversely proportional to an amount of execution time of a previous execution of the execution plan, or is decreased proportional to a number of times the execution plan was executed. A portion of the execution plan is executed to produce a portion of rows in a result set until the wakeup threshold expires. After the wakeup threshold expires, changes to the execution plan are evaluated.
摘要翻译：在一个实施例中，创建用于查询的执行计划。唤醒阈值与创建执行计划所花费的时间量成正比。在各种实施例中，唤醒阈值增加一个等于一个减去计算机系统上的空闲资源的百分比的百分比，与执行计划的先前执行的执行时间量成反比，或者与执行计划执行的次数。执行执行计划的一部分以产生结果集中的一部分行，直到唤醒阈值到期为止。唤醒阈值到期后，将对执行计划进行更改。

7. 发明授权

US08332389B2 Join order for a database query 失效
标题翻译：加入订单数据库查询
公开(公告)号：US08332389B2
公开(公告)日：2012-12-11
申请号：US12630950
申请日：2009-12-04
申请人： Robert J. Bestgen , Robert V. Downer , Brian R. Muras
发明人： Robert J. Bestgen , Robert V. Downer , Brian R. Muras
IPC分类号： G06F17/30
CPC分类号： G06F17/30466
摘要： In an embodiment, a portion of the execution plan is executed to produce a portion of records in a partial result set. If a first join of a table is performed that eliminates more than a first threshold number of records from the partial result set, a determination is made whether an estimated cost of a forced primary join is less than an estimated cost of a star join. If the estimated cost of the forced primary join is less than the estimated cost of the star join, then the table is moved first in a join order in the execution plan, the portion of the records in the partial result set is discarded, and the execution is re-started with a different portion of the execution plan to produce a different portion of the records.
摘要翻译：在一个实施例中，执行执行计划的一部分以产生部分结果集中的一部分记录。如果执行表的第一次连接，其从部分结果集中消除超过第一阈值数量的记录，则确定强制主连接的估计成本是否小于星形联接的估计成本。如果强制主连接的估计成本小于星形连接的估计成本，则首先在执行计划中以连接顺序移动表，部分结果集中的部分记录将被丢弃，以执行计划的不同部分重新开始执行以产生记录的不同部分。

8. 发明申请

US20120072412A1 EVALUATING EXECUTION PLAN CHANGES AFTER A WAKEUP THRESHOLD TIME 失效
标题翻译：在唤醒时间后评估执行计划更改
公开(公告)号：US20120072412A1
公开(公告)日：2012-03-22
申请号：US12885847
申请日：2010-09-20
申请人： Robert J. Bestgen , Robert V. Downer , Brian R. Muras
发明人： Robert J. Bestgen , Robert V. Downer , Brian R. Muras
IPC分类号： G06F17/30
CPC分类号： G06F17/30474
摘要： In an embodiment an execution plan for a query is created. A wakeup threshold is set proportional to an amount of time taken by the creation of the execution plan. In various embodiments, the wakeup threshold is increased by a percentage equal to one minus a percentage of free resources at a computer system, is increased inversely proportional to an amount of execution time of a previous execution of the execution plan, or is decreased proportional to a number of times the execution plan was executed. A portion of the execution plan is executed to produce a portion of rows in a result set until the wakeup threshold expires. After the wakeup threshold expires, changes to the execution plan are evaluated.
摘要翻译：在一个实施例中，创建用于查询的执行计划。唤醒阈值与创建执行计划所花费的时间量成正比。在各种实施例中，唤醒阈值增加一个等于一个减去计算机系统上的空闲资源百分比的百分比，与执行计划的先前执行的执行时间量成反比，或者与执行计划执行的次数。执行执行计划的一部分以产生结果集中的一部分行，直到唤醒阈值到期为止。唤醒阈值到期后，将对执行计划进行更改。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式