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

21. 发明授权

US08214807B2 Code path tracking 有权
标题翻译：代码路径跟踪
公开(公告)号：US08214807B2
公开(公告)日：2012-07-03
申请号：US11621666
申请日：2007-01-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
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.
摘要翻译：提供方法，系统和产品用于代码路径跟踪。实施例包括识别要路径跟踪的软件代码中的仪表化跟踪点; 识别在软件代码中的仪表化跟踪点执行的功能; 识别在仪器化跟踪点执行的功能的参数; 并使用参数记录功能的描述，参数和执行功能的结果。

22. 发明授权

US08037059B2 Implementing aggregation combination using aggregate depth lists and cube aggregation conversion to rollup aggregation for optimizing query processing 失效
标题翻译：使用聚合深度列表和多维数据集聚合转换实现聚合组合以进行汇总聚合，以优化查询处理
公开(公告)号：US08037059B2
公开(公告)日：2011-10-11
申请号：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分类号： G06F17/30
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.
摘要翻译：一个进程将多个分组集合组合成单个汇总集合，其深度列表定义必须执行的分组级别。识别分组集合，其包含在其他集合中，并且与深度列表组合成单个汇总。提供了多维数据集汇总转换为汇总汇总，用于优化数据库查询处理。多维数据集中的自然集合层次结构被识别，并将多维数据集转换为这些汇总层次结构。一旦转换，执行汇总汇总以显着减少所需的处理。

23. 发明授权

US07987200B2 Method and apparatus for predicting selectivity of database query join conditions using hypothetical query predicates having skewed value constants 有权
标题翻译：使用具有偏差值常数的假设查询谓词来预测数据库查询连接条件的选择性的方法和装置
公开(公告)号：US07987200B2
公开(公告)日：2011-07-26
申请号：US11931255
申请日：2007-10-31
申请人： Michael S. Faunce , Shantan Kethireddy , Brian Robert Muras
发明人： Michael S. Faunce , Shantan Kethireddy , Brian Robert Muras
IPC分类号： G06F7/00
CPC分类号： G06F17/30469 , G06F17/30474 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945
摘要： A database management system predicts a selectivity for database query conditions requiring a join of records from different tables. The system identifies at least one skewed value in a field specified in the join condition, and constructs, for each skewed value, a set of hypothetical query predicates in which the field specified in the join condition is replaced with a constant equal to the skewed value. The system then predicts the selectivity for the hypothetical predicates, using any appropriate prediction technique. The selectivities of the hypothetical predicates are used to predict a selectivity for the original query.
摘要翻译：数据库管理系统预测数据库查询条件的选择性需要来自不同表的记录的连接。系统识别在连接条件中指定的字段中的至少一个偏斜值，并且针对每个偏斜值构造一组假设查询谓词，其中在连接条件中指定的字段被等于倾斜值的常数替换。然后，系统使用任何适当的预测技术来预测假设谓词的选择性。假设谓词的选择性用于预测原始查询的选择性。

24. 发明授权

US07831569B2 Preserving a query plan cache 有权
标题翻译：保留查询计划缓存
公开(公告)号：US07831569B2
公开(公告)日：2010-11-09
申请号：US11870118
申请日：2007-10-10
申请人： Robert Joseph Bestgen , Shantan Kethireddy , John Matthew Santosuosso
发明人： Robert Joseph Bestgen , Shantan Kethireddy , John Matthew Santosuosso
IPC分类号： G06F7/00
CPC分类号： G06F11/2097 , G06F11/2071 , G06F11/3476 , G06F17/30306
摘要： A method, apparatus, and program product are provided for preserving a query plan cache on a backup system having a dataspace containing a copy of data and a copy of a query plan cache from a production system. An update is initiated of at least a portion of the copy of the data on the backup system with a portion of the data on the production system. A merge is initiated of updated query plans in the query plan cache from the production system with corresponding query plans in the copy of the query plan cache on the backup system. Objects are correlated in the updated query plans in the copy of the query plan cache with the updated copy of the data on the backup system.
摘要翻译：提供了一种方法，装置和程序产品，用于在备份系统上保留查询计划缓存，该备份系统具有包含来自生产系统的数据副本和查询计划缓存副本的数据空间。在备份系统上的数据的副本的至少一部分的一个更新是在生产系统上的一部分数据发起的。在生产系统的查询计划缓存中启动更新的查询计划的合并，并在备份系统上的查询计划缓存的副本中具有对应的查询计划。对象在查询计划缓存的副本中的更新的查询计划中与备份系统上更新的数据副本相关联。

25. 发明授权

US07734615B2 Performance data for query optimization of database partitions 有权
标题翻译：数据库分区查询优化的性能数据
公开(公告)号：US07734615B2
公开(公告)日：2010-06-08
申请号：US11138832
申请日：2005-05-26
申请人： Mark John Anderson , Robert Joseph Bestgen , Shantan Kethireddy , Jeffrey Wayne Tenner
发明人： Mark John Anderson , Robert Joseph Bestgen , Shantan Kethireddy , Jeffrey Wayne Tenner
IPC分类号： G06F17/30
CPC分类号： G06F17/30312
摘要： A method, apparatus, system, and signal-bearing medium that, in an embodiment, determine performance data for query optimization of a query directed to a database table having multiple partitions. The performance data for the query optimization is presented in a user interface, and an option is provided in the user interface to create a non-spanning index for any of the partitions mentioned in the performance data. In various embodiments, determining the performance data may include: determining the partitions that were unexpanded by the query optimization, determining the partitions that had a runtime estimate that was different from an actual query runtime by a threshold, determining whether any of the partitions had expansion forced by a client request, determining whether the query performed partition elimination, determining whether any of the partitions has an associated index that is unused by the query and that also has a key that is not present in all of the partitions, and determining a constraint for partition elimination.
摘要翻译：一种方法，装置，系统和信号承载介质，其在一个实施例中确定用于针对具有多个分区的数据库表的查询的查询优化的性能数据。查询优化的性能数据在用户界面中呈现，并且在用户界面中提供了一个选项，以便为演奏数据中提到的任何分区创建非跨度索引。在各种实施例中，确定性能数据可以包括：确定由查询优化未展开的分区，将具有与实际查询运行时间不同的运行时间估计的分区确定为阈值，确定是否有任何分区具有扩展通过客户端请求强制，确定查询是否执行分区消除，确定任何分区是否具有由查询未使用的关联索引，并且还具有不存在于所有分区中的密钥，以及确定约束用于分区消除。

26. 发明申请

US20090281986A1 Generating Database Query Plans 失效
标题翻译：生成数据库查询计划
公开(公告)号：US20090281986A1
公开(公告)日：2009-11-12
申请号：US12117070
申请日：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分类号： G06F17/30
CPC分类号： G06F17/30463 , 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.
摘要翻译：本发明的实施例提供了用于优化能量效率的数据库查询的技术。通常，查询优化器被配置为比较查询计划的能量需求，并选择需要最少能量执行的查询计划。在一个实施例中，查询优化器还可以比较查询计划的时间性能，并且可以通过与能量需求和时间性能之间的相对优先级的用户偏好匹配来选择查询计划。

27. 发明申请

US20090276394A1 OBTAINING A PLAN FOR EXECUTING A QUERY IN A RELATIONAL DATABASE 失效
标题翻译：获得在关系数据库中执行查询的计划
公开(公告)号：US20090276394A1
公开(公告)日：2009-11-05
申请号：US12114913
申请日：2008-05-05
申请人： 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
CPC分类号： G06F17/3048 , G06F17/30463
摘要： A plan for executing a query in a relational database is obtained. A query for accessing data in the relational database is received. The query specifies N tables in the relational database from which data is to be retrieved. A determination is made whether a syntax of the query matches a syntax of a plan in a plan cache for executing the query. Matches are identified between generic table formats of the N tables specified in the query to generic table formats of N tables specified in the plan responsive to the syntax of the query matching the syntax of a plan in the plan cache for executing the query. The plan for executing the query is obtained based on whether the syntax of the query matches the syntax of the plan and based on identified matches between the generic table formats of the N tables specified in the query to the generic table formats of the N tables specified in the plan.
摘要翻译：获得在关系数据库中执行查询的计划。接收到关系数据库中访问数据的查询。该查询指定要从中检索数据的关系数据库中的N个表。确定查询的语法是否符合用于执行查询的计划高速缓存中的计划的语法。在查询中指定的N个表的通用表格式之间的匹配在计划中指定的N个表的通用表格式中被标识，响应于查询的语法，该查询的语法与计划缓存中用于执行查询的计划的语法相匹配。执行查询的计划是基于查询的语法是否符合计划的语法，并且基于查询中指定的N个表的通用表格格式与指定的N个表的通用表格式之间的所确定的匹配来获得在计划中。

28. 发明申请

US20080301085A1 Dynamic Database File Column Statistics for Arbitrary Union Combination 审中-公开
标题翻译：动态数据库文件列统计任意组合
公开(公告)号：US20080301085A1
公开(公告)日：2008-12-04
申请号：US11755954
申请日：2007-05-31
申请人： Michael S. Faunce , Wei Hu , Shantan Kethireddy , Andrew Peter Passe , Ulrich Thiemann
发明人： Michael S. Faunce , Wei Hu , Shantan Kethireddy , Andrew Peter Passe , Ulrich Thiemann
IPC分类号： G06F7/00
CPC分类号： G06F16/24544
摘要： Embodiments of the invention provide techniques for generating database statistics for optimizing union queries. In general, working sets including samples of values in database columns are persistently maintained in a database. To optimize a union query, the working sets describing the columns included in the union query are combined to generate an ad hoc working set. The ad hoc working set is then used to generate a database statistic describing the combined columns. In another embodiment, working sets may also be maintained for generating statistics for optimizing non-union queries, thus enabling statistics to be refreshed more frequently.
摘要翻译：本发明的实施例提供了用于生成用于优化联合查询的数据库统计的技术。一般来说，包括数据库列中的值样本的工作集在数据库中持久保留。要优化联合查询，组合描述联合查询中包含的列的工作集合以生成一个特设工作集。然后，特设工作集用于生成描述组合列的数据库统计信息。在另一个实施例中，还可以维护工作集合用于生成用于优化非联合查询的统计信息，从而使统计信息更频繁地刷新。

29. 发明申请

US20080140622A1 Displaying Explain Data for a SQL Query of a Database 审中-公开
标题翻译：显示数据库的SQL查询的说明数据
公开(公告)号：US20080140622A1
公开(公告)日：2008-06-12
申请号：US11609612
申请日：2006-12-12
申请人： Robert J. Bestgen , Shantan Kethireddy , Michael D. Pfeifer
发明人： Robert J. Bestgen , Shantan Kethireddy , Michael D. Pfeifer
IPC分类号： G06F17/30
CPC分类号： G06F16/24542
摘要： Methods, apparatus, and products are disclosed for displaying explain data for a SQL query of a database that include: executing, by a SQL execution module, a SQL query in a database management system; accumulating, by the SQL execution module, actual run time data for the SQL query while executing the SQL query; and displaying, by an explain module, explain data for the SQL query while executing the SQL query, including displaying the accumulated actual run time data for the SQL query as part of the explain data for the SQL query.
摘要翻译：公开了用于显示数据库的SQL查询的说明数据的方法，装置和产品，其包括：由SQL执行模块执行数据库管理系统中的SQL查询; 在执行SQL查询时，由SQL执行模块累积SQL查询的实际运行时数据; 并且由解释模块显示在执行SQL查询时解释SQL查询的数据，包括显示SQL查询的累积实际运行时数据作为SQL查询的解释数据的一部分。

30. 发明申请

US20080114718A1 APPARATUS AND METHOD FOR DATABASE EXECUTION DETAIL REPOSITORY 失效
标题翻译：数据库执行细节报告的装置和方法
公开(公告)号：US20080114718A1
公开(公告)日：2008-05-15
申请号：US11558104
申请日：2006-11-09
申请人： Mark John Anderson , Robert Joseph Bestgen , Daniel E. Beuch , Curtis Neal Boger , James Michael Flanagan , Scott Forstie , Shantan Kethireddy , Thomas Owen McKinley , Michael Donald Pfeifer
发明人： Mark John Anderson , Robert Joseph Bestgen , Daniel E. Beuch , Curtis Neal Boger , James Michael Flanagan , Scott Forstie , Shantan Kethireddy , Thomas Owen McKinley , Michael Donald Pfeifer
IPC分类号： G06F17/30
CPC分类号： G06F17/30471 , G06F17/30306
摘要： A database query optimizer includes an access plan storage mechanism that stores execution detail corresponding to a query statement in an access plan cache. By storing execution detail in the access plan cache along with the query statement, the execution detail is available when needed to debug database problems, even after a problem occurs. The execution detail stored in the access plan cache may be mined and analyzed after-the-fact, producing a very powerful tool for debugging database problems. Snapshots of the execution detail may also be created by a user. In addition, the user may setup autonomic snapshots and comparisons so that a user may be alerted from a degradation in database performance between two snapshots.
摘要翻译：数据库查询优化器包括访问计划存储机制，其存储与访问计划高速缓存中的查询语句相对应的执行细节。通过将访问计划高速缓存中的执行详细信息与查询语句一起存储，即使在发生问题后仍需要调试数据库问题，执行细节就可用。存储在访问计划缓存中的执行细节可以在事后进行挖掘和分析，为调试数据库问题提供了非常强大的工具。执行细节的快照也可以由用户创建。此外，用户可以设置自主快照和比较，使得可以从两个快照之间的数据库性能的降级中提醒用户。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式