Transformation rule profiling for a query optimizer
    1.
    发明授权
    Transformation rule profiling for a query optimizer 有权
    用于查询优化器的转换规则概要分析

    公开(公告)号:US08332388B2

    公开(公告)日:2012-12-11

    申请号:US12818237

    申请日:2010-06-18

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30463

    摘要: Technology is described for transformation rule profiling for a query optimizer. The method can include obtaining a database query configured to be optimized by the query optimizer of a database system. An optimized query plan for the database query can be found using a host set of transformation rules. One transformation rule can be removed and checked at a time. Each transformation rule can be checked to determine whether the transformation rule affects an optimal query plan output. A test query plan can be generated after each transformation rule has been removed. The query optimizer can determine whether the test query plan is different than the optimized query plan in the absence of the removed transformation rule. An equivalent set of transformation rules can be created that includes transformation rules where the test query plan generated from the equivalent set of transformation rules is equivalent to the optimized plan.

    摘要翻译: 描述技术用于查询优化器的转换规则剖析。 该方法可以包括获得配置为由数据库系统的查询优化器优化的数据库查询。 可以使用主机转换规则集查找数据库查询的优化查询计划。 一次可以删除和检查一个转换规则。 可以检查每个变换规则以确定变换规则是否影响最优查询计划输出。 每个转换规则已被删除后,可以生成测试查询计划。 在没有删除的转换规则的情况下,查询优化器可以确定测试查询计划是否与优化的查询计划不同。 可以创建一组等效的转换规则,其中包括转换规则,其中从等效转换规则集生成的测试查询计划等同于优化的计划。

    TRANSFORMATION RULE PROFILING FOR A QUERY OPTIMIZER
    2.
    发明申请
    TRANSFORMATION RULE PROFILING FOR A QUERY OPTIMIZER 有权
    用于查询优化器的变换规则轮廓

    公开(公告)号:US20110314000A1

    公开(公告)日:2011-12-22

    申请号:US12818237

    申请日:2010-06-18

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30463

    摘要: Technology is described for transformation rule profiling for a query optimizer. The method can include obtaining a database query configured to be optimized by the query optimizer of a database system. An optimized query plan for the database query can be found using a host set of transformation rules. One transformation rule can be removed and checked at a time. Each transformation rule can be checked to determine whether the transformation rule affects an optimal query plan output. A test query plan can be generated after each transformation rule has been removed. The query optimizer can determine whether the test query plan is different than the optimized query plan in the absence of the removed transformation rule. An equivalent set of transformation rules can be created that includes transformation rules where the test query plan generated from the equivalent set of transformation rules is equivalent to the optimized plan.

    摘要翻译: 描述技术用于查询优化器的转换规则剖析。 该方法可以包括获得配置为由数据库系统的查询优化器优化的数据库查询。 可以使用主机转换规则集查找数据库查询的优化查询计划。 一次可以删除和检查一个转换规则。 可以检查每个变换规则以确定变换规则是否影响最优查询计划输出。 每个转换规则已被删除后,可以生成测试查询计划。 在没有删除的转换规则的情况下,查询优化器可以确定测试查询计划是否与优化的查询计划不同。 可以创建一组等效的转换规则,其中包括转换规则,其中从等效转换规则集生成的测试查询计划等同于优化的计划。

    TECHNIQUES FOR EXACT CARDINALITY QUERY OPTIMIZATION
    3.
    发明申请
    TECHNIQUES FOR EXACT CARDINALITY QUERY OPTIMIZATION 有权
    精确的CARDINALITY QUERY优化技术

    公开(公告)号:US20100235347A1

    公开(公告)日:2010-09-16

    申请号:US12404284

    申请日:2009-03-14

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30463

    摘要: An exact cardinality query optimization system and method for optimizing a query having a plurality of expressions to obtain a cardinality-optimal query execution plan for the query. Embodiments of the system and method use various techniques to shorten the time necessary to obtain the cardinality-optimal query execution plan, which contains the query execution plan when all cardinalities are exact. Embodiments of the system and method include a covering queries technique that leverages query execution feedback to obtain an unordered subset of relevant expressions for the query, an early termination technique that bounds the cardinality to determine whether the processing can be terminate before each of the expressions are executed, and an expressions ordering technique that finds an ordering of expressions that yields the greatest reduction in time to obtain the cardinality-optimal query execution plan.

    摘要翻译: 一种精确的基数查询优化系统和方法,用于优化具有多个表达式的查询,以获得查询的基数最优查询执行计划。 系统和方法的实施例使用各种技术来缩短获得基数优化查询执行计划所需的时间,当所有基数是精确的时,其包含查询执行计划。 该系统和方法的实施例包括利用查询执行反馈来获取查询的相关表达式的无序子集的覆盖查询技术,限制基数以确定处理是否可以在每个表达式之前终止的提前终止技术是 以及表达式排序技术,其找到产生最大时间缩短以获得基数优化查询执行计划的表达式的排序。

    Constructing database object workload summaries
    4.
    发明授权
    Constructing database object workload summaries 有权
    构建数据库对象工作量摘要

    公开(公告)号:US07299220B2

    公开(公告)日:2007-11-20

    申请号:US10815061

    申请日:2004-03-31

    IPC分类号: G06F17/30

    摘要: A database object summarization tool is provided that selects a subset of database objects subject to filtering constraints such as a partial order or optimization of some attribute. A dominance primitive filters out tuples that are dominated according to a partial order constraint by another tuple. A representation primitive selects a representative subset of tuples such than an optimization criteria is met.

    摘要翻译: 提供了一种数据库对象摘要工具,该工具选择受过滤约束(如某些属性的部分顺序或优化)的数据库对象的子集。 优势原语过滤掉由另一个元组根据部分顺序约束所主导的元组。 表示基元选择满足优化标准的元组的代表性子集。

    Database tuning advisor
    5.
    发明申请
    Database tuning advisor 审中-公开
    数据库调优顾问

    公开(公告)号:US20060085484A1

    公开(公告)日:2006-04-20

    申请号:US10966563

    申请日:2004-10-15

    IPC分类号: G06F17/30

    CPC分类号: G06F16/2282 G06F16/2272

    摘要: An automated physical database design tool may provide an integrated physical design recommendation for horizontal partitioning, indexes and indexed views, all three features being tuned together (in concert). Manageability requirements may be specified when optimizing for performance. User-specified configuration may enable the specification of a partial physical design without materialization of the physical design. The tuning process may be performed for a production server but may be conducted substantially on a test server. Secondary indexes may be suggested for XML columns. Tuning of a database may be invoked by any owner of a database. Usage of objects may be evaluated and a recommendation for dropping unused objects may be issued. Reports may be provided concerning the count and percentage of queries in the workload that reference a particular database, and/or the count and percentage of queries in the workload that reference a particular table or column. A feature may be provided whereby a weight may be associated with each statement in the workload, enabling relative importance of particular statements to be specified. An in-row length for a column may be specified. If a value for the column exceeds the specified in-row length for that column, the portion of the value not exceeding the specified in-row length may be stored in the row while the portion of the value exceeding the specified in-row length may be stored in an overflow area. Rebuild and reorganization recommendations may be generated.

    摘要翻译: 自动化物理数据库设计工具可以为水平划分,索引和索引视图提供集成的物理设计建议,所有这三个特征被一起调谐(一致)。 在优化性能时可以指定可管理性要求。 用户指定的配置可以实现部分物理设计的规范,而不会实现物理设计。 可以对生产服务器执行调整过程,但是可以基本上在测试服务器上进行。 可以针对XML列建议辅助索引。 数据库的任何拥有者都可以调用数据库。 可以评估对象的使用,并且可以发出用于丢弃未使用对象的建议。 可以提供关于引用特定数据库的工作负载中的查询的计数和百分比的报告,和/或引用特定表或列的工作负载中的查询的计数和百分比。 可以提供特征,其中权重可以与工作负载中的每个语句相关联,使得能够指定特定语句的相对重要性。 可以指定列的行内长度。 如果列的值超过该列的指定行内长度,则不超过指定行内长度的部分可能存储在行中,而超出指定行内长度的值的部分可能会 存储在溢出区域。 可能会生成重建和重组建议。

    Sampling for queries
    6.
    发明申请
    Sampling for queries 有权
    查询抽样

    公开(公告)号:US20060085410A1

    公开(公告)日:2006-04-20

    申请号:US11296036

    申请日:2005-12-07

    IPC分类号: G06F17/30

    摘要: A method of estimating the Results of a database query are estimated by performing a sampling of weighted tuples in a database based on a probability of usage of tuples required in executing a workload. A probability is associated with each tuple sampled. And, can aggregate is computed over values in each sampled tuple while multiplying by the inverses of the probabilities associated with each tuple sampled.

    摘要翻译: 通过基于执行工作负载所需的元组的使用概率,对数据库中的加权元组进行抽样来估计估计数据库查询结果的方法。 每个元组采样的概率相关。 并且,可以在每个采样的元组中的值上计算可以聚合,同时乘以与每个元组采样相关联的概率的逆。

    Detecting estimation errors in dictinct page counts
    9.
    发明授权
    Detecting estimation errors in dictinct page counts 有权
    检测特定页数中的估计误差

    公开(公告)号:US07958114B2

    公开(公告)日:2011-06-07

    申请号:US12098178

    申请日:2008-04-04

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30306 G06Q30/0202

    摘要: A database server may be configured to compute distinct page counts of pages accessed to execute operands of respective queries. The queries may be executed against a table comprised of the pages and having an index managed by the database server. The distinct page counts may be obtained by counting, as a part of the executing of the queries, distinct pages accessed during the execution of the queries.

    摘要翻译: 数据库服务器可以被配置为计算被访问的页面的不同页面计数以执行各个查询的操作数。 可以针对由该页组成的表并且具有由数据库服务器管理的索引来执行查询。 独立页面计数可以通过在执行查询期间计数访问的不同页面作为执行查询的一部分来获得。

    Sampling for database systems
    10.
    发明授权
    Sampling for database systems 失效
    数据库系统的抽样

    公开(公告)号:US07567949B2

    公开(公告)日:2009-07-28

    申请号:US10238175

    申请日:2002-09-10

    IPC分类号: G06F17/30 G06F7/00

    摘要: A database server supports weighted and unweighted sampling of records or tuples in accordance with desired sampling semantics such as with replacement (WR), without replacement (WoR), or independent coin flips (CF) semantics, for example. The database server may perform such sampling sequentially not only to sample non-materialized records, such as those produced as a stream by a pipeline in a query tree for example, but also to sample records, whether materialized or not, in a single pass. The database server also supports sampling over a join of two relations of records or tuples without requiring the computation of the full join and without requiring the materialization of both relations and/or indexes on the join attribute values of both relations.

    摘要翻译: 数据库服务器根据期望的抽样语义(例如替换(WR),无替换(WoR)或独立硬币翻转(CF))语义支持对记录或元组进行加权和未加权采样。 数据库服务器可以顺序地执行这样的采样,以便例如非查询记录例如在查询树中由流水线生成的非实体记录,但是也可以在一次通过中对采样记录(无论是否实现)进行采样。 数据库服务器还支持对两个记录或元组关系的连接进行抽样,而不需要计算完整连接,而不需要在关系的连接属性值上实现关系和/或索引。