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

1. 发明授权

US07774336B2 Adaptively reordering joins during query execution 有权
标题翻译：在查询执行期间自适应地重新排序连接
公开(公告)号：US07774336B2
公开(公告)日：2010-08-10
申请号：US11852784
申请日：2007-09-10
申请人： Kevin Scott Beyer , Latha Sankar Colby , Quanzhong Li , Guy Maring Lohman , Volker Gerhard Markl , Minglong Shao
发明人： Kevin Scott Beyer , Latha Sankar Colby , Quanzhong Li , Guy Maring Lohman , Volker Gerhard Markl , Minglong Shao
IPC分类号： G06F17/30
CPC分类号： G06F17/30386
摘要： A method is disclosed for executing a predetermined query plan, the method comprising: executing a portion of the query plan; providing a reordered query plan; comparing ranking metrics for the query plans; and executing the query plan having the lower ranking metric.
摘要翻译：公开了一种用于执行预定查询计划的方法，所述方法包括：执行所述查询计划的一部分; 提供重新排序的查询计划; 比较查询计划的排名指标; 并执行具有较低等级度量的查询计划。

2. 发明申请

US20090070313A1 ADAPTIVELY REORDERING JOINS DURING QUERY EXECUTION 有权
标题翻译：在查询执行期间进行适当的重新连接
公开(公告)号：US20090070313A1
公开(公告)日：2009-03-12
申请号：US11852784
申请日：2007-09-10
申请人： Kevin Scott Beyer , Latha Sankar Colby , Quanzhong Li , Guy Maring Lohman , Volker Gerhard Markl , Minglong Shao
发明人： Kevin Scott Beyer , Latha Sankar Colby , Quanzhong Li , Guy Maring Lohman , Volker Gerhard Markl , Minglong Shao
IPC分类号： G06F17/30
CPC分类号： G06F17/30386
摘要： A method is disclosed for executing a predetermined query plan, the method comprising: executing a portion of the query plan; providing a reordered query plan; comparing ranking metrics for the query plans; and executing the query plan having the lower ranking metric.
摘要翻译：公开了一种用于执行预定查询计划的方法，所述方法包括：执行所述查询计划的一部分; 提供重新排序的查询计划; 比较查询计划的排名指标; 并执行具有较低等级度量的查询计划。

3. 发明申请

US20080222093A1 AUTOMATICALLY AND ADAPTIVELY DETERMINING EXECUTION PLANS FOR QUERIES WITH PARAMETER MARKERS 失效
标题翻译：自动和自适应地确定具有参数标记的查询的执行计划
公开(公告)号：US20080222093A1
公开(公告)日：2008-09-11
申请号：US12125221
申请日：2008-05-22
申请人： Wei Fan , Guy Maring Lohman , Volker Gerhard Markl , Nimrod Megiddo , Jun Rao , David Everett Simmen , Julia Stoyanovich
发明人： Wei Fan , Guy Maring Lohman , Volker Gerhard Markl , Nimrod Megiddo , Jun Rao , David Everett Simmen , Julia Stoyanovich
IPC分类号： G06F17/30
CPC分类号： G06F17/30469
摘要： A method and system for automatically and adaptively determining query execution plans for parametric queries. A first classifier trained by an initial set of training points is generated. A query workload and/or database statistics are dynamically updated. A new set of training points is collected off-line. Using the new set of training points, the first classifier is modified into a second classifier. A database query is received at a runtime subsequent to the off-line phase. The query includes predicates having parameter markers bound to actual values. The predicates are associated with selectivities. A mapping of the selectivities into a plan determines the query execution plan. The determined query execution plan is included in an augmented set of training points, where the augmented set includes the initial set and the new set.
摘要翻译：一种用于自动和自适应地确定参数查询的查询执行计划的方法和系统。产生由初始训练点训练的第一分类器。动态更新查询工作负载和/或数据库统计信息。离线收集了一套新的培训点。使用新的一组训练点，第一个分类器被修改为第二个分类器。在离线阶段之后的运行时间接收数据库查询。该查询包括具有绑定到实际值的参数标记的谓词。谓词与选择性相关联。将选择性映射到计划中确定查询执行计划。确定的查询执行计划被包括在增强的训练点集合中，其中增强集合包括初始集合和新集合。

4. 发明授权

US07490110B2 Predictable query execution through early materialization 失效
标题翻译：通过早期实现可预测的查询执行
公开(公告)号：US07490110B2
公开(公告)日：2009-02-10
申请号：US11388934
申请日：2006-03-24
申请人： Stephan Eberhard Ewen , Holger Kache , Guy Maring Lohman , Volker Gerhard Markl , Vijayshankar Raman
发明人： Stephan Eberhard Ewen , Holger Kache , Guy Maring Lohman , Volker Gerhard Markl , Vijayshankar Raman
IPC分类号： G06F17/30
CPC分类号： G06F17/30442 , Y10S707/99953
摘要： A method for predictable query execution through early materialization is provided. The method deals with the problem of cardinality misestimation in query execution plans, by pre-executing sub-plans on a query execution plan that have questionable estimates and collecting statistics on the output of these sub-plans. If needed, the overall query execution plan is changed in light of these statistics, before optimizing and executing the remainder of the query.
摘要翻译：提供了一种通过早期实现来预测查询执行的方法。该方法处理查询执行计划中基数误判的问题，预先执行查询执行计划的子计划，并对这些子计划的输出进行统计。如果需要，在优化和执行查询的其余部分之前，根据这些统计信息更改整体查询执行计划。

5. 发明授权

US07958113B2 Automatically and adaptively determining execution plans for queries with parameter markers 失效
标题翻译：自动和自适应地确定具有参数标记的查询的执行计划
公开(公告)号：US07958113B2
公开(公告)日：2011-06-07
申请号：US12125221
申请日：2008-05-22
申请人： Wei Fan , Guy Maring Lohman , Volker Gerhard Markl , Nimrod Megiddo , Jun Rao , David Everett Simmen , Julia Stoyanovich
发明人： Wei Fan , Guy Maring Lohman , Volker Gerhard Markl , Nimrod Megiddo , Jun Rao , David Everett Simmen , Julia Stoyanovich
IPC分类号： G06F7/00 , G06F17/30 , G06F15/16
CPC分类号： G06F17/30469
摘要： A method and system for automatically and adaptively determining query execution plans for parametric queries. A first classifier trained by an initial set of training points is generated. A query workload and/or database statistics are dynamically updated. A new set of training points is collected off-line. Using the new set of training points, the first classifier is modified into a second classifier. A database query is received at a runtime subsequent to the off-line phase. The query includes predicates having parameter markers bound to actual values. The predicates are associated with selectivities. A mapping of the selectivities into a plan determines the query execution plan. The determined query execution plan is included in an augmented set of training points, where the augmented set includes the initial set and the new set.
摘要翻译：一种用于自动和自适应地确定参数查询的查询执行计划的方法和系统。产生由初始训练点训练的第一分类器。动态更新查询工作负载和/或数据库统计信息。离线收集了一套新的培训点。使用新的一组训练点，第一个分类器被修改为第二个分类器。在离线阶段之后的运行时间接收数据库查询。该查询包括具有绑定到实际值的参数标记的谓词。谓词与选择性相关联。将选择性映射到计划中确定查询执行计划。确定的查询执行计划被包括在增强的训练点集合中，其中增强集合包括初始集合和新集合。

6. 发明申请

US20080195577A1 AUTOMATICALLY AND ADAPTIVELY DETERMINING EXECUTION PLANS FOR QUERIES WITH PARAMETER MARKERS 审中-公开
标题翻译：自动和自适应地确定具有参数标记的查询的执行计划
公开(公告)号：US20080195577A1
公开(公告)日：2008-08-14
申请号：US11673091
申请日：2007-02-09
申请人： Wei Fan , Guy Maring Lohman , Volker Gerhard Markl , Nimrod Megiddo , Jun Rao , David Everett Simmen , Julia Stoyanovich
发明人： Wei Fan , Guy Maring Lohman , Volker Gerhard Markl , Nimrod Megiddo , Jun Rao , David Everett Simmen , Julia Stoyanovich
IPC分类号： G06F17/30
CPC分类号： G06F16/24545
摘要： A method for automatically and adaptively determining query execution plans for parametric queries. A first classifier trained by an initial set of training points is generated using a set of random decision trees (RDTs). A query workload and/or database statistics are dynamically updated. A new set of training points collected off-line is used to modify the first classifier into a second classifier. A database query is received at a runtime subsequent to the off line phase. The query includes predicates having parameter markers bound to actual values. The predicates are associated with selectivities. The query execution plan is determined by identifying an optimal average of posterior probabilities obtained across a set of RDTs and mapping the selectivities to a plan. The determined query execution plan is included in an augmented set of training points that includes the initial set and the new set.
摘要翻译：一种用于自动和自适应地确定参数查询的查询执行计划的方法。使用一组随机决策树（RDT）生成由初始训练点组训练的第一分类器。动态更新查询工作负载和/或数据库统计信息。离线收集的一组新的训练点用于将第一个分类器修改为第二个分类器。在离线阶段之后的运行时间接收数据库查询。该查询包括具有绑定到实际值的参数标记的谓词。谓词与选择性相关联。查询执行计划通过确定通过一组RDT获得的后验概率的最优平均值并将选择性映射到计划来确定。确定的查询执行计划被包括在包括初始集合和新集合的增强的训练点集合中。

7. 发明授权

US07877381B2 Progressive refinement of a federated query plan during query execution 失效
标题翻译：查询执行期间联合查询计划的逐步细化
公开(公告)号：US07877381B2
公开(公告)日：2011-01-25
申请号：US11389596
申请日：2006-03-24
申请人： Stephan Eberhard Ewen , Holger Kache , Volker Gerhard Markl , Vijayshankar Raman
发明人： Stephan Eberhard Ewen , Holger Kache , Volker Gerhard Markl , Vijayshankar Raman
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30463
摘要： A way for progressively refining a query execution plan during query execution in a federated data system is provided. Re-optimization constraints are placed in the query execution plan during query compilation. When a re-optimization constraint is violated during query execution, a model of the query execution plan is refined using a partially executed query to form a new query execution plan. The new query execution plan is compiled. The compiled new query execution plan is executed.
摘要翻译：提供了一种在联合数据系统中查询执行期间逐步完善查询执行计划的方法。在查询编译期间，重新优化约束被放置在查询执行计划中。当在查询执行期间违反重新优化约束时，使用部分执行的查询来改进查询执行计划的模型以形成新的查询执行计划。新的查询执行计划被编译。执行编译的新查询执行计划。

8. 发明授权

US07987178B2 Automatically determining optimization frequencies of queries with parameter markers 失效
标题翻译：使用参数标记自动确定查询的优化频率
公开(公告)号：US07987178B2
公开(公告)日：2011-07-26
申请号：US12125146
申请日：2008-05-22
申请人： Fabian Hueske , Volker Gerhard Markl
发明人： Fabian Hueske , Volker Gerhard Markl
IPC分类号： G06F17/30
CPC分类号： G06F17/30463 , G06F17/30306
摘要： A method and system for automatically determining optimization frequencies of queries having one or more parameter markers. Execution plans for a query are generated and each plan is associated with one or more bind value sets. An optimization frequency is selected based on differences between pairs of execution costs where one execution cost of a pair is a cost of executing the query with a bind value set via a first execution plan and the other execution cost of the pair is a cost of optimally executing the query with the bind value set via a second execution plan. The differences are based on maximum selectivity or cardinality distances associated with the bind value sets. If none of the differences exceeds a predefined value, the query is optimized once. If at least one of the differences exceeds the predefined value, the query is reoptimized each time the query is executed.
摘要翻译：一种用于自动确定具有一个或多个参数标记的查询的优化频率的方法和系统。生成查询的执行计划，并将每个计划与一个或多个绑定值集相关联。基于执行成本对之间的差异来选择优化频率，其中一对的执行成本是通过经由第一执行计划设置的绑定值执行查询的成本，并且该对的另一个执行成本是最佳的成本通过第二个执行计划执行具有设置的绑定值的查询。差异基于与绑定值集相关联的最大选择性或基数距离。如果没有任何差异超过预定义值，则查询优化一次。如果差异中的至少一个超过了预定义的值，则每次执行查询时都会重新优化查询。

9. 发明授权

US07512629B2 Consistent and unbiased cardinality estimation for complex queries with conjuncts of predicates 有权
标题翻译：具有谓词结合的复杂查询的一致且无偏差的基数估计
公开(公告)号：US07512629B2
公开(公告)日：2009-03-31
申请号：US11457418
申请日：2006-07-13
申请人： Peter Jay Haas , Marcel Kutsch , Volker Gerhard Markl , Nimrod Megiddo
发明人： Peter Jay Haas , Marcel Kutsch , Volker Gerhard Markl , Nimrod Megiddo
IPC分类号： G06F7/00
CPC分类号： G06F17/30469 , Y10S707/99942 , Y10S707/99943
摘要： The present invention provides a method of selectivity estimation in which preprocessing steps improve the feasibility and efficiency of the estimation. The preprocessing steps are partitioning (to make iterative scaling estimation terminate in a reasonable time for even large sets of predicates), forced partitioning (to enable partitioning in case there are no “natural” partitions, by finding the subsets of predicates to create partitions that least impact the overall solution); inconsistency resolution (in order to ensure that there always is a correct and feasible solution), and implied zero elimination (to ensure convergence of the iterative scaling computation under all circumstances). All of these preprocessing steps make a maximum entropy method of selectivity estimation produce a correct cardinality model, for any kind of query with conjuncts of predicates. In addition, the preprocessing steps can also be used in conjunction with prior art methods for building a cardinality model.
摘要翻译：本发明提供了一种选择性估计方法，其中预处理步骤提高了估计的可行性和效率。预处理步骤是分区（使迭代缩放估计在甚至大量谓词的合理时间内终止），强制分区（在没有“自然”分区的情况下启用分区），通过查找谓词子集来创建分区对整体解决方案影响最小）; 不一致性解决（为了确保总是有正确可行的解决方案），并暗示零消除（以确保在任何情况下迭代缩放计算的收敛）。所有这些预处理步骤使得选择性估计的最大熵方法产生正确的基数模型，用于具有谓词结合的任何类型的查询。此外，预处理步骤还可以与用于构建基数模型的现有技术方法结合使用。

10. 发明申请

US20080222092A1 AUTOMATICALLY DETERMINING OPTIMIZATION FREQUENCIES OF QUERIES WITH PARAMETER MARKERS 失效
标题翻译：用参数标记自动确定优化优化频率
公开(公告)号：US20080222092A1
公开(公告)日：2008-09-11
申请号：US12125146
申请日：2008-05-22
申请人： Fabian Hueske , Volker Gerhard Markl
发明人： Fabian Hueske , Volker Gerhard Markl
IPC分类号： G06F17/30
CPC分类号： G06F17/30463 , G06F17/30306
摘要： A method and system for automatically determining optimization frequencies of queries having one or more parameter markers. Execution plans for a query are generated and each plan is associated with one or more bind value sets. An optimization frequency is selected based on differences between pairs of execution costs where one execution cost of a pair is a cost of executing the query with a bind value set via a first execution plan and the other execution cost of the pair is a cost of optimally executing the query with the bind value set via a second execution plan. The differences are based on maximum selectivity or cardinality distances associated with the bind value sets. If none of the differences exceeds a predefined value, the query is optimized once. If at least one of the differences exceeds the predefined value, the query is reoptimized each time the query is executed.
摘要翻译：一种用于自动确定具有一个或多个参数标记的查询的优化频率的方法和系统。生成查询的执行计划，并将每个计划与一个或多个绑定值集相关联。基于执行成本对之间的差异来选择优化频率，其中一对的执行成本是通过经由第一执行计划设置的绑定值执行查询的成本，并且该对的另一个执行成本是最佳的成本通过第二个执行计划执行具有设置的绑定值的查询。差异基于与绑定值集相关联的最大选择性或基数距离。如果没有任何差异超过预定义值，则查询优化一次。如果差异中的至少一个超过了预定义的值，则每次执行查询时都会重新优化查询。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式