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

1. 发明授权

US09047135B2 Qualitative assignment of resources to a logical partition in a multipartitioned computer system 有权
标题翻译：将资源定性分配给多分区计算机系统中的逻辑分区
公开(公告)号：US09047135B2
公开(公告)日：2015-06-02
申请号：US12691891
申请日：2010-01-22
申请人： Stephanie A. Foege , Andres Gonzalez, Jr. , Shantan Kethireddy , Meryl Lo , Annita Tomko
发明人： Stephanie A. Foege , Andres Gonzalez, Jr. , Shantan Kethireddy , Meryl Lo , Annita Tomko
IPC分类号： G06F15/173 , G06F15/177 , G06F13/00 , G06F3/00 , G06F9/50
CPC分类号： G06F9/5077
摘要： A qualitative resource assignment wizard receives qualitative information for a logical partition (LPAR) and calculates computer resource assignments for the LPAR based on the qualitative information and a set of conversion functions. For example, the qualitative resource assignment wizard may calculate a processing unit assignment, a memory assignment, and an I/O slot assignment for the LPAR. The qualitative information may be input by a user, for example, utilizing a graphical user interface (GUI). In one embodiment, the conversion functions are calculated during a training phase, in which a user periodically provides qualitative information while resource usage data is gathered. The wizard may reside in a hardware management console (HMC) or other administrative console and/or may be a component of a hypervisor or other partition management code. Software code associated with the wizard may be provided by a network server application to a client system for enabling a user to remotely input the qualitative information.
摘要翻译：定性资源分配向导接收逻辑分区（LPAR）的定性信息，并根据定性信息和一组转换函数计算LPAR的计算机资源分配。例如，定性资源分配向导可以计算LPAR的处理单元分配，存储器分配和I / O时隙分配。定性信息可由用户输入，例如利用图形用户界面（GUI）。在一个实施例中，在训练阶段期间计算转换功能，其中用户在收集资源使用数据的同时周期性地提供定性信息。该向导可以驻留在硬件管理控制台（HMC）或其他管理控制台中，和/或可以是管理程序或其他分区管理代码的组件。与向导关联的软件代码可以由网络服务器应用程序提供给客户端系统，以使用户能够远程输入定性信息。

2. 发明申请

US20110185062A1 Qualitative Assignment of Resources to a Logical Partition In a Multipartitioned Computer System 有权
标题翻译：将资源定性分配给多分区计算机系统中的逻辑分区
公开(公告)号：US20110185062A1
公开(公告)日：2011-07-28
申请号：US12691891
申请日：2010-01-22
申请人： Stephanie A. Foege , Andres Gonzalez, JR. , Shantan Kethireddy , Meryl Lo , Annita Tomko
发明人： Stephanie A. Foege , Andres Gonzalez, JR. , Shantan Kethireddy , Meryl Lo , Annita Tomko
IPC分类号： G06F15/173 , G06F12/00 , G06F12/02
CPC分类号： G06F9/5077
摘要： A qualitative resource assignment wizard receives qualitative information for a logical partition (LPAR) and calculates computer resource assignments for the LPAR based on the qualitative information and a set of conversion functions. For example, the qualitative resource assignment wizard may calculate a processing unit assignment, a memory assignment, and an I/O slot assignment for the LPAR. The qualitative information may be input by a user, for example, utilizing a graphical user interface (GUI). In one embodiment, the conversion functions are calculated during a training phase, in which a user periodically provides qualitative information while resource usage data is gathered. The wizard may reside in a hardware management console (HMC) or other administrative console and/or may be a component of a hypervisor or other partition management code. Software code associated with the wizard may be provided by a network server application to a client system for enabling a user to remotely input the qualitative information.
摘要翻译：定性资源分配向导接收逻辑分区（LPAR）的定性信息，并根据定性信息和一组转换函数计算LPAR的计算机资源分配。例如，定性资源分配向导可以计算LPAR的处理单元分配，存储器分配和I / O时隙分配。定性信息可由用户输入，例如利用图形用户界面（GUI）。在一个实施例中，在训练阶段期间计算转换函数，其中用户在收集资源使用数据的同时周期性地提供定性信息。该向导可以驻留在硬件管理控制台（HMC）或其他管理控制台中，和/或可以是管理程序或其他分区管理代码的组件。与向导关联的软件代码可以由网络服务器应用程序提供给客户端系统，以使用户能够远程输入定性信息。

3. 发明授权

US08935231B2 Optimizing a query to a partitioned database table using a virtual maintained temporary index that spans multiple database partitions 有权
标题翻译：使用跨多个数据库分区的虚拟维护临时索引来优化对分区数据库表的查询
公开(公告)号：US08935231B2
公开(公告)日：2015-01-13
申请号：US12120582
申请日：2008-05-14
申请人： Robert Joseph Bestgen , Robert Victor Downer , Shantan Kethireddy
发明人： Robert Joseph Bestgen , Robert Victor Downer , Shantan Kethireddy
IPC分类号： G06F17/30
CPC分类号： G06F17/30327
摘要： A query optimizer optimizes a query to a partitioned database table by determining common characteristics of the partitions and generating a virtual maintained temporary index that spans multiple partitions. Using the virtual maintained temporary index allows the query optimizer to generate an access plan based on the virtual maintained temporary index, which relieves the optimizer from having to individually optimize access to each partition for partitions that share common characteristics.
摘要翻译：查询优化器通过确定分区的共同特征并生成跨多个分区的虚拟维护临时索引来优化对分区数据库表的查询。使用虚拟维护的临时索引允许查询优化器基于虚拟维护的临时索引生成访问计划，这减轻了优化器必须单独优化对共享共同特征的分区的每个分区的访问。

4. 发明授权

US07937385B2 Obtaining a plan for executing a query in a relational database 失效
标题翻译：获取在关系数据库中执行查询的计划
公开(公告)号：US07937385B2
公开(公告)日：2011-05-03
申请号：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分类号： G06F17/30
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个表的通用表格式之间的所确定的匹配来获得在计划中。

5. 发明申请

US20090282272A1 Organizing Databases for Energy Efficiency 有权
标题翻译：组织能源效率数据库
公开(公告)号：US20090282272A1
公开(公告)日：2009-11-12
申请号：US12117047
申请日：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分类号： G06F1/32
CPC分类号： G06F1/3203 , G06F1/206 , G06F17/30312 , Y02D10/16 , 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.
摘要翻译：本发明的实施例提供了用于优化能量效率的数据库查询的技术。通常，查询优化器被配置为比较查询计划的能量需求，并选择需要最少能量执行的查询计划。在一个实施例中，查询优化器还可以比较查询计划的时间性能，并且可以通过与能量需求和时间性能之间的相对优先级的用户偏好匹配来选择查询计划。

6. 发明申请

US20080168427A1 Code Path Tracking 有权
标题翻译：代码路径跟踪
公开(公告)号：US20080168427A1
公开(公告)日：2008-07-10
申请号：US11621666
申请日：2007-01-10
申请人： Robert J. Bestgen , Robert D. Driesch , Wei Hu , Shantan Kethireddy , Edward J. Miller , Andrew P. Passe , Ulrich Thiemann
发明人： Robert J. Bestgen , Robert D. Driesch , 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.
摘要翻译：提供方法，系统和产品用于代码路径跟踪。实施例包括识别要路径跟踪的软件代码中的仪表化跟踪点; 识别在软件代码中的仪表化跟踪点执行的功能; 识别在仪器化跟踪点执行的功能的参数; 并使用参数记录功能的描述，参数和执行功能的结果。

7. 发明申请

US20070016558A1 Method and apparatus for dynamically associating different query execution strategies with selective portions of a database table 失效
标题翻译：用于将不同查询执行策略与数据库表的选择性部分动态关联的方法和装置
公开(公告)号：US20070016558A1
公开(公告)日：2007-01-18
申请号：US11181713
申请日：2005-07-14
申请人： Robert Bestgen , Shantan Kethireddy , Jeffrey Tenner
发明人： Robert Bestgen , Shantan Kethireddy , Jeffrey Tenner
IPC分类号： G06F17/30
CPC分类号： G06F17/3053 , G06F17/30545
摘要： A query facility for database queries dynamically determines whether selective portions of a database table are likely to benefit from separate query execution strategies, and constructs an appropriate separate execution strategies accordingly. Preferably, the database contains at least one relatively large table comprising multiple partitions, each sharing the definitional structure of the table and containing a different respective discrete subset of the table records. The query facility compares metadata for different partitions to determine whether sufficiently large differences exist among the partitions, and in appropriate cases selects one or more partitions for separate execution strategies. Preferably, partitions are ranked for separate evaluation using a weighting formula which takes into account: (a) the number of indexes for the partition, (b) recency of change activity, and (c) the size of the partition.
摘要翻译：用于数据库查询的查询工具动态地确定数据库表的选择性部分是否可能受益于单独的查询执行策略，并相应地构建适当的单独的执行策略。优选地，数据库包含至少一个包括多个分区的相对较大的表，每个分区共享表的定义结构，并且包含表记录的不同相应离散子集。查询设施比较不同分区的元数据，以确定分区之间是否存在足够大的差异，并且在适当的情况下选择一个或多个分区用于单独的执行策略。优选地，使用考虑到的加权公式对分区进行分级评估：（a）分区的索引的数量，（b）更改活动的新近度，以及（c）分区的大小。

8. 发明授权

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

9. 发明授权

US07958158B2 Aggregating database queries 失效
标题翻译：聚合数据库查询
公开(公告)号：US07958158B2
公开(公告)日：2011-06-07
申请号：US12142182
申请日：2008-06-19
申请人： Robert Joseph Bestgen , Wei Hu , Shantan Kethireddy , Andrew Peter Passe , Ulrich Thiemann
发明人： Robert Joseph Bestgen , Wei Hu , Shantan Kethireddy , Andrew Peter Passe , Ulrich Thiemann
IPC分类号： G06F7/00
CPC分类号： G06F17/30442 , Y02D10/45
摘要： Embodiments of the invention provide techniques for aggregating database queries for energy efficiency. In one embodiment, queries received by a DBMS are aggregated and staged according to hard-disk drives required for query execution. Each group of queries accessing a given drive may be dispatched for execution together. Further, the queries received by a DBMS may be matched to patterns of previously received queries. The matching patterns may be used to predict other queries which are likely to be received by the DBMS. The received queries may be staged to be dispatched with the predicted queries. By aggregating queries to be executed, access to each hard-disk drive may be optimized, thus reducing the overall energy consumption required for executing the queries.
摘要翻译：本发明的实施例提供了用于聚合用于能量效率的数据库查询的技术。在一个实施例中，由DBMS接收的查询根据查询执行所需的硬盘驱动器进行聚合和分段。可以一起调度访问给定驱动器的每组查询。此外，由DBMS接收的查询可以与之前接收到的查询的模式相匹配。匹配模式可用于预测DBMS可能接收到的其他查询。所接收的查询可以被分段以用预测的查询进行调度。通过聚合要执行的查询，可以优化对每个硬盘驱动器的访问，从而降低执行查询所需的总体能量消耗。

10. 发明申请

US20100036805A1 System Maintainable and Reusable I/O Value Caches 审中-公开
标题翻译：系统可维护和可重用的I / O值缓存
公开(公告)号：US20100036805A1
公开(公告)日：2010-02-11
申请号：US12185853
申请日：2008-08-05
申请人： Thomas William Blamer , Wei Hu , Kevin James Kathmann , Shantan Kethireddy , Andrew Peter Passe , Ulrich Thiemann
发明人： Thomas William Blamer , Wei Hu , Kevin James Kathmann , Shantan Kethireddy , Andrew Peter Passe , Ulrich Thiemann
IPC分类号： G06F17/30
CPC分类号： G06F16/24539
摘要： Embodiments of the invention provide techniques for maintaining I/O value caches for database queries. Each maintained cache may be configured for use with a particular database query. Each cache may be persistently maintained in a system, meaning the cache is not automatically deleted after some period of time, and may thus be used to process subsequent instances of the same query. By use of the maintained cache, executing subsequent instances of the query may be avoided, thus saving time and system resources. Further, the maintained cache may be adapted to process other queries having similar characteristics to the initial query. The data included in each cache may be refreshed as required by changes to the underlying data.
摘要翻译：本发明的实施例提供了用于维护用于数据库查询的I / O值高速缓存的技术。每个维护的缓存可以被配置为与特定数据库查询一起使用。每个高速缓存可以被持续地维护在系统中，这意味着高速缓存在一段时间之后不被自动删除，并且因此可以用于处理同一查询的后续实例。通过使用维护的缓存，可以避免执行后续的查询实例，从而节省时间和系统资源。此外，维护的高速缓存可以适于处理具有与初始查询相似的特征的其他查询。每个缓存中包括的数据可以根据底层数据的更改的要求进行刷新。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式