SLICING RELATIONAL QUERIES USING SPOOL OPERATORS
    1.
    发明申请
    SLICING RELATIONAL QUERIES USING SPOOL OPERATORS 审中-公开
    使用SPOOL操作员的关联关系查询

    公开(公告)号:US20110313999A1

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

    申请号:US12817511

    申请日:2010-06-17

    IPC分类号: G06F17/30

    CPC分类号: G06F16/24537 G06F16/24542

    摘要: A relational database server may concurrently execute many relational queries, but a complex relational query may cause performance delays in the fulfillment of other relational queries. Instead, the relational database server may generate a query plan for the relational query, and may endeavor to partition the relational query between a spool operator and a scan operator into two or more query slices, where each query slice may be executed within a query slice threshold. Many alternative candidate query plans may be considered, such as inserting spool and scan operators after various operators and parameterizing operators in order to partition the records of a relation into two or more ranges based on an attribute of the relation. A large search space of candidate query plans may be reviewed in order to select a query plan that respects the query slice threshold while efficiently executing the logic of the relational query.

    摘要翻译: 关系数据库服务器可以同时执行许多关系查询,但是复杂的关系查询可能导致履行其他关系查询的性能延迟。 相反,关系数据库服务器可以生成关系查询的查询计划,并且可以尝试将线程运算符和扫描运算符之间的关系查询划分成两个或更多个查询片段,其中每个查询片段可以在查询片段内执行 阈。 可以考虑许多备选候选查询计划,例如在各种运算符和参数化运算符之后插入假脱机和扫描运算符,以便基于关系的属性将关系的记录分成两个或更多个范围。 可以检查候选查询计划的大搜索空间,以便在有效执行关系查询的逻辑的同时选择尊重查询片段阈值的查询计划。

    FLEXIBLE QUERY HINTS IN A RELATIONAL DATABASE
    2.
    发明申请
    FLEXIBLE QUERY HINTS IN A RELATIONAL DATABASE 有权
    相关数据库中的灵活查询

    公开(公告)号:US20100250518A1

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

    申请号:US12413544

    申请日:2009-03-28

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30386

    摘要: A flexible query hints system and method for discovering and expressing query hints in a database management system. Embodiments of the flexible query hints system and method include a power hints (Phints) language that enables the specification of constraints to influence a query optimizer. Phints expressions are defined as tree patterns annotated with constraints. Embodiments of the flexible query hints system and method also include techniques to incorporate the power hints language expressions into an extended query optimizer. Theses techniques include computing a directed acyclic graph for Phints expression, deriving candidate matches using the Phints expression and the graph, computing candidate matches, and extracting a revised execution plan having a lowest cost and satisfying constraints of the Phints expression. Embodiments of the flexible query hints system and method include a flexible query hint user interface that allow users to interactively adjust query hints.

    摘要翻译: 灵活的查询提示系统和方法,用于在数据库管理系统中发现和表达查询提示。 灵活查询提示系统和方法的实施例包括能够指定约束来影响查询优化器的功率提示(Phints)语言。 Phints表达式定义为使用约束注释的树模式。 灵活查询提示系统和方法的实施例还包括将功能提示语言表达式并入到扩展查询优化器中的技术。 这些技术包括计算用于Phints表达的有向非循环图,使用Phints表达式和图形导出候选匹配,计算候选匹配,以及提取具有最低成本并满足Phints表达式的约束的经修订的执行计划。 灵活查询提示系统和方法的实施例包括灵活的查询提示用户界面,允许用户交互地调整查询提示。

    Flexible query hints in a relational database
    3.
    发明授权
    Flexible query hints in a relational database 有权
    关系数据库中的灵活查询提示

    公开(公告)号:US08190595B2

    公开(公告)日:2012-05-29

    申请号:US12413544

    申请日:2009-03-28

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30386

    摘要: A flexible query hints system and method for discovering and expressing query hints in a database management system. Embodiments of the flexible query hints system and method include a power hints (Phints) language that enables the specification of constraints to influence a query optimizer. Phints expressions are defined as tree patterns annotated with constraints. Embodiments of the flexible query hints system and method also include techniques to incorporate the power hints language expressions into an extended query optimizer. Theses techniques include computing a directed acyclic graph for Phints expression, deriving candidate matches using the Phints expression and the graph, computing candidate matches, and extracting a revised execution plan having a lowest cost and satisfying constraints of the Phints expression. Embodiments of the flexible query hints system and method include a flexible query hint user interface that allow users to interactively adjust query hints.

    摘要翻译: 灵活的查询提示系统和方法,用于在数据库管理系统中发现和表达查询提示。 灵活查询提示系统和方法的实施例包括能够指定约束来影响查询优化器的功率提示(Phints)语言。 Phints表达式定义为使用约束注释的树模式。 灵活查询提示系统和方法的实施例还包括将功能提示语言表达式并入到扩展查询优化器中的技术。 这些技术包括计算用于Phints表达的有向非循环图,使用Phints表达式和图形导出候选匹配,计算候选匹配,以及提取具有最低成本并满足Phints表达式的约束的经修订的执行计划。 灵活查询提示系统和方法的实施例包括灵活的查询提示用户界面,允许用户交互地调整查询提示。

    INTEGRATED FUZZY JOINS IN DATABASE MANAGEMENT SYSTEMS
    4.
    发明申请
    INTEGRATED FUZZY JOINS IN DATABASE MANAGEMENT SYSTEMS 有权
    数据库管理系统中的集成FUZZY JOINS

    公开(公告)号:US20130091120A1

    公开(公告)日:2013-04-11

    申请号:US13253315

    申请日:2011-10-05

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30303 G06F17/30533

    摘要: A fuzzy joins system that is integrated in a database system generates fuzzy joins between records from two datasets. The fuzzy joins system includes a tokenizer to generate tokens for data records and a transformer to find transforms for the tokens. The fuzzy joins system invokes a signature generator, running within a runtime layer of the database system, to generate signatures for data records based on the tokens and their transforms. Subsequently, an equi-join operation joins the records from the two datasets with at least one equal signature. A similarity calculator, running within a runtime layer of the database system, computes a similarity measure using the token information of the joined records. If the similarity measure for any two records is above a threshold, the fuzzy joins system generates a fuzzy join between such two records.

    摘要翻译: 集成在数据库系统中的模糊连接系统在两个数据集的记录之间生成模糊连接。 模糊连接系统包括一个用于生成数据记录令牌的标记器和一个用于为令牌找到变换的变压器。 模糊连接系统调用在数据库系统的运行时层内运行的签名生成器,以基于令牌及其转换生成用于数据记录的签名。 随后,等连接操作将来自两个数据集的记录与至少一个相等的签名相连。 在数据库系统的运行时层内运行的相似度计算器使用所连接的记录的令牌信息来计算相似性度量。 如果任何两个记录的相似性度量高于阈值,则模糊连接系统在这两个记录之间生成模糊连接。

    Integrated fuzzy joins in database management systems
    5.
    发明授权
    Integrated fuzzy joins in database management systems 有权
    在数据库管理系统中集成模糊连接

    公开(公告)号:US09317544B2

    公开(公告)日:2016-04-19

    申请号:US13253315

    申请日:2011-10-05

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30303 G06F17/30533

    摘要: A fuzzy joins system that is integrated in a database system generates fuzzy joins between records from two datasets. The fuzzy joins system includes a tokenizer to generate tokens for data records and a transformer to find transforms for the tokens. The fuzzy joins system invokes a signature generator, running within a runtime layer of the database system, to generate signatures for data records based on the tokens and their transforms. Subsequently, an equi-join operation joins the records from the two datasets with at least one equal signature. A similarity calculator, running within a runtime layer of the database system, computes a similarity measure using the token information of the joined records. If the similarity measure for any two records is above a threshold, the fuzzy joins system generates a fuzzy join between such two records.

    摘要翻译: 集成在数据库系统中的模糊连接系统在两个数据集的记录之间生成模糊连接。 模糊连接系统包括一个用于生成数据记录令牌的标记器和一个用于为令牌找到变换的变压器。 模糊连接系统调用在数据库系统的运行时层内运行的签名生成器,以基于令牌及其变换生成用于数据记录的签名。 随后,等连接操作将来自两个数据集的记录与至少一个相等的签名相连。 在数据库系统的运行时层内运行的相似度计算器使用所连接的记录的令牌信息来计算相似性度量。 如果任何两个记录的相似性度量高于阈值,则模糊连接系统在这两个记录之间生成模糊连接。

    Performance service level agreements in multi-tenant database systems
    6.
    发明授权
    Performance service level agreements in multi-tenant database systems 有权
    多租户数据库系统中的性能服务级别协议

    公开(公告)号:US09311376B2

    公开(公告)日:2016-04-12

    申请号:US13461785

    申请日:2012-05-02

    IPC分类号: G06F17/30 H04L12/24 G06F11/34

    摘要: Various technologies described herein pertain to evaluating service provider compliance with terms of a performance service level agreement (SLA) for a tenant in a multi-tenant database system. The terms of the performance SLA can set a performance criterion as though a level of a resource of hardware of the multi-tenant database system is dedicated to the tenant. An actual performance metric of the resource can be tracked for a workload of the tenant. Further, a baseline performance metric of the resource can be determined for the workload of the tenant. The baseline performance metric can be based on a simulation as though the level of the resource as set in the performance SLA is dedicated to the workload of the tenant. Moreover, the actual performance metric can be compared with the baseline performance metric to evaluate compliance with the performance SLA.

    摘要翻译: 本文描述的各种技术涉及评估服务提供商遵守多租户数据库系统中租户的性能服务级别协议(SLA)的条款。 性能SLA的术语可以设置性能标准,就像多租户数据库系统的硬件资源的级别是专门用于租户一样。 可以为租户的工作负载跟踪资源的实际性能指标。 此外,可以为租户的工作量确定资源的基准绩效指标。 基准性能度量可以基于模拟,就像在性能SLA中设置的资源的级别专用于租户的工作量一样。 此外,可以将实际绩效指标与基准绩效指标进行比较,以评估是否符合绩效SLA。

    PERFORMANCE SERVICE LEVEL AGREEMENTS IN MULTI-TENANT DATABASE SYSTEMS
    7.
    发明申请
    PERFORMANCE SERVICE LEVEL AGREEMENTS IN MULTI-TENANT DATABASE SYSTEMS 有权
    多重数据库系统中的性能服务级别协议

    公开(公告)号:US20130297655A1

    公开(公告)日:2013-11-07

    申请号:US13461785

    申请日:2012-05-02

    IPC分类号: G06F7/00 G06F17/30

    摘要: Various technologies described herein pertain to evaluating service provider compliance with terms of a performance service level agreement (SLA) for a tenant in a multi-tenant database system. The terms of the performance SLA can set a performance criterion as though a level of a resource of hardware of the multi-tenant database system is dedicated to the tenant. An actual performance metric of the resource can be tracked for a workload of the tenant. Further, a baseline performance metric of the resource can be determined for the workload of the tenant. The baseline performance metric can be based on a simulation as though the level of the resource as set in the performance SLA is dedicated to the workload of the tenant. Moreover, the actual performance metric can be compared with the baseline performance metric to evaluate compliance with the performance SLA.

    摘要翻译: 本文描述的各种技术涉及评估服务提供商遵守多租户数据库系统中租户的性能服务级别协议(SLA)的条款。 性能SLA的术语可以设置性能标准,就像多租户数据库系统的硬件资源的级别是专门用于租户一样。 可以为租户的工作负载跟踪资源的实际性能指标。 此外,可以为租户的工作量确定资源的基准绩效指标。 基准性能度量可以基于模拟,就像在性能SLA中设置的资源的级别专用于租户的工作量一样。 此外,可以将实际绩效指标与基准绩效指标进行比较,以评估是否符合绩效SLA。

    TECHNIQUES FOR EXACT CARDINALITY QUERY OPTIMIZATION
    8.
    发明申请
    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.

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

    Techniques for estimating progress of database queries
    9.
    发明申请
    Techniques for estimating progress of database queries 有权
    估计数据库查询进度的技术

    公开(公告)号:US20060282404A1

    公开(公告)日:2006-12-14

    申请号:US11149968

    申请日:2005-06-10

    IPC分类号: G06F17/30

    摘要: Techniques for estimating the progress of database queries are described herein. In a first implementation, a respective lower-bound parameter is associated with each node in an operator tree that representing a given database query, and the progress of the database query at a given point is estimated based upon the lower-bound parameters. In a second implementation, the progress of the query is estimated by associating respective lower-bound and upper-bound parameters with each node in the operator tree. The progress of the query at the given point is then estimated based on the lower-bound and upper-bound parameters. The progress estimate is computed by dividing the work done so far by the sums of the above averages for each node in the tree.

    摘要翻译: 本文描述了用于估计数据库查询的进度的技术。 在第一实现中,相应的下限参数与表示给定数据库查询的运算符树中的每个节点相关联,并且基于下限参数来估计给定点处的数据库查询的进度。 在第二个实现中,通过将相应的下限和上限参数与运算符树中的每个节点相关联来估计查询的进度。 然后,基于下限和上限参数估计给定点处的查询进度。 进度估计是通过将迄今为止完成的工作除以树中每个节点的上述平均值的总和来计算的。

    Detecting estimation errors in dictinct page counts
    10.
    发明授权
    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.

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