利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

33 条记录 (耗时 0.025 秒)

    AUTOMATICALLY AND ADAPTIVELY DETERMINING EXECUTION PLANS FOR QUERIES WITH PARAMETER MARKERS
    2.
    发明申请
    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.

    摘要翻译： 一种用于自动和自适应地确定参数查询的查询执行计划的方法和系统。 产生由初始训练点训练的第一分类器。 动态更新查询工作负载和/或数据库统计信息。 离线收集了一套新的培训点。 使用新的一组训练点，第一个分类器被修改为第二个分类器。 在离线阶段之后的运行时间接收数据库查询。 该查询包括具有绑定到实际值的参数标记的谓词。 谓词与选择性相关联。 将选择性映射到计划中确定查询执行计划。 确定的查询执行计划被包括在增强的训练点集合中，其中增强集合包括初始集合和新集合。

    Automatically and adaptively determining execution plans for queries with parameter markers
    3.
    发明授权
    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.

    摘要翻译： 一种用于自动和自适应地确定参数查询的查询执行计划的方法和系统。 产生由初始训练点训练的第一分类器。 动态更新查询工作负载和/或数据库统计信息。 离线收集了一套新的培训点。 使用新的一组训练点，第一个分类器被修改为第二个分类器。 在离线阶段之后的运行时间接收数据库查询。 该查询包括具有绑定到实际值的参数标记的谓词。 谓词与选择性相关联。 将选择性映射到计划中确定查询执行计划。 确定的查询执行计划被包括在增强的训练点集合中，其中增强集合包括初始集合和新集合。

    AUTOMATICALLY AND ADAPTIVELY DETERMINING EXECUTION PLANS FOR QUERIES WITH PARAMETER MARKERS
    6.
    发明申请
    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获得的后验概率的最优平均值并将选择性映射到计划来确定。 确定的查询执行计划被包括在包括初始集合和新集合的增强的训练点集合中。

    SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR PROGRESSIVE QUERY PROCESSING
    7.
    发明申请
    SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR PROGRESSIVE QUERY PROCESSING 失效
    系统，方法和计算机程序产品进行查询处理

    公开(公告)号：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相关联的情况下不影响一致性和隔离。

    System, method, and computer program product for progressive query processing
    8.
    发明授权
    System, method, and computer program product for progressive query processing 失效
    系统，方法和计算机程序产品，用于逐行查询处理

    公开(公告)号：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相关联的情况下不影响一致性和隔离。

    System, method, and computer program product for progressive query processing
    9.
    发明授权
    System, method, and computer program product for progressive query processing 有权
    系统，方法和计算机程序产品，用于逐行查询处理

    公开(公告)号：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相关联的情况下不影响一致性和隔离。

    Estimating the compilation time of a query optimizer
    10.
    发明授权
    Estimating the compilation time of a query optimizer 有权
    估计查询优化器的编译时间

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

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