公开(公告)号：US07882121B2

公开(公告)日：2011-02-01

申请号：US11275782

申请日：2006-01-27

申请人： Nicolas Bruno ,  Surajit Chaudhuri ,  Dilys Thomas

发明人： Nicolas Bruno ,  Surajit Chaudhuri ,  Dilys Thomas

IPC分类号： G06F17/00

CPC分类号： G06F17/30424 ,  G06F17/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.

摘要翻译： 使用基数约束过程的查询生成，包括选择用于查询的第一组参数，基于第一组参数计算附加参数集合，使用附加参数集执行查询，评估基数误差附加参数集 ，并且提炼额外的一组参数以满足期望的基数约束。 创建查询并选择参数，以便在针对数据库执行查询时难以满足所需的基数约束或基数约束集合。 使用基数约束过程的查询生成可以为满足期望的基数约束或一组基数约束的查询创建一组参数。 使用基数约束过程的这种查询生成的应用可以是数据库组件和代码测试。

公开(公告)号：US20070185851A1

公开(公告)日：2007-08-09

申请号：US11275782

申请日：2006-01-27

申请人： Nicolas Bruno ,  Surajit Chaudhuri ,  Dilys Thomas

发明人： Nicolas Bruno ,  Surajit Chaudhuri ,  Dilys Thomas

IPC分类号： G06F17/30

CPC分类号： G06F17/30424 ,  G06F17/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.

摘要翻译： 使用基数约束过程的查询生成，包括选择用于查询的第一组参数，基于第一组参数计算附加参数集合，使用附加参数集执行查询，评估基数误差附加参数集 ，并且提炼额外的一组参数以满足期望的基数约束。 创建查询并选择参数，以便在针对数据库执行查询时难以满足所需的基数约束或基数约束集合。 使用基数约束过程的查询生成可以为满足期望的基数约束或一组基数约束的查询创建一组参数。 使用基数约束过程的这种查询生成的应用可以是数据库组件和代码测试。

公开(公告)号：US20100250518A1

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

申请号：US12413544

申请日：2009-03-28

申请人： Nicolas Bruno ,  Ravishankar Ramamurthy ,  Surajit Chaudhuri

发明人： Nicolas Bruno ,  Ravishankar Ramamurthy ,  Surajit Chaudhuri

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表达式的约束的经修订的执行计划。 灵活查询提示系统和方法的实施例包括灵活的查询提示用户界面，允许用户交互地调整查询提示。

公开(公告)号：US07299226B2

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

申请号：US10465148

申请日：2003-06-19

申请人： Nicolas Bruno ,  Murali Krishna ,  Ming-Chuan Wu ,  Surajit Chaudhuri

发明人： Nicolas Bruno ,  Murali Krishna ,  Ming-Chuan Wu ,  Surajit Chaudhuri

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30469 ,  G06F17/30333 ,  Y10S707/962 ,  Y10S707/99935 ,  Y10S707/99936 ,  Y10S707/99937

摘要： A method of estimating cardinality of a join of tables using multi-column density values and additionally using coarser density values of a subset of the multi-column density attributes. In one embodiment, the subset of attributes for the coarser densities is a prefix of the set of multi-column density attributes. A number of tuples from each table that participate in the join may be estimated using densities of the subsets. The cardinality of the join can be estimated using the multi-column density for each table and the estimated number of tuples that participate in the join from each table.

摘要翻译： 使用多列密度值估计表连接的基数的方法，并且另外使用多列密度属性的子集的较粗密度值。 在一个实施例中，用于较粗密度的属性子集是多列密度属性集合的前缀。 可以使用子集的密度来估计参与加入的每个表中的一些元组。 可以使用每个表的多列密度和参与每个表的连接的元组的估计数量来估计连接的基数。

公开(公告)号：US20060242102A1

公开(公告)日：2006-10-26

申请号：US11111015

申请日：2005-04-21

申请人： Nicolas Bruno ,  Surajit Chaudhuri

发明人： Nicolas Bruno ,  Surajit Chaudhuri

IPC分类号： G06F17/30

CPC分类号： G06F16/22

摘要： A system that facilitates automatic selection of a physical configuration of a database comprises an optimizer component that determines simulated physical structures and creates a hypothetical configuration based thereon. A reduction component progressively reduces size of the configuration until the hypothetical configuration is associated with a size below a threshold. For example, the simulated physical structures can be based at least in part upon a workload.

摘要翻译： 促进数据库的物理配置的自动选择的系统包括确定模拟物理结构并基于此创建假设配置的优化器组件。 缩减组件逐渐减小配置的大小，直到假设配置与小于阈值的大小相关联。 例如，模拟的物理结构可以至少部分地基于工作负载。

公开(公告)号：US08214402B2

公开(公告)日：2012-07-03

申请号：US12484564

申请日：2009-06-15

申请人： Nicolas Bruno ,  Surajit Chaudhuri

发明人： Nicolas Bruno ,  Surajit Chaudhuri

IPC分类号： G06F17/30

CPC分类号： G06F9/45512 ,  G06F17/30306

摘要： An architecture for providing interactive sessions for physical database design is described, allowing users to readily try different options, identify problems, and obtain physical designs in a flexible way. Embodiments based on a .NET assembly and modifications to a database management system (DBMS) are also described.

摘要翻译： 描述了一种用于提供物理数据库设计的交互式会话的架构，允许用户以灵活的方式轻松尝试不同的选项，识别问题并获得物理设计。 还描述了基于.NET组件和对数据库管理系统（DBMS）的修改的实施例。

公开(公告)号：US08190595B2

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

申请号：US12413544

申请日：2009-03-28

申请人： Nicolas Bruno ,  Ravishankar Ramamurthy ,  Surajit Chaudhuri

发明人： Nicolas Bruno ,  Ravishankar Ramamurthy ,  Surajit Chaudhuri

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表达式的约束的经修订的执行计划。 灵活查询提示系统和方法的实施例包括灵活的查询提示用户界面，允许用户交互地调整查询提示。

公开(公告)号：US20110313999A1

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

申请号：US12817511

申请日：2010-06-17

申请人： Nicolas Bruno ,  Ravishankar Ramamurthy ,  Surajit Chaudhuri ,  Vivek Ravindranath Narasayya

发明人： Nicolas Bruno ,  Ravishankar Ramamurthy ,  Surajit Chaudhuri ,  Vivek Ravindranath Narasayya

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.

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

公开(公告)号：US07685145B2

公开(公告)日：2010-03-23

申请号：US11391649

申请日：2006-03-28

申请人： Nicolas Bruno ,  Surajit Chaudhuri

发明人： Nicolas Bruno ,  Surajit Chaudhuri

IPC分类号： G06F7/00 ,  G06F17/00 ,  G06F12/00 ,  G06F17/30

CPC分类号： G06F17/30312 ,  Y10S707/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.

摘要翻译： 公开了关于数据库配置细化的各种实施例。 在示例实施例中，提供了一种方法，其可以包括确定数据库配置的大小限制，确定数据库配置的工作负载，以及确定数据库配置的大小大于大小限制。 该方法还可以包括应用合并过程或缩减过程来减小数据库配置的大小。 例如，合并进程可以将第一索引/视图与第二索引/视图合并以产生合并的索引/视图。 缩小处理可以删除第一视图的第一部分以产生缩小视图。

公开(公告)号：US20090094086A1

公开(公告)日：2009-04-09

申请号：US11866417

申请日：2007-10-03

申请人： Nicolas Bruno ,  Vivek R. Narasayya ,  Surajit Chaudhuri

发明人： Nicolas Bruno ,  Vivek R. Narasayya ,  Surajit Chaudhuri

IPC分类号： G06Q10/00 ,  G06F3/00

CPC分类号： G06Q10/00 ,  G06Q10/06311

摘要： Assignment algorithm for automatically making assignments between documents and document reviewers for a review process. If the automated assignments need adjusting, a coordinator can manually refine the assignment(s). The assignment algorithm facilitates the automated assignment process based on inputs related to a constraint and/or a preference. The constraints and preferences include, but are not limited to, a conflict of interest, a minimum number of reviews, a maximum number of submissions, a partial assignment, bidding preferences, and health metrics. Once the assignments have been made, histograms can be generated that present an overview of certain health metrics, further allowing refinement of the assignment process.

摘要翻译： 分配算法用于自动进行文档和文档审阅者之间的分配以进行审核。 如果自动分配需要调整，协调员可以手动优化任务。 分配算法有助于基于与约束和/或偏好相关的输入的自动分配过程。 限制和偏好包括但不限于利益冲突，最小审查次数，最大提交数量，部分分配，出价偏好和健康度量。 一旦作出了分配，就可以生成直方图，显示某些健康指标的概述，进一步允许改进分配过程。