-
公开(公告)号：US08326825B2
公开(公告)日：2012-12-04
申请号：US12940440
申请日：2010-11-05
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.
摘要翻译： 实施例旨在确定用于分布式数据库数据的最佳分区配置以及实现并行查询优化备忘录数据结构以改进分区配置成本估计效率。 在一个实施例中，计算机系统访问数据库数据的一部分和给定数据库的各种数据库查询。 计算机系统基于访问的数据库数据和数据库查询确定分区配置搜索空间，其包括用于数据库数据的多个可行分区配置和期望在该数据上执行的查询的工作负载。 计算机系统在分区配置搜索空间中执行分支和绑定搜索，以确定哪个数据分区路径具有最低的分区成本。 根据分支和绑定搜索策略执行分支和绑定搜索。 计算机系统还输出具有确定的最低分区成本的分区配置。
-
公开(公告)号：US20120117065A1
公开(公告)日：2012-05-10
申请号：US12940440
申请日：2010-11-05
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.
摘要翻译： 实施例旨在确定用于分布式数据库数据的最佳分区配置以及实现并行查询优化备忘录数据结构以改进分区配置成本估计效率。 在一个实施例中，计算机系统访问数据库数据的一部分和给定数据库的各种数据库查询。 计算机系统基于访问的数据库数据和数据库查询确定分区配置搜索空间，其包括用于数据库数据的多个可行分区配置和期望在该数据上执行的查询的工作负载。 计算机系统在分区配置搜索空间中执行分支和绑定搜索，以确定哪个数据分区路径具有最低的分区成本。 根据分支和绑定搜索策略执行分支和绑定搜索。 计算机系统还输出具有确定的最低分区成本的分区配置。
-
公开(公告)号：US20100241766A1
公开(公告)日：2010-09-23
申请号：US12408330
申请日：2009-03-20
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.
摘要翻译： 本文描述的最小重复发现技术旨在简化和加快找到最小重现的任务，这是在数据库相关产品中重现问题的最低配置。 具体来说，在一个实施例中，该技术简化了转换，以找到一个或多个最小重复。 一个实施例提供了一种高级脚本语言，用于自动化一些子任务并且引导搜索更简单的再现该问题的配置。 另一个实施例提供记录和重放功能，并提供结果和搜索空间的直观表示。 这些工具可以节省客户和测试人员的时间，以隔离问题，并可以为组织带来更快的修复和更大的成本节省。
-
-
搜索结果
3 条记录 (耗时 0.016 秒)
