公开(公告)号：US20090327214A1

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

申请号：US12146423

申请日：2008-06-25

申请人： Andrew S. Richardson ,  Campbell Bryce Fraser ,  Cesar A. Galindo-Legaria ,  Torsten W. Grabs ,  Wei Yu ,  Milind M. Joshi

发明人： Andrew S. Richardson ,  Campbell Bryce Fraser ,  Cesar A. Galindo-Legaria ,  Torsten W. Grabs ,  Wei Yu ,  Milind M. Joshi

IPC分类号： G06F17/30

CPC分类号： G06F16/24545

摘要： Described is a query optimizer comprising a query tuner that performs actual execution of query fragments to obtain actual results during compilation time, and uses those actual results to select a query plan. The actual results may be combined with estimates for fragments that were not executed. The tree may be traversed in a top-down traversal, processing every node. Alternatively, the tree may be traversed in a bottom-up traversal, re-deriving data for higher nodes as each lower level is completed. A limit, such as a time limit or level limit, may be used to control how much time is taken to determine the execution plan.

摘要翻译： 描述了一种查询优化器，其包括执行查询片段的实际执行以在编译期间获得实际结果的查询调谐器，并且使用这些实际结果来选择查询计划。 实际结果可能与未执行的片段的估计相结合。 可以在上下遍历中遍历树，处理每个节点。 或者，可以在自下而上遍历中遍历树，在每个较低级完成时，重新导出较高节点的数据。 可以使用诸如时间限制或级别限制的限制来控制用于确定执行计划的时间。

公开(公告)号：US10983998B2

公开(公告)日：2021-04-20

申请号：US12146423

申请日：2008-06-25

申请人： Andrew S. Richardson ,  Campbell Bryce Fraser ,  Cesar A. Galindo-Legaría ,  Torsten W. Grabs ,  Wei Yu ,  Milind M. Joshi

发明人： Andrew S. Richardson ,  Campbell Bryce Fraser ,  Cesar A. Galindo-Legaría ,  Torsten W. Grabs ,  Wei Yu ,  Milind M. Joshi

IPC分类号： G06F16/30 ,  G06F16/2453

摘要： Described is a query optimizer comprising a query tuner that performs actual execution of query fragments to obtain actual results during compilation time, and uses those actual results to select a query plan. The actual results may be combined with estimates for fragments that were not executed. The tree may be traversed in a top-down traversal, processing every node. Alternatively, the tree may be traversed in a bottom-up traversal, re-deriving data for higher nodes as each lower level is completed. A limit, such as a time limit or level limit, may be used to control how much time is taken to determine the execution plan.