会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明申请
    • Generating Queries Using Cardinality Constraints
    • 使用基数约束生成查询
    • US20070185851A1
    • 2007-08-09
    • US11275782
    • 2006-01-27
    • Nicolas BrunoSurajit ChaudhuriDilys Thomas
    • Nicolas BrunoSurajit ChaudhuriDilys Thomas
    • G06F17/30
    • G06F17/30424G06F17/30595
    • A query generation using cardinality constraints process including choosing a first set of parameters for a query, calculating an additional set of parameters based on the first set of parameters, executing the query using additional set of parameters, evaluating the cardinality error the additional set of parameters, and refining the additional set of parameters to meet the desired cardinality constraint. Creating a query and selecting parameters for the query to meet a desired cardinality constraint or set of cardinality constraints when the query is executed against a database may be difficult. A query generation using cardinality constraints process may create a set of parameters for a query which satisfies a desired cardinality constraint or set of cardinality constraints. An application of such a query generation using cardinality constraints process may be database component and code testing.
    • 使用基数约束过程的查询生成,包括选择用于查询的第一组参数,基于第一组参数计算附加参数集合,使用附加参数集执行查询,评估基数误差附加参数集 ,并且提炼额外的一组参数以满足期望的基数约束。 创建查询并选择参数,以便在针对数据库执行查询时难以满足所需的基数约束或基数约束集合。 使用基数约束过程的查询生成可以为满足期望的基数约束或一组基数约束的查询创建一组参数。 使用基数约束过程的这种查询生成的应用可以是数据库组件和代码测试。
    • 14. 发明授权
    • Flexible query hints in a relational database
    • 关系数据库中的灵活查询提示
    • US08190595B2
    • 2012-05-29
    • US12413544
    • 2009-03-28
    • Nicolas BrunoRavishankar RamamurthySurajit Chaudhuri
    • Nicolas BrunoRavishankar RamamurthySurajit Chaudhuri
    • G06F17/30
    • 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表达式的约束的经修订的执行计划。 灵活查询提示系统和方法的实施例包括灵活的查询提示用户界面,允许用户交互地调整查询提示。
    • 15. 发明申请
    • SLICING RELATIONAL QUERIES USING SPOOL OPERATORS
    • 使用SPOOL操作员的关联关系查询
    • US20110313999A1
    • 2011-12-22
    • US12817511
    • 2010-06-17
    • Nicolas BrunoRavishankar RamamurthySurajit ChaudhuriVivek Ravindranath Narasayya
    • Nicolas BrunoRavishankar RamamurthySurajit ChaudhuriVivek Ravindranath Narasayya
    • G06F17/30
    • G06F16/24537G06F16/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.
    • 关系数据库服务器可以同时执行许多关系查询,但是复杂的关系查询可能导致履行其他关系查询的性能延迟。 相反,关系数据库服务器可以生成关系查询的查询计划,并且可以尝试将线程运算符和扫描运算符之间的关系查询划分成两个或更多个查询片段,其中每个查询片段可以在查询片段内执行 阈。 可以考虑许多备选候选查询计划,例如在各种运算符和参数化运算符之后插入假脱机和扫描运算符,以便基于关系的属性将关系的记录分成两个或更多个范围。 可以检查候选查询计划的大搜索空间,以便在有效执行关系查询的逻辑的同时选择尊重查询片段阈值的查询计划。
    • 16. 发明授权
    • Database physical design refinement using a merge-reduce approach
    • 使用merge-reduce方法进行数据库物理设计细化
    • US07685145B2
    • 2010-03-23
    • US11391649
    • 2006-03-28
    • Nicolas BrunoSurajit Chaudhuri
    • Nicolas BrunoSurajit Chaudhuri
    • G06F7/00G06F17/00G06F12/00G06F17/30
    • G06F17/30312Y10S707/99942
    • Various embodiments are disclosed relating to database configuration refinement. In an example embodiment, a method is provided that may include determining a size limitation for a database configuration, determining a workload of the database configuration, and making a determination that a size of the database configuration is greater than a size limit. The method may also include applying either a merge process or a reduction process to decrease the size of the database configuration. The merge process may merge a first index/view with a second index/view to produce a merged index/view, for example. The reduction process may delete a first portion of a first view to produce a reduced view.
    • 公开了关于数据库配置细化的各种实施例。 在示例实施例中,提供了一种方法,其可以包括确定数据库配置的大小限制,确定数据库配置的工作负载,以及确定数据库配置的大小大于大小限制。 该方法还可以包括应用合并过程或缩减过程来减小数据库配置的大小。 例如,合并进程可以将第一索引/视图与第二索引/视图合并以产生合并的索引/视图。 缩小处理可以删除第一视图的第一部分以产生缩小视图。
    • 18. 发明申请
    • LIGHTWEIGHT PHYSICAL DESIGN ALERTER
    • 轻型物理设计报警器
    • US20080183644A1
    • 2008-07-31
    • US11669782
    • 2007-01-31
    • Nicolas BrunoSurajit Chaudhuri
    • Nicolas BrunoSurajit Chaudhuri
    • G06F15/18G06F12/00G06F13/00
    • G06F17/30306
    • A lightweight physical design alerter can analyze a workload and determine whether a comprehensive tuning session would result in a configuration improvement over the current configuration. The alerter provides a low-overhead procedure that can run during normal operation of a database management system and produce a notification if a current configuration is less than optimal. The alerter can report lower and upper bounds on the improvements that could be obtained if a comprehensive tuning tool is launched. A lower bound can be justified by generating feasible configurations. The disclosed embodiments can be extended to query updates, materialized views, and other physical design features (e.g., partitioning).
    • 轻量级物理设计报警器可以分析工作负载并确定综合调优会话是否会导致配置改进超过当前配置。 报警器提供了一个低开销的过程,可以在数据库管理系统的正常操作期间运行,并在当前配置不太适合的情况下产生通知。 报警器可以报告如果启动综合调整工具可以获得的改进的上下限。 可以通过生成可行的配置来证明下限。 所公开的实施例可以扩展到查询更新,物化视图和其他物理设计特征(例如,分区)。
    • 19. 发明授权
    • Method and apparatus for exploiting statistics on query expressions for optimization
    • 利用查询表达式进行统计优化的方法和装置
    • US07363289B2
    • 2008-04-22
    • US11177598
    • 2005-07-07
    • Surajit ChaudhuriNicolas Bruno
    • Surajit ChaudhuriNicolas Bruno
    • G06F17/30
    • G06F17/30463G06F17/30536Y10S707/99932Y10S707/99933Y10S707/99942Y10S707/99943Y10S707/99944Y10S707/99945
    • A method for evaluating a user query on a relational database having records stored therein, a workload made up of a set of queries that have been executed on the database, and a query optimizer that generates a query execution plan for the user query. Each query plan includes a plurality of intermediate query plan components that verify a subset of records from the database meeting query criteria. The method accesses the query plan and a set of stored intermediate statistics for records verified by query components, such as histograms that summarize the cardinality of the records that verify the query component. The method forms a transformed query plan based on the selected intermediate statistics (possibly by rewriting the query plan) and estimates the cardinality of the transformed query plan to arrive at a more accurate cardinality estimate for the query. If additional intermediate statistics are necessary, a pool of intermediate statistics may be generated based on the queries in the workload by evaluating the benefit of a given statistic over the workload and adding intermediate statistics to the pool that provide relatively great benefit.
    • 一种用于评估具有存储在其中的记录的关系数据库的用户查询的方法,由在数据库上执行的一组查询组成的工作负载以及生成用户查询的查询执行计划的查询优化器。 每个查询计划包括多个中间查询计划组件,其从数据库会议查询条件验证记录的子集。 该方法访问查询计划和一组存储的中间统计信息,用于查询组件验证的记录,例如总结验证查询组件的记录的基数的直方图。 该方法基于所选择的中间统计(可能通过重写查询计划)形成转换的查询计划,并且估计转换后的查询计划的基数以得到查询的更准确的基数估计。 如果需要额外的中间统计数据,则可以根据工作负载中的查询生成中间统计数据池,方法是评估给定统计量对工作负载的好处,并将中间统计信息添加到提供相对较大收益的池中。