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

51. 发明授权

US07664778B2 SQL tuning sets 有权
标题翻译： SQL调优集
公开(公告)号：US07664778B2
公开(公告)日：2010-02-16
申请号：US10936449
申请日：2004-09-07
申请人： Khaled Yagoub , Benoit Dageville , Mohamed Ziauddin , Karl Dias
发明人： Khaled Yagoub , Benoit Dageville , Mohamed Ziauddin , Karl Dias
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30474 , G06F17/30306 , Y10S707/99932 , Y10S707/99934 , Y10S707/99944
摘要： A method and system for storing one or more database query language statements and performance information for each query language statement as a persistent database object. In one or more embodiments, the method and system stores the resource intensive statements and the performance information for each resource intensive statement as a second persistent database object.
摘要翻译：用于将每个查询语言语句的一个或多个数据库查询语言语句和性能信息存储为持久数据库对象的方法和系统。在一个或多个实施例中，该方法和系统将资源密集型语句和每个资源密集型语句的性能信息存储为第二持久数据库对象。

52. 发明申请

US20100030758A1 Hybrid optimization strategies in automatic SQL tuning 有权
标题翻译：自动SQL调优中的混合优化策略
公开(公告)号：US20100030758A1
公开(公告)日：2010-02-04
申请号：US12221131
申请日：2008-07-30
申请人： Peter Belknap , Khaled Yagoub , Karl Dias , Benoit Dageville , Thierry Cruanes , Anupam Singh
发明人： Peter Belknap , Khaled Yagoub , Karl Dias , Benoit Dageville , Thierry Cruanes , Anupam Singh
IPC分类号： G06F17/30
CPC分类号： G06F17/30463 , G06F17/30306 , G06F17/30471
摘要： Systems, methods, and other embodiments associated with hybrid optimization strategies in automatic SQL tuning are described. One example method includes receiving a first (e.g., cost-based) execution plan for a user structured query language statement (User SQL) from a first (e.g., cost-based) optimizer. The example method may also include receiving a second (e.g., rules-based) execution plan for the User SQL from a second, different (e.g., rules-based) query optimizer. The method may include identifying a preferred execution plan based on data produced by test executing the execution plans in a reproduced execution environment that reproduces at least a portion of an execution environment in which the user SQL runs. The method may also include controlling a database to execute the User SQL using the preferred execution plan.
摘要翻译：描述了与自动SQL调优中的混合优化策略相关联的系统，方法和其他实施例。一个示例性方法包括从第一（例如基于成本的）优化器接收用户结构化查询语言语句（User SQL）的第一（例如基于成本的）执行计划。示例性方法还可以包括从第二不同（例如，基于规则的）查询优化器接收针对用户SQL的第二（例如基于规则的）执行计划。该方法可以包括基于在再现执行用户SQL运行的执行环境的至少一部分的再现执行环境中执行执行计划的测试产生的数据来识别优选执行计划。该方法还可以包括控制数据库以使用优选的执行计划来执行User SQL。

53. 发明申请

US20090106219A1 SQL Execution Plan Verification 有权
标题翻译： SQL执行计划验证
公开(公告)号：US20090106219A1
公开(公告)日：2009-04-23
申请号：US12188683
申请日：2008-08-08
申请人： Peter Belknap , Benoit Dageville , Dinesh Das , Khaled Yagoub , Mohamed Zait , Mohamed Ziauddin
发明人： Peter Belknap , Benoit Dageville , Dinesh Das , Khaled Yagoub , Mohamed Zait , Mohamed Ziauddin
IPC分类号： G06F17/30
CPC分类号： G06F17/30469 , G06F17/30463
摘要： Approaches, techniques, and mechanisms are disclosed for ensuring that a database command is executed according to a query plan that has been verified to be actually optimal. Except in rare circumstances, a database server does not execute a query plan unless it is first verified by the database server. The database server receives a request to execute a database command. The database server determines an unverified plan is the best plan for satisfying the request. Rather than risk the unknown behavior of an unverified plan, the database server instead satisfies the request according to a verified plan. Subsequently—for example as part of a scheduled job—the database server executes the unverified plan to determine performance statistics. Based at least on the performance statistics, the database server determines whether or not to verify the unverified plan. Techniques for concurrent and optimistic verifications are also disclosed.
摘要翻译：公开了方法，技术和机制，以确保根据已被验证为实际最佳的查询计划来执行数据库命令。除非在极少数情况下，数据库服务器不执行查询计划，除非数据库服务器首先进行了验证。数据库服务器接收执行数据库命令的请求。数据库服务器确定未验证的计划是满足请求的最佳方案。而不是冒险未验证的计划的未知行为，数据库服务器而是根据验证的计划满足请求。随后 - 例如作为计划作业的一部分 - 数据库服务器执行未验证的计划以确定性能统计信息。至少基于性能统计，数据库服务器确定是否验证未验证的计划。还公开了并发和乐观验证的技术。

54. 发明授权

US07469241B2 Efficient data aggregation operations using hash tables 有权
标题翻译：使用哈希表进行有效的数据聚合操作
公开(公告)号：US07469241B2
公开(公告)日：2008-12-23
申请号：US11156068
申请日：2005-06-17
申请人： Srikanth Bellamkonda , Benoit Dageville
发明人： Srikanth Bellamkonda , Benoit Dageville
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30489 , Y10S707/99932 , Y10S707/99933 , Y10S707/99942
摘要： Hash aggregation operates in two phases. In the first phase, data read from underlying row source is partitioned on GROUP BY keys with on-the-fly aggregation. It is determined into which partition an entry corresponding to the incoming record should be grouped, and whether a matching entry is already present in the partition, using a hash function and a hash table built for the partition. For aggregation operations, if a match is found, then a measure value from the incoming record is aggregated with a measure value for the entry existing in the partition. If there is not enough system volatile memory to complete the first phase, then a partition is selected for storing persistently. Thus, only one partition at a time is stored persistently, as necessary. In the second phase, one persistently stored partition is processed at a time, whereby aggregation of the data in that partition is completed and results are returned.
摘要翻译：哈希聚合分为两个阶段。在第一阶段，从基础行源读取的数据在具有即时聚合的GROUP BY密钥上进行分区。确定哪个分区对应于输入记录的条目应该被分组，以及使用为该分区构建的散列函数和哈希表是否已经存在分区中的匹配条目。对于聚合操作，如果找到匹配项，则来自记录的度量值将与分区中存在的条目的度量值进行聚合。如果没有足够的系统易失性存储器来完成第一阶段，则选择一个分区来持久存储。因此，必要时，一次只能存储一个分区。在第二阶段，一次处理一个持久存储的分区，从而完成该分区中的数据的聚合，并返回结果。

55. 发明申请

US20080120274A1 Approximating a database statistic 有权
标题翻译：近似数据库统计
公开(公告)号：US20080120274A1
公开(公告)日：2008-05-22
申请号：US11796102
申请日：2007-04-25
申请人： Thierry Cruanes , Uri Shaft , Hong Su , Benoit Dageville , Sunil P. Chakkappen , Mohamed Zait
发明人： Thierry Cruanes , Uri Shaft , Hong Su , Benoit Dageville , Sunil P. Chakkappen , Mohamed Zait
IPC分类号： G06F7/00
CPC分类号： G06F17/30442 , Y10S707/99932 , Y10S707/99943
摘要： A method and apparatus for approximating a database statistic, such as the number of distinct values (NDV) is provided. To approximate the NDV for a portion of a table, a synopsis of distinct values is constructed. Each value in the portion is mapped to a domain of values. The mapping function is implemented with a uniform hash function, in one embodiment. If the resultant domain value does not exist in the synopsis, the domain value is added to the synopsis. If the synopsis reaches its capacity, a portion of the domain values are discarded from the synopsis. The statistic is approximated based on the number (N) of domain values in the synopsis and the portion of the domain that is represented in the synopsis relative to the size of the domain.
摘要翻译：提供了用于近似数据库统计量的方法和装置，例如不同值（NDV）的数量。为了近似表的一部分的NDV，构建了不同值的概要。该部分中的每个值都映射到值的域。在一个实施例中，映射功能是用均匀散列函数实现的。如果在概要中不存在结果域值，则将域值添加到概要中。如果概要达到其容量，则域值的一部分将从摘要中被丢弃。统计量基于概要中的域值的数量（N）和在概要中相对于域的大小表示的域的部分近似。

56. 发明授权

US07155446B2 Performing recursive database operations 有权
标题翻译：执行递归数据库操作
公开(公告)号：US07155446B2
公开(公告)日：2006-12-26
申请号：US10867923
申请日：2004-06-14
申请人： Thierry Cruanes , Wei Li , Ari Mozes , Benoit Dageville
发明人： Thierry Cruanes , Wei Li , Ari Mozes , Benoit Dageville
IPC分类号： G06F17/00
CPC分类号： G06F17/3056 , G06F17/30513 , Y10S707/99942
摘要： A method and apparatus for performing recursive database operations is provided. According to one aspect, a plurality of first-stage slaves and a plurality of second-stage slaves are established in a database server. During one or more iterations of a recursive database operation, the first-stage slaves concurrently process data items stored in a data repository and send results to the second-stage slaves. The second-stage slaves receive the results and concurrently process those results. The second-stage slaves store the results of the second-stage slaves' processing in the data repository. Subsequent iterations of the recursive database operation proceed in this manner until the recursive database operation has been completed. In each iteration, the first-stage slaves consume the product of the second-stage slaves' previous iteration's processing, and the second-stage slaves consume the product of the first-stage slaves' current iteration's processing.
摘要翻译：提供了一种用于执行递归数据库操作的方法和装置。根据一个方面，在数据库服务器中建立多个第一级从站和多个第二级从站。在递归数据库操作的一个或多个迭代期间，第一级从站同时处理存储在数据存储库中的数据项，并将结果发送到第二级从站。第二阶段的奴隶收到结果并同时处理这些结果。第二级从站将数据存储库中的第二级从站处理的结果存储起来。递归数据库操作的后续迭代以这种方式进行，直到递归数据库操作完成。在每次迭代中，第一级从站消耗第二级从站先前迭代处理的乘积，第二级从站消耗第一级从站当前迭代处理的乘积。

57. 发明申请

US20060182046A1 Parallel partition-wise aggregation 有权
标题翻译：并行分区聚合
公开(公告)号：US20060182046A1
公开(公告)日：2006-08-17
申请号：US11060260
申请日：2005-02-16
申请人： Benoit Dageville , Bhaskar Ghosh , Rushan Chen , Thierry Cruanes , Mohamed Zait
发明人： Benoit Dageville , Bhaskar Ghosh , Rushan Chen , Thierry Cruanes , Mohamed Zait
IPC分类号： H04L12/16 , H04Q11/00
CPC分类号： G06F9/4494
摘要： Techniques are provided for performing a parallel aggregation operation on data that resides in a container, such as a relational table. During generation of the execution plan for the operation, it is determined whether partition-wise aggregation should be performed, based on the grouping keys involved in the aggregation and the partition keys used to partition the container. If partition-wise aggregation is to be performed, then the assignments given to the slave processes that are assigned to scan a container are made on a partition-wise basis. The scan slaves themselves may perform full or partial aggregation (depending on whether they are the only scan slaves assigned to the partition). If the scan slaves perform no aggregation, or only partial aggregation, then the scan slaves redistribute the data items to aggregation slaves that are local to the scan slaves.
摘要翻译：提供了用于对驻留在诸如关系表的容器中的数据执行并行聚合操作的技术。在生成操作的执行计划时，基于聚合中涉及的分组密钥和用于分区容器的分区密钥，确定是否应该执行分区聚合。如果要执行分区聚合，则分配给分配给扫描容器的从属进程的分配是以分区方式进行的。扫描从站本身可以执行完全或部分聚合（取决于它们是否是分配给分区的唯一扫描从站）。如果扫描从站不执行聚合或仅执行部分聚合，则扫描从站将数据项重新分配到扫描从站本地的聚合从站。

58. 发明申请

US20060116989A1 Efficient data aggregation operations using hash tables 有权
标题翻译：使用哈希表进行有效的数据聚合操作
公开(公告)号：US20060116989A1
公开(公告)日：2006-06-01
申请号：US11156068
申请日：2005-06-17
申请人： Srikanth Bellamkonda , Benoit Dageville
发明人： Srikanth Bellamkonda , Benoit Dageville
IPC分类号： G06F17/30
CPC分类号： G06F17/30489 , Y10S707/99932 , Y10S707/99933 , Y10S707/99942
摘要： Hash aggregation operates in two phases. In the first phase, data read from underlying row source is partitioned on GROUP BY keys with on-the-fly aggregation. It is determined into which partition an entry corresponding to the incoming record should be grouped, and whether a matching entry is already present in the partition, using a hash function and a hash table built for the partition. For aggregation operations, if a match is found, then a measure value from the incoming record is aggregated with a measure value for the entry existing in the partition. If there is not enough system volatile memory to complete the first phase, then a partition is selected for storing persistently. Thus, only one partition at a time is stored persistently, as necessary. In the second phase, one persistently stored partition is processed at a time, whereby aggregation of the data in that partition is completed and results are returned.
摘要翻译：哈希聚合分为两个阶段。在第一阶段，从基础行源读取的数据在具有即时聚合的GROUP BY密钥上进行分区。确定哪个分区对应于输入记录的条目应该被分组，以及使用为该分区构建的散列函数和哈希表是否已经存在分区中的匹配条目。对于聚合操作，如果找到匹配项，则来自记录的度量值将与分区中存在的条目的度量值进行聚合。如果没有足够的系统易失性存储器来完成第一阶段，则选择一个分区来持久存储。因此，必要时，一次只能存储一个分区。在第二阶段，一次处理一个持久存储的分区，从而完成该分区中的数据的聚合，并返回结果。

59. 发明授权

US07051034B1 Dynamic optimization for processing a restartable sub-tree of a query execution plan 有权
标题翻译：用于处理查询执行计划的可重新启动的子树的动态优化
公开(公告)号：US07051034B1
公开(公告)日：2006-05-23
申请号：US10325782
申请日：2002-12-18
申请人： Bhaskar Ghosh , Thierry Cruanes , Benoit Dageville
发明人： Bhaskar Ghosh , Thierry Cruanes , Benoit Dageville
IPC分类号： G06F17/30
CPC分类号： G06F17/30625 , G06F17/30979 , Y10S707/99942 , Y10S707/99945
摘要： Execution of a restartable sub-tree of a query execution plan comprises determining whether use of parallel processes is a preferred or optimal mode of executing the sub-tree. The determination is based, at least in part, on how long it takes to restart the sub-tree using two or more parallel processes and/or how long it takes to probe the sub-tree, i.e., to fetch a row that meets one or more conditions or correlations associated with the sub-query, using the two or more parallel processes. Thus, a dynamic computational cost-based operation is described, which determines at query runtime whether to execute the restartable sub-tree using a single server process or multiple parallel server processes.
摘要翻译：执行查询执行计划的可重新开始的子树包括确定并行进程的使用是否是执行子树的优选或最佳模式。该决定至少部分地基于使用两个或更多个并行进程重新启动子树所需的时间和/或探测子树需要多长时间，即，获取满足一个或更多与子查询相关联的条件或相关性，使用两个或多个并行进程。因此，描述了基于动态计算成本的操作，其在查询运行时确定是否使用单个服务器进程或多个并行服务器进程来执行可重新启动的子树。

60. 发明申请

US20050131879A1 Parallel single cursor model on multiple-server configurations 有权
标题翻译：多服务器配置上的并行单光标模型
公开(公告)号：US20050131879A1
公开(公告)日：2005-06-16
申请号：US10901411
申请日：2004-07-27
申请人： Bhaskar Ghosh , Thierry Cruanes , Benoit Dageville , Shrikanth Shankar
发明人： Bhaskar Ghosh , Thierry Cruanes , Benoit Dageville , Shrikanth Shankar
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30445 , Y10S707/99933 , Y10S707/99934
摘要： A cursor that is generated from an original database statement includes a master plan that is shared among the various participants involved in the parallel execution of the operations specified in the original statement. For participants that cannot share the same cursor, such as slave processes on remote servers, a remote cursor is generated. Signatures are generated for both the master plan and the remote plans, and compared to ensure that the remote plans are equivalent to the master plans. Various parameters and statistics are provided to remote servers to increase the likelihood that the remote plans will be equivalent to the master plan.
摘要翻译：从原始数据库语句生成的游标包括在并行执行原始语句中指定的操作的各参与者之间共享的主计划。对于无法共享相同光标的参与者（如远程服务器上的从属进程），将生成远程光标。为主计划和远程计划生成签名，并进行比较，以确保远程计划等同于主计划。向远程服务器提供了各种参数和统计信息，以增加远程计划与主计划相当的可能性。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式