公开(公告)号：US20100262593A1

公开(公告)日：2010-10-14

申请号：US12420077

申请日：2009-04-08

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

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

IPC分类号： G06F17/30

CPC分类号： G06F16/284 ,  G06F16/22 ,  G06F16/2228

摘要： The described implementations relate to filtered index recommendations. In one case a filtered index recommendation (FIR) tool is configured to recommend a final set of filtered indexes to use with a workload. The final set is selected from a first set of candidate filtered indexes and a second set of merged filtered indexes.

摘要翻译： 所描述的实现涉及过滤的索引建议。 在一种情况下，过滤索引推荐（FIR）工具被配置为推荐与工作负载一起使用的最终过滤索引集。 从第一组候选过滤索引和第二组合并的过滤索引中选择最终集合。

公开(公告)号：US20080183764A1

公开(公告)日：2008-07-31

申请号：US11669807

申请日：2007-01-31

申请人： Nicolas Bruno ,  Surajit Chaudhuri

发明人： Nicolas Bruno ,  Surajit Chaudhuri

IPC分类号： G06F17/30

CPC分类号： G06F16/2453 ,  G06F16/2272

摘要： Online physical design tuning is constantly monitoring database indexes and can effectively react to changes in a workload by modifying the physical design as needed. Algorithms can be utilized that take into account various criteria including storage constraints, update statements, and the cost of temporarily creating physical structures.

摘要翻译： 在线物理设计调整是不断监视数据库索引，并可以根据需要修改物理设计，对工作负载的变化做出有效的反应。 可以利用考虑到各种标准的算法，包括存储约束，更新语句和临时创建物理结构的成本。

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

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

公开(公告)号：US06947927B2

公开(公告)日：2005-09-20

申请号：US10191822

申请日：2002-07-09

申请人： Surajit Chaudhuri ,  Nicolas Bruno

发明人： Surajit Chaudhuri ,  Nicolas Bruno

IPC分类号： G06F17/30

CPC分类号： G06F17/30463 ,  G06F17/30536 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99944 ,  Y10S707/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.

公开(公告)号：US08996464B2

公开(公告)日：2015-03-31

申请号：US13494006

申请日：2012-06-11

申请人： Jingren Zhou ,  Nicolas Bruno ,  Wei Lin

发明人： Jingren Zhou ,  Nicolas Bruno ,  Wei Lin

IPC分类号： G06F17/30 ,  G06F9/50

CPC分类号： G06F9/5066 ,  G06F17/30584 ,  Y10S707/968

摘要： A repartitioning optimizer identifies alternative repartitioning strategies and selects optimal ones, accounting for network transfer utilization and partition sizes in addition to traditional metrics. If prior partitioning was hash-based, the repartitioning optimizer can determine whether a hash-based repartitioning can result in not every computing device providing data to every other computing device. If prior partitioning was range-based, the repartitioning optimizer can determine whether a range-based repartitioning can generate similarly sized output partitions while aligning input and output partition boundaries, increasing the number of computing devices that do not provide data to every other computing device. Individual computing devices, as they are performing a repartitioning, assign a repartitioning index to each individual data element, which represents the computing device to which such a data element is destined. The indexed data is sorted by such repartitioning indices, thereby grouping together all like data, and then stored in a sequential manner.

摘要翻译： 重新分配优化器识别替代重新分配策略并选择最优策略，除传统度量之外还考虑网络传输利用率和分区大小。 如果先前分区是基于哈希的，则重新分区优化器可以确定基于哈希的重新分区是否可以导致不是每个计算设备向每个其他计算设备提供数据。 如果先前分区是基于范围的，则重新分配优化器可以确定基于范围的重新分区是否可以在对齐输入和输出分区边界的同时生成类似大小的输出分区，从而增加不向每个其他计算设备提供数据的计算设备的数量。 当各个计算设备正在执行重新分区时，将重新分配索引分配给每个单独的数据元素，其表示这样的数据元素注定到的计算设备。 索引数据通过这样的重新分配索引排序，从而将所有相似数据分组在一起，然后以顺序方式存储。

公开(公告)号：US20130332446A1

公开(公告)日：2013-12-12

申请号：US13494006

申请日：2012-06-11

申请人： Jingren Zhou ,  Nicolas Bruno ,  Wei Lin

发明人： Jingren Zhou ,  Nicolas Bruno ,  Wei Lin

IPC分类号： G06F17/30

CPC分类号： G06F9/5066 ,  G06F17/30584 ,  Y10S707/968

摘要： A repartitioning optimizer identifies alternative repartitioning strategies and selects optimal ones, accounting for network transfer utilization and partition sizes in addition to traditional metrics. If prior partitioning was hash-based, the repartitioning optimizer can determine whether a hash-based repartitioning can result in not every computing device providing data to every other computing device. If prior partitioning was range-based, the repartitioning optimizer can determine whether a range-based repartitioning can generate similarly sized output partitions while aligning input and output partition boundaries, increasing the number of computing devices that do not provide data to every other computing device. Individual computing devices, as they are performing a repartitioning, assign a repartitioning index to each individual data element, which represents the computing device to which such a data element is destined. The indexed data is sorted by such repartitioning indices, thereby grouping together all like data, and then stored in a sequential manner.

摘要翻译： 重新分配优化器识别替代重新分配策略并选择最优策略，除传统度量之外还考虑网络传输利用率和分区大小。 如果先前分区是基于哈希的，则重新分区优化器可以确定基于哈希的重新分区是否可以导致不是每个计算设备向每个其他计算设备提供数据。 如果先前分区是基于范围的，则重新分配优化器可以确定基于范围的重新分区是否可以在对齐输入和输出分区边界的同时生成类似大小的输出分区，从而增加不向每个其他计算设备提供数据的计算设备的数量。 当各个计算设备正在执行重新分区时，将重新分配索引分配给每个单独的数据元素，其表示这样的数据元素注定到的计算设备。 索引数据通过这样的重新分配索引排序，从而将所有相似数据分组在一起，然后以顺序方式存储。

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

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