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

31. 发明授权

US07966313B2 Configuration-parametric query optimization 有权
标题翻译：配置参数查询优化
公开(公告)号：US07966313B2
公开(公告)日：2011-06-21
申请号：US12146470
申请日：2008-06-26
申请人： Nicolas Bruno , Rimma Nehme
发明人： Nicolas Bruno , Rimma Nehme
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30312
摘要： Described herein are techniques for Configuration-Parametric Query Optimization (C-PQO) that can improve performance of database tuning tools. When first optimizing a query, a compact representation of the optimization space is generated. The representation can then be used to efficiently produce other execution plans for the query under arbitrary hypothetical configurations.
摘要翻译：这里描述了可以提高数据库调整工具性能的配置参数查询优化（C-PQO）的技术。当首次优化查询时，生成优化空间的紧凑表示。然后，该表示可以用于在任意假设配置下有效地生成查询的其他执行计划。

32. 发明申请

US20060212429A1 Answering top-K selection queries in a relational engine 审中-公开
标题翻译：在关系引擎中回答顶级K选择查询
公开(公告)号：US20060212429A1
公开(公告)日：2006-09-21
申请号：US11082645
申请日：2005-03-17
申请人： Nicolas Bruno , Hui Wang
发明人： Nicolas Bruno , Hui Wang
IPC分类号： G06F7/00
CPC分类号： G06F16/24578 , G06F16/24542
摘要： The subject invention leverages threshold-based strategies applied to relational data to facilitate in determining an optimal execution plan for top-k selection queries. These strategies utilize a given query and relational data metadata to identify possible execution plans. This allows alternatives to scanning techniques to be considered in order to further enhance the overall efficiency of the optimal execution plan. A query optimizer can prune, for example, the alternative execution plans during enumeration of the plan space and/or during cost evaluations of the possible alternative execution plans. A cost model for the query optimizer can utilize a cost function based on an approximation of the number of iterations required to complete a threshold-based strategy.
摘要翻译：本发明利用应用于关系数据的基于阈值的策略来促进确定用于顶部k选择查询的最佳执行计划。这些策略利用给定的查询和关系数据元数据来识别可能的执行计划。这样可以考虑采用扫描技术的替代方法，以进一步提高最佳执行计划的整体效率。查询优化器可以在枚举计划空间和/或在可能的替代执行计划的成本评估期间修剪例如替代执行计划。查询优化器的成本模型可以基于完成基于阈值的策略所需的迭代次数的近似来利用成本函数。

33. 发明授权

US08676774B2 Min-repro framework for database systems 有权
标题翻译： Min-Repl数据库系统框架
公开(公告)号：US08676774B2
公开(公告)日：2014-03-18
申请号：US12408330
申请日：2009-03-20
申请人： Nicolas Bruno , Rimma V. Nehme
发明人： Nicolas Bruno , Rimma V. Nehme
IPC分类号： G06F17/30
CPC分类号： G06F11/3664
摘要： The min-repro finding technique described herein is designed to ease and speed-up the task of finding a min-repro, a minimum configuration that reproduces a problem in database-related products. Specifically, in one embodiment, the technique simplifies transformations in order to find one or more min-repros. One embodiment provides a high-level script language to automate some sub-tasks and to guide the search for a simpler the configuration that reproduces the problem. Yet another embodiment provides record-and-replay functionality, and provides an intuitive representation of results and the search space. These tools can save hours of time for both customers and testers to isolate the problem and can result in faster fixes and large cost savings to organizations.
摘要翻译：本文描述的最小重复发现技术旨在简化和加快找到最小重现的任务，这是在数据库相关产品中重现问题的最低配置。具体地说，在一个实施例中，该技术简化了转换，以找到一个或多个最小重复。一个实施例提供了一种高级脚本语言，用于自动化一些子任务并且引导搜索更简单的再现该问题的配置。另一个实施例提供记录和重放功能，并提供结果和搜索空间的直观表示。这些工具可以节省客户和测试人员的时间，以隔离问题，并可以为组织带来更快的修复和更大的成本节省。

34. 发明申请

US20130346988A1 PARALLEL DATA COMPUTING OPTIMIZATION 有权
标题翻译：并行数据计算优化
公开(公告)号：US20130346988A1
公开(公告)日：2013-12-26
申请号：US13530490
申请日：2012-06-22
申请人： Nicolas Bruno , Jingren Zhou , Srikanth Kandula , Sameer Agarwal , Ming-Chuan Wu
发明人： Nicolas Bruno , Jingren Zhou , Srikanth Kandula , Sameer Agarwal , Ming-Chuan Wu
IPC分类号： G06F9/46
CPC分类号： G06F9/5066
摘要： The use of statistics collected during the parallel distributed execution of the tasks of a job may be used to optimize the performance of the task or similar recurring tasks. An execution plan for a job is initially generated, in which the execution plan includes tasks. Statistics regarding operations performed in the tasks are collected while the tasks are executed via parallel distributed execution. Another execution plan is then generated for another recurring job, in which the additional execution plan has at least one task in common with the execution plan for the job. The additional execution plan is subsequently optimized based at least on the statistics to produce an optimized execution plan.
摘要翻译：在并行分布式执行作业期间收集的统计数据的使用可用于优化任务的性能或类似的重复任务。最初生成作业的执行计划，其中执行计划包括任务。在通过并行分布式执行执行任务时，将收集在任务中执行的操作的统计信息。然后为另一个循环作业生成另一执行计划，其中附加执行计划具有至少一个与该作业的执行计划相同的任务。随后根据统计数据优化附加执行计划，以生成优化的执行计划。

35. 发明授权

US08326825B2 Automated partitioning in parallel database systems 有权
标题翻译：并行数据库系统中的自动分区
公开(公告)号：US08326825B2
公开(公告)日：2012-12-04
申请号：US12940440
申请日：2010-11-05
申请人： Rimma Vladimirovna Nehme , Nicolas Bruno
发明人： Rimma Vladimirovna Nehme , Nicolas Bruno
IPC分类号： G06F17/30
CPC分类号： G06F17/30445 , G06F17/30557
摘要： Embodiments are directed to determining optimal partition configurations for distributed database data and to implementing parallel query optimization memo data structure to improve partition configuration cost estimation efficiency. In an embodiment, a computer system accesses a portion of database data and various database queries for a given database. The computer system determines, based on the accessed database data and database queries, a partition configuration search space which includes multiple feasible partition configurations for the database data and a workload of queries expected to be executed on that data. The computer system performs a branch and bound search in the partition configuration search space to determine which data partitioning path has the lowest partitioning cost. The branch and bound search is performed according to branch and bound search policies. The computer system also outputs the partition configuration with the determined lowest partitioning cost.
摘要翻译：实施例旨在确定用于分布式数据库数据的最佳分区配置以及实现并行查询优化备忘录数据结构以改进分区配置成本估计效率。在一个实施例中，计算机系统访问数据库数据的一部分和给定数据库的各种数据库查询。计算机系统基于访问的数据库数据和数据库查询确定分区配置搜索空间，其包括用于数据库数据的多个可行分区配置和期望在该数据上执行的查询的工作负载。计算机系统在分区配置搜索空间中执行分支和绑定搜索，以确定哪个数据分区路径具有最低的分区成本。根据分支和绑定搜索策略执行分支和绑定搜索。计算机系统还输出具有确定的最低分区成本的分区配置。

36. 发明申请

US20120117065A1 AUTOMATED PARTITIONING IN PARALLEL DATABASE SYSTEMS 有权
标题翻译：在并行数据库系统中自动分区
公开(公告)号：US20120117065A1
公开(公告)日：2012-05-10
申请号：US12940440
申请日：2010-11-05
申请人： Rimma Vladimirovna Nehme , Nicolas Bruno
发明人： Rimma Vladimirovna Nehme , Nicolas Bruno
IPC分类号： G06F17/30
CPC分类号： G06F17/30445 , G06F17/30557
摘要： Embodiments are directed to determining optimal partition configurations for distributed database data and to implementing parallel query optimization memo data structure to improve partition configuration cost estimation efficiency. In an embodiment, a computer system accesses a portion of database data and various database queries for a given database. The computer system determines, based on the accessed database data and database queries, a partition configuration search space which includes multiple feasible partition configurations for the database data and a workload of queries expected to be executed on that data. The computer system performs a branch and bound search in the partition configuration search space to determine which data partitioning path has the lowest partitioning cost. The branch and bound search is performed according to branch and bound search policies. The computer system also outputs the partition configuration with the determined lowest partitioning cost.
摘要翻译：实施例旨在确定用于分布式数据库数据的最佳分区配置以及实现并行查询优化备忘录数据结构以改进分区配置成本估计效率。在一个实施例中，计算机系统访问数据库数据的一部分和给定数据库的各种数据库查询。计算机系统基于访问的数据库数据和数据库查询确定分区配置搜索空间，其包括用于数据库数据的多个可行分区配置和期望在该数据上执行的查询的工作负载。计算机系统在分区配置搜索空间中执行分支和绑定搜索，以确定哪个数据分区路径具有最低的分区成本。根据分支和绑定搜索策略执行分支和绑定搜索。计算机系统还输出具有确定的最低分区成本的分区配置。

37. 发明授权

US08996464B2 Efficient partitioning techniques for massively distributed computation 有权
标题翻译：用于大规模分布式计算的高效分区技术
公开(公告)号：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.
摘要翻译：重新分配优化器识别替代重新分配策略并选择最优策略，除传统度量之外还考虑网络传输利用率和分区大小。如果先前分区是基于哈希的，则重新分区优化器可以确定基于哈希的重新分区是否可以导致不是每个计算设备向每个其他计算设备提供数据。如果先前分区是基于范围的，则重新分配优化器可以确定基于范围的重新分区是否可以在对齐输入和输出分区边界的同时生成类似大小的输出分区，从而增加不向每个其他计算设备提供数据的计算设备的数量。当各个计算设备正在执行重新分区时，将重新分配索引分配给每个单独的数据元素，其表示这样的数据元素注定到的计算设备。索引数据通过这样的重新分配索引排序，从而将所有相似数据分组在一起，然后以顺序方式存储。

38. 发明申请

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

39. 发明申请

US20090327254A1 CONFIGURATION-PARAMETRIC QUERY OPTIMIZATION 有权
标题翻译：配置 - 参数查询优化
公开(公告)号：US20090327254A1
公开(公告)日：2009-12-31
申请号：US12146470
申请日：2008-06-26
申请人： Nicolas Bruno , Rimma Nehme
发明人： Nicolas Bruno , Rimma Nehme
IPC分类号： G06F17/30
CPC分类号： G06F17/30312
摘要： Described herein are techniques for Configuration-Parametric Query Optimization (C-PQO) that can improve performance of database tuning tools. When first optimizing a query, a compact representation of the optimization space is generated. The representation can then be used to efficiently produce other execution plans for the query under arbitrary hypothetical configurations.
摘要翻译：这里描述了可以提高数据库调整工具性能的配置参数查询优化（C-PQO）的技术。当首次优化查询时，生成优化空间的紧凑表示。然后，该表示可以用于在任意假设配置下有效地生成查询的其他执行计划。

40. 发明授权

US08832155B2 Minimizing database repros using language grammars 有权
标题翻译：使用语言语法最大限度地减少数据库重复
公开(公告)号：US08832155B2
公开(公告)日：2014-09-09
申请号：US12814504
申请日：2010-06-14
申请人： Nicolas Bruno
发明人： Nicolas Bruno
IPC分类号： G06F17/30 , G06F7/00 , G06F11/36
CPC分类号： G06F11/3668 , G06F11/3684 , G06F11/3696 , G06F17/30289
摘要： Described is automatically processing an initial database repro (text representing a bug when corresponding script is executed in a database engine) into a min-repro (a subset of the text) that is simplified version of the initial repro yet still contains the bug. A parse tree representative of the initial database repro is processed into simplified parse trees based on language grammar rules, e.g., by replacing higher level nodes with descendant nodes. Repros of the simplified parse trees are executed to determine which simplified repros still fail execution because of the bug (that is, the simplified repros were not oversimplified). A minimum simplified parse tree with respect to a desired level of minimality is found from among those failing repros, with the simplified repro that corresponds to the minimum simplified parse tree output as the min-repro.
摘要翻译：描述的是自动处理初始数据库（在数据库引擎中执行相应的脚本时表示错误的文本）转换为最初的复制（文本的一部分），这是初始化的简化版本，但仍然包含该错误。代表初始数据库复制的解析树根据语言语法规则被处理成简化的解析树，例如通过用后代节点代替较高层节点。执行简化解析树的Repros以确定由于错误（即，简化的repros不被过分简化）哪些简化的repros仍然执行失败。从那些失败的重现中找到相对于所需最低级别的最小简化解析树，其中简化的重现对应于最小简化解析树输出作为最小复制。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式