利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

10 条记录 (耗时 0.033 秒)

    METHOD AND SYSTEM MANAGING A DATABASE SYSTEM USING A POLICY FRAMEWORK
    1.
    发明申请
    METHOD AND SYSTEM MANAGING A DATABASE SYSTEM USING A POLICY FRAMEWORK 审中-公开
    使用政策框架的数据库系统的方法和系统管理

    公开(公告)号：US20080155641A1

    公开(公告)日：2008-06-26

    申请号：US11614024

    申请日：2006-12-20

    申请人： Thomas A. Beavin ,  Baoqiu Cui ,  You-Chin Fuh ,  William Y. Kyu ,  Adarsh R. Pannu ,  Lin Qiao ,  Basuki N. Soetarman

    发明人： Thomas A. Beavin ,  Baoqiu Cui ,  You-Chin Fuh ,  William Y. Kyu ,  Adarsh R. Pannu ,  Lin Qiao ,  Basuki N. Soetarman

    IPC分类号： G06F17/00

    CPC分类号： G06F16/217 ,  G06F16/21

    摘要： A method and system for managing a computer system are described. The method and system include defining and storing a policy using a policy manager. In one aspect, the policy manager also activates and resolves conflicts between policies. The policy is a declarative statement of a directive to be carried out by the computer system. The method and system also include using a policy executor to determine whether a request to the computer system is covered by the policy. The method and system further include utilizing the computer system to carry out the directive for the policy if the request is covered by the policy through a policy enforcer.

    摘要翻译： 描述了一种用于管理计算机系统的方法和系统。 该方法和系统包括使用策略管理器来定义和存储策略。 一方面，策略管理器也激活和解决策略之间的冲突。 该策略是由计算机系统执行的指令的声明性声明。 该方法和系统还包括使用策略执行器来确定对策略是否覆盖对计算机系统的请求。 该方法和系统还包括利用计算机系统执行策略的指示，如果该请求被策略执行者所涵盖。

    Query execution plan efficiency in a database management system
    2.
    发明授权
    Query execution plan efficiency in a database management system 有权
    在数据库管理系统中查询执行计划效率

    公开(公告)号：US08060495B2

    公开(公告)日：2011-11-15

    申请号：US12255520

    申请日：2008-10-21

    申请人： Thomas A. Beavin ,  Patrick D. Bossman ,  You-Chin Fuh ,  Adarsh R. Pannu ,  Terence P. Purcell

    发明人： Thomas A. Beavin ,  Patrick D. Bossman ,  You-Chin Fuh ,  Adarsh R. Pannu ,  Terence P. Purcell

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30463

    摘要： An apparatus, system, and method are disclosed for improving query execution plan efficiency in a database management system. The present invention binds both static database queries and dynamic database queries to new query execution plans (QEPs) that produce the same result set as a former QEP bound to the database queries. Next, the present invention identifies one of the former QEPs and the new QEP as an active QEP and automatically collects execution statistics for one of the former QEPs and the new QEP. Finally, the present invention automatically selects one of the former QEPs and the new QEP as the active QEP in response to completion of the automatic collection of execution statistics, the active QEP selected such that the automatically selected QEP provides optimal execution performance based on performance criteria in comparison to the automatically unselected QEP, the active QEP selected based on the execution statistics.

    摘要翻译： 公开了一种用于提高数据库管理系统中的查询执行计划效率的装置，系统和方法。 本发明将静态数据库查询和动态数据库查询绑定到新的查询执行计划（QEP），该查询执行计划（QEP）产生与数据库查询绑定的前一个QEP相同的结果集。 接下来，本发明将前一个QEP和新的QEP之一识别为活动QEP，并自动收集前一个QEP和新的QEP之一的执行统计信息。 最后，本发明响应于完成执行统计的自动收集而自动选择前者QEP和新QEP中的一个作为活动QEP，选择活动QEP使得自动选择的QEP基于性能标准提供最佳执行性能 与自动未选择的QEP相比，基于执行统计信息选择活动QEP。

    QUERY EXECUTION PLAN EFFICIENCY IN A DATABASE MANAGEMENT SYSTEM
    3.
    发明申请
    QUERY EXECUTION PLAN EFFICIENCY IN A DATABASE MANAGEMENT SYSTEM 有权
    查询执行数据库管理系统中的计划效率

    公开(公告)号：US20100114868A1

    公开(公告)日：2010-05-06

    申请号：US12255520

    申请日：2008-10-21

    申请人： Thomas A. Beavin ,  Patrick D. Bossman ,  You-Chin Fuh ,  Adarsh R. Pannu ,  Terence P. Purcell

    发明人： Thomas A. Beavin ,  Patrick D. Bossman ,  You-Chin Fuh ,  Adarsh R. Pannu ,  Terence P. Purcell

    IPC分类号： G06F17/30 ,  G06F7/00

    CPC分类号： G06F17/30463

    摘要： An apparatus, system, and method are disclosed for improving query execution plan efficiency in a database management system. The present invention binds both static database queries and dynamic database queries to new query execution plans (QEPs) that produce the same result set as a former QEP bound to the database queries. Next, the present invention identifies one of the former QEPs and the new QEP as an active QEP and automatically collects execution statistics for one of the former QEPs and the new QEP. Finally, the present invention automatically selects one of the former QEPs and the new QEP as the active QEP in response to completion of the automatic collection of execution statistics, the active QEP selected such that the automatically selected QEP provides optimal execution performance based on performance criteria in comparison to the automatically unselected QEP, the active QEP selected based on the execution statistics.

    摘要翻译： 公开了一种用于提高数据库管理系统中的查询执行计划效率的装置，系统和方法。 本发明将静态数据库查询和动态数据库查询绑定到新的查询执行计划（QEP），该查询执行计划（QEP）产生与数据库查询绑定的前一个QEP相同的结果集。 接下来，本发明将前一个QEP和新的QEP之一识别为活动QEP，并自动收集前一个QEP和新的QEP之一的执行统计信息。 最后，本发明响应于完成执行统计的自动收集而自动选择前者QEP和新QEP中的一个作为活动QEP，选择活动QEP使得自动选择的QEP基于性能标准提供最佳执行性能 与自动未选择的QEP相比，基于执行统计信息选择活动QEP。

    Method and system for disjunctive single index access
    4.
    发明授权
    Method and system for disjunctive single index access 有权
    分离单索引访问的方法和系统

    公开(公告)号：US07725448B2

    公开(公告)日：2010-05-25

    申请号：US11848868

    申请日：2007-08-31

    申请人： Thomas A. Beavin ,  Patrick D. Bossman ,  John J. Campbell ,  You-Chin Fuh ,  Terence P. Purcell

    发明人： Thomas A. Beavin ,  Patrick D. Bossman ,  John J. Campbell ,  You-Chin Fuh ,  Terence P. Purcell

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30454

    摘要： A method for performing disjunctive single-index access on a database is disclosed. The method includes a query engine determining whether a first OR predicate and a second OR predicate map to a shared index. Responsive to the query engine determining that the first OR predicate and the second OR predicate map to the shared index, the first OR predicate and the second OR predicate are ordered in an ascending sequence. A first range of the first OR predicate is queued. A first row of the shared index is probed for the first range of the first OR predicate. Whether the first row is disqualified by the first OR predicate is determined. Responsive to determining that the first row is not disqualified by the first OR predicate, the row is reported in a result reporting structure. Responsive to determining that the row is disqualified by the first OR predicate, whether the first range of the first OR predicate overlaps a second range of the second OR predicate is determined, and, responsive to determining that the first range of the first OR predicate overlaps the second range of the second OR predicate, the row is checked against second range of the second or predicate.

    摘要翻译： 公开了一种在数据库上执行分离单索引访问的方法。 该方法包括查询引擎，确定第一OR谓词和第二OR谓词映射到共享索引。 响应于查询引擎确定第一OR谓词和第二OR谓词映射到共享索引，第一OR谓词和第二OR谓词以升序排列。 第一个OR谓词的第一个范围排队。 共享索引的第一行被探测到第一个OR谓词的第一个范围。 确定第一行是否被第一个OR谓词取消资格。 响应于确定第一行不被第一个OR谓词取消资格，该行将在结果报告结构中报告。 响应于确定该行被第一OR谓词取消资格，确定第一OR谓词的第一范围是否与第二OR谓词的第二范围重叠，并且响应于确定第一OR谓词的第一范围重叠 第二个OR谓词的第二个范围，该行是针对第二个或谓词的第二个范围进行检查的。

    QUERY REWRITE FOR PRE-JOINED TABLES
    6.
    发明申请
    QUERY REWRITE FOR PRE-JOINED TABLES 失效
    QUERY REWRITE用于预先加工的表

    公开(公告)号：US20130124500A1

    公开(公告)日：2013-05-16

    申请号：US13295984

    申请日：2011-11-14

    申请人： Thomas A. Beavin ,  Mengchu Cai ,  Ruiping Li ,  James A. Ruddy

    发明人： Thomas A. Beavin ,  Mengchu Cai ,  Ruiping Li ,  James A. Ruddy

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30448

    摘要： Various aspects of this disclosure are directed to receiving, by a computing device, a first table join query that may include a first group of table identifiers that identify the two or more tables. The computing device may determine whether the first table join query includes an outer join command. When the first table join query includes the outer join command, the computing device may compare the first group of table identifiers and a second group of table identifiers of one or more pre-joined tables to determine whether each of the first table identifiers matches at least one of the second group of table identifiers. The computing device may further determine whether a predicate associated with each table identifier matches a predicate associated with a matching second table identifier. When each of the predicates match, the computing device may rewrite the first table join query.

    摘要翻译： 本公开的各个方面旨在由计算设备接收可以包括识别两个或更多个表的第一组表标识符的第一表连接查询。 计算设备可以确定第一表连接查询是否包括外连接命令。 当第一表连接查询包括外连接命令时，计算设备可以比较第一组表标识符和一个或多个预连接表的第二组表标识符，以确定每个第一表标识符是否匹配至少 第二组表标识符之一。 计算设备还可以确定与每个表标识符相关联的谓词是否匹配与匹配的第二表标识符相关联的谓词。 当每个谓词匹配时，计算设备可以重写第一表连接查询。

    Query rewrite for pre-joined tables
    9.
    发明授权
    Query rewrite for pre-joined tables 失效
    对预连接表进行查询重写

    公开(公告)号：US08666969B2

    公开(公告)日：2014-03-04

    申请号：US13295984

    申请日：2011-11-14

    申请人： Thomas A. Beavin ,  Mengchu Cai ,  Ruiping Li ,  James A. Ruddy

    发明人： Thomas A. Beavin ,  Mengchu Cai ,  Ruiping Li ,  James A. Ruddy

    IPC分类号： G06F7/00

    CPC分类号： G06F17/30448

    摘要： Various aspects of this disclosure are directed to receiving, by a computing device, a first table join query that may include a first group of table identifiers that identify the two or more tables. The computing device may determine whether the first table join query includes an outer join command. When the first table join query includes the outer join command, the computing device may compare the first group of table identifiers and a second group of table identifiers of one or more pre-joined tables to determine whether each of the first table identifiers matches at least one of the second group of table identifiers. The computing device may further determine whether a predicate associated with each table identifier matches a predicate associated with a matching second table identifier. When each of the predicates match, the computing device may rewrite the first table join query.

    摘要翻译： 本公开的各个方面旨在由计算设备接收可以包括识别两个或更多个表的第一组表标识符的第一表连接查询。 计算设备可以确定第一表连接查询是否包括外连接命令。 当第一表连接查询包括外连接命令时，计算设备可以比较第一组表标识符和一个或多个预连接表的第二组表标识符，以确定每个第一表标识符是否匹配至少 第二组表标识符之一。 计算设备还可以确定与每个表标识符相关联的谓词是否匹配与匹配的第二表标识符相关联的谓词。 当每个谓词匹配时，计算设备可以重写第一表连接查询。