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

21. 发明申请

US20120072412A1 EVALUATING EXECUTION PLAN CHANGES AFTER A WAKEUP THRESHOLD TIME 失效
标题翻译：在唤醒时间后评估执行计划更改
公开(公告)号：US20120072412A1
公开(公告)日：2012-03-22
申请号：US12885847
申请日：2010-09-20
申请人： Robert J. Bestgen , Robert V. Downer , Brian R. Muras
发明人： Robert J. Bestgen , Robert V. Downer , Brian R. Muras
IPC分类号： G06F17/30
CPC分类号： G06F17/30474
摘要： In an embodiment an execution plan for a query is created. A wakeup threshold is set proportional to an amount of time taken by the creation of the execution plan. In various embodiments, the wakeup threshold is increased by a percentage equal to one minus a percentage of free resources at a computer system, is increased inversely proportional to an amount of execution time of a previous execution of the execution plan, or is decreased proportional to a number of times the execution plan was executed. A portion of the execution plan is executed to produce a portion of rows in a result set until the wakeup threshold expires. After the wakeup threshold expires, changes to the execution plan are evaluated.
摘要翻译：在一个实施例中，创建用于查询的执行计划。唤醒阈值与创建执行计划所花费的时间量成正比。在各种实施例中，唤醒阈值增加一个等于一个减去计算机系统上的空闲资源百分比的百分比，与执行计划的先前执行的执行时间量成反比，或者与执行计划执行的次数。执行执行计划的一部分以产生结果集中的一部分行，直到唤醒阈值到期为止。唤醒阈值到期后，将对执行计划进行更改。

22. 发明申请

US20090271360A1 Assigning Plan Volatility Scores to Control Reoptimization Frequency and Number of Stored Reoptimization Plans 审中-公开
标题翻译：分配计划波动率分数来控制优化频率和存储优化计划数量
公开(公告)号：US20090271360A1
公开(公告)日：2009-10-29
申请号：US12109592
申请日：2008-04-25
申请人： Robert J. Bestgen , Shantan Kethireddy
发明人： Robert J. Bestgen , Shantan Kethireddy
IPC分类号： G06F17/30
CPC分类号： G06F16/24542
摘要： Methods, systems, and computer program products are provided for improving the processing of database queries. Some embodiments include generating volatility scores for various plans for executing similar database queries. Different embodiments may utilize: database statistics, the variable values being selected for, and/or historical run time data, to generate the plan volatility scores. In some embodiments, the volatility scores are used to determine whether to generate a new plan for a query, whether to prune an existing plan, and/or how many different plans to store for a query.
摘要翻译：提供了方法，系统和计算机程序产品，用于改进数据库查询的处理。一些实施例包括生成用于执行类似数据库查询的各种计划的波动率分数。不同的实施例可以利用：数据库统计，为...选择的变量值和/或历史运行时间数据，以产生计划波动率分数。在一些实施例中，使用波动率分数来确定是否生成用于查询的新计划，是否修剪现有计划，和/或为查询存储多少不同计划。

23. 发明申请

US20080183684A1 Caching an Access Plan for a Query 审中-公开
标题翻译：缓存查询访问计划
公开(公告)号：US20080183684A1
公开(公告)日：2008-07-31
申请号：US11627672
申请日：2007-01-26
申请人： Robert J. Bestgen , Michael S. Faunce , Wei Hu , Shantan Kethireddy , Andrew P. Passe , Ulrich Thiemann
发明人： Robert J. Bestgen , Michael S. Faunce , Wei Hu , Shantan Kethireddy , Andrew P. Passe , Ulrich Thiemann
IPC分类号： G06F17/30
CPC分类号： G06F16/24542
摘要： Methods, apparatus, and products are disclosed for caching an access plan for a query that include: receiving, in a SQL module of a DBMS, a SQL query that specifies data for retrieval from a database, the database characterized by database statistics, the SQL query characterized by one or more host variable values; generating, by the SQL module, an access plan in dependence upon the SQL query; calculating, by the SQL module, a routing code for the SQL query in dependence upon the host variable values of the SQL query and a portion of the database statistics; and storing, by the SQL module, the access plan in an access plan cache, including associating with the access plan the routing code for the SQL query and the portion of the database statistics used to calculate the routing code.
摘要翻译：公开了用于缓存查询的访问计划的方法，装置和产品，其包括：在DBMS的SQL模块中接收指定用于从数据库检索的数据的SQL查询，数据库统计特征的数据库，SQL 查询由一个或多个主机变量值表征; 由SQL模块生成依赖于SQL查询的访问计划; 根据SQL查询的主机变量值和数据库统计的一部分，由SQL模块计算SQL查询的路由代码; 并且由SQL模块将访问计划存储在访问计划高速缓存中，包括与访问计划关联，用于SQL查询的路由代码和用于计算路由代码的数据库统计信息的部分。

24. 发明授权

US09563538B2 Code path tracking 有权
标题翻译：代码路径跟踪
公开(公告)号：US09563538B2
公开(公告)日：2017-02-07
申请号：US13443140
申请日：2012-04-10
申请人： Robert J. Bestgen , Robert D. Driesch, Jr. , Wei Hu , Shantan Kethireddy , Edward J. Miller , Andrew P. Passe , Ulrich Thiemann
发明人： Robert J. Bestgen , Robert D. Driesch, Jr. , Wei Hu , Shantan Kethireddy , Edward J. Miller , Andrew P. Passe , Ulrich Thiemann
IPC分类号： G06F9/44 , G06F11/36 , G06F11/34 , G06F9/45
CPC分类号： G06F11/3636 , G06F8/443 , G06F11/3476 , G06F11/3612 , G06F2201/865
摘要： Methods, systems, and products are provided for code path tracking. Embodiments include identifying an instrumented trace point in software code to be path tracked; identifying a function executed at the instrumented trace point in the software code; identifying parameters for the function executed at the instrumented trace point; and recording a description of the function, the parameters, and the result of the execution of the function using the parameters.
摘要翻译：提供方法，系统和产品用于代码路径跟踪。实施例包括识别要路径跟踪的软件代码中的仪表化跟踪点; 识别在软件代码中的仪表化跟踪点执行的功能; 识别在仪器化跟踪点执行的功能的参数; 并使用参数记录功能的描述，参数和执行功能的结果。

25. 发明授权

US08738632B2 Encoded matrix index 有权
标题翻译：编码矩阵索引
公开(公告)号：US08738632B2
公开(公告)日：2014-05-27
申请号：US13422560
申请日：2012-03-16
申请人： Robert J. Bestgen , Thomas J. Eggebraaten , Jeffrey W. Tenner
发明人： Robert J. Bestgen , Thomas J. Eggebraaten , Jeffrey W. Tenner
IPC分类号： G06F17/30
CPC分类号： G06F17/30324 , G06F19/28
摘要： A method, apparatus, and program product are provided for creating an Encoded Matrix Index for a column in a database table. An element of the column for all rows in the database table is compared to a corresponding reference value in a reference data structure, and in response to at least one value for the element of the column not matching the reference value, indicating a variation in a variation data structure and creating a value data structure. Queries executed using the Encoded Matrix Index include terms associated with a sub-column defined in a column of a database table. The variation data structure is accessed to determine whether any variation exists between rows belonging to a sub-column of the database table. If no variation exists, a value is accessed from the reference data structure; otherwise, a value for each row of the sub-column is accessed from a value data structure.
摘要翻译：提供了一种方法，装置和程序产品，用于为数据库表中的列创建编码矩阵索引。将数据库表中所有行的列的元素与参考数据结构中的对应参考值进行比较，并响应于不匹配参考值的列的元素的至少一个值，指示在变化数据结构和创建价值数据结构。使用编码矩阵索引执行的查询包括与数据库表的列中定义的子列相关联的术语。访问变体数据结构以确定属于数据库表的子列的行之间是否存在变化。如果不存在变化，则从参考数据结构访问值; 否则，从值数据结构访问子列的每一行的值。

26. 发明申请

US20120158698A1 EXECUTION PLANS WITH DIFFERENT DRIVER SOURCES IN MULTIPLE THREADS 有权
标题翻译：在多个螺纹中执行不同驱动器源的程序
公开(公告)号：US20120158698A1
公开(公告)日：2012-06-21
申请号：US12974538
申请日：2010-12-21
申请人： Robert J. Bestgen , Robert V. Downer , Brian R. Muras
发明人： Robert J. Bestgen , Robert V. Downer , Brian R. Muras
IPC分类号： G06F17/30
CPC分类号： G06F17/30463
摘要： In an embodiment, a first driver source specified by a first execution plan that implements a query is designated, and a second driver source specified by a second execution plan that implements the query is designated. A portion of the first execution plan and a portion of the second execution plan are executed. If a unique identifier of a first row returned by the executing the portion of the first execution plan does not match all unique identifiers of all rows from the second driver source that were saved to a result set by the executing the portion of the second execution plan, then the first row returned by the executing the portion of the first execution plan is added to the result set and the unique identifier of the first row that was returned by the executing the portion of the first execution plan is added to a unique identifier log.
摘要翻译：在一个实施例中，指定由执行查询的第一执行计划指定的第一驱动器源，并且指定由实现查询的第二执行计划指定的第二驱动器源。执行第一执行计划的一部分和第二执行计划的一部分。如果执行第一执行计划的部分返回的第一行的唯一标识符与执行第二执行计划的部分而保存到结果集的第二驱动程序源的所有行的所有唯一标识符不匹配，则执行第一执行计划的部分返回的第一行被添加到结果集中，并且由执行第一执行计划的部分返回的第一行的唯一标识符被添加到唯一的标识符日志。

27. 发明授权

US07941426B2 Optimizing database queries 失效
标题翻译：优化数据库查询
公开(公告)号：US07941426B2
公开(公告)日：2011-05-10
申请号：US12117037
申请日：2008-05-08
申请人： Robert J. Bestgen , Wei Hu , Shantan Kethireddy , Andrew P. Passe , Ulrich Thiemann
发明人： Robert J. Bestgen , Wei Hu , Shantan Kethireddy , Andrew P. Passe , Ulrich Thiemann
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30463 , G06F9/5027 , G06F9/5094 , Y02D10/22 , Y02D10/45
摘要： Techniques for optimizing database queries for energy efficiency. A query optimizer is configured to compare energy requirements of query plans, and to select a query plan requiring minimal energy to execute. The query optimizer may also compare time performance of the query plans, and may select a query plan by matching to a user preference for a relative priority between energy requirements and time performance.
摘要翻译：优化数据库查询能效的技术。查询优化器被配置为比较查询计划的能量需求，并选择需要最少能量执行的查询计划。查询优化器还可以比较查询计划的时间性能，并且可以通过匹配用户对能量需求和时间性能之间的相对优先级的偏好来选择查询计划。

28. 发明申请

US20090281992A1 Optimizing Database Queries 失效
标题翻译：优化数据库查询
公开(公告)号：US20090281992A1
公开(公告)日：2009-11-12
申请号：US12117037
申请日：2008-05-08
申请人： Robert J. Bestgen , Wei Hu , Shantan Kethireddy , Andrew P. Passe , Ulrich Thiemann
发明人： Robert J. Bestgen , Wei Hu , Shantan Kethireddy , Andrew P. Passe , Ulrich Thiemann
IPC分类号： G06F7/06 , G06F1/32 , G06F17/30
CPC分类号： G06F17/30463 , G06F9/5027 , G06F9/5094 , Y02D10/22 , Y02D10/45
摘要： Embodiments of the invention provide techniques for optimizing database queries for energy efficiency. In general, a query optimizer is configured to compare energy requirements of query plans, and to select a query plan requiring minimal energy to execute. In one embodiment, the query optimizer may also compare time performance of the query plans, and may select a query plan by matching to a user preference for a relative priority between energy requirements and time performance.
摘要翻译：本发明的实施例提供了用于优化能量效率的数据库查询的技术。通常，查询优化器被配置为比较查询计划的能量需求，并选择需要最少能量执行的查询计划。在一个实施例中，查询优化器还可以比较查询计划的时间性能，并且可以通过与能量需求和时间性能之间的相对优先级的用户偏好匹配来选择查询计划。

29. 发明申请

US20090276393A1 Implementing Aggregation Combination Using Aggregate Depth Lists and Cube Aggregation Conversion to Rollup Aggregation for Optimizing Query Processing 失效
标题翻译：使用聚合深度列表和立方体聚合转换到汇总聚合来优化查询处理来实现聚合组合
公开(公告)号：US20090276393A1
公开(公告)日：2009-11-05
申请号：US12113259
申请日：2008-05-01
申请人： Robert J. Bestgen , David G. Carlson , Robert V. Downer , Shantan Kethireddy
发明人： Robert J. Bestgen , David G. Carlson , Robert V. Downer , Shantan Kethireddy
IPC分类号： G06F7/06
CPC分类号： G06F17/30442 , Y10S707/99931 , Y10S707/99933 , Y10S707/99935
摘要： A process combines multiple grouping sets into single rollup sets with depth lists defining the levels of grouping that must be performed. Grouping sets are identified that are contained within other sets and combined into single rollups with depth lists. Cube aggregation conversion to rollup aggregation is provided for optimizing database query processing. Natural sets of rollup hierarchies within a cube are recognized and the cube is converted into those rollup hierarchies. Once converted, the rollup aggregation is performed to significantly reduce required processing.
摘要翻译：一个进程将多个分组集合组合成单个汇总集合，其深度列表定义必须执行的分组级别。识别分组集合，其包含在其他集合中，并且与深度列表组合成单个汇总。提供了多维数据集汇总转换为汇总汇总，用于优化数据库查询处理。多维数据集中的自然集合层次结构被识别，并将多维数据集转换为这些汇总层次结构。一旦转换，执行汇总汇总以显着减少所需的处理。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式