专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US10838957B2 Slicing relational queries using spool operators 有权
公开(公告)号：US10838957B2
公开(公告)日：2020-11-17
申请号：US12817511
申请日：2010-06-17
申请人： Nicolas Bruno , Ravishankar Ramamurthy , Surajit Chaudhuri , Vivek Ravindranath Narasayya
发明人： Nicolas Bruno , Ravishankar Ramamurthy , Surajit Chaudhuri , Vivek Ravindranath Narasayya
IPC分类号： G06F16/2453
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.

2. 发明授权

US07882121B2 Generating queries using cardinality constraints 失效
标题翻译：使用基数约束生成查询
公开(公告)号：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.
摘要翻译：使用基数约束过程的查询生成，包括选择用于查询的第一组参数，基于第一组参数计算附加参数集合，使用附加参数集执行查询，评估基数误差附加参数集，并且提炼额外的一组参数以满足期望的基数约束。创建查询并选择参数，以便在针对数据库执行查询时难以满足所需的基数约束或基数约束集合。使用基数约束过程的查询生成可以为满足期望的基数约束或一组基数约束的查询创建一组参数。使用基数约束过程的这种查询生成的应用可以是数据库组件和代码测试。

3. 发明申请

US20100250518A1 FLEXIBLE QUERY HINTS IN A RELATIONAL DATABASE 有权
标题翻译：相关数据库中的灵活查询
公开(公告)号：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表达式的约束的经修订的执行计划。灵活查询提示系统和方法的实施例包括灵活的查询提示用户界面，允许用户交互地调整查询提示。

4. 发明授权

US07299226B2 Cardinality estimation of joins 有权
标题翻译：连接的基数估计
公开(公告)号：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.
摘要翻译：使用多列密度值估计表连接的基数的方法，并且另外使用多列密度属性的子集的较粗密度值。在一个实施例中，用于较粗密度的属性子集是多列密度属性集合的前缀。可以使用子集的密度来估计参与加入的每个表中的一些元组。可以使用每个表的多列密度和参与每个表的连接的元组的估计数量来估计连接的基数。

5. 发明申请

US20060242102A1 Relaxation-based approach to automatic physical database tuning 审中-公开
标题翻译：基于放松的自动物理数据库调优方法
公开(公告)号：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.
摘要翻译：促进数据库的物理配置的自动选择的系统包括确定模拟物理结构并基于此创建假设配置的优化器组件。缩减组件逐渐减小配置的大小，直到假设配置与小于阈值的大小相关联。例如，模拟的物理结构可以至少部分地基于工作负载。

6. 发明授权

US08150790B2 Lightweight physical design alerter 有权
标题翻译：轻量物理设计报警器
公开(公告)号：US08150790B2
公开(公告)日：2012-04-03
申请号：US11669782
申请日：2007-01-31
申请人： Nicolas Bruno , Surajit Chaudhuri
发明人： Nicolas Bruno , Surajit Chaudhuri
IPC分类号： G06N5/02
CPC分类号： 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).
摘要翻译：轻量级物理设计报警器可以分析工作负载并确定综合调优会话是否会导致配置改进超过当前配置。报警器提供了一个低开销的过程，可以在数据库管理系统的正常操作期间运行，并在当前配置不太适合的情况下产生通知。报警器可以报告如果启动综合调整工具可以获得的改进的上下限。可以通过生成可行的配置来证明下限。所公开的实施例可以扩展到查询更新，物化视图和其他物理设计特征（例如，分区）。

7. 发明授权

US07249120B2 Method and apparatus for selecting candidate statistics to estimate the selectivity value of the conditional selectivity expression in optimize queries based on a set of predicates that each reference a set of relational database tables 有权
标题翻译：用于选择候选统计量以估计优化查询中的条件选择性表达式的选择性值的方法和装置，其基于一组谓词，每组谓词引用一组关系数据库表
公开(公告)号：US07249120B2
公开(公告)日：2007-07-24
申请号：US10608083
申请日：2003-06-27
申请人： Nicolas Bruno , Surajit Chaudhuri
发明人： Nicolas Bruno , Surajit Chaudhuri
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30469 , G06F17/30536 , Y10S707/99932 , Y10S707/99933 , Y10S707/99935
摘要： By transforming a query into a product of conditional selectivity expressions, an existing set of statistics on query expressions can be used more effectively to estimate cardinality values. Conditional selectivity values are progressively separated according to rules of conditional probability to yield a set of non-separable decompositions that can be matched with the stored statistics on query expressions. The stored statistics are used to estimate the selectivity of the query and the estimated selectivity can be multiplied by the Cartesian product of referenced tables to yield a cardinality value.
摘要翻译：通过将查询转换为条件选择表达式的乘积，可以更有效地使用现有的查询表达式统计量来估计基数值。条件选择性值根据条件概率的规则逐渐分离，以产生一组不可分离的分解，可以与查询表达式上存储的统计信息相匹配。使用存储的统计量来估计查询的选择性，并且估计的选择性可以乘以所引用的表的笛卡儿乘积以产生基数值。

8. 发明授权

US08140548B2 Constrained physical design tuning 有权
标题翻译：约束物理设计调谐
公开(公告)号：US08140548B2
公开(公告)日：2012-03-20
申请号：US12191303
申请日：2008-08-13
申请人： Nicolas Bruno , Surajit Chaudhuri
发明人： Nicolas Bruno , Surajit Chaudhuri
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30312
摘要： Described is a constraint language and related technology by which complex constraints may be used in selecting configurations for use in physical database design tuning. The complex constraint (or constraints) is processed, e.g., in a search framework, to determine and output at least one configuration that meets the constraint, e.g., a best configuration found before a stopping condition is met. The search framework processes a current configuration into candidate configurations, including by searching for candidate configurations from a current configuration based upon a complex constraint, iteratively evaluating a search space until a stopping condition is satisfied, using transformation rules to generate new candidate configurations, and selecting a best candidate configuration. Transformation rules and pruning rules are applied to efficiently perform the search. Constraints may be specified as assertions that need to be satisfied, or as soft assertions that come close to satisfying the constraint.
摘要翻译：描述了一种约束语言和相关技术，通过该约束语言和相关技术，复杂约束可用于选择用于物理数据库设计调优的配置。复杂约束（或约束）例如在搜索框架中被处理，以确定和输出满足约束的至少一个配置，例如在满足停止条件之前找到的最佳配置。搜索框架将当前配置处理成候选配置，包括通过基于复杂约束从当前配置中搜索候选配置，迭代地评估搜索空间直到停止条件满足，使用转换规则来生成新的候选配置，以及选择最佳候选人配置。应用变换规则和修剪规则来有效地执行搜索。约束可以被指定为需要满足的断言，或者是接近满足约束的软断言。

9. 发明申请

US20100262593A1 AUTOMATED FILTERED INDEX RECOMMENDATIONS 审中-公开
标题翻译：自动过滤索引建议
公开(公告)号：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）工具被配置为推荐与工作负载一起使用的最终过滤索引集。从第一组候选过滤索引和第二组合并的过滤索引中选择最终集合。

10. 发明申请

US20080183764A1 CONTINUOUS PHYSICAL DESIGN TUNING 审中-公开
标题翻译：连续物理设计调谐
公开(公告)号：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.
摘要翻译：在线物理设计调整是不断监视数据库索引，并可以根据需要修改物理设计，对工作负载的变化做出有效的反应。可以利用考虑到各种标准的算法，包括存储约束，更新语句和临时创建物理结构的成本。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式