公开(公告)号：US06763359B2

公开(公告)日：2004-07-13

申请号：US09876642

申请日：2001-06-06

申请人： Guy Maring Lohman ,  Michael Stillger ,  Volker Markl

发明人： Guy Maring Lohman ,  Michael Stillger ,  Volker Markl

IPC分类号： G06F1730

CPC分类号： G06F17/30474 ,  G06F17/30469 ,  G06F17/30471 ,  Y10S707/954 ,  Y10S707/99932 ,  Y10S707/99943

摘要： An optimizer function of a Relational Database Management System (RDBMS) generates alternative query execution plans (QEPs) for executing a query, provides an execution model of each of the QEPs, chooses one of the QEPs for execution based on the model associated therewith, and exploits an empirical measurement from the execution of the chosen QEP to validate the model associated therewith, by determining whether the model is in error, and by computing one or more adjustments to the model to correct the determined error.

摘要翻译： 关系数据库管理系统（RDBMS）的优化器功能生成用于执行查询的替代查询执行计划（QEP），提供每个QEP的执行模型，根据与其相关联的模型选择一个用于执行的QEP，以及 通过确定模型是否有错误，并且通过计算对模型的一个或多个调整以校正所确定的误差，利用来自执行所选择的QEP的经验测量来验证与其相关联的模型。

公开(公告)号：US07925646B2

公开(公告)日：2011-04-12

申请号：US12032838

申请日：2008-02-18

申请人： Dengfeng Gao ,  Ihab F. Ilyas ,  Eileen Tien Lin ,  Guy Maring Lohman ,  Jun Rao

发明人： Dengfeng Gao ,  Ihab F. Ilyas ,  Eileen Tien Lin ,  Guy Maring Lohman ,  Jun Rao

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30471 ,  Y10S707/99934 ,  Y10S707/99935

摘要： A compilation time estimator provides a quantified estimate of the optimizer compilation time for a given query optimizer. The estimator automates the optimizer to choose the right level of optimization in commercial database systems. The estimator reuses an optimizer's join enumerator to obtain actual number of joins, but bypasses plan generation to save estimation overhead, and maintains a small number of interesting physical properties to estimate the number of plans by using a linear regression model. The estimator uses the number of generated plans to estimate query compilation time.

摘要翻译： 编译时间估计器提供给定查询优化器的优化器编译时间的量化估计。 估计器自动优化器在商业数据库系统中选择合适的优化级别。 估计器重用优化器的连接枚举器来获取实际的连接数，但绕过计划生成以节省估计开销，并保留少量有趣的物理属性以通过使用线性回归模型来估计计划数。 估计器使用生成计划的数量来估计查询编译时间。

公开(公告)号：US20100257151A1

公开(公告)日：2010-10-07

申请号：US12416208

申请日：2009-04-01

申请人： Guy Maring Lohman ,  Lin Qiao ,  Sandeep Tata

发明人： Guy Maring Lohman ,  Lin Qiao ,  Sandeep Tata

IPC分类号： G06F17/30

CPC分类号： G06Q10/06 ,  G06F17/30321 ,  G06F17/3056

摘要： A common interface to manage heterogeneous databases and develop enterprise class applications is provided. In particular, it is shown that a client-based system and method can: (a) provide a uniform interface for the DBA or the application developer to use across all the database deployments, (b) provide flexibility in the number and kinds of scenarios it can be used, and finally (c) reduce the total cost of ownership for the enterprise.

摘要翻译： 提供了管理异构数据库和开发企业级应用程序的通用界面。 特别地，显示基于客户端的系统和方法可以：（a）为DBA或应用程序开发人员提供统一的接口，以便在所有数据库部署中使用，（b）在场景数量和种类方面提供灵活性 可以使用，最后（c）降低企业的总体拥有成本。

公开(公告)号：US07636735B2

公开(公告)日：2009-12-22

申请号：US11206978

申请日：2005-08-19

申请人： Peter Jay Haas ,  Vanja Josifovski ,  Guy Maring Lohman ,  Chun Zhang

发明人： Peter Jay Haas ,  Vanja Josifovski ,  Guy Maring Lohman ,  Chun Zhang

IPC分类号： G06F17/30

CPC分类号： G06F17/30935 ,  Y10S707/99932 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99945 ,  Y10S707/99948

摘要： Provided is a method for modeling the cost of XML as well as relational operators. As with traditional relational cost estimation, a set of system catalog statistics that summarizes the XML data is exploited; however, the novel use of a set of simple path statistics is also proposed. A new statistical learning technique called transform regression is utilized instead of detailed analytical models to predict the overall cost of an operator. Additionally, a query optimizer in a database is enabled to be self-tuning, automatically adapting to changes over time in the query workload and in the system environment.

摘要翻译： 提供了一种用于建模XML成本以及关系运算符的方法。 与传统的关系成本估算一样，利用了一套总结XML数据的系统目录统计数据; 然而，还提出了一组简单路径统计学的新颖使用。 使用称为变换回归的新的统计学习技术，而不是详细的分析模型来预测运营商的整体成本。 另外，数据库中的查询优化器可以自我调整，自动适应查询工作负载和系统环境中随时间的变化。

公开(公告)号：US20080177722A1

公开(公告)日：2008-07-24

申请号：US11940185

申请日：2007-11-14

申请人： Guy Maring Lohman ,  Marki Volker ,  Mir Hamid Pirahesh ,  Vijayshankar Raman ,  David Everett Simmen

发明人： Guy Maring Lohman ,  Marki Volker ,  Mir Hamid Pirahesh ,  Vijayshankar Raman ,  David Everett Simmen

IPC分类号： G06F17/30

CPC分类号： G06F17/30979 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935

摘要： A method, system, and computer program product to make query processing more robust in the face of optimization errors. The invention validates the statistics and assumptions used for compiling a query as the query is executed and, when necessary, progressively re-optimizes the query in mid-execution based on the knowledge learned during its partial execution. The invention selectively places a number of CHECK operators in a query execution plan to validate the optimizer's cardinality estimates against actual cardinalities. Errors beyond a threshold trigger re-optimization, and the optimizer decides whether the old plan is still optimal and whether to re-use previously computed results. The invention addresses arbitrary SQL queries whose plans can contain sub-queries, updates, trigger checking, and view maintenance operations. The invention can handle concurrent update transactions or updates of common sub-expressions in a query execution plan without compromising consistency and isolation as locking information is tied to the record ID.

摘要翻译： 一种方法，系统和计算机程序产品，使查询处理在面对优化错误时更加鲁棒。 本发明验证了在执行查询时用于编译查询的统计和假设，并且在必要时，根据在其部分执行期间学到的知识，在中间执行中逐渐重新优化查询。 本发明选择性地将多个CHECK运算符放置在查询执行计划中以根据实际基数验证优化器的基数估计。 超出阈值的错误触发重新优化，优化器决定旧计划是否仍然最优，以及是否重新使用先前计算的结果。 本发明解决任意SQL查询，其计划可以包含子查询，更新，触发器检查和查看维护操作。 本发明可以处理查询执行计划中的并发更新事务或公用子表达式的更新，而不会在锁定信息与记录ID相关联的情况下不影响一致性和隔离。

公开(公告)号：US07716215B2

公开(公告)日：2010-05-11

申请号：US11940185

申请日：2007-11-14

申请人： Guy Maring Lohman ,  Marki Volker ,  Mir Hamid Pirahesh ,  Vijayshankar Raman ,  David Everett Simmen

发明人： Guy Maring Lohman ,  Marki Volker ,  Mir Hamid Pirahesh ,  Vijayshankar Raman ,  David Everett Simmen

IPC分类号： G06F7/00

CPC分类号： G06F17/30979 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935

摘要： A method, system, and computer program product to make query processing more robust in the face of optimization errors. The invention validates the statistics and assumptions used for compiling a query as the query is executed and, when necessary, progressively re-optimizes the query in mid-execution based on the knowledge learned during its partial execution. The invention selectively places a number of CHECK operators in a query execution plan to validate the optimizer's cardinality estimates against actual cardinalities. Errors beyond a threshold trigger re-optimization, and the optimizer decides whether the old plan is still optimal and whether to re-use previously computed results. The invention addresses arbitrary SQL queries whose plans can contain sub-queries, updates, trigger checking, and view maintenance operations. The invention can handle concurrent update transactions or updates of common sub-expressions in a query execution plan without compromising consistency and isolation as locking information is tied to the record ID.

摘要翻译： 一种方法，系统和计算机程序产品，使查询处理在面对优化错误时更加鲁棒。 本发明验证了在执行查询时用于编译查询的统计和假设，并且在必要时，根据在其部分执行期间学到的知识逐渐重新优化中间执行中的查询。 本发明选择性地将多个CHECK运算符放置在查询执行计划中以根据实际基数验证优化器的基数估计。 超出阈值的错误触发重新优化，优化器决定旧计划是否仍然最优，以及是否重新使用先前计算的结果。 本发明解决任意SQL查询，其计划可以包含子查询，更新，触发器检查和查看维护操作。 本发明可以处理查询执行计划中的并发更新事务或公用子表达式的更新，而不会在锁定信息与记录ID相关联的情况下不影响一致性和隔离。

公开(公告)号：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.

摘要翻译： 提供了一种通过早期实现来预测查询执行的方法。 该方法处理查询执行计划中基数误判的问题，预先执行查询执行计划的子计划，并对这些子计划的输出进行统计。 如果需要，在优化和执行查询的其余部分之前，根据这些统计信息更改整体查询执行计划。

公开(公告)号：US07383246B2

公开(公告)日：2008-06-03

申请号：US10698828

申请日：2003-10-31

申请人： Guy Maring Lohman ,  Marki Volker ,  Mir Hamid Pirahesh ,  Vijayshankar Raman ,  David Everett Simmen

发明人： Guy Maring Lohman ,  Marki Volker ,  Mir Hamid Pirahesh ,  Vijayshankar Raman ,  David Everett Simmen

IPC分类号： G06F17/30

CPC分类号： G06F17/30979 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935

摘要： A method, system, and computer program product to make query processing more robust in the face of optimization errors. The invention validates the statistics and assumptions used for compiling a query as the query is executed and, when necessary, progressively re-optimizes the query in mid-execution based on the knowledge learned during its partial execution. The invention selectively places a number of CHECK operators in a query execution plan to validate the optimizer's cardinality estimates against actual cardinalities. Errors beyond a threshold trigger re-optimization, and the optimizer decides whether the old plan is still optimal and whether to re-use previously computed results. The invention addresses arbitrary SQL queries whose plans can contain sub-queries, updates, trigger checking, and view maintenance operations. The invention can handle concurrent update transactions or updates of common sub-expressions in a query execution plan without compromising consistency and isolation as locking information is tied to the record ID.

摘要翻译： 一种方法，系统和计算机程序产品，使查询处理在面对优化错误时更加鲁棒。 本发明验证了在执行查询时用于编译查询的统计和假设，并且在必要时，根据在其部分执行期间学到的知识，在中间执行中逐渐重新优化查询。 本发明选择性地将多个CHECK运算符放置在查询执行计划中以根据实际基数验证优化器的基数估计。 超出阈值的错误触发重新优化，优化器决定旧计划是否仍然最优，以及是否重新使用先前计算的结果。 本发明解决任意SQL查询，其计划可以包含子查询，更新，触发器检查和查看维护操作。 本发明可以处理查询执行计划中的并发更新事务或公用子表达式的更新，而不会在锁定信息与记录ID相关联的情况下不影响一致性和隔离。

公开(公告)号：US07111025B2

公开(公告)日：2006-09-19

申请号：US10427345

申请日：2003-04-30

申请人： Ian Richard Finlay ,  Guy Maring Lohman

发明人： Ian Richard Finlay ,  Guy Maring Lohman

IPC分类号： G06F17/30

CPC分类号： G06F17/30595 ,  G06F17/30321 ,  G06F17/30498 ,  Y10S707/99942 ,  Y10S707/99954

摘要： An information retrieval system is adapted to process a query having an associated plan that includes applying predicates comprising local predicates and a join predicate, to at least two tables. Index ANDing is used to construct a filter for filtering a first of the tables in accordance with the local predicates. The join predicate is applied to the tables for determining row identifiers of rows satisfying the join predicate. The row identifiers are used to probe the filter for determining whether the rows satisfying the join predicate also satisfy the local predicates. The rows that satisfy both the join and local predicates are fetched and the join predicate is completed. Results of the join predicate are then returned.

摘要翻译： 信息检索系统适于处理具有相关联的计划的查询，其包括将包括本地谓词和连接谓词的谓词应用于至少两个表。 索引ANDing用于构造一个过滤器，用于根据本地谓词过滤第一个表。 连接谓词适用于确定满足连接谓词的行的行标识符的表。 行标识符用于探测过滤器，以确定满足连接谓词的行是否也满足本地谓词。 满足连接和本地谓词的行被取出，并且连接谓词已完成。 然后返回连接谓词的结果。

公开(公告)号：US6092062A

公开(公告)日：2000-07-18

申请号：US885073

申请日：1997-06-30

申请人： Guy Maring Lohman ,  Eugene Jon Shekita ,  David E. Simmen ,  Monica Sachiye Urata

发明人： Guy Maring Lohman ,  Eugene Jon Shekita ,  David E. Simmen ,  Monica Sachiye Urata

IPC分类号： G06F17/30

CPC分类号： G06F17/30463 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99944

摘要： A relational data base management system includes a query processor that uses a query operator partition property to perform QEP pruning and to ensure that data input to a query operator is partitioned appropriately for the operation. The partition property indicates the group of network nodes across which a table is distributed. The query processor also makes use of partition classes that are designated "interesting classes" to perform preoptimization planning and query pruning, and to perform look-ahead partitioning based on partition classes that are identified as being of interest to future operations, thereby more efficiently evaluating complex query statements in an MPP, shared-nothing environment.

摘要翻译： 关系数据库管理系统包括一个查询处理器，该查询处理器使用查询运算符分区属性执行QEP修剪，并确保输入到查询运算符的数据被适当地分配给操作。 分区属性指示分配表的网络节点组。 查询处理器还利用被指定为“有趣类”的分区类来执行优化前规划和查询修剪，并且基于被识别为未来操作感兴趣的分区类执行先行分区，从而更有效地评估 MPP中的复杂查询语句，无共享环境。